The sharp simplex conjecture for isotropic constants at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages

A
D
V
E
R
T

I
S
E
M
E
N
T

The sharp simplex conjecture for isotropic constants

at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages

thinking... about 3 hours remaining

If this game doesn't work on your computer, we can't help you. No Lean version yet. Some unformalized games could have issues!

expertly designed by an internal OpenAI model

Difficulty:	🧠🧠🧠🧠🧠	Ages:	13 - ∞
Skills:	shapes, measuring stuff	Levels:	1
Category:	Convex and metric geometry	Lean version:	not yet
Rate this game! 4.4 out of 5 (6,060 votes)

>>> How to Play <<<

The sharp simplex conjecture for isotropic constants. Proves that simplices uniquely maximize the isotropic constant among convex bodies in every dimension, resolving the strong isotropic constant conjecture. Also establishes the sharp entropy lower bound for log-concave probability densities, with equality precisely for invertible affine images of products of one-sided exponential laws.

>>> Level Select <<<

LEVEL 1 A sharp entropy bound and the simplex inequality for isotropic constants

released 2026-10-05 | 3 theorems · 11 lemmas · 18 proofs · 14,678 words | PLAY LEVEL 1 » (pdf)

We prove the strong isotropic constant conjecture: in each dimension, simplices are the unique maximizers of the isotropic constant among convex bodies. We also prove the sharp entropy bound $h(f)\ge m+\tfrac12\log\det\mathop{\mathrm{Cov}}\nolimits (f)$ for every log-concave probability density on ℝ^m, with equality precisely for invertible affine images of products of one-sided exponential laws.

More Convex and metric geometry Games!
The Gaussian propeller conjecture	The Euclidean Steinitz–Bergström conjecture	A negative answer to the Lang–Plaut problem	The sharp distortion of edit distance into $\ell_1$
A counterexample to Bang's cylinder-covering bound	The Mahler conjectures and symplectic width HOT!	Petty's projection-volume conjecture and simplex counterexamples	Bounded-distortion $L_1$ embeddings of planar and bounded-treewidth graphs

COOLMAITH GAMES SPONSORS: (not real)
Big Al's USED GPUs	Epsilon & Delta LLP attorneys at limit	QED Bail Bonds	Hilbert's Hotel always a vacancy!

Cool Links: openai/math Lean Mathlib arXiv the real Coolmath Games

You are visitor number 000719

Thanks for visiting CoolmAIth Games
© 1997-2026 CoolmAIth Games. A parody. Not affiliated with Coolmath.com LLC or OpenAI.
Every proof here was written by an internal OpenAI model and lives at github.com/openai/math.
Best viewed in Netscape Navigator 4.0 at 800x600