Lucas–Fibonacci identities
Theorem.Lucas–Fibonacci identities — L_n = F_{n−1} + F_{n+1} and L_n² − 5F_n² = 4(−1)^n, exact in BigInt to n ≤ 80.
Proof.L_n = F_{n−1} + F_{n+1} and L_n² − 5F_n² = 4(−1)^n, exact in BigInt to n ≤ 80 — the Lucas companion sequence tied to Fibonacci.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/thunder/verify/index.ts#discoveredTheoremsWaveFortyOne
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"Lucas–Fibonacci identities" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation discoveredTheoremsWaveFortyOne.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (discoveredTheoremsWaveFortyOne @ src/thunder/verify) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes discoveredTheoremsWaveFortyOne (src/thunder/verify/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.