1. Introduction
Ordinary numbers including prime sequences can form an infinite arithmetic sequence. However, not all such numbers contribute equally to field symmetries governed by rational ratios of arithmetic functions. Here I define a subset of primes
that satisfy both a rational functional relation and a geometric phase constraint. I show that this subset is infinite and structurally distinct from the classical sequence of progression. The first sensor used to determine this fact is the Gauss Gamma product formula [1]. The second sensor used is cotangent relation as an expanded series separated into two sets. The first being the set of desired primes in the sequence that satisfies
The second being the integers in the series that do not satisfy the condition (1).
Invariance of phase lock sequences
The product-form of the
-function due to Gauss, provides further insights into many relations that will be developed in this paper. The product form is given by, [4, p. 896]:
LEMMA 1: [4]
. Letrepresent one integer factor of , then, if, is a number theoretic function, the functional relation:
is invariant with respect to choices of any other factors of . Hence is a phase-locked function.
The significance of the LEMMA 1, is its consequences for prime numbers, and their relations to sets of primes such as the Sophie primes and the Mersenne primes.
PROOF:
Let
be some
integer factor of
-factors a real or complex function
Then,
The Gauss gamma product formula is a simple relation given by:
Then, since is an integer-factor of we have, putting in
. Then,
If there any other integer factor labelled here
then, the substitution
leaves
invariant. However this is also true for any integer factors,
of
then, for any
remains invariant to the substitutions
It is clear that inside the product terms, we have a different set of rules. Hence the Corollary applies in the sense that if is a number theoretic function, then the
invariance applies.
However, when we consider rational functions outside of the product, we find that simple arithmetic operations do apply, hence (7).
Equation (7) can be formed as a series:
By using the well know asymptotyic expansion (Sirling-Bernoulli expansion) we get:
where,
are the Bernoulli numbers.
Note also that is invariant to the labelling of factors since each factor just permutates the same rational fractions.
THEOREM: Every sequence of primes for which there exists rational functions such that
forms an infinite sequence.
Proof:
2. The Rational Mapping
Let be arithmetic functions for example the divisor sums, Totient, and other multiplicative forms, with
The mapping
assigns to each prime a rational “phase parameter.” The set of conforming primes
is
Define the first phase map (reduced modulo
into the convergence interval)
For a fixed first prime
that defines the first phase
, impose the condition between two successive primes,
. This guarantees that
and
belong to the same phase-field
The indicator field is
Then, construct a first field partition
:
Then, in the general infinite sequence of integers,
, that satisfy the cotangent relation from [4, p.42, 1.411 (7)] using the first phase,
The expansion of the function (2) can be partitioned using the field:
The quadratic governs the equilibrium between primes that belong to the field and those that do not belong.
Since the tangent of is single valued for specified phase condition that governs the selected set of primes, the discrimant must vanish.
Setting the discriminant of (15) to zero gives the resonant relation
If, in addition,
, (the resonance occurs at the field phase), and
Hence the in-field amplitude equals the cotangent of the defining first phase-locked prime, by . This leads to a recursive phenomenon.
3. Recursive Phase generation
Equation (17) defines an iteration since the result is a new mapping
. Hence in general, there exists a
field corresponding to the
prime.
Each admissible prime generates a new phase relation in (3) and a new conforming prime .
This produces an infinite prime ladder:
where each represents a distinct phase state.
4. Infinitude of the Conforming Set
If is multiplicative or periodic on arithmetic progressions, Dirichlet’s theorem guarantees infinitely many primes in each residue class that preserves the rational value . Hence The field of conforming primes is therefore an infinite rational–phase subset of the primes.
5. Geometric and Physical Interpretation
Each corresponds to a phase point on the cotangent lattice. The mapping translates arithmetic structure into angular geometry. The infinite ladder represents a continuous phase-field manifold built from discrete prime anchors. The equilibrium condition (16) ensures reciprocity: the in-field and out-of-field components balance exactly at resonance.
6. Conclusions
I have shown that the primes satisfying the rational functional mapping and the resonance condition form an infinite . Each conforming prime defines a distinct , producing an infinite prime ladder. The cotangent–tangent quadratic provides a unified description of these rational-phase primes, revealing an underlying self-consistent field structure within the infinite set of primes relating to the cotangent function. Note that there are two distinct types of number that allow the number theretic forms of rational functions with integer values.
For example, putting gives an infinite progression of Perfect numbers.
For example, putting gives an infinite progression of Sophie primes.
Examples of a connection between these numbers can be obtained as follows:
The rational trigonometric functions
determines invariants of Perfect Numbers, Sophie Germain primes. In the product formula,
The tangent function is the controlling factor, due to the fact that the products can be made by substitutions of
without changing the result. As long as the rational number theoretic functions chosen for the invariants of
we can write for Sophie primes.
This is the relation for Sophie primes, and so we arrive at: If is a Perfect number, then, the equality applies only when. Since , the sequence of phases will continue ad-infinitum.
Hence the phase angles for both Perfect numbers and Sophie primes is the same in relation to certain rational number theoretic functions.
Funding
This research received no external funding.
Institutional Review Board Statement
“Not applicable”.
Informed Consent Statement
“Not applicable”.
Acknowledgments
I would like to pay respects to all the great mathematicians who worked on this problem. YTo them is owed a lot of gratitude for inspiration.
Conflicts of Interest
The author declares no conflict of interest.
References
- Gradshteyn, I.S.; Ryzhik, I.M. Table of Integrals, Series, and Products, 7th ed.; Zwillinger, D., Jeffrey, A., Eds.; Academic Press: Cambridge, MA, USA, 2007.
- Dirichlet, P.G.L. — Beweis des Satzes, dass jede unbegrenzte arithmetische Progression, deren erstes Glied und Differenz ganze Zahlen ohne gemeinschaftlichen Faktor sind, unendlich viele Primzahlen enthält (1837).
- Hardy, G. H., Littlewood, J. E. — Some problems of ‘Partitio Numerorum’ III: On the expression of a number as a sum of primes (1923).
- Anthony, M. M. — Principles of Causal Conspiracy (2025 draft), internal notes.
- Leonhard Euler; “Institutiones calculi differentialis cum eius usu in analysi finitorum ac doctrina serierum, volume 1”.
- C.F. Gauss; “Theoria residuorum biquadraticorum, Commentatio secunda;” Königlichen Gesellschaft der Wis-senschaften zu Göttingen, 1863, 95 - 148.
- Michael M. Anthony; Consequences of Invariant Functions for the Riemann hypothesis; SCIRP; Document ID: 5302512-20241007-102003-9957. 2024.
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).