Why the Fold construction gives generator three, three spatial dimensions and boundary rank two
Year: 2026
Type: preprint
Abstract: Read the full mathematical paper (PDF) Generator three, spatial dimension three and boundary rank two follow from three explicit, linked Fold constructions. Maria Smith derives the unit thirds and sevenths from complete binary support. Their exact first-return traces have lengths two and three. Positive-count succession proves three is the unique least distinct period after two and excludes every later count from minimality. Independently, the two fibre roles and their four ordered pair cells define the original open stability window. A complete positive-count census leaves only three directions, equal to the recurrence result. Holding one normal in any independent three-direction carrier retains exactly all other directions, uniquely giving rank two. The paper proves complete support, every orbit step, general first-return execution, universal leastness, exhaustive spatial enumeration, all-position normal removal and arbitrary-scale boundary product closure. Complete two-coordinate support gives r² cells, with exact rational growth q² for every admitted q above One. All 1,024 generator, 1,024 spatial and 2,048 boundary construction forms are classified, with one preserving tuple in each. Native Lean 4 proofs, empty-axiom audit logs, successful builds and full original program comparisons accompany the paper. No observed dimension, measured exponent or fitted coefficient enters the derivations. Scientific author: Maria Smith, Ernos Labs. V3 physics: 10.5281/zenodo.21761655. V3 monograph: 10.5281/zenodo.21900790. V4 edition 0.4: 10.5281/zenodo.24320778. Author contact and community Maria Smith, Ernos Labs. Email: [email protected]. Join the SFT Discord community: https://discord.gg/QCNkzq6kZC. Source and formal verification: SFT V4 Lean verified on GitHub.
Author: Smith, Maria
Language: English
Subfield: Statistical and Nonlinear Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Keywords: minimal period, recurrence, formal verification, Lean 4
Open Access status: green
OpenAlex ID: W7234969135
