Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 1.8.4 (Chow): the centre of BnB_nBn​ is generated by (σ1⋯σn−1)n(\sigma_1\cdots\sigma_{n-1})^n(σ1​⋯σn−1​)n

Open
BraidsLinksMCG.cor_1_8_4_center_eq

by Gabewhigham · Sep 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-topologybraid-groupsgroup-theory

Corollary 1.8.4 (Chow). For n≥3n \ge 3n≥3 the centre of the braid group BnB_nBn​ is the cyclic subgroup generated by the full twist

Δ2  =  (σ1σ2⋯σn−1)n.\Delta^2 \;=\; (\sigma_1\sigma_2\cdots\sigma_{n-1})^n .Δ2=(σ1​σ2​⋯σn−1​)n.

That is, an element of BnB_nBn​ commutes with every braid if and only if it is an integral power of (σ1⋯σn−1)n(\sigma_1\cdots\sigma_{n-1})^n(σ1​⋯σn−1​)n. Geometrically the generator is the braid in which the whole bundle of nnn strands is given one full rotation.

This is the equality-of-subgroups half of Corollary 1.8.4; the complementary assertion, that the generator has infinite order, so that the centre is infinite cyclic, follows from the exponent-sum homomorphism.

The result is the reason the centre plays no role in the conjugacy and word problems for BnB_nBn​: quotienting by it loses only the number of full twists. The hypothesis n≥3n \ge 3n≥3 is necessary, since B2B_2B2​ is infinite cyclic and equal to its own centre, whereas (σ1)2(\sigma_1)^2(σ1​)2 generates a proper subgroup of it.

Formalization Note In the formal statement the generator is written as the nnn-th power of the ordered product of all the Artin generators, and the subgroup it generates is the set of its integer powers.

Preamble
import Definitions.Def_BraidsLinksMCG_ArtinBraidGroup
import Definitions.Def_BraidsLinksMCG_ArtinEndo
Formal statement
namespace BraidsLinksMCG

theorem cor_1_8_4_center_eq (n : ℕ) (hn : 3 ≤ n) :
    Subgroup.center (ArtinBraidGroup n) = Subgroup.zpowers (sigmaProd n ^ n) := by sorry

end BraidsLinksMCG
Source
Joan S. Birman, *Braids, Links, and Mapping Class Groups*, Annals of Mathematics Studies 82, Princeton University Press, 1974, Chapter 1, Corollary 1.8.4, p. 28 (due to W.-L. Chow, 1948)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me