Work

From operational occurrence to the unique least Fold generator

Year: 2026
Type: preprint
Abstract: Fold is the unique least generator among every finite word in the normalized parameter-free primitive grammar. Maria Smith derives the full chain from operational occurrence and structural One to exact finite count, positive part coordinates, common-refinement equivalence, the unique first Fold extension, complete finite word assembly, half-One and exact dynamics. Every image has exactly two Fold preimages; the one-third/two-thirds orbit gives nonstatic recurrence. Identity and square are injective; constant One has only static return. Fold alone generates at primitive size one, and every longer composition is nonminimal. The paper supplies all intermediate constructions, quantified carriers, base and successor proofs, complete grammar classifications and all-word uniqueness. The 84-word executed primitive prefix sits within the general theorem over arbitrary finite words. Eleven source entries contain 2,182 candidate records and 44 original controls, with 1,311 exported native declarations carrying empty-axiom audits. Includes full mathematical exposition, pinned original V3 source, native Lean proof bodies, source correspondence, retained build and comparison evidence, and portable exact reproduction. Scientific author: Maria Smith, Ernos Labs. V3 foundation: 10.5281/zenodo.21627656. V3 monograph: 10.5281/zenodo.21900790. V4: 10.5281/zenodo.24320778. Read the complete paper (PDF). 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
Open Access status: green
OpenAlex ID: W7235534612
Cites: 4
Cited by: 1
Related to: 10