Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.7 — The success-weighted number of light vertices satisfies E_G[XY] ≤ 2∆τ + bCκ with the exact decision-tree constants.

Open
GreedyColoringLCA969.LowerBound.Supplement.lemma_5_7

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

graph-theorylocal-computationp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Fix integers Δ≥3\Delta\ge3Δ≥3, λ≥2\lambda\ge2λ≥2, τ≥1\tau\ge1τ≥1 and a deterministic standard-oracle algorithm with fixed tape. Draw the hard represented graph GGG by selecting each group configuration independently and uniformly. Let XXX count all light vertices and let YYY indicate global MIS success. Set

b=2Δλ,q⋆=⌊Δ/50⌋,D=b∑h=0q⋆−1bh,C=2D+1,b=2\Delta\lambda,\quad q_\star=\lfloor\Delta/50\rfloor,\quad D=b\sum_{h=0}^{q_\star-1}b^h,\quad C=2D+1,b=2Δλ,q⋆​=⌊Δ/50⌋,D=bh=0∑q⋆​−1​bh,C=2D+1,

and let κ(Δ,λ)\kappa(\Delta,\lambda)κ(Δ,λ) count distinct one-group configurations. Then

EG[XY]≤2Δτ+bCκ(Δ,λ).\mathbb E_G[XY]\le2\Delta\tau+bC\kappa(\Delta,\lambda).EG​[XY]≤2Δτ+bCκ(Δ,λ).

Only group configurations are averaged here, with the tape fixed. The estimate is success-weighted, not a bound on E[X]\mathbb E[X]E[X] or a conditional expectation. The finite sum is empty when q⋆=0q_\star=0q⋆​=0.

Differences from the source:

  • encoding: vertices 1 through n and L-valued answers in the standard adjacency-list model → Fin n identifiers and injective positive-integer return codes, with success and cost derived from the immutable shared-tape execution; reason: shifting identifiers and coding labels preserves every graph, list order, question and graph-query count
  • encoding: independent uniform group configurations and E_G[XY] → the arithmetic mean over all distinct HardInput representations, with kappa the one-group cardinality; reason: restriction to fixed blocks is a bijection to the product of one-group configurations; the spaces are finite and nonempty, so this mean is the same product expectation
  • generalization: LCAs return Boolean labels → arbitrary positive return codes and possible nontermination; invalid codes and nontermination fail global MIS success; reason: the published machine includes all source LCAs; for Theorem 5.6 and Lemma 5.7 invalid codes can be normalized to a Boolean label without graph queries or reducing success, while the rewiring proof of Lemma 5.4 uses only equality of returned codes; infinite executions are never light
Preamble
import Definitions.Def_GreedyColoringLCA969_LowerBound_Supplement_HardInputs

open scoped ENNReal BigOperators
open MeasureTheory Classical
set_option autoImplicit false
Formal statement
namespace GreedyColoringLCA969.LowerBound.Supplement

theorem lemma_5_7 (Δ lam τ : ℕ) (hΔ : 3 ≤ Δ) (hlam : 2 ≤ lam) (hτ : 1 ≤ τ)
    (B : DeterministicLCA .standard) :
    hardExpectation Δ lam τ (fun R => successWeightedLight B R.val Δ) ≤
      (2 * Δ * τ : ℕ) + (groupSize Δ lam * decisionC Δ lam * kappa Δ lam : ℕ) := by sorry

end GreedyColoringLCA969.LowerBound.Supplement
Source
Zi Song Yeoh, Krzysztof Onak, Dragos-Florian Ristache, STOC 2027 submission #969 (October 2026), p. 30 (PDF 31), Lemma 5.7

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