Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.6 — For every ∆≥3 and 0<ε<1 there is an algorithm-independent n forcing more than a 1−ε fraction of vertices to have expected query cost strictly greater than ∆/1000, for every MIS LCA gl...

Open
GreedyColoringLCA969.LowerBound.Supplement.theorem_5_6

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

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

For every integer Δ≥3\Delta\ge3Δ≥3 and real 0<ε<10<\varepsilon<10<ε<1, there is a positive integer n=n(Δ,ε)n=n(\Delta,\varepsilon)n=n(Δ,ε) such that the following holds for every randomized standard-oracle MIS LCA AAA. If its global success probability is at least 4/54/54/5 on every Δ\DeltaΔ-regular graph of every size and on every adjacency-list representation, then some represented Δ\DeltaΔ-regular graph RRR on exactly nnn vertices satisfies both

A is not (Δ/1000,ε)-efficient on R,A\text{ is not }(\Delta/1000,\varepsilon)\text{-efficient on }R,A is not (Δ/1000,ε)-efficient on R,

and

∣{v:Er[qA(R,r,v)]>Δ/1000}∣>(1−ε)n.\bigl|\{v:\mathbb E_r[q_A(R,r,v)]>\Delta/1000\}\bigr|>(1-\varepsilon)n.​{v:Er​[qA​(R,r,v)]>Δ/1000}​>(1−ε)n.

Equivalently, strictly fewer than εn\varepsilon nεn vertices have expected cost at most Δ/1000\Delta/1000Δ/1000. The size is fixed before the algorithm; the hard representation may depend on it. This retains constant-error algorithms, arbitrary cross-group queries, and both strict inequalities.

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: not efficient, hence a strictly greater than 1-epsilon inefficient fraction → both negated Efficient and the strict complementary cardinality inequality, on a positive n chosen before A; reason: the finite vertex set partitions into costs at most Delta/1000 and strictly greater costs, including infinite costs
  • 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_LabelPerformance

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

theorem theorem_5_6 (Δ : ℕ) (hΔ : 3 ≤ Δ) (ε : ℝ) (hε : 0 < ε) (hε1 : ε < 1) :
    ∃ n : ℕ, 0 < n ∧ ∀ A : Algorithm .standard,
      (∀ (m : ℕ) (R : Representation m), Regular R.graph Δ →
        ENNReal.ofReal (4 / 5 : ℝ) ≤ labelingProbability MIS boolCode A R) →
      ∃ R : Representation n, Regular R.graph Δ ∧
        ¬ Efficient A R ((Δ : ℝ) / 1000) ε ∧
        (1 - ε) * (n : ℝ) < ((Finset.univ.filter (fun v =>
          ENNReal.ofReal ((Δ : ℝ) / 1000) < expectedQueries A R v)).card : ℝ) := by sorry

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

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