IndisputableMonolith.NumberTheory.PhiLadderLattice
The NumberTheory.PhiLadderLattice module introduces the golden ratio as the self-similar fixed point and defines associated lattice points for weighting in the Recognition Science framework. Researchers deriving mass formulas on the phi-ladder or completing the cost theta function would cite these definitions. The module consists of algebraic identities and positivity lemmas obtained by direct verification from the quadratic equation.
claimLet $φ = (1 + √5)/2$. Then $φ$ is the unique positive real satisfying $φ² = φ + 1$, and the phi-ladder lattice points are the discrete points generated by integer powers of $φ$ on the cost lattice.
background
The module defines the golden ratio $φ$ as the unique positive solution to $x² = x + 1$. It imports the Cost module, which supplies the J-cost function and Recognition Composition Law used to weight these lattice points. The phi-ladder lattice points furnish the discrete self-similar structure required by the T6 step of the unified forcing chain.
proof idea
This is a definition module, no proofs.
why it matters in Recognition Science
These definitions feed the RecognitionTheta module, which constructs the Recognition Theta function incorporating the phi-ladder weight (T6) and eight-tick character (T7) so as to inherit a modular identity under $t ↦ 1/t$. The downstream module states: 'The Recognition Theta function Θ̃_RS(t) is the candidate completion of the cost theta function Θ_J(t) = Σ e^{-t c(n)} that incorporates the 8-tick character (T7) and the phi-ladder weight (T6)'.
scope and limits
- Does not derive the full forcing chain from T0 to T8.
- Does not compute numerical values for constants such as α^{-1}.
- Does not establish modular identities for the theta function.
- Does not address the Berry creation threshold or Z_cf.
used by (1)
depends on (1)
declarations in this module (25)
-
def
phi -
theorem
phi_pos -
theorem
phi_ne_zero -
theorem
phi_gt_one -
theorem
phi_ne_one -
theorem
phi_sq_eq -
theorem
phi_mul_inv -
theorem
phi_inv_eq_phi_minus_one -
theorem
log_phi_pos -
theorem
log_phi_ne_zero -
theorem
log_phi_inv -
def
phiLatticePoint -
theorem
phiLatticePoint_zero -
theorem
phiLatticePoint_one -
theorem
phiLatticePoint_neg -
theorem
phiLatticePoint_succ -
def
phiLatticeReciprocal -
theorem
phiLatticeReciprocal_involutive -
theorem
phiLatticePoint_reciprocal -
def
costAtPhiPow -
theorem
cost_at_phi_pow_eq_neg -
theorem
cost_phi_ladder_reciprocal -
structure
that -
structure
PhiLadderPoissonSummation -
theorem
phi_ladder_certificate