Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Aether Catalog definitions — Novelty_BerggrenTreeCriticalLine

Definition
Novelty_BerggrenTreeCriticalLine

by raver1975 · Sep 14, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalognovelty

Definition bundle for the Aether Catalog module Novelty.BerggrenTreeCriticalLine, transplanted by skeleton subtraction; supplies the types and constants the catalog's theorems import.

Definition code
-- Def bundle generated from Novelty/BerggrenTreeCriticalLine.lean by skeleton subtraction
import Mathlib
import Definitions.Def_Novelty_BerggrenTreeSilverGrowth

/-!
# A provable critical line: the silver Ihara zeta of the Berggren tree

The Berggren tree is a regular ternary tree whose extremal (Pell) branch grows at the rate
`ε² = 3 + 2√2`, where `ε = 1 + √2` is the fundamental unit of `ℤ[√2]` and the eigenvalue of
the hyperbolic Berggren generator (`Novelty.BerggrenTreeSilverGrowth`).  Weighting each of
the `3^k` nodes at depth `k` by the *silver length* `ε^{2k}` instead of by its actual
hypotenuse gives the **silver Ihara-type zeta function** of the tree,

`Z_ε(s) = ∑_{k ≥ 0} 3^k ε^{-2ks} = (1 - 3 ε^{-2s})⁻¹`.

Unlike the true tree zeta (whose abscissa is `1`, see `Novelty.BerggrenTreeZetaAbscissa`),
this object is *exactly solvable*: it is a rational function of `ε^{-2s}`, hence
meromorphic on all of `ℂ`, and its poles can be computed in closed form.  The result is a
rigorous analogue of the Riemann Hypothesis for the Berggren tree:

> **All poles of `Z_ε` lie on the single vertical line `Re s = σ₀`, where
> `σ₀ = log 3 / (2 log(1+√2))`, and on that line they form the arithmetic progression
> `s = σ₀ + i k π / log(1+√2)`, `k ∈ ℤ`.**

The "critical line" is therefore determined by exactly two pieces of tree geometry: the
branching number `3` and the silver growth exponent `2 log ε`; the spacing of the poles is
the reciprocal silver length `π / log ε`, the analogue of the Ihara/Selberg spectral gap.

## Main results

* `silverZeta_eq_tsum` — the Dirichlet series `∑ 3^k ε^{-2ks}` converges exactly on the
  half-plane `Re s > σ₀` and sums to `Z_ε`;
* `silver_denom_eq_zero_iff` — **the critical line theorem**: the pole set of `Z_ε` is
  `{s : Re s = σ₀, Im s ∈ (π / log ε) ℤ}`;
* `silverZeta_analyticAt` and `silverZeta_meromorphicOn` — meromorphic continuation to `ℂ`;
* `silverAbscissa_lt_one` — the silver critical abscissa is strictly smaller than the true
  abscissa `1` of the tree zeta function: the silver model *underestimates* the density of
  small hypotenuses, which is the precise reason the moonshot conjecture fails.
-/

namespace BerggrenZeta

open Real Complex

/-- The silver ratio `ε = 1 + √2`, the fundamental unit of `ℤ[√2]`; its square
`ε² = 3 + 2√2` is the eigenvalue of the hyperbolic Berggren generator. -/
noncomputable def silverUnit : ℝ := 1 + Real.sqrt 2

/-- The silver critical abscissa `σ₀ = log 3 / (2 log ε)`: branching entropy divided by the
silver growth exponent. -/
noncomputable def silverAbscissa : ℝ := Real.log 3 / (2 * Real.log silverUnit)

/-- The silver Ihara-type zeta function of the Berggren tree. -/
noncomputable def silverZeta (s : ℂ) : ℂ := (1 - 3 * (silverUnit : ℂ) ^ (-2 * s))⁻¹





/-! ## Part A. The half-plane of convergence -/




/-! ## Part B. The critical line -/





/-! ## Part C. Meromorphic continuation -/




/-! ## Part D. The silver abscissa is strictly below the true abscissa -/



end BerggrenZeta

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me