Second excess in an unpaid odd minimum is bounded by three specific terminal exceptions
ProvedLX.AnchoredPhases.odd_unpaid_second_excess_head_boundSecond excess in an unpaid odd minimum is bounded by three specific terminal exceptions.
Let and write , represented by . The symbol takes a residue to its nonnegative representative and leaves ordinary integers unchanged. Residue sums and differences are cyclic; inequalities use representatives. is the permutation group. Function symbols are written in curried notation; a subscript means finite cardinality. An existential is a finite word in these generators. Natural subtraction is truncated at zero; scalar price expressions and quantities coerced by are read in the integers. The identity permutation is . counts its ordinary descending arrows. is second excess. means that some has a strictly smaller positive-gap phase of the same height . means and . means either , or with . Words use forward rotation and adjacent exchange ; is their ordered product. is the anchored permutation, with arithmetic in the residue circle. is the integer rank surplus. counts offsets below the natural threshold. is the relative cyclic offset.
The precise quantified assertion, with all its hypotheses, is
This result is used to constrain the remaining phases or to construct a sorting word with the stated cost.
/-
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_OddWideCutCount
import Definitions.Def_LX_SecondExcess
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 Classical
open scoped BigOperators Fin.IntCast Fin.NatCast Fin.CommRing
open LX.AffineScan LX.Core.FiniteCuts
variable {n : ℕ} [NeZero n]
theorem LX.AnchoredPhases.odd_unpaid_second_excess_head_bound (p : State n) (a : Fin n)
(hn : n=2*height p a+3) (hh : 2 ≤ height p a)
(hmin : ∀ c,height p a ≤ height p c)
(hunpaid : ¬ ∃ w : List Letter,p*eval w=1 ∧
4*(w.length : ℤ) ≤ 3*(n : ℤ)^2-8*n+9) :
secondExcess p a+2 ≤ ((if RelevantTerminalHead p (height p a) then 1 else 0 : ℕ) : ℤ)+
((if HeadPredecessorTerminal p (height p a) then 1 else 0 : ℕ) : ℤ)+
((if SmallerHigherAlignedTerminal p (height p a) then 1 else 0 : ℕ) : ℤ) := by sorry