It seems that I have unwittingly started an “open problem of the week” column here; certainly it seems easier for me to pose unsolved problems than to write papers :-) .

This question in convex geometry has been around for a while; I am fond of it because it attempts to capture the intuitively obvious fact that cubes and octahedra are the “pointiest” possible symmetric convex bodies one can create. Sadly, we still have very few tools to make this intuition rigorous (especially when compared against the assertion that the Euclidean ball is the “roundest” possible convex body, for which we have many rigorous and useful formulations).

To state the conjecture I need a little notation. Suppose we have a symmetric convex body in a Euclidean space, thus B is open, convex, bounded, and symmetric around the origin. We can define the *polar body* by

.

This is another symmetric convex body. One can interpret B as the unit ball of a Banach space norm on , in which case is simply the unit ball of the dual norm. The *Mahler volume* of the body is defined as the product of the volumes of B and its polar body:

One feature of this Mahler volume is that it is an affine invariant: if is any invertible linear transformation, then TB has the same Mahler volume as B. It is also clear that a body has the same Mahler volume as its polar body. Finally the Mahler volume reacts well to Cartesian products: if are convex bodies, one can check that

.

For the unit Euclidean ball one can easily compute the Mahler volume as

while for the unit cube or the unit octahedron the Mahler volume is

.

One can also think of as the unit balls of the norms respectively.

The Mahler conjecture asserts that these are the two extreme possibilities for the Mahler volume, thus for all convex bodies we should have

Intuitively, this means that the Mahler volume is capturing the “roundness” of a convex body, with balls (and affine images of balls, i.e. ellipsoids) being the roundest, and cubes and octahedra (and affine images thereof) being the pointiest.

The upper bound was established by Santaló (with the three-dimensional case settled much earlier by Blaschke), using the powerful tool of *Steiner symmetrisation*, which basically is a mechanism for making a convex body rounder and rounder, converging towards a ball. One can quickly verifies that each application of Steiner symmetrisation does not decrease the Mahler volume, and the result easily follows. As a corollary one can show that the ellipsoids are the only bodies which actually attain the maximal Mahler volume. (Several other proofs of this result, now known as the *Blaschke-Santaló inequality*, exist in the literature. It plays an important role in affine geometry, being a model example of an *affine isoperimetric inequality*.) Somewhat amusingly, one can use Plancherel’s theorem to quickly obtain a crude version of this inequality, losing a factor of ; more generally, though, I doubt that these sorts of “sharp constant” problems (for which one cannot afford to lose unspecified absolute constants) are amenable to a Fourier-analytic approach.

The lower inequality remains open. In my opinion, the main reason why this conjecture is so difficult is that unlike the upper bound, in which there is essentially only one extremiser up to affine transformations (namely the ball), there are many distinct extremisers for the lower bound – not only the cube and the octahedron, but also products of cubes and octahedra, polar bodies of products of cubes and octahedra, products of polar bodies of… well, you get the idea. It is really difficult to conceive of any sort of flow or optimisation procedure which would converge to exactly these bodies and no others; a radically different type of argument might be needed.

If one is willing to lose some factors in the inequality, then some partial results are known. Firstly, from John’s theorem one trivially gets a bound of the form . A significantly deeper argument of Bourgain and Milman, using the theory of cotype (which roughly speaking controls the size of long random sums in a normed vector space), gives a bound of the form for some absolute constant C; this bound is now known as the *reverse Santaló inequality*. A slightly weaker “low-tech” bound of was given by Kuperberg, using only elementary methods. The best result currently known is again by Kuperberg, who showed that

using some Gauss-type linking integrals associated to a Minkowski metric in .

In another direction, the Mahler conjecture has also been verified for some special classes of convex bodies, such as zonoids (limits of finite Minkowski sums of line segments) and 1-unconditional convex bodies (those which are symmetric around all coordinate hyperplanes).

There seem to be some other directions to pursue. For instance, it might be possible to show that (say) the unit cube is a *local* minimiser of Mahler volume, or at least that the Mahler volume is stationary with respect to small perturbations of the cube (whatever that means). Another possibility is to locate some reasonable measure of “pointiness” for convex bodies, which is extremised precisely at cubes, octahedra, and products or polar products thereof. Then the task would be reduced to controlling the Mahler volume by this measure of pointiness.

Some time ago I wrote some notes on the more elementary aspects of the above theory; it was intended for my book with Van Vu but eventually got deleted as the book was already too big and getting unfocused.

## 55 comments

Comments feed for this article

8 March, 2007 at 10:20 am

Andy DTerence, it is really valuable to have informal expository writing from an experienced mathematician, interspersing accurate descriptions of problems with your perspectives on why they are difficult and where various techniques are likely to apply (e.g., what you said about the strengths of analytic vs. algebraic number theory).

So thanks! Also, I think your readers will not be at all disappointed if you blog about math that is not new or open but that deserves to be better known –or for its Tomb Raider interpretation to be better known :) –or affords a good opportunity for learning/problem solving.

8 March, 2007 at 11:45 am

sirixI totally agree with Andy D. So, big thank You from me as well!

8 March, 2007 at 1:29 pm

D. EppsteinI found some references indicating that the conjecture was known to be true for d=2, but not for d=3. Is it still unknown in that case? Can it be proven that the local minimizing shapes for this conjecture are polyhedra, and if so are there any known constraints on the extremal polyhedra (e.g. they should have edges tangent to a sphere)? I am wondering whether enough constraints can be made on the form of the solution to reduce the problem to calculation over a finite number of cases in bounded dimensions; e.g., only over polyhedra with a bounded number of facets.

8 March, 2007 at 2:12 pm

