Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8 — for fixed q, (22a) and (22b) hold for equally many indices

Proved
GilmoreGomoryTSP.Bottleneck.lemma_8_count

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1permutationstraveling-salesman

Let φ\varphiφ and ψ\psiψ be permutations of the jobs 1,…,N1,\dots,N1,…,N and fix an index qqq with 1≤q<N1 \le q < N1≤q<N. Then the number of indices iii satisfying (22a) equals the number of indices jjj satisfying (22b):

#{ i:i≤q<φ−1ψ(i) }  =  #{ j:φ−1ψ(j)≤q<j }.\#\{\, i : i \le q < \varphi^{-1}\psi(i) \,\} \;=\; \#\{\, j : \varphi^{-1}\psi(j) \le q < j \,\}.#{i:i≤q<φ−1ψ(i)}=#{j:φ−1ψ(j)≤q<j}.

In words: the permutation φ−1ψ\varphi^{-1}\psiφ−1ψ sends as many indices from {1,…,q}\{1,\dots,q\}{1,…,q} above qqq as it sends from above qqq into {1,…,q}\{1,\dots,q\}{1,…,q}. This counting fact is used to show that an arc of Gψ∗G_\psi^*Gψ∗​ outside GφG_\varphiGφ​ always comes with an index satisfying (22a).

Formalization Note The statement involves only φ\varphiφ, ψ\psiψ and qqq; the ranking property of φ\varphiφ, which the paper has in force, is not used in it and is not assumed. qqq ranges over the arc indices Fin n (0-based), the range in which (22a)/(22b) are used.

Preamble
import Mathlib
import Definitions.Def_GilmoreGomoryTSP_Bottleneck_Model
Formal statement
namespace GilmoreGomoryTSP.Bottleneck

open Classical in
theorem lemma_8_count {n : ℕ} (φ ψ : Equiv.Perm (Fin (n + 1))) (q : Fin n) :
    (Finset.univ.filter (fun i => Cond22a φ ψ q i)).card =
      (Finset.univ.filter (fun j => Cond22b φ ψ q j)).card := by sorry

end GilmoreGomoryTSP.Bottleneck
Source
Gilmore and Gomory, Sequencing a one state-variable machine, Oper. Res. 12 (1964), p. 668, Lemma 8
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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