Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A terminal minimum head leaves an unoccupied predecessor cut of height one above minimum

Proved
LX.AnchoredPhases.odd_unpaid_head_predecessor_cut

by chaos-ghost · Nov 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

cayley-graphscombinatoricsglushkov-lxgroup-theory

A terminal minimum head leaves an unoccupied predecessor cut of height one above minimum.

Let n>0n>0n>0 and write In=Z/nZI_n=\mathbb Z/n\mathbb ZIn​=Z/nZ, represented by 0,…,n−10,\ldots,n-10,…,n−1. The symbol rep⁡\operatorname{rep}rep takes a residue to its nonnegative representative and leaves ordinary integers unchanged. Residue sums and differences are cyclic; inequalities use representatives. S(In)\mathfrak S(I_n)S(In​) is the permutation group. Function symbols are written in curried notation; a subscript #\## means finite cardinality. An existential www is a finite word in these generators. Natural subtraction is truncated at zero; scalar price expressions and quantities coerced by rep⁡\operatorname{rep}rep are read in the integers. The identity permutation is 111. h(p,a)=∣{i:q(p,a)(i)<i}∣h(p,a)=|\{i:q(p,a)(i)<i\}|h(p,a)=∣{i:q(p,a)(i)<i}∣ counts its ordinary descending arrows. R(p,a,t)=B(p,a,t)−tR(p,a,t)=B(p,a,t)-tR(p,a,t)=B(p,a,t)−t is the integer rank surplus. H(p,t)H(p,t)H(p,t) counts descents of the threshold permutation i↦p(i)−ti\mapsto p(i)-ti↦p(i)−t. Words use forward rotation l:i↦i+1l:i\mapsto i+1l:i↦i+1 and adjacent exchange x=(0 1)x=(0\ 1)x=(0 1); ev⁡(w)\operatorname{ev}(w)ev(w) is their ordered product. q(p,a)(i)=p(i)+a−p(a)q(p,a)(i)=p(i)+a-p(a)q(p,a)(i)=p(i)+a−p(a) is the anchored permutation, with arithmetic in the residue circle. B(p,a,t)=∣{i:rep⁡(r(p,a,i))<t}∣B(p,a,t)=|\{i:\operatorname{rep}(r(p,a,i))<t\}|B(p,a,t)=∣{i:rep(r(p,a,i))<t}∣ counts offsets below the natural threshold. r(p,a,i)=p(i)−i−(p(a)−a)r(p,a,i)=p(i)-i-(p(a)-a)r(p,a,i)=p(i)−i−(p(a)−a) is the relative cyclic offset.

The precise quantified assertion, with all its hypotheses, is

∀(n:N>0)(p:S(In))(a:In),n=2 hpa+3→2≤hpa→(∀(b:In),hpa≤hpb)→(∀(t:In),Rparep⁡ t≤3)→hp0=hpa→0<rep⁡ (−p0)→rep⁡ (−p0)≤hpa+3→(¬∃w,p ev⁡w=1∧4 rep⁡ wℓ≤3 rep⁡ n2−8 rep⁡ n+9)→hpa≤rep⁡ (p0−1)∧p0≠p0−1∧Hp(p0−1)=hpa+1∧(∀(b:In),pb−b≠p0−1)∧∀(b:In),hpb=hpa+1→rep⁡ (pb−b)<rep⁡ (p0−1)\forall (n : \mathbb N_{>0}) (p : \mathfrak S(I_n)) (a : I_{n}), n = 2\, h p a + 3 \to 2 \le h p a \to (\forall (b : I_{n}), h p a \le h p b) \to (\forall (t : I_{n}), R p a \operatorname{rep}\,t \le 3) \to h p 0 = h p a \to 0 < \operatorname{rep}\,(-p 0) \to \operatorname{rep}\,(-p 0) \le h p a + 3 \to (\neg \exists w, p\, \operatorname{ev} w = 1 \land 4\, \operatorname{rep}\,w_{\ell} \le 3\, \operatorname{rep}\,n ^{2} - 8\, \operatorname{rep}\,n + 9) \to h p a \le \operatorname{rep}\,(p 0 - 1) \land p 0 \ne p 0 - 1 \land H p (p 0 - 1) = h p a + 1 \land (\forall (b : I_{n}), p b - b \ne p 0 - 1) \land \forall (b : I_{n}), h p b = h p a + 1 \to \operatorname{rep}\,(p b - b) < \operatorname{rep}\,(p 0 - 1)∀(n:N>0​)(p:S(In​))(a:In​),n=2hpa+3→2≤hpa→(∀(b:In​),hpa≤hpb)→(∀(t:In​),Rparept≤3)→hp0=hpa→0<rep(−p0)→rep(−p0)≤hpa+3→(¬∃w,pevw=1∧4repwℓ​≤3repn2−8repn+9)→hpa≤rep(p0−1)∧p0=p0−1∧Hp(p0−1)=hpa+1∧(∀(b:In​),pb−b=p0−1)∧∀(b:In​),hpb=hpa+1→rep(pb−b)<rep(p0−1)