Terence TaoAs far as I know, the d=3 case is open. It does seem intuitively plausible that local minimisers of Mahler volume should have lots of “flat” sides, and thus presumably be a polyhedron, and it may well be that any rigorous proof of that fact may even come with an upper bound on the complexity of that polyhedron. But I am not aware of any actual results in this direction. Note that as Mahler volume is an affine invariant, it is unlikely that the Euclidean sphere (or any other fixed shape) is involved unless one first normalises the body (e.g. to make the John ellipsoid Euclidean).

8 March, 2007 at 3:01 pm

Bo'az KlartagSuppose we remove the assumption that B is symmetric about the origin.

It seems reasonable to guess that the minimal mahler volume is now attained for a simplex whose barycenter is at the origin. The mahler volume of the simplex is roughly (e/4)^d times that of the cube.

This non-symmetric Mahler conjecture might be a little bit easier, since the set of conjectured minimizers is more approachable: I think it should be only simplices. Is there a process that a) preserves simplices whose barycenter lies at the origin b) does not increase the volume product and c) converges to a simplex?

Also, Santalo’s inequality holds for any centrally-symmetric set B, not necessarily convex (taking the convex hull just increases the volume and doesn’t change the polar), while for the Mahler problem, you actually need to use the convexity of B somehow. This might make the problem more difficult.

Finally, about Bourgain-Milman’s proof: I am not completely sure whether the type and cotype arguments are really the main ingredient there. At least the proof that that is given in Pisier’s book doesn’t have much relation to type and cotype.

8 March, 2007 at 6:15 pm

Terence TaoThanks, Bo’az, for the comments!

It does indeed look like the non-symmetric problem is going to be an easier one (and in fact embodies the idea that Mahler volume is minimised for “pointy” bodies even better than the symmetric problem), as it does look a little easier to make a process that converges to a simplex than to a cube/octahedron. Here’s one crazy idea: it suffices by limiting arguments to prove the claim for polyhedra. But every polyhedron is the projection of a simplex – perhaps a lifting argument (suitably normalising the Mahler volume as the dimension increases) might work? One may need to work with log-concave functions instead of polyhedra to get better behaviour with respect to projections, though one then has to figure out what the analogue of polar body becomes. (Young dual?)

In Kuperberg’s papers, one of the key ideas is to try to work with the product as a unified object sitting in “phase space” , and specifically inside the set . It may be that one may have to run the process at this level rather than purely in “physical space”. On the other hand, the above set is not convex, which creates a certain amount of difficulty.

I looked through Pisier’s book briefly – it seems he deduces the reverse Santalo inequality from Milman’s quotient-subspace theorem, which appears to be a slightly different route than the original Bourgain-Milman approach (but I don’t have the original papers handy right now to check).

8 March, 2007 at 11:06 pm

Gil KalaiDear all, This is a very beautiful problem and it is great that Greg Kuperberg had this recent breakthrough putting the bound at . Maybe, in view of Greg’s result hoping for a gap of is realistic.

The known extremal cases are called Hanner polytopes, and as explained in the post they are obtained from intervals symmetric around 0 by the operations: 1) Cartesian product, and 2) moving from P to its polar.

Hanner Polytopes are known or conjectured to be the only extreme examples to several other problems.

1) Attaining the maximum Banach-Mazur distance to the unit ball. (I am not sure about the precise status of this problem.)

This suggests to try to find the maximum of when there is an upper bound on the Banach-Mazur distance between and a unit ball.

2) The number of non empty faces (of all dimension; including P itself) of every Hanner n-dimensional polytopes is . This is conjectured (but embarrassingly not known) to be the minimum for centrally-symmetric n-dimensional polytopes.

3) Every Hanner polytopes has the property that if two of three translates have a point in common then all three have a point in common. (This was proved by Hanner himself.) A difficult result by Lima (I think, maybe with Hansen) shows that this Helly-type property characterizes Hanner polytopes.

(There is also a more general notion of weak Hanner polytopes arising in graph theory (Fulkerson, Chvatal, Hansen).)

9 March, 2007 at 11:25 am

Danny CalegariIs it really inconceivable that some flow might find exactly the desired minima?

It’s true that they come in interesting, complicated families, but aren’t

these families all symmetric spaces for the natural orthogonal group

action on the “space of convex bodies”? Couldn’t the flow be O-equivariantly

Morse-Smale, or whatever it’s called? Of course, there would (presumably)

be other critical points, i.e. products of cubes (or polar bodies thereof) with

spheres but presumably enough is known about the equivariant cohomology

of spaces with orthogonal group actions, and about the homotopy type of

the “space of convex bodies” to see if this makes sense. Just a question at

the “village idiot” level – what does grad M look like on the space of convex

bodies (thought of as a subspace of the space of smooth functions on RP^n)?

9 March, 2007 at 11:31 am

Bo'az KlartagYes, you’re right, maybe the problem is a little bit simpler with log-concave functions. Write for the Legendre transform of .

Then Santalo’s inequality is equivalent to

for any convex function for which the barycenter of the density is at the origin. The conjectured Mahler inequality is equivalent to

for any convex function . The function for which

when all , and that equals infinity elsewhere, should be a minimizer. That’s our “simplex”.

A nice thing with this log-concave formulation, is that the polar of the product is just the product of the polars. With convex bodies it’s a more messy. Also, denote by the minimal Mahler volume in dimension , for log-concave functions. Then we see that

. So, the desired conjecture would follow if we could show that . Does it somehow help for the “lifting”?

If we work in the phase space, the Mahler inequality we want looks a little bit like some exact uncertainty principle. So, maybe the Fourier analysis approach has still something to contribute? The Legendre transform is some degenaration of the the Laplace transform, in some vague sense. I don’t know.

9 March, 2007 at 11:34 am

Bo'az KlartagMy formulae have already failed on the html level, let alone mathematically.

Is there a way to test the way a formula would appear, before posting a comment?

9 March, 2007 at 11:52 am

