Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Artin full-twist conjugation and period 30 for equal-parity pairs in S5S_5S5​

Proved
SP4ArtinTwist.same_parity_S5_period

by ryanshin · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

braid-groupsfinite-groupsgroup-theorypermutationssp4-backlog-formalization

Let S5S_5S5​ 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

A(a,b)=(aba−1,a),T=A2.A(a,b)=(aba^{-1},a),\qquad T=A^2.A(a,b)=(aba−1,a),T=A2.

Let a,b∈S5a,b\in S_5a,b∈S5​ have the same permutation sign, and put g=abg=abg=ab. Then

g30=1.g^{30}=1.g30=1.

Every nonnegative iterate of the actual full-twist action is simultaneous conjugation:

Tm(a,b)=(gmag−m,  gmbg−m)(m∈N).T^m(a,b)=\bigl(g^mag^{-m},\;g^mbg^{-m}\bigr) \qquad(m\in\mathbb N).Tm(a,b)=(gmag−m,gmbg−m)(m∈N).

Moreover, the orbit has period dividing thirty for all integer times:

Tn+30(a,b)=Tn(a,b)(n∈Z).T^{n+30}(a,b)=T^n(a,b) \qquad(n\in\mathbb Z).Tn+30(a,b)=Tn(a,b)(n∈Z).

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.

Preamble
import Definitions.Def_SP4ArtinTwist
import Mathlib.GroupTheory.Perm.Sign

set_option autoImplicit false

open SP4ArtinTwist
Formal statement
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
Source
Local research note, Cycle 9, Finite-cover counts in a fixed full-twist family, Proof: the displayed Artin generator, its square, and the paragraph deriving (ab)^30=1 for same-parity S5 images. Independent critical audit, Sections 1 and 3. Only these local group-algebra assertions are formalized; representation gluing and cover-count periodicity are excluded. Source note cycle9_twist_cover_periodicity.md, SHA-256 c4b995489cb5910bd0a9371cf5e6e272c56672116851a613c46eab69a5d82408.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me