Daniel Tubbenhauer on More Interesting things about Representations of Lie Groups

It  turned out the whole theory of Fourier Series is one particular instance of a general theorem about Representations of Compact Groups. See Peter-Weyl Theorem and Pontryagin duality.

See also Dual Spaces, Lie Groups and Conservation Laws. 

Subscribe to Daniel Tubbenhauer. 

Sam Ritchie on a computer algebra system https://emmy.mentat.org/ inspired by Functional Differential Geometry by Gerald Jay Sussman and Jack Wisdom. 


Subscribe to Strange Loop.

Owen Lynch with some ideas on how to do computer algebra that get at this idea of generic operations that Gerald Sussman likes so much, and I think they are also why he doesn't have much time for statically typed languages. In a sense types are least fixed points and generic operations and general algebras are greatest fixed points. See How Could One Unify CMU and MIT and David Jaz Maiers - Compositionality via 2-algebra.


See his blog post Algebraic geometry for the working programmer and https://github.com/AlgebraicJulia/Gatlab.jl.

Subscribe to Topos Institute. 

Comments

Post a Comment

Popular posts from this blog

Steven Johnson - So You Think You Know How to Take Derivatives?

Image
A derivative is linearisation, and differential calculus is essentially linear algebra, ...  See  Freya Holmér - Why Can't You Multiply Vectors?  and  Freya Holmér on Continuity of Splines . See also the MIT OCW page:  Matrix Calculus For Machine Learning And Beyond  (Alan Edelman, Steven G. Johnson) Subscribe to The Julia Programming Language . Alan Edelman talking about expressing mathematics as computer code. The idea is that you can use computer languages to communicate mathematical ideas precisely to other people. See my comments about functional programming languages here:  https://prooftoys.org/ian-grant/hm/ Subscribe to TEDx Talks .
Read more

How Could One Unify CMU and MIT

Image
I mean, how to get the best of the two different philosophies of computation. One is based on typed programming languages and the other on engineering with diagrams . This is about practical computing and the cost and feasibility of software development in general. Here is the problem: We have a lot of algorithms which can all be described abstractly using some sort of pseudocode, or perhaps using some particular language (usually Python!). These algorithms are often well-studied and a lot is known about them in terms of their computational complexity in time and space. Substantive practical software systems invariably employ many such algorithms, often implemented in libraries with more or less well-specified APIs. But very few of these libraries are capable of interoperating because they are either packages written in some specific programming language like Java or Haskell, say, or they are written in C and used as object code, or they are written in an interpreted language like Sc...
Read more

Tensor Fields and Simplicial Complexes

Image
Listening to Freya Holmér last night I started to get glimmers of an idea I had long ago about how to represent vector spaces in computational processes using this recursive abstract type :  abstype 'a point = POINT   of {getx :  'a vector,       diff :  'a point -> 'a point,       move :  'a point -> 'a point,       scale : 'a -> 'a point,       proj :  'a point -> 'a} with    fun new i (op +) (op -) (op * ) dot =    let fun self x =  POINT       {getx = x,        move = fn (POINT pr) =>           (self (x + (#getx pr))),        diff = fn (POINT pr) =>          self (x - (#getx pr)),        scale = fn i =>          (self (x * i)),        proj = fn (POINT pr) =>     ...
Read more