Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma C.5 — One-step suffix contraction

Open
GinibrePermanent977.Anticoncentration.Supplement.lemma_C_5

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

anticoncentrationp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrandom-matrix-theory

Use the independent-row setting of Appendix C. Fix 1≤k≤n1\le k\le n1≤k≤n and σk>0\sigma_k>0σk​>0. Suppose the quaternionic row RkR_kRk​ obeys

Eexp⁡(−s∣Rkc∣2)≤Eexp⁡(−sσk2∣gkc∣2)(c∈Hn, s≥0),E\exp(-s|R_kc|^2)\le E\exp(-s\sigma_k^2|g_kc|^2)\qquad(c\in\mathbb H^n,\ s\ge0),Eexp(−s∣Rk​c∣2)≤Eexp(−sσk2​∣gk​c∣2)(c∈Hn, s≥0),

where gkg_kgk​ is a standard quaternionic Gaussian row. Let the whole vector a=(aS)S∈Ska=(a_S)_{S\in\mathcal S_k}a=(aS​)S∈Sk​​ have an arbitrary Borel probability law, independent of Rk,…,RnR_k,\ldots,R_nRk​,…,Rn​. For one fresh standard Gaussian vector hhh, independent of all original data, define simultaneously

aT′=σk∑j∉TaT∪{j}hj.a'_T=\sigma_k\sum_{j\notin T}a_{T\cup\{j\}}h_j.aT′​=σk​j∈/T∑​aT∪{j}​hj​.

The random vector a′a'a′ is independent of the future rows. Conditional on those rows and aaa, almost surely and simultaneously for every s≥0s\ge0s≥0,

ERkexp⁡(−s∣Pk[a]∣2)≤Ehexp⁡(−s∣Pk+1[a′]∣2).E_{R_k}\exp(-s|P_k[a]|^2)\le E_h\exp(-s|P_{k+1}[a']|^2).ERk​​exp(−s∣Pk​[a]∣2)≤Eh​exp(−s∣Pk+1​[a′]∣2).

If RkR_kRk​ has the law of σkgk\sigma_kg_kσk​gk​, equality holds for every such sss. No moments of aaa are assumed, and the coordinates of a′a'a′ need not be independent. This is the common quaternionic replacement input for Theorems 4.1 and C.1.

Formalization Note Independent full rows BBB carry the future suffix; rows up to the current row are unused dummy coordinates. The actual current row is integrated separately. Independence from the entire dummy-extended BBB expresses independence from the future rows. Source PkP_kPk​ is Lean suffixEval (k-1).

Differences from the source:

  • encoding: 1-based row and column indices → zero-based Fin indices, with source row k+1 represented by k; reason: finite reindexing preserves all rows and increasing multiplication order
  • encoding: independent random inputs → coordinate functions under their probability product laws; reason: these are exactly the joint laws of independent Borel random variables; no moment or density restriction is added
  • encoding: conditional expectation given the future rows and a → almost-everywhere inequality for the explicit current-row and fresh-Gaussian integrals, simultaneously for every s ≥ 0; reason: product independence identifies these integrals with conditional expectation versions; unused earlier rows do not enter either suffix
  • encoding: fresh coefficients exist, with equality for Gaussian R_k → the explicit contractCoeff from the proof; equality when the current-row law is the pushforward of gaussVec by σ • ·; reason: this is exactly the one-vector construction on p.21, including its right multiplication order
Preamble
import Mathlib
import Definitions.Def_GinibrePermanent977_Anticoncentration_Supplement_Model
open MeasureTheory ProbabilityTheory
open scoped Quaternion BigOperators
Formal statement
namespace GinibrePermanent977.Anticoncentration.Supplement

/-- Lemma C.5, p.21. The product sample space carries random a, independent rows B and
one fresh Gaussian vector h. The row at k is integrated separately under μ. The conditional
comparison holds almost surely simultaneously for every s≥0. The explicit coefficient map
is independent of all the remaining rows and gives equality when μ is the scaled Gaussian law. -/
theorem lemma_C_5 (n k : ℕ) (hk : k < n) (σ : ℝ) (hσ : 0 < σ)
    (μ : Measure (Fin n → Scalar.quaternion.K)) [IsProbabilityMeasure μ]
    (hproj : ∀ (c : Fin n → Scalar.quaternion.K) (s : ℝ), 0 ≤ s →
      (∫ r, Real.exp (-s * ‖rowAction r c‖ ^ 2) ∂μ) ≤
        ∫ g, Real.exp (-s * σ ^ 2 * ‖rowAction g c‖ ^ 2) ∂gaussVec .quaternion n)
    (α : Measure (Coeff n k)) [IsProbabilityMeasure α]
    (ρ : Fin n → Measure (Fin n → Scalar.quaternion.K))
    [∀ i, IsProbabilityMeasure (ρ i)] :
    IndepFun
      (fun x : Coeff n k × ((Fin n → Fin n → Scalar.quaternion.K) ×
          (Fin n → Scalar.quaternion.K)) => contractCoeff k hk σ x.1 x.2.2)
      (fun x => x.2.1)
      (α.prod ((Measure.pi ρ).prod (gaussVec .quaternion n))) ∧
    ∀ᵐ t ∂(α.prod (Measure.pi ρ)), ∀ s : ℝ, 0 ≤ s →
      ((∫ r, Real.exp (-s * ‖suffixEval k (by omega) (replaceRow k t.2 r) t.1‖ ^ 2) ∂μ) ≤
        ∫ h, Real.exp (-s * ‖suffixEval (k+1) (by omega) t.2
          (contractCoeff k hk σ t.1 h)‖ ^ 2) ∂gaussVec .quaternion n) ∧
      (μ = (gaussVec .quaternion n).map (fun g => σ • g) →
        (∫ r, Real.exp (-s * ‖suffixEval k (by omega) (replaceRow k t.2 r) t.1‖ ^ 2) ∂μ) =
          ∫ h, Real.exp (-s * ‖suffixEval (k+1) (by omega) t.2
            (contractCoeff k hk σ t.1 h)‖ ^ 2) ∂gaussVec .quaternion n) := by sorry

end GinibrePermanent977.Anticoncentration.Supplement
Source
Frederic Koehler, Pui Kuen Leung, STOC 2027 submission #977 (October 2026), Lemma C.5, p.21 (PDF SHA256 e25737f1d5e3492905f8eeaa41d92c55d95f73622a3b5846cc87aac6a346d4ec)

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