Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.4 — Top-layer residual repair

Proved
LinearSetReconciliation327.Main.lemma_6_4

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

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

Fix A≥10A\ge10A≥10 and a CR family with rows≤KCRtlog⁡2(N+2)\mathrm{rows}\le K_{CR}t\log^2(N+2)rows≤KCR​tlog2(N+2). There is KKK such that for sufficiently large C′C'C′, in the row-column regime, for t=min⁡{n,d(B+1),⌈2η(d+1)⌉}t=\min\{n,d(B+1),\lceil2\eta(d+1)\rceil\}t=min{n,d(B+1),⌈2η(d+1)⌉} and every x∈Sn,dx\in S_{n,d}x∈Sn,d​: Pr⁡[Z>t]≤2−λ∗\Pr[Z>t]\le2^{-\lambda_*}Pr[Z>t]≤2−λ∗​, and the final CR sketch has at most Kd/log⁡nKd/\log nKd/logn rows.

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
  • 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
  • encoding: the CR sketch of Proposition 2.3 → rows of any CR family with the row bound of Proposition 2.3; reason: the source proof uses only this row bound
  • encoding: A fixed in §5 with A ≥ 10 w.l.o.g. (Lemma 6.3) → hypothesis A ≥ 10; reason: the choice made in the proof of Lemma 6.3
Preamble
import Mathlib
import Definitions.Def_LinearSetReconciliation327_Main_Basic
import Definitions.Def_LinearSetReconciliation327_Main_Framework
import Definitions.Def_LinearSetReconciliation327_Main_TopLevel

open scoped ENNReal
open Finset
Formal statement
namespace LinearSetReconciliation327.Main

/-- Lemma 6.4 (Residual repair), PDF p.30 (printed p.29). `A` is the fixed constant of §5, the CR
family has the row bound of Proposition 2.3, and `C'` is sufficiently large. -/
theorem lemma_6_4 (A : ℕ) (hA : 10 ≤ A) (KCR : ℝ) :
    ∃ K : ℝ, 0 < K ∧ ∃ C₀ : ℕ, ∀ C' ≥ C₀, ∀ (n d lam : ℕ) (CR : CRFamily),
      (∀ N' t : ℕ, t ≤ N' → (CR.rows N' t : ℝ) ≤ KCR * ((t : ℝ) * lg ((N' : ℝ) + 2) ^ 2)) →
      let P : TopParams := ⟨A, C', n, d, lam⟩
      P.Args → P.RowColumnRegime →
      ∀ (F : Type) [Field F] [Fintype F] [Algebra (ZMod 2) F]
        (b : Module.Basis (Fin P.w) (ZMod 2) F) (ι : ℕ → F), P.IsAddress ι →
      (∀ x : Finset ℕ, x ⊆ range P.n → x.card ≤ P.d →
        let sch := P.scheme b ι
        prU (fun lr : sch.LocalSeed => P.resid < sch.Z lr x ∅) ≤ ((2 : ℝ) ^ P.lamStar)⁻¹) ∧
      (CR.rows n P.resid : ℝ) ≤ K * ((d : ℝ) / P.lgn) := by sorry

end LinearSetReconciliation327.Main
Source
Tianren Liu, Rui Xu, Tong Yang, Kangyang Zhou, STOC 2027 submission #327 (October 2026), Lemma 6.4, PDF p.30 (printed p.29)
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