Lemma61 threshold certificate branch0: -(1/2) ≤ ρ ≤ -(1/40)
ProvedGaussLocalMaxColoring.Main.lemma_61_branch_0exact-formalizationgraph-coloringinterval-arithmeticstoc-2027
For every real ρ in the closed interval [-(1/2),-(1/40)], the unchanged Section5 threshold functions satisfy q_c(ρ) < f_(2.15)(ρ), with A=43/20 exactly. This is an independent supporting branch of the complete numerical inequality in original Lemma61. All constants and piecewise capacity functions are the public definitions; there is no assumption of validity of a certificate, Taylor bound, or numerical search.
Preamble
import Mathlib import Definitions.Def_GaussLocalMaxColoring_Main_Section5 open GaussLocalMaxColoring.Main
Formal statement
theorem GaussLocalMaxColoring.Main.lemma_61_branch_0 (ρ : ℝ)
(hρ : ρ ∈ Set.Icc (-(1/2):ℝ) (-(1/40):ℝ)) : qc ρ < fA (43/20) ρ := by sorrySource
Deguchi, Kawarabayashi, Yoneda, Yoneda (2026), An O(n^0.1537)-Coloring Algorithm for 3-Colorable Graphs; frozen STOC2027 paper155, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/155.pdf, SHA256 9917b0a118555de058fe15a67d4540cda7e2214a8968b4c5dbf0e01f93e65b4b; Lemma61 proof, printedp74/PDFp76. Exact supporting branch of the source f_gt_q_c certificate.