Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.8 — the planted likelihood ratio on a separated multigraph

Open
InducedExpanderTest989.Structural.Supplement.lemma_6_8

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

fourier-analysisgraph-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let r≥1r\ge1r≥1, K=F2rK=\mathbb F_2^rK=F2r​, q=2rq=2^rq=2r, and let 0≤p≤1/40\le p\le1/40≤p≤1/4 be a noise rate with bias ρ=1−qp/(q−1)\rho=1-qp/(q-1)ρ=1−qp/(q−1). Let HHH be a finite multigraph with a spanning forest FFF and RRR nonforest edges, and let Dsep≥1D_{\rm sep}\ge1Dsep​≥1 be an integer. Assume that the 2R2R2R endpoints of the nonforest edges are distinct and pairwise at distance at least DsepD_{\rm sep}Dsep​ in FFF (distance ∞\infty∞ between different trees). Then every labelling y∈KE(H)y\in K^{E(H)}y∈KE(H) satisfies

∣DH(y)−1∣≤(1+(q−1)ρDsep)R−1≤exp⁡((q−1)RρDsep)−1,|D_H(y)-1|\le\big(1+(q-1)\rho^{D_{\rm sep}}\big)^R-1\le\exp\big((q-1)R\rho^{D_{\rm sep}}\big)-1,∣DH​(y)−1∣≤(1+(q−1)ρDsep​)R−1≤exp((q−1)RρDsep​)−1,

where DH(y)=q∣E(H)∣Pr⁡PH(y)D_H(y)=q^{|E(H)|}\Pr^H_{\mathcal P}(y)DH​(y)=q∣E(H)∣PrPH​(y) is the likelihood ratio of the planted noisy-potential law against the uniform law of labels.

When an algorithm has exposed a forest plus a few far-apart extra edges, its view under the planted law is close to its view under uniform labels. This is the analytic core of the indistinguishability step in the lower bound of Theorem 6.1.

Formalization Note The multigraph is a pair of finite types with an endpoint map, loops and parallel edges allowed. Distinctness of the endpoints is injectivity of the map from (nonforest edge, side) to vertices. Both inequalities are conclusions.

Differences from the source:

  • encoding: a finite multigraph H with spanning forest F and nonforest edges → finite types V, E, ends : E → V × V and F : Finset E with IsSpanningForest; R = |E \ F|; reason: Lean representation of the same objects
  • encoding: the 2R endpoints of the nonforest edges are distinct → the endpoint-occurrence map on (E \ F) × Fin 2 is injective; reason: the same condition
Preamble
import Mathlib
import Definitions.Def_InducedExpanderTest989_Structural_Supplement_NoisyLabels

set_option autoImplicit false
open scoped BigOperators ENNReal NNReal
noncomputable section
Formal statement
namespace InducedExpanderTest989.Structural.Supplement

/-- Peng–Shen, STOC 2027 #989, Lemma 6.8 (p. 41, PDF 43), both inequalities of (35). `H` is the
finite multigraph `(V, E, ends)`, `R = |E \ F|`, `q = 2^r`, `ρ = noiseBias r p`. -/
theorem lemma_6_8 {V E : Type} [Fintype V] [Fintype E] [DecidableEq E]
    (r : ℕ) (hr : 1 ≤ r) (ends : E → V × V) (F : Finset E) (hF : IsSpanningForest ends F)
    (Dsep : ℕ) (hD : 1 ≤ Dsep)
    (hdistinct : Function.Injective (nonforestEndpoint ends F))
    (hsep : ∀ a b : {e // e ∉ F} × Fin 2, a ≠ b →
      (Dsep : ℕ∞) ≤ forestDist ends F (nonforestEndpoint ends F a) (nonforestEndpoint ends F b))
    (p : ℝ) (hp : 0 ≤ p) (hp' : p ≤ 1/4) (y : E → LabelGroup r) :
    |likelihoodRatio r p ends y - 1| ≤
        (1 + ((2 : ℝ) ^ r - 1) * noiseBias r p ^ Dsep) ^ (Finset.univ \ F).card - 1 ∧
      (1 + ((2 : ℝ) ^ r - 1) * noiseBias r p ^ Dsep) ^ (Finset.univ \ F).card - 1 ≤
        Real.exp (((2 : ℝ) ^ r - 1) * (Finset.univ \ F).card * noiseBias r p ^ Dsep) - 1 := by sorry

end InducedExpanderTest989.Structural.Supplement
Source
Pan Peng, Ranran Shen, Testing for a Large Induced Expander: Sublinear Algorithms and Query Lower Bounds, STOC 2027 submission #989 (October 2026), source.pdf SHA-256 98b4035a0ac121d1c1bfb6abdeb3cdb6cf3304ef3cb21b2cd58c97e4bbce6334, p.41 (PDF p.43), Lemma 6.8, eq. (35); objects pp.35–37, 40 (PDF pp.37–39, 42), eqs. (23), (34)

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