Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.1, p. 12 — without the structures of Figure 4 every window has T_u ≤ 2

Proved
CircletTSP.Facet.window_le_two

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

circlet-inequalitycountingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n≥8n\ge 8n≥8 be a multiple of 444, d=n/2d=n/2d=n/2, and let HHH be a Hamiltonian cycle on KnK_nKn​ that contains none of the structures A, B1, B2 of Figure 4 at any vertex. Then for every vertex uuu,

Tu≤2.T_u\le 2 .Tu​≤2.

Tu=4T_u=4Tu​=4 would make the window a subtour, and Tu=3T_u=3Tu​=3 means three edges of the window's 444-cycle, which form one of the structures of Figure 4. Combined with the window count and Lemma 3.4 this gives t1+2td≤nt_1+2t_d\le nt1​+2td​≤n, contradicting Lemma 3.3.

Formalization Note The hypothesis "no structure at any vertex" is what Lemma 3.4 supplies ("for any u∈[n]u\in[n]u∈[n]"); it is needed in this form, since three window edges at uuu may form structure A at u+du+du+d rather than a structure at uuu. n≥8n\ge 8n≥8 is the page's "By Claim 3.2, n≥8n\ge 8n≥8" (p. 10).

Preamble
import Mathlib
import Definitions.Def_MetricTSP_tour_vector
import Definitions.Def_CircletTSP_Facet_Setting
Formal statement
namespace CircletTSP.Facet

/-- Proof of Theorem 3.1 (p. 12): in a Hamiltonian cycle on `n ≥ 8` vertices containing none of
the structures A, B1, B2 of Figure 4 (at any vertex), every window count satisfies `T_u ≤ 2`. -/
theorem window_le_two (n : ℕ) (hn : 8 ≤ n) (h4 : 4 ∣ n) (π : Equiv.Perm (Fin n))
    (hno : ∀ u : Fin n, ¬ IsStructA π u ∧ ¬ IsStructB1 π u ∧ ¬ IsStructB2 π u) :
    ∀ u : Fin n, window π u ≤ 2 := by sorry

end CircletTSP.Facet
Source
Gutekunst, Williamson, The Circlet Inequalities, arXiv:2012.12363v1, p. 12, proof of Theorem 3.1 ('By Lemma 3.4, T_u ≤ 2')
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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