Lean statement

Nontrivial Markov type and superreflexivity

Lean is a language for mathematical statements and proofs that a computer can verify. This page shows one statement file from OpenAI’s release, possible paper matches and independent reports. The code-like names below identify the definitions or theorems selected by the proof-verification settings.

Theorem selected for verification: OAI.MarkovSuperreflexivity.hasNontrivialMarkovType_iff_hasEquivalentUCNorm

Lean statement file: MarkovType.leanShow on the mapFamily 327. OpenAI lists this as a main result in its Lean catalogue.

See the candidate theorem Who ran the proof-verification program Report a comparison with the paper (GitHub issue)

The Lean statement

The lines of the Lean statement that state the theorem, then the definitions in the file that it uses.

theorem hasNontrivialMarkovType_iff_hasEquivalentUCNorm [CompleteSpace X] :    HasNontrivialMarkovType X ↔ HasEquivalentUCNorm X := by  sorry

A Lean statement states the theorem and leaves its proof as sorry on purpose. OpenAI’s proof is in a separate solution module, and a program called Comparator checks that proof against this statement.

Definitions needed to read it

Local definitions the statement names, followed through the definitions they name in turn. The match is by name in the source text, so a name reached only through notation can be missed; the full file is below.

structure OAI.MarkovSuperreflexivity.FiniteReversibleChain line 11

structure FiniteReversibleChain (S : Type*) [Fintype S] where  π : S → ℝ  P : S → S → ℝ  π_nonneg : ∀ s, 0 ≤ π s  sum_π : ∑ s, π s = 1  P_nonneg : ∀ s t, 0 ≤ P s t  sum_P : ∀ s, ∑ t, P s t = 1  balance : ∀ s t, π s * P s t = π t * P t s

abbreviation OAI.MarkovSuperreflexivity.StatePath line 20

abbrev StatePath (S : Type*) (n : ℕ) := Fin (n + 1) → S

definition OAI.MarkovSuperreflexivity.pathWeight line 22

def pathWeight {S : Type*} [Fintype S]    (C : FiniteReversibleChain S) (n : ℕ) (ω : StatePath S n) : ℝ :=  C.π (ω 0) * ∏ i : Fin n, C.P (ω i.castSucc) (ω i.succ)

definition OAI.MarkovSuperreflexivity.stateCost line 26

def stateCost {S X : Type*} [Fintype S] [NormedAddCommGroup X]    (C : FiniteReversibleChain S) (f : S → X) (p : ℝ) (n : ℕ) : ℝ :=  ∑ ω : StatePath S n,    pathWeight C n ω * Real.rpow (‖f (ω (Fin.last n)) - f (ω 0)‖) p

definition OAI.MarkovSuperreflexivity.MarkovTypeWith line 31

def MarkovTypeWith (p K : ℝ) (X : Type*) [NormedAddCommGroup X] : Prop :=  0 < p ∧ 0 < K ∧    ∀ (m : ℕ) (C : FiniteReversibleChain (Fin m)) (f : Fin m → X) (n : ℕ),      1 ≤ n → stateCost C f p n ≤ Real.rpow K p * (n : ℝ) * stateCost C f p 1

definition OAI.MarkovSuperreflexivity.HasMarkovType line 36

def HasMarkovType (p : ℝ) (X : Type*) [NormedAddCommGroup X] : Prop :=  ∃ K : ℝ, MarkovTypeWith p K X

definition OAI.MarkovSuperreflexivity.HasNontrivialMarkovType line 39

def HasNontrivialMarkovType (X : Type*) [NormedAddCommGroup X] : Prop :=  ∃ p : ℝ, 1 < p ∧ HasMarkovType p X

structure OAI.MarkovSuperreflexivity.EquivalentNorm line 48

structure EquivalentNorm where  p : Seminorm ℝ X  lower : ℝ  upper : ℝ  lower_pos : 0 < lower  upper_pos : 0 < upper  lower_bound : ∀ x, lower * ‖x‖ ≤ p x  upper_bound : ∀ x, p x ≤ upper * ‖x‖

definition OAI.MarkovSuperreflexivity.UniformConvex line 59

