The Multiplicative Cross‑Closure Theorem
1. The Big Picture
Modulo 144, the Fibonacci sequence collapses to just four residues at indices coprime to 6:
The companion Lucas sequence gives eight:
The multiplicative cross‑closure theorem states that the inverse of every element of \(R_F\) (mod 144) lies inside \(R_L\). In fact:
That is, the inverse of a Fibonacci residue is always a Lucas residue. But more than that: this is not a coincidence — it is a manifestation of a hidden Klein four‑group that simultaneously controls the additive and multiplicative structure at modulus 144.
2. The Engine: The Klein Subgroup \(K\)
The magic lies in a tiny subgroup of the unit group modulo 144:
This set is the intersection of \(R_L\) with the 2‑torsion — all solutions to \(x^2 \equiv 1 \pmod{144}\). It is a Klein four‑group: every element is its own inverse, and the product of any two is the third.
The Lucas set \(R_L\) turns out to be a union of two cosets of \(K\):
with \(11K = \{11,29,115,133\}\). Hence \(R_L\) is \(K\)-stable: multiplication by any element of \(K\) permutes \(R_L\). This is the key that makes the cross‑closure work.
Now, because \(F_n L_n = F_{2n}\) (the classical Fibonacci–Lucas identity), and because \(F_{2n} \bmod 144\) always falls into \(K\) when \(\gcd(n,6)=1\), we get:
Since \(L_n \in R_L\) and \(F_{2n} \in K\), and \(R_L \cdot K = R_L\), the inverse lands in \(R_L\). The proof is that simple.
3. The Bridge: Addition is Multiplication by −1
The subgroup \(K\) is not only multiplicatively closed; it is also additively self‑complementary:
The coset \(11K\) sums to the same total. Because \(-1 \equiv 143 \in K\), the additive involution \(\sigma_+(r) = 144 – r\) is identical to multiplication by 143:
Therefore, any set that is \(K\)-stable is automatically closed under the additive reflection, and its sum is forced to be \((|S|/2)\cdot 144\). This explains why the Lucas sum is \(4\cdot 144 = 576\) without ever computing a single Lucas number — it is a consequence of the multiplicative structure.
| Coset | Elements | Pairs | Sum |
|---|---|---|---|
| \(K\) | \(\{1,55,89,143\}\) | \((1,143), (55,89)\) | \(2\cdot144\) |
| \(11K\) | \(\{11,29,115,133\}\) | \((11,133), (29,115)\) | \(2\cdot144\) |
4. Dihedral Unification: One Group, Two Reflections
The additive involution \(\sigma_+\) and the multiplicative involution \(\sigma_\times\) generate a dihedral group of order 4, the smallest possible. As Möbius transformations on the projective line:
Their product \(\sigma_+ \sigma_\times : x \mapsto -x^{-1}\) has order 2 and is fixed‑point‑free because \(-1\) is a non‑residue modulo 144. Hence the group is \(D_2 \cong \mathbb Z/2 \times \mathbb Z/2\), which is abstractly the same as \(K\).
5. The Prime Law: \(\{2,3,7\}\)
The mechanism at 144 is not an isolated freak. For a prime modulus \(p\), cross‑closure (Fibonacci residues invert into Lucas residues) holds if and only if \(p \in \{2,3,7\}\). Equivalently, the Pisano period \(\pi(p)\) must divide 48:
The prime 5 is excluded because \(\pi(5)=20\) introduces a factor of 5, breaking the 2‑3‑smoothness. Every modulus of the form \(2^a 3^b\) also works; the composite case is intricate and not a divisor rule (e.g., 112 fails while 56 works).
6. Honest Nulls: No Other Family Works
The Mersenne, Fermat, and Pell residue sets show no analogous multiplicative closure:
| Family | Residue set | Inverse set | In any signature set? |
|---|---|---|---|
| Mersenne | \(\{31,127\}\) | \(\{79,127\}\) | No |
| Fermat | \(\{17,113\}\) | \(\{17,65\}\) | No |
| Pell | \(\{1,25,29,53,73,97,101,125\}\) | \(\{1,5,49,53,73,77,121,125\}\) | No |
The structure is specific to the Fibonacci–Lucas pair, requiring both the product identity and \(K\)-stability.
7. Extensive Verification
The theorem has been verified for all 33,333 integers \(n < 100,000\) with \(\gcd(n,6)=1\). Among them, 23,743 are composite — demonstrating that the result is not a prime phenomenon. Zero violations. The probability that a random 4‑subset of the unit group inverts into a fixed 8‑set is about 0.036% (1 in 2,779).
8. Open Questions
- OP‑1: Characterize the complement \(R_L \setminus R_F^{-1} = \{11,55,115,143\}\).
- OP‑6: Give the exact composite modulus classification — it is not a divisor rule.
- OP‑5: Relate the Fibonacci matrix \(Q = \begin{pmatrix}1&1\\1&0\end{pmatrix}\) (order 24) to the dihedral group.
The full paper, with all proofs and the complete verification code, is available as The Multiplicative Cross‑Closure Theorem (Zenodo, 2026). This article summarises the main ideas and highlights the elegant group‑theoretic engine behind the theorem.
All residues, subgroups, group orders, and sums were computed with exact integer arithmetic; no floating‑point values appear in any identity.