A braid automorphism can be normalised to a permutation
ProvedBraidsLinksMCG.artin_conjugators_trivializableThe combinatorial heart of Artin's characterisation theorem: a braid automorphism of the free group can be normalised, by composing with a braid, so that its conjugators disappear.
Precisely, let be an endomorphism of sending each generator to a conjugate of a generator,
and fixing the word . The claim is that there is a braid such that the composite sends every generator to a bare generator: for some permutation , with no conjugator left.
This isolates the only hard step in Teorema 1.9. Once the conjugators are gone the rest is immediate and is already carried out in the parent submission: the normalised map still fixes , because braids fix that word and was assumed to; evaluating the fixing on the explicit product shows ; since both sides are positive words they are reduced, so the letters match and is the identity; hence is the identity on generators and therefore everywhere, giving .
The classical argument for the normalisation is an induction on the total reduced length of the images . The hypothesis that fixes is what drives it: the product
has to collapse to a reduced word of length , which forces heavy cancellation between consecutive factors . Analysing where that cancellation can occur produces an adjacent pair on which some can be applied to shorten the total length, and the induction closes when every conjugator is trivial.
Note the statement deliberately avoids naming a length measure. The conjugators are not canonical --- each is determined only up to right multiplication by a power of --- so a formulation quantifying over "the" total conjugator length would have to fix representatives first. Asking instead for the existence of a normalising braid says the same thing without that bookkeeping, and is what the surrounding proof actually consumes.
No claim is made that is unique, and none is needed.
import Mathlib import Definitions.Def_BraidsLinksMCG_ArtinBraidGroup import Definitions.Def_BraidsLinksMCG_ArtinEndo
namespace BraidsLinksMCG
theorem artin_conjugators_trivializable (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) :
∃ b : ArtinBraidGroup n, ∃ nu : Equiv.Perm (Fin n),
∀ i : Fin n, xi b (beta (FreeGroup.of i)) = FreeGroup.of (nu i) := by sorry
end BraidsLinksMCG