def UniformConvex (p : Seminorm ℝ X) : Prop :=  ∀ ε : ℝ, 0 < ε → ε ≤ 2 → ∃ δ : ℝ, 0 < δ ∧    ∀ x y : X, p x ≤ 1 → p y ≤ 1 → ε ≤ p (x - y) →      p ((1 / 2 : ℝ) • (x + y)) ≤ 1 - δ

definition OAI.MarkovSuperreflexivity.HasEquivalentUCNorm line 64

def HasEquivalentUCNorm (X : Type u) [NormedAddCommGroup X] [NormedSpace ℝ X] : Prop :=  ∃ N : EquivalentNorm X, UniformConvex N.p

Possible paper match, with no recorded review

Atlas selected this possible match by comparing words in the Lean statement with every statement in the family. No review of whether the statements mean the same thing is recorded.

Words of the Lean statement, its names split into words, that also appear in the theorem: markov, real and space. Found in the paper’s title, which its main theorem states: nontrivial. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: banach and superreflexive.

Theorem 1.1 of Nontrivial Markov Type Forces Superreflexivity

Theorem

Every real Banach space with Markov type p for at least one p>1 is superreflexive.

Section 1, Introduction Read it in the paper TeX source, line 90

Show the TeX

Every real Banach space with Markov type $p$ for at least one $p>1$
is superreflexive.

Other possible paper matches, closest wording first

Proposition 2.2 of Nontrivial Markov Type Forces Superreflexivity. Words of the Lean statement, its names split into words, that also appear in the theorem: norm, finite, chain, reversible and integer. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: stationary.
Proposition 3.2 of Nontrivial Markov Type Forces Superreflexivity. Words of the Lean statement, its names split into words, that also appear in the theorem: uniform, finite, reversible, chain and integer. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: stationary.

How Atlas selects possible matches: it compares words in the Lean statement with every statement in the family. It also splits Lean names into words. The release’s label and note receive less weight; a main theorem wins a close match. If the Lean wording yields no clear match, Atlas uses the catalogue description. This selects passages to compare; it does not establish that they mean the same thing.

Reported Comparator runs

two independent groups report that Comparator accepted runs for this Lean statement file: Carlos Toledo’s cert-machine; MathVet. Each group reports its own Comparator run for this statement file. Atlas has not repeated the runs.

For a configured theorem, Comparator tests whether OpenAI’s proof proves the exact Lean statement. Some files instead configure definitions for comparison by name and type. Acceptance does not establish that the statement means the same thing as the paper’s theorem.

Carlos Toledo’s cert-machine

How they ran it, in their words

Every Comparator challenge re-run on Linux with nanoda switched on, decided by a preregistered rule; every family’s challenge statements read against OpenAI’s headline, clause by clause. Decider: Comparator (leanprover/comparator d03acab1 = tag v4.34.0, built with the release’s toolchain v4.34.1), lean4export 076e8e57, landrun 811cfff5, nanoda_lib 3a240721 — on GitHub’s Linux runners (.github/workflows/openai-math-kernel.yml), one j…

Accepted Their term: “CERTIFIED”.
Re-run through Comparator with the independent nanoda kernel switched on: Lean’s kernel and nanoda both accept OpenAI’s solution.
Reported 10 October 2026, at the release version shown here. Original verification report

MathVet

How they ran it, in their words

An independent, model-assisted, pre-referee reading of each family’s challenge statements against its headline claim under a published rubric (PROTOCOL.md), with its own Comparator runs per challenge. Its protocol describes a planned error-rate study; this import does not establish that the study has been completed.

Accepted Their term: “comparator-sandboxed-pass”.
Re-run through Comparator in a sandboxed virtual machine: accepted.
Reported 8 October 2026, at the release version shown here. Original verification report

What an accepted Comparator run would establish

If Comparator is run under this configuration and accepts, the solution proves the configured theorem using only the allowed axioms, and the Lean kernel accepts every step.

This configuration lists no definition holes, so every definition the statement uses is compared as it is written in this file.

Allowed axioms: propext, Quot.sound, Classical.choice

