Download lean/docs/088.md from roseking/openAI-math-dataset: direct link, hf CLI and curl.
- Browser
- Download file 1.96 kB
-
https://huggingface.co/datasets/roseking/openAI-math-dataset/resolve/main/lean/docs/088.md
- Command line
-
hf download hf://datasets/roseking/openAI-math-dataset/lean/docs/088.md
-
curl -L -o 088.md https://huggingface.co/datasets/roseking/openAI-math-dataset/resolve/main/lean/docs/088.md
Sharp projection-body inequalities and a counterexample to simplex maximization
The following describes the scope of the Lean formalization related to the following accompanying paper(s):
- Petty’s projection-volume conjecture in dimensions at least four
- A product counterexample to the simplex maximum for projection-body volume
Scope
Petty's projection-volume conjecture predicts
$\displaystyle \frac{|\Pi K|}{|K|^{n-1}}\ge \kappa_{n-1}^{n}\kappa_n^{2-n},$
with equality exactly for ellipsoids; here $\kappa_j$ is the volume of the Euclidean unit ball in dimension $j$. The formalization establishes this for every convex body $K\subset\mathbb R^n$ and every $n\ge4$.
Other inequalities in the projection-body family are not included.
Brannen's simplex-maximization conjecture predicts that a simplex maximizes normalized projection-body volume $|\Pi K|/|K|^{n-1}$ in dimension $n$. The formalized counterexample is the product of two ten-dimensional simplices. Its normalized projection volume, divided by that of a twenty-dimensional simplex, is
$\displaystyle \frac{22{,}355{,}476}{22{,}020{,}096}>1.$
Thus the proposed maximum fails in dimension $20$. The paper's exponential-factor result for every sufficiently large dimension is not included.
Comparator links
| Result | Comparator statement |
|---|---|
| Petty's projection-volume inequality | PettyProjectionVolume.lean |
| Failure of the simplex upper bound in dimension 20 | ProjectionCounterexample.lean |
| Explicit product-of-simplices counterexample | ProjectionVolume.lean |