Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.1 — Across words

Proved
LinearSetReconciliation327.Main.lemma_6_1

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

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

Place ddd reference labels uniformly at distinct positions of [n][n][n], let TjT_jTj​ count those in row jjj, and qa=∑jPr⁡[Tj≥a]q_a=\sum_j\Pr[T_j\ge a]qa​=∑j​Pr[Tj​≥a] for a≥1a\ge1a≥1. For every x∈Sn,dx\in S_{n,d}x∈Sn,d​ and column (a,k)(a,k)(a,k): EUa,k≤qa\mathbb EU_{a,k}\le q_aEUa,k​≤qa​, ∑a≥1qa=d\sum_{a\ge1}q_a=d∑a≥1​qa​=d, and H((qa/d)a≥1)≤log⁡(2e)H((q_a/d)_{a\ge1})\le\log(2e)H((qa​/d)a≥1​)≤log(2e).

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
  • generalization: stated in the row-column regime of §6.2 → all 2 ≤ d ≤ n and every value of C′; reason: the source proof uses only d ≤ n and the Pinsketch uniqueness; the regime is a special case
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.1 (Across words), PDF p.28 (printed p.27). Source word `a` is `a + 1` here. -/
theorem lemma_6_1 (P : TopParams) (hargs : P.Args) (F : Type) [Field F] [Fintype F]
    [Algebra (ZMod 2) F] (b : Module.Basis (Fin P.w) (ZMod 2) F) (ι : ℕ → F) (hι : P.IsAddress ι)
    (x : Finset ℕ) (hx : x ⊆ range P.n) (hxd : x.card ≤ P.d) :
    (∀ s : Fin P.ell,
      expU (fun lr : (P.scheme b ι).LocalSeed => ((P.scheme b ι).U lr x ∅ s : ℝ)) ≤
        P.q ((P.wordIdx s).val + 1)) ∧
    (∑' a : ℕ, ENNReal.ofReal (P.q (a + 1))) = (P.d : ℝ≥0∞) ∧
    entropy (fun a : ℕ => P.q (a + 1) / (P.d : ℝ)) ≤
      ENNReal.ofReal (lg (2 * Real.exp 1)) := by sorry

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