The Convex Magnitude Conjecture
Posted by Tom Leinster
For a finite subset of , let be the matrix with -entry , and define to be the sum of all entries of .
For a compact subset of , define to be the supremum of over all finite subsets of .
The 2-dimensional case of the convex magnitude conjecture states that for all compact convex ,
I just came back from the British Mathematical Colloquium in Sheffield, where I spoke about the convex magnitude conjecture and attempts to settle it.
Click the picture for slides.
A couple of footnotes: first, the definitions above do make sense. That is, the matrix is always invertible, and the definition of the magnitude of a compact set is consistent with the definition for finite sets (which are, of course, compact too). Second, the definition of for compact isn’t the same as the one given in the slides, but it’s equivalent. Clickable references for everything are in the final slide.
Re: The Convex Magnitude Conjecture
Incidentally, several people remarked that the photo of Simon — which is a still from a video recorded some years ago — doesn’t really look like him. But then it was observed that the shadow Simon casts on the projector screen is somehow a much better resemblance. Simon’s reaction? “I’m like a shadow of my former self.”