Exact resonance spectrum.
ProvedBerggrenSpectral.berg_two_pow_eq_one_iffaether-catalogcryptography
Exact resonance spectrum. Modulo an odd prime, a power of M₂ is trivial exactly
when the hyperbolic block is trivial and the exponent is even (the latter accounts for the
-1 eigenvalue).
theorem BerggrenSpectral.berg_two_pow_eq_one_iff(hp : p ≠ 2) (k : ℕ) :
(redMat p M₂) ^ k = 1 ↔ (bergU (ZMod p)) ^ k = 1 ∧ Even k := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Cryptography/BerggrenSpectral/SpectrumAndTrace.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Cryptography/BerggrenSpectral/SpectrumAndTrace.lean import Mathlib import Definitions.Def_Cryptography_BerggrenSpectral_Generators import Definitions.Def_Cryptography_BerggrenSpectral_HyperbolicResonance import Definitions.Def_Cryptography_BerggrenSpectral_SpectrumAndTrace import Definitions.Def_Cryptography_BerggrenSpectral_UnipotentResonance /-! # The Exact Resonance Spectrum and the Berggren–Lucas Trace Sequence Second research cycle. Where `HyperbolicResonance.lean` produced *sufficient* resonant frequencies, this file determines the resonance set **exactly**, decomposes it across the factors of a semiprime modulus, and extracts an arithmetic sequence — the *Berggren–Lucas trace sequence* — carrying a Fermat-type congruence. ## Main results * `berg_two_pow_eq_one_iff` : modulo an odd prime `p`, `M₂ ^ k ≡ 1 ⟺ U ^ k = 1 ∧ k even`, where `U = !![3,2;4,3]` is the hyperbolic block. This is an exact description of the resonance spectrum, not merely a divisibility bound. * `berg_two_orderOf` : `ord_p(M₂) = lcm (2, ord_p(U))`. * `berg_resonance_crt` : for coprime moduli the resonance sets intersect, `M₂ ^ k ≡ 1 (mod m n) ⟺ M₂ ^ k ≡ 1 (mod m) ∧ M₂ ^ k ≡ 1 (mod n)`. Factoring `N = p q` is therefore exactly the problem of *separating two resonant frequencies inside one modulus*, which is the conceptual content of `Factorization.lean`. * `berg_trace_rec`, `berg_trace_values` : the traces `t k = tr (M₂ ^ k)` satisfy the Newton recurrence `t (k+3) = 5 t (k+2) + 5 t (k+1) - t k` of the characteristic polynomial, with `t 0, t 1, t 2, t 3 = 3, 5, 35, 197`. * `berg_trace_fermat` : for every odd prime `p`, `t p ≡ 5 (mod p)` — a Fermat/Lucas-type congruence for the Berggren tree, proved from the matrix Frobenius, *not* from a hypothetical eigenvalue computation. * `berg_trace_composite_witness` : the contrapositive is a compositeness test; `berg_nine_composite_witness` runs it on `N = 9`. -/ open BerggrenSpectral open Matrix variable (p : ℕ) [Fact p.Prime] /-! ## The exact resonance spectrum modulo a prime -/
Formal statement
theorem BerggrenSpectral.berg_two_pow_eq_one_iff(hp : p ≠ 2) (k : ℕ) :
(redMat p M₂) ^ k = 1 ↔ (bergU (ZMod p)) ^ k = 1 ∧ Even k := by sorrySource