13 Computational certificates
On this page · Permalink · Source line 1892
The code uses exact integer, rational, symbolic, and modular arithmetic for all mathematical identities. Floating-point arithmetic is used only to render the figures and to report a regression estimate alongside an exact branching dimension.
| Certificate | Result |
|---|---|
| Residual packet count in the mod-three model | 3 |
| Compatible base-five inverse-limit branch | yes |
| First dyadic sign separation depth | 2 |
| Source strongly connected components | 3 |
| Brute-force minimum directed seed count | 3 |
| Cohomology packet reconstruction residual | 0 |
| Compatible common-spine test | passed |
| Inconsistent spine detected | yes |
| Recovered carrier multiplicities | \((2,0,1)\) |
| Finite occupancy ranks | \((3,2,1,0)\) |
The complete automated suite contains \(28\) tests. They cover residual partition, no crossing, inverse-limit digits, weighted and singular zeta coefficients, directed source components, cohomology packets, companion forests, common-spine consistency, finite Frobenius separation, multiplicity recovery, and exact occupancy projectors.