Submitted:
04 June 2025
Posted:
11 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 [3].
4. Pseudo-Numbers
4.1. Pseudo-Integers
4.2. Pseudo-Rationals
4.3. Pseudo-Reals
- By Theorem 2, 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.
- Exact pseudo-reals that satisfy algebraic equations within , and
- Approximated pseudo-reals that are limits of converging sequences in .
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 nonzero order-2 element , then would force , a contradiction.
5.2. Approximate Lie Groups
5.3. Finite Langlands Program
6. Conclusion
References
- Yosef Akhtman. Existence, complexity and truth in a finite universe. Preprints, May 2025.
- Yosef Akhtman. Geometry and constants in finite relativistic algebra. Preprints, June 2025.
- Michael Artin. Algebra. Pearson, 2nd edition, 2011.
- Arnon Avron. The semantics and proof theory of linear logic. Theoretical Computer Science, 294(1-2):3–67, 2001.
- Jon Barwise and John Perry. Situations and Attitudes. MIT Press, 1985.
- Vieri Benci and Mauro Di Nasso. Numerosities of labelled sets: A new way of counting. Advances in Mathematics, 173(1):50–67, 2003. [CrossRef]
- Vieri Benci and Mauro Di Nasso. A theory of ultrafinitism. Notre Dame Journal of Formal Logic, 52(3):229–247, 2011.
- Armand Borel. Automorphic Forms on Reductive Groups. Springer-Verlag, 1979.
- L. E. J. Brouwer. On the Foundations of Mathematics. Springer, 1927.
- David M. Burton. Elementary Number Theory. McGraw-Hill, 7th edition, 2010.
- John Cardy. Scaling and renormalization in statistical physics. Cambridge University Press, 1996.
- Gregory Chaitin. Thinking about gödel and turing: Essays on complexity, 1970-2007. World Scientific, 2007.
- Giacomo Mauro D’Ariano. Physics without physics: The power of information-theoretical principles. International Journal of Theoretical Physics, 56(1):97–128, 2017.
- V. G. Drinfeld. Elliptic modules. Mathematics of the USSR-Sbornik, 23(4):561–592, 1974.
- David S. Dummit and Richard M. Foote. Abstract Algebra. John Wiley & Sons, 3rd edition, 2004.
- Albert Einstein. On the electrodynamics of moving bodies. Annalen der Physik, 17:891–921, 1905.
- Brian C. Hall. Lie Groups, Lie Algebras, and Representations: An Elementary Introduction, volume 222 of Graduate Texts in Mathematics. Springer, 2nd edition, 2015.
- Donald E. Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley, 3rd edition, 1997.
- Laurent Lafforgue. Chtoucas de drinfeld et correspondance de langlands. Inventiones mathematicae, 147(1):1–241, 2002. [CrossRef]
- Gabriel Lamé. Mémoire sur la résolution des équations numériques. Comptes Rendus de l’Académie des Sciences, 19:867–872, 1844.
- Saunders Mac Lane. Categories for the Working Mathematician. Springer, 1998.
- Robert P. Langlands. Problems in the Theory of Automorphic Forms. Springer-Verlag, 1970.
- Seth Lloyd. Ultimate Physical Limits to Computation. Nature, 2000. [CrossRef]
- Emmy Noether. Invariante variationsprobleme. Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse, pages 235–257, 1918.
- Rohit J. Parikh. Existence and feasibility in arithmetic. Journal of Symbolic Logic, 36(3):494–508, 1971.
- Walter Rudin. Principles of Mathematical Analysis. McGraw-Hill, New York, 3rd edition, 1976.
- Vladimir Yu. Sazonov. On feasible numbers. Logic and Computational Complexity, pages 30–51, 1997.
- Jean-Pierre Serre. Local Fields, volume 67 of Graduate Texts in Mathematics. Springer, New York, 1979.
- Lee Smolin. The Trouble with Physics: The Rise of String Theory, the Fall of a Science, and What Comes Next. Houghton Mifflin Harcourt, 2006.
- Lee Smolin. Time Reborn: From the Crisis in Physics to the Future of the Universe. Houghton Mifflin Harcourt, 2013.
- Alan M. Turing. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, 42(1):230–265, 1936.
- Hermann Weyl. Philosophy of Mathematics and Natural Science. Princeton University Press, 1949.
- Kenneth G Wilson. Renormalization group and critical phenomena. i. renormalization group and the kadanoff scaling picture. Physical Review B, 4(9):3174–3183, 1971. [CrossRef]
- A. S. Yessenin-Volpin. The ultra-intuitionistic criticism and the antitraditional program for foundations of mathematics. Proceedings of the International Congress of Mathematicians, pages 234–250, 1960.







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