Chemistry Crystal Symmetry Space Groups Exceed Point Groups

The counting theorem

In crystallography, the symmetry of a crystal is described in two layers. The point group lists the rotations, reflections, and inversions that leave a fixed point unmoved. The space group adds translations to that list, so it records every symmetry of the infinite repeating pattern. Classical 19th-century work, completed independently by Fedorov and Schönflies in 1891, showed that there are exactly 32 point groups and exactly 230 space groups.

The Recognition Science framework's machine-checked library of formal theorems contains a declaration named space_groups_exceed_point_groups. The theorem it proves is the numerical comparison 230 > 32. In plain language, the framework establishes that the number of space groups is strictly larger than the number of point groups. This is not a new physical discovery; it is a formal restatement of a classical count, checked by a computer from definitions the framework supplies.

The framework's library also defines the individual counts. It records totalPointGroups as 32, totalSpaceGroups as 230, totalBravaisLattices as 14, and numCrystalSystems as 7. It proves the rotation orders allowed in a periodic crystal are exactly 1, 2, 3, 4, and 6, and it proves that 5-fold and 7-fold rotations are not crystallographic. These counts match the standard results of the field.

In Recognition Science, the framework models the 8-tick structure as forcing three spatial dimensions, and it treats the crystallographic restriction as a consequence of filling space periodically. The declaration under discussion, however, does not derive the 230 number from first principles. It states the inequality between two already-defined constants. The theorem's proof is a direct computation, not a derivation of the space group classification itself.

The value of the declaration is precision. A reader who wants to know whether the framework's library correctly encodes the classical fact that space groups outnumber point groups can check this single theorem. The machine-checked proof confirms the inequality holds for the definitions as written. It does not claim to explain why the counts are what they are, nor does it claim to derive the classification of the 230 space groups from the framework's foundational principles.

/-- Space groups include point group operations plus translations (screws, glides). -/
theorem space_groups_exceed_point_groups : totalSpaceGroups > totalPointGroups := by
  native_decide

/-- Total number of crystallographic point groups. -/
def totalPointGroups : ℕ := 32

/-- Total number of crystallographic space groups. -/
def totalSpaceGroups : ℕ := 230

/-- Total number of Bravais lattices. -/
def totalBravaisLattices : ℕ := 14

/-- Number of crystal systems. -/
def numCrystalSystems : ℕ := 7

/-- There are exactly 5 allowed rotation orders. -/
theorem exactly_five_rotation_orders : allowedRotationOrders.length = 5 := by rfl

/-- 5-fold symmetry is NOT crystallographic. -/
theorem five_not_crystallographic : ¬isCrystallographic 5 := by
  simp only [isCrystallographic, allowedRotationOrders]
  decide

/-- 7-fold symmetry is NOT crystallographic. -/
theorem seven_not_crystallographic : ¬isCrystallographic 7 := by
  simp only [isCrystallographic, allowedRotationOrders]
  decide

What this page does not claim

The declaration does not derive the number 230 from the framework's foundational principles. The declaration does not prove the classification of the 230 space groups. The declaration does not explain why the crystallographic restriction holds physically.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Chemistry/CrystalSymmetry.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: