A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Zeta Defense <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:infinite dimensions Levels:7
Category:Functional analysis Lean version:YES! ✔
Rate this game! 4.9 out of 5 (7,213 votes)

>>> How to Play <<<
Reflexive midpoint convexity and diamond distortion. Constructs a real reflexive Banach space with an asymptotically midpoint uniformly convex norm but no equivalent asymptotically uniformly convex norm, extending Baudier's separation to reflexive spaces. In the same space, depth-k countably branching diamonds require distortion at least $\sqrt{1+k/12}$, so midpoint uniform convexity does not force uniformly bounded diamond distortion even under reflexivity.

>>> Level Select <<<
released 2026-09-27  |  PDF only  |  PLAY LEVEL 1 »  (pdf)
We construct a separable reflexive real Banach space whose given norm is asymptotically midpoint uniformly convex but which admits no asymptotically uniformly convex equivalent norm. Its averaged midpoint modulus is at least $\sqrt{1+t^2/12}-1$, and the countably branching diamond of depth k has distortion at least $\sqrt{1+k/12}$ in this space. This gives a negative answer to the reflexive diamond converse for asymptotic uniform convexifiability.
released 2026-09-27  |  PDF only  |  PLAY LEVEL 2 »  (pdf)
For a real segment-forest dual with unbounded finite component heights and the real infinite-height coordinate predual, we bound the tail of an arbitrary displacement in a symmetric lens by $2\sqrt{R^2-\|x\|^2}$, where R is the lens radius and x is its finitely supported center. Both given norms are asymptotically midpoint uniformly convex, although neither space admits an equivalent asymptotically uniformly convex norm. The finite-height forest dual is reflexive.
released 2026-09-27  |  PDF only  |  PLAY LEVEL 3 »  (pdf)
We derive quantitative distortion bounds for countably branching diamond graphs from midpoint estimates and direct tree energies. In the dual of a finite-height segment forest, every distortion-D embedding of the depth-k diamond satisfies $D^2\ge1+k/4$. The same bound holds in the infinite-height coordinate predual. We also obtain power-type distortion bounds for path-cost and recursive tree norms.
released 2026-09-27  |  2 theorems · 6 lemmas · 9 proofs · 4,939 words  |  PLAY LEVEL 4 »  (pdf)
For an infinite-dimensional real subspace of L1 whose unit ball is totally bounded in measure and whose norm has the Daugavet property, we compute the averaged midpoint and one-sided asymptotic moduli at every unit center. They are $\max\{t/2,t-1\}$ and $\max\{0,t-2\}$, respectively. The same weak-neighborhood geometry excludes every equivalent asymptotically uniformly convex norm. A quantitative realization of the Kadets–Werner construction supplies a space with both hypotheses.
released 2026-09-27  |  15 theorems · 14 lemmas · 49 proofs · 22,328 words  |  PLAY LEVEL 5 »  (pdf)
Four real Banach spaces defined by bounded tree potentials satisfy the averaged asymptotic midpoint bound $\widehat\delta(t)\ge\sqrt{1+t^2/4}-1$ for $0\lt t\lt 1$, while none admits an asymptotically uniformly convex (AUC) renorming. On finite-height trees, the globally constrained norm equals the least additive cost of a Hilbert vector and root paths. The quadratic path and segment-start outer Hilbert sums are reflexive and asymptotically midpoint uniformly convex, and admit no equivalent AUC norm.
released 2026-09-27  |  1 theorem · 2 lemmas · 5 proofs · 4,059 words  |  PLAY LEVEL 6 »  (pdf)
For a countably branching tree, the closed real L1 spans of products of independent exponential or Gaussian-square multipliers along its paths have positive averaged asymptotic midpoint moduli and admit no equivalent asymptotically uniformly convex norm. The renorming obstruction holds for every positive nonconstant mean-one multiplier with finite second moment.
released 2026-09-27  |  4 theorems · 8 lemmas · 17 proofs · 9,356 words  |  PLAY LEVEL 7 »  (pdf)
We study tree norms computed by two least nonnegative fields whose difference is the vector. For Euclidean child aggregation, two root-sum spaces have an averaged asymptotic midpoint modulus of at least $t^3/128$ for $0\lt t\lt 1$, including a reflexive joining-root space. A reflexive construction with a fixed zero root also satisfies a homogeneous cubic estimate. These spaces admit no equivalent asymptotically uniformly convex norm. We also obtain sixth-power and cubic estimates when the aggregation exponent depends on the height of a finite component.

More Functional analysis Games!
Metric Markov cotype two for $\ell_1$Tingley's sphere-isometry problemRelative independence of the separable quotient problemLipschitz equivalence without linear isomorphism
The complete Crouzeix conjectureThe cotype–cotype conjecture under the approximation propertyMarkov type characterizes superreflexivityFixed points of nonexpansive maps in reflexive Banach spaces

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