Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Certain Extremal Banach-Mazur Distances and Ader's Characterization of Distance Ellipsoids (2407.08829v2)

Published 11 Jul 2024 in math.MG and math.FA

Abstract: A classical consequence of the John Ellipsoid Theorem is the upper bound $\sqrt{n}$ on the Banach-Mazur distance between the Euclidean ball and any symmetric convex body in $\mathbb{R}n$. Equality is attained for the parallelotope and the cross-polytope. While it is known that they are unique with this property for $n=2$ but not for $n \geq 4$, no proof of the characterization of the three-dimensional equality case seems to have ever been published. We fill this gap by showing that the parallelotope and the cross-polytope are the unique maximizers for $n=3$. Our proof is based on an extension of a characterization of distance ellipsoids due to Ader from $1938$, which predates the John Ellipsoid Theorem. Ader's characterization turns out to provide a decomposition similar to the John decomposition, which leads to a proof of the aforementioned $\sqrt{n}$ estimate that bypasses the concept of volumes and reveals precise information about the equality case. We highlight further consequences of Ader's characterization, including a proof of an unpublished result attributed to Maurey related to the uniqueness of distance ellipsoids. Additionally, we investigate more closely the role of the parallelogram as a maximizer in various problems related to the distance between planar symmetric convex bodies. We establish the stability of the parallelogram as the unique planar symmetric convex body with the maximal distance to the Euclidean disc with the best possible (linear) order. This uniqueness extends to the setting of pairs of planar $1$-symmetric convex bodies, where we show that the maximal possible distance between them is again $\sqrt{2}$, together with a characterization of the equality case involving the parallelogram.

Summary

We haven't generated a summary for this paper yet.