Status
Open — 1 scoped sorry in PrincipiaVol1.lean §9
What is proved
- The bound structure:
|Tr(M) − 1| < 1 implies Tr(M) ≠ 33
- The arithmetic:
exp(−12) < 1/32
- The bound on n:
n − 1 ≤ 32 for n < 33
What the sorry guards
The step from IsDm3Stable M (diagonal bound predicate) to the
sum bound |Tr(M) − 1| < 1 requires accessing individual eigenvalues
from the diagonal of a real matrix with bounded spectral radius.
This requires Mathlib.LinearAlgebra.Matrix.Spectrum applied to
diagonal entries — not yet in stable Mathlib4 in the form needed.
Closure path
Status
Open — 1 scoped sorry in
PrincipiaVol1.lean §9What is proved
|Tr(M) − 1| < 1impliesTr(M) ≠ 33exp(−12) < 1/32n − 1 ≤ 32forn < 33What the sorry guards
The step from
IsDm3Stable M(diagonal bound predicate) to thesum bound
|Tr(M) − 1| < 1requires accessing individual eigenvaluesfrom the diagonal of a real matrix with bounded spectral radius.
This requires
Mathlib.LinearAlgebra.Matrix.Spectrumapplied todiagonal entries — not yet in stable Mathlib4 in the form needed.
Closure path