Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lower bound on the population of one ray.

Proved
BerggrenHypercycleStars.card_rayNodes_ge

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

aether-catalogcryptography

Lower bound on the population of one ray. The ray of index n carries at least (cosh R - (n+1)) / (2n) nodes inside the ball of radius R: the linear density along the n-th ray decays like 1/(2n).

theorem BerggrenHypercycleStars.card_rayNodes_ge(n : ℕ) (hn : 0 < n) (R : ℝ) (hR : 0 ≤ R)
    (hcosh : (n : ℝ) + 1 ≤ Real.cosh R) :
    (Real.cosh R - ((n : ℝ) + 1)) / (2 * n) ≤ (rayNodes n R).card := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Cryptography/BerggrenStars/RayDensity.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Cryptography/BerggrenStars/RayDensity.lean
import Mathlib
import Definitions.Def_Cryptography_BerggrenStars_HypercycleStars
import Definitions.Def_Cryptography_BerggrenStars_RayDensity

/-!
# How densely a single ray of the star is populated

`Cryptography.BerggrenStars.HypercycleStars` shows that the nodes with a fixed second Euclid
coordinate `n` all lie on one hypercycle (a Euclidean ray out of the boundary point `0`), and
that the hyperbolic steps along that ray tend to `0`. Here we count how many nodes of the ray
of index `n` lie inside the hyperbolic ball of radius `R` about `i`.

## Main results

* `dist_le_of_cast_le_cosh` : a very convenient membership test — *any* Euclid seed with
  `m ≤ cosh R` lies in the ball of radius `R`.
* `mem_rayNodes_iff` : the nodes of the ray of index `n` inside `B(R)` are exactly the seeds
  `(m, n)` with `m ≤ 2 cosh R` and `d ≤ R`; in particular there are finitely many.
* `card_rayNodes_le` : at most `2 cosh R` of them.
* `card_rayNodes_ge` : at least `(cosh R - (n+1))/(2n)` of them, obtained from the `B₃`-orbit of
  the left-spine seed `(n+1, n)`. So the linear density of nodes along the `n`-th ray decays
  like `1/(2n)`, while the total over all rays stays `Θ(e^{2R})`.
-/

open BerggrenHypercycleStars

open Real UpperHalfPlane
Formal statement
theorem BerggrenHypercycleStars.card_rayNodes_ge(n : ℕ) (hn : 0 < n) (R : ℝ) (hR : 0 ≤ R)
    (hcosh : (n : ℝ) + 1 ≤ Real.cosh R) :
    (Real.cosh R - ((n : ℝ) + 1)) / (2 * n) ≤ (rayNodes n R).card := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Cryptography/BerggrenStars/RayDensity.lean#L99

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