Encyclopedia Chemistry Chemistry Crystal Growth From Phi Ladder Crystal Habit Count

ARTICLE 3 claims 2 theorems 1 model

Chemistry Crystal Growth From Phi Ladder Crystal Habit Count

A machine-checked proof counts five classical crystal habits, and a separate definition links their growth thresholds to the golden ratio.

The five habits

Crystallography recognizes a small set of common shapes that crystals take as they grow: cubic, tetragonal, hexagonal, orthorhombic, and trigonal. These five are the canonical crystal habits, the outward forms a mineral or salt adopts when its atoms stack in an orderly lattice. The Recognition Science framework's machine-checked library of formal theorems contains a declaration, crystalHabitCount, that proves the number of these five habits is exactly 5. The proof is a direct computation on the list of named habits; it does not depend on any physical measurement or on the framework's broader assumptions.

The same library file also defines a quantity called the undercooling threshold, the temperature drop below the freezing point that must be reached before a crystal habit can form. The definition sets this threshold for the k-th habit to phi raised to the power k, where phi is the golden ratio, approximately 1.618. A second theorem in the same file proves that the ratio of the threshold for habit k+1 to the threshold for habit k is exactly phi. In plain terms, the framework models the idea that each successive crystal habit needs about 1.618 times more undercooling than the previous one to appear.

In Recognition Science, the five habits correspond to a configuration dimension of 5, a number that the framework's forcing chain derives elsewhere. The crystallography file itself does not derive that dimension; it takes the five habits as an inductive definition and proves the count from that definition. The phi-ladder relation is a separate definitional choice, not a consequence of the count theorem. The file's docstring claims this matches an empirical Walton relation, but that comparison is not part of the machine-checked proof.

What the declaration does not claim is important. crystalHabitCount only establishes the count of five named habits; it says nothing about which real crystals exhibit those habits, how fast any real crystal grows, or whether the golden ratio actually governs undercooling in nature. The undercoolingRatio theorem proves a relation between the framework's own defined thresholds, not between measured physical quantities. The empirical match to the Walton relation is stated in the docstring as a prediction, not proved in the Lean code.

THEOREM crystalHabitCount · IndisputableMonolith/Chemistry/CrystalGrowthFromPhiLadder.lean
theorem crystalHabitCount : Fintype.card CrystalHabit = 5 := by decide
THEOREM undercoolingRatio · IndisputableMonolith/Chemistry/CrystalGrowthFromPhiLadder.lean
theorem undercoolingRatio (k : ℕ) :
    undercoolingThreshold (k + 1) / undercoolingThreshold k = phi := by
  unfold undercoolingThreshold
  have hpos : 0 < phi ^ k := pow_pos phi_pos _
  rw [pow_succ]
  field_simp [hpos.ne']
MODEL undercoolingThreshold · IndisputableMonolith/Chemistry/CrystalGrowthFromPhiLadder.lean
noncomputable def undercoolingThreshold (k : ℕ) : ℝ := phi ^ k

What this page does not claim

The count theorem does not predict which real crystals exhibit these habits. The phi-ratio theorem does not establish that physical undercooling thresholds follow the golden ratio. The empirical match to the Walton relation is a docstring prediction, not a machine-checked result.

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/CrystalGrowthFromPhiLadder.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:

MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND