Tag Archives: stories on free probability

The Story of Two Entropies

Open AI addressed also another one of the big questions in free probability, namely the relation between the two versions – microstates and non-microrstates – of free entropy. Although the negative solution of Connes embedding problem already had the consequence that they cannot be equal in general, it was still possible that in the Connes-embeddable subclass they could agree. However, AI showed us a counter-example where they are different. This might not have been so unexpected as the isomorphism of the free group factors, but is still a major result, which we should understand better.

And again, this understanding is possible, by a very nice recent preprint by David Jekel.

Some More Stories Around Free Probability

I am still quite a bit paralyzed by the overwhelming AI-supported progress in mathematics in general and in our field in particular. I also feel a bit too old and too rusty on technical details for working out by myself the details of what is going on. But luckily enough, there are many young(er) and more energetic people in our subject which bravely take on this task and give us human versions of the progress.

What I want to contribute to the present situation is to keep track of a few stories on progress on some of the problems which I find interesting. This list of stories might increase over time, but it should not become a huge collection of everything, but focus on what we perceive as the core problems of free probability. Storytelling by guests is also welcome.