PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
June 1, 20260 citationsOpen Access

Transient Chaos and Topological Bounds in Prime Dynamics: Revisiting the One-Dimensional Sieve Mapping

View Full Paper
LWliang wang

Key Points

  • This work investigates the distribution of primes through topological methods and kneading sequences.
  • Models prime distribution with a symbolic dynamics approach using a unimodal map.
  • Evaluates admissibility of finite sieve sequences and establishes the Parity-Gap Lemma.
  • Applies computational checks on prime gaps and topological bounds, supported by ergodic theory.
  • Admissibility breaks down for $Q_3$ at $n=31$ and $Q_5$ at prime gap $113$--$127$.
  • Concludes traditional prime gap bounds are insufficient to guarantee admissibility under current hypotheses.
  • Establishes that a sub-root bound ensures eventual admissibility for all $k$ above a certain threshold, numerically verified for $k = 6$ and $k \leq 5000.

Abstract

A recent line of work models the prime distribution as the symbolic dynamics of a one-dimensional unimodal map at the band-merging point, recovering the twin-prime constant C₂ from a Metropolis--Stein--Stein (MSS) kneading sequence. The construction depends on Hypothesis~3. 3 (Topological Admissibility), which asserts that every finite sieve sequence Qₖ is an admissible kneading sequence inside its physical horizon N < p₊+₁². We show by explicit MSS comparison that Q₃ already fails admissibility at n = 31 and Q₅ fails at the prime gap 113--127, and that no bound on prime gaps of any strength can patch the proof: the breakdown is driven by parity inversion, not by gap size. We then prove a sharper structural result, the Parity-Gap Lemma, which reduces topological admissibility of Wₖ = Qₖ[0, p₊+₁²) to an extremal prime-gap inequality G (p₊+₁²) < p₊+₁ - 1. We note that classical bounds such as Legendre's, Andrica's, and even the Riemann Hypothesis yield maximal gaps at x = p² that asymptotically exceed the topological shield p - 1, and are therefore mathematically insufficient to guarantee admissibility. Only a strongly sub-root bound, such as Cram\'er's probabilistic conjecture G (x) = O (² x), forces eventual admissibility for all k above a finite threshold k₀ (numerically verified as k₀ = 6 for k 5000). Independently of the lemma, we restore the ergodic foundation via asymptotic admissibility: the topological-defect density (N) vanishes as N. A four-state parity-split chain then forces an asymptotic geometric decay ₂₌+₂/₂₌ p_ 0. 596 of the even-gap measure, ruling out internal mod-3 resonance and identifying the 1D model as an abelian / mod-2 holographic projection of the prime universe. We close with three open problems pointing to Langlands-style arithmetic shadowing, non-autonomous kneading metrics, and sub-quadratic admissibility verifiers.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

liang wang (2026) studied this question.

synapsesocial.com/papers/6a1d224302fbce9130638063https://doi.org/10.5281/zenodo.20463341
Ask AI
Helpful
Bookmark
Share
View Full Paper