Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.2 — fixed-frame perturbation (corrected: nonnegative tolerance)

Proved
GaussMixGated.ExactReal.Supplement.lemma_A_2

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

distribution-learningfinite-bit-computationgaussian-mixturesp2o-batch-stoc27sp2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let t≥2t\ge2t≥2 be an integer, N≥max⁡{2,t}N\ge\max\{2,t\}N≥max{2,t} real and 0≤h≤10\le h\le10≤h≤1. Let ℓ\ellℓ range over any finite set of terms, and let term ℓ\ellℓ have rℓ≤tr_\ell\le trℓ​≤t factors, real coefficient cℓc_\ellcℓ​ and factor values xℓj,x^ℓjx_{\ell j},\widehat x_{\ell j}xℓj​,xℓj​. Assume ∑ℓ∣cℓ∣≤N2t\sum_\ell|c_\ell|\le N^{2t}∑ℓ​∣cℓ​∣≤N2t, ∣xℓj∣≤N|x_{\ell j}|\le N∣xℓj​∣≤N and ∣x^ℓj−xℓj∣≤h|\widehat x_{\ell j}-x_{\ell j}|\le h∣xℓj​−xℓj​∣≤h. For F(x)=∑ℓcℓ∏j=1rℓxℓjF(x)=\sum_\ell c_\ell\prod_{j=1}^{r_\ell}x_{\ell j}F(x)=∑ℓ​cℓ​∏j=1rℓ​​xℓj​, both bounds hold:

∣F(x)∣≤N3t,∣F(x^)−F(x)∣≤N4th.|F(x)|\le N^{3t},\qquad |F(\widehat x)-F(x)|\le N^{4t}h.∣F(x)∣≤N3t,∣F(x)−F(x)∣≤N4th.

The term set may be empty and zero-factor products equal one. Factors may repeat and satisfy no independence condition. This estimate supplies the fixed-frame perturbation control in the precision budget for Theorem A.1.

Differences from the source:

  • correction: the printed condition |xhat-x| ≤ h ≤ 1 permits negative h when every product is empty → the tolerance also satisfies 0 ≤ h; reason: with one empty product, coefficient 1, N=t=2 and h=-1 every printed assumption holds but the error conclusion is 0 ≤ -256; the added condition corrects exactly this empty-factor defect
  • encoding: a finite sum of products with at most t factors per term → a finite index type and dependent factor types Fin (r l), allowing empty products and repeated values; reason: this represents all finite expressions with the same coefficient and factor bounds
Preamble
import Mathlib
Formal statement
namespace GaussMixGated.ExactReal.Supplement

/-- Lemma A.2, PDF p. 34 (printed p. 32). The tolerance is nonnegative.
Correction at empty products: with N=t=2, h=-1 and one constant term c=1, all printed
factor conditions are vacuous but the printed error bound reads 0 ≤ -256. -/
theorem lemma_A_2 {ι : Type*} [Fintype ι] (N : ℝ) (t : ℕ) (h : ℝ)
    (r : ι → ℕ) (c : ι → ℝ) (x xhat : (l : ι) → Fin (r l) → ℝ)
    (hN2 : 2 ≤ N) (hNt : (t : ℝ) ≤ N) (ht : 2 ≤ t)
    (hr : ∀ l, r l ≤ t) (hc : ∑ l, |c l| ≤ N ^ (2 * t))
    (hh0 : 0 ≤ h) (hh1 : h ≤ 1)
    (hx : ∀ l j, |x l j| ≤ N) (hxh : ∀ l j, |xhat l j - x l j| ≤ h) :
    |∑ l, c l * ∏ j, x l j| ≤ N ^ (3 * t) ∧
      |(∑ l, c l * ∏ j, xhat l j) - (∑ l, c l * ∏ j, x l j)| ≤
        N ^ (4 * t) * h := by sorry

end GaussMixGated.ExactReal.Supplement
Source
Zheng, Xie, He, Learning Finite Gaussian Location Mixtures via Gated Moments and Posterior Covers, STOC 2027 submission #36 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/36.pdf, Lemma A.2, PDF p. 34 (printed p. 32)

View graph

Get started

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

About Prove2Me

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

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me