Submitted:
24 June 2025
Posted:
25 June 2025
Read the latest preprint version here
Abstract
Keywords:
1. Introduction

2. Finite Field Framing
3. Finite Field as Discrete Geometric Structure
- Counting—defines the number of elements in the ring.
- Addition—defines rotational symmetry on a linear periodic axis.
- Multiplication—defines scaling symmetry on a multiplicative periodic axis.
- Exponentiation—defines cyclic phase-like symmetry from repeated powers of a generator [22].
4. Pseudo-Numbers
4.1. Pseudo-Integers
4.2. Pseudo-Rationals
4.3. Pseudo-Reals
- By Theorem 4.1, is complete: every Cauchy sequence in converges to a point of .
- Proposition 2 establishes that is totally bounded. Since is the closure (completion) of , it too is totally bounded.
- Pseudo-rationals that are finite rational numbers defined in Section 4.2,
- Finite-algebraic numbers that satisfy algebraic equations within , and
- Structural invariants are pseudo-real numbers identifiable by their respective structural roles in , and can be associated with, or derived from, the classical transcendental constants and e. The detailed treatment of these constants will be provided the companion paper [18].
4.4. Scale-Periodicity of
4.5. Complex Plane over Finite Framed Field
5. Unification and Ontological Perspective
5.1. Infinity as the unknowable “far-far away”
- is a unique point on the pseudo-sphere that is the farthest away from the observer at 0.
- is invisible to the observer at 0, that is to say that is located beyond any conceivable definition of the observer’s limited observability horizon.
- Finally, is algebraically inaccessible to the observer at 0, in the sense that , and cannot be reached by any finite number of arithmetical steps along the surface of the pseudo-sphere.
- Since p is prime, the additive group is cyclic of order p. An element has order 2 precisely if
- Because , multiplication by 2 is invertible in . Hence, from it follows immediately that . There is no nontrivial order-2 element.
- By definition, each pseudo-rational is represented in the field byso under the embedding k. If some mapped to a non-zero order-2 element , then would force , a contradiction.
5.2. Finite Langlands Program
6. Conclusions
Notation Glossary
- Finite field of prime cardinality p
- The class of pseudo-rational numbers over the finite field (Definition 1)
- The class of truncated pseudo-rational numbers over the finite field with a bounded scale H (Definition 2)
- The class of pseudo-real numbers over the finite field (Definition 2)
- The class of pseudo-complex numbers over the finite field (Definition 3)
References
- Lane, S.M. Categories for the Working Mathematician; Springer, 1998.
- Einstein, A. On the Electrodynamics of Moving Bodies. Annalen der Physik 1905, 17, 891–921.
- Noether, E. Invariante Variationsprobleme. Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse 1918, pp. 235–257.
- Akhtman, Y. Existence, Complexity and Truth in a Finite Universe. Preprints 2025. [CrossRef]
- Smolin, L. Time Reborn: From the Crisis in Physics to the Future of the Universe; Houghton Mifflin Harcourt, 2013.
- Smolin, L. The Trouble with Physics: The Rise of String Theory, the Fall of a Science, and What Comes Next; Houghton Mifflin Harcourt, 2006.
- D’Ariano, G.M. Physics Without Physics: The Power of Information-Theoretical Principles. International Journal of Theoretical Physics 2017, 56, 97–128. [CrossRef]
- Benci, V.; Nasso, M.D. Numerosities of Labelled Sets: A New Way of Counting. Advances in Mathematics 2003, 173, 50–67. [CrossRef]
- Benci, V.; Nasso, M.D. A Theory of Ultrafinitism. Notre Dame Journal of Formal Logic 2011, 52, 229–247.
- Yessenin-Volpin, A.S. The Ultra-Intuitionistic Criticism and the Antitraditional Program for Foundations of Mathematics. Proceedings of the International Congress of Mathematicians 1960, pp. 234–250. [CrossRef]
- Parikh, R.J. Existence and Feasibility in Arithmetic. Journal of Symbolic Logic 1971, 36, 494–508.
- Sazonov, V.Y. On Feasible Numbers. Logic and Computational Complexity 1997, pp. 30–51. [CrossRef]
- Avron, A. The Semantics and Proof Theory of Linear Logic. Theoretical Computer Science 2001, 294, 3–67. [CrossRef]
- Brouwer, L.E.J. On the Foundations of Mathematics; Springer, 1927.
- Weyl, H. Philosophy of Mathematics and Natural Science; Princeton University Press, 1949.
- Chaitin, G. Thinking about Gödel and Turing: Essays on Complexity, 1970-2007. World Scientific 2007.
- Lloyd, S. Ultimate Physical Limits to Computation; Nature, 2000.
- Akhtman, Y. Geometry and Constants in Finite Ring Continuum. Preprints 2025.
- Akhtman, Y. Finite Ring Continuum at Composite Cardinalities. Preprints 2025.
- Burton, D.M. Elementary Number Theory, 7th ed.; McGraw-Hill, 2010.
- Dummit, D.S.; Foote, R.M. Abstract Algebra, 3rd ed.; John Wiley & Sons, 2004.
- Artin, M. Algebra, 2nd ed.; Pearson, 2011.
- Knuth, D.E. The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd ed.; Addison-Wesley, 1997.
- Serre, J.P. Local Fields; Vol. 67, Graduate Texts in Mathematics, Springer: New York, 1979.
- Barwise, J.; Perry, J. Situations and Attitudes; MIT Press, 1985.
- Langlands, R.P. Problems in the Theory of Automorphic Forms; Springer-Verlag, 1970.
- Borel, A. Automorphic Forms on Reductive Groups; Springer-Verlag, 1979.
- Drinfeld, V.G. Elliptic modules. Mathematics of the USSR-Sbornik 1974, 23, 561–592. [CrossRef]
- Lafforgue, L. Chtoucas de Drinfeld et correspondance de Langlands. Inventiones mathematicae 2002, 147, 1–241. [CrossRef]







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/).