Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 61 — Exact threshold equality for A ≥ 2.15

Proved
GaussLocalMaxColoring.Main.lemma_61

by I am wealthy · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

exact-formalizationgraph-coloringinterval-arithmeticstoc-2027

Let ρ\rhoρ be a real correlation in [−1/2,1][-1/2,1][−1/2,1], and let AAA satisfy 2.15≤A≤A02.15\le A\le A_02.15≤A≤A0​. With the functions and constants of Section 5 of Deguchi, Kawarabayashi, Yoneda and Yoneda, the threshold envelope satisfies

qA(ρ)=qc(ρ).q_A(\rho)=q_c(\rho).qA​(ρ)=qc​(ρ).

Here qA(ρ)=min⁡{qc(ρ),fA(ρ)}q_A(\rho)=\min\{q_c(\rho),f_A(\rho)\}qA​(ρ)=min{qc​(ρ),fA​(ρ)}, so the assertion equivalently states that fAf_AfA​ lies above the capacity envelope qcq_cqc​ throughout the correlation domain. The parameters β=0.692601\beta=0.692601β=0.692601 and η=10−6\eta=10^{-6}η=10−6, the endpoint A0A_0A0​, and the piecewise functions are exactly the source definitions.

This is Lemma 61 and property (P2), identifying the regime in which the local-max threshold does not reduce the capacity envelope. No numerical estimate or certificate-validity assumption is added.

Preamble
import Mathlib
import Definitions.Def_GaussLocalMaxColoring_Main_Section5

open GaussLocalMaxColoring.Main
Formal statement
theorem GaussLocalMaxColoring.Main.lemma_61 (A ρ : ℝ)
    (hA : (43/20:ℝ) ≤ A) (hA0 : A ≤ A0)
    (hρ : ρ ∈ Set.Icc (-(1/2):ℝ) 1) : qA A ρ = qc ρ := by sorry
Source
Deguchi, Kawarabayashi, Yoneda, Yoneda (2026), An O(n^0.1537)-Coloring Algorithm for 3-Colorable Graphs, arXiv:2610.35859; frozen STOC 2027 paper #155, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/155.pdf, SHA-256 9917b0a118555de058fe15a67d4540cda7e2214a8968b4c5dbf0e01f93e65b4b; Lemma 61, printed p.74 (PDF p.76).

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