pith. sign in
module module moderate

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. Researchers constructing the cross-domain spectrum in Recognition Science would cite it when identifying minimal prime generators. The module organizes definitions of the generators G2, G3, G5 together with decomposition functions for selected composite integers.

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

background

Recognition Science derives all physics from one functional equation, with the forcing chain T5-T8 yielding J-uniqueness, the self-similar fixed point phi, the eight-tick octave, and D = 3. The CrossDomain.RecognitionGenerators module sits inside this setting and introduces generators for the spectrum. Its module-level doc comment states that {2, 3, 5} is the smallest such set; the listed siblings supply the concrete generators G2, G3, G5 and the decomposition maps for 4, 6, 7, 8, 10, 12, 15, 16, 25.

proof idea

This is a definition module, no proofs.

why it matters in Recognition Science

The module supplies the minimal generators required to build the spectrum that enters the mass formula yardstick * phi^(rung - 8 + gap(Z)). It therefore supports every downstream construction that relies on the phi-ladder spectrum inside the Recognition framework.

scope and limits

declarations in this module (25)