The exponent-sum homomorphism
ProvedBraidsLinksMCG.braid_exponent_sum_homThe exponent sum of a braid word is an invariant of the braid.
Let be the abstract braid group with Artin generators and the defining relations
The assertion is that there is a group homomorphism
so that the number of positive crossings minus the number of negative crossings in a braid word depends only on the braid it represents. Both families of defining relations preserve the number of letters counted with sign, which is what makes the assignment well defined.
The homomorphism is the abelianization map of : since all generators are conjugate, any homomorphism to an abelian group factors through it. It is the standard device for showing that a given braid is non-trivial, or that an element has infinite order, and it is used in particular for the generator of the centre of .
Formalization Note Braid generators are indexed by with truncated subtraction, so there are no generators when . The target group is written multiplicatively, and is the element corresponding to the integer .
import Definitions.Def_BraidsLinksMCG_ArtinBraidGroup import Definitions.Def_BraidsLinksMCG_ArtinEndo
namespace BraidsLinksMCG
theorem braid_exponent_sum_hom (n : ℕ) :
∃ eps : ArtinBraidGroup n →* Multiplicative ℤ,
∀ i : Fin (n - 1), eps (sigma i) = Multiplicative.ofAdd (1 : ℤ) := by sorry
end BraidsLinksMCG