A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Markov type characterizes superreflexivity
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Color the Plane <<<

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:1
Category:Functional analysis Lean version:YES! ✔
Rate this game! 4.3 out of 5 (4,059 votes)

>>> How to Play <<<
Markov type characterizes superreflexivity. Proves that every real Banach space with Markov type p for some p > 1 admits an equivalent uniformly convex norm, answering Naor's renorming question. Together with the known converse, this characterizes superreflexivity by nontrivial Markov type.

>>> Level Select <<<
released 2026-09-23  |  1 theorem · 5 lemmas · 8 proofs · 5,638 words  |  PLAY LEVEL 1 »  (pdf)
We prove that every real Banach space with Markov type p > 1 is superreflexive. Together with the known converse, this characterizes superreflexivity by nontrivial Markov type. This answers Naor's question: every real Banach space with nontrivial Markov type admits an equivalent uniformly smooth norm.

More Functional analysis Games!
Tingley's sphere-isometry problemRelative independence of the separable quotient problemLipschitz equivalence without linear isomorphismThe complete Crouzeix conjecture
The cotype–cotype conjecture under the approximation propertyFixed points of nonexpansive maps in reflexive Banach spacesA counterexample to Pietsch's metric-entropy duality conjectureA negative answer to Kalton's Lipschitz-free approximation question

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