Inherited majorized extreme coordinates make a shifted matching's adjacent pair unique in odd width
ProvedLX.Core.FiniteCuts.shifted_unique_adjacent_of_inherited_extremescayley-graphscombinatoricsglushkov-lxgroup-theory
Inherited majorized extreme coordinates make a shifted matching's adjacent pair unique in odd width.
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. means and for every residue . means for every subset . modulo . Involution means .
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.
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_AffineLift
import Definitions.Def_LX_Graph
import Definitions.Def_LX_StrictBandInversionCapacity
namespace Int
end Int
namespace LX
end LX
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.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 List
end List
namespace LX.Core.FiniteCuts
end LX.Core.FiniteCuts
open LX
open LX.Core
open LX.Core.FiniteCuts
open scoped BigOperators
variable {n : ℕ} [NeZero n]
Formal statement
theorem LX.Core.FiniteCuts.shifted_unique_adjacent_of_inherited_extremes {p : State n} {c : ℤ}
{original d : Fin n → ℤ} (hmaj : AffineLift.Majorized original)
(hd : AffineLift.IsLift p c d) (h : ℤ) (hn : (n : ℤ)=2*h+1)
(hband : ∀ i, 0 ≤ d i+h ∧ d i+h < (n : ℤ))
(hinherit : ∀ i, d i=h → original i=h)
(hinv : Function.Involutive (shiftedLiftPermutation p c h)) :
∀ a b : Fin n, a.val+1=(shiftedLiftPermutation p c h a).val →
b.val+1=(shiftedLiftPermutation p c h b).val → a=b := by sorrySource