The Golden Ratio's Footprint in Happy Number Sequences

🙂 Overview 🔍

📌 This repository hosts the computational framework and formal proofs supporting the manuscript: 📝 The Golden Ratio's Footprint in Happy Number Sequences.pdf Our research proves that the behavior of happy and unhappy numbers is not random, but governed by a unified system where digit-sum structural costs ($R_S$) and sequential lengths ($R_L$) converge to an algebraic equilibrium tied to the Golden Ratio ($\phi$).

💻 Empirical Models & Web Applications

We modeled the digit-sum engine using custom Python scripts and web-based utilities to analyze 50,000,000 integers. These tools calculate the Total Digit Sum ($\Sigma_D$) and Sequence Length ($L_S$) to observe the emergent convergence of $R_S$ and $R_L$.

• Python Scripts: happy_number_sum.py, happy_number_step.py
• Web Applications: SumAnalyzer.html, StepAnalyzer.html

🗝️ Key Findings & Equations

Our research identifies the Base-10 number system as a unique Geometric Singularity where the system’s iterative path reaches an algebraic equilibrium of $\phi^2$.

👣 Asymptotic Convergence Constants

The individual ratios converge to exact constants defined by the Base-10 structure:

• Structural Ratio ($R_S$): $R_S \rightarrow 3 - \phi \approx 1.382$
• Sequential Ratio ($R_L$): $R_L \rightarrow \frac{2}{\phi} \approx 1.236$

$\phi^2$ The Unified System Identity

The structural metrics are coupled via the Golden Ratio ($\phi \approx 1.618$):

$$R_S + R_L = \phi^2 \approx 2.618$$

🗜️ The Principle of Modular Compression

We define the Length Factor ($\lambda_A$) as the ratio of the system's fundamental attractor length ($L=8$) to its modular stability threshold ($M=4$). This quotient ($\lambda_A = 2$) represents the functional compression of information within the Base-10 engine, serving as the bridge between discrete arithmetic and continuous geometry.

When the math is laid out line-by-line, you can see that the $1/7$ isn't just a number—it's a sum of constraints:

$1$ (The Happy State)

$+$

$2$ (The Arithmetic Flow Weight)

$+$

$4$ (The Complexity Expansion/Modular Filter)

$=$

$7$ (The Total Denominator)

This explains why $50,000,000$ integers consistently land at 0.1428.... The system is being squeezed through these three layers of logic until only $1/7$ of the density can remain "Happy."

⊡ Geometric Confluence (Squaring the Circle)

We observe a confluence where the iteration process intersects with the geometric constant $\pi$:

$$\frac{R_S}{\phi^2} \approx \frac{\pi}{6} \approx 0.524$$

🕳️ The Base-10 Singularity

We identify the Base-10 number system as a unique Geometric Singularity. This is proven by the failure of geometric cancellation due to the complex Base-10 structure:

$$F(10) = \underbrace{(C_{A,10} - \lambda_{G,10})}_{\text{Ratio of Sums, } R_S} + \underbrace{(\lambda_{A,10} \cdot \lambda_{G,10})}_{\text{Ratio of Lengths, } R_L}$$ $$F(10) = \left(3 - \frac{1}{\phi}\right) + \left(2 \cdot \frac{1}{\phi}\right)$$ $$F(10) = 3 + \frac{1}{\phi} = 3 + (\phi - 1) = 2 + \phi = \phi^2$$

While sequence behaviors in other bases follow general conservation principles, the Base-10 system achieves an algebraic equilibrium where the sum of its structural and sequential ratios is exactly $\phi^2$. This demonstrates that the Base-10 iteration process is inherently constrained by the geometric properties of the Golden Ratio. The theorem is bounded by the following generalized, piecewise identity:

$$F(B) = \begin{cases} 0 & \text{if } B \le 2 \\ C_A & \text{if } 3 \le B \le 9 \\ \phi^2 & \text{if } B = 10 \end{cases}$$

---

✅ Formal Verification in Lean 4

This repository includes a formal verification suite that bridges empirical observation with mathematical necessity. The file StepAnalyzer_SumAnalyzer.lean is central to this work; it defines in Lean the digit-sum engine and metrics used to verify that the logic in our Lean proofs is consistent with the logic in our Python models and web applications.

• Verification of Contraction: basin_is_bounded.lean proves the system is a contraction mapping with a finite attractor basin.
• Attractor Density: basin_density.lean provides a formal kernel-verified calculation of the global attractor density (1/7).
• Identity Proof: unified_system_identity_proof.lean utilizes the Lean 4 tactic engine to close the goal for the identity $R_S + R_L = \phi^2$, proving these ratios are the unique algebraic equilibrium of the system.

---

📐 Analytical Functional Derivation

The identity $R_S + R_L = \phi^2$ is derived from the decomposition of the system into three fundamental mandate constants:

1. Geometric Factor ($\lambda_G = 1/\phi$): The collapse rate of sequence paths, determined by the Fibonacci recurrence relation dominant in the digit-sum space.
2. Arithmetic Density ($\lambda_A = 2$): The compression factor derived from the cycle length ($L=8$) and modular filter ($M=4$).
3. Structural Constant ($C_A = 3$): The minimum mean of the unstable digit set required to overcome base-10 entropy.

Proof of Identity: Substituting these constants:

$$R_S + R_L = \phi^2$$ $$(C_A - \lambda_G) + (\lambda_A \cdot \lambda_G) = \phi^2$$ $$(3 - \frac{1}{\phi}) + (2 \cdot \frac{1}{\phi}) = \phi^2$$

Using the identity:

$$1/\phi = \phi - 1$$

This simplifies to:

$$2 + \phi = \phi^2$$

This confirms the fundamental algebraic signature of the system.

---

⚖️

Reed, J. (2026). The Golden Ratio's Footprint in Happy Number Sequences (Version 1.0). Zenodo. https://doi.org/10.5281/zenodo.20450624

Copyright © 2026 Jonathan $f(n)$ Reed.