A permutation whose nontrivial cycles are transpositions is an involution
ProvedLX.Core.FiniteCuts.involutive_of_cycles_are_swapscayley-graphscombinatoricsglushkov-lxgroup-theory
Let be any natural number and let be a permutation of . Suppose every nontrivial factor in the disjoint cycle decomposition of is a transposition. Then is an involution:
Fixed points are permitted, and the assertion also covers the empty permutation. This connects the cycle-factor description of a permutation with the pointwise involution property needed in matching geometry.
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
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.involutive_of_cycles_are_swaps (p : State n)
(hp : ∀ q ∈ p.cycleFactorsFinset, q.IsSwap) : Function.Involutive p := by sorrySource