Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The regular coverings of the lattice corrections (Propositions 3.5 and 3.10)

Disproved
CTB.covering_double

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

characterscovering-groupslattices

The lattice corrections give regular coverings. For every n of at least four strings there is a pair of nested subgroups whose quotient is of order two, the smaller subgroup cut out by a character of the braid quotient on the larger one, surjective on the signs - the regular double covering of the G4 lattice correction; and a second pair of nested subgroups with the smaller subgroup cut out by three simultaneous characters, jointly surjective on the triples of signs - the regular eight-sheeted covering of the G6 lattice correction, with deck transformation group the order eight elementary two-group. These are Propositions 3.5 and 3.10 of the paper.

Preamble
import Mathlib
import Definitions.Def_CTB_alg
import Definitions.Def_CTB_tor
Formal statement
namespace CTB

/-!  Milestone 6 (Propositions 3.5 and 3.10): the regular coverings of
the lattice corrections. For every n of at least four strings there is a
pair of nested subgroups whose quotient is of order two, given by a
character of the braid quotient with the smaller subgroup as its kernel
on the larger one - the regular double covering of the G4 lattice
correction; and there is a second pair of nested subgroups with the
smaller subgroup cut out by three simultaneous characters, jointly
surjective on triples of signs - the regular eight-sheeted covering of
the G6 lattice correction, with deck transformation group the order
eight elementary two-group. -/
theorem covering_double {n : ℕ} {Q : Type*} [Group Q]
    (W : CrystallographicBraidWorld n Q) (hn : 4 ≤ n) :
    (∃ (T1 T2 : Subgroup Q) (chi : Q →* Multiplicative (ZMod 2)),
        T1 ≤ T2 ∧
        (∀ g ∈ T2, ∀ k ∈ T1, g * k * g⁻¹ ∈ T1) ∧
        (∀ x ∈ T2, chi x = 1 ↔ x ∈ T1) ∧
        (∀ y : Multiplicative (ZMod 2), ∃ x ∈ T2, chi x = y)) ∧
    (∃ (T3 T4 : Subgroup Q) (chis : Fin 3 → (Q →* Multiplicative (ZMod 2))),
        T3 ≤ T4 ∧
        (∀ g ∈ T4, ∀ k ∈ T3, g * k * g⁻¹ ∈ T3) ∧
        (∀ x ∈ T4, (∀ j, chis j x = 1) ↔ x ∈ T3) ∧
        (∀ ys : Fin 3 → Multiplicative (ZMod 2), ∃ x ∈ T4, ∀ j, chis j x = ys j)) := by sorry

end CTB
Source
O. Ocampo, Crystallographic quotients of Artin braid groups and torus bundles over flat 3-manifolds, arXiv:2610.20478 (2026), Section 3 (Propositions 3.5 and 3.10).
Read-back

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

Restate: in a crystallographic braid world with at least four strings, there exist two nested pairs of subgroups: for the first, a character of the braid quotient is trivial exactly on the smaller subgroup within the larger one, attains both sign values on the larger subgroup, and the smaller subgroup is normal in the larger one; for the second, three characters are simultaneously trivial exactly on the smaller subgroup within the larger one, jointly attain every triple of sign values on the larger subgroup, and the smaller subgroup is normal in the larger one. Hypotheses: the world is given; the number of strings is at least four; no further hypotheses appear.

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