Greg KuperbergHi folks. It is very, very nice to have this discussion about my recent paper.

As Terry alludes, the first important idea is to consider another body, the “diamond body” . I do not know how widely important this body is in convex geometry in general, but I it seems like a basic structure in convex geometry. If it is useful for the Bourgain-Milman theorem, then it may well be useful for some other problems.

I came up with , and the conjecture that its volume is minimized when is an ellipsoid, when I was a senior at Harvard. My dad suggested the name “the bottleneck conjecture”. David Kazhdan assigned me the Bourgain-Milman theorem for my senior thesis, and eventually I mentioned this idea to Joseph Bernstein, who was my reader. Bernstein estimated that my program had a 1 in 10 chance of working, but that these were actually very respectable odds for such an optimistic idea. Later I wrote two papers with partial results that were inspired by the conjecture that I really wanted to solve, but obviously fell short. I also found some “warning signs” in d=3 that suggested that my conjecture might not be true. I felt very discouraged and basically shelved the question.

In 2006, I figured that since differential geometry is in such great shape because of Perelman, I might as well give the “bottleneck” conjecture another try. It made all the difference that I had learned about linking integrals both from working on Kontsevich’s configuration space integrals, and from a paper of Gluck and DeTurck on the Biot-Savart law in . I had actually thought of using a homological method for the conjecture before — from examples such as Gromov and Thurston norms. But I had thought that it wouldn’t work because there are no

closeddifferential forms available for the argument. But, as the Gluck-DeTurck example shows, Gauss linking forms may be weakly closed double forms rather than closed forms.I spent the most time thinking about parabolic flows, as Terry says, to prove the bottleneck conjecture. Conceivably these could still work, but the structure of the linking form that appears in my paper is some evidence against. On the other hand, one of the two forms of the (generalized) bottleneck conjecture is still open, and who knows what methods it needs. I think that it is an interesting question in indefinite geometry.

Sorry to go on with all of the egotistical details of this question. As it happens, I was almost exactly twice as old when I proved the bottleneck conjecture as when I proposed it, 19 1/2 versus 39. I also did a key last step when I was in the hospital after surgery on my ankle, unable to sleep. I have no idea how I managed to accomplish anything in those circumstances. (“I thank Sutter-Davis hospital for its hospitality.”) During the 3 months of recovery (I am fully recovered now), I figured maybe I can prove another good theorem, but no such thing happened. Anyway it really has been a non-trivial personal journey.

9 March, 2007 at 11:56 am

Terence TaoDear Bo’az: I manually repaired the LaTeX. In order to get the ability to preview a post or comment it seems you need to get a wordpress account (which, incidentally, is trivial), but in the meantime the manual approach seems to work. The Legendre formulation looks quite promising, as does the trick of working in the asymptotic regime . At that level there may be an asymptotically equivalent formulation which is more tractable (e.g. involving entropy – but now I’m just throwing out buzzwords randomly). This sort of “tensor product trick” has proven effective in a number of other contexts.

The Mahler conjecture is indeed reminiscent of an uncertainty principle. I had discarded the Fourier approach in part because it seemed highly unlikely that any Fourier inequality would be optimised for, say, the indicator function of a cube or simplex (it’s more typical to see Gaussians or something as the extremisers). But now that we have an asymptotic formulation, which gives us a bit more wiggle room, this objection might start to disappear.

Dear Danny: Thanks for the comments! One minor quibble: the relevant structure group here is rather than , as Mahler volume is an affine invariant and not just a Euclidean invariant. There may indeed be an affinely equivariant Morse function which has the moduli space of Hanner polytopes as the minimal points, but it would be a rather strange function, in particular it is likely to contain some other exotic critical points. If one could actually write down a function which looked critical at these polytopes then one is probably already more than halfway done to solve the problem.

Incidentally, I think your “villages” are more mathematically literate than most :-) . Computing grad M in terms of the graphing function of the body is likely to be a bit messy because the polar body is given in this non-local manner. Using the log-concave formulation may be a bit more pleasant; it may be cleverer still to somehow “relax” the problem from a product of a body and its polar, to a more general class of objects (or functions) in phase space, in which it is easier to move around in a purely “local” fashion (both in physical space and in the dual space). It may be feasible at least to show using this method that a smooth,

strictlyconvex body cannot be a local minimum.Dear Gil: thanks for the post! The fact that there are indeed other quantities which are known or conjectured to be extremised at these polytopes does give one some hope. At the bare minimum it should allow one to “factor” the Mahler conjecture into two presumably simpler conjectures…

9 March, 2007 at 12:19 pm

Greg KuperbergAlso I should mention that I got a lot of very good negative advice in Madrid from differential geometers about just how non-trivial the moduli space of metrics and submanifolds are. Maybe they didn’t think of their advice as negative, but they had a lot of non-trivial things to say and I took it as warnings against naivete. There may be a PDE flow to solve the remaining open version of the bottleneck conjecture. But it is clear that optimizing flows don’t just “grow on trees”. Besides just parabolic flows, I was considering geodesics in moduli spaces of submanifolds of a manifold. The problem is that the formal Riemannian metric structure that you get on submanifolds of a Riemannian manifold is pathological in some ways.

Since there is no preview button here, I ended up with a TeX-o in my previous message, \otimes should be \times. [

Fixed now– T.]Terry points out that the set in phase space between the positive and negative unit hyperboloids is not convex, and he astutely points out that this makes the analysis harder. This is true, but actually I do not know whether is ever non-convex when is a convex body. By definition, the boundary of is the join (with straight line segments) of two necks and of the hyperboloids. I am not completely sure, but I sort-of see that the hyperboloids are contact manifolds, and that the necks are Legendrian submanifolds. If these necks are interesting objects of study, as I think they are, then the fact that they are Legendrian would give you a lot of geometry to work with. This is in addition to what I prove in the paper, that are spacelike and timelike submanifolds of the hyperboloids as well as topological cores.

