From Ordered Bernoulli Levels to Critical-Line Geometry: Integer Quantization, Bernoulli Residual Phase, and Prime-Power Spectra
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
From Ordered Bernoulli Levels to Critical-Line Geometry: Integer Quantization, Bernoulli Residual Phase, and Prime-Power Spectra Y. Kenan Yılmaz
arXiv:2609.03801v1 [cs.LG] 3 Sep 2026
yilmazykenan@gmail.com
September 2026
Abstract We begin with the ordered Bernoulli-word kernel f (p, n, k) = pk (1 − p)n−k , using no binomial coefficient and no prior zeta-function input. The first inverse-integer level, 2−n , selects the unique real split-independent anchor p = 1/2. Preserving complementarity under complex continuation by 1 − z = z forces the full conjugation-symmetric vertical geometry z = 1/2 ± iu. On the central normalized level branch, every inverseinteger label q ≥ 2 likewise lies on ℜκ = 1/2. A second exact coordinate is obtained directly from the conjugate pair, Q(z) = z(1 − z) =
1 + u2 . 4
± It has the p sharp minimum Qmin = 1/4 at the central point and inverse map zL = 1/2 ± i L − 1/4. Restricting L to integers gives an arithmetic quantization of the continuous vertical geometry, and unique factorization resolves each nonunit integer level into prime-generator occupations. For a tabulated critical-line zero ρk = 1/2 + iγk , the same coordinate gives the exact real level Lk = 1/4 + γk2 . We refine nearest-integer rounding to the lossless decomposition 1 3 2 e Lk = Nk + δk , Nk = Lk + , δk = B1 γk + , 2 4
e1 (x) = {x} − 1/2 is the periodic first Bernoulli function. The factorization of Nk where B forms an integer/arithmetic channel, while 2
Zk = e2πiδk = i e2πiγk
is a circular residual-phase channel; the pair (Nk , Zk ) is lossless. This local periodicBernoulli role is distinct from the indexed Bernoulli numbers B2 , B4 , . . . entering Euler– Maclaurin representations of zeta. Classical explicit formulas couple the von Mangoldt prime-power spectrum to the zeta-zero spectrum globally, motivating conditional Weyl statistics for testing whether arithmetic classes of Nk leave a nontrivial signature in Zk . Preliminary coarse factorization and low-order Bernoulli-mode controls are negative and are retained as such. The technical lift replaces the integer total exponent by a distinct complex exponent s and solves z k (1 − z)s−k = m−s .
1
Prime powers then occupy one prime coordinate repeatedly, general composites are finite prime-coordinate superpositions, and the scalar level coordinate is an affine projection through log m. The common atom m−s organizes the two classical zeta assemblies: global Dirichlet enumeration and local Euler prime-power generation. The resulting architecture links primitive Bernoulli level geometry, integer quantization, exact integer–residual decomposition, circular phase, prime-factor coordinates, and zeta assembly while keeping exact identities, classical bridges, numerical controls, and open statistical questions explicitly separated.
Keywords. Riemann critical line; ordered Bernoulli likelihood; integer quantization; periodic Bernoulli function; residual phase; squared zero ordinates; Weyl statistics; von Mangoldt function; prime powers; prime factorization; Dirichlet series; Euler product; Bohr lift.
1
Introduction
Riemann’s 1859 memoir placed the zeros of the analytically continued zeta function at the center of the relation between complex analysis and the distribution of primes [8, 10]. The construction studied here approaches the familiar real-part-1/2 geometry from a different entry point. It begins not with ζ(s), but with the ordered Bernoulli-word kernel f (p, n, k) = pk (1 − p)n−k ,
(1)
and asks what geometry is obtained when inverse-integer levels are solved in a broad real/complex domain. The first level 2−n uniquely selects p = 1/2 as the real split-independent anchor. Preserving the complementary pair as complex conjugates gives 1 1 + iu, 1 − z = − iu, 2 2 so a full conjugation-symmetric vertical line is obtained before a Dirichlet series, Euler product, or prime classification is introduced. A normalized split coordinate κ = k/n inherits the same real part on the central phase branch. The quadratic coordinate z=
1 + u2 (2) 4 then supplies an exact real level geometry. Integer restriction of Q produces a discrete family on the same vertical line. Known critical-line zeros may be passed through this coordinate diagnostically via Lk = 1/4 + γk2 . Each such real level admits an exact nearest-integer shell and centered residual, and the residual can be represented on the unit circle. This isolates γk2 mod 1 as the modular variable naturally associated with the quadratic coordinate. A separate arithmetic layer uses the prime-exponent vector of an integer. Prime powers occupy one prime coordinate repeatedly, while integers with several distinct prime divisors occupy several coordinates. The scalar level lift depends only on the logarithmic resultant log m, so it is a one-dimensional affine projection of the full factorization state. This is closely related in spirit to the classical Bohr multi-index viewpoint for Dirichlet series [3]. Finally, a distinct complex exponent s is introduced in Q(z) = z(1 − z) =
F (z, s, k) = z k (1 − z)s−k .
(3)
Solving F (z, s, k) = m−s realizes each Dirichlet atom inside the same multiplicative architecture. The common atom m−s then appears in the two standard zeta assemblies, ζ(s) =
X m≥1
m−s =
Y
(1 − r−s )−1 ,
r∈P
2
ℜs > 1.
The manuscript does not claim a proof of the Riemann Hypothesis. The derived 1/2 geometry belongs first to the Bernoulli coordinate z and to the normalized split coordinate κ under a specified conjugation-preserving continuation. The later Dirichlet exponent s is introduced independently and is not assumed or proved to satisfy ℜs = 1/2. The relationship with zeta zeros is therefore diagnostic and structural: exact coordinate identities are kept separate from classical prime-power/zero couplings, finite-sample numerical controls, and open conditional-equidistribution questions. The principal exact statements are: (i) the binary level singles out the real anchor; (ii) the chosen complement-preserving continuation forces a conjugation-symmetric 1/2 line; (iii) the quadratic coordinate has a sharp minimum and exact inverse; (iv) integer restriction yields arithmetic level quantization; (v) zero-induced levels have an exact periodic-Bernoulli residual; (vi) circularization yields a lossless integer/phase pair; (vii) prime-exponent space separates one-generator and multi-generator arithmetic states; and (viii) the complex-s lift realizes the common Dirichlet atom that underlies both zeta assemblies.
2
Ordered Bernoulli levels and the binary anchor
The kernel (1) is the likelihood of one specified ordered Bernoulli word containing k events of type p and n − k complementary events of type 1 − p. No binomial coefficient is required because permutation classes are not being counted. Proposition 2.1 (Unique split-independent binary anchor). Let 0 < p < 1 and n > 0. The map k 7−→ pk (1 − p)n−k is independent of k if and only if p = 1/2. At this unique point its value is 2−n for every finite real or complex k. Proof. For positive real p,
pk (1 − p)n−k = (1 − p)n exp k log
p . 1−p
Independence from k is equivalent to log(p/(1 − p)) = 0, hence p = 1 − p and p = 1/2. Substitution gives f (1/2, n, k) = 2−n . Proposition 2.2 (Centered solution of the binary level). At the centered split k = n/2, the real level equation pn/2 (1 − p)n/2 = 2−n , 0 < p < 1, has the unique solution p = 1/2, with algebraic multiplicity two in the resulting quadratic equation. Proof. Raising both sides to the power 2/n gives 1 p(1 − p) = , 4 so
1 p− 2
2
= 0.
Remark 2.3 (Algebraic and arithmetic roles of 2). The level 2−n arises algebraically from the unique equal split of the Bernoulli complement pair. Separately, 2 is the first prime and the unique even prime. The construction uses both facts, but does not identify them as logically equivalent. 3
3
Complex phase and conjugation-symmetric continuation
We first keep p real and allow the exponent split to become complex. Proposition 3.1 (Vertical phase lattice). Let 0 < p < 1, p = ̸ 1/2, n ∈ N, and q > 0. Write k = a + iτ . The level equation pk (1 − p)n−k = q −n (4) holds precisely when log[1/(q(1 − p))] , log[p/(1 − p)] 2πj τ= , j ∈ Z. log[p/(1 − p)] a=n
(5) (6)
Hence the solutions form a vertical arithmetic lattice in the complex k-plane. Proof. Since p and 1 − p are positive real numbers,
pk (1 − p)n−k = pa (1 − p)n−a exp iτ log
p . 1−p
Equality with the positive real number q −n requires equality of the magnitudes and phase closure modulo 2π. Solving the two resulting equations gives the formulas above. Remark 3.2 (A clean example). For q = 3 and p = 2/3, the real part is a = 0 and kj = i
2πj . log 2
The spacing 2π/ log 2 is a consequence of phase closure under complex exponentiation; it is not a statement about zeta-zero spacing. We next complexify the complementary Bernoulli pair by imposing the continuation rule 1 − z = z.
(7)
Together with z + (1 − z) = 1, this yields z + z = 1, and therefore
1 1 + iu, 1 − z = − iu, u ∈ R. (8) 2 2 The real part 1/2 is thus a consequence of the adopted complement-preserving continuation rule. Write z=
iθ
z = ϱe ,
−iθ
1 − z = ϱe
r
,
ϱ=
1 + u2 , 4
θ = arctan(2u).
(9)
Because both factors lie in the open right half-plane, we use the principal logarithm Log z = log ϱ + iθ,
Log(1 − z) = log ϱ − iθ.
Remark 3.3 (Derived statement versus continuation choice). The real anchor p = 1/2 is derived from the binary level together with split symmetry. Equation (7) is an additional complex-continuation rule. The statement ℜz = 1/2 follows from that rule; the level equation alone does not force every complex parameter to lie on this line. 4
Proposition 3.4 (Integer-exponent level family). Let u = ̸ 0, n ∈ N, and q > 0. Under the principal logarithm, the solutions of z k (1 − z)n−k = q −n are
n πj n log(qϱ) + +i , 2 θ 2θ In particular, on the central phase branch j = 0, kj (n; q, u) =
ℜk0 =
j ∈ Z.
(10)
n . 2
Proof. Using (9), Log z k (1 − z)n−k = n log ϱ + iθ(2k − n).
Equality with the positive real level q −n is equivalent to n log ϱ + iθ(2k − n) = −n log q + 2πij, which rearranges to (10). After normalization κ = k/n, the central branch becomes log(qϱ) 1 +i , 2 2θ
κq = so
q ≥ 2,
(11)
1 ℜκq = . 2
For q = 2, the continuous function t2 (u) =
log(2ϱ(u)) 2θ(u)
extends by t2 (0) = 0, is odd, and has |t2 (u)| → ∞ as |u| → ∞. Thus the binary level supplies both conjugate directions of the normalized vertical geometry.
4
Quadratic level coordinate and integer quantization
Define Q(z) = z(1 − z). On the conjugation-symmetric line (8),
Q(z) =
1 + iu 2
1 1 − iu = + u2 . 2 4
(12)
Hence Q(z) ≥ 1/4, with equality if and only if u = 0. The central point is therefore the unique minimum state: 1 1 Qmin = ⇐⇒ z = . 4 2 Conversely, every real L ≥ 1/4 determines a conjugate pair 1 zL± = ± i 2
5
r
1 L− . 4
(13)
Restricting L to positive integers yields the exact discrete family 1 ± zm = ±i
r
2
1 m− , 4
m ∈ Z>0 .
(14)
This is an arithmetic quantization of the continuous level coordinate. It does not, by itself, identify the resulting points with any externally specified spectral set. For a nonunit integer level m ≥ 2, unique prime factorization separates three structural arithmetic forms: Level type
Arithmetic form
Generator interpretation
Prime Proper prime power Multi-prime composite
m=p m = pa , a ≥ 2 Q a m = j pj j
single prime generator repeated single generator finite superposition of generators
The integer 2 may be isolated further because it also has the prior binary-anchor role.
4.1
Zeta zeros as a diagnostic of the level coordinate
For a nontrivial zeta zero known on the critical line, write ρk =
1 + iγk . 2
The same quadratic map induces Lk = Q(ρk ) =
1 + γk2 . 4
(15)
Using the standard tabulated ordinates [7], the first zero γ1 = 14.134725 . . . gives L1 = 200.0404548 . . . . The nearby integer 200 = 23 · 52 lies in the multi-generator composite class. A nearest-integer diagnostic Nk = round(Lk ) is not itself an identity. For the first forty tabulated zeros, five rounded levels are prime. The observed count is 5/40 = 12.5%. As a first-order control, the prime number theorem suggests local prime density 1/ log x [4]. Summing over the same forty rounded levels gives 40 X
1 ≈ 4.83. log Nk k=1 Thus the observed count 5 is close to the heuristic expectation 4.83 and supplies no evidence of preferential prime enrichment. This negative control is retained to separate exact coordinate identities from numerical pattern-seeking.
5
Exact integer–residual decomposition and Bernoulli phase
The diagnostic rounding can be refined to an exact centered decomposition: 1 Nk = Lk + , 2
δk = Lk − Nk ,
6
1 1 − ≤ δk < . 2 2
(16)
Hence Lk = Nk + δk exactly, and Nk has a unique factorization. For the first tabulated ordinate, L1 ≈ 200.0404548324,
N1 = 200 = 23 52 ,
δ1 ≈ 0.0404548324.
Let B1 (x) = x − 1/2 and define the periodic first Bernoulli function e1 (x) = B1 ({x}) = {x} − 1 . B 2
Then the centered residual is exactly 1 δk = Lk + 2
1 e1 γ 2 + 3 . − =B k 2 4
(17)
Consequently, Y aj 1 e1 γ 2 + 3 , + γk2 = pj + B k 4 4 j
(18)
where the product denotes the prime factorization of Nk . e1 decomposition is universal for every real number. The special The centered floor/B input here is the level Lk = 1/4 + γk2 , which is tied simultaneously to the quadratic Bernoulli coordinate and to a zeta-zero ordinate.
5.1
Two distinct Bernoulli roles
The construction uses two mathematically different Bernoulli structures. The local object e1 (γ 2 + 3/4) is the exact centered fractional residual of an individual level. The indexed B k Bernoulli numbers B2 , B4 , B6 , . . . are classical correction coefficients in Euler–Maclaurin and Gamma–zeta analysis [1, 10]. For n ≥ 2, πn 2n! ζ(n) cos , (2π)n 2
Bn = −
(19)
and in particular B2m = (−1)m+1
2(2m)! ζ(2m) . (2π)2m
The cosine supplies the parity/sign cycle; the remaining factor supplies the amplitude. No identity is asserted in which δk is a sum of higher Bernoulli corrections. A defensible directional chain is therefore 1 e1 γ 2 + 3 . {B2m } −→ Euler–Maclaurin/zeta analysis −→ γk −→ + γk2 −→ B k 4 4
5.2
Prime-power spectrum and common-source interpretation
The classical explicit-formula side uses the full von Mangoldt prime-power spectrum Λ(pa ) = log p,
a ≥ 1,
and couples it globally to the nontrivial zeta zeros [10, 4]. The structural picture used here is therefore {prime powers with von Mangoldt weights} ←→ {γk } −→ Lk −→ (Nk , δk ), 7
where the double arrow denotes the classical explicit-formula coupling, not a one-to-one correspondence between individual prime powers and individual zeros. While the nearest-integer cell is unchanged, differentiation gives dδ = dL = 2γ dγ.
(20)
For k = 1, the displacement of γ1 from the integer shell is approximately r
γ1 −
200 −
1 ≈ 0.0014311, 4
illustrating that the residual phase is more sensitive to zero-ordinate precision than the ordinate itself.
5.3
Circular residual coordinate
Because δk has a coordinate cut at ±1/2, comparisons near that boundary are more naturally made on the unit circle. Define 2
Zk = e2πiδk = e2πiLk = i e2πiγk .
(21)
The integer shell disappears because e2πiNk = 1. Thus the level has two complementary coordinates: Y aj integer/arithmetic channel: Nk = pj , j 2
circular/residual channel: Zk = i e2πiγk . With the centered branch Arg Zk ∈ [−π, π), δk =
Arg Zk , 2π
so (Nk , Zk ) is lossless. Locally, dZ = 4πiγZ, dγ
d(arg Z) = 4πγ dγ.
The modular core behind this channel is γk2 mod 1.
5.4
Conditional Weyl statistics
The literature contains classical uses of Bernoulli numbers and periodic Bernoulli functions in Euler–Maclaurin/zeta analysis, together with results on distribution modulo one for certain sequences of zero ordinates [1, 2]. The present open question is not a deterministic formula δk = F (factorization of Nk ), but whether arithmetic classes of Nk leave a Fourier signature in Zk . For an arithmetic class A, define AK = {k ≤ K : Nk ∈ A}. The conditional circular moment is Wh (A; K) =
X X 1 1 2 Zkh = e2πih(γk +1/4) , |AK | k∈A |AK | k∈A K
K
8
h = 1, 2, . . . .
(22)
Equivalently, replacing 1/4 by 3/4 multiplies the statistic by (−1)h and leaves its vanishing/nonvanishing content unchanged. This is a conditional version of exponential sums appearing in Weyl’s criterion [11]. Candidate classes include prime shells, pure prime powers, semiprimes, fixed ω(Nk ), fixed Ω(Nk ), and richer factorization signatures. Under phase independence, these conditional moments should tend to zero; a persistent nonzero harmonic would indicate arithmetic conditioning of the residual phase. Preliminary controls against ω(Nk ) and Ω(Nk ) show essentially no dependence at the tested scale, and short-range nonlinear Bernoulli-mode and simple prime-factor phase summaries likewise show no statistically convincing coupling. These are retained as negative controls rather than interpreted as evidence for the stronger hypothesis.
6
Prime-coordinate modes and scalar collapse
The arithmetic role classification is most precise before scalar projection. Definition 6.1 (Prime-exponent state space). Let c00 (P) denote the real vector space of finitely supported sequences indexed by the primes, with canonical basis (er )r∈P . For m=
Y
rar ,
r∈P
define α(m) =
X
ar er ∈ c00 (P).
(23)
r∈P
The logarithmic functional L : c00 (P) → R is !
L
X
xr e r
=
r
X
xr log r.
(24)
r
For integer states, L(α(m)) = log m. On the central branch of the integer-exponent level family, define k1 =
n n log ϱ +i , 2 2θ
Then km = k1 + i
∆r = i
n log r . 2θ
n log m . 2θ
(25)
Proposition 6.2 (Prime powers and multi-prime composites). Let m =
Q
rr
ar .
(a) If m = ra is a prime power, then α(m) = aer ,
kra = k1 + a∆r .
Thus successive powers of one prime form an arithmetic trajectory with increment ∆r . (b) For a general integer, α(m) =
X
ar e r ,
km = k1 +
r
X
ar ∆r .
r
Hence a multi-prime composite is a finite superposition of prime-coordinate occupations before scalar projection. 9
Proof. Unique factorization gives log m = statements.
P
r ar log r.
Substitution into (25) yields both
Remark 6.3 (Mode versus eigenstate). The word mode is exact here in the coordinate sense: (er ) is the canonical basis of prime-exponent space. The word eigenstate would require an additional operator for which these basis vectors are eigenvectors; no such operator is assumed. Proposition 6.4 (Affine-log collapse). For fixed n and u ̸= 0, the central-branch scalar level coordinate is the affine functional km = k1 + B L(α(m)),
B=i
n . 2θ
(26)
Equivalently, km = A + B log m for constants A, B independent of m. Corollary 6.5 (What is hidden and what is preserved). The scalar map α(m) 7→ km hides the separate prime-coordinate entries but does not destroy uniqueness of integer factorization. If km = km′ for positive integers m, m′ under fixed n, u ̸= 0, then m = m′ and therefore α(m) = α(m′ ). Before projection, the prime factors occupy independent canonical coordinates. After P projection, only the weighted sum r ar log r is visible. Recovering the components from the integer m is precisely the factorization problem. In a Bohr lift, the same integer is encoded by its prime multi-index (ar ), and Dirichlet-series coefficients become Fourier or power-series coefficients indexed by those multi-indices [3]. The present scalar level coordinate does not replace that richer space; it is a specific affine logarithmic projection arising from the Bernoulli level equation.
7
Continuation to a complex spectral exponent
We now replace the integer total exponent n by a distinct complex variable s ∈ C and use (3). The half real part derived earlier belongs to the Bernoulli coordinate z and normalized split coordinate κ; no restriction ℜs = 1/2 is imposed. At this stage F is a complex analytic extension of the multiplicative Bernoulli kernel, not a probability mass function. Proposition 7.1 (Lift of a Dirichlet atom). Let u = ̸ 0, s ∈ C, and m > 0. Under the principal-branch convention, the solutions of F (z, s, k) = m−s are kj (s; m, u) =
s πj s log(mϱ) + +i , 2 θ 2θ
The central branch is km (s; u) =
(27)
j ∈ Z.
s s log(mϱ) +i . 2 2θ
Proof. Using the principal logarithm, Log F = s log ϱ + iθ(2k − s). Equation (27) is equivalent to s log ϱ + iθ(2k − s) = −s log m + 2πij, which gives (28). 10
(28)
(29)
For fixed s and u, the central lift again has the form A + B log m. The scalar coordinate is therefore an explicit re-encoding of the ordinary logarithmic embedding. Arithmetic information beyond that scalar coordinate resides in the prime multi-index α(m) and in how those coordinates are assembled.
8
The two zeta faces from the common atom
Define K(m, s) = m−s = e−s log m .
(30)
The previous section realizes this kernel as a level value of F .
8.1
Dirichlet face: enumeration
For ℜs > 1, X
X
F (z, s, km ) =
m≥1
m−s = ζ(s).
(31)
m≥1
The level construction produces individual integer atoms; the zeta function is obtained by global enumeration.
8.2
Euler face: prime-power generation
The geometric identity (1 − x)−1 =
X
xa
a≥0
is the shape-one negative-binomial generating identity. For a prime r and ℜs > 1, setting x = r−s gives X X (1 − r−s )−1 = r−as = K(ra , s). (32) a≥0
a≥0
Thus a local Euler factor generates the full prime-power tower 1, r, r2 , r3 , . . . through the same atom K. Multiplication over primes gives Y
X
r∈P
K(ra , s) =
a≥0
Y
(1 − r−s )−1 = ζ(s).
(33)
r∈P
Unique factorization makes every finite choice of occupations (ar ) correspond to exactly one integer m. The two faces can therefore be summarized as follows: Dirichlet face: enumerate complete integer states m, Euler face: generate those states from prime-power occupations. The common interface is the atom m−s .
9
Relation to probabilistic zeta constructions
For real σ > 1, the normalized weights Pσ (N = m) =
11
m−σ ζ(σ)
define the classical zeta distribution. Its Euler product leads to infinite-divisibility and compound-Poisson descriptions supported on logarithmic prime-power locations; see Saito and Tanaka [9]. Completed-zeta characteristic-function constructions and RH-related divisibility criteria have been developed by Nakamura [5] and Nakamura–Suzuki [6]. The present paper uses probability at a different entry point. It starts from a Bernoulli likelihood kernel and then analytically extends its exponent split. Once n is replaced by complex s, F (z, s, k) is no longer interpreted as a probability mass. Accordingly, no new claim about infinite divisibility or characteristic functions follows merely from the level-set lift. The probabilistic literature is relevant because it confirms that logarithmic prime-power coordinates and Euler-factor decompositions already have precise stochastic realizations; the contribution here is the explicit Bernoulli level geometry that maps integer atoms into a centered complex k-coordinate family.
10
Coordinate scope, limitations, and relation to the Riemann Hypothesis
Three coordinate levels must remain distinct. Primitive Bernoulli coordinate. The binary level and continuation rule construct z = 1/2 ± iu directly. The quadratic coordinate Q(z) = z(1 − z) then gives a real continuous level with an exact integer quantization. Normalized split coordinate. The central branch κ = k/n also lies on ℜκ = 1/2. Its imaginary coordinate is generated by the inverse-integer level equation and is related to, but not identical with, the u coordinate of z. Later Dirichlet exponent. The variable s introduced in the complex lift is distinct and unrestricted. The paper therefore does not obtain the Riemann Hypothesis by inserting or deriving a condition ℜs = 1/2 for zeta zeros. Instead, the critical-line geometry appears earlier in the Bernoulli/split coordinates and is compared with zeta-zero data through the diagnostic coordinate Lk = 1/4 + γk2 . The zero-sensitive comparison does not identify individual prime powers with individual zeros. The classical explicit formula supplies a global prime-power/zero coupling, while the conditional Weyl statistics ask a narrower question: whether arithmetic classes of the integer shell condition the residual phase. Exact identities, classical bridges, negative numerical controls, and this open statistical question are separate checkable layers. The logarithmic formulas use the principal branch for z = 1/2 + iu and 1 − z. Other logarithm branches produce shifted level lattices, so the branch convention is part of the coordinate specification. Likewise, for fixed parameters the scalar coordinate contains no more factorization information than log m; its value is to make explicit, inside one analytic kernel, the projection from independent prime-coordinate occupations to a scalar complex level. The term superposition refers to finite-support prime-exponent space, not to a quantum-mechanical state or an asserted spectral operator.
11
Conclusion
The construction can be read in five aligned layers. First, the starting object is the likelihood of one ordered Bernoulli word, pk (1 − p)n−k . The first nonunit inverse-integer level 2−n uniquely
12
selects p = 1/2, and complement-preserving complex continuation generates the conjugationsymmetric vertical line 1/2 ± iu. The normalized central split coordinate independently inherits the same real part. Second, the integers that label the construction separate by arithmetic role. The integer 2 is distinguished by its binary-anchor function; prime powers are repeated occupations of one prime generator; composites with at least two distinct prime divisors are finite multi-generator superpositions. This factorization classification acts on a geometry already obtained from the primitive level problem. Third, the quadratic coordinate Q(z) = 1/4 + u2 adds an exact real level geometry with a sharp minimum and explicit inverse. Restriction to integer values gives a discrete arithmetic quantization. Passing tabulated critical-line zeros through Lk = 1/4 + γk2 supplies a diagnostic of the coordinate; the first forty-zero prime-hit control is deliberately negative. Fourth, every zero-induced level decomposes exactly as 3 2 e , δk = B1 γk + 4
Lk = Nk + δk ,
so the integer shell and centered periodic-Bernoulli residual are complementary coordinates. 2 Circularization gives Zk = e2πiδk = ie2πiγk , removing the integer shell and isolating γk2 mod 1. e1 role is distinct from the higher Bernoulli numbers occurring upstream in Euler– The local B Maclaurin/zeta analysis. The classical explicit formula couples the global von Mangoldt prime-power spectrum to the zero spectrum, while the first coarse shell–phase tests are negative. The remaining question is statistical: conditional Weyl moments ask whether arithmetic classes of Nk leave persistent harmonics in Zk . Fifth, the full complex level-set lift introduces a distinct spectral exponent s and realizes every Dirichlet atom m−s inside the same multiplicative architecture. Prime-exponent space retains the full factorization state, while the scalar level coordinate collapses it through log m. The atom then presents the two classical zeta faces in complementary roles: the Dirichlet series enumerates already assembled integers, whereas the Euler product generates them from local prime-power towers. The resulting framework is therefore algebraic and organizational rather than a proof of RH. It creates a precise interface between continuous conjugation-symmetric geometry, discrete arithmetic factorization, Bernoulli residual structure, and the classical prime-power/zero spectrum while keeping exact statements, known theory, finite numerical controls, and open tests distinct.
A
Numerical diagnostics and statistical controls
A.1
Exact level decomposition
For each tabulated critical-line ordinate γk , define 1 Lk = + γk2 , 4
1 Nk = Lk + , 2
δk = Lk − Nk .
The first ten levels are shown in Table 1. The factorization and residual are displayed side by side without asserting that either algebraically determines the other.
13
Table 1: First ten quadratic level coordinates and nearest-integer arithmetic shells. k 1 2 3 4 5 6 7 8 9 10
A.2
γk 14.134725 21.022040 25.010858 30.424876 32.935062 37.586178 40.918719 43.327073 48.005151 49.773832
Lk 200.040455 442.176151 625.792997 925.923087 1084.968282 1412.970789 1674.591566 1877.485279 2304.744511 2477.684400
Nk 200 442 626 926 1085 1413 1675 1877 2305 2478
factorization of Nk 3
2
2 ·5 2 · 13 · 17 2 · 313 2 · 463 5 · 7 · 31 32 · 157 52 · 67 1877 5 · 461 2 · 3 · 7 · 59
δk +0.040455 +0.176151 −0.207003 −0.076913 −0.031718 −0.029211 −0.408434 +0.485279 −0.255489 −0.315600
Circular residual geometry
Figure 1: Centered residuals δk = Lk − Nk for the first forty zeros. The interval [−1/2, 1/2) is intrinsic to nearest-integer centering. The visual absence of a simple trend motivates circular/Fourier diagnostics rather than ordinary linear regression.
14
Figure 2: Unit-circle representation Zk = e2πiδk for the first forty zeros. Labels 1–10 identify the first ten levels. Circularization removes the artificial discontinuity between residuals near +1/2 and −1/2.
A.3
Fourier/Weyl diagnostics and coarse factorization controls
Figure 3: Histogram of the first 200 centered residuals. The dashed line is the density of U [−1/2, 1/2). This is a finite-sample diagnostic only and does not establish equidistribution.
15
2
Figure 4: First√ten Weyl magnitudes for e2πim(γk +3/4) , using the first 200 zeros. The dashed reference is 1/ 200.
Table 2: Recomputed first-200 residual diagnostics. Diagnostic
Value
Sample size Mean of δk Variance of δk Uniform benchmark variance KS statistic vs. U [−1/2, 1/2) KS p-value corr(δ, ω(N )) corr(δ, Ω(N )) corr(|δ|, ω(N )) corr(|δ|, Ω(N ))
16
200 −0.012976 0.083552 0.083333 0.0642 0.3661 −0.1106 −0.1288 −0.0839 −0.1074
Figure 5: Residual versus total number of prime factors Ω(Nk ) for the first 200 levels. The scatter illustrates why a coarse factor-count statistic can discard too much of the primegenerator structure for a stronger shell–phase hypothesis.
A.4
Bernoulli hierarchy illustration
Figure 6: Exact sign/parity skeleton − cos(πn/2) of the Bernoulli-number sequence for n ≥ 2.
Table 3: Bernoulli objects used in distinct roles. Object
Exact/classical form
Role in the present framework
e1 Periodic B Higher Bernoulli polynomials Bernoulli numbers
e1 (γ 2 + 3/4) δk = B k Bm ({γk2 + 3/4})
Exact centered residual readout Nonlinear modes of the same modular coordinate Indexed parity/sign and correction hierarchy Classical upstream link to zeta analysis
Euler–Maclaurin
A.5
Eq. (19) B2 , B4 , . . . as correction coefficients
Preliminary prime-power reconstruction diagnostics
The following reconstruction figures use the finite-window prime-power reconstruction values recorded during the working analysis. They are retained because they illustrate sensitivity 17
and circular error, but they are explicitly preliminary: the reconstruction pipeline is not used as a premise of any exact statement in the manuscript.
Figure 7: True versus finite-window reconstructed zero ordinates for k = 1, . . . , 10. The curves nearly overlap for the early ordinates, while dL ≈ 2γ dγ explains how a small ordinate error can become a much larger residual-phase error.
Figure 8: Circular reconstruction error measured in turns. The wraparound behavior illustrates why residual errors should be compared on S 1 rather than by ordinary subtraction near ±1/2.
18
A.6
Arithmetic shell classes for conditional Weyl tests
Table 4: Candidate arithmetic conditioning classes. Class A
Definition/example
Purpose
Prime shell Pure prime power
Nk prime Nk = pa , a ≥ 2
Semiprime Fixed ω
Ω(Nk ) = 2 ω(Nk ) = r
Fixed Ω
Ω(Nk ) = r
Factorization signature
e.g. exponent partition (3, 2) for 23 52
Single-generator arithmetic shell One base prime with repeated exponent Minimal two-factor composite class Controls number of distinct base primes Controls multiplicity-weighted complexity Retains richer generator structure
Among the first forty zero-induced shells, the prime cases occur at k = 8, 14, 24, 32, 39. This is the same 5/40 count already compared with the PNT heuristic in the main text. The appendix figures are diagnostic and are not used as evidence for the exact identities proved above.
19
References [1] Tom M. Apostol. Introduction to Analytic Number Theory. Undergraduate Texts in Mathematics. Springer, New York, 1976. [2] Fatma Cicek and Steven M. Gonek. The uniform distribution modulo one of certain subsequences of ordinates of zeros of the zeta function. Mathematical Proceedings of the Cambridge Philosophical Society, 176(3):593–608, 2024. [3] Hakan Hedenmalm, Peter Lindqvist, and Kristian Seip. A hilbert space of dirichlet series and systems of dilated functions in l2 (0, 1). Duke Mathematical Journal, 86(1):1–37, 1997. [4] Hugh L. Montgomery and Robert C. Vaughan. Multiplicative Number Theory I: Classical Theory, volume 97 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2007. [5] Takashi Nakamura. A complete riemann zeta distribution and the riemann hypothesis, 2015. [6] Takashi Nakamura and Masatoshi Suzuki. On infinitely divisible distributions related to the riemann hypothesis. Statistics & Probability Letters, 201:109889, 2023. [7] Andrew M. Odlyzko. Tables of zeros of the riemann zeta function. University of Minnesota. https://www-users.cse.umn.edu/~odlyzko/zeta_tables/. [8] Bernhard Riemann. Ueber die anzahl der primzahlen unter einer gegebenen grösse. Monatsberichte der Berliner Akademie, pages 671–680, 1859. English translation by D. R. Wilkins available from Trinity College Dublin. [9] Shintaro Saito and Toshihiro Tanaka. A note on infinite divisibility of zeta distributions. Applied Mathematical Sciences, 6:1455–1461, 2012. [10] E. C. Titchmarsh and D. R. Heath-Brown. The Theory of the Riemann Zeta-Function. Clarendon Press, Oxford, 2 edition, 1986. [11] Hermann Weyl. Über die gleichverteilung von zahlen mod. eins. Mathematische Annalen, 77(3):313–352, 1916.
20
Related documents
- On the non-analytic behaviour of thermodynamic potentials at first order phase transitions#454336
- How strange: Phase diagrams with 3 critical points#986490
- Observation of Iso-Symmetric Structural and Lifshitz Transitions in Quasi-One-Dimensional CrNbSe<sub>5</sub>#495539
- Phase transitions in hard-core models of statistical mechanics#365465
- Continuous crossover between high-pressure ice phases VII and X driven by monopole screening: a model study#1142650
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive