IndisputableMonolith.CrossDomain.RecognitionGenerators
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
- Does not define the algebraic structure of the spectrum itself.
- Does not prove that no proper subset of {2, 3, 5} generates the spectrum.
- Does not connect the generators to explicit physical constants or observables.
declarations in this module (25)
-
def
G2 -
def
G3 -
def
G5 -
theorem
four_decomp -
theorem
six_decomp -
theorem
seven_decomp -
theorem
eight_decomp -
theorem
ten_decomp -
theorem
twelve_decomp -
theorem
fifteen_decomp -
theorem
sixteen_decomp -
theorem
twentyfive_decomp -
theorem
fortyfive_decomp -
theorem
seventy_decomp -
theorem
oneTwentyFive_decomp -
theorem
twoSixteen_decomp -
theorem
twoFiftySix_decomp -
theorem
threeSixty_decomp -
theorem
threeOneTwentyFive_decomp -
theorem
generators_minimal -
theorem
primorial_product -
theorem
second_primorial -
theorem
third_primorial -
structure
RecognitionGeneratorsCert -
def
recognitionGeneratorsCert