By the way, Terry uses my somewhat unlucky old notation for the Mahler volume, . This is almost the same notation as a different constant defined by Milman. In my new paper I write for the Mahler volume. The formula that Terry gives is in my paper, but it is very slightly off from the real bound:

Gil points out that the Hanner polytopes have the same Mahler volume as the cube. Hanner polytopes also seem special in my paper, because they have the property that . I know of no other convex bodies with this property. Very optimistically, this is a hint at completely proving the Mahler conjecture. The whole point of my paper is that approximately grows as shrinks, despite the fact that the former is a subset of the latter.

9 March, 2007 at 12:34 pm

Greg KuperbergBy the way, to answer David and Danny, I am optimistic that there is a variational proof of the Mahler conjecture in 3 dimension from a Morse perspective. In fact, I would be tempted to ask David and Danny themselves about the geometry relevant to this approach.

You shoud look at the proof of the Mahler conjecture in 2 dimensions. The Mahler volume of a polygon is concave down as you pivot a pair of opposite sides. If you try to maximize the Mahler volume, the polygon limits to a regular polygon as you repeatedly pivot all pairs of sides. If you try to minimize it, then you end up losing a pair of sides. This shows you that parallelograms have the least Mahler volume among centrally symmetric polygons.

I believe that this proof can work in 3 dimensions. There is a happy theorem that the moduli space of polyhedra in 3D with any fixed combinatorial type is homotopy equivalent to SO(3). (Of course you have to mark the polyehdron to eliminate any symmetries.) This theorem is still true in the centrally symmetric case, and it is (a small) part of the grand scheme of Thurston’s ideas. I conjecture that Mahler volume is “Morse trivial” on any such moduli space, and that with a suitable metric, the downward gradient flow must eliminate an opposite pair of edges of the polyhedron. As Terry says, the right argument would be fully GL(3,R)-invariant.

Unfortunately, the moduli space of a polytope type in higher dimensions can be anything. Or it may not be so unfortunate, if you believe that 3D is a special world that yields special arguments.

9 March, 2007 at 2:18 pm

Terence TaoIncidentally, the proof of Mahler’s conjecture in 2D seems to first appear in

K. Mahler, Ein Minimalproblem fur konvexe Polygone, Mathematica (Zutphen) B, 118-127 (1939);

it unfortunately predates MathSci (and certainly MathSciNet).

Several people have asked me now for the ability to preview comments. I hear that there is some way to change the wordpress settings to do so, but I was unable to locate one. If there are any wordpress experts out there who could help, I would greatly appreciate a tip :-) .

9 March, 2007 at 3:21 pm

Greg KuperbergScott Aaronson uses WordPress and found a way to have instant preview.

To answer Danny’s question about gradient flows: Unless you choose a Riemannian metric on the space of convex bodies, the Mahler volume does not have a gradient, but rather a differential which is a 1-form. There are all too many choices for this metric; it is non-trivial to come up with one that doesn’t look like trash. As Terry noted, the Mahler business is GL(n,R)-invariant, so it already looks problematic if you make a metric on convex bodies by modelling them as polar functions on a round sphere.

I have looked for metrics of this sort not to minimize Mahler volume, but rather . Unlike Mahler volume, this volume is minimized for ellipsoids. Nonetheless, I never found a useful downhill flow. The inequality that I did find has an oscillatory factor that makes me wonder whether there is any reasonable flow-based proof of my result.

Well, you can make interesting uphill flows for Mahler volume using infinitesimal Steiner symmetrization. Such a flow is not unique and is at best O(n)-invariant, but I think that it still works. However, I don’t think that anything good happens if you try to reverse such a flow. It should be parabolic in the uphill direction (or parabolic-ish since it is non-local), so that the downhill flow would be pathological.

9 March, 2007 at 5:23 pm

Greg KuperbergAlso, Dave Bacon uses WordPress and somehow has a preview button.

9 March, 2007 at 6:27 pm

Terence TaoDear Bo’az,

I’m increasingly excited about the Fourier-analytic (or Laplace-analytic) approach to the problem, coupled perhaps with the idea of working in the asymptotically high dimensional regime to deal with losses.

If f is convex and t is large, then the Laplace transform of is essentially , ignoring lower order corrections. (The slogan here is that Legendre is the “zero-temperature” limit of Laplace; rather perversely, one can also say “tropical” instead of “zero-temperature”.) If I wave my hands and mumble either “Wick rotation” or “stationary phase”, then there is some sort of similar statement for the Fourier transform instead of the Laplace transform. In which case Bo’az’s formulation of Santalo’s inequality begins to look quite a lot like Beckner’s sharp Hausdorff-Young inequality in the limit as and . This also fits with the ball being the extremiser, given that the Gaussian is the extremiser for Beckner’s inequality. It also fits well with the factor.

Now to get back to Mahler’s conjecture, we would need some reverse Hausdorff-Young inequality. This isn’t available in general, of course, but we have a lot of convexity and positivity to exploit. An obvious thing to do is now try to flow along the temperature parameter t. If one looks at, say and differentiates in t, one begins to get expressions which look like the entropy uncertainty principle, and it is quite likely that indeed one could get yet another proof of Santalo’s inequality from that principle. So now one needs some sort of reverse entropy uncertainty principle for Laplace transforms of log-concave functions… there is a hope that having differentiated along the temperature, one has “linearised” the problem enough that some new techniques (log Sobolev inequalities??) might come into play…

What is appealing about this whole approach is that everything is set up to be invariant under the three symmetries of the problem: linear transformations, polar duality, and Cartesian products.

9 March, 2007 at 7:44 pm

Greg KuperbergDespite having written three papers on the Mahler conjecture, I apparently never thought properly about the asymmetric case. I had thought that it was off from the symmetric case by a factorial factor.

