pith. machine review for the scientific record. sign in
module module high

IndisputableMonolith.CrossDomain.RecognitionGenerators

show as:
view Lean formalization →

The RecognitionGenerators module establishes that the set {2, 3, 5} is the smallest generating set for the spectrum. It supplies definitions for generators G2, G3, G5 together with decomposition lemmas for the listed composites. Researchers working on spectral structure in the phi-ladder would cite this module. The module is definitional with supporting lemmas.

claimThe set $S = {2, 3, 5}$ is the smallest generating set for the spectrum.

background

The CrossDomain.RecognitionGenerators module sits inside the Recognition Science framework and treats the spectrum as the collection of values generated under the Recognition Composition Law. It introduces generators G2, G3, G5 for the primes 2, 3, 5 and supplies decomposition maps for the integers 4, 6, 7, 8, 10, 12, 15, 16, 25. These objects support constructions that appear in the forcing chain from T0 to T8 and in the phi-ladder mass formula.

proof idea

This is a definition module, no proofs.

why it matters in Recognition Science

The module supplies the minimal generating set {2, 3, 5} that feeds all subsequent cross-domain recognition constructions. It directly implements the claim that this set is smallest, thereby grounding spectral decompositions used for the eight-tick octave and the derivation of constants such as hbar = phi^{-5}.

scope and limits

declarations in this module (25)