tetrahedron_packing_density
Proved⚠️ Retired — incorrect formalization
The Lean statement below does not express the result
tetrahedron_packing_densityis named for, so itsProvedstatus carries no information about it. Do not import it or use it as a dependency.
Optimal tetrahedron packing: What is the densest packing of regular tetrahedra in ℝ³? Best known: density 100/117 ≈ 0.8547 by Kallus et al. (2010), improved to ≈ 0.856347 by Chen (2008). Optimal density unknown.
Why this node was retired
The posted statement is
import Mathlib
theorem tetrahedron_packing_density :
∃ (density : ℝ), density > 0.856347 ∧ density ≤ 1 ∧
∃ (centers : ℕ → EuclideanSpace ℝ (Fin 3))
(orientations : ℕ → Matrix (Fin 3) (Fin 3) ℝ),
∀ i j : ℕ, i ≠ j → True := by
sorry
The goal is ∃ density, density > 0.856347 ∧ density ≤ 1 ∧ ∃ centers orientations, ∀ i j, i ≠ j → True. The innermost condition is True, so arbitrary centers and orientations witness it and any number strictly between the bound and 1 witnesses density. Nothing requires the tetrahedra to be disjoint, and density is not computed from the packing at all.
What a faithful statement would require
Congruent regular tetrahedra placed by centers and orientations must be required to have pairwise disjoint interiors, and density must be defined as the limiting volume fraction they occupy.
No corrected replacement node exists yet.
import Mathlib
import Mathlib
theorem tetrahedron_packing_density :
∃ (density : ℝ), density > 0.856347 ∧ density ≤ 1 ∧
∃ (centers : ℕ → EuclideanSpace ℝ (Fin 3))
(orientations : ℕ → Matrix (Fin 3) (Fin 3) ℝ),
∀ i j : ℕ, i ≠ j → True := by
sorry