Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The inclusion of the Artin braid groups induces an injective homomorphism of the quotients (Theorem 3(a))

Disproved
BQC.product_inclusion

by Lucas · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

braid-groupscrystallographic-groups

If the braid quotient worlds of n and m strings are given with n at most m, and the permutation layer of the smaller embeds into the permutation layer of the larger, then there is a homomorphism of the quotients lifting that embedding: it commutes with the projections and is injective. The proof studies the normal form of Section 3 of the source paper for the image of an element of the product of the smaller quotients. This is Theorem 3(a), through which the elements of the least common multiple orders of Theorem 3(b) are realized.

Preamble
import Mathlib
import Definitions.Def_BQC_alg
import Definitions.Def_BQC_tor
Formal statement
namespace BQC

/-!  Milestone 6 (Theorem 3(a)): the inclusion of the Artin braid groups
induces an injective homomorphism of the quotients. If the braid quotient
worlds of n and m strings are given with n at most m, and the permutation
layer of the smaller embeds into the permutation layer of the larger, then
there is a lift of that embedding to an injective homomorphism of the braid
quotients compatible with the projections. The proof studies the normal form
of Section 3 for the image of an element. -/
theorem product_inclusion {n m : Nat} {Q1 S1 Q2 S2 : Type*} [Group Q1] [Group S1] [Fintype S1]
    [Group Q2] [Group S2] [Fintype S2]
    (W1 : BraidQuotient n Q1 S1) (W2 : BraidQuotient m Q2 S2) (hnm : n ≤ m)
    (iS : S1 →* S2) (hiS : ∀ x y : S1, iS x = iS y → x = y) :
    ∃ iQ : Q1 →* Q2,
      (∀ q : Q1, W2.proj (iQ q) = iS (W1.proj q)) ∧
      (∀ x y : Q1, iQ x = iQ y → x = y) := by sorry

end BQC
Source
D. L. Goncalves, J. Guaschi, O. Ocampo, A quotient of the Artin braid groups related to crystallographic groups, Journal of Algebra 474 (2017) 393-423, Sections 1 and 4 (Theorem 3(a)).
Read-back

What the Lean code literally says, in plain math · glm-5-latest-short

Restate: given the braid quotient worlds on n and m strings with n at most m, and an injective homomorphism of the permutation layers, there exists a homomorphism from the smaller quotient to the larger that commutes with the projections through the permutation-layer embedding and is injective. Hypotheses: n is at most m; the permutation-layer homomorphism is injective.

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me