Artin full-twist conjugation and period 30 for equal-parity pairs in
ProvedSP4ArtinTwist.same_parity_S5_periodLet be the permutation group on five letters, with multiplication given by composition. On ordered pairs define the invertible Artin action and its full twist by
Let have the same permutation sign, and put . Then
Every nonnegative iterate of the actual full-twist action is simultaneous conjugation:
Moreover, the orbit has period dividing thirty for all integer times:
Negative iterates use the inverse of the explicitly defined Artin permutation. Thirty is a sufficient period, not a claim that each pair has least period thirty.
This theorem isolates the finite-group input to a proposed full-twist cover-count argument. It concerns only the displayed action on permutation pairs. Connecting these pairs to knot-group representations, proving a gluing bijection, and passing to connected unbased covers are separate tasks and are not conclusions of this theorem.
import Definitions.Def_SP4ArtinTwist import Mathlib.GroupTheory.Perm.Sign set_option autoImplicit false open SP4ArtinTwist
theorem SP4ArtinTwist.same_parity_S5_period (a b : Equiv.Perm (Fin 5))
(hparity : Equiv.Perm.sign a = Equiv.Perm.sign b) :
(a * b) ^ (30 : ℕ) = 1 ∧
(∀ m : ℕ, (fullTwist (Equiv.Perm (Fin 5)) ^ m) (a, b) =
((a * b)^m * a * ((a * b)^m)⁻¹, (a * b)^m * b * ((a * b)^m)⁻¹)) ∧
(∀ n : ℤ, (fullTwist (Equiv.Perm (Fin 5)) ^ (n + 30)) (a, b) =
(fullTwist (Equiv.Perm (Fin 5)) ^ n) (a, b)) := by sorry