Lemma 61 — Exact threshold equality for A ≥ 2.15
ProvedGaussLocalMaxColoring.Main.lemma_61exact-formalizationgraph-coloringinterval-arithmeticstoc-2027
Let be a real correlation in , and let satisfy . With the functions and constants of Section 5 of Deguchi, Kawarabayashi, Yoneda and Yoneda, the threshold envelope satisfies
Here , so the assertion equivalently states that lies above the capacity envelope throughout the correlation domain. The parameters and , the endpoint , 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 sorrySource
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).