Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.8 — Concentration of column counts and residual

Proved
LinearSetReconciliation327.Main.lemma_4_8

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

linear-sketchp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1set-reconciliationsparse-recovery

Fix a node's input xxx and hint JJJ, with m≥1m\ge1m≥1 rows and D≥mD\ge mD≥m, ∣J∪supp(x)∣≤D|J\cup\mathrm{supp}(x)|\le D∣J∪supp(x)∣≤D. If each final row estimate of the exact execution has at most K≥1K\ge1K≥1 positions, then for all Δ>0\Delta>0Δ>0 and columns sss: Pr⁡[Us>EUs+Δ]≤exp⁡(−2Δ2/(5D))\Pr[U_s>\mathbb EU_s+\Delta]\le\exp(-2\Delta^2/(5D))Pr[Us​>EUs​+Δ]≤exp(−2Δ2/(5D)), Pr⁡[Vs>EVs+Δ]≤exp⁡(−2Δ2/(5D))\Pr[V_s>\mathbb EV_s+\Delta]\le\exp(-2\Delta^2/(5D))Pr[Vs​>EVs​+Δ]≤exp(−2Δ2/(5D)), and Pr⁡[Z>EZ+Δ]≤exp⁡(−Δ2/(10DK2))\Pr[Z>\mathbb EZ+\Delta]\le\exp(-\Delta^2/(10DK^2))Pr[Z>EZ+Δ]≤exp(−Δ2/(10DK2)).

Differences from the source:

  • encoding: 0-based or 1-based coordinates [N] → 0-based Fin N or range N, with supports as finite sets and vector addition as symmetric difference; reason: the source identifies subsets with characteristic vectors and any injection relabels the coordinates
  • generalization: a node of the top layer or of HintSketch → any RowScheme: any row code, prediction and final-recovery procedures; reason: the proof uses only that a row reads its local support, local hint and coins; both constructions are RowSchemes, so the source claim is an instance
  • encoding: Pr and E over the node randomness → uniform averages over the finite type of a permutation of [N] and the row coins; reason: this is the source law; coins for indices up to N_max beyond a shorter row are never read
Preamble
import Mathlib
import Definitions.Def_LinearSetReconciliation327_Main_Basic
import Definitions.Def_LinearSetReconciliation327_Main_Framework

open scoped ENNReal
open Finset
Formal statement
namespace LinearSetReconciliation327.Main

/-- Lemma 4.8 (Concentration), PDF p.18 (printed p.17), for a node of any row scheme. -/
theorem lemma_4_8 (sch : RowScheme) (x J : Finset ℕ) (hx : x ⊆ range sch.N) (hJ : J ⊆ range sch.N)
    (hm : 1 ≤ sch.m) (D : ℕ) (hD : sch.m ≤ D) (hDJ : (J ∪ x).card ≤ D) (K : ℕ) (hK : 1 ≤ K)
    (hest : ∀ (lr : sch.LocalSeed) (j : Fin sch.m), (sch.exactRowEst lr x J j).card ≤ K)
    (Δ : ℝ) (hΔ : 0 < Δ) :
    (∀ s : Fin sch.ℓ,
      prU (fun lr : sch.LocalSeed => expU (fun lr' : sch.LocalSeed => (sch.U lr' x J s : ℝ)) + Δ <
          (sch.U lr x J s : ℝ)) ≤ Real.exp (-(2 * Δ ^ 2 / (5 * (D : ℝ))))) ∧
    (∀ s : Fin sch.ℓ,
      prU (fun lr : sch.LocalSeed => expU (fun lr' : sch.LocalSeed => (sch.V lr' x J s : ℝ)) + Δ <
          (sch.V lr x J s : ℝ)) ≤ Real.exp (-(2 * Δ ^ 2 / (5 * (D : ℝ))))) ∧
    prU (fun lr : sch.LocalSeed => expU (fun lr' : sch.LocalSeed => (sch.Z lr' x J : ℝ)) + Δ <
        (sch.Z lr x J : ℝ)) ≤ Real.exp (-(Δ ^ 2 / (10 * (D : ℝ) * (K : ℝ) ^ 2))) := by sorry

end LinearSetReconciliation327.Main
Source
Tianren Liu, Rui Xu, Tong Yang, Kangyang Zhou, STOC 2027 submission #327 (October 2026), Lemma 4.8, PDF p.18 (printed p.17)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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