Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.3 — HintSketch row recovery

Proved
LinearSetReconciliation327.Main.lemma_5_3

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

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

For sufficiently large AAA, then CCC, at a recursive or direct node: for a regular row, final recovery on the true transcript differs from SjS_jSj​ with probability at most η2/8\eta^2/8η2/8; and for an input and hint satisfying (3), the expected number of coordinates of J∪supp(x)J\cup\mathrm{supp}(x)J∪supp(x) in overloaded rows is at most Dη2D\eta^2Dη2.

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: O-notation with absolute constants → explicit absolute constants and exponents quantified before all instance parameters; reason: §2.1: unless stated otherwise constants are absolute
  • encoding: sufficiently large absolute A, then sufficiently large C → ∃A₀ ∀A≥A₀ ∃C₀ ∀C≥C₀, before the instance; reason: §5.2 fixes A first and then C
Preamble
import Mathlib
import Definitions.Def_LinearSetReconciliation327_Main_Basic
import Definitions.Def_LinearSetReconciliation327_Main_Framework
import Definitions.Def_LinearSetReconciliation327_Main_HintSketch

open scoped ENNReal
open Finset
Formal statement
namespace LinearSetReconciliation327.Main

/-- Lemma 5.3 (Row recovery), PDF p.21 (printed p.20). `A`, then `C`, are sufficiently large. -/
theorem lemma_5_3 :
    ∃ A₀ : ℕ, ∀ A ≥ A₀, ∃ C₀ : ℕ, ∀ C ≥ C₀, ∀ (n lam N X Y : ℕ),
      let P : HintParams := ⟨A, C, n, lam⟩
      P.NodeArgs N X Y → P.NonLeaf N X Y →
      (∀ (j : Fin (P.rows X Y)) (Jj Sj : Finset ℕ),
        Jj ⊆ range (rowLen N (P.rows X Y) j.val) → Sj ⊆ range (rowLen N (P.rows X Y) j.val) →
        ¬ P.Overloaded N X Y Jj Sj →
        let sch := P.scheme N X Y
        prU (fun β : sch.Rand => sch.final j β Jj (sch.truePrefix j β Sj sch.ℓ) ≠ Sj) ≤
          P.eta ^ 2 / 8) ∧
      (∀ x J : Finset ℕ, Node.Valid N X Y x J →
        expU (fun π : Equiv.Perm (Fin N) => (P.overloadedMass N X Y π x J : ℝ)) ≤
          (HintParams.D N X Y : ℝ) * P.eta ^ 2) := by sorry

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