Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 4.1, p. 13 — reflection exchanges structures B1 and B2 at equal circlet cost

Proved
CircletTSP.Facet.claim_4_1

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

circlet-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1symmetry

Let nnn be a positive multiple of 444. Then:

  1. for every Hamiltonian cycle HHH on KnK_nKn​ containing structure B2 (Figure 4) at some vertex, there is a Hamiltonian cycle H′H'H′ with the same value of ∑i=1dciti\sum_{i=1}^{d} c_i t_i∑i=1d​ci​ti​ containing structure B1 at some vertex;
  2. conversely, every Hamiltonian cycle containing B1 at some vertex has a counterpart of the same circlet value containing B2.

In particular, a counterexample to Theorem 3.1 on nnn vertices containing an instance of B2 yields a counterexample on nnn vertices containing an instance of B1, and vice versa, which is Claim 4.1. It reduces Lemma 3.4 to the structures A and B2.

Formalization Note The paper's claim is about counterexamples, which do not exist once Theorem 3.1 is proved; it is stated here in the stronger form its proof gives (relabelling i↦n−ii\mapsto n-ii↦n−i preserves every length), which implies the printed claim. Both directions are posed: the claim prints B2 ⇒ B1, the proof says "and vice versa", and the reduction uses B1 ⇒ B2.

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

/-- Claim 4.1 (p. 13), in the form its proof gives: relabelling vertex `i` as `n - i` turns a
Hamiltonian cycle containing structure B2 of Figure 4 into one of the same circlet cost containing
structure B1, and vice versa. In particular a counterexample to Theorem 3.1 with a B2 yields one
with a B1. -/
theorem claim_4_1 (n : ℕ) (hn : 0 < n) (h4 : 4 ∣ n) :
    (∀ (π : Equiv.Perm (Fin n)) (u : Fin n), IsStructB2 π u →
      ∃ (π' : Equiv.Perm (Fin n)) (u' : Fin n),
        circletForm n (MetricTSP.tourVec π') = circletForm n (MetricTSP.tourVec π) ∧
          IsStructB1 π' u') ∧
    (∀ (π : Equiv.Perm (Fin n)) (u : Fin n), IsStructB1 π u →
      ∃ (π' : Equiv.Perm (Fin n)) (u' : Fin n),
        circletForm n (MetricTSP.tourVec π') = circletForm n (MetricTSP.tourVec π) ∧
          IsStructB2 π' u') := by sorry

end CircletTSP.Facet
Source
Gutekunst, Williamson, The Circlet Inequalities, arXiv:2012.12363v1, p. 13, Claim 4.1 and its proof
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