Milman mentioned to me by e-mail that my inequality is false for asymmetric convex bodies. But I didn’t realize that it’s a close call. My lower bound is roughly times the Mahler volume of a cube. As Boaz says, the Mahler volume of a simplex is roughly times that of a cube. So it’s a matter of replacing by !

I have to then agree that the Hanner polytope story could be taken as a red herring. There are some theorems in convex geometry where people can show that a simplex is the worst case. For example, Keith Ball has shown that a simplex has the worst isoperimetric constant among convex bodies, when each body is placed in its best affine position.

I just scrambled to check what my inequality implies for asymmetric convex bodies. I can’t think of any better idea than to convert from asymmetric to symmetric. Rogers and Shephard proved in 1957 that if is convex and is its difference body, then

with equality for simplices only. Using the difference body, we get that the asymmetric Mahler conjecture is true up to a factor of roughly .

9 March, 2007 at 7:58 pm

Greg KuperbergTerry and Boaz are masters at combining approximate estimates, whereas my paper has just a single, elementary approximation followed by a geometric argument. The point of the approximation is what I call “table-turning” in the paper. Given a statistic of convex bodies which is supposed to be maximized for ellipsoids and minimized for less nice shapes, maybe you can find another statistic that is minimized for ellipsoids instead, but nonetheless gives you a good lower bound for . Of course you can also reverse all of the inequalities in this approach.

Here then is another table-turning conjecture. Terry already mentioned the elementary relation

which is important in my paper. In any fixed dimension, then, which maximizes the average value of on ? Several people have conjectured that it is the ellipsoid, at least in the symmetic case. So is there some nice flow or symmetrization that proves this? It would imply the well-known isoperimetric constant conjecture, moreover with a good value of the constant.

If the average value is too difficult, what about just the integral? I have the impression that you can prove that the ellipsoid maximizes the integral of just by standard Steiner symmetrization. This would be a warm-up to the harder problem of maximizing the average value. (Maybe it is only a luke-warm-up. Even so, it would be a start.)

9 March, 2007 at 8:42 pm

