Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.10 — Size and depth of the recursion

Proved
LinearSetReconciliation327.Main.lemma_5_10

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

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

There is an absolute KKK such that for sufficiently large AAA, then CCC, and every node satisfying the standing assumptions, the recursion built from the stopping rules terminates and its tree has at most K(log⁡log⁡n+1)K(\log\log n+1)K(loglogn+1) levels, at most Klog⁡13nK\log^{13}nKlog13n recursive nodes and at most KAlog⁡27nKA\log^{27}nKAlog27n nodes in all.

Differences from the source:

  • 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
  • encoding: O(log log n) levels → K(log log n + 1); reason: at n = 2, log log n = 0 while a tree has a level; the term 1 only makes the bound meaningful at finitely many small n
  • encoding: the recursion is well founded (implicit) → the tree is built with fuel, and reaching a tree within the bound is a conclusion; reason: termination is part of what the lemma shows and is not assumed
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.10 (Size and depth of the recursion), PDF p.25 (printed p.24). The recursion terminates
within the stated number of levels, which is part of the conclusion. -/
theorem lemma_5_10 :
    ∃ K : ℝ, 0 < K ∧ ∃ A₀ : ℕ, ∀ A ≥ A₀, ∃ C₀ : ℕ, ∀ C ≥ C₀, ∀ (n lam N X Y : ℕ),
      let P : HintParams := ⟨A, C, n, lam⟩
      P.NodeArgs N X Y →
      ∃ (fuel : ℕ) (T : Node), P.tree fuel N X Y = some T ∧
        (fuel : ℝ) ≤ K * (lg (lg n) + 1) ∧
        (T.depth : ℝ) ≤ K * (lg (lg n) + 1) ∧
        (T.recursiveCount : ℝ) ≤ K * lg n ^ 13 ∧
        (T.nodeCount : ℝ) ≤ K * (A : ℝ) * lg n ^ 27 := by sorry

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