Acceptance leaves open whether the Lean statement means the same thing as the paper’s theorem, whether the paper’s other claims are correct, and whether the result is new. Those questions require comparing the definitions and statements, reviewing the paper’s arguments, and reading the earlier literature.

Do family 327’s Lean statements express the advertised result?

These assessments compare all the family’s Lean statements with the whole result OpenAI describes in its catalogue. They do not assess this statement alone. Each group uses its own published rules.

MathVet and cert-machine agree on how much of the advertised result the Lean statements express.

MathVet
Finds the whole advertised result stated or implied Their term: “full”.
The challenge statements imply the headline claim after unpacking definitions or one routine step. Their record
Their note: hasNontrivialMarkovType_iff_hasEquivalentUCNorm [CompleteSpace X] : HasNontrivialMarkovType X ↔ HasEquivalentUCNorm X states both the new direction (Markov type p > 1 ⇒ equivalent uniformly convex norm) and the known converse. The final identification 'admits an equivalent UC norm' = superreflexive (Enflo/Pisier) is not stated in Lean.
Definitions the group asks readers to compare with the paper: MarkovTypeWith p K X := 0 < p ∧ 0 < K ∧ ∀ m (C : FiniteReversibleChain (Fin m)) (f : Fin m → X) (n ≥ 1), E_π‖f(Z_n) - f(Z_0)‖^p ≤ K^p · n · E_π‖f(Z_1) - f(Z_0)‖^p (stateCost via explicit path weights π(ω₀)∏P): hand-built but matches Ball's stationary reversible Markov type; UniformConvex and EquivalentNorm (seminorm with two-sided norm bounds) are the usual modulus-of-convexity definitions
Carlos Toledo’s cert-machine
Finds the whole advertised result stated or implied Their term: “MATCHES”.
The challenge statements state the headline as OpenAI wrote it. Their record

Read the complete assessments on the family page.

OpenAI’s own note on what this Lean statement covers

“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>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.”
Quoted from OpenAI’s Lean note for this family

An AI agent drafted an interpretation of that note, classifying this statement as “states a paper’s theorem as the paper does”. No human review of the draft is recorded.

Supporting material

The complete Lean statement file

79 lines, copied from release version fd4aeeb. A name defined in this file links to its line; pointing at the name shows its definition.

Declared in this fileOpenAI’s library at fd4aeebOther linked names open the current documentation for Mathlib, Lean’s mathematical library.

Links in the file: 14 to its own declarations, 23 to Mathlib’s documentation. 11 declared names also link to the same declaration in OpenAI’s library. OpenAI uses Mathlib version d13f23b. The linked documentation describes the current version, so names that have since changed may be missing there.

Definitions and lemmas named by the statement

If Comparator accepts a proof, it proves hasNontrivialMarkovType_iff_hasEquivalentUCNorm exactly as written here. To compare that statement with the paper, also read the definitions and lemmas listed below. Atlas found them by following names in the source text and lists each after the names it uses. For x.foo, Atlas includes every foo defined here for a type, even when the statement may use only one of them.

It reaches all 10 other declarations of the file; with the theorem itself they span 41 lines. 2 of them are named in the statement itself.

Names in the namespace OAI.MarkovSuperreflexivity are listed without it.

structure FiniteReversibleChainline 11library
abbrev StatePathline 20library
def pathWeightline 22library
def stateCostline 26library
def MarkovTypeWithline 31library
def HasMarkovTypeline 36library
def HasNontrivialMarkovTypeline 39in the statementlibrary
structure EquivalentNormline 48library
def UniformConvexline 59library
def HasEquivalentUCNormline 64in the statementlibrary
theorem hasNontrivialMarkovType_iff_hasEquivalentUCNormline 71selected theoremlibrary

