Plectis Atlas
Search

↑ and ↓ move, Enter opens, Esc closes.

Lean statement

Reciprocal Specht degrees and eight-block Fourier bound

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.Thorp.Current.first_reciprocal_main

Lean statement file: ThorpFirstReciprocal.leanShow on the mapOpenAI’s Lean catalogue does not list this as a main result; the release’s Lean notes for family 238 link it.

The Lean statement

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

theorem first_reciprocal_main :    (BddAbove (Set.range (fun n : {n : ℕ // 1 ≤ n} => reciprocalFirst n.val)) ∧    (∀ n : ℕ, 1 ≤ n → reciprocalFirst n ≤ C1) ∧    Tendsto exceptionalFirst atTop (nhds 0)) ∧    (∀ (d : ℕ) (_hd : 3 ≤ d)    (e : Position d ≃ Fin 8 × Fin (2 ^ (d - 3)))    {E : Type uE} [NormedAddCommGroup E] [InnerProductSpace ℂ E]    [FiniteDimensional ℂ E]    (ρ : Representation ℂ (Equiv.Perm (Position d)) E)    [Representation.IsIrreducible ρ]    (_ : ∀ g x y, ⟪ρ g x, ρ g y⟫_ℂ = ⟪x, y⟫_ℂ)    (ν : Equiv.Perm (Position d) → ℝ)    (_ : ∀ g, 0 ≤ ν g) (_ : ∑ g, ν g = 1)    (_ : ∀ (i : Fin 8) (g : Equiv.Perm (Position d)),      ∑ h : Equiv.Perm (Fin (2 ^ (d - 3))),          ν (g * Block.embedding e (Pi.mulSingle i h)) ≤        4 * (Fintype.card (Equiv.Perm (Fin (2 ^ (d - 3)))) : ℝ) /          Fintype.card (Equiv.Perm (Position d))),    ‖LinearMap.toContinuousLinearMap (Fourier.integrated ρ (fun g => (ν g : ℂ)))‖ ≤      Real.sqrt (32 * C1) * (Module.finrank ℂ E : ℝ) ^ (-5 / 16 : ℝ)) := 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.

  • abbreviation OAI.Thorp.Position line 14

    abbrev Position (d : ℕ) := Fin d → Bool
  • definition OAI.Thorp.Block.perm line 20

    def perm (p : I → Equiv.Perm β) : Equiv.Perm (I × β) where  toFun x := (x.1, p x.1 x.2)  invFun x := (x.1, (p x.1)⁻¹ x.2)  left_inv x := by simp  right_inv x := by simp
  • definition OAI.Thorp.Block.hom line 26

    def hom : (I → Equiv.Perm β) →* Equiv.Perm (I × β) where  toFun := perm  map_one' := by ext ⟨i,b⟩ <;> rfl  map_mul' p q := by ext ⟨i,b⟩ <;> rfl
  • definition OAI.Thorp.Block.embedding line 31

    def embedding (e : α ≃ I × β) : (I → Equiv.Perm β) →* Equiv.Perm α :=  (e.symm.permCongrHom).toMonoidHom.comp hom
  • definition OAI.Thorp.Fourier.integrated line 41

    def integrated (ρ : Representation ℂ G V) (f : G → ℂ) : Module.End ℂ V :=  ∑ g, f g • ρ g
  • abbreviation OAI.Thorp.Young.Cells line 48

    abbrev Cells (D : YoungDiagram) := {p : ℕ × ℕ // p ∈ D.cells}
  • definition OAI.Thorp.Young.rowCellsEquiv line 50

    def rowCellsEquiv (D : YoungDiagram) : Cells D ≃ (i : Fin (D.colLen 0)) × Fin (D.rowLen i) where  toFun x := ⟨⟨x.val.1, YoungDiagram.mem_iff_lt_colLen.mp (D.up_left_mem le_rfl (Nat.zero_le _) x.property)⟩,    ⟨x.val.2, YoungDiagram.mem_iff_lt_rowLen.mp x.property⟩⟩  invFun x := ⟨(x.1, x.2), YoungDiagram.mem_iff_lt_rowLen.mpr x.2.isLt⟩  left_inv x := rfl  right_inv x := by cases x; rfl
  • definition OAI.Thorp.Young.ofPartition line 57

    def ofPartition {n : ℕ} (p : Nat.Partition n) : YoungDiagram :=  YoungDiagram.ofRowLens (p.parts.sort (· ≥ ·)) (Multiset.pairwise_sort _ _).sortedGE
  • definition OAI.Thorp.Young.longest line 60

    def longest (D : YoungDiagram) : ℕ := max (D.rowLen 0) (D.colLen 0)
  • definition OAI.Thorp.Specht.cyclic line 69

    def cyclic (ρ : Representation ℂ G E) (e : E) : Subrepresentation ρ where
    Show the remaining 12 lines
      toSubmodule := Submodule.span ℂ (Set.range fun g => ρ g e)  apply_mem_toSubmodule g := by    intro v hv    induction hv using Submodule.span_induction with    | mem v hv =>      obtain ⟨h, rfl⟩ := hv      exact Submodule.subset_span ⟨g * h, by simp⟩    | zero => simp    | add x y hx hy ihx ihy =>      simpa using (Submodule.span ℂ (Set.range fun h => ρ h e)).add_mem ihx ihy    | smul a x hx ih =>      simpa using (Submodule.span ℂ (Set.range fun h => ρ h e)).smul_mem a ih
  • definition OAI.Thorp.Specht.PermutationSpace.rep line 87

    def rep : Representation ℂ G (EuclideanSpace ℂ X) where
    Show the remaining 10 lines
      toFun g := {    toFun v := WithLp.toLp 2 (fun x => v (g⁻¹ • x))    map_add' := by intro v w; rfl    map_smul' := by intro a v; rfl }  map_one' := by ext v x; simp  map_mul' := by    intro g h    ext v x    change v ((g * h)⁻¹ • x) = v (h⁻¹ • g⁻¹ • x)    simp [mul_smul]
  • definition OAI.Thorp.Specht.PermutationSpace.alternator line 101

    def alternator (ι : H →* G) (χ : H →* ℂ) : Module.End ℂ (EuclideanSpace ℂ X) :=  ∑ h, χ h • rep (ι h)
  • definition OAI.Thorp.Specht.Tabloid line 108

    def Tabloid (r : α → ℕ) := {f : α → ℕ // ∃ g : Equiv.Perm α, f = r ∘ g}
  • definition OAI.Thorp.Specht.baseTabloid line 130

    def baseTabloid (r : α → ℕ) : Tabloid r := ⟨r, 1, by funext x; rfl⟩
  • definition OAI.Thorp.Specht.fiberGroup line 132

    def fiberGroup (c : α → ℕ) : Subgroup (Equiv.Perm α) where  carrier := {g | ∀ x, c (g x) = c x}  one_mem' := by intro x; rfl  mul_mem' := by intro g h hg hh x; exact (hg (h x)).trans (hh x)  inv_mem' := by    intro g hg x    have hh := hg (g⁻¹ x)    change c (g (g.symm x)) = c (g.symm x) at hh    rw [g.apply_symm_apply] at hh    exact hh.symm
  • definition OAI.Thorp.Specht.complexSign line 143

    def complexSign : Equiv.Perm α →* ℂ where  toFun g := ((Equiv.Perm.sign g : ℤˣ) : ℤ)  map_one' := by simp  map_mul' := by intro g h; simp
  • definition OAI.Thorp.Specht.tableauRow line 150

    def tableauRow (x : α) : ℕ := (t x).val.1
  • definition OAI.Thorp.Specht.tableauCol line 152

    def tableauCol (x : α) : ℕ := (t x).val.2
  • definition OAI.Thorp.Specht.tabloidRep line 154

    def tabloidRep : Representation ℂ (Equiv.Perm α) (EuclideanSpace ℂ (Tabloid (tableauRow D t))) :=  PermutationSpace.rep
  • definition OAI.Thorp.Specht.columnAlternator line 157

    def columnAlternator : Module.End ℂ (EuclideanSpace ℂ (Tabloid (tableauRow D t))) :=  PermutationSpace.alternator (fiberGroup (tableauCol D t)).subtype    (complexSign.comp (fiberGroup (tableauCol D t)).subtype)
  • definition OAI.Thorp.Specht.polytabloid line 161

    def polytabloid : EuclideanSpace ℂ (Tabloid (tableauRow D t)) :=  columnAlternator D t (EuclideanSpace.single (baseTabloid (tableauRow D t)) (1 : ℂ))
  • definition OAI.Thorp.Specht.module line 164

    def module : Subrepresentation (tabloidRep D t) := cyclic (tabloidRep D t) (polytabloid D t)
  • abbreviation OAI.Thorp.Specht.Shape line 166

    abbrev Shape (α : Type uα) [Fintype α] := Nat.Partition (Fintype.card α)
  • definition OAI.Thorp.Specht.canonicalTableau line 168

    def canonicalTableau (p : Shape α) : α ≃ Thorp.Young.Cells (Thorp.Young.ofPartition p) := by
    Show the remaining 13 lines
      have card_cells_eq_sum (D : YoungDiagram) : Fintype.card (Thorp.Young.Cells D) = D.rowLens.sum := by    rw [Fintype.card_congr (Thorp.Young.rowCellsEquiv D), Fintype.card_sigma]    simp only [Fintype.card_fin, YoungDiagram.rowLens]    rw [← List.sum_toFinset _ List.nodup_range, List.toFinset_range, Finset.sum_range]  have rowLens_ofPartition {n : ℕ} (p : Nat.Partition n) :      (Thorp.Young.ofPartition p).rowLens = p.parts.sort (· ≥ ·) := by    apply YoungDiagram.rowLens_ofRowLens_eq_self    intro x hx    exact p.parts_pos ((Multiset.mem_sort _).mp hx)  have card_ofPartition {n : ℕ} (p : Nat.Partition n) : Fintype.card (Thorp.Young.Cells (Thorp.Young.ofPartition p)) = n := by    rw [card_cells_eq_sum, rowLens_ofPartition]    simpa only [← Multiset.sum_coe, Multiset.sort_eq] using p.parts_sum  exact Fintype.equivOfCardEq (card_ofPartition p).symm

7 more definitions are reached the same way; the full file lists them.

No confident match with a paper statement

No paper theorem is paired with this Lean statement.

Why none: no paper statement matches the Lean text clearly enough to pair, so the closest candidates are listed below.

Statements in From partial permutation information to Fourier bounds come first because the release’s name for this Lean statement shares words with that paper’s title.

Other possible paper matches, closest wording first

  • Theorem 1.1 of From partial permutation information to Fourier bounds. Words of the Lean statement, its names split into words, that also appear in the theorem: span, fourier, degree, irreducible, partition, one and one more. Found in the paper’s title, which its main theorem states: permutation. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: control and bound.
  • Theorem 9.2 of From partial permutation information to Fourier bounds. Words of the Lean statement, its names split into words, that also appear in the theorem: fibers, product, group, sign, column, irreducible and four more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: mixes.
  • Proposition 6.1 of Optimal-order mixing of the Thorp shuffle. Words of the Lean statement, its names split into words, that also appear in the theorem: 5/16, fourier, subgroup, degree, irreducible, representation and three more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: eight and bound.
  • Proposition C.1 of From partial permutation information to Fourier bounds. Words of the Lean statement, its names split into words, that also appear in the theorem: 5/16, space and sqrt.
  • Corollary 6.2 of Random coordinate frames and partial permutation laws. Words of the Lean statement, its names split into words, that also appear in the theorem: complex, fourier, finite, subgroup, irreducible, representation and four more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: degrees, dimension, densities and bounded.

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

three independent groups report that Comparator accepted runs for this Lean statement file: Carlos Toledo’s cert-machine; MathVet; Neal McBurnett’s openai-math-lean-tooling. 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

Neal McBurnett’s openai-math-lean-tooling

How they ran it, in their words

Each challenge’s solution is built and checked by Comparator at the pinned release, on Lean leanprover/lean4:v4.34.1, recording the verdict, the check time and the peak memory; the run was still in progress at this snapshot (192 accepted, 224 pending).

  • Accepted Their term: “accepted”.

    Re-run through Comparator with Lean’s kernel: accepted (the check took 458 s; peak memory 6.4 GiB).

    Reported 11 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 238’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: ThorpResults.remaining_main (ThorpRemaining) is a conjunction whose last conjunct OptimalOrderMain := IsTheta atTop (mixingTime d) (log (2^d)) states exactly the Θ(log N) mixing for N = 2^d cards, with mixingTime d := sInf {t | distance d t ≤ 1/4}, distance d t := tv (law d t) (uniform d) the total-variation distance of the full permutation law (and InformationMain records that lawFrom from any starting deck has the same distance, plus distance d (2048 d) → 0); the 12 other challenge files are supporting Fourier/representation estimates (regular_trace_smoothing, binary_sweep_contraction_and_mixing, robust_permanent, ...). All of them state estimates for the same hand-built Thorp shuffle.

    Definitions the group asks readers to compare with the paper: Custom Thorp shuffle and 'mixing time': step (d+1) c := (pairSwitch d c on the head bit, then rotate the coordinate order) on State d := Equiv.Perm (Fin d → Bool) with Coins (d+1) = (Fin d → Bool) → Bool iid fair coins, fairMass, tv, mixingTime d := sInf {t | distance d t ≤ 1/4}; this is the standard pair-swap-and-interleave Thorp shuffle and TV-from-uniform with ε = 1/4, but it is a hand-written model and the Θ-statement hides explicit constants (1600d, 2048d, ...). OccupiedOverlap shows an axiom_files hit (HookModel.lean) that is a doc-comment false positive.

  • 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 linked supporting results include frame and conditional-list estimates, regular trace and spectral bounds, signed moments, and full-density $L^2$ control. They also bound reciprocal Specht-dimension sums and give the eight-block Fourier estimate used in the mixing argument.”

An AI agent drafted an interpretation of that note, classifying this statement as “states a supporting result”. No human review of the draft is recorded.

Supporting material

The complete Lean statement file

233 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: 66 to its own declarations, 134 to Mathlib’s documentation. 30 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.

import Mathlibnamespace OAInoncomputable sectionuniverse uG uV uE uX uH uI uβ uαopen scoped BigOperators Classical ComplexConjugate InnerProductSpaceopen Filter Topologynamespace Thorpabbrev Position (d : ℕ) := Fin d → Boolnamespace Blockvariable {I : Type uI} {β : Type uβ} {α : Type uα}def perm (p : I → Equiv.Perm β) : Equiv.Perm (I × β) where  toFun x := (x.1, p x.1 x.2)  invFun x := (x.1, (p x.1)⁻¹ x.2)  left_inv x := by simp  right_inv x := by simpdef hom : (I → Equiv.Perm β) →* Equiv.Perm (I × β) where  toFun := perm  map_one' := by ext ⟨i,b⟩ <;> rfl  map_mul' p q := by ext ⟨i,b⟩ <;> rfldef embedding (e : α ≃ I × β) : (I → Equiv.Perm β) →* Equiv.Perm α :=  (e.symm.permCongrHom).toMonoidHom.comp homend Blocknamespace Fouriervariable {G : Type uG} [Group G] [Fintype G]variable {V : Type uV} [AddCommGroup V] [Module ℂ V]def integrated (ρ : Representation ℂ G V) (f : G → ℂ) : Module.End ℂ V :=  ∑ g, f g • ρ gend Fouriernamespace Youngabbrev Cells (D : YoungDiagram) := {p : ℕ × ℕ // p ∈ D.cells}def rowCellsEquiv (D : YoungDiagram) : Cells D ≃ (i : Fin (D.colLen 0)) × Fin (D.rowLen i) where  toFun x := ⟨⟨x.val.1, YoungDiagram.mem_iff_lt_colLen.mp (D.up_left_mem le_rfl (Nat.zero_le _) x.property)⟩,    ⟨x.val.2, YoungDiagram.mem_iff_lt_rowLen.mp x.property⟩⟩  invFun x := ⟨(x.1, x.2), YoungDiagram.mem_iff_lt_rowLen.mpr x.2.isLt⟩  left_inv x := rfl  right_inv x := by cases x; rfldef ofPartition {n : ℕ} (p : Nat.Partition n) : YoungDiagram :=  YoungDiagram.ofRowLens (p.parts.sort (· ≥ ·)) (Multiset.pairwise_sort _ _).sortedGEdef longest (D : YoungDiagram) : ℕ := max (D.rowLen 0) (D.colLen 0)end Youngnamespace Spechtvariable {G : Type uG} [Group G]variable {E : Type uE} [NormedAddCommGroup E] [InnerProductSpace ℂ E]def cyclic (ρ : Representation ℂ G E) (e : E) : Subrepresentation ρ where  toSubmodule := Submodule.span ℂ (Set.range fun g => ρ g e)  apply_mem_toSubmodule g := by    intro v hv    induction hv using Submodule.span_induction with    | mem v hv =>      obtain ⟨h, rfl⟩ := hv      exact Submodule.subset_span ⟨g * h, by simp⟩    | zero => simp    | add x y hx hy ihx ihy =>      simpa using (Submodule.span ℂ (Set.range fun h => ρ h e)).add_mem ihx ihy    | smul a x hx ih =>      simpa using (Submodule.span ℂ (Set.range fun h => ρ h e)).smul_mem a ihnamespace PermutationSpacevariable {X : Type uX} [Fintype X] [MulAction G X]def rep : Representation ℂ G (EuclideanSpace ℂ X) where  toFun g := {    toFun v := WithLp.toLp 2 (fun x => v (g⁻¹ • x))    map_add' := by intro v w; rfl    map_smul' := by intro a v; rfl }  map_one' := by ext v x; simp  map_mul' := by    intro g h    ext v x    change v ((g * h)⁻¹ • x) = v (h⁻¹ • g⁻¹ • x)    simp [mul_smul]variable {H : Type uH} [Group H] [Fintype H]def alternator (ι : H →* G) (χ : H →* ℂ) : Module.End ℂ (EuclideanSpace ℂ X) :=  ∑ h, χ h • rep (ι h)end PermutationSpacevariable {α : Type uα} [Fintype α]def Tabloid (r : α → ℕ) := {f : α → ℕ // ∃ g : Equiv.Perm α, f = r ∘ g}instance tabloidFinite (r : α → ℕ) : Finite (Tabloid r) := by  apply Finite.of_surjective (fun g : Equiv.Perm α => (⟨r ∘ g, g, rfl⟩ : Tabloid r))  rintro ⟨f, g, rfl⟩  exact ⟨g, rfl⟩instance tabloidFintype (r : α → ℕ) : Fintype (Tabloid r) := Fintype.ofFinite _instance tabloidAction (r : α → ℕ) : MulAction (Equiv.Perm α) (Tabloid r) where  smul g f := ⟨f.val ∘ ⇑(g⁻¹ : Equiv.Perm α), by    obtain ⟨h, hh⟩ := f.property    refine ⟨h * g⁻¹, ?_⟩    funext x    simp only [Function.comp_apply, hh, Equiv.Perm.mul_apply]⟩  one_smul f := by apply Subtype.ext; funext x; rfl  mul_smul g h f := by    apply Subtype.ext    funext x    change f.val ((g * h)⁻¹ x) = f.val (h⁻¹ (g⁻¹ x))    rw [mul_inv_rev, Equiv.Perm.mul_apply]def baseTabloid (r : α → ℕ) : Tabloid r := ⟨r, 1, by funext x; rfl⟩def fiberGroup (c : α → ℕ) : Subgroup (Equiv.Perm α) where  carrier := {g | ∀ x, c (g x) = c x}  one_mem' := by intro x; rfl  mul_mem' := by intro g h hg hh x; exact (hg (h x)).trans (hh x)  inv_mem' := by    intro g hg x    have hh := hg (g⁻¹ x)    change c (g (g.symm x)) = c (g.symm x) at hh    rw [g.apply_symm_apply] at hh    exact hh.symmdef complexSign : Equiv.Perm α →* ℂ where  toFun g := ((Equiv.Perm.sign g : ℤˣ) : ℤ)  map_one' := by simp  map_mul' := by intro g h; simpvariable (D : YoungDiagram) (t : α ≃ Thorp.Young.Cells D)def tableauRow (x : α) : ℕ := (t x).val.1def tableauCol (x : α) : ℕ := (t x).val.2def tabloidRep : Representation ℂ (Equiv.Perm α) (EuclideanSpace ℂ (Tabloid (tableauRow D t))) :=  PermutationSpace.repdef columnAlternator : Module.End ℂ (EuclideanSpace ℂ (Tabloid (tableauRow D t))) :=  PermutationSpace.alternator (fiberGroup (tableauCol D t)).subtype    (complexSign.comp (fiberGroup (tableauCol D t)).subtype)def polytabloid : EuclideanSpace ℂ (Tabloid (tableauRow D t)) :=  columnAlternator D t (EuclideanSpace.single (baseTabloid (tableauRow D t)) (1 : ℂ))def module : Subrepresentation (tabloidRep D t) := cyclic (tabloidRep D t) (polytabloid D t)abbrev Shape (α : Type uα) [Fintype α] := Nat.Partition (Fintype.card α)def canonicalTableau (p : Shape α) : α ≃ Thorp.Young.Cells (Thorp.Young.ofPartition p) := by  have card_cells_eq_sum (D : YoungDiagram) : Fintype.card (Thorp.Young.Cells D) = D.rowLens.sum := by    rw [Fintype.card_congr (Thorp.Young.rowCellsEquiv D), Fintype.card_sigma]    simp only [Fintype.card_fin, YoungDiagram.rowLens]    rw [← List.sum_toFinset _ List.nodup_range, List.toFinset_range, Finset.sum_range]  have rowLens_ofPartition {n : ℕ} (p : Nat.Partition n) :      (Thorp.Young.ofPartition p).rowLens = p.parts.sort (· ≥ ·) := by    apply YoungDiagram.rowLens_ofRowLens_eq_self    intro x hx    exact p.parts_pos ((Multiset.mem_sort _).mp hx)  have card_ofPartition {n : ℕ} (p : Nat.Partition n) : Fintype.card (Thorp.Young.Cells (Thorp.Young.ofPartition p)) = n := by    rw [card_cells_eq_sum, rowLens_ofPartition]    simpa only [← Multiset.sum_coe, Multiset.sort_eq] using p.parts_sum  exact Fintype.equivOfCardEq (card_ofPartition p).symmabbrev Space (p : Shape α) := (module (Thorp.Young.ofPartition p) (canonicalTableau p)).toSubmoduledef degree (p : Shape α) : ℕ := Module.finrank ℂ (Space p)open Thorp.Youngabbrev NShape (n : ℕ) := Shape (Fin n)def defect {n : ℕ} (p : NShape n) : ℕ := n - longest (ofPartition p)end Spechtnamespace Currentdef reciprocalFirst (n : ℕ) : ℝ :=  ∑ p : Specht.NShape n, (Specht.degree p : ℝ)⁻¹def exceptionalFirst (n : ℕ) : ℝ :=  ∑ p : Specht.NShape n, if 0 < Specht.defect p then (Specht.degree p : ℝ)⁻¹ else 0def C1 : ℝ := sSup (Set.range (fun n : {n : ℕ // 1 ≤ n} => reciprocalFirst n.val))theorem first_reciprocal_main :    (BddAbove (Set.range (fun n : {n : ℕ // 1 ≤ n} => reciprocalFirst n.val)) ∧    (∀ n : ℕ, 1 ≤ n → reciprocalFirst n ≤ C1) ∧    Tendsto exceptionalFirst atTop (nhds 0)) ∧    (∀ (d : ℕ) (_hd : 3 ≤ d)    (e : Position d ≃ Fin 8 × Fin (2 ^ (d - 3)))    {E : Type uE} [NormedAddCommGroup E] [InnerProductSpace ℂ E]    [FiniteDimensional ℂ E]    (ρ : Representation ℂ (Equiv.Perm (Position d)) E)    [Representation.IsIrreducible ρ]    (_ : ∀ g x y, ⟪ρ g x, ρ g y⟫_ℂ = ⟪x, y⟫_ℂ)    (ν : Equiv.Perm (Position d) → ℝ)    (_ : ∀ g, 0 ≤ ν g) (_ : ∑ g, ν g = 1)    (_ : ∀ (i : Fin 8) (g : Equiv.Perm (Position d)),      ∑ h : Equiv.Perm (Fin (2 ^ (d - 3))),          ν (g * Block.embedding e (Pi.mulSingle i h)) ≤        4 * (Fintype.card (Equiv.Perm (Fin (2 ^ (d - 3)))) : ℝ) /          Fintype.card (Equiv.Perm (Position d))),    ‖LinearMap.toContinuousLinearMap (Fourier.integrated ρ (fun g => (ν g : ℂ)))‖ ≤      Real.sqrt (32 * C1) * (Module.finrank ℂ E : ℝ) ^ (-5 / 16 : ℝ)) := by  sorryend Currentend Thorpendend 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.

Optimal-order mixing of the Thorp shuffle

Theorem (Optimal-order mixing)

As d\to\infty,

\|q_d^{*(1600d)}-U_n\|_{\mathrm{TV}}\longrightarrow0.

For every integer t\ge0,

\|q_d^{*t}-U_n\|_{\mathrm{TV}} \ge 1-\frac{2^{tn/2}}{n!}.

Consequently the mixing time at distance 1/4 satisfies

t_{\mathrm{mix}}(d)\ge \left\lceil\frac2n\log_2\frac{3n!}{4}\right\rceil =2d-O(1), \qquad t_{\mathrm{mix}}(d)=\Theta(d).
Section 1, Introduction Read it in the paper TeX source, line 53
Show the TeX
As $d\to\infty$,
\[
 \|q_d^{*(1600d)}-U_n\|_{\mathrm{TV}}\longrightarrow0.
\]
For every integer $t\ge0$,
\[
 \|q_d^{*t}-U_n\|_{\mathrm{TV}}
 \ge 1-\frac{2^{tn/2}}{n!}.
\]
Consequently the mixing time at distance $1/4$ satisfies
\[
 t_{\mathrm{mix}}(d)\ge
 \left\lceil\frac2n\log_2\frac{3n!}{4}\right\rceil
 =2d-O(1),
 \qquad t_{\mathrm{mix}}(d)=\Theta(d).
\]

From partial permutation information to Fourier bounds

Theorem (Complementary cosets control Fourier matrices)

Partition X into b nonempty sets M_1,\ldots,M_b. Put H_i=H_{M_i}. Suppose f is a nonnegative measure on G of mass at most one and, for every g\in G and i,

f(gH_i)\le \frac{B}{[G:H_i]}.

For every u>0 and every irreducible \rho of degree D,

\|\widehat f(\rho)\|_{\HS}^2 \le bBC_uD^{-1+(u+2)/b}.

There is also an independent orbit-span proof of the bound

\|\widehat f(\rho)\|_{\op}^2 \le bBC_uD^{-1+(u+2)/b}.

No restriction is imposed on block sizes or on the multiplicities in \rho|_{H_1\times\cdots\times H_b}.

Section 1, What partial observations can determine Read it in the paper TeX source, line 18
Show the TeX
Partition $X$ into $b$ nonempty sets $M_1,\ldots,M_b$. Put $H_i=H_{M_i}$. Suppose $f$ is a nonnegative measure on $G$ of mass at most one and, for every $g\in G$ and $i$,
\begin{equation}
 f(gH_i)\le \frac{B}{[G:H_i]}.
\end{equation}
For every $u>0$ and every irreducible $\rho$ of degree $D$,
\begin{equation}
 \|\widehat f(\rho)\|_{\HS}^2
 \le bBC_uD^{-1+(u+2)/b}.
\end{equation}
There is also an independent orbit-span proof of the bound
\begin{equation}
 \|\widehat f(\rho)\|_{\op}^2
 \le bBC_uD^{-1+(u+2)/b}.
\end{equation}
No restriction is imposed on block sizes or on the multiplicities in $\rho|_{H_1\times\cdots\times H_b}$.

Conditional permutations in a revealed switching environment

Theorem (Conditional permutation and full-deck mixing)

Let n=2^d, and start the shuffle from any deterministic deck. After J(s_0+1) sweeps, where s_0=400 and J=40000, the conditional free-slot law defined above satisfies

\sup_{\text{initial layouts}}\E_{\mathcal E} \|\nu_{\mathcal E}-U_{n/2}\|_{\TV}\longrightarrow0 \qquad(d\longrightarrow\infty).

Consequently the full-deck law approaches uniform, uniformly in the starting deck, after 16\,040\,400d physical shuffles. For every integer t\ge0, after t physical shuffles the full-deck distance from uniform is at least 1-2^{tn/2}/n!. Thus the full-deck mixing time is of order d.

Section 1, Introduction Read it in the paper TeX source, line 11
Show the TeX
Let $n=2^d$, and start the shuffle from any deterministic deck.
After $J(s_0+1)$ sweeps, where $s_0=400$ and $J=40000$, the conditional free-slot law defined above satisfies
\[
 \sup_{\text{initial layouts}}\E_{\mathcal E}
       \|\nu_{\mathcal E}-U_{n/2}\|_{\TV}\longrightarrow0
       \qquad(d\longrightarrow\infty).
\]
Consequently the full-deck law approaches uniform, uniformly in the starting deck, after $16\,040\,400d$ physical shuffles. For every integer $t\ge0$, after $t$ physical shuffles the full-deck distance from uniform is at least
$1-2^{tn/2}/n!$. Thus the full-deck mixing time is of order $d$.

Routing densities and representation contraction for Thorp sweeps

Theorem (Routing density and representation contraction)

There are absolute constants \eta,c,C>0 such that, with a=1/1000,

\log\E_{y\sim u_{N,k}}R_x(y)^{1+a} \le Ck(k/N)^\eta \qquad(1\le k\le N),

uniformly over every starting injection x. For every sufficiently large dyadic N and every nontrivial irreducible representation,

T_N(\lambda)=0\quad\hbox{or}\quad \|T_N(\lambda)\|_{\op}\le D_\lambda^{-c}.

Consequently an absolute number of forward sweeps has worst-start total-variation distance from uniform tending to zero as d\to\infty.

Section 1, Introduction Read it in the paper TeX source, line 30
Show the TeX
There are absolute constants $\eta,c,C>0$ such that, with $a=1/1000$,
\[
 \log\E_{y\sim u_{N,k}}R_x(y)^{1+a}
 \le Ck(k/N)^\eta
 \qquad(1\le k\le N),
\]
uniformly over every starting injection $x$. For every sufficiently
large dyadic $N$ and every nontrivial irreducible representation,
\[
 T_N(\lambda)=0\quad\hbox{or}\quad
 \|T_N(\lambda)\|_{\op}\le D_\lambda^{-c}.
\]
Consequently an absolute number of forward sweeps has worst-start
total-variation distance from uniform tending to zero as $d\to\infty$.

Row–column symmetry and contraction of coordinate sweeps

Theorem (Weighted sweep moments)

There are positive weights W_\lambda, an absolute finite p_*, and real exponents 2\le p_d\le p_* such that, for every d\ge1 and every \lambda\vdash2^d,

D_\lambda^{3/4}\le W_\lambda\le D_\lambda, \qquad W_\lambda\|K_d(\lambda)\|_{p_d}^{p_d}\le1.

Consequently \|K_d(\lambda)\|_{\rm op}\le D_\lambda^{-3/(4p_*)}.

Section 1, Introduction Read it in the paper TeX source, line 60
Show the TeX
There are positive weights $W_\lambda$, an absolute finite $p_*$, and real
exponents $2\le p_d\le p_*$ such that, for every $d\ge1$ and every
$\lambda\vdash2^d$,
\begin{equation}
 D_\lambda^{3/4}\le W_\lambda\le D_\lambda,
 \qquad W_\lambda\|K_d(\lambda)\|_{p_d}^{p_d}\le1.
\end{equation}
Consequently $\|K_d(\lambda)\|_{\rm op}\le D_\lambda^{-3/(4p_*)}$.
Corollary (Optimal order of mixing)

There is an absolute constant C such that, for every d\ge1,

\left\lceil\frac2N\log_2\frac{3N!}{4}\right\rceil \le t_{\rm mix}(d)\le Cd, \qquad N=2^d.

In particular t_{\rm mix}(d)=\Theta(d), and its lower bound is 2d-O(1).

Section 1, Introduction Read it in the paper TeX source, line 93
Show the TeX
There is an absolute constant $C$ such that, for every $d\ge1$,
\[
 \left\lceil\frac2N\log_2\frac{3N!}{4}\right\rceil
 \le t_{\rm mix}(d)\le Cd,
 \qquad N=2^d.
\]
In particular $t_{\rm mix}(d)=\Theta(d)$, and its lower bound is
$2d-O(1)$.

Random-subspace tests and trace smoothing for coordinate sweeps

Theorem (Regular-trace smoothing)

There is an absolute P\ge2 such that for every dyadic n\ge2,

\operatorname{Tr}_{\rm reg}|Q_n|^P\le1+n^{-10}.

If v is an integer with 2v\ge P, then v independent sweeps have total-variation distance at most \frac12n^{-5} from uniform, from every deterministic initial deck. Here \|\mu-\nu\|_{\rm TV}=\tfrac12\sum_g|\mu(g)-\nu(g)|.

Section 1, Introduction Read it in the paper TeX source, line 24
Show the TeX
There is an absolute $P\ge2$ such that for every dyadic $n\ge2$,
\begin{equation}
 \operatorname{Tr}_{\rm reg}|Q_n|^P\le1+n^{-10}.
\end{equation}
If $v$ is an integer with $2v\ge P$, then $v$ independent sweeps have total-variation distance at most $\frac12n^{-5}$ from uniform, from every deterministic initial deck. Here $\|\mu-\nu\|_{\rm TV}=\tfrac12\sum_g|\mu(g)-\nu(g)|$.

Compatibility entropy and the spectrum of a Thorp sweep

Theorem (Weighted compatibility)

There are absolute constants L,C_0>0 such that the following holds. Put m=\sqrt n, assume m/2\le A,D\le2m, and take m sufficiently large that \theta=1-L/\log m>0. For all nonnegative functions w_i:S_D\to[0,\infty) and v_k:S_A\to[0,\infty),

\frac{n!}{|R||C|}\, \mathbb E_U\!\left[\mathbf1_{\mathcal I} \prod_{i=1}^A w_i(r_i)\prod_{k=1}^D v_k(c_k)\right] \le e^{C_0n^{.54}} \prod_{i=1}^A(\mathbb E w_i^{1/\theta})^\theta \prod_{k=1}^D(\mathbb E v_k^{1/\theta})^\theta .

The expectations on the right are uniform on the indicated symmetric groups, and logarithms are natural.

Section 1, Introduction Read it in the paper TeX source, line 24
Show the TeX
There are absolute constants $L,C_0>0$ such that the following holds. Put $m=\sqrt n$, assume $m/2\le A,D\le2m$, and take $m$ sufficiently large that $\theta=1-L/\log m>0$. For all nonnegative functions $w_i:S_D\to[0,\infty)$ and $v_k:S_A\to[0,\infty)$,
\begin{equation}
 \frac{n!}{|R||C|}\,
 \mathbb E_U\!\left[\mathbf1_{\mathcal I}
       \prod_{i=1}^A w_i(r_i)\prod_{k=1}^D v_k(c_k)\right]
 \le e^{C_0n^{.54}}
       \prod_{i=1}^A(\mathbb E w_i^{1/\theta})^\theta
       \prod_{k=1}^D(\mathbb E v_k^{1/\theta})^\theta .
\end{equation}
The expectations on the right are uniform on the indicated symmetric groups, and logarithms are natural.
Theorem (A bounded regular moment)

There is an absolute finite p_*>0 such that, for every dyadic n,

Z_n(p_*)\le1+\frac1{16}.

For every integer M\ge p_*, M independent forward sweeps have worst-start total-variation distance at most 1/8 from uniform.

Section 1, Introduction Read it in the paper TeX source, line 45
Show the TeX
There is an absolute finite $p_*>0$ such that, for every dyadic $n$,
\begin{equation}
 Z_n(p_*)\le1+\frac1{16}.
\end{equation}
For every integer $M\ge p_*$, $M$ independent forward sweeps have worst-start total-variation distance at most $1/8$ from uniform.
Corollary (Singular ranks and full-deck mixing)

For every nontrivial \lambda\vdash n and 1\le r\le D_\lambda,

s_r(T_{n,\lambda})\le(16D_\lambda r)^{-1/(2p_*)}.

If s_j(T_n) denotes the full regular singular list, including all multiplicities and zeros, then

s_j(T_n)\le j^{-1/(2p_*)}\qquad(1\le j\le n!).

The constant singular value is the first value. The physical Thorp chain has worst-start 1/4 mixing time \Theta(d); more precisely its lower bound is 2d-O(1). For every fixed integer M>p_*, the worst-start total-variation distance after Md physical shuffles tends to zero as d\to\infty.

Section 1, Introduction Read it in the paper TeX source, line 53
Show the TeX
For every nontrivial $\lambda\vdash n$ and $1\le r\le D_\lambda$,
\[
 s_r(T_{n,\lambda})\le(16D_\lambda r)^{-1/(2p_*)}.
\]
If $s_j(T_n)$ denotes the full regular singular list, including all multiplicities and zeros, then
\[
 s_j(T_n)\le j^{-1/(2p_*)}\qquad(1\le j\le n!).
\]
The constant singular value is the first value. The physical Thorp chain has worst-start $1/4$ mixing time $\Theta(d)$; more precisely its lower bound is $2d-O(1)$. For every fixed integer $M>p_*$, the worst-start total-variation distance after $Md$ physical shuffles tends to zero as $d\to\infty$.

Signed tensor densities and diagram budgets for the Thorp shuffle

Theorem (A moment bound for every signed occurrence)

For each sufficiently small fixed \bar\eta>0, choose a sufficiently small \bar\kappa>0 with \bar\kappa<\bar\eta/256. There is an integer r\ge1, depending only on these fixed constants, such that for every d\ge1, every \lambda\vdash n=2^d, and every occurrence (ten:spin:eq:1),

\log\!\left(D_\lambda\operatorname{Tr}_{V_\lambda}(B_n^*B_n)^r\right) \le\eta_d F(\alpha,\beta)+g_n(l),

where

\eta_d=\bar\eta\left(1-\frac1{2\sqrt d}\right),\qquad \kappa_d=\bar\kappa\left(1-\frac1{2\sqrt d}\right),\qquad g_n(l)=\max\{0,\kappa_d l\log n-l\log(n/l)\}.

Set g_n(0)=0 and interpret the logarithm of a zero trace as -\infty.

Section 1, Introduction Read it in the paper TeX source, line 48
Show the TeX
For each sufficiently small fixed $\bar\eta>0$, choose a sufficiently
small $\bar\kappa>0$ with $\bar\kappa<\bar\eta/256$. There is an
integer $r\ge1$, depending only on these fixed constants, such that for
every $d\ge1$, every $\lambda\vdash n=2^d$, and every
occurrence~\eqref{ten:spin:eq:1},
\begin{equation}
 \log\!\left(D_\lambda\operatorname{Tr}_{V_\lambda}(B_n^*B_n)^r\right)
 \le\eta_d F(\alpha,\beta)+g_n(l),
\end{equation}
where
\[
 \eta_d=\bar\eta\left(1-\frac1{2\sqrt d}\right),\qquad
 \kappa_d=\bar\kappa\left(1-\frac1{2\sqrt d}\right),\qquad
 g_n(l)=\max\{0,\kappa_d l\log n-l\log(n/l)\}.
\]
Set $g_n(0)=0$ and interpret the logarithm of a zero trace as $-\infty$.
Corollary (Fixed-sweep convergence of the full deck)

There is an absolute positive integer L such that

\mathbb E_{U_{S_n}}|f_{d,L}-1|^2\longrightarrow0 \qquad(d\longrightarrow\infty).

The convergence is uniform over starting orders. Moreover t_{\mathrm{mix}}(d)=\Theta(d).

Section 1, Introduction Read it in the paper TeX source, line 82
Show the TeX
There is an absolute positive integer $L$ such that
\[
 \mathbb E_{U_{S_n}}|f_{d,L}-1|^2\longrightarrow0
 \qquad(d\longrightarrow\infty).
\]
The convergence is uniform over starting orders. Moreover
$t_{\mathrm{mix}}(d)=\Theta(d)$.

Conditional coordinate sweeps and analytic transfer

Theorem (Binary sweep contraction)

There are absolute constants g>0 and d_0 such that, for d\ge d_0 and every \lambda\vdash 2^d,

\|K_\lambda\|_{\op}\le D_\lambda^{-g}.

The sign representation is annihilated. There is an absolute positive integer w such that the law after w independent sweeps converges to uniform in total variation as d\to\infty, uniformly over deterministic initial decks.

Section 1, Introduction Read it in the paper TeX source, line 54
Show the TeX
There are absolute constants \(g>0\) and \(d_0\) such that, for \(d\ge d_0\)
and every \(\lambda\vdash 2^d\),
\[
 \|K_\lambda\|_{\op}\le D_\lambda^{-g}.
\]
The sign representation is annihilated. There is an absolute positive integer \(w\)
such that the law after \(w\) independent sweeps converges to uniform in
total variation as \(d\to\infty\), uniformly over deterministic initial
decks.
Proposition (Support obstruction)

For every integer t\ge0,

\|q_d^{*t}-U_N\|_{\TV}\ge1-\frac{2^{tN/2}}{N!}.

Consequently,

t_{\rm mix}(d)\ge \left\lceil\frac2N\log_2\!\left(\frac{3N!}{4}\right)\right\rceil =2d-O(1).
Section 1, Introduction Read it in the paper TeX source, line 68
Show the TeX
For every integer \(t\ge0\),
\[
 \|q_d^{*t}-U_N\|_{\TV}\ge1-\frac{2^{tN/2}}{N!}.
\]
Consequently,
\[
 t_{\rm mix}(d)\ge
 \left\lceil\frac2N\log_2\!\left(\frac{3N!}{4}\right)\right\rceil
 =2d-O(1).
\]

A strict four-row permanent inequality and permutation moments

Theorem (A robust four-row inequality)

There are absolute constants p_0\in(4/3,2) and \varepsilon>0 with the following property. Let \nu be a probability measure on S_4 such that

\|\nu-u\|_{\TV}<\varepsilon, \qquad \nu\{\pi:\pi(i)=j\}=\frac14\quad(1\le i,j\le4).

Then every four nonnegative functions on \{1,2,3,4\} satisfy

\E_\nu\prod_{i=1}^4f_i(\pi(i))\le\prod_{i=1}^4\|f_i\|_{p_0}.
Section 1, Introduction Read it in the paper TeX source, line 14
Show the TeX
There are absolute constants $p_0\in(4/3,2)$ and $\varepsilon>0$ with the following property. Let $\nu$ be a probability measure on $S_4$ such that
\[
 \|\nu-u\|_{\TV}<\varepsilon,
 \qquad
 \nu\{\pi:\pi(i)=j\}=\frac14\quad(1\le i,j\le4).
\]
Then every four nonnegative functions on $\{1,2,3,4\}$ satisfy
\begin{equation}
 \E_\nu\prod_{i=1}^4f_i(\pi(i))\le\prod_{i=1}^4\|f_i\|_{p_0}.
\end{equation}
Theorem (A fixed moment with a degree saving)

There exist an even integer r\ge2 and \eta>0, independent of N, such that for every dyadic N and every \lambda\vdash N,

D_\lambda\Tr B_N(\lambda)^r\le D_\lambda^{1-\eta}.

Consequently there is an absolute integer q for which the total-variation distance of q independent forward sweeps from uniform tends to zero as N\to\infty, uniformly over the starting deck.

Section 1, Introduction Read it in the paper TeX source, line 46
Show the TeX
There exist an even integer $r\ge2$ and $\eta>0$, independent of $N$, such that for every dyadic $N$ and every $\lambda\vdash N$,
\begin{equation}
 D_\lambda\Tr B_N(\lambda)^r\le D_\lambda^{1-\eta}.
\end{equation}
Consequently there is an absolute integer $q$ for which the total-variation distance of $q$ independent forward sweeps from uniform tends to zero as $N\to\infty$, uniformly over the starting deck.
Configuration and file facts
OpenAI’s Lean catalogue
OpenAI’s Lean catalogue does not list this as a main result; the release’s Lean notes for family 238 link it.
Solution module
OAI.Probability.ThorpShuffle.FirstMain
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
34 local vocabulary declarations
Lines of Lean, without comments or blank lines
138
Second proof-verification program (nanoda)
Off in OpenAI's configuration.

Statement comparison

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

Plectis Atlas

Reciprocal Specht degrees and eight-block Fourier bound

Family 238: Optimal logarithmic mixing of the Thorp shuffle

No paper statement selected

no paper statement matches the Lean text clearly enough to pair, so the closest candidates are listed below.

The Lean statement says

theorem first_reciprocal_main :    (BddAbove (Set.range (fun n : {n : ℕ // 1 ≤ n} => reciprocalFirst n.val)) ∧    (∀ n : ℕ, 1 ≤ n → reciprocalFirst n ≤ C1) ∧    Tendsto exceptionalFirst atTop (nhds 0)) ∧    (∀ (d : ℕ) (_hd : 3 ≤ d)    (e : Position d ≃ Fin 8 × Fin (2 ^ (d - 3)))    {E : Type uE} [NormedAddCommGroup E] [InnerProductSpace ℂ E]    [FiniteDimensional ℂ E]    (ρ : Representation ℂ (Equiv.Perm (Position d)) E)    [Representation.IsIrreducible ρ]    (_ : ∀ g x y, ⟪ρ g x, ρ g y⟫_ℂ = ⟪x, y⟫_ℂ)    (ν : Equiv.Perm (Position d) → ℝ)    (_ : ∀ g, 0 ≤ ν g) (_ : ∑ g, ν g = 1)    (_ : ∀ (i : Fin 8) (g : Equiv.Perm (Position d)),      ∑ h : Equiv.Perm (Fin (2 ^ (d - 3))),          ν (g * Block.embedding e (Pi.mulSingle i h)) ≤        4 * (Fintype.card (Equiv.Perm (Fin (2 ^ (d - 3)))) : ℝ) /          Fintype.card (Equiv.Perm (Position d))),

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.

No paper theorem is paired with this Lean statement.three independent groups report that Comparator accepted runs for this file at the release version shown here.Statement review: none recorded

34 local vocabulary declarationsAllowed axioms: propext, Quot.sound, Classical.choiceopenai/math at fd4aeebwcook04.github.io/plectis-atlas/statements/ThorpFirstReciprocal.html

Recorded comparisons with the paper

Atlas records no contributed comparison of this statement with the paper.

Contributed Comparator run reports

Atlas records no contributed report of running Comparator for this statement file.

More about this statement

  • Commentary The Lean statement covers only powers of two, where the paper's Fourier bound holds for every n divisible by eight. Robert Joseph George, Do the Lean statements in openai/math match their papers?, 2026-10-07 Source

Compare this statement with the paperShare a Comparator run reportSuggest a change