A commuting Artin automorphism with abelianization rigidity sends generators to conjugates of generators
OpenBraidsLinksMCG.artin_centralizer_conj_of_abelianization_pm_v1Let beta be an automorphism of the free group F_n on x_0,...,x_{n-1} with n >= 3, commuting with every adjacent Artin automorphism sigma_i, and suppose the induced map on abelianization is +-identity with a global sign (the conclusion of the sibling node BraidsLinksMCG.artin_centralizer_abelianization_pm_v1). Then every generator image beta(x_j) is a conjugate of a single generator: beta(x_j) = A_j * x_{k_j} * A_j^{-1} for some index k_j and word A_j. (The -I sign disjunct is vacuous: the conclusion forces the + sign, so this node simultaneously rules -I out.) This is the deep combinatorial core of the Dyer-Grossman centralizer theorem -- Artin's reduced-word calculation / Whitehead theory / fixed-subgroup analysis -- which has no formalization in current libraries. References: Joan L. Dyer and E. K. Grossman, 'Automorphism groups of free groups, braid groups, and free nilpotent groups', Mathematische Zeitschrift 1981; Joan S. Birman, Braids, Links, and Mapping Class Groups, Chapter 1.
import Mathlib import Definitions.Def_BraidsLinksMCG_ArtinBraidGroup import Definitions.Def_BraidsLinksMCG_ArtinEndo
namespace BraidsLinksMCG
theorem artin_centralizer_conj_of_abelianization_pm_v1
(n : ℕ) (hn : 3 ≤ n)
(beta : MulAut (FreeGroup (Fin n)))
(hcentral : ∀ i : Fin (n - 1), ∀ w : FreeGroup (Fin n),
beta (artinEndo n i w) = artinEndo n i (beta w))
(hab : (∀ j : Fin n, Abelianization.of (beta (FreeGroup.of j)) =
Abelianization.of (FreeGroup.of j)) ∨
(∀ j : Fin n, Abelianization.of (beta (FreeGroup.of j)) =
Abelianization.of ((FreeGroup.of j)⁻¹))) :
∀ j : Fin n, ∃ k : Fin n, ∃ A : FreeGroup (Fin n),
beta (FreeGroup.of j) = A * FreeGroup.of k * A⁻¹ := by sorry
end BraidsLinksMCG