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.