A fixed-point-free noncrossing involution with a unique adjacent pair is full interval reversal
ProvedLX.Core.FiniteCuts.unique_adjacent_matching_reflectioncayley-graphscombinatoricsglushkov-lxgroup-theory
A fixed-point-free noncrossing involution with a unique adjacent pair is full interval reversal.
Let be a natural number and let ; this set may be empty. 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. excludes with and . 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_Graph
import Definitions.Def_LX_LinearMatchingGeometry
namespace LX.Core
end LX.Core
namespace LX.Core.FiniteCuts
end LX.Core.FiniteCuts
namespace LX.Core.FiniteCuts
end LX.Core.FiniteCuts
open LX
open LX.Core
open LX.Core.FiniteCuts
variable {n : ℕ}
Formal statement
theorem LX.Core.FiniteCuts.unique_adjacent_matching_reflection (p : State n) (hinv : Function.Involutive p)
(hnc : NoncrossingPairs p) (hfixed : ∀ i, p i ≠ i)
(hunique : ∀ a b : Fin n, a.val+1=(p a).val → b.val+1=(p b).val → a=b) :
∀ i : Fin n, p i=i.rev := by sorrySource