IndisputableMonolith.NumberTheory.PhiLadderLattice
Module defines the golden ratio φ as the unique positive root of x² = x + 1 and constructs the associated phi-ladder lattice points. It is imported by the Recognition Theta module to supply the phi-ladder weight. Content consists of elementary definitions and positivity lemmas derived from the quadratic equation.
claimLet $\phi = \frac{1 + \sqrt{5}}{2}$ be the unique positive solution of $x^2 = x + 1$ (equivalently $x = 1 + 1/x$). The module introduces the lattice points generated on the phi-ladder from this fixed point.
background
The module sits in NumberTheory and imports the Cost module. It defines the golden ratio φ from its quadratic equation and records standard algebraic properties including positivity, φ > 1, and the inversion relation φ^{-1} = φ - 1. The phi-ladder lattice points are generated by successive multiplication by φ, providing the discrete rungs used for weight assignments.
The supplied doc-comment states that φ is the unique positive solution of x² = x + 1. These objects supply the self-similar fixed point required for the Recognition Composition Law and the T6 step of the forcing chain.
proof idea
this is a definition module, no proofs
why it matters in Recognition Science
The module feeds the Recognition Theta construction, which builds the candidate completion of the cost theta function that incorporates the 8-tick character (T7) and the phi-ladder weight (T6) to inherit a modular identity under t ↦ 1/t. It supplies the T6 phi fixed point required for the ladder structure in the Recognition framework.
scope and limits
- Does not derive any steps of the forcing chain T0-T8.
- Does not compute values for physical constants such as alpha or G.
- Does not state or apply the Recognition Composition Law.
- Does not contain mass formulas or Berry threshold results.
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