Jacob's ladders and infinite set of transmutations of asymptotic complete hybrid formula on level curves in Gauss' plane
Jan Moser

TL;DR
This paper introduces a novel phenomenon where a fixed asymptotic hybrid formula generates infinite transmutations linking the Riemann zeta function's values with moduli of integral and meromorphic functions, revealing new mathematical relationships.
Contribution
It presents the discovery that each 'mother' hybrid formula produces an infinite set of transmutations connecting zeta function values with other complex functions.
Findings
Infinite transmutations of hybrid formulas are generated from a single mother formula.
Each transmutation links subsets of |zeta(s)| with moduli of integral and meromorphic functions.
New relationships in the complex plane are established through these formulas.
Abstract
In this paper we have obtained new phenomenon lying in the following: every fixed asymptotic complete hybrid formula (we call it as mother formula) generates infinite set of new formulas (transmutations) such that every new formula expresses a close binding between some subset of and subset of moduli of certain integral and meromorphic functions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMeromorphic and Entire Functions · Analytic Number Theory Research · Advanced Mathematical Identities
Jacob’s ladders and infinite set of transmutations of asymptotic complete hybrid formula on level curves in Gauss’ plane
Jan Moser
Department of Mathematical Analysis and Numerical Mathematics, Comenius University, Mlynska Dolina M105, 842 48 Bratislava, SLOVAKIA
Abstract.
In this paper we have obtained new phenomenon lying in the following: every fixed asymptotic complete hybrid formula (we call it as mother formula) generates infinite set of new formulas (transmutations) such that every new formula expresses a close binding between some subset of and subset of moduli of certain integral and meromorphic functions.
Dedicated to old alchemists
Key words and phrases:
Riemann zeta-function
1. Introduction
1.1.
Let us remind that the following sets of values
[TABLE]
generate the following secondary asymptotic complete hybrid formula (see [8], (3.7), )
[TABLE]
( is sufficiently big), where
[TABLE]
and
[TABLE]
is the first reverse iteration (by means of the Jacob’s ladder, see [4]) of the basic segment
[TABLE]
Remark 1*.*
The components of the main -disconnected set (for our case)
[TABLE]
are separated each from other by gigantic distance , (see [4], (5.12), comp. [7], (2.2) – (2.9))):
[TABLE]
( stands for the Euler’s constant).
1.2.
In this paper we obtain, for example, the following transmutations of the mother formula (1.2). For every fixed and admissible and (see (1.1), (1.2)), the formula (1.2) generates:
- (a)
continuum sets
[TABLE]
such that for any elements
[TABLE]
we have the following formula (transmutation of (1.2))
[TABLE]
- (b)
the continuum set
[TABLE]
such that for any elements
[TABLE]
we have the following formula (transmutation of (1.2))
[TABLE]
- (c)
the continuum set
[TABLE]
(for every fixed and admissible ) such that for any fixed elements
[TABLE]
we have the following transmutation of (1.2)
[TABLE]
(for Jacobi’s elliptic functions of moduli ).
1.3.
Now we give the following remarks.
Remark 2*.*
The formula (1.1) gives the example of the continuum set of transmutations of the mother formula (1.2).
Remark 3*.*
Let us remind that the mother formula is written as orthogonality condition for corresponding vectors. We see that the transmutations (1.6), (1.8) as well as (1.10) inherit this property.
Remark 4*.*
The method presented in this paper is general one in the following sense:
- (a)
single secondary asymptotic complete hybrid formula (1.2) generates the infinite set of its transmutations,
- (b)
there is an infinite set of asymptotic complete hybrid formulas, (see [5] – [8] concerning evolution from -factorization formula to complete hybrid formula).
Remark 5*.*
Let us remind that the general feature of all transmutations is a new phenomenon that lies in close binding between some subsets of and subsets of moduli of other integral and meromorphic functions.
Remark 6*.*
This paper is based also on new notions and methods in the theory of the Riemann zeta-function we have introduced in our series of 48 papers concerning Jacob’s ladders. These can be found in arXiv [math.CA] starting with the paper [2].
2. Jacob’s ladder as basis of secondary complete hybrid formula
2.1.
Let us remind that the Jacob’s ladder
[TABLE]
was introduced in [2], (see also [3]), where the function is arbitrary solution of the non-linear integral equation (also introduced in [2])
[TABLE]
of course,
[TABLE]
where each admissible function generates a solution
[TABLE]
We call the function the Jacob’s ladder as an analogue of the Jacob’s dream in Chumash, Bereishis, 28:12.
Remark 7*.*
By making use of the Jacob’s ladders we have shown (see [2]) that the classical Hardy-Littlewood integral (1918)
[TABLE]
has - in addition to previously known Hardy-Littlewood expression (and other similar) possessing an unbounded error term at - the following infinite set of almost exact representations
[TABLE]
as
[TABLE]
where is the Euler’s constant and is the constant from the Titschmarsh-Kober-Atkinson formula.
2.2.
Next, we have obtained (see [2], (6.2)) the following formula
[TABLE]
where is the prime-counting function.
Remark 8*.*
Consequently, the Jacob’s ladder can be viewed by our formula (2.1) as an asymptotic complementary function to the function
[TABLE]
in the following sense
[TABLE]
Since Jacob’s ladder is exactly increasing function we have the reversely iterated sequence
[TABLE]
where is a sufficiently big (we fix ). Next we have (see [4], (2.5) – (2.7), (5.1) – (5.13)) the following basic property generated by the Jacob’s ladder.
Property*.*
For every segment
[TABLE]
there is the following class of disconnected sets
[TABLE]
generated by the Jacob’s ladder .
Remark 9*.*
Disconnected set (2.2) has the following properties (see [4], (2.5) – (2.7)):
- (a)
lengths of its components are given by
[TABLE]
- (b)
lengths of adjacent segments are given by
[TABLE]
i.e. for distance of two consecutive components we have
[TABLE]
Remark 10*.*
Formula (1.4) follows from (2.5) for and .
Remark 11*.*
Asymptotic behavior of the components of the disconnected set (2.2) is as follows: at these components recede unboundedly each from other and all together are receding to infinity. Hence, at the set of the components of (2.2) behaves as one-dimensional Friedman-Hubble universe.
2.3.
Finally, let us remind that the functions (see (1.2), (1.3))
[TABLE]
are generated by the Jacob’s ladder and its iterations as follows (see [4], (6.3), [5], (1.14), [7], (3.6))
[TABLE]
3. Transmutation of type
3.1.
Let us remind that the loci
[TABLE]
is the level curve, (comp. [9], pp. 120 – 122). Of course, the topological structure of the level curve is (in general) very complicated. For example, the level curve
[TABLE]
contains three ovals (apart from another) situated in the neighborhood of the first three roots of the equation
[TABLE]
i.e. this one represents the disconnected set, (see [1], p. 371, FIG. 149).
3.2.
First, we define for every admissible and fixed (see (1.1), (1.2)) the following level curves:
[TABLE]
as the loci
[TABLE]
where
[TABLE]
(of course, the sets are continuum ones).
3.3.
Secondly, we use the loci (3.1) for the following values
[TABLE]
see (1.2) where, of course
[TABLE]
Consequently, we define for every admissible and fixed the following three level curves
[TABLE]
as the loci
[TABLE]
3.4.
Finally, construction of the sets together with application of the substitutions (2.3), (3.7) into (1.2) completes the proof of the following.
Theorem 1*.*
For every fixed and admissible (see (1.1), (1.2)) there are continuum sets
[TABLE]
such that for every elements
[TABLE]
we have the following formula (transmutation of (1.2))
[TABLE]
4. Transmutations of types ,
4.1.
We use the loci
[TABLE]
for the three values (3.5). Consequently, we define for every admissible and fixed the following level curves
[TABLE]
as the loci
[TABLE]
Now we have the following.
Theorem 2*.*
For every fixed and admissible there are the sets
[TABLE]
such that we have the following formula (transmutation of (1.2))
[TABLE]
4.2.
For the functions
[TABLE]
we define the level curves
[TABLE]
as the loci
[TABLE]
for every fixed and admissible . Now we have (see (1.2), (3.4), (4.8)) the following.
Theorem 3*.*
For every fixed and admissible there are the sets
[TABLE]
such that we have the following formula (transmutation of (1.2))
[TABLE]
Remark 12*.*
The formula (4.10) gives an example of infinite set of transmutations of the mother formula (1.2).
5. Transmutations of types , ,
5.1.
For the integral function
[TABLE]
we define the level curves
[TABLE]
as the loci
[TABLE]
for every fixed and admissible . Now we have (see (1.2), (3.4), (5.3)) the following
Theorem 4*.*
For every fixed and admissible there are sets
[TABLE]
such that we have the following formula (transmutation of (1.2))
[TABLE]
5.2.
For the Bessel’s functions
[TABLE]
we define the level curves
[TABLE]
as the loci
[TABLE]
for every fixed and admissible . Now we have (see (1.2), (3.4), (5.8)) the following.
Theorem 5*.*
For every fixed and admissible there are sets
[TABLE]
such that we have the following formula (transmutation of (1.2))
[TABLE]
Remark 13*.*
Here we have the infinite (enumerable) set of transmutations of transmutations of the mother formula (1.2), comp. Remark 12.
5.3.
For the Jacobi’s elliptic functions (their relief-surfaces with see in [1], pp. 202, 203)
[TABLE]
( stand for the moduli) we define the level curves
[TABLE]
as the loci
[TABLE]
for every fixed and admissible . Now we have (see (1.2), (3.4), (5.13)) the following.
Theorem 6*.*
For every fixed and admissible there are sets
[TABLE]
such that we have the following formula (transmutation of (1.2))
[TABLE]
Remark 14*.*
About the potency of the set of transmutations in (5.15) see Remark 2.
I would like to thank Michal Demetrian for his moral support of my study of Jacob’s ladders.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. Jahnke, F. Emde, ‘Funktionentafeln‘, Moscow, 1952.
- 2[2] J. Moser, ‘Jacob’s ladders and almost exact asymptotic representation of the Hardy-Littlewood integral‘, Math. Notes 88, (2010), 414-422, ar Xiv: 0901.3937.
- 3[3] J. Moser, ‘Jacob’s ladders, structure of the Hardy-Littlewood integral and some new class of nonlinear integral equations‘, Proc. Steklov Inst. 276 (2011), 208-221, ar Xiv: 1103.0359.
- 4[4] J. Moser, ‘Jacob’s ladders, reverse iterations and new infinite set of L 2 subscript 𝐿 2 L_{2} -orthogonal systems generated by the Riemann zeta-function, ar Xiv: 1402.2098.
- 5[5] J. Moser, ‘Jacob’s ladders, factorization and metamorphoses as an appendix to the Riemann functional equation for ζ ( s ) 𝜁 𝑠 \zeta(s) on the critical line‘, Proc. Steklov Inst. 296 (2017), pp. 92-102, ar Xiv: 1506.00442 v 1.
- 6[6] J. Moser, ’Jacob’s ladders, interactions between ζ 𝜁 \zeta -oscillating systems and ζ 𝜁 \zeta -analogue of an elementary trigonometric identity’, ar Xiv: 1609.09293 v 1, Proc. Steklov Inst. 299, 189-204, 2017.
- 7[7] J. Moser, ‘Jacob ladders, crossbreeding, secondary crossbreeding and synergetic phenomena generated by the Riemann’s zeta-function and some elementary functions on disconnected sets of the critical line‘, ar Xiv: 1806.07095 v 1.
- 8[8] J. Moser, ‘Jacob’s ladders and grafting of the complete hybrid formulas into ζ 𝜁 \zeta -synergetic meta-functional equations for the Riemann’s zeta-function‘, ar Xiv:1809.05327 v 1.
