A non-permutation braid automorphism can be shortened
ProvedBraidsLinksMCG.artin_conjugator_norm_reductionThe single inductive step in Artin's characterisation theorem: if a braid automorphism is not already a permutation of the generators, some braid strictly shortens it.
Let be an endomorphism of sending each generator to a conjugate of a generator and fixing , and suppose is not of the form . Then there is a braid with
where is FreeGroup.norm, the length of the reduced word.
Everything else in the theorem is already discharged. The surrounding induction is proved: composing with a braid preserves both hypotheses, so the statement above can be applied repeatedly, and the process terminates because the measure is a natural number that strictly decreases. When it terminates, has become a permutation automorphism, which is the conclusion of BraidsLinksMCG.artin_conjugators_trivializable; that in turn yields BraidsLinksMCG.thm_1_9_sufficiency, where the permutation is forced to be the identity because a positive word is reduced.
So this is the only remaining content, and it is where the cancellation analysis lives.
The classical argument runs as follows. Write . The hypothesis that fixes says that
collapses to a reduced word of length . Since the displayed product has length before reduction, the cancellation is forced to be extensive, and it can only occur between the tail of one factor and the head of the next. Examining the possibilities at the first index where some is nontrivial produces an adjacent pair of strands whose half-twist, applied on the left, cancels a letter from the relevant conjugator; that is the required , taken to be for a suitable and sign.
A word on the choice of measure. The conjugators are not canonical --- each is determined only up to right multiplication by a power of --- so "total conjugator length" is not well defined without fixing representatives. The total reduced length of the images is canonical and decreases in step with it, which is why it is used here. Note also that the hypothesis is stated as "not a permutation automorphism" rather than as a numerical condition on the measure; this avoids having to argue separately that minimal measure forces the conjugators to vanish.
import Mathlib import Definitions.Def_BraidsLinksMCG_ArtinBraidGroup import Definitions.Def_BraidsLinksMCG_ArtinEndo
namespace BraidsLinksMCG
theorem artin_conjugator_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 (((xi c).toMonoidHom.comp beta) (FreeGroup.of i)))
< ∑ i : Fin n, FreeGroup.norm (beta (FreeGroup.of i)) := by sorry
end BraidsLinksMCG