Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A complete irredundant list of the 230230230 space-group types

Open
LeanEval.Geometry.SpaceGroupsProblem.space_groups_OP_classification

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

discrete-geometrygroup-theory

Work in E=R3E=\mathbb R^3E=R3 with its Euclidean metric, and let Isom(E)\mathrm{Isom}(E)Isom(E) be the group of bijective affine isometries of EEE. Call a subgroup G≤Isom(E)G\le\mathrm{Isom}(E)G≤Isom(E) crystallographic if (i) for every x∈Ex\in Ex∈E and every ε>0\varepsilon>0ε>0 the set {g∈G:dist⁡(g(x),x)≤ε}\{g\in G:\operatorname{dist}(g(x),x)\le\varepsilon\}{g∈G:dist(g(x),x)≤ε} is finite, and (ii) there are three linearly independent vectors v1,v2,v3v_1,v_2,v_3v1​,v2​,v3​ such that translation by each viv_ivi​ belongs to GGG.

For subgroups G1,G2≤Isom(E)G_1,G_2\le\mathrm{Isom}(E)G1​,G2​≤Isom(E) write G1∼G2G_1\sim G_2G1​∼G2​ (affinely equivalent) if some invertible affine map φ\varphiφ of EEE satisfies φG1φ−1=G2\varphi G_1\varphi^{-1}=G_2φG1​φ−1=G2​ as sets of affine maps, and G1∼+G2G_1\sim_{+}G_2G1​∼+​G2​ (orientation-preserving affinely equivalent) if such a φ\varphiφ can be chosen with det⁡(φlin)>0\det(\varphi_{\mathrm{lin}})>0det(φlin​)>0.

This statement is the enumeration form of the classical count of 230230230 space-group types: there is a list

G1,…,G230G_1,\dots,G_{230}G1​,…,G230​

of crystallographic groups in R3\mathbb R^3R3 that is

  1. complete: every crystallographic group GGG satisfies Gi∼+GG_i\sim_{+}GGi​∼+​G for some index iii; and
  2. irredundant: Gi∼+GjG_i\sim_{+}G_jGi​∼+​Gj​ forces i=ji=ji=j.

Equivalently, the crystallographic groups of R3\mathbb R^3R3 fall into exactly 230230230 classes under orientation-preserving affine conjugacy, the classification of Fedorov and Schoenflies. Completeness is the substantive half — it asserts that no crystallographic group escapes the list — while irredundancy says the 230230230 listed groups are pairwise inequivalent, so that enantiomorphic (chiral) partners are counted separately.

Combined with the fact that ∼+\sim_{+}∼+​ is an equivalence relation, the two conditions give the cardinality of the set of ∼+\sim_{+}∼+​-classes, and hence the count 230230230.

Formalization Note. The list is given as a function fff from Fin 230; CrystallographicGroup 3 is the subtype of subgroups of the affine isometry group of EuclideanSpace ℝ (Fin 3) satisfying the two conditions above, and AffOPEquivalent is the orientation-preserving affine conjugacy relation, both taken verbatim from the LeanEval definition bundle.

Preamble
import Mathlib
import Definitions.Def_LeanEval_SpaceGroups_Definitions
Formal statement
namespace LeanEval
namespace Geometry
namespace SpaceGroupsProblem

theorem space_groups_OP_classification :
    ∃ f : Fin 230 → CrystallographicGroup 3,
      (∀ G : CrystallographicGroup 3, ∃ i : Fin 230, AffOPEquivalent (f i).1 G.1) ∧
        (∀ i j : Fin 230, AffOPEquivalent (f i).1 (f j).1 → i = j) := by
  sorry

end SpaceGroupsProblem
end Geometry
end LeanEval
Source
LeanEval v1, problem space_groups_230; LeanEval/Geometry/SpaceGroups.lean, LeanEval.Geometry.SpaceGroupsProblem.space_groups, repository commit 296b7491ec989d21bcf8636a9a69231a1e5d1d25: https://github.com/leanprover/lean-eval/blob/296b7491ec989d21bcf8636a9a69231a1e5d1d25/LeanEval/Geometry/SpaceGroups.lean . Classification due to E. S. Fedorov (1891) and A. Schoenflies (1891), independently; background: Oliver Knill, Some Fundamental Theorems in Mathematics, section 94 (Crystallography), printed p. 41, https://people.math.harvard.edu/~knill/graphgeometry/papers/fundamental.pdf .

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