Terence TaoUgh. My previous post was full of rather bad sign errors, and hence contains a large fraction of rubbish (particularly all the stuff involving Hausdorff-Young, and thence the entropy uncertainty principle). :-( I still feel there should be some sort of “detropicalised” version of the Mahler conjecture which involves the Laplace transform rather than Legendre, but I will have to think much more carefully to try to formulate it properly.

10 March, 2007 at 7:27 am

Terence TaoOK, I think I weeded out the sign errors. Given an exponentially decaying log-concave function , define the Laplace transform by

Suppose we have the Hausdorff-Young like inequality

where (!), , and o(1) is a quantity depending only on n and p which goes to zero in the joint limit .

Note that p is

lessthan 1, so the right-hand side norm is only a quasinorm, but what is weirder, p’ isnegative, so the left-hand side norm is really a quasinorm of the reciprocal of the Laplace transform rather than the Laplace transform itself. (It kind of makes sense, since the Laplace transform of a non-negative exponentially decaying function is going to be exponentially growing, in general.) Such an inequality, if true, would have to heavily exploit the log-concavity of F. On the other hand, the inequality is consistent with affine symmetry and Cartesian products, and we shall soon see that it has the Mahler conjecture as its tropical limit, so it is not immediately false.Anyway, if we have such an inequality, we can apply it to for a convex f which grows superlinearly at infinity. Then the Laplace transform has the asymptotic and so a little bit of computation in the asymptotic limit then gets

and the o(1) term can then be eliminated by taking Cartesian products and passing to the asymptotic limit (this step can be combined with the preceding asymptotic limit to create a joint limit). The requirement that f grow superlinearly at infinity can then be removed by the usual limiting argument.

I’m not entirely sure that the Hausdorff-Young formulation is better, now that I see the negative norms, but it certainly looks rather different.

p.s. Regarding one of Gil’s remarks, if one can get within an epsilon of the Mahler conjecture, then one automatically gets the conjecture itself by the “tensor power trick”. Indeed if one knew that

for any , then by replacing B with the Cartesian product one easily sees that for any k. Taking roots and then letting k go to infinity, and

thenletting go to zero, we obtain the Mahler conjecture.10 March, 2007 at 8:32 am

Greg KuperbergTerry: Since you are interested in detropicalizations, there is a published detropicalization of the Blaschke-Santalo inequality due to Lutwak and Zhang. Their paper is Blaschke-Santalo inequalities.

On a substantially unrelated topic, if you are just generally a fan of p-norm inequalities, I have a quantum version of the pigeonhole principle which takes the form of a Holder inequality with complementary norms. It is Theorem 4.1 in quant-ph/0203105. The form of the pigeonhole principle that I generalize says that if you write a symbol from an alphabet of size n in a shorthand alphabet of size k < n, then you cannot expect to decode it correctly with probability better than k/n.

10 March, 2007 at 10:23 am

Greg KuperbergAlso, another non-mathematical comment: The Bourgain-Milman theorem was once mentioned in the New York Times! A Gina Kolata article in 1994 on the Fields Medalists said the following:

10 March, 2007 at 2:10 pm

Greg KuperbergAlso, an emendation to my previous comment about the conversion from the asymmetric case to the symmetric case: What I said before is not optimized. Instead of the difference body , you can use the symmetrized body . The dual norm induced by is then the average of the norms induced by and . So it is easy to see by concavity of the integrand that

Thus, using the Rogers-Shephard inequality, the simplex has the least Mahler volume among asymmetric convex bodies up to a factor of .

11 March, 2007 at 7:32 am

Gil KalaiHow small can Vol(K) (equivalently M(K)) be for a self-dual centrally symmetric convex body? Namely for a body K such that the polar of K equals to -K.

11 March, 2007 at 10:20 am

Greg KuperbergGil: Given two symmetric convex bodies and , you can define the p-norm Cartesian product . If and are dual, then is isodual. This construction is the best that I can think for your question. To optimize the construction, you should to let (equivalently ) be a Hanner polytope.

I do not know how much this construction says about the full Mahler conjecture. However, it does mean that the Bourgain-Milman theorem for isodual symmetric convex bodies is equivalent to the theorem for all symmetric convex bodies. A similar consideration tells you that the Bourgain-Milman theorem implies the bottleneck conjecture for symmetric convex bodies up to an exponential factor. (Of course the converse implication motivated the botttleneck conjecture.) Happily the bottleneck conjecture turns out to be true with no fudge factor.

13 March, 2007 at 2:10 pm

GilWell, we have here (HU; Jerusalem at our local IAS) a special semester (March-August) on Polytopes, complexes and connections to combinatorics and topology and we devoted the first seminar to a lecture by Semyon Alesker on Greg Kuperberg’s ingenious and mysterious proof. It was very nice!

Michael Larsen and Ayelet Lindenstrauss came to the lecture and to add to Greg’s nice personal account above, let me mention that Michael even remembered some of this stuff from the time when he and Greg studied in Harvard and worked on their junior thesis (it should be in plural thesise (?) thesa(?), whatever).

Semyon being the speaker inspired Imre Barany and me to ask about minimizing the product of other mixed volumes (say surface area). Here, in the plane the circle bits the square. Tom Braden and Victor Batyrev who will be speaking along with Sasha Zvonkin on Sunday, in the little workshop on toric varieties, polytope duality, and relation to Koszul duality and mirror symmetry, where also in the lecture.

So it looks that relations between metric/combinatoric/arithmetic and their combinations of convex bodies and their polars will still occupy us for a while. For the local combinatorialists like Ehud Friedgut and Irit Dinur this was the third combinatorics seminar of the week. And the CS theory seminar is yet to come tomorrow.

We had fierce competition from the little conference at the same time in the adjacent lecture hall on “sex, biology and game theory” ! followed by a lecture on “what is a language”. Tough!

13 March, 2007 at 2:33 pm

Greg KuperbergMichael Larsen and Ayelet Lindenstrauss came to the lecture and to add to Greg’s nice personal account above, let me mention that Michael even remembered some of this stuff from the time when he and Greg studied in Harvard and worked on their junior thesis (it should be in plural thesise (?) thesa(?), whatever).That has to be a little out of order, because Michael was a senior at Harvard when I was a freshman. He was in graduate school at Princeton when I started this work. But I probably did talk to him about it later; in the 1990s I cared about the problem a lot.

27 January, 2009 at 12:07 am

Gil KalaiWhile the conjecture that every centrally symmetric polytope has at least as many non empty faces as a Hanner polytope () is still open, stronger conjectures that I made were disproved by Sanyal, Werner and Ziegler http://front.math.ucdavis.edu/0708.3661 . The so called “Hansen polytopes derived from perfect graphs” discussed in the paper are of interest also in the context of Mahler’s conjecture.

28 January, 2009 at 8:24 am

Mathematics, Science, and Blogs « Combinatorics and more[…] Michael’s post triggered Tim Gowers to present his thoughts about massive collaboration in mathematics, and this post is also very interesting with interesting follow-up remarks. Tim Gowers mentioned the n-category cafe as a place where a whole research programme is advanced on a blog. Terry Tao mentioned comments on posts on his open-problems series as having some value. He mentioned, in particular, the post on Mahler’s conjecture. […]

15 February, 2009 at 8:33 pm

fedjaReturning to the original topic: to show that something like the cube is a local minimizer is actually not hard at all. The whole difficulty lies in the global minimization. The reason is, of course, that the conjectured minimizers are not smooth points of the functional but rather “corner points”, which allows one to get away with making rather rough estimates for the first differential. One should “factor out” the neighboring parallelepipeds, of course, to see this corner effect, but just taking the circumscribed parallelepiped of the least volume turns out to be good enough. If there is enough interest in the local minimum problem and somebody would like to see the details, we (I, Ryabogin, Zvavitch, and Petrov) will make a small preprint and put it on the archive; otherwise just take my word for it…

By now we have at least 3 old “elementary” geometric problems when the assumed extrema have been shown to be local ones but not global ones yet: Reinhardt’s problem about the symmetric convex plane domain with the lowest density of the densest lattice packing, Erdos’ lemniscate problem, and Mahler’s conjecture (all three being the corner extrema). It’s high time to finish off at least one of them…

2 March, 2009 at 10:06 am

Gil KalaiHere are links with statements of the problems fedja referred to:

Erdos lemniscate problem:

http://en.wikipedia.org/wiki/Polynomial_lemniscate

Reingardt’s problem

http://www.springerlink.com/content/g21630q36l2w1082/fulltext.pdf?page=1

(Yes, if the local minimality argument is not written elswhere, it would be nice and of interest to have it on record.)

6 May, 2009 at 4:56 pm

fedjaOK. Here is the arXiv link: http://arxiv.org/abs/0905.0867. If you have trouble following the link, the authors are Nazarov, Petrov, Ryabogin, and Zvavitch and the title is “A remark on the Mahler conjecture: local minimality of the unit cube”. This should be enough to locate the paper using the arXiv search option.

I cannot guarantee it has never been written elsewhere though I’m pretty sure it has never been published in a refereed journal (MathSciNet search did not produce any result). On the other hand, given the simplicity of the proof, it is quite conceivable that many other people found the result earlier but just discarded it as too trivial to publish.

15 May, 2009 at 9:23 am

fedjaSomehow for the last week Mahler’s conjecture didn’t want to go out of my poor head. I thought of using some harmonic analysis/several complex variable tools but, unfortunately, the only thing I (or rather we, because I consulted my friends a lot during this attempt) could do was yet another proof of the Bourgain-Milman theorem with constant for the symmetric case, which is 3 times worse (on the logarithmic scale) than Kuperberg’s estimate (though our constant for the non-symmetric case may be slightly better than what he posted above; I need to check the computation to tell for sure). The proof is rather “high-tech” because it relies on the Hormander theorem on the existence of solutions of the d-bar problem with good -estimates. Like Kuperberg, we found the exact minimum of some other quantity that equals to the Mahler product volume up to an exponential factor. Unlike him, we have a quantity that is minimized by the cube, not by the ball…

15 May, 2009 at 2:34 pm

Greg KuperbergI’m impressed! Of course it’s a new result, even if the application to the Bourgain-Milman theorem is slightly below the best current bound.

Can you also solve the variance conjecture, say up to a constant? That is, the conjecture that I posted in the comment on 9 March, 2007 at 7:58 pm. Maybe I understated the significance of that conjecture. The variance conjecture plus the Bourgain-Milman theorem imply the isotropic constant conjecture, which is equivalent to the slice conjecture. The isotropic constant conjecture implies Milman’s M-ellipsoid theorem, because it would mean that the Legendre ellipsoid is an M-ellipsoid. The M-ellipsoid theorem implies Milman’s subquotient theorem.

So if you found a short proof of the variance conjecture, or the conjecture up to a good constant, it would imply a nest of important conjectures and theorems in asymptotic geometry, with good constants.

I have a paper that I have been meaning to write up on the variance conjecture. I can show that an ellipsoid is a local minimum in the centrally symmetric case. This is not an earth-shaking result, but it seems good enough to me for a publication. The same calculation shows that the ellipsoid is *not* a local minimum with respect to asymmetric perturbations; the only culprit is harmonic perturbations of degree 3.

Meanwhile David Alonso-Gutierrez, in arXiv:0710.5907, shows the following: If A and B are two fixed centrally symmetric convex bodies, then the variance constant for the p-norm product body A x_p B is largest when p=2.

15 May, 2009 at 2:50 pm

Greg KuperbergBy the way, Fedja, some years ago I also thought about Reinhardt’s problem. First of all, there is a remarkable theorem (Fejes Toth) that the densest packing of a 0-symmetric convex body K in the plane is a lattice packing, and that you make the lattice packing by looking at the smallest centrally symmetric hexagon that contains K. Suppose that the smallest such hexagon has unit area and suppose that K has the least area among all such bodies. Then every point on the boundary of K is a kissing point of some circumscribing centrally symmetric hexagon with area 1. These remarks about K are due to Tammela, and I believe led to the conjecture for the best K, a certain rounded octagon.

Now the set of centered ellipses in the plane with unit area is isomorphic (as a homogeneous space) to the hyperbolic plane. The set of these hexagons is then a certain circle bundle over the hyperbolic plane, one which is the sixth power of the tautological circle bundle given by the ellipses. So a Tammela body K, i.e. one which is circumscribed by a circle of symmetric hexagons with the same area, defines a certain loop in the hyperbolic plane, and the loop lifts to this circle bundle over it. If I remember correctly, I checked that the area encircled by this loop determines the area of K. Tammela’s candidate for K is morally a square. I do not know whether it is a geometric square, or whether there is some other condition to define curved “sides”. (By analogy, a Rouleaux “triangle” is not really a triangle. I am not sure whether this shape is a hyperbolic square or merely a “square”. I should check.) It seems very possible that there is a variational argument for all such shapes in the hyperbolic plane to reduce the number of sides to 4.

15 May, 2009 at 6:53 pm

fedjaThanks, Greg! The variance conjecture seems very interesting, indeed, but you need to be much more careful with it than with the Bourgain-Milman theorem. So, at this point I have no really good idea of how to approach something like that. Here is one more question I thought of recently (without much success so far) that is somewhat related to this circle of problems. Suppose is origin-symmetric and you have two sets and such that for all . Can we conclude that with some ? If we can, what is the best possible value of ?

16 May, 2009 at 7:21 am

Greg Kuperbergfedya: I suspect for your question that you wanted something good to happen for every .

On the other hand, if is the best Bourgain-Milman constant (in their normalization, relative to a round ball), you obtain , so that is bounded away from 1 when .

I had some misattributions in my comments about Reinhardt’s problem. The result that there is a critical hexagon touching every point on the boundary of this convex body C is actually due to Mahler, not Tammela. You obtain a “Mahler curve” in the hyperbolic plane. I think that this curve does not have to be convex or even embedded, rather it satisfies the weaker condition that it cannot bend more than a horocycle bends. I did once calculate that the area enclosed by this curve determines the area of C, but this should be rechecked.

16 May, 2009 at 9:35 am

Greg KuperbergSigh, my comment got chopped because I had an inequality in an equation, which interfered with the HTML.

fedya: I suspect for your question that you want for every . But I think that I have a counterexample when . Namely, let be a cube, so that is a cross-polytope. Then the typical point in is at distance roughly , while the typical point in is at distance roughly . So let be the intersection of with a round ball of radius more than the radius of a typical point, and the same for .

16 May, 2009 at 12:40 pm

fedjaYes, you’re right! OK, this means that I’ll have to do something else if I want to improve the constant in our approach. The main loss there comes from replacing the Legendre transform of the characteristic function of a convex body with its Laplace transform, so it would be interesting to try to compare the two directly. Anyway, all these words of mine probably sound like I’m speaking gibberish now. This will certainly change after you see the details, so let me write the proof down and show it to you before making any further comments…

16 May, 2009 at 1:23 pm

Greg KuperbergA remark concerning Laplace and Legendre transforms: There is a generalization of duality of convex bodies to duality of log-concave functions, as Boaz Klartag mentions above. Two log-concave functions are dual if their logarithms are Legendre transforms of each other.

A 0-symmetric convex body has a 1-parameter family of interpretations as a log-concave function. Namely, if is the norm corresponding to , one can let for any . Then the dual function is the same expression for , except with replaced by its reciprocal complement . If Legendre or Laplace transforms are useful to you, you may obtain better results (or at least a clearer explanation) if you first convert to a log-concave function, and more specifically if you take in order to make the conversion self-dual.

It seems interesting that the statement of the 0-symmetric Mahler conjecture simplifies in the setting of log-concave measures. Namely, it says that if and are dual log-concave functions, then the product of their integrals is at least . Likewise the log-concave Santalo inequality says that the product is at most . These statements are equivalent to the usual versions for convex bodies. Also, the log-concave analogue of an ellipsoid is a Gaussian. It seems interesting that their logarithms form a linear subspace in the cone of all concave functions. However, I haven’t seen a way to make good use of these simplifications.

18 May, 2009 at 6:34 am

Mark MeckesA comment on some of the terminology above, which had me confused for a while. Greg refers to the problem of maximizing the variance of the random variable , where is uniform in and is uniform in , as the “variance conjecture”.

On the other hand, it has recently become common to refer to the problem of maximizing the variance of (with appropriate normalization on ) as the “variance hypothesis” in convex geometry (see e.g. Conjecture 1 here. There is no direct relationship between these two problems that I see, but they do belong to the same broad circle of ideas.

18 May, 2009 at 7:44 am

Greg KuperbergMark: Good point.

There seems to be a proliferation of variances associated to random points in convex bodies, and conjectures bounding them. They certainly can’t all be called “the variance conjecture” or “the variance hypothesis”. Maybe none of them should have that name. However, the conjecture that you cite appeared in Giannpoulos’ notes in 2003, so you could certainly then argue that the name is taken.

Besides, the conjecture that I am promoting (which was already implicit in Keith Ball’s work), if interpreted up to a constant factor, is simply equivalent to the isotropic constant conjecture and the slice conjecture. So maybe a better name is “self-dual and round form of the isotropic constant conjecture”.

18 May, 2009 at 9:46 am

Mark MeckesGreg: Given the vagueness of “variance hypothesis” and “variance conjecture”, it would probably be best not to use either name for any of these conjectures. But I think the name is already stuck for the conjecture I mentioned.

6 July, 2009 at 4:32 am

NathanaelNerode“I am fond of it because it attempts to capture the intuitively obvious fact that cubes and octahedra are the “pointiest” possible symmetric convex bodies one can create.”

This seems to me to require deeply unintuitive definitions of either “pointiness” or “symmetric”. After all, a regular tetrahedron is very pointy (occupying a smaller percentage of its bounding sphere than a cube) and very symmetric (many non-identity rigid transformations which map it to itself). Using an alternate definition of pointiness, having the “most points”, the icosahedron is pointier than the cube… so this conjecture, interesting though it is, fails to capture anything intuitive at all.

6 July, 2009 at 11:05 am

Qiaochu Yuan“Deeply unintuitive” is a little harsh, isn’t it? “Symmetric” here means “fixed by negation” (although I agree that this isn’t obvious if you aren’t used to this meaning of the word – it’s an overloaded word), which a regular tetrahedron isn’t. Your first implicit definition of pointiness works fine.

12 July, 2009 at 11:21 am

Vitali Fest « Combinatorics and more[…] while floating near Semyon Alesker in the Dead Sea we saw a large cluster of experts on the Mahler conjecture- Shlomo Reisner, Dimitry Ryabogin and Artem Zvaivichand — and we decided to swim towards […]

20 January, 2011 at 3:36 pm

507- Problem list (III) « Teaching blog[…] Mahler’s conjecture. Possibly related posts: (automatically generated)507 – Problem list (II)Lists Part (III)Future Let’s Plays List…Who’s The Coach? Part DEUX 43.614000 -116.202000 […]

26 August, 2012 at 12:29 pm

507- Problem list (III) « A kind of library[…] Mahler’s conjecture on convex bodies. […]

11 December, 2012 at 7:49 pm

fedjaA small but very nice update. Artem’s student Jaegil Kim finally proved that all Hanner polytopes give you local minima. See http://arxiv.org/abs/1212.2544. Comments are welcome :).

24 January, 2014 at 11:02 am

Samuel ReidI have a proof of the Mahler conjecture which I have uploaded to arXiv. I have been working for about 6 months on the conjecture and managed to solve it with an insight regarding the representation of d-dimensional metric quantities in terms of 2d-dimensional metric quantities.

E-mail me if you are interested in the proof before it appears on arXiv under

“Minimizing the Mahler Volume of Symmetric Convex Bodies”.

24 January, 2014 at 2:11 pm

Samuel ReidWell, I realized I claimed an inequality that I still need to prove, so I will try and fix it and then make a comment regarding my correct or failed proof strategy after I have done more work.

7 August, 2019 at 9:05 pm

Johan AspegrenIt has been proved that if the isotropic constant conjecture/Bourgain`s slicing conjecture is fails, the Mahler conjecture fails, and an exact bound to the isotopic constant implies the Mahler conjecture. I have proved the isotropic constant conjecture. The proof can be found in here: http://vixra.org/pdf/1810.0303vA.pdf

12 August, 2019 at 7:35 am

Johan AspegrenThis reply of mine contained some thinkos/typos. An exact bound should be exact bound with respect to dimension. I couldn`t find reference for the first claim, but it is quite easy to proof. This is a bit risky for me, because there seems to be no edit button and I can`t see my comment in it`s final form as in some other blogs. Let be an isotropic unit ball. Then the isotropic constant is

The proof works the same if is the isotropic version of with Let be the euclidean unit ball. Thus,

as it is well known that for any