Plectis Atlas
Search

↑ and ↓ move, Enter opens, Esc closes.

Lean statement

Gaussian replacement and information bounds

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.

Theorems selected for verification: OAI.CurrentProjection.mixedMomentMain OAI.CurrentProjection.actualRowMain OAI.CurrentProjection.actualRowRefinement OAI.CurrentProjection.actualRowSourceMain OAI.CurrentProjection.actualRowSourceRefinement OAI.CurrentProjection.criticalComparisonMain OAI.CurrentProjection.oneLevelComparisonMain OAI.CurrentProjection.twoLabelComparisonMain OAI.CurrentProjection.hybridBlockMain OAI.CurrentProjection.fiberTwoPointMain OAI.CurrentProjection.fiberBlockMain

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

The Lean statement

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

def MixedMomentMain : Prop :=  ∃ C : ℝ, 0 < C ∧ ∀ (d m r q : ℕ), AdmissibleDimensions d m r q →    ∀ (ρ : Measure (Sphere d)), IsFiniteMeasure ρ →    ∀ (B D : ℝ), 0 < B → 0 < D → LocalGrowth ρ (m+r) B → LocalGrowth ρ (d-1) D →    (∀ (s : Sphere d) (δ : ℝ), 0 < δ →      (∫⁻ X, (∫⁻ Z, cubeAverage ρ (Fin.append X Z)        (label (Fin.append X Z) (s : Vector d)) δ ∂gaussianRows r d)^q          ∂gaussianRows m d) ≤ (momentConstant C d B D)^q) ∧    (ρ ≪ uniformSphere d → ∃ E : Set (Sphere d), MeasurableSet E ∧ ρ E = 0 ∧      ∀ s ∉ E,        (∀ᵐ G ∂gaussianRows (m+r) d,          Tendsto (fun δ : ℝ => cubeAverage ρ G (label G (s : Vector d)) δ)            (𝓝[>] 0) (𝓝 (exactDensity ρ G (label G (s : Vector d))))) ∧        ((∫⁻ X, (∫⁻ Z, exactDensity ρ (Fin.append X Z)          (label (Fin.append X Z) (s : Vector d)) ∂gaussianRows r d)^q            ∂gaussianRows m d) ≤ (momentConstant C d B D)^q) ∧        (ρ ≠ 0 → ∀ᵐ G ∂gaussianRows (m+r) d,          0 < exactDensity ρ G (label G (s : Vector d)) ∧          exactDensity ρ G (label G (s : Vector d)) < ∞))def CriticalComparisonMain : Prop :=  ∃ (K : ℝ) (d₀ : ℕ), 0 < K ∧ ∀ (d : ℕ), d₀ ≤ d →    ∀ (W : Type) [MeasurableSpace W] [Countable W] [MeasurableSingletonClass W],    ∀ (P : Measure ((Sphere d×W)×Rows (d/10) d)) [IsProbabilityMeasure P],    (P.map swapLast).fst = (uniformSphere d).prod (gaussianRows (d/10) d) →    shannonEntropy (P.map swapLast).snd ≤ ENNReal.ofReal ((d:ℝ)^2) →    exposedInformation (P.fst.prod (gaussianRows (d/10+(d/2-d/10)) d)) ≤      exposedInformation (alignedExperiment (r:=d/2-d/10) P) + ENNReal.ofReal (K*d)def OneLevelComparisonMain : Prop :=  ∃ (C : ℝ) (d₀ : ℕ), 0 < C ∧ ∀ d, d₀ ≤ d →    ∀ (U : Type) [MeasurableSpace U] [Finite U] [MeasurableSingletonClass U],    ∀ (P : Measure ((Sphere d×U)×Rows (d/32) d)) [IsProbabilityMeasure P],    (P.map swapLast).fst = (uniformSphere d).prod (gaussianRows (d/32) d) →    exposedInformation (P.fst.prod (gaussianRows (d/32+(d/4-d/32)) d)) ≤      exposedInformation (alignedExperiment (r:=d/4-d/32) P) +      ENNReal.ofReal (C*((d:ℝ)+Real.log (1+(d:ℝ)+(shannonEntropy P.fst.snd).toReal)+        (shannonEntropy P.fst.snd).toReal/(d:ℝ)))def TwoLabelComparisonMain : Prop :=  ∃ (C : ℝ) (d₀ : ℕ), 0 < C ∧ ∀ d, d₀ ≤ d →    ∀ (V : Type) [MeasurableSpace V] [Finite V] [MeasurableSingletonClass V],    ∀ (P : Measure ((Sphere d×V)×Rows (d/8) d)) [IsProbabilityMeasure P],    (P.map swapLast).fst = (uniformSphere d).prod (gaussianRows (d/8) d) →    shannonEntropy P.fst.snd ≤ ENNReal.ofReal ((d:ℝ)^2) →    exposedInformation (P.fst.prod (gaussianRows (d/8+(d/2-d/8)) d)) ≤      exposedInformation (alignedExperiment (r:=d/2-d/8) P) + ENNReal.ofReal (C*d)def HybridBlockMain : Prop :=  ∃ (C C' : ℝ) (d₀ : ℕ), 0 < C ∧ 0 < C' ∧ ∀ d, d₀ ≤ d →    ∀ m, 1 ≤ m → m ≤ d/8 →    ∀ (U V : Type) [Fintype U] [Fintype V]      [MeasurableSpace U] [MeasurableSpace V]      [MeasurableSingletonClass U] [MeasurableSingletonClass V],    ∀ (P : Measure (Sphere d × U)) [IsProbabilityMeasure P],    P.fst = uniformSphere d →    ∀ (κ : Kernel (U × (Rows m d × (Fin m → ℝ))) V) [IsMarkovKernel κ],    ∀ (B : ℝ), 0 ≤ B →    shannonEntropy (endingSignalLaw P κ).snd ≤ ENNReal.ofReal B →    averagedFreshInformation (endingSignalLaw P κ) - averagedFreshInformation P ≤      C*m + (m:ℝ) / hybridCount d * (C + B / (d/8:ℕ)) + B / (d/32:ℕ) ∧    (B ≤ (d:ℝ)^2 →      averagedFreshInformation (endingSignalLaw P κ) - averagedFreshInformation P ≤ C'*d)def FiberBlockMain : Prop :=  ∃ (K : ℝ) (d₀ : ℕ), 0 < K ∧ ∀ d, d₀ ≤ d →    ∀ (U V : Type) [Fintype U] [Fintype V]      [MeasurableSpace U] [MeasurableSpace V]      [MeasurableSingletonClass U] [MeasurableSingletonClass V],    ∀ (P : Measure (Sphere d×U)) [IsProbabilityMeasure P],    P.fst = uniformSphere d →    ∀ (κ : Kernel (U×(Rows (d/10) d×(Fin (d/10)→ℝ))) V) [IsMarkovKernel κ],    ∀ N : ℕ, 1 ≤ N → Fintype.card V ≤ N → Real.log N ≤ (d:ℝ)^2 →    freshInformation (endingSignalLaw P κ) (d/3) ≤ freshInformation P (d/3) + ENNReal.ofReal (K*d)def FiberTwoPointMain : Prop :=  ∀ (d k : ℕ) (_hk : 1 ≤ k) (hkd : k < d-1),    letI : IsProbabilityMeasure (uniformSphere d) :=      uniformSphere_probability_of_pos (by omega)    letI : Nonempty (Sphere d) := nonempty_of_isProbabilityMeasure (uniformSphere d)    IsFiniteMeasure (fiberTwoPointLeft d k) ∧ IsFiniteMeasure (fiberTwoPointRight d k) ∧      fiberTwoPointLeft d k = fiberTwoPointRight d ktheorem mixedMomentMain : MixedMomentMain := by  sorrytheorem actualRowMain {d m r q : ℕ} {W : Type*} [MeasurableSpace W]    [Countable W] [MeasurableSingletonClass W]    (hdim : AdmissibleDimensions d m r q)    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P]    (ν : Measure (Sphere d)) [IsProbabilityMeasure ν]    (hInd : (P.map swapLast).fst = ν.prod (gaussianRows m d))    (H : ℝ) (hν : ν ≤ ENNReal.ofReal H • uniformSphere d)    (hEntropy : shannonEntropy (P.map swapLast).snd ≠ ∞)    (ρ : PositiveMessage (P.map swapLast).snd → Measure (Sphere d))    [∀ w, IsFiniteMeasure (ρ w)]    (_hρac : ∀ w, ρ w ≪ uniformSphere d)    (B D : PositiveMessage (P.map swapLast).snd → ℝ)    (hB : ∀ w, 0 < B w) (hD : ∀ w, 0 < D w)    (hgB : ∀ w, LocalGrowth (ρ w) (m+r) (B w))    (hgD : ∀ w, LocalGrowth (ρ w) (d-1) (D w))    (hCI : Integrable (fun sw : Sphere d×W => Real.log (1+momentBound 9 d      (completeFamily (P.map swapLast).snd B 1 sw.2) (completeFamily (P.map swapLast).snd D 1 sw.2))) P.fst) :    ActualRowConclusion (r:=r) (q:=q) P (completeFamily (P.map swapLast).snd ρ 0)      (completeFamily (P.map swapLast).snd B 1) (completeFamily (P.map swapLast).snd D 1) := by  sorrytheorem actualRowRefinement {d m : ℕ} {W E : Type*} [MeasurableSpace W]    [MeasurableSpace E] [Countable W] [MeasurableSingletonClass W]    [Countable E] [MeasurableSingletonClass E]    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P]    (e : Sphere d×W → E) (he : Measurable e)    (_hEntropy : shannonEntropy      ((P.map (fun p => ((p.1.1,(p.1.2,e p.1)),p.2))).map swapLast).snd ≠ ∞) :    rowInformation (P.map (fun p => ((p.1.1,(p.1.2,e p.1)),p.2))) (gaussianRows m d) =      rowInformation P (gaussianRows m d) := by  sorrytheorem actualRowSourceMain {d m r q : ℕ} {W : Type*} [MeasurableSpace W]    [Countable W] [MeasurableSingletonClass W]    (hdim : AdmissibleDimensions d m r q)    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P]    (ν : Measure (Sphere d)) [IsProbabilityMeasure ν]    (hInd : (P.map swapLast).fst = ν.prod (gaussianRows m d))    (H : ℝ) (hν : ν ≤ ENNReal.ofReal H • uniformSphere d)    (hEntropy : shannonEntropy (P.map swapLast).snd ≠ ∞)    (ρ : PositiveMessage (P.map swapLast).snd → Measure (Sphere d))    [∀ w, IsFiniteMeasure (ρ w)]    (_hρac : ∀ w, ρ w ≪ uniformSphere d)    (B D : PositiveMessage (P.map swapLast).snd → ℝ)    (hB : ∀ w, 0 < B w) (hD : ∀ w, 0 < D w)    (hgB : ∀ w, LocalGrowth (ρ w) (m+r) (B w))    (hgD : ∀ w, LocalGrowth (ρ w) (d-1) (D w))    (hCI : Integrable (fun sw : Sphere d×W => Real.log (1+momentBound 9 d      (completeFamily (P.map swapLast).snd B 1 sw.2) (completeFamily (P.map swapLast).snd D 1 sw.2))) P.fst) :    ActualRowSourceConclusion (r:=r) (q:=q) P (completeFamily (P.map swapLast).snd ρ 0)      (completeFamily (P.map swapLast).snd B 1) (completeFamily (P.map swapLast).snd D 1) := by  sorrytheorem actualRowSourceRefinement {d m : ℕ} {W E : Type*} [MeasurableSpace W]    [MeasurableSpace E] [Countable W] [MeasurableSingletonClass W]    [Countable E] [MeasurableSingletonClass E]    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P]    (ν : Measure (Sphere d)) [IsProbabilityMeasure ν]    (hInd : (P.map swapLast).fst = ν.prod (gaussianRows m d))    (e : Sphere d×W → E) (he : Measurable e)    (hEntropy : shannonEntropy      ((P.map (fun p => ((p.1.1,(p.1.2,e p.1)),p.2))).map swapLast).snd ≠ ∞) :    actualConditionalRowInformation (P.map (fun p => ((p.1.1,(p.1.2,e p.1)),p.2))) =      actualConditionalRowInformation P := by  sorrytheorem criticalComparisonMain : CriticalComparisonMain := by  sorrytheorem oneLevelComparisonMain : OneLevelComparisonMain := by  sorrytheorem twoLabelComparisonMain : TwoLabelComparisonMain := by  sorrytheorem hybridBlockMain : HybridBlockMain := by  sorrytheorem fiberTwoPointMain : FiberTwoPointMain := by  sorrytheorem fiberBlockMain : FiberBlockMain := 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.CurrentProjection.Vector line 12

    abbrev Vector (d : ℕ) := EuclideanSpace ℝ (Fin d)
  • abbreviation OAI.CurrentProjection.Sphere line 14

    abbrev Sphere (d : ℕ) := Metric.sphere (0 : Vector d) 1
  • abbreviation OAI.CurrentProjection.Rows line 16

    abbrev Rows (k d : ℕ) := Fin k → Vector d
  • definition OAI.CurrentProjection.uniformSphere line 18

    def uniformSphere (d : ℕ) : Measure (Sphere d) :=  let σ := (volume : Measure (Vector d)).toSphere  (σ Set.univ)⁻¹ • σ
  • definition OAI.CurrentProjection.gaussianRows line 22

    def gaussianRows (k d : ℕ) : Measure (Rows k d) :=  Measure.pi fun _ => stdGaussian (Vector d)
  • definition OAI.CurrentProjection.label line 25

    def label {k d : ℕ} (g : Rows k d) (s : Vector d) : Fin k → ℝ :=  fun i => ⟪s, g i⟫
  • definition OAI.CurrentProjection.LocalGrowth line 28

    def LocalGrowth {d : ℕ} (ρ : Measure (Sphere d)) (a : ℕ) (B : ℝ) : Prop :=  ∀ z : Vector d, ∀ t : ℝ, 0 < t →    ρ {u | dist (u : Vector d) z ≤ t} ≤ ENNReal.ofReal (B * t ^ a)
  • definition OAI.CurrentProjection.cubeAverage line 32

    def cubeAverage {k d : ℕ} (ρ : Measure (Sphere d)) (g : Rows k d)    (y : Fin k → ℝ) (δ : ℝ) : ℝ≥0∞ :=  ENNReal.ofReal ((2 * δ)⁻¹ ^ k) *    ρ {u | ∀ i, |label g (u : Vector d) i - y i| ≤ δ}
  • definition OAI.CurrentProjection.exactDensity line 37

    def exactDensity {k d : ℕ} (ρ : Measure (Sphere d)) (g : Rows k d)    (y : Fin k → ℝ) : ℝ≥0∞ := by  classical  let f := fun j : ℕ => (cubeAverage ρ g y (1 / (j : ℝ))).toReal  exact if h : ∃ L : ℝ, Tendsto f atTop (𝓝 L) then ENNReal.ofReal h.choose else 0
  • definition OAI.CurrentProjection.AdmissibleDimensions line 43

    def AdmissibleDimensions (d m r q : ℕ) : Prop :=  1 ≤ m ∧ 1 ≤ r ∧ 1 ≤ q ∧ m + r < d - 1 ∧ m + r - m - (q - 1) ≥ 1
  • definition OAI.CurrentProjection.momentConstant line 46

    def momentConstant (C : ℝ) (d : ℕ) (B D : ℝ) : ℝ≥0∞ :=  ENNReal.ofReal (Real.exp (C * d) * B * (1 + max (Real.log (D / B)) 0))
  • definition OAI.CurrentProjection.swapLast line 80

    def swapLast {A B C : Type*} [MeasurableSpace A] [MeasurableSpace B] [MeasurableSpace C] :    (A × B) × C ≃ᵐ (A × C) × B where  toFun p := ((p.1.1,p.2),p.1.2)  invFun p := ((p.1.1,p.2),p.1.2)  left_inv _ := rfl  right_inv _ := rfl  measurable_toFun := (measurable_fst.fst.prodMk measurable_snd).prodMk measurable_fst.snd  measurable_invFun := (measurable_fst.fst.prodMk measurable_snd).prodMk measurable_fst.snd
  • definition OAI.CurrentProjection.rowInformation line 89

    def rowInformation {S W X : Type*} [MeasurableSpace S] [MeasurableSpace W]    [MeasurableSpace X] (P : Measure ((S×W)×X)) (γ : Measure X) : ℝ≥0∞ :=  klDiv P (P.fst.prod γ)
  • definition OAI.CurrentProjection.shannonEntropy line 93

    noncomputable def shannonEntropy {W : Type*} [MeasurableSpace W] (π : Measure W) : ℝ≥0∞ :=  ∫⁻ w, ENNReal.ofReal (-Real.log (π {w}).toReal) ∂π
  • definition OAI.CurrentProjection.conditionalMutualInformation line 96

    def conditionalMutualInformation {Z A B : Type*} [MeasurableSpace Z]    [MeasurableSpace A] [MeasurableSpace B] [StandardBorelSpace A] [StandardBorelSpace B]    (P : Measure (Z×(A×B))) [IsFiniteMeasure P] : ℝ≥0∞ := by  classical  exact if h : Nonempty (A×B) then    letI := h    InformationTheory.klDiv P (P.fst ⊗ₘ (P.condKernel.fst ×ₖ P.condKernel.snd))  else 0
  • definition OAI.CurrentProjection.actualExperiment line 105

    def actualExperiment {d m r : ℕ} {W : Type*} [MeasurableSpace W]    (P : Measure ((Sphere d × W) × Rows m d)) :    Measure (((Sphere d × W) × Rows m d) × Rows r d) := P.prod (gaussianRows r d)
  • definition OAI.CurrentProjection.actualObservation line 114

    def actualObservation {d m r : ℕ} {W : Type*}    (p : ((Sphere d × W) × Rows m d) × Rows r d) :    (Rows (m+r) d × W) × (Fin (m+r) → ℝ) :=  ((Fin.append p.1.2 p.2,p.1.1.2), label (Fin.append p.1.2 p.2) (p.1.1.1 : Vector d))
  • definition OAI.CurrentProjection.selectedCube line 124

    def selectedCube {k d : ℕ} {W : Type*} (ρ : W → Measure (Sphere d)) (δ : ℝ)    (z : (Rows k d×W)×(Fin k → ℝ)) : ℝ≥0∞ := cubeAverage (ρ z.1.2) z.1.1 z.2 δ
  • definition OAI.CurrentProjection.selectedExact line 127

    def selectedExact {k d : ℕ} {W : Type*} (ρ : W → Measure (Sphere d))    (z : (Rows k d×W)×(Fin k → ℝ)) : ℝ≥0∞ := exactDensity (ρ z.1.2) z.1.1 z.2
  • definition OAI.CurrentProjection.momentBound line 130

    def momentBound (C : ℝ) (d : ℕ) (B D : ℝ) : ℝ :=  Real.exp (C*d)*B*(1+max (Real.log (D/B)) 0)
  • definition OAI.CurrentProjection.logPositive line 133

    def logPositive (x : ℝ≥0∞) : ℝ := max (Real.log x.toReal) 0
  • definition OAI.CurrentProjection.logNegative line 135

    def logNegative (x : ℝ≥0∞) : ℝ≥0∞ := if x = 0 then ∞ else ENNReal.ofReal (-Real.log x.toReal)
  • definition OAI.CurrentProjection.extendedLogExpectation line 137

    def extendedLogExpectation {A : Type*} [MeasurableSpace A] (μ : Measure A)    (f : A → ℝ≥0∞) : EReal :=  ((∫⁻ a, ENNReal.ofReal (logPositive (f a)) ∂μ) : EReal) -    ((∫⁻ a, logNegative (f a) ∂μ) : EReal)
  • definition OAI.CurrentProjection.PositiveMessage line 142

    def PositiveMessage {W : Type*} [MeasurableSpace W] (π : Measure W) := {w : W // 0 < π {w}}

25 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 Projection moments, positive cap domination, and Riesz estimates on the sphere come first because the AI draft reading of OpenAI’s note shares words with that paper’s title.

Other possible paper matches, closest wording first

  • Proposition 3.2 of Replacing Gaussian observations in memory-constrained inference. Words of the Lean statement, its names split into words, that also appear in the theorem: expectation, growth, actual, integrable, refinement, entropy and 19 more.
  • Proposition 9.1 of Posterior replicas and conditional information in Gaussian regression. Words of the Lean statement, its names split into words, that also appear in the theorem: point, conditional, message, real, kernel, standard and eleven more.
  • Theorem 3.5 of Projection moments, positive cap domination, and Riesz estimates on the sphere. Words of the Lean statement, its names split into words, that also appear in the theorem: continuous, exp, moment, norm, positive, ball and nine more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: sufficiently and large.
  • Proposition 4.1 of Projection moments, positive cap domination, and Riesz estimates on the sphere. Words of the Lean statement, its names split into words, that also appear in the theorem: first, exp, positive, kernels, one, block and three more.
  • Theorem 2.4 of Projection moments, positive cap domination, and Riesz estimates on the sphere. Words of the Lean statement, its names split into words, that also appear in the theorem: inner, conclusion, sphere, experiment, average, dimension and six more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: memory, large and sufficiently.

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 570 s; peak memory 6.5 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 140’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: None for the headline; supporting results are in separate files. The learner model gives the learner a free shared seed at every step (a stronger model, so the lower bound is stronger).

    Definitions the group asks readers to compare with the paper: Bespoke finite-memory learner model (Learner, RunStatus, Admissible bundling several AEMeasurable hypotheses, angularError := arccos ⟪ŝ, s⟫, uniformSphere via Measure.toSphere); GaussianInformation.lean also introduces local instance ambientSub/ambientInner re-defining Sub/Inner on EuclideanSpace (supporting file)

  • 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 paper compares fresh Gaussian observations with observations coupled to information already held in memory. The formalization covers mixed-moment and actual-row estimates, critical-radius, one-level, and two-label comparisons, and conditional-information bounds across a block of observations. For sufficiently large dimension $d$, the relevant entropy bounds of order $d^2$ bound the information in the fresh experiment by that in the coupled experiment plus a term of order $d$; the associated block information increase also has order $d$.”

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

524 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: 469 to its own declarations, 380 to Mathlib’s documentation. 79 declared names also link to the same declaration in OpenAI’s library. 5 identifiers stay plain because they resolve to no single declaration: variables Lean binds automatically, notation, or names the scan of the pinned sources did not find. OpenAI uses Mathlib version d13f23b. The linked documentation describes the current version, so names that have since changed may be missing there.

import Mathlibnamespace OAIopen MeasureTheory ProbabilityTheory Set Filter InformationTheoryopen scoped ENNReal NNReal RealInnerProductSpace Topologynoncomputable sectionnamespace CurrentProjectionabbrev Vector (d : ℕ) := EuclideanSpace ℝ (Fin d)abbrev Sphere (d : ℕ) := Metric.sphere (0 : Vector d) 1abbrev Rows (k d : ℕ) := Fin k → Vector ddef uniformSphere (d : ℕ) : Measure (Sphere d) :=  let σ := (volume : Measure (Vector d)).toSphere  (σ Set.univ)⁻¹ • σdef gaussianRows (k d : ℕ) : Measure (Rows k d) :=  Measure.pi fun _ => stdGaussian (Vector d)def label {k d : ℕ} (g : Rows k d) (s : Vector d) : Fin k → ℝ :=  fun i => ⟪s, g i⟫def LocalGrowth {d : ℕ} (ρ : Measure (Sphere d)) (a : ℕ) (B : ℝ) : Prop :=  ∀ z : Vector d, ∀ t : ℝ, 0 < t →    ρ {u | dist (u : Vector d) z ≤ t} ≤ ENNReal.ofReal (B * t ^ a)def cubeAverage {k d : ℕ} (ρ : Measure (Sphere d)) (g : Rows k d)    (y : Fin k → ℝ) (δ : ℝ) : ℝ≥0∞ :=  ENNReal.ofReal ((2 * δ)⁻¹ ^ k) *    ρ {u | ∀ i, |label g (u : Vector d) i - y i| ≤ δ}def exactDensity {k d : ℕ} (ρ : Measure (Sphere d)) (g : Rows k d)    (y : Fin k → ℝ) : ℝ≥0∞ := by  classical  let f := fun j : ℕ => (cubeAverage ρ g y (1 / (j : ℝ))).toReal  exact if h : ∃ L : ℝ, Tendsto f atTop (𝓝 L) then ENNReal.ofReal h.choose else 0def AdmissibleDimensions (d m r q : ℕ) : Prop :=  1 ≤ m ∧ 1 ≤ r ∧ 1 ≤ q ∧ m + r < d - 1 ∧ m + r - m - (q - 1) ≥ 1def momentConstant (C : ℝ) (d : ℕ) (B D : ℝ) : ℝ≥0∞ :=  ENNReal.ofReal (Real.exp (C * d) * B * (1 + max (Real.log (D / B)) 0))def MixedMomentMain : Prop :=  ∃ C : ℝ, 0 < C ∧ ∀ (d m r q : ℕ), AdmissibleDimensions d m r q →    ∀ (ρ : Measure (Sphere d)), IsFiniteMeasure ρ →    ∀ (B D : ℝ), 0 < B → 0 < D → LocalGrowth ρ (m+r) B → LocalGrowth ρ (d-1) D →    (∀ (s : Sphere d) (δ : ℝ), 0 < δ →      (∫⁻ X, (∫⁻ Z, cubeAverage ρ (Fin.append X Z)        (label (Fin.append X Z) (s : Vector d)) δ ∂gaussianRows r d)^q          ∂gaussianRows m d) ≤ (momentConstant C d B D)^q) ∧    (ρ ≪ uniformSphere d → ∃ E : Set (Sphere d), MeasurableSet E ∧ ρ E = 0 ∧      ∀ s ∉ E,        (∀ᵐ G ∂gaussianRows (m+r) d,          Tendsto (fun δ : ℝ => cubeAverage ρ G (label G (s : Vector d)) δ)            (𝓝[>] 0) (𝓝 (exactDensity ρ G (label G (s : Vector d))))) ∧        ((∫⁻ X, (∫⁻ Z, exactDensity ρ (Fin.append X Z)          (label (Fin.append X Z) (s : Vector d)) ∂gaussianRows r d)^q            ∂gaussianRows m d) ≤ (momentConstant C d B D)^q) ∧        (ρ ≠ 0 → ∀ᵐ G ∂gaussianRows (m+r) d,          0 < exactDensity ρ G (label G (s : Vector d)) ∧          exactDensity ρ G (label G (s : Vector d)) < ∞))instance gaussianRows_isProbabilityMeasure (k d : ℕ) : IsProbabilityMeasure (gaussianRows k d) := by  unfold gaussianRows  infer_instancelemma measurable_own_label {k d : ℕ} :    Measurable (fun z : Rows k d × Sphere d => label z.1 (z.2:Vector d)) := by  apply Measurable.of_eval  intro i  exact (continuous_inner.comp <| (continuous_subtype_val.comp continuous_snd).prodMk    ((continuous_apply i).comp continuous_fst)).measurabledef swapLast {A B C : Type*} [MeasurableSpace A] [MeasurableSpace B] [MeasurableSpace C] :    (A × B) × C ≃ᵐ (A × C) × B where  toFun p := ((p.1.1,p.2),p.1.2)  invFun p := ((p.1.1,p.2),p.1.2)  left_inv _ := rfl  right_inv _ := rfl  measurable_toFun := (measurable_fst.fst.prodMk measurable_snd).prodMk measurable_fst.snd  measurable_invFun := (measurable_fst.fst.prodMk measurable_snd).prodMk measurable_fst.snddef rowInformation {S W X : Type*} [MeasurableSpace S] [MeasurableSpace W]    [MeasurableSpace X] (P : Measure ((S×W)×X)) (γ : Measure X) : ℝ≥0∞ :=  klDiv P (P.fst.prod γ)noncomputable def shannonEntropy {W : Type*} [MeasurableSpace W] (π : Measure W) : ℝ≥0∞ :=  ∫⁻ w, ENNReal.ofReal (-Real.log (π {w}).toReal) ∂πdef conditionalMutualInformation {Z A B : Type*} [MeasurableSpace Z]    [MeasurableSpace A] [MeasurableSpace B] [StandardBorelSpace A] [StandardBorelSpace B]    (P : Measure (Z×(A×B))) [IsFiniteMeasure P] : ℝ≥0∞ := by  classical  exact if h : Nonempty (A×B) then    letI := h    InformationTheory.klDiv P (P.fst ⊗ₘ (P.condKernel.fst ×ₖ P.condKernel.snd))  else 0def actualExperiment {d m r : ℕ} {W : Type*} [MeasurableSpace W]    (P : Measure ((Sphere d × W) × Rows m d)) :    Measure (((Sphere d × W) × Rows m d) × Rows r d) := P.prod (gaussianRows r d)instance actualExperiment_isProbabilityMeasure {d m r : ℕ} {W : Type*} [MeasurableSpace W]    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P] :    IsProbabilityMeasure (actualExperiment (r:=r) P) :=  inferInstanceAs (IsProbabilityMeasure (P.prod (gaussianRows r d)))def actualObservation {d m r : ℕ} {W : Type*}    (p : ((Sphere d × W) × Rows m d) × Rows r d) :    (Rows (m+r) d × W) × (Fin (m+r) → ℝ) :=  ((Fin.append p.1.2 p.2,p.1.1.2), label (Fin.append p.1.2 p.2) (p.1.1.1 : Vector d))instance actualObservation_isProbabilityMeasure {d m r : ℕ} {W : Type*} [MeasurableSpace W]    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P] :    IsProbabilityMeasure ((actualExperiment (r:=r) P).map actualObservation) :=  inferInstancedef selectedCube {k d : ℕ} {W : Type*} (ρ : W → Measure (Sphere d)) (δ : ℝ)    (z : (Rows k d×W)×(Fin k → ℝ)) : ℝ≥0∞ := cubeAverage (ρ z.1.2) z.1.1 z.2 δdef selectedExact {k d : ℕ} {W : Type*} (ρ : W → Measure (Sphere d))    (z : (Rows k d×W)×(Fin k → ℝ)) : ℝ≥0∞ := exactDensity (ρ z.1.2) z.1.1 z.2def momentBound (C : ℝ) (d : ℕ) (B D : ℝ) : ℝ :=  Real.exp (C*d)*B*(1+max (Real.log (D/B)) 0)def logPositive (x : ℝ≥0∞) : ℝ := max (Real.log x.toReal) 0def logNegative (x : ℝ≥0∞) : ℝ≥0∞ := if x = 0 then ∞ else ENNReal.ofReal (-Real.log x.toReal)def extendedLogExpectation {A : Type*} [MeasurableSpace A] (μ : Measure A)    (f : A → ℝ≥0∞) : EReal :=  ((∫⁻ a, ENNReal.ofReal (logPositive (f a)) ∂μ) : EReal) -    ((∫⁻ a, logNegative (f a) ∂μ) : EReal)def PositiveMessage {W : Type*} [MeasurableSpace W] (π : Measure W) := {w : W // 0 < π {w}}def completeFamily {W : Type*} [MeasurableSpace W] {T : Type*} (π : Measure W)    (f : PositiveMessage π → T) (t₀ : T) (w : W) : T :=  if h : 0 < π {w} then f ⟨w,h⟩ else t₀structure ActualRowConclusion {d m r q : ℕ} {W : Type*} [MeasurableSpace W]    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P]    (ρ : W → Measure (Sphere d)) (B D : W → ℝ) : Prop where  row_finite : rowInformation P (gaussianRows m d) ≠ ∞  row_le_entropy : (rowInformation P (gaussianRows m d)).toReal ≤    (shannonEntropy (P.map swapLast).snd).toReal  conditional_density : ∀ᵐ gw ∂((actualExperiment (r:=r) P).map actualObservation).fst,    ((actualExperiment (r:=r) P).map actualObservation).condKernel gw ≪ volume  actual_limit : ∀ᵐ p ∂actualExperiment (r:=r) P,    Tendsto (fun j : ℕ => selectedCube ρ (1/(j:ℝ)) (actualObservation p)) atTop      (𝓝 (selectedExact ρ (actualObservation p)))  smoothed_bound : ∀ δ : ℝ, 0 < δ →    Integrable (fun p => Real.log (1+(selectedCube ρ δ (actualObservation p)).toReal))      (actualExperiment (r:=r) P) ∧    (∫ p, Real.log (1+(selectedCube ρ δ (actualObservation p)).toReal) ∂actualExperiment (r:=r) P) ≤      (rowInformation P (gaussianRows m d)).toReal/q +        ∫ sw : Sphere d×W, Real.log (1+momentBound 9 d (B sw.2) (D sw.2)) ∂P.fst  exact_integrable : Integrable (fun p => Real.log (1+(selectedExact ρ (actualObservation p)).toReal))    (actualExperiment (r:=r) P)  exact_bound : (∫ p, Real.log (1+(selectedExact ρ (actualObservation p)).toReal) ∂actualExperiment (r:=r) P) ≤    (rowInformation P (gaussianRows m d)).toReal/q +      ∫ sw : Sphere d×W, Real.log (1+momentBound 9 d (B sw.2) (D sw.2)) ∂P.fst  entropy_bound : (rowInformation P (gaussianRows m d)).toReal/q +      ∫ sw : Sphere d×W, Real.log (1+momentBound 9 d (B sw.2) (D sw.2)) ∂P.fst ≤    (shannonEntropy (P.map swapLast).snd).toReal/q +      ∫ sw : Sphere d×W, Real.log (1+momentBound 9 d (B sw.2) (D sw.2)) ∂P.fst  positive_log_integrable : Integrable (fun p => logPositive (selectedExact ρ (actualObservation p)))    (actualExperiment (r:=r) P)  extended_log_bound : extendedLogExpectation (actualExperiment (r:=r) P)    (fun p => selectedExact ρ (actualObservation p)) ≤      (((rowInformation P (gaussianRows m d)).toReal/q +        ∫ sw : Sphere d×W, Real.log (1+momentBound 9 d (B sw.2) (D sw.2)) ∂P.fst) : EReal)def actualConditionalRowInformation {d m : ℕ} {W : Type*} [MeasurableSpace W]    [StandardBorelSpace W]    (P : Measure ((Sphere d×W)×Rows m d)) [IsFiniteMeasure P] : ℝ≥0∞ :=  conditionalMutualInformation (P.map (fun p => (p.1.1,(p.2,p.1.2))))structure ActualRowSourceConclusion {d m r q : ℕ} {W : Type*} [MeasurableSpace W]    [StandardBorelSpace W]    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P]    (ρ : W → Measure (Sphere d)) (B D : W → ℝ) : Prop where  row_finite : actualConditionalRowInformation P ≠ ∞  row_le_entropy : (actualConditionalRowInformation P).toReal ≤    (shannonEntropy (P.map swapLast).snd).toReal  conditional_density : ∀ᵐ gw ∂((actualExperiment (r:=r) P).map actualObservation).fst,    ((actualExperiment (r:=r) P).map actualObservation).condKernel gw ≪ volume  actual_limit : ∀ᵐ p ∂actualExperiment (r:=r) P,    Tendsto (fun j : ℕ => selectedCube ρ (1/(j:ℝ)) (actualObservation p)) atTop      (𝓝 (selectedExact ρ (actualObservation p)))  smoothed_bound : ∀ δ : ℝ, 0 < δ →    Integrable (fun p => Real.log (1+(selectedCube ρ δ (actualObservation p)).toReal))      (actualExperiment (r:=r) P) ∧    (∫ p, Real.log (1+(selectedCube ρ δ (actualObservation p)).toReal) ∂actualExperiment (r:=r) P) ≤      (actualConditionalRowInformation P).toReal/q +        ∫ sw : Sphere d×W, Real.log (1+momentBound 9 d (B sw.2) (D sw.2)) ∂P.fst  exact_integrable : Integrable (fun p => Real.log (1+(selectedExact ρ (actualObservation p)).toReal))    (actualExperiment (r:=r) P)  exact_bound : (∫ p, Real.log (1+(selectedExact ρ (actualObservation p)).toReal) ∂actualExperiment (r:=r) P) ≤    (actualConditionalRowInformation P).toReal/q +      ∫ sw : Sphere d×W, Real.log (1+momentBound 9 d (B sw.2) (D sw.2)) ∂P.fst  entropy_bound : (actualConditionalRowInformation P).toReal/q +      ∫ sw : Sphere d×W, Real.log (1+momentBound 9 d (B sw.2) (D sw.2)) ∂P.fst ≤    (shannonEntropy (P.map swapLast).snd).toReal/q +      ∫ sw : Sphere d×W, Real.log (1+momentBound 9 d (B sw.2) (D sw.2)) ∂P.fst  positive_log_integrable : Integrable (fun p => logPositive (selectedExact ρ (actualObservation p)))    (actualExperiment (r:=r) P)  extended_log_bound : extendedLogExpectation (actualExperiment (r:=r) P)    (fun p => selectedExact ρ (actualObservation p)) ≤      (((actualConditionalRowInformation P).toReal/q +        ∫ sw : Sphere d×W, Real.log (1+momentBound 9 d (B sw.2) (D sw.2)) ∂P.fst) : EReal)def alignedExperiment {d m r : ℕ} {W : Type*} [MeasurableSpace W]    (P : Measure ((Sphere d×W)×Rows m d)) : Measure ((Sphere d×W)×Rows (m+r) d) :=  (actualExperiment (r:=r) P).map (fun p => (p.1.1,Fin.append p.1.2 p.2))instance alignedExperiment_probability {d m r : ℕ} {W : Type*} [MeasurableSpace W]    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P] :    IsProbabilityMeasure (alignedExperiment (r:=r) P) := by  unfold alignedExperiment  infer_instancedef exposedJointMap {d k : ℕ} {W : Type*} (p : (Sphere d×W)×Rows k d) :    (Rows k d×(Fin k → ℝ))×(Sphere d×W) := ((p.2,label p.2 (p.1.1:Vector d)),p.1)def exposedInformation {d k : ℕ} {W : Type*} [MeasurableSpace W] [StandardBorelSpace W]    (P : Measure ((Sphere d×W)×Rows k d)) [IsFiniteMeasure P] : ℝ≥0∞ :=  conditionalMutualInformation (P.map exposedJointMap)def CriticalComparisonMain : Prop :=  ∃ (K : ℝ) (d₀ : ℕ), 0 < K ∧ ∀ (d : ℕ), d₀ ≤ d →    ∀ (W : Type) [MeasurableSpace W] [Countable W] [MeasurableSingletonClass W],    ∀ (P : Measure ((Sphere d×W)×Rows (d/10) d)) [IsProbabilityMeasure P],    (P.map swapLast).fst = (uniformSphere d).prod (gaussianRows (d/10) d) →    shannonEntropy (P.map swapLast).snd ≤ ENNReal.ofReal ((d:ℝ)^2) →    exposedInformation (P.fst.prod (gaussianRows (d/10+(d/2-d/10)) d)) ≤      exposedInformation (alignedExperiment (r:=d/2-d/10) P) + ENNReal.ofReal (K*d)def OneLevelComparisonMain : Prop :=  ∃ (C : ℝ) (d₀ : ℕ), 0 < C ∧ ∀ d, d₀ ≤ d →    ∀ (U : Type) [MeasurableSpace U] [Finite U] [MeasurableSingletonClass U],    ∀ (P : Measure ((Sphere d×U)×Rows (d/32) d)) [IsProbabilityMeasure P],    (P.map swapLast).fst = (uniformSphere d).prod (gaussianRows (d/32) d) →    exposedInformation (P.fst.prod (gaussianRows (d/32+(d/4-d/32)) d)) ≤      exposedInformation (alignedExperiment (r:=d/4-d/32) P) +      ENNReal.ofReal (C*((d:ℝ)+Real.log (1+(d:ℝ)+(shannonEntropy P.fst.snd).toReal)+        (shannonEntropy P.fst.snd).toReal/(d:ℝ)))def TwoLabelComparisonMain : Prop :=  ∃ (C : ℝ) (d₀ : ℕ), 0 < C ∧ ∀ d, d₀ ≤ d →    ∀ (V : Type) [MeasurableSpace V] [Finite V] [MeasurableSingletonClass V],    ∀ (P : Measure ((Sphere d×V)×Rows (d/8) d)) [IsProbabilityMeasure P],    (P.map swapLast).fst = (uniformSphere d).prod (gaussianRows (d/8) d) →    shannonEntropy P.fst.snd ≤ ENNReal.ofReal ((d:ℝ)^2) →    exposedInformation (P.fst.prod (gaussianRows (d/8+(d/2-d/8)) d)) ≤      exposedInformation (alignedExperiment (r:=d/2-d/8) P) + ENNReal.ofReal (C*d)def blockInput {d m : ℕ} {U : Type*} (z : (Sphere d × U) × Rows m d) :    U × (Rows m d × (Fin m → ℝ)) :=  (z.1.2, z.2, label z.2 (z.1.1 : Vector d))lemma measurable_blockInput {d m : ℕ} {U : Type*} [MeasurableSpace U] :    Measurable (blockInput (d:=d) (m:=m) (U:=U)) := by  exact measurable_fst.snd.prodMk (measurable_snd.prodMk    ((measurable_own_label (d:=d) (k:=m)).comp      (measurable_snd.prodMk measurable_fst.fst)))def blockLaw {d m : ℕ} {U V : Type*} [MeasurableSpace U] [MeasurableSpace V]    (P : Measure (Sphere d × U))    (κ : Kernel (U × (Rows m d × (Fin m → ℝ))) V) :    Measure (((Sphere d × U) × Rows m d) × V) :=  (P.prod (gaussianRows m d)) ⊗ₘ κ.comap blockInput measurable_blockInputinstance blockLaw_probability {d m : ℕ} {U V : Type*}    [MeasurableSpace U] [MeasurableSpace V]    (P : Measure (Sphere d × U)) [IsProbabilityMeasure P]    (κ : Kernel (U × (Rows m d × (Fin m → ℝ))) V) [IsMarkovKernel κ] :    IsProbabilityMeasure (blockLaw P κ) := by  unfold blockLaw  infer_instancedef endingSignalLaw {d m : ℕ} {U V : Type*}    [MeasurableSpace U] [MeasurableSpace V]    (P : Measure (Sphere d × U))    (κ : Kernel (U × (Rows m d × (Fin m → ℝ))) V) : Measure (Sphere d × V) :=  (blockLaw P κ).map (fun z => (z.1.1.1, z.2))instance endingSignalLaw_probability {d m : ℕ} {U V : Type*}    [MeasurableSpace U] [MeasurableSpace V]    (P : Measure (Sphere d × U)) [IsProbabilityMeasure P]    (κ : Kernel (U × (Rows m d × (Fin m → ℝ))) V) [IsMarkovKernel κ] :    IsProbabilityMeasure (endingSignalLaw P κ) := by  unfold endingSignalLaw  infer_instancedef freshInformation {d : ℕ} {U : Type*} [MeasurableSpace U] [StandardBorelSpace U]    (P : Measure (Sphere d × U)) [IsFiniteMeasure P] (k : ℕ) : ℝ≥0∞ :=  exposedInformation (P.prod (gaussianRows k d))def hybridFirst (d : ℕ) : ℕ := (d+3)/4def hybridLast (d : ℕ) : ℕ := d/2def hybridCount (d : ℕ) : ℕ := hybridLast d - hybridFirst d + 1def averagedFreshInformation {d : ℕ} {U : Type*}    [MeasurableSpace U] [StandardBorelSpace U]    (P : Measure (Sphere d × U)) [IsFiniteMeasure P] : ℝ :=  (∑ k ∈ Finset.Icc (hybridFirst d) (hybridLast d), (freshInformation P k).toReal) /    hybridCount ddef HybridBlockMain : Prop :=  ∃ (C C' : ℝ) (d₀ : ℕ), 0 < C ∧ 0 < C' ∧ ∀ d, d₀ ≤ d →    ∀ m, 1 ≤ m → m ≤ d/8 →    ∀ (U V : Type) [Fintype U] [Fintype V]      [MeasurableSpace U] [MeasurableSpace V]      [MeasurableSingletonClass U] [MeasurableSingletonClass V],    ∀ (P : Measure (Sphere d × U)) [IsProbabilityMeasure P],    P.fst = uniformSphere d →    ∀ (κ : Kernel (U × (Rows m d × (Fin m → ℝ))) V) [IsMarkovKernel κ],    ∀ (B : ℝ), 0 ≤ B →    shannonEntropy (endingSignalLaw P κ).snd ≤ ENNReal.ofReal B →    averagedFreshInformation (endingSignalLaw P κ) - averagedFreshInformation P ≤      C*m + (m:ℝ) / hybridCount d * (C + B / (d/8:ℕ)) + B / (d/32:ℕ) ∧    (B ≤ (d:ℝ)^2 →      averagedFreshInformation (endingSignalLaw P κ) - averagedFreshInformation P ≤ C'*d)def FiberBlockMain : Prop :=  ∃ (K : ℝ) (d₀ : ℕ), 0 < K ∧ ∀ d, d₀ ≤ d →    ∀ (U V : Type) [Fintype U] [Fintype V]      [MeasurableSpace U] [MeasurableSpace V]      [MeasurableSingletonClass U] [MeasurableSingletonClass V],    ∀ (P : Measure (Sphere d×U)) [IsProbabilityMeasure P],    P.fst = uniformSphere d →    ∀ (κ : Kernel (U×(Rows (d/10) d×(Fin (d/10)→ℝ))) V) [IsMarkovKernel κ],    ∀ N : ℕ, 1 ≤ N → Fintype.card V ≤ N → Real.log N ≤ (d:ℝ)^2 →    freshInformation (endingSignalLaw P κ) (d/3) ≤ freshInformation P (d/3) + ENNReal.ofReal (K*d)def dependentMapKernel {A B D : Type*} [MeasurableSpace A] [MeasurableSpace B]    [MeasurableSpace D] (κ : Kernel A B) (f : A×B → D) : Kernel A D :=  (Kernel.id ×ₖ κ).map fdef fiberObservationLaw (d k : ℕ) : Measure ((Rows k d×(Fin k→ℝ))×Sphere d) :=  ((gaussianRows k d).prod (uniformSphere d)).map    (fun z => ((z.1,label z.1 (z.2:Vector d)),z.2))instance uniformSphere_finite (d : ℕ) : IsFiniteMeasure (uniformSphere d) := by  constructor  unfold uniformSphere  rw [Measure.smul_apply, smul_eq_mul]  exact lt_of_le_of_lt (ENNReal.inv_mul_le_one _) ENNReal.one_lt_topinstance fiberObservationLaw_finite (d k : ℕ) : IsFiniteMeasure (fiberObservationLaw d k) := by  unfold fiberObservationLaw  infer_instancelemma sphere_standardBorel (d : ℕ) : StandardBorelSpace (Sphere d) :=  Metric.isClosed_sphere.measurableSet.standardBoreldef sphericalFiberKernel (d k : ℕ) [sphereNonempty : Nonempty (Sphere d)] :    Kernel (Rows k d×(Fin k→ℝ)) (Sphere d) :=  @Measure.condKernel (Rows k d×(Fin k→ℝ)) (Sphere d) _ _    (sphere_standardBorel d) sphereNonempty    (fiberObservationLaw d k) (fiberObservationLaw_finite d k)instance sphericalFiberKernel_markov (d k : ℕ) [Nonempty (Sphere d)] :    IsMarkovKernel (sphericalFiberKernel d k) := by  unfold sphericalFiberKernel  infer_instancedef fiberTwoPointLeft (d k : ℕ) [Nonempty (Sphere d)] : Measure (Rows k d×(Sphere d×Sphere d)) :=  ((((gaussianRows k d).prod (uniformSphere d)).withDensity    (fun z => exactDensity (uniformSphere d) z.1 (label z.1 (z.2:Vector d)))) ⊗ₘ    ((sphericalFiberKernel d k).comap (fun z => (z.1,label z.1 (z.2:Vector d)))      (measurable_fst.prodMk measurable_own_label))).map    (fun z => (z.1.1,(z.1.2,z.2)))def perpendicularRow {d : ℕ} (v g : Vector d) : Vector d :=  letI : NormedAddCommGroup (Vector d) := PiLp.normedAddCommGroup 2 (fun _ : Fin d => ℝ)  letI : InnerProductSpace ℝ (Vector d) := PiLp.innerProductSpace (fun _ : Fin d => ℝ)  g - (⟪v,g⟫ / ‖v‖^2) • vdef perpendicularRowsKernel (d k : ℕ) : Kernel (Sphere d×Sphere d) (Rows k d) :=  dependentMapKernel (Kernel.const (Sphere d×Sphere d) (gaussianRows k d))    (fun z => fun i => perpendicularRow ((z.1.1:Vector d)-(z.1.2:Vector d)) (z.2 i))def fiberTwoPointConstant (k : ℕ) : ℝ≥0∞ :=  letI : OfNat ℝ 2 := @instOfNatAtLeastTwo ℝ 2 Real.instNatCast inferInstance  letI : Mul ℝ := Real.instMul  letI : Inv ℝ := Real.instInv  letI : Pow ℝ ℕ := @NPow.toPow ℝ Real.instMonoid.toNPow  ENNReal.ofReal ((Real.sqrt (2*Real.pi))⁻¹ ^ k)def fiberDistanceWeight {d : ℕ} (k : ℕ) (z : Sphere d×Sphere d) : ℝ≥0∞ :=  (ENNReal.ofReal ‖(z.1:Vector d)-(z.2:Vector d)‖)⁻¹ ^ kdef fiberTwoPointRight (d k : ℕ) : Measure (Rows k d×(Sphere d×Sphere d)) :=  letI : IsScalarTower ℝ≥0∞ ℝ≥0∞ ℝ≥0∞ := Semigroup.isScalarTower  fiberTwoPointConstant k •    Measure.map (Prod.swap : (Sphere d×Sphere d)×Rows k d → Rows k d×(Sphere d×Sphere d))      (Measure.compProd        (Measure.withDensity (Measure.prod (uniformSphere d) (uniformSphere d))          (fiberDistanceWeight k))        (perpendicularRowsKernel d k))lemma uniformSphere_probability_of_pos {d : ℕ} (hd : 0 < d) :    IsProbabilityMeasure (uniformSphere d) := by  let : Nonempty (Fin d) := ⟨⟨0, hd⟩⟩  constructor  rw [uniformSphere, Measure.smul_apply, smul_eq_mul]  apply ENNReal.inv_mul_cancel _ (measure_ne_top _ _)  rw [Measure.toSphere_apply_univ]  exact mul_ne_zero    (by exact_mod_cast (Module.finrank_pos (R := ℝ) (M := Vector d)).ne')    (Metric.measure_ball_pos volume 0 zero_lt_one).ne'def FiberTwoPointMain : Prop :=  ∀ (d k : ℕ) (_hk : 1 ≤ k) (hkd : k < d-1),    letI : IsProbabilityMeasure (uniformSphere d) :=      uniformSphere_probability_of_pos (by omega)    letI : Nonempty (Sphere d) := nonempty_of_isProbabilityMeasure (uniformSphere d)    IsFiniteMeasure (fiberTwoPointLeft d k) ∧ IsFiniteMeasure (fiberTwoPointRight d k) ∧      fiberTwoPointLeft d k = fiberTwoPointRight d ktheorem mixedMomentMain : MixedMomentMain := by  sorrytheorem actualRowMain {d m r q : ℕ} {W : Type*} [MeasurableSpace W]    [Countable W] [MeasurableSingletonClass W]    (hdim : AdmissibleDimensions d m r q)    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P]    (ν : Measure (Sphere d)) [IsProbabilityMeasure ν]    (hInd : (P.map swapLast).fst = ν.prod (gaussianRows m d))    (H : ℝ) (hν : ν ≤ ENNReal.ofReal H • uniformSphere d)    (hEntropy : shannonEntropy (P.map swapLast).snd ≠ ∞)    (ρ : PositiveMessage (P.map swapLast).snd → Measure (Sphere d))    [∀ w, IsFiniteMeasure (ρ w)]    (_hρac : ∀ w, ρ w ≪ uniformSphere d)    (B D : PositiveMessage (P.map swapLast).snd → ℝ)    (hB : ∀ w, 0 < B w) (hD : ∀ w, 0 < D w)    (hgB : ∀ w, LocalGrowth (ρ w) (m+r) (B w))    (hgD : ∀ w, LocalGrowth (ρ w) (d-1) (D w))    (hCI : Integrable (fun sw : Sphere d×W => Real.log (1+momentBound 9 d      (completeFamily (P.map swapLast).snd B 1 sw.2) (completeFamily (P.map swapLast).snd D 1 sw.2))) P.fst) :    ActualRowConclusion (r:=r) (q:=q) P (completeFamily (P.map swapLast).snd ρ 0)      (completeFamily (P.map swapLast).snd B 1) (completeFamily (P.map swapLast).snd D 1) := by  sorrytheorem actualRowRefinement {d m : ℕ} {W E : Type*} [MeasurableSpace W]    [MeasurableSpace E] [Countable W] [MeasurableSingletonClass W]    [Countable E] [MeasurableSingletonClass E]    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P]    (e : Sphere d×W → E) (he : Measurable e)    (_hEntropy : shannonEntropy      ((P.map (fun p => ((p.1.1,(p.1.2,e p.1)),p.2))).map swapLast).snd ≠ ∞) :    rowInformation (P.map (fun p => ((p.1.1,(p.1.2,e p.1)),p.2))) (gaussianRows m d) =      rowInformation P (gaussianRows m d) := by  sorrytheorem actualRowSourceMain {d m r q : ℕ} {W : Type*} [MeasurableSpace W]    [Countable W] [MeasurableSingletonClass W]    (hdim : AdmissibleDimensions d m r q)    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P]    (ν : Measure (Sphere d)) [IsProbabilityMeasure ν]    (hInd : (P.map swapLast).fst = ν.prod (gaussianRows m d))    (H : ℝ) (hν : ν ≤ ENNReal.ofReal H • uniformSphere d)    (hEntropy : shannonEntropy (P.map swapLast).snd ≠ ∞)    (ρ : PositiveMessage (P.map swapLast).snd → Measure (Sphere d))    [∀ w, IsFiniteMeasure (ρ w)]    (_hρac : ∀ w, ρ w ≪ uniformSphere d)    (B D : PositiveMessage (P.map swapLast).snd → ℝ)    (hB : ∀ w, 0 < B w) (hD : ∀ w, 0 < D w)    (hgB : ∀ w, LocalGrowth (ρ w) (m+r) (B w))    (hgD : ∀ w, LocalGrowth (ρ w) (d-1) (D w))    (hCI : Integrable (fun sw : Sphere d×W => Real.log (1+momentBound 9 d      (completeFamily (P.map swapLast).snd B 1 sw.2) (completeFamily (P.map swapLast).snd D 1 sw.2))) P.fst) :    ActualRowSourceConclusion (r:=r) (q:=q) P (completeFamily (P.map swapLast).snd ρ 0)      (completeFamily (P.map swapLast).snd B 1) (completeFamily (P.map swapLast).snd D 1) := by  sorrytheorem actualRowSourceRefinement {d m : ℕ} {W E : Type*} [MeasurableSpace W]    [MeasurableSpace E] [Countable W] [MeasurableSingletonClass W]    [Countable E] [MeasurableSingletonClass E]    (P : Measure ((Sphere d×W)×Rows m d)) [IsProbabilityMeasure P]    (ν : Measure (Sphere d)) [IsProbabilityMeasure ν]    (hInd : (P.map swapLast).fst = ν.prod (gaussianRows m d))    (e : Sphere d×W → E) (he : Measurable e)    (hEntropy : shannonEntropy      ((P.map (fun p => ((p.1.1,(p.1.2,e p.1)),p.2))).map swapLast).snd ≠ ∞) :    actualConditionalRowInformation (P.map (fun p => ((p.1.1,(p.1.2,e p.1)),p.2))) =      actualConditionalRowInformation P := by  sorrytheorem criticalComparisonMain : CriticalComparisonMain := by  sorrytheorem oneLevelComparisonMain : OneLevelComparisonMain := by  sorrytheorem twoLabelComparisonMain : TwoLabelComparisonMain := by  sorrytheorem hybridBlockMain : HybridBlockMain := by  sorrytheorem fiberTwoPointMain : FiberTwoPointMain := by  sorrytheorem fiberBlockMain : FiberBlockMain := by  sorryend CurrentProjectionendend 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.

Memory and precision in noiseless Gaussian regression

Theorem (Memory and precision)

For every fixed finite A>0, there are constants c_A>0 and d_A such that the following holds. Let d\ge d_A, let 0\le M\le Ad^2 be an integer, and let 0<\epsilon\le1/10. For any learner in Definition h:model, draw S\sim\sigma_d independently of the rows and the learner’s data-independent randomness. If

\Prob\{\arccos\ip{\widehat s}{S}\le\epsilon\}\ge\frac23,

then its prescribed horizon satisfies

T\ge c_A\,d\log(1/\epsilon).
Section 1, Exact observations and finite memory Read it in the paper TeX source, line 59
Show the TeX
For every fixed finite \(A>0\), there are constants \(c_A>0\) and
\(d_A\) such that the following holds. Let \(d\ge d_A\), let
\(0\le M\le Ad^2\) be an integer, and let \(0<\epsilon\le1/10\).
For any learner in Definition~\ref{h:model}, draw
\(S\sim\sigma_d\) independently of the rows and the learner's
data-independent randomness. If
\[
 \Prob\{\arccos\ip{\widehat s}{S}\le\epsilon\}\ge\frac23,
\]
then its prescribed horizon satisfies
\[
 T\ge c_A\,d\log(1/\epsilon).
\]
Corollary (Subquadratic memory)

Let M(d)\ge0 be integer-valued with M(d)=o(d^2), and let 0<\epsilon(d)\le1/10 be any accuracy sequence. A family of learners in Definition h:model with uniform-sphere average success at least 2/3 satisfies

T(d)\ge c\,d\log(1/\epsilon(d))

for all sufficiently large d, where c>0 is absolute. The dimension threshold may depend on the memory sequence.

Section 1, Exact observations and finite memory Read it in the paper TeX source, line 81
Show the TeX
Let \(M(d)\ge0\) be integer-valued with \(M(d)=o(d^2)\), and let
\(0<\epsilon(d)\le1/10\) be any accuracy sequence. A family of learners
in Definition~\ref{h:model} with uniform-sphere average success at
least \(2/3\) satisfies
\[
 T(d)\ge c\,d\log(1/\epsilon(d))
\]
for all sufficiently large \(d\), where \(c>0\) is absolute. The
dimension threshold may depend on the memory sequence.
Corollary (A guarantee for every signal)

The conclusions of Theorem h:main and Corollary h:subquadratic also hold when their average-success assumption is replaced by

\Prob\{\arccos\ip{\widehat s}{s}\le\epsilon\}\ge\frac23 \qquad\text{for every }s\in S^{d-1},

where this probability is over the rows and the learner’s randomness.

Section 1, Exact observations and finite memory Read it in the paper TeX source, line 93
Show the TeX
The conclusions of Theorem~\ref{h:main} and
Corollary~\ref{h:subquadratic} also hold when their average-success
assumption is replaced by
\[
 \Prob\{\arccos\ip{\widehat s}{s}\le\epsilon\}\ge\frac23
 \qquad\text{for every }s\in S^{d-1},
\]
where this probability is over the rows and the learner's randomness.

Posterior replicas and conditional information in Gaussian regression

Theorem (Gaussian replica block bound)

For all sufficiently large d, set

k=2\lfloor d/16\rfloor,\qquad m=k,\qquad t=m+1,\qquad \ell=4k.

Suppose p=f\sigma_d is a probability with 0\le f\le L<\infty. In the block experiment above, let A have k rows and let B have \ell rows. There is an absolute constant C such that

I(S;W\mid B,BS) \le \frac{H(W)}{t}+Cd+C\log(2+\log L).

The bound is uniform over the prior, the density bound L, and the message kernel. The labels used to produce W are the exact values AS.

Section 1, Introduction Read it in the paper TeX source, line 81
Show the TeX
For all sufficiently large $d$, set
\[
 k=2\lfloor d/16\rfloor,\qquad m=k,\qquad t=m+1,\qquad \ell=4k.
\]
Suppose $p=f\sigma_d$ is a probability with $0\le f\le L<\infty$.
In the block experiment above, let $A$ have $k$ rows and let $B$ have
$\ell$ rows. There is an absolute constant $C$ such that
\begin{equation}
 I(S;W\mid B,BS)
 \le \frac{H(W)}{t}+Cd+C\log(2+\log L).
\end{equation}
The bound is uniform over the prior, the density bound $L$, and the message
kernel. The labels used to produce $W$ are the exact values $AS$.
Theorem (Uniform-prior sample lower bound)

Let M(d)=o(d^2) be nonnegative integer-valued, and let 0<\epsilon(d)\le1/10. Suppose a family of learners in Definition def:streaming-model satisfies

\Prob\{\arccos\langle\widehat S,S\rangle\le\epsilon(d)\}\ge\frac23 \qquad\text{when }S\sim\sigma_d,

where the probability includes the signal, samples, and learner randomness. Then there is an absolute c>0 such that

T(d)\ge c\,d\log\frac1{\epsilon(d)}

for all sufficiently large d. The eventual threshold may depend on the memory sequence.

Section 1, Introduction Read it in the paper TeX source, line 147
Show the TeX
Let $M(d)=o(d^2)$ be nonnegative integer-valued, and let
$0<\epsilon(d)\le1/10$. Suppose a family of learners in
Definition~\ref{def:streaming-model} satisfies
\[
 \Prob\{\arccos\langle\widehat S,S\rangle\le\epsilon(d)\}\ge\frac23
 \qquad\text{when }S\sim\sigma_d,
\]
where the probability includes the signal, samples, and learner randomness.
Then there is an absolute $c>0$ such that
\[
 T(d)\ge c\,d\log\frac1{\epsilon(d)}
\]
for all sufficiently large $d$. The eventual threshold may depend on the
memory sequence.

Localization costs and information growth for exact Gaussian observations

Theorem (Repeated localization)

There is an absolute constant c>0 with the following property. For any fixed C_0>0, consider the experiment above with t\ge0 blocks and N\ge1 possible message values, and suppose

\bigl(2/m+e^{-ck}\bigr)\log N\le C_0d.

One can reveal nested dyadic cells Q_0\supset Q_1\supset\cdots\supset Q_t containing Z, where Q_i is a finite-valued measurable function of Z, the preceding revelations, and W_1,\ldots,W_i, so that the augmented transcript

\Pi_t=(W_1,Q_1,\ldots,W_t,Q_t)

satisfies

I(Z;\Pi_t)\le Cdt.

Here C is a constant depending only on C_0. If J_t is the level of Q_t, the construction also gives \E J_t\le Ct.

Section 3, Dyadic localization and its information cost Read it in the paper TeX source, line 54
Show the TeX
There is an absolute constant $c>0$ with the following property.
For any fixed $C_0>0$, consider the experiment above with $t\ge0$
blocks and $N\ge1$ possible message values, and suppose
\begin{equation}
 \bigl(2/m+e^{-ck}\bigr)\log N\le C_0d.
\end{equation}
One can reveal nested dyadic cells
$Q_0\supset Q_1\supset\cdots\supset Q_t$ containing $Z$, where $Q_i$
is a finite-valued measurable function of $Z$, the preceding revelations,
and $W_1,\ldots,W_i$, so that the augmented transcript
\[
 \Pi_t=(W_1,Q_1,\ldots,W_t,Q_t)
\]
satisfies
\begin{equation}
 I(Z;\Pi_t)\le Cdt.
\end{equation}
Here $C$ is a constant depending only on $C_0$. If $J_t$ is the level of $Q_t$, the
construction also gives $\E J_t\le Ct$.
Theorem (Precision lower bound from likelihood truncation)

Let M(d)=o(d^2) be a nonnegative integer-valued memory bound, and let 0<\epsilon(d)\le1/10. Suppose a family of learners in the model above satisfies

\mathbb P\!\left\{\arccos\langle\widehat s,s\rangle \le\epsilon(d)\right\}\ge\frac23 \qquad\text{for every }s\in S^{d-1}.

There is an absolute c>0 such that, for all sufficiently large d,

T(d)\ge c\,d\log_2\frac1{\epsilon(d)}.

The eventual dimension threshold may depend on the memory sequence.

Section 7, Likelihood truncation and selected dyadic cells Read it in the paper TeX source, line 34
Show the TeX
Let $M(d)=o(d^2)$ be a nonnegative integer-valued memory bound, and let
$0<\epsilon(d)\le1/10$.  Suppose a family of learners in the model
above satisfies
\[
 \mathbb P\!\left\{\arccos\langle\widehat s,s\rangle
              \le\epsilon(d)\right\}\ge\frac23
 \qquad\text{for every }s\in S^{d-1}.
\]
There is an absolute $c>0$ such that, for all sufficiently large $d$,
\[
 T(d)\ge c\,d\log_2\frac1{\epsilon(d)}.
\]
The eventual dimension threshold may depend on the memory sequence.
Theorem (The sample bound by separated-tuple localization)

Let M(d)=o(d^2) be integer-valued and let 0<\epsilon(d)\le1/10. Every learner of Section l:model with uniform-sphere angular success probability at least 2/3 must satisfy

T(d)\ge c\,d\log(1/\epsilon(d))

for all sufficiently large d, with an absolute c>0. The eventual dimension threshold may depend on the memory sequence. Success at least 2/3 for every fixed signal implies the same conclusion by averaging.

Section 10, Localization by separated tuples Read it in the paper TeX source, line 727
Show the TeX
Let \(M(d)=o(d^2)\) be integer-valued and let
\(0<\epsilon(d)\le1/10\).  Every learner of
Section~\ref{l:model} with uniform-sphere angular success probability
at least \(2/3\) must satisfy
\[
 T(d)\ge c\,d\log(1/\epsilon(d))
\]
for all sufficiently large \(d\), with an absolute \(c>0\).
The eventual dimension threshold may depend on the memory sequence.
Success at least \(2/3\) for every fixed signal implies the same
conclusion by averaging.

Projection moments, positive cap domination, and Riesz estimates on the sphere

Theorem (Finite-memory precision bound)

Let M(d)=o(d^2) be a sequence of nonnegative integers and let 0<\epsilon(d)\le1/10. There is an absolute c>0 such that, for all sufficiently large d, every learner in the experiment above whose uniform-sphere average success satisfies

\Prob\{\arccos\inner{\widehat S}{S}\le\epsilon(d)\}\ge\frac23

must use

T(d)\ge c\,d\log\frac1{\epsilon(d)}.

The dimension threshold may depend on the memory sequence. In particular, the conclusion holds when the same success probability is required separately for every s\in S^{d-1}.

Section 2, Spherical probabilities and exact observations Read it in the paper TeX source, line 175
Show the TeX
Let \(M(d)=o(d^2)\) be a sequence of nonnegative integers and let
\(0<\epsilon(d)\le1/10\). There is an absolute \(c>0\) such that, for
all sufficiently large \(d\), every learner in the experiment above whose
uniform-sphere average success satisfies
\[
 \Prob\{\arccos\inner{\widehat S}{S}\le\epsilon(d)\}\ge\frac23
\]
must use
\[
 T(d)\ge c\,d\log\frac1{\epsilon(d)}.
\]
The dimension threshold may depend on the memory sequence. In particular,
the conclusion holds when the same success probability is required
separately for every \(s\in S^{d-1}\).
Theorem (Integrated orthonormal-projection moment)

Let d,k,q be integers and \beta a real number with k\ge1, q\ge2, and

k+q\le d,\qquad 0<\beta\le d,\qquad \beta-k-(q-2)\ge1.

Let \nu be a finite positive Borel measure supported in B(z,R), R>0, satisfying (p:all-ball-mass) for some K\ge0. Assume that P_\#\nu is absolutely continuous with respect to Lebesgue measure for \vartheta_{d,k}-almost every P. There is a jointly measurable version g(P,u) of its density such that

\left(\int_{\mathcal V_{d,k}}\int_{\R^k}g(P,u)^q\,du\, d\vartheta_{d,k}(P)\right)^{1/q} \le C^d(C\sqrt d)^{k(1-1/q)} K R^{\beta-k(1-1/q)}.

For every P, this version vanishes when \norm{u-Pz}>R.

Section 3, Integrated moments of orthonormal projections Read it in the paper TeX source, line 168
Show the TeX
Let \(d,k,q\) be integers and \(\beta\) a real number with
\(k\ge1\), \(q\ge2\), and
\begin{equation}
 k+q\le d,\qquad 0<\beta\le d,\qquad
 \beta-k-(q-2)\ge1.
\end{equation}
Let \(\nu\) be a finite positive Borel measure supported in
\(B(z,R)\), \(R>0\), satisfying \eqref{p:all-ball-mass} for some
\(K\ge0\). Assume that \(P_\#\nu\) is absolutely continuous with
respect to Lebesgue measure for \(\vartheta_{d,k}\)-almost every \(P\).
There is a jointly measurable version \(g(P,u)\) of its density such that
\begin{equation}
 \left(\int_{\mathcal V_{d,k}}\int_{\R^k}g(P,u)^q\,du\,
 d\vartheta_{d,k}(P)\right)^{1/q}
 \le C^d(C\sqrt d)^{k(1-1/q)}
 K R^{\beta-k(1-1/q)}.
\end{equation}
For every \(P\), this version vanishes when \(\norm{u-Pz}>R\).
Theorem (Normalized moment for unit-ball measures)

For sufficiently large d, put

k=p=\lfloor d/16\rfloor,\qquad \lambda=(d-1)/2.

Let X be a k-by-d standard Gaussian matrix and define

H=(XX^{\mathsf T})^{1/2},\qquad P=H^{-1}X

on its probability-one full-row-rank event, and set P to a fixed frame on the null complement. Let m_k be uniform probability on the unit ball of \R^k. Suppose \nu is a finite positive Borel measure fixed independently of X, of mass at most one, supported in the unit ball of \R^d, such that for a fixed D>0,

\nu(B(b,t))\le D^d t^\lambda \qquad(b\in\R^d,\ t>0).

Assume P_\#\nu is absolutely continuous for almost every X. There is a jointly measurable nonnegative g_X(z) such that, for almost every X, P_\#\nu(dz)=g_X(z)\,dz/v_k. This version vanishes when \norm z>1 and satisfies

\E_X\int g_X(z)^p\,dm_k(z)\le \exp(C_Ddp).
Section 3, Integrated moments of orthonormal projections Read it in the paper TeX source, line 288
Show the TeX
For sufficiently large \(d\), put
\[
 k=p=\lfloor d/16\rfloor,\qquad \lambda=(d-1)/2.
\]
Let \(X\) be a \(k\)-by-\(d\) standard Gaussian matrix and define
\[
 H=(XX^{\mathsf T})^{1/2},\qquad P=H^{-1}X
\]
on its probability-one full-row-rank event, and set \(P\) to a fixed frame
on the null complement. Let \(m_k\) be uniform
probability on the unit ball of \(\R^k\). Suppose \(\nu\) is a finite
positive Borel measure fixed independently of \(X\), of mass at most one, supported in the unit ball
of \(\R^d\), such that for a fixed \(D>0\),
\[
 \nu(B(b,t))\le D^d t^\lambda
 \qquad(b\in\R^d,\ t>0).
\]
Assume \(P_\#\nu\) is absolutely continuous for almost every \(X\).
There is a jointly measurable nonnegative \(g_X(z)\) such that, for almost
every \(X\), \(P_\#\nu(dz)=g_X(z)\,dz/v_k\). This version vanishes when
\(\norm z>1\) and satisfies
\begin{equation}
 \E_X\int g_X(z)^p\,dm_k(z)\le \exp(C_Ddp).
\end{equation}

Replacing Gaussian observations in memory-constrained inference

Theorem (Mixed projection moment and exact density version)

Let n=d-1, let m,r,q\ge1 be integers, and put \ell=m+r. Suppose

\ell<n,\qquad \ell-m-(q-1)\ge1.

Let \rho be a finite nonnegative Borel measure on S^{d-1}. Suppose that B,D>0 and, for every z\in\R^d and t>0,

\rho(B(z,t))\le Bt^\ell,\qquad \rho(B(z,t))\le Dt^n.

Let X\sim\gamma_m and Z\sim\gamma_r be independent, and set G=(X;Z). For \delta>0, define the cube average

p_{\rho,\delta}(g,y) =(2\delta)^{-\ell}\int \ind_{\{\norm{gu-y}_\infty\le\delta\}}\,d\rho(u).

There is an absolute C such that, for every fixed s\in S^{d-1} and every \delta>0,

\left[\E_X \left(\E_Z p_{\rho,\delta}((X;Z),(X;Z)s)\right)^q \right]^{1/q} \le e^{Cd}B\bigl(1+\log^+(D/B)\bigr).

If in addition \rho\ll\sigma, use the jointly Borel density p_\rho in (eq:r-density-version). There is a measurable set E_\rho\subset S^{d-1}, with \rho(E_\rho)=0, such that for every s\notin E_\rho the cube averages converge to p_\rho(G,Gs) for \gamma_\ell-almost every G, and

\left[\E_X \left(\E_Zp_\rho((X;Z),(X;Z)s)\right)^q \right]^{1/q} \le e^{Cd}B\bigl(1+\log^+(D/B)\bigr).

When \rho\ne0, E_\rho may also be chosen so that 0<p_\rho(G,Gs)<\infty for \gamma_\ell-almost every G and every s\notin E_\rho.

Section 3, A projection moment with shared and fresh rows Read it in the paper TeX source, line 23
Show the TeX
Let \(n=d-1\), let \(m,r,q\ge1\) be integers, and put
\(\ell=m+r\).  Suppose
\begin{equation}
 \ell<n,\qquad \ell-m-(q-1)\ge1.
\end{equation}
Let \(\rho\) be a finite nonnegative Borel measure on \(S^{d-1}\).
Suppose that \(B,D>0\) and, for every \(z\in\R^d\) and \(t>0\),
\begin{equation}
 \rho(B(z,t))\le Bt^\ell,\qquad
 \rho(B(z,t))\le Dt^n.
\end{equation}
Let \(X\sim\gamma_m\) and \(Z\sim\gamma_r\) be independent, and set
\(G=(X;Z)\).  For \(\delta>0\), define the cube average
\[
 p_{\rho,\delta}(g,y)
   =(2\delta)^{-\ell}\int
       \ind_{\{\norm{gu-y}_\infty\le\delta\}}\,d\rho(u).
\]
There is an absolute \(C\) such that, for every fixed
\(s\in S^{d-1}\) and every \(\delta>0\),
\begin{equation}
 \left[\E_X
       \left(\E_Z p_{\rho,\delta}((X;Z),(X;Z)s)\right)^q
 \right]^{1/q}
 \le e^{Cd}B\bigl(1+\log^+(D/B)\bigr).
\end{equation}

If in addition \(\rho\ll\sigma\), use the jointly Borel density
\(p_\rho\) in \eqref{eq:r-density-version}.  There is a measurable
set \(E_\rho\subset S^{d-1}\), with \(\rho(E_\rho)=0\), such that
for every \(s\notin E_\rho\) the cube averages converge to
\(p_\rho(G,Gs)\) for \(\gamma_\ell\)-almost every \(G\), and
\begin{equation}
 \left[\E_X
       \left(\E_Zp_\rho((X;Z),(X;Z)s)\right)^q
 \right]^{1/q}
 \le e^{Cd}B\bigl(1+\log^+(D/B)\bigr).
\end{equation}
When \(\rho\ne0\), \(E_\rho\) may also be chosen so that
\(0<p_\rho(G,Gs)<\infty\) for \(\gamma_\ell\)-almost every \(G\)
and every \(s\notin E_\rho\).
Theorem (Critical-radius comparison)

In the two experiments of Subsection subsec:r-two-experiments, use the dimensions (eq:r-critical-parameters). Thus S\sim\sigma, A\sim\gamma_m is independent of S, and W is countable with an arbitrary joint dependence on (S,A). The aligned law retains (S,A,W) and appends independent r-row C, whereas the independent law retains (S,W) and draws an independent \ell-row matrix G. If H(W)\le d^2, then, for an absolute constant K,

I_0(S;W\mid G,GS)\le I_1(S;W\mid G,GS)+Kd.
Section 4, A critical radius makes the density terms cancel Read it in the paper TeX source, line 22
Show the TeX
In the two experiments of Subsection~\ref{subsec:r-two-experiments},
use the dimensions \eqref{eq:r-critical-parameters}.  Thus
\(S\sim\sigma\), \(A\sim\gamma_m\) is independent of \(S\), and
\(W\) is countable with an arbitrary joint dependence on \((S,A)\).
The aligned law retains \((S,A,W)\) and appends independent
\(r\)-row \(C\), whereas the independent law retains \((S,W)\)
and draws an independent \(\ell\)-row matrix \(G\).
If \(H(W)\le d^2\), then, for an absolute constant \(K\),
\begin{equation}
 I_0(S;W\mid G,GS)\le I_1(S;W\mid G,GS)+Kd.
\end{equation}
Theorem (Streaming consequence of the critical radius)

Let M(d) be a nonnegative integer sequence with M(d)=o(d^2), and let 0<\epsilon(d)\le1/10. For each d, consider a learner in Definition def:r-streaming-model with deterministic finite horizon T(d). If its uniform-sphere angular success probability, including all learner randomness, is at least 3/5, then

T(d)\ge c\,d\log\frac1{\epsilon(d)}

for an absolute c>0 and all sufficiently large d. The eventual dimension threshold may depend on the memory sequence.

Section 8, From row comparisons to streaming lower bounds Read it in the paper TeX source, line 284
Show the TeX
Let \(M(d)\) be a nonnegative integer sequence with \(M(d)=o(d^2)\),
and let \(0<\epsilon(d)\le1/10\).  For each \(d\), consider a learner
in Definition~\ref{def:r-streaming-model} with deterministic finite
horizon \(T(d)\).  If its uniform-sphere angular success probability,
including all learner randomness, is at least \(3/5\), then
\[
 T(d)\ge c\,d\log\frac1{\epsilon(d)}
\]
for an absolute \(c>0\) and all sufficiently large \(d\).  The
eventual dimension threshold may depend on the memory sequence.

Subsphere methods for memory-sample lower bounds in noiseless Gaussian regression

Theorem (Explicit noiseless precision bound)

Let M:\mathbb N\to\mathbb Z_{\ge0} satisfy M(d)=o(d^2). There is a dimension threshold depending only on this memory sequence such that, for every larger d, every 0<\epsilon\le1/10, and every learner in Definition s:model, the following implication holds. If S is uniform on S^{d-1}, independently of the Gaussian rows and learner randomness, and

\Prob\{\arccos\ip{\widehat s}{S}\le\epsilon\}\ge\frac23,

then

T\ge 2^{-16}d\log_2(1/\epsilon).
Section 1, Introduction Read it in the paper TeX source, line 53
Show the TeX
Let \(M:\mathbb N\to\mathbb Z_{\ge0}\) satisfy \(M(d)=o(d^2)\).
There is a dimension threshold depending only on this memory sequence
such that, for every larger \(d\), every \(0<\epsilon\le1/10\), and
every learner in Definition~\ref{s:model}, the following implication
holds. If \(S\) is uniform on \(S^{d-1}\), independently of the
Gaussian rows and learner randomness, and
\[
 \Prob\{\arccos\ip{\widehat s}{S}\le\epsilon\}\ge\frac23,
\]
then
\begin{equation}
 T\ge 2^{-16}d\log_2(1/\epsilon).
\end{equation}
Corollary (Guarantees for every signal)

Under the memory assumption of Theorem s:main, suppose a learner satisfies

\Prob_s\{\arccos\ip{\widehat s}{s}\le\epsilon\}\ge\frac23 \qquad\text{for every }s\in S^{d-1},

where \Prob_s averages its observations and randomness at the fixed signal s. Then (s:main-bound) holds at the same dimension threshold.

Section 1, Introduction Read it in the paper TeX source, line 69
Show the TeX
Under the memory assumption of Theorem~\ref{s:main}, suppose a learner
satisfies
\[
 \Prob_s\{\arccos\ip{\widehat s}{s}\le\epsilon\}\ge\frac23
 \qquad\text{for every }s\in S^{d-1},
\]
where \(\Prob_s\) averages its observations and randomness at the fixed
signal \(s\). Then \eqref{s:main-bound} holds at the same dimension
threshold.
Configuration and file facts
OpenAI’s Lean catalogue
OpenAI lists this as a main result in its Lean catalogue.
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
64 local vocabulary declarations
Lines of Lean, without comments or blank lines
428
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

Gaussian replacement and information bounds

Family 140: Memory–sample lower bounds for noiseless Gaussian regression

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

def MixedMomentMain : Prop :=  ∃ C : ℝ, 0 < C ∧ ∀ (d m r q : ℕ), AdmissibleDimensions d m r q →    ∀ (ρ : Measure (Sphere d)), IsFiniteMeasure ρ →    ∀ (B D : ℝ), 0 < B → 0 < D → LocalGrowth ρ (m+r) B → LocalGrowth ρ (d-1) D →    (∀ (s : Sphere d) (δ : ℝ), 0 < δ →      (∫⁻ X, (∫⁻ Z, cubeAverage ρ (Fin.append X Z)        (label (Fin.append X Z) (s : Vector d)) δ ∂gaussianRows r d)^q          ∂gaussianRows m d) ≤ (momentConstant C d B D)^q) ∧    (ρ ≪ uniformSphere d → ∃ E : Set (Sphere d), MeasurableSet E ∧ ρ E = 0 ∧      ∀ s ∉ E,        (∀ᵐ G ∂gaussianRows (m+r) d,          Tendsto (fun δ : ℝ => cubeAverage ρ G (label G (s : Vector d)) δ)            (𝓝[>] 0) (𝓝 (exactDensity ρ G (label G (s : Vector d))))) ∧        ((∫⁻ X, (∫⁻ Z, exactDensity ρ (Fin.append X Z)          (label (Fin.append X Z) (s : Vector d)) ∂gaussianRows r d)^q            ∂gaussianRows m d) ≤ (momentConstant C d B D)^q) ∧        (ρ ≠ 0 → ∀ᵐ G ∂gaussianRows (m+r) d,          0 < exactDensity ρ G (label G (s : Vector 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

64 local vocabulary declarationsAllowed axioms: propext, Quot.sound, Classical.choiceopenai/math at fd4aeebwcook04.github.io/plectis-atlas/statements/GaussianReplacement.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.

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