Jacob's ladders and the set of elementary meta-functional equations giving new kind of interactions of $\zeta(s)$ with itself
Jan Moser

TL;DR
This paper introduces a novel set of elementary meta-functional equations that describe new interactions of the Riemann zeta-function with itself, derived from elementary functions on critical strips.
Contribution
It develops a new method of grafting elementary functions to generate meta-functional equations involving the zeta-function, revealing new interaction structures.
Findings
Set of elementary meta-functional equations derived
New interactions of $ta(s)$ with itself identified
Method of grafting elementary functions established
Abstract
In this paper we obtain the set of grafts from some set of 12 elementary functions on 12 critical strips. We make use this directly for grafting of elements of the corresponding set of -factorization formulas. This procedure gives the set of elementary meta-functional equations that represents the set of elementary interactions of the Riemann's zeta-function with itself.
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
TopicsGraph theory and applications · Mathematical Dynamics and Fractals · Matrix Theory and Algorithms
Jacob’s ladders and the set of elementary meta-functional equations giving new kind of interactions of with itself
Jan Moser
Department of Mathematical Analysis and Numerical Mathematics, Comenius University, Mlynska Dolina M105, 842 48 Bratislava, SLOVAKIA
Abstract.
In this paper we obtain the set of grafts from some set of 12 elementary functions on 12 critical strips. We make use this directly for grafting of elements of the corresponding set of -factorization formulas. This procedure gives the set of elementary meta-functional equations that represents the set of elementary interactions of the Riemann’s zeta-function with itself.
Key words and phrases:
Riemann zeta-function
1. Introduction
1.1.
Let us recall that the proof of meta-functional equation given in [9] is based:
- (a)
on new notions and methods in the theory of Riemann’s zeta-function we have introduced in our series of 50 papers concerning Jacob’s ladders, these can be found an arXiv [math.CA] starting with the paper [1],
- (b)
on the classical H. Bohr’s theorem in analysis (1914) concerning infinite set of roots of equation
[TABLE]
- (c)
on our notion of grafting of complete hybrid formula (see [9]) that serves for synthesis of conceptions (a) and (b).
1.2.
In this paper we give another type of the proof. Namely, we make the following operations on a given set of elementary functions:
- (a)
we construct corresponding set of -factorization formulas according to our algorithm from [4] and [5],
- (b)
we make grafting (see [9]) of every element of the set (a).
Remark 1*.*
Corresponding set of elementary meta-functional equations is obtained in result of above mentioned operations. All these formulas are, simultaneously, synergetic ones, comp. [8].
1.3.
We have obtained, for example:
- (a)
elementary meta-functional equation
[TABLE]
- (b)
more complicated meta-functional equation
[TABLE]
with notations according to those used in [9].
Remark 2*.*
Formulae (1.2) and (1.3) are asymptotic forms of corresponding exact formulae.
Remark 3*.*
Let us note that new type result concerning interaction of the Riemann’s zeta-functions with itself is expressed by any of two synergetic formulae (1.2) and (1.3).
2. Set of -factorization formulas
2.1.
In this paper we use the following two sets of elementary functions
[TABLE]
and
[TABLE]
By making use our algorithm of generating -factorization formulas (see [5], (3.1) – (3.11), comp. [4]) on the set (2.1) we obtain the following.
Lemma*.*
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
(here we fix arbitrary ), where
[TABLE]
and
[TABLE]
is the -th reverse iteration of the interval by means of the Jacob’s ladder (see [3]) and
[TABLE]
(see [2], (6.1), (6.7), (7.7), (7.8) and (9.1)).
3. The set of corresponding grafts
3.1.
We insert into the basic strip
[TABLE]
the following twelve strips
[TABLE]
where
[TABLE]
and
[TABLE]
for suffciently small . Of course,
[TABLE]
3.2.
Next, we choose arbitrary finite set (comp. (2.2))
[TABLE]
that fulfills the condition (for example)
[TABLE]
Remark 4*.*
Condition (3.6) corresponds with the point of view of Jakov Zeldovich for using maths to study real-world phenomena. Namely, the choice done in (3.6) follows from the fact that Planck’s length and Planck’s time have the following values
[TABLE]
Remark 5*.*
Of course,
[TABLE]
3.3.
Let be some admissible set. We use the following notations (comp. (2.12))
[TABLE]
Since , then (see (2.1), (2.2))
[TABLE]
Now, we make use the classical H. Hohr’s theorem (1914) in the same way as it is done in our paper [9], Section 4, in order to generate of the following infinite sets
[TABLE]
(comp. (3.1)) of the elements
[TABLE]
as follows (see (1.1), comp. [9])
[TABLE]
where
[TABLE]
for every fixed set of admissible parameters.
Remark 6*.*
Corresponding set of grafts is defined by the equalities (3.12). Of course, we choose only one element from every infinite set to construct the set of grafts (3.12).
4. The set of elementary meta-functional equations
4.1.
Now we make use the set of grafts (3.12) (see also (2.1), (2.2)) for grafting of every one from the -factorization formulas (2.3) – (2.11), i.e. we use the substitutions (3.12) in (2.3) – (2.11). This procedure gives the following.
Theorem*.*
For every fixed and admissible set of parameters
[TABLE]
there is the set of following elementary meta-functional equations (exact forms):
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
4.2.
By making use of (2.13) (comp. [8], subsection 8.2) we obtain from our Theorem the following asymptotic forms of meta-functional equations (4.1) – (4.9).
Corollary 1*.*
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
for .
4.3.
Now, we give some remarks.
Remark 7*.*
Let us notice the following:
- (a)
formulae (4.1) – (4.9) as well as formulae (4.10) – (4.18) are synergetic ones, see our interpretation given in [8],
- (b)
the set of results of elementary interactions of the Riemann’s zeta-function
[TABLE]
with itself is defined by the set of formulae (4.10) – (4.18) (with respect to the sets of functions (2.1) and (2.2)); that means results of interactions between the set
[TABLE]
and certain number of the following 12 sets
[TABLE]
- (c)
(4.15) gives, for example, the result of interactions of basic function (4.19) with itself, namely, the result of the type
[TABLE]
Let us call the set of these interactions as the -chemical reactions of the substances (4.20) and (4.21). This is then some analogue to what we have based on the classical Belousov-Zhabotinski chemical reaction, see [8].
Remark 8*.*
The set of elementary meta-functional equations (4.10) – (4.18), as well as (4.1) – (4.9), is the result (=set of -chemical compounds) of the corresponding nine types of -chemical reactions on the set of 13 substances (4.20), (4.21).
5. Examples of more complicated meta-functional equations
5.1.
Here, we demonstrate the crossbreeding, see [6] – [8], on the subset (4.3) – (4.6) of meta-functional equations as an example. Crossbreeding in this case means making use of Gauss’ type elementary operations on this subset. namely, the first stage of the crossbreeding gives the following formulae:
[TABLE]
[TABLE]
and elimination of from (5.1) and (5.2) represents the second stage. This gives the following.
Corollary 2*.*
[TABLE]
5.2.
Secondary crossbreeding of the meta-functional equation (5.3), for example, is the full analogue of the secondary crossbreeding on the class of corresponding complete hybrid formulas, see [8]. First, (4.1) + (4.2) gives in the case
[TABLE]
the result
[TABLE]
Second, we substitute (5.4) into (5.3) in the cases and obtain the following.
Corollary 3*.*
[TABLE]
Remark 9*.*
Of course, we obtain corresponding asymptotic formulae for (5.3), (5.5) if we use asymptotic meta-functional equations (4.10) – (4.15) instead of (4.1) – (4.6).
Remark 10*.*
Now we see that (1.2)=(4.15) while (1.3) is the asymptotic form of (5.3).
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] 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.
- 2[2] 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.
- 3[3] 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.
- 4[4] 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.
- 5[5] 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.
- 6[6] J. Moser, ‘Jacob’s ladders, crossbreeding in the set of ζ 𝜁 \zeta -factorization formulas and the selection of families of ζ 𝜁 \zeta -kindred real continuous functions‘, ar Xiv: 1710.04428 .
- 7[7] J. Moser, ‘Jacob ladders and new families of ζ 𝜁 \zeta -kindred real continuous functions‘, ar Xiv: 1801.09425 v 1.
- 8[8] 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.
