Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.1, p. 12 — t₁ + 2t_d = T₁ + T₂ + ⋯ + T_d

Proved
CircletTSP.Facet.window_count

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

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

Let n=2dn=2dn=2d be a positive multiple of 444 and HHH a Hamiltonian cycle on KnK_nKn​. Then

t1+2td=T1+T2+⋯+Td,t_1+2t_d=T_1+T_2+\dots+T_d,t1​+2td​=T1​+T2​+⋯+Td​,

where TuT_uTu​ is the number of edges of HHH among {u,u+1},{u+d,u+d+1},{u,u+d},{u+1,u+1+d}\{u,u+1\},\{u+d,u+d+1\},\{u,u+d\},\{u+1,u+1+d\}{u,u+1},{u+d,u+d+1},{u,u+d},{u+1,u+1+d}, the edges of the window Wu={u,u+1,u+d,u+1+d}W_u=\{u,u+1,u+d,u+1+d\}Wu​={u,u+1,u+d,u+1+d} of length 111 or ddd.

Each edge of length 111 lies in exactly one of the windows W1,…,WdW_1,\dots,W_dW1​,…,Wd​ and each edge of length ddd in exactly two, so rotating the window ddd times counts t1+2tdt_1+2t_dt1​+2td​.

Formalization Note The windows u=1,…,du=1,\dots,du=1,…,d are the 0-based vertices 0,…,d−10,\dots,d-10,…,d−1.

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): for a Hamiltonian cycle on `n = 2d` vertices,
`t₁ + 2 t_d = T₁ + T₂ + ⋯ + T_d`, where `T_u` counts the edges of the cycle inside the window
`{u, u + 1, u + d, u + 1 + d}` (the windows `u = 1, …, d` are the 0-based `u = 0, …, d - 1`). -/
theorem window_count (n : ℕ) (hn : 0 < n) (h4 : 4 ∣ n) (π : Equiv.Perm (Fin n)) :
    lenCount n 1 (MetricTSP.tourVec π) + 2 * lenCount n (n / 2) (MetricTSP.tourVec π) =
      ∑ u ∈ Finset.univ.filter (fun u : Fin n => u.val < n / 2), window π u := by sorry

end CircletTSP.Facet
Source
Gutekunst, Williamson, The Circlet Inequalities, arXiv:2012.12363v1, pp. 11–12, proof of Theorem 3.1
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