in the generators of its amalgam decomposition:
ProvedBurauFaithful.braid_three_amalgam_dictionaryThe braid group in the generators of its amalgam decomposition with , .
Writing
the two Artin generators are recovered by pure group algebra,
while the defining relation of the amalgam is the braid identity
which is , the full twist, and is proved here by a single use of .
Together with (the Garside identity BurauFaithful.braid_three_garside_pow) and the centrality of (BurauFaithful.braid_three_fullTwist_central) this exhibits the quotient as the amalgam generated by the images of and ; the faithfulness theorem for three strands is then exactly the statement that this amalgam embeds into (Coxeter-Moser; Birman, Braids, Links, and Mapping Class Groups, Ann. of Math. Studies 82, §3.3, pp. 129-130).
Formalization Note The elements and are introduced as BurauFaithful.sLift and BurauFaithful.uLift in the preamble; the braid relation is extracted from the relator of the presented group, and the four identities are then formal group algebra together with one rewrite by that relation.
/-
`BurauFaithful.braid_three_amalgam_dictionary`: `B₃` in the generators of the amalgam
`B₃ = ⟨x⟩ *_{⟨x²⟩} ⟨y⟩` with `x = σ₀σ₁σ₀`, `y = σ₀σ₁`.
The two elements used by the amalgam decomposition of `B₃/⟨Δ⁴⟩` are
```
uLift := σ₀ · σ₁ -- image of U = S·T in SL(2,ℤ)
sLift := σ₀² · σ₁ = σ₀ · uLift -- image of S in SL(2,ℤ)
```
which formally satisfy `σ₀ = sLift · uLift⁻¹` and `σ₁ = uLift · sLift⁻¹ · uLift` (pure group
algebra, no braid relation), while the defining relation of the amalgam is the braid identity
```
sLift² = (σ₀²σ₁)² = (σ₀σ₁)³ = uLift³ (= Δ², the full twist),
```
verified by a single use of `σ₀σ₁σ₀ = σ₁σ₀σ₁`. In `B₃/⟨Δ⁴⟩` one also has `sLift⁴ = uLift⁶ = 1`
(Proved separately as the Garside identity and centrality of the full twist); hence `B₃/⟨Δ⁴⟩` is
the amalgam `ℤ/4 *_{ℤ/2} ℤ/6`, and `spec_reduced_kernel_le` is the statement that this amalgam
maps injectively into `SL(2,ℤ)` (Coxeter–Moser; Birman, *Braids, Links, and Mapping Class Groups*,
Ann. of Math. Studies 82, §3.3, pp. 129-130).
-/
import Definitions.Def_BurauFaithful_UnreducedBurau
set_option autoImplicit false
namespace BurauFaithful
/-- `σ₀²σ₁`, the braid mapping to the order-`4` element `S = !![0,-1;1,0]`. -/
noncomputable def sLift : PresentedGroup (BraidsLinksMCG.braidRels 3) :=
PresentedGroup.of (rels := BraidsLinksMCG.braidRels 3) (0 : Fin 2) ^ 2 *
PresentedGroup.of (rels := BraidsLinksMCG.braidRels 3) 1
/-- `σ₀σ₁`, the braid mapping to the order-`6` element `U = S·T = !![0,-1;1,1]`. -/
noncomputable def uLift : PresentedGroup (BraidsLinksMCG.braidRels 3) :=
PresentedGroup.of (rels := BraidsLinksMCG.braidRels 3) (0 : Fin 2) *
PresentedGroup.of (rels := BraidsLinksMCG.braidRels 3) 1
end BurauFaithful
theorem BurauFaithful.braid_three_amalgam_dictionary :
((PresentedGroup.of (rels := BraidsLinksMCG.braidRels 3) (0 : Fin 2) =
BurauFaithful.sLift * BurauFaithful.uLift⁻¹) ∧
(PresentedGroup.of (rels := BraidsLinksMCG.braidRels 3) (1 : Fin 2) =
BurauFaithful.uLift * BurauFaithful.sLift⁻¹ * BurauFaithful.uLift) ∧
(BurauFaithful.sLift ^ 2 = BurauFaithful.uLift ^ 3) ∧
(BurauFaithful.sLift =
PresentedGroup.of (rels := BraidsLinksMCG.braidRels 3) (0 : Fin 2) *
BurauFaithful.uLift)) := by sorry