Hurwitz-form length reduction for Artin's characterization
ProvedBraidsLinksMCG.artin_hurwitz_norm_reductionLet be the Artin action of on the free group , pinned on generators by artinEndo n i. Let be an endomorphism of which sends every generator to a conjugate of a generator, following some permutation ,
and which fixes the word . If is not already a permutation map , then some braid makes the composite strictly shorter:
the norm being the length of the reduced word.
This is the descent step in Artin's characterization of the braid automorphisms. Iterating it terminates, at which point is a permutation map; since both and fix , that permutation map fixes it too and is therefore the identity, so lies in the image of .
The composition order is the whole point. Write . The hypotheses say exactly that is an -tuple of conjugates of generators with . Because sends and , right-composition replaces that tuple by
which is the Hurwitz move of the braid group on such tuples; gives the inverse move . Only two entries change, so for the inequality collapses to a single local comparison,
and the task is to locate an adjacent pair where the conjugation cancels. The classical argument produces such a , so the statement is expected to hold with an elementary generator; it is stated for a general only because that is all the descent needs.
Left-composition, , is a different operation: it applies one automorphism to all words simultaneously and changes every entry of the tuple at once, so it offers no local handle of this kind. The two versions are equally true, since both follow once the characterization theorem is known, but only this one turns the descent into a finite cancellation question about a single adjacent pair.
The hypothesis that is not a permutation map is what rules out the fixed point of the descent: if all can be taken trivial the total length is already , its minimum, and no move decreases it.
import Mathlib import Definitions.Def_BraidsLinksMCG_ArtinBraidGroup import Definitions.Def_BraidsLinksMCG_ArtinEndo
namespace BraidsLinksMCG
theorem artin_hurwitz_norm_reduction (n : ℕ)
(xi : ArtinBraidGroup n →* MulAut (FreeGroup (Fin n)))
(hxi : ∀ i : Fin (n - 1), ∀ w : FreeGroup (Fin n), xi (sigma i) w = artinEndo n i w)
(beta : FreeGroup (Fin n) →* FreeGroup (Fin n))
(hconj : ∃ mu : Equiv.Perm (Fin n), ∃ A : Fin n → FreeGroup (Fin n),
∀ i : Fin n, beta (FreeGroup.of i) = A i * FreeGroup.of (mu i) * (A i)⁻¹)
(hword : beta (freeWordProd n) = freeWordProd n)
(hnotperm : ¬ ∃ nu : Equiv.Perm (Fin n),
∀ i : Fin n, beta (FreeGroup.of i) = FreeGroup.of (nu i)) :
∃ c : ArtinBraidGroup n,
(∑ i : Fin n, FreeGroup.norm (beta (xi c (FreeGroup.of i))))
< ∑ i : Fin n, FreeGroup.norm (beta (FreeGroup.of i)) := by sorry
end BraidsLinksMCG