Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

OAI.MarkovSuperreflexivity.exists_power_smooth_equivalentNorm: intermediate lemma from OpenAI, Nontrivial Markov Type Forces Superreflexivity

Proved
OAI.MarkovSuperreflexivity.exists_power_smooth_equivalentNorm

by dbenbenn · Oct 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

openai-math

An intermediate lemma of the split of OpenAI's proof of OAI.MarkovSuperreflexivity.hasNontrivialMarkovType_iff_hasEquivalentUCNorm, carved from OpenAI's openai/math development for this platform. The statement and its proof are OpenAI's (OpenAI, Nontrivial Markov Type Forces Superreflexivity, OpenAI Math Release, September 23, 2026, result family 327, github.com/openai/math, Apache License 2.0); in Lean it is the declaration OAI.MarkovSuperreflexivity.exists_power_smooth_equivalentNorm of lean/OAI/Analysis/MarkovType/MarkovType/PisierPowerRenorming.lean at commit adc7f12, ported to Lean 4.33.1 and Mathlib 0df444a.

The statement, as published (namespace OAI.MarkovSuperreflexivity):

theorem exists_power_smooth_equivalentNorm [CompleteSpace X] (hUC : HasEquivalentUCNorm X) :
    ∃ N : EquivalentNorm X, ∃ q : ℝ, 1 < q ∧ q ≤ 2 ∧
      ∃ C : ℝ, 0 < C ∧ SymmetricPowerSmooth N.p q C ∧ PowerSmooth N.p q C ∧
        (∀ t : ℝ, 0 ≤ t → smoothnessModulus N.p t ≤ C * t ^ q) ∧
        UniformSmooth N.p

Definitions. The statement is written with OAI.MarkovSuperreflexivity.PowerSmooth, OAI.MarkovSuperreflexivity.SymmetricPowerSmooth and OAI.MarkovSuperreflexivity.UniformSmooth (definitions bundle OAISMk000 of this split); OAI.MarkovSuperreflexivity.smoothnessModulus (definitions bundle OAISMk001 of this split); OAI.MarkovSuperreflexivity.EquivalentNorm and OAI.MarkovSuperreflexivity.HasEquivalentUCNorm (the published bundle Def_MarkovType).

Used by. The proof of OAI.MarkovSuperreflexivity.hasNontrivialMarkovType_iff_hasEquivalentUCNorm of this split imports it.

Preamble
import Mathlib
import Lean.Elab.Tactic.Omega
import Definitions.Def_MarkovType
import Definitions.Def_OAISMk000
import Definitions.Def_OAISMk001
Formal statement
section

set_option linter.all false
set_option linter.unusedVariables false
set_option linter.unusedTactic false
set_option linter.unreachableTactic false

namespace OAI

namespace MarkovSuperreflexivity

variable {X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X] [CompleteSpace X]

omit [CompleteSpace X] in
theorem exists_power_smooth_equivalentNorm [CompleteSpace X] (hUC : HasEquivalentUCNorm X) :
    ∃ N : EquivalentNorm X, ∃ q : ℝ, 1 < q ∧ q ≤ 2 ∧
      ∃ C : ℝ, 0 < C ∧ SymmetricPowerSmooth N.p q C ∧ PowerSmooth N.p q C ∧
        (∀ t : ℝ, 0 ≤ t → smoothnessModulus N.p t ≤ C * t ^ q) ∧
        UniformSmooth N.p := by
  sorry

end MarkovSuperreflexivity

end OAI
end
Source
OpenAI, Nontrivial Markov Type Forces Superreflexivity, OpenAI Math Release, September 23, 2026, https://github.com/openai/math (result family 327; paper: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Nontrivial-Markov-Type-Forces-Superreflexivity-September-23-2026/paper.pdf; Apache License 2.0); Lean: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Analysis/MarkovType/MarkovType/PisierPowerRenorming.lean (declaration OAI.MarkovSuperreflexivity.exists_power_smooth_equivalentNorm)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me