Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.2 (used in the proof of Theorem 1.3) — reduction to three-coloring

Open
FasterExactColoring.ThreeColor.Supplement.three_color_terminal_reduction

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

exact-algorithmsgraph-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Fix a three-coloring solver with uniform O∗(τn)O^*(\tau^n)O∗(τn) charged worst-case time on all finite simple graphs. If it is deterministic, the following terminal solver is deterministic; if it is one-sided Monte Carlo, the terminal solver is one-sided Monte Carlo. There are one finite program and constants C>0,d∈NC>0,d\in\mathbb NC>0,d∈N, fixed for this solver and its base, deciding every valid terminal restricted four-coloring instance within a polynomial in its full encoded size times

3nK34nK4τ∣S∣+2nK3+3nK4.3^{n_{K_3}}4^{n_{K_4}}\tau^{|S|+2n_{K_3}+3n_{K_4}}.3nK3​​4nK4​​τ∣S∣+2nK3​​+3nK4​​.

Here nK3,nK4n_{K_3},n_{K_4}nK3​​,nK4​​ count the clique components of G[U]G[U]G[U]. The base is not specialized inside this lemma. Randomized success is at least 1/21/21/2, with no false positives and charged amplification of subcalls. This reduction supplies the terminal alternative using either the published Theorem 1.1 or the new Theorem 1.2.

Differences from the source:

  • encoding: terminal instances after the two maximal-star preprocessing steps → valid restricted instances with supplied valid inclusion-maximal star packings, all structural counts computed from them; reason: the explicit finite input includes the graph, restrictions and packings; its size is polynomial in the original vertex count
  • generalization: deterministic three-coloring solver and terminal reduction → the implication is stated both for deterministic and for one-sided Monte Carlo solvers; reason: the deterministic case is the full printed lemma; Section 5.7 also applies this reduction with Theorem 1.2, with charged amplification as required by Section 2
Preamble
import Mathlib
import Definitions.Def_FasterExactColoring_ThreeColor_Supplement_TerminalBounds

set_option autoImplicit false
Formal statement
namespace FasterExactColoring.ThreeColor.Supplement

theorem three_color_terminal_reduction (mode : Mode) (τ : ℝ)
    (h : ∃ (A : Program) (C : ℝ) (d : ℕ), 0 < C ∧ graphSolver mode 3 A C d τ) :
  ∃ (A : Program) (C : ℝ) (d : ℕ), 0 < C ∧
    terminalSolver mode A C d (fun P _K => threeColorFactor P τ) := by sorry

end FasterExactColoring.ThreeColor.Supplement
Source
Ryosuke Yamano, Tetsuo Shibuya, STOC 2027 submission #727 (October 2026), Lemma 5.2, p. 11 (PDF p. 13)

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