Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.3 — Top-layer child capacities

Proved
LinearSetReconciliation327.Main.lemma_6_3

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 α≥0\alpha\ge0α≥0. There is KKK such that for sufficiently large C′C'C′, in the row-column regime, for every x∈Sn,dx\in S_{n,d}x∈Sn,d​ each of Ua,k>Xa,kU_{a,k}>X_{a,k}Ua,k​>Xa,k​, Va,k>Ya,kV_{a,k}>Y_{a,k}Va,k​>Ya,k​ has probability at most 2−λ∗2^{-\lambda_*}2−λ∗​, and ∑a,kXa,k≤dw+KC′d/log⁡n\sum_{a,k}X_{a,k}\le dw+KC'd/\log n∑a,k​Xa,k​≤dw+KC′d/logn, ∑a,khd(Ya,k)≤Kd+KC′d/log⁡n\sum_{a,k}h_d(Y_{a,k})\le Kd+KC'd/\log n∑a,k​hd​(Ya,k​)≤Kd+KC′d/logn, ∑a,k(Xa,k+αhd(Ya,k))≤dw+Kd+KC′d/log⁡n\sum_{a,k}(X_{a,k}+\alpha h_d(Y_{a,k}))\le dw+Kd+KC'd/\log n∑a,k​(Xa,k​+αhd​(Ya,k​))≤dw+Kd+KC′d/logn.

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: O(d) + O(C′d/log n), with A, α fixed in §6.2 → K independent of C′, chosen after A and α; reason: the source treats A and α as absolute constants of §5
  • encoding: w.l.o.g. A ≥ 10 → hypothesis A ≥ 10; reason: the source proof assumes it explicitly
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.3 (Top-layer child capacities), PDF p.30 (printed p.29). `A` and `α` are the fixed
constants of §5; the hidden constant `K` precedes `C'`, which is sufficiently large. -/
theorem lemma_6_3 (A : ℕ) (hA : 10 ≤ A) (α : ℝ) (hα : 0 ≤ α) :
    ∃ K : ℝ, 0 < K ∧ ∃ C₀ : ℕ, ∀ C' ≥ C₀, ∀ (n d lam : ℕ),
      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 ι
        ∀ s : Fin P.ell,
          prU (fun lr : sch.LocalSeed => P.capX (P.wordIdx s).val < sch.U lr x ∅ s) ≤
            ((2 : ℝ) ^ P.lamStar)⁻¹ ∧
          prU (fun lr : sch.LocalSeed =>
              P.capY (P.wordIdx s).val (P.bitIdx s).val < sch.V lr x ∅ s) ≤
            ((2 : ℝ) ^ P.lamStar)⁻¹) ∧
      (∑ a ∈ range P.B, ∑ _k ∈ range P.w, (P.capX a : ℝ) ≤
        (d : ℝ) * P.w + K * ((C' : ℝ) * d / P.lgn)) ∧
      (∑ a ∈ range P.B, ∑ k ∈ range P.w, hN d (P.capY a k) ≤
        K * d + K * ((C' : ℝ) * d / P.lgn)) ∧
      (∑ a ∈ range P.B, ∑ k ∈ range P.w, ((P.capX a : ℝ) + α * hN d (P.capY a k)) ≤
        (d : ℝ) * P.w + K * d + K * ((C' : ℝ) * 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.3, 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