Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 19 — a failed level deletes fewer than 2T/δ2T/\delta2T/δ vertices; over ℓ\ellℓ failed levels fewer than 2ℓT/δ2\ell T/\delta2ℓT/δ

Disproved
GaussLocalMaxColoring.Main.lemma_19

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

gaussian-roundinggraph-coloringp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1randomized-algorithmssemidefinite-programming

Consider one trial of Algorithm 2 on a graph GGG with vectors {vx}\{v_x\}{vx​}, threshold δ>0\delta>0δ>0, target TTT and R≥1R\ge1R≥1 samples per level, as a function of its Gaussian samples. If every independent set I(i)I^{(i)}I(i) sampled at level jjj (1≤j≤ℓ1\le j\le\ell1≤j≤ℓ) has size less than TTT, then ∣Fj−1∖Fj∣<2T/δ|F_{j-1}\setminus F_j|<2T/\delta∣Fj−1​∖Fj​∣<2T/δ. In particular, if this holds at all levels j=1,…,ℓj=1,\dots,\ellj=1,…,ℓ, then ∑j=1ℓ∣Fj−1∖Fj∣<2ℓT/δ\sum_{j=1}^{\ell}|F_{j-1}\setminus F_j|<2\ell T/\delta∑j=1ℓ​∣Fj−1​∖Fj​∣<2ℓT/δ.

Formalization Note. The second claim is false as printed when ℓ=⌈log⁡n⌉=0\ell=\lceil\log n\rceil=0ℓ=⌈logn⌉=0 (n≤1n\le1n≤1): both sides are 000 (insight I4). It is stated as printed.

Differences from the source:

  • generalization: §4, high-degree parameters of Table 2, a strict vector 3-coloring ("Lemma 19 holds for arbitrary δ and T") → any graph, any vectors, any real δ > 0, any T ∈ ℕ; reason: the proof is pure counting; the paper's settings (Table 2, Table 3, Appendix A) are instances
  • encoding: R ∈ ℕ samples per level, p̂_j(x) = R⁻¹ Σ_i 1[x ∈ I^{(i)}] → 1 ≤ R; reason: p̂_j is undefined for R = 0
  • encoding: the trial stops at its first SUCCESS; F_j exists only if levels 1..j failed → cores computed for every level as if no level succeeded (they equal the trial's cores whenever constructed); the hypothesis is on the sets sampled at level j; reason: a total function of the samples; the statement is about levels whose sampled sets all have size < T
  • encoding: vertex set V with a fixed total order breaking ties → V = Fin n with its order; reason: Lean convention; every finite ordered vertex set is relabelled this way
Preamble
import Mathlib
import Definitions.Def_GaussLocalMaxColoring_Main_Iterative

open scoped RealInnerProductSpace
open Filter MeasureTheory ProbabilityTheory
open RecGaussColoring.Main
open Classical
Formal statement
namespace GaussLocalMaxColoring.Main

/-- **Lemma 19** (p. 18, PDF 20), for one trial of Algorithm 2 with any graph, any vectors, any
`δ > 0`, any `T` and `R ≥ 1` samples per level: if every sampled independent set at level `j`
has size `< T`, then `|F_{j−1} ∖ F_j| < 2T/δ`; if this holds at all levels `j = 1, …, ℓ`, then
`Σ_{j=1}^{ℓ} |F_{j−1} ∖ F_j| < 2ℓT/δ`. -/
theorem lemma_19 {n d R : ℕ} (G : SimpleGraph (Fin n)) (v : Fin n → Space d) (δ : ℝ)
    (hδ : 0 < δ) (T : ℕ) (hR : 1 ≤ R) (ω : Fin (numLevels n) × Fin R → Space d) :
    (∀ j, 1 ≤ j → j ≤ numLevels n → (∀ i, (sampleSet G v δ ω j i).card < T) →
      ((cores G v δ ω (j - 1) \ cores G v δ ω j).card : ℝ) < 2 * T / δ) ∧
    ((∀ j, 1 ≤ j → j ≤ numLevels n → ∀ i, (sampleSet G v δ ω j i).card < T) →
      (∑ j ∈ Finset.Icc 1 (numLevels n),
          ((cores G v δ ω (j - 1) \ cores G v δ ω j).card : ℝ)) <
        2 * (numLevels n : ℝ) * T / δ) := by sorry

end GaussLocalMaxColoring.Main
Source
Deguchi, Kawarabayashi, Yoneda, Yoneda (2026), An O(n^0.1537)-Coloring Algorithm for 3-Colorable Graphs, arXiv:2610.35859 (SHA-256 9917b0a1…), Lemma 19, printed p. 18 (PDF 20)
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 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