This result is used to constrain the remaining phases or to construct a sorting word with the stated cost.

Preamble
/-
Adapted from https://github.com/snow-ghost/glushkov-lx-lean at 8cddcd222b591673dc63475d9d45b9ed5c6eb92c.
MIT License

Copyright (c) 2026 S. Uskov

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

-/
import Mathlib
import Definitions.Def_LX_AnchoredPhases
import Definitions.Def_LX_MinimumHeightRanks
import Definitions.Def_LX_ThresholdDropBudget
import Definitions.Def_LX_WordMetric

namespace Int
end Int
namespace LX
end LX
namespace LX.AffineScan
end LX.AffineScan
namespace LX.AnchoredPhases
end LX.AnchoredPhases
namespace LX.Core
end LX.Core
namespace LX.Core.AffineLift
end LX.Core.AffineLift
namespace LX.Core.BufferProgram
end LX.Core.BufferProgram
namespace LX.Core.FiniteCoordinates
end LX.Core.FiniteCoordinates
namespace LX.Core.FiniteCuts
end LX.Core.FiniteCuts
namespace LX.Core.FiniteGaps
end LX.Core.FiniteGaps
namespace LX.Core.FiniteWindow
end LX.Core.FiniteWindow
namespace LX.Core.LiftedModel
end LX.Core.LiftedModel
namespace LX.Core.PeriodicBuffer
end LX.Core.PeriodicBuffer
namespace LX.Core.PhysicalModel
end LX.Core.PhysicalModel
namespace LX.Core.PrunedLift
end LX.Core.PrunedLift
namespace LX.Core.RotationWords
end LX.Core.RotationWords
namespace LX.Core.ZeroGap
end LX.Core.ZeroGap
namespace LX.FiniteDropBudget
end LX.FiniteDropBudget
namespace LX.ForwardCarrier
end LX.ForwardCarrier
namespace LX.PairCore
end LX.PairCore
namespace List
end List

namespace LX.AnchoredPhases
end LX.AnchoredPhases
open LX
open LX.AnchoredPhases
open scoped BigOperators Fin.IntCast Fin.NatCast Fin.CommRing
open LX.AffineScan LX.Core.FiniteCuts
variable {n : ℕ} [NeZero n]

Formal statement
theorem LX.AnchoredPhases.odd_unpaid_head_predecessor_cut (p : State n) (a : Fin n)
    (hn : n=2*height p a+3) (hh : 2 ≤ height p a)
    (hmin : ∀ b,height p a ≤ height p b)
    (hR : ∀ t : Fin n,rankSurplus p a t.val ≤ 3)
    (hhead : height p 0=height p a)
    (hg1 : 0 < (-p 0).val) (hg2 : (-p 0).val ≤ height p a+3)
    (hunpaid : ¬ ∃ w : List Letter,p*eval w=1 ∧
      4*(w.length : ℤ) ≤ 3*(n : ℤ)^2-8*n+9) :
    height p a ≤ (p 0-1).val ∧ p 0 ≠ p 0-1 ∧
      thresholdHeight p (p 0-1)=height p a+1 ∧
      (∀ b,p b-b ≠ p 0-1) ∧
      (∀ b,height p b=height p a+1 → (p b-b).val < (p 0-1).val) := by sorry
Source
https://github.com/snow-ghost/glushkov-lx-lean/blob/8cddcd222b591673dc63475d9d45b9ed5c6eb92c/LX/OddHeadPredecessorCut.lean#L11-L118

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