A prime `≡ 1 mod 4` is the hypotenuse of a node of the Berggren tree.
ProvedBerggrenZeta.exists_node_of_prime_one_mod_fouraether-catalognovelty
A prime ≡ 1 mod 4 is the hypotenuse of a node of the Berggren tree.
theorem BerggrenZeta.exists_node_of_prime_one_mod_four{p : ℕ} (hp : p.Prime) (h4 : p % 4 = 1) :
∃ w : List (Fin 3), hyp w = p := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Novelty/BerggrenTreePrimeHypotenuse.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Novelty/BerggrenTreePrimeHypotenuse.lean
import Mathlib
import Definitions.Def_Novelty_BerggrenTreeZetaAbscissa
import Definitions.Def_Novelty_BerggrenTreeZetaCore
/-!
# Prime hypotenuses in the Berggren tree
Which primes occur as hypotenuses of nodes of the Berggren tree? Since the nodes are
exactly the Euclid seeds (`seedEquiv`) and `c = m² + n²` with `m + n` odd and
`gcd (m,n) = 1`, the answer is governed by Fermat's two-square theorem:
* `hyp_mod_four` — **every** hypotenuse in the tree is `≡ 1 (mod 4)`;
* `prime_hyp_iff` — a prime is the hypotenuse of some node **iff** it is `≡ 1 (mod 4)`;
* `infinite_prime_hyp` — hence, by Dirichlet's theorem, infinitely many nodes of the tree
carry a prime hypotenuse;
* `summable_primeNode_zeta` — the prime-node Dirichlet series `∑_{c(w) prime} c(w)^{-s}`
converges for `s > 1`, and
* `primeNode_zeta_ge_primeSum` — it dominates the `χ₄`-restricted prime zeta function
`∑_{p ≡ 1 (4)} p^{-s}`.
Consequently the "prime number theorem for the Berggren tree" is *not* a new analytic
phenomenon: the prime-hypotenuse counting function of the tree is the counting function of
the primes in the arithmetic progression `1 mod 4`, so an error term of square-root quality
for it is precisely the classical Riemann Hypothesis for the Dirichlet `L`-function
`L(s, χ₄)`. The Berggren tree therefore transports, but does not simplify, the prime
distribution problem; what it *does* possess unconditionally is the silver critical line of
`Novelty.BerggrenTreeCriticalLine`.
-/
open BerggrenZetaFormal statement
theorem BerggrenZeta.exists_node_of_prime_one_mod_four{p : ℕ} (hp : p.Prime) (h4 : p % 4 = 1) :
∃ w : List (Fin 3), hyp w = p := by sorrySource