Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Chirality of the cubic enantiomorphic space-group pair

Proved
LeanEval.Geometry.SpaceGroupsProblem.SpaceGroupCatalog.spaceGroupCatalog_chiral_cubic

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

crystallographydiscrete-geometrygroup-theory

Throughout, E=R3E=\mathbb R^3E=R3, G1,…,G230G_1,\dots,G_{230}G1​,…,G230​ are the groups of the explicit catalogue spaceGroupCatalog (the group GnG_nGn​ realises the space-group type with ITA number nnn, and the second member of each enantiomorphic pair is the image of the first under the point inversion x↦−xx\mapsto -xx↦−x; see the definition SpaceGroupCatalog), and G∼+G′G\sim_+G'G∼+​G′ means that some invertible affine map φ\varphiφ of EEE with det⁡φlin>0\det\varphi_{\mathrm{lin}}>0detφlin​>0 satisfies φGφ−1=G′\varphi G\varphi^{-1}=G'φGφ−1=G′ (AffOPEquivalent).

For the enantiomorphic pair (n,n′)=(212,213)(n,n')=(212,213)(n,n′)=(212,213) (P4332P4_{3}32P43​32 / P4132P4_{1}32P41​32),

Gn̸∼+Gn′.G_n\not\sim_+G_{n'}.Gn​∼+​Gn′​.

(In Lean the catalogue is indexed from 000, so GnG_nGn​ is spaceGroupCatalog (n-1).) These are the cubic cases of the statement that the eleven enantiomorphic pairs of space-group types are chiral, i.e. that the members of a pair are mirror images of each other but are not related by any orientation-preserving affine map.

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

theorem spaceGroupCatalog_chiral_cubic :
    ¬ AffOPEquivalent (spaceGroupCatalog 211) (spaceGroupCatalog 212) := by
  sorry

end SpaceGroupCatalog
end SpaceGroupsProblem
end Geometry
end LeanEval
Source
International Tables for Crystallography, Vol. A (T. Hahn, ed.), Section 1.4 and Table 1.4.1 (the 11 enantiomorphic pairs of space-group types); classification due to E. S. Fedorov (1891) and A. Schoenflies (1891).

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