import Mathlibnamespace OAInoncomputable sectionopen scoped BigOperatorsnamespace MarkovSuperreflexivitystructure FiniteReversibleChain (S : Type*) [Fintype S] where  π : S → ℝ  P : S → S → ℝ  π_nonneg : ∀ s, 0 ≤ π s  sum_π : ∑ s, π s = 1  P_nonneg : ∀ s t, 0 ≤ P s t  sum_P : ∀ s, ∑ t, P s t = 1  balance : ∀ s t, π s * P s t = π t * P t sabbrev StatePath (S : Type*) (n : ℕ) := Fin (n + 1) → Sdef pathWeight {S : Type*} [Fintype S]    (C : FiniteReversibleChain S) (n : ℕ) (ω : StatePath S n) : ℝ :=  C.π (ω 0) * ∏ i : Fin n, C.P (ω i.castSucc) (ω i.succ)def stateCost {S X : Type*} [Fintype S] [NormedAddCommGroup X]    (C : FiniteReversibleChain S) (f : S → X) (p : ℝ) (n : ℕ) : ℝ :=  ∑ ω : StatePath S n,    pathWeight C n ω * Real.rpow (‖f (ω (Fin.last n)) - f (ω 0)‖) pdef MarkovTypeWith (p K : ℝ) (X : Type*) [NormedAddCommGroup X] : Prop :=  0 < p ∧ 0 < K ∧    ∀ (m : ℕ) (C : FiniteReversibleChain (Fin m)) (f : Fin m → X) (n : ℕ),      1 ≤ n → stateCost C f p n ≤ Real.rpow K p * (n : ℝ) * stateCost C f p 1def HasMarkovType (p : ℝ) (X : Type*) [NormedAddCommGroup X] : Prop :=  ∃ K : ℝ, MarkovTypeWith p K Xdef HasNontrivialMarkovType (X : Type*) [NormedAddCommGroup X] : Prop :=  ∃ p : ℝ, 1 < p ∧ HasMarkovType p Xsectionuniverse uvariable (X : Type u) [NormedAddCommGroup X] [NormedSpace ℝ X]structure EquivalentNorm where  p : Seminorm ℝ X  lower : ℝ  upper : ℝ  lower_pos : 0 < lower  upper_pos : 0 < upper  lower_bound : ∀ x, lower * ‖x‖ ≤ p x  upper_bound : ∀ x, p x ≤ upper * ‖x‖variable {X}def UniformConvex (p : Seminorm ℝ X) : Prop :=  ∀ ε : ℝ, 0 < ε → ε ≤ 2 → ∃ δ : ℝ, 0 < δ ∧    ∀ x y : X, p x ≤ 1 → p y ≤ 1 → ε ≤ p (x - y) →      p ((1 / 2 : ℝ) • (x + y)) ≤ 1 - δdef HasEquivalentUCNorm (X : Type u) [NormedAddCommGroup X] [NormedSpace ℝ X] : Prop :=  ∃ N : EquivalentNorm X, UniformConvex N.pendvariable {X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]theorem hasNontrivialMarkovType_iff_hasEquivalentUCNorm [CompleteSpace X] :    HasNontrivialMarkovType X ↔ HasEquivalentUCNorm X := by  sorryend MarkovSuperreflexivityendend OAI

Every extracted statement of the accompanying papers

The statements the atlas extracted automatically from each accompanying paper’s TeX source, with links to the full sources.

Nontrivial Markov Type Forces Superreflexivity

Theorem

Every real Banach space with Markov type p for at least one p>1 is superreflexive.

Section 1, Introduction Read it in the paper TeX source, line 90

Show the TeX

Every real Banach space with Markov type $p$ for at least one $p>1$
is superreflexive.

Configuration and file facts

File: lean/ComparatorChallenges/MarkovType.lean
OpenAI’s Lean catalogue: OpenAI lists this as a main result in its Lean catalogue.
Solution module: OAI/Analysis/MarkovType/Main.lean
Allowed axioms: propext, Quot.sound, Classical.choiceThe axioms this configuration allows a proof to use. A replay shows which of them a proof uses.
Imports: Mathlib
Imports from outside Mathlib: None
Local vocabulary: 10 local vocabulary declarations
Lines of Lean, without comments or blank lines: 41
Second proof-verification program (nanoda): Off in OpenAI's configuration.

A shareable summary of this page: the proposed paper match, what the Lean statement expresses, and which reviews are recorded.

Plectis Atlas