Result 327, Functional analysis

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.

Lean formalization Proof

The bigger picture

Why it matters

A bound on how random walks spread can force a strong geometric conclusion: a space's notion of length can be adjusted to make its unit ball uniformly convex. The manuscript claims this connection for real Banach spaces.

What changes?

The manuscript reports that every real Banach space, a complete normed vector space, with Markov type p greater than one admits an equivalent uniformly convex norm. Markov type bounds expected pth powers of displacement for stationary reversible finite-state random walks mapped into the space by a fixed constant times elapsed steps times the one-step value. Equivalent norms change lengths by fixed factors; uniform convexity puts midpoints of separated unit vectors uniformly inside the unit ball.

What does that help mathematicians do?

Together with the known converse, the claim identifies nontrivial Markov type exactly with superreflexivity, the ability to choose an equivalent uniformly convex norm. Researchers could therefore rule out every Markov type exponent greater than one whenever superreflexivity fails, rather than testing exponents separately. This connects random-walk estimates to a structural obstruction that cannot be removed by changing to an equivalent norm.

Are there practical applications?

The immediate value is foundational, linking probabilistic control of movement with the geometry of complete normed spaces. It gives researchers a criterion for when uniformly convex geometry is available after changing the norm. The supplied statements do not provide a quantitative recipe for constructing that norm or a practical algorithm.

This section was generated by GPT-6 Astra Medium. This explanation is based on the result summary and manuscript abstracts below. This context is separate from OpenAI's source text.

Manuscript

Nontrivial Markov Type Forces Superreflexivity

September 23, 2026 14 pages Main result formalized in Lean

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.

PDF LaTeX source
Cite (BibTeX) 
@misc{OAI:Nontrivial-Markov-Type-Forces-Superreflexivity-September-23-2026,
  author = {{OpenAI}},
  title = {{Nontrivial Markov Type Forces Superreflexivity}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Nontrivial-Markov-Type-Forces-Superreflexivity-September-23-2026/paper.pdf}{OAI:Nontrivial-Markov-Type-Forces-Superreflexivity-September-23-2026}},
  year = {2026}
}

Lean formalization

OpenAI's note on what the formalization covers, from lean/docs/327.md.

Markov type characterizes superreflexivity

The following describes the scope of the Lean formalization related to the following accompanying paper(s):

Scope

The formalized result proves that a real Banach space has nontrivial Markov type exactly when it admits an equivalent uniformly convex norm, hence exactly when it is superreflexive. Nontrivial Markov type means a uniform Markov-type bound for some exponent p>1p>1 over all finite stationary reversible chains and all positive times. The exponent and equivalent norm may depend on the space, and the zero space is included. Additional formalized consequences concern uniformly smooth renormings and reflexivity of finitely representable spaces.

Comparator links

Result Comparator statement
Nontrivial Markov type and superreflexivity MarkovType.lean

Data from github.com/openai/math at commit adc7f12, committed October 6, 2026 at 21:58 UTC, last checked for changes about 11 hours ago. Titles, subjects, summaries, abstracts and Lean notes are OpenAI's; page counts are read from the PDFs. The map, related results, search, kinds of results and the named-problem index are Emergent Mind's, built with text embeddings and an LLM, and may contain errors.

An Emergent Mind Labs project. Emergent Mind is not affiliated with OpenAI. None of these results has been peer reviewed. Cite the manuscripts themselves, using the BibTeX on each result's page.