Preprint
Article

This version is not peer-reviewed.

Relativistic Algebra over Finite Fields

A peer-reviewed article of this preprint also exists.

Submitted:

27 May 2025

Posted:

28 May 2025

Read the latest preprint version here

Abstract
We present a formal reconstruction of number systems over a finite field \( \mathbb{F}_p \), based on the principle of relational finitude. Rather than assuming actual infinity, we define arithmetic and algebra as observer-dependent constructs grounded in finite field symmetries. The conventional number classes–integers, rationals, reals, and complex numbers–are reinterpreted as pseudo-numbers, expressed relationally with respect to a chosen reference frame. We define explicit mappings for each number class, preserving their algebraic and computational properties while eliminating ontological dependence on infinite structures. This approach establishes a finite, coherent foundation for mathematics and physics in ontologically finite informational systems.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

A growing body of work in mathematics and physics suggests that foundational structures are best understood through a relational or relativistic lens [1,2,3]. In such a paradigm, mathematical entities acquire meaning not as intrinsic absolutes but through their role within a system defined by internal symmetries and reference frames. Constants like 0, 1, or i are not metaphysical primitives, but relational markers—origins, units, or axes—assigned by a chosen framing.
This perspective invites a re-evaluation of one of the most entrenched assumptions in mathematics: the acceptance of actual infinity. From real analysis to Hilbert spaces, infinity has been treated as foundational, despite its lack of empirical or computational realization. Under a relational view, such constructs may instead be interpreted as emergent limits or symbolic artifacts—arising when finite systems attempt to encode relationships that exceed their internal scope.
In previous work [4], we argued that concepts like infinity, randomness, and undecidability are not ontological features of nature, but epistemic placeholders—signals of representational saturation in finite informational systems. Here, we extend this view into a concrete formalism: a relativistic algebra constructed entirely over a finite field F p , with observer-relative arithmetic and emergent pseudo-numbers.
The present framework resonates with several contemporary perspectives that question the ontological status of the continuum and advocate for finitely constructed alternatives. In particular, Smolin has emphasized the need for a relational, observer-dependent formulation of physical laws, suggesting that the continuum is merely an idealization beyond the reach of internal observers [5,6]. Similarly, D’Ariano and collaborators have reconstructed quantum theory from finite, informationally grounded axioms, demonstrating that core features of quantum mechanics can emerge without invoking infinite-dimensional Hilbert spaces [7]. From a mathematical standpoint, the approach aligns with the ultrafinitist program developed by Benci and Di Nasso, which offers a rigorous alternative to classical cardinality through the theory of numerosities and bounded arithmetic [8,9].
Furthermore, the ultrafinitist school—pioneered by Yessenin-Volpin and Parikh—takes finitude even further by denying the meaningful existence of “too large” numbers and insisting on feasibility as a foundational constraint. Formalizations of ultrafinitism and feasibility arithmetic appear in works such as [10,11,12,13], which explore the proof-theoretic and computational consequences of enforcing strict constructive bounds on arithmetic.
Ultrafinitism enforces an a priori cutoff on numerical existence—only those magnitudes deemed “feasible” within a human or machine resource bound are admitted. By contrast, our relativistic framework treats finiteness not as a hard barrier but as a contextual framing condition: We allow arbitrarily large numbers, so “size” is always relative to the chosen frame. Infinite structures, such as integers and rationals emerge asymptotically or as coordinate projections, rather than being forbidden. Arithmetic operations become internal symmetries of a finite system, rather than operations constrained by external feasibility checks. This shift replaces the ultrafinitist’s absolute feasibility threshold with a relational notion of scope: any number “exists” within some finite frame, while “infinity” itself appears as a relative point beyond the horizon of observability and algebraic accessibility.
To support this framework, we further draw upon several key developments in mathematics and physics. The foundational critique of actual infinity has been explored in works such as [14,15], which emphasize the constructive and finitist approaches to mathematics. The relational perspective on mathematical objects aligns with category theory [1], where objects are defined by their morphisms and relationships rather than intrinsic properties. Additionally, the parallels between relativistic mathematics and modern physics are inspired by the symmetry principles in [2,3], which highlight the role of invariance and frame-dependence in physical laws. Finally, the informational limits of finite systems and their implications for mathematical representation are discussed in [16,17].

2. Finite Field Framing

Let F p = { 0 , 1 , 2 , , p 1 } be the finite field of integers modulo an odd prime p. The elements of F p form a complete and closed set of relational representations of F p under modular addition, multiplication and exponentiation. However, the specific numeric labels assigned to these elements—particularly the designation of 0 and 1 as the additive and multiplicative identities—are intrinsically relative and carry no absolute meaning within the field itself. The field F p is invariant under relabeling of its elements via any bijective affine transformation of the form
k a · k + b mod q ,
where a F p × and b F p . Such transformations preserve the field structure and allow any element to be reinterpreted as the origin. In this sense, the element labeled 0 is not uniquely privileged; it simply represents the additive identity with respect to a chosen reference frame. The same applies to the label 1, which identifies the multiplicative unit only relative to a particular scaling.
Recall that choosing a “frame” in F p consists of picking two distinguished elements
0 = a , 1 = b , b 0 ,
and then defining relabeled addition and multiplication by
x y : = a + b ( x a ) / b + ( y a ) / b , x y : = a + b ( x a ) / b · ( y a ) / b ,
where divisions are in the original field F p .
Theorem 1
(Frame-Invariance). Let F p be a finite field, and let two frames ( 0 , 1 ) and ( a , b ) be related by the affine bijection
ϕ : F p F p , ϕ ( x ) = a + b x , b 0 .
Then ϕ is a ring isomorphism between F p , + , · and F p , , . Consequently, any polynomial identity
P x 1 , , x n = 0 holds in the standard frame
if and only if the “relabeled” identity
P ϕ 1 ( X 1 ) , , ϕ 1 ( X n ) = 0 holds in the ( a , b ) - frame ,
where X i = ϕ ( x i ) .
Proof. 
Since b 0 , ϕ is a bijection with inverse ϕ 1 ( X ) = ( X a ) / b . For any x , y F p ,
ϕ ( x + y ) = a + b ( x + y ) = a + b x a + b y = ϕ ( x ) ϕ ( y ) ,
and similarly
ϕ ( x y ) = a + b ( x y ) = a + b x a + b y = ϕ ( x ) ϕ ( y ) .
Thus, ϕ preserves addition and multiplication, so it is a ring isomorphism. It follows immediately that any algebraic (polynomial) relation valid in one frame is carried over to the other by conjugation with ϕ , establishing frame-independence of all algebraic identities. □
Therefore, in the absence of an externally imposed or contextually declared frame—such as one defined by a designated pair ( 0 , 1 ) —the labels in F p are relational rather than absolute. The roles of “zero” and “one” are thus not the fundamental properties of the elements themselves, but a consequence of the system’s framing, making all representations in F p symmetric and interchangeable under coordinate transformation. To define our system unambiguously, we must specify a reference frame or coordinate system ( 0 , 1 ) within the context of F p , which then becomes a framed finite ring F p ( 0 , 1 ) . We will henceforth assume all such systems to be framed systems F p ( 0 , 1 ) and will denote the corresponding finite ring as F p for simplicity, unless explicitly stated otherwise.

3. Finite Field as Discrete Geometric Structure

Let p be an odd prime and let F p denote the finite field with p elements [18]. The additive group ( F p , + ) is a cyclic group of order p, and the multiplicative group of nonzero elements ( F p × , · ) is a cyclic group of order p 1 [19]. We associate the cardinality degree of freedom p and the three fundamental arithmetic operations with 4 distinct symmetry classes in a symbolic geometry as in [20]:
  • 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 [21].
The choice of cardinality itself defines a linear—radial—degree of translation, and each cyclic operation corresponds to a spherical axis of rotational transformation in a four-dimensional abstract symmetry space. For a fixed odd prime p, the described mathematical construct forms the geometric scaffold of a discrete spheroidal system. The three spherical axes are mutually orthogonal, but algebraically dependent forming a 2D spheroid in the 4D symmetry space.
The resultant 2D spheroid for F 13 is depicted in Figure 1, where the prime meridian depicts the additive group ( F 13 , + ) and the latitudes represent multiplicative group ( F 13 × , · ) generated by the minimum multiplicative generator g min = 2 [20].

4. Pseudo-Numbers

4.1. Pseudo-Integers

Define a mapping k : Z F p , with k ( z ) = z mod p . This wraps Z onto F p . The observer, located at 0 and bounded by horizon H p , perceives the wrapped axis as infinite. Thus, the apparent integer line emerges as a pseudo-integer class Z / F p , where negation, order, and comparison are reconstructed locally [22].
The resulting class of relativistic pseudo-integers Z / F p exhibits all the characteristic properties of the conventional integer set Z , including sign, order, addition, subtraction and multiplication. This framework allows us to recover the intuitive and logical structure of integers — including signed quantities and magnitude comparison — entirely within the finite, self-contained system F p , while preserving consistency with its modular arithmetic.

4.2. Pseudo-Rationals

Let
Q p : = a b a Z , b = i k i , k i F p × .
The corresponding field value is
k a b : = a · b 1 mod p .
Multiple representations can map to the same k F p , forming equivalence classes. We show Q p is dense in Q under a metric induced by bounded denominators b = ( p 1 ) n [23]. For any q Q and ϵ > 0 , there exists q Q p such that | q q | < ϵ .
The validity of such definition is ensured by the fact that all elements k i constituting the denominator product b = i k i have a multiplicative inverse k i 1 F p × . A selection of some simple examples of such pseudo-rational numbers is depicted in Figure 3, where for each position along the prime meridian q = a / b Q p indicated as a black label on top, the corresponding finite field element k ( q ) F p is indicated as purple label on the bottom.
Proposition 1.
Let p > 2 be an odd prime number, and let q = a / b Q be any conventional rational number. Then for any ϵ > 0 , there exists an integer n N and an integer x Z such that
a b x ( p 1 ) n < ϵ .
Proof. 
Let a b Q be given, and let ϵ > 0 be arbitrary small number.
Since p is a fixed prime, the expression ( p 1 ) n grows without bound as n . Therefore, there exists an integer n N such that
1 ( p 1 ) n < ϵ .
Now consider the set of rational points of the form
k ( p 1 ) n | k Z ,
as illustrated in Figure 4. This set is a uniform grid of rational numbers with step size 1 ( p 1 ) n , which is less than ϵ by construction. There exists therefore an integer x Z such that
a b x ( p 1 ) n < ϵ ,
which completes the proof. □
It is very important to reiterate the meaning of this construct from an ontological viewpoint. More specifically, we stipulate that what actually “exists” are the p representations of the finite field F p , while the derivative class of pseudo-rationals q Q p constitute an abstract mathematical construct derived from the inherent relational properties of the framed instance F p .
In other words, the resultant field of pseudo-rational numbers Q p will exhibit all the properties of the field of conventional numbers Q and can further approximate it with any arbitrary precision. Furthermore, for an observer with a limited observability horizon and sufficiently large values of cardinality p, the pseudo-rational field Q p becomes completely indistinguishable from its conventional counterpart, as all the desired rational numbers of the form q = a / b , where b < p are represented not approximately, but exactly within the scope of the pseudo-rational numbers Q p . In classical mathematics, the field of real numbers R is introduced to enable the formulation of continuous functions, calculus, and metric spaces—tools indispensable for modeling physical phenomena and abstract structures alike. However, the real number line is defined as an uncountable, infinitary continuum, an ontological commitment that conflicts with the finite and relational framework we adopt in this study. Nonetheless, our need for continuous approximation and proportional reasoning persists, particularly in describing geometric constructs, dynamic systems, and analytic behaviors. Our approach is therefore pragmatic and epistemic rather than metaphysical. We seek to construct a class of pseudo-real numbers that fulfills the operational role of R without invoking actual infinity.

4.3. Pseudo-Reals

Define truncated pseudo-rationals:
Q p H = [ x , n ] : 0 x < p , 0 n H , [ x , n ] : = x ( p 1 ) n .
This set is finite and totally bounded under the metric:
d H ( [ x , n ] , [ y , m ] ) : = x ( p 1 ) n y ( p 1 ) m .
Define R p as the closure of Q p H . We show all computable real numbers can be approximated within 2 k by some element [ x , n ] Q p H , where H k log 2 p [24].
Proposition 2
(Finite Total Boundedness). For each fixed H, the metric space Q p H , d H is finite and thus totally bounded.
Proof. 
Since 0 x < p and 0 n H , there are ( P ) × ( H + 1 ) elements in Q p H . Any finite metric space is trivially totally bounded. □
Theorem 2
(Approximation of Computable Reals). Let r R be a computable real number. For any integer k 1 there exist integers a k , b k with b k 0 such that
r a k b k < 2 k .
Moreover, if the observer’s horizon H satisfies
H k log 2 p ,
then one can construct [ x k , n k ] Q p H with
r [ x k , n k ] < 2 k 1 .
In order to prove Theorem 2 we first show that every Cauchy sequence ( x n ) Q H , p converges in R p . The key step is a uniform bound on the number of divisions in the Euclidean algorithm.
Lemma 1
(Euclidean-algorithm exponent bound). Let p be a prime and suppose a , b { 1 , 2 , , p 1 } . If the Euclidean algorithm applied to ( a , b ) produces k nonzero remainders before terminating, then
k log 2 ( p ) + 1 .
Proof. 
At each step of the Euclidean algorithm, if ( r i ) are the successive remainders with r 0 = a , r 1 = b , r i + 1 = r i 1 mod r i , then
r i 1 = q i r i + r i + 1 , 0 r i + 1 < r i ,
and q i 1 . It is known (Lamé’s theorem) that the worst-case sequence of quotients ( q i ) all equal 1, which yields the Fibonacci-type descent [25].
r i + 1 r i 1 r i ,
so that
r k F k + 1 ,
where F n is the n-th Fibonacci number. Since r k 1 and F n 2 ( n 2 ) for n 2 , termination after k steps implies
2 k 1 F k + 1 p 1 k 1 log 2 ( p 1 ) < log 2 ( p ) ,
hence k log 2 ( p ) + 1 . □
Proof 
(Proof of Theorem 2 (Completeness of R p )). Let ( x n ) Q H , p be a Cauchy sequence with respect to the metric
d H a / b , c / d = a d b c / b d ,
where | · | is taken in the integer sense and we require a , b , c , d H . By the Cauchy property, for any ϵ > 0 there exists N such that for all m , n N ,
d H ( x m , x n ) < ϵ .
Write x n = a n / b n in lowest terms. Apply the Euclidean algorithm to each pair ( a n , b n ) to obtain the continued-fraction expansion
a n b n = q n , 0 + 1 q n , 1 + 1 + 1 q n , k n ,
with k n log 2 ( p ) + 1 by Lemma 1. Truncating at the J–th convergent yields a rational p n , J q n , J satisfying the standard bound
a n b n p n , J q n , J < 1 q n , J 2 .
Since q n , J b n H , for any chosen J > log 2 ( H / ϵ ) we get
x n p n , J q n , J < 1 H 2 < ϵ .
Thus, ( x n ) is a Cauchy sequence in the complete metric space R , hence converges to some real limit L. By construction of R p as the metric completion of Q H , p , this same limit L defines an element of R p . Therefore, every Cauchy sequence in Q H , p converges in R p , proving completeness. □
Recall that R p is defined as the metric completion of the set
Q H , p = a / b | a , b { 1 , 2 , , H } F p , gcd ( a , b ) = 1
equipped with the metric
d H a / b , c / d = | a d b c | b d .
Proposition 3
(Compactness of R p ). R p is a compact metric space.
Proof. 
We invoke the standard characterization of compactness in metric spaces [26]:
Theorem. A metric space is compact if and only if it is complete and totally bounded.
  • By Theorem 2, R p is complete: every Cauchy sequence in Q H , p converges to a point of R p .
  • Proposition 2 establishes that Q H , p is totally bounded. Since R p is the closure (completion) of Q H , p , it too is totally bounded.
Therefore, R p , being both complete and totally bounded, is compact. □
The resulting pseudo-real field R p is thus defined as the topological closure of Q p under modular convergence. For any finite observer with bounded resolution and limited horizon of observability, R p is indistinguishable from the conventional real number continuum.
In conclusion, the field of pseudo-real numbers R p is not a metaphysical continuum but a layered epistemic utilitarian construct. It combines:
  • Exact pseudo-reals that satisfy algebraic equations within F p , and
  • Approximated pseudo-reals that are limits of converging sequences in Q p .
This framework provides all the functional properties of the real numbers—continuity, density, and completeness—without invoking actual infinity. It affirms that, in a finite and informationally complete universe, continuum-like behavior is a pragmatic illusion emerging from local reasoning over a fundamentally finite arithmetic substrate. Having established the construction of pseudo-integers, rationals and reals over the finite field F p as relativistic, frame-dependent analogs of their classical counterparts, we seek to further extend this framework to encompass the algebraic closure of the pseudo-real field. In conventional mathematics, the introduction of complex numbers C is necessitated by the absence of solutions to certain polynomial equations, such as x 2 + 1 = 0 , within the real numbers. Analogously, in the finite framed context, we are motivated to introduce complex-like elements in order to achieve closure under operations that are otherwise impossible within the pseudo-rational or alone.
Moreover, the construction of a relativistic complex plane enables the representation of rotations, oscillations, and other phenomena that are fundamental in both mathematics and physics, all within a finite and self-contained system. This approach not only mirrors the classical extension from R to C , but also demonstrates that the essential properties and utility of complex numbers can be realized as emergent features of a finite, relational arithmetic—thereby reinforcing our framework’s central theme of relativistic, context-dependent number systems.

5. Complex Plane over Finite Framed Field

As is commonly known, the field of real numbers R does not contain any solutions of certain polynomial equations, such as the prominent equation x 2 + 1 = 0 . But that is not the case for many finite fields F p , where depending on the value and properties of their cardinality P, such solutions can readily exist. For example, in the finite field Z 5 , the equation x 2 + 1 = 0 has two solutions: x = 2 and x = 3 . More generally, it is evident that the equation x 2 + 1 = 0 can be satisfied in a finite field F p if and only if P 1 is devisable by 4, or in other words p 1 mod 4 . This is due to the fact that the multiplicative group of non-zero elements in such fields is cyclic and contains elements—and the corresponding rotational symmetry—of order 4, which allows for the existence of square roots of 1 . In this case, we can define a special element i F p that satisfies the equation i 2 + 1 = 0 . The element i is not unique, instead we have a pair of pseudo-integer elements i and i in Z / F p that satisfy the equation, in the same way as we have pairs x and x of solutions for quadratic equations in the conventional complex plane C .
Let us now observe the “North Pole” frame of reference of the spherical representation of the finite field F p with its prime meridian of pseudo-reals R p forming the horizontal axis around the origin. The order-4 rotational symmetry of the finite field F p can be represented as a vertical axis of imaginary numbers c = z · i , where z Z , that are perpendicular to the prime meridian, as illustrated in Figure 5. The imaginary numbers c are represented by their respective red labels, while the corresponding elements k ( c ) are depicted in purple.
More generally, we can define a class of pseudo-complex numbers C p as the Cartesian product of the pseudo-reals R p and the imaginary numbers r · i , r R . The pseudo-complex numbers are defined as follows:
C p : = c = a + b · i | a , b R p ,
where a and b are the real and imaginary components of the pseudo-complex number c, respectively. The pseudo-complex numbers can be represented as points in the complex plane, where the horizontal axis corresponds to the pseudo-reals R p and the vertical axis corresponds to the imaginary numbers r · i . The pseudo-complex numbers form a field and can be added, subtracted, multiplied, and divided in a manner analogous to conventional complex numbers, with the additional consideration of their finite field properties.
The pseudo-complex numbers form a relativistic algebraic field and can be added, subtracted, multiplied, and divided in a manner analogous to conventional complex numbers, subject to the selection of the arbitrary frame of reference, as well as the properties and constraints of the underlying finite field.

6. Unification and Ontological Perspective

We assert that only the p representations of F p truly exist. All pseudo-number classes are epistemic constructs derived from relational symmetries and observer framing. The observer’s bounded horizon H p induces the illusion of infinite domains [27].

6.1. Infinity as the Unknowable “Far-Far Away”

Let us revisit the ontological concept of infinity as described in [4]. In the previous sections, we have established the finite framed field F p as an abstract pseudo-sphere F p ( 0 , 1 ) with a limited-horizon observer at its origin 0. We would like now to consider the geometric point on our pseudo-sphere that is the furthest away from the observer. This point is evidently the South Pole—the antipodal point on the prime meridian—of the pseudo-sphere, which we will denote as s P for now. We would like to emphasize the following important properties of s P .
  • s P is a unique point on the pseudo-sphere that is the farthest away from the observer at 0.
  • s P 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, s P is algebraically inaccessible to the observer at 0, in the sense that s P F p , Q p , and cannot be reached by any finite number of arithmetical steps along the surface of the pseudo-sphere.
We would like to provide a formal proof of the less evident Property 3 as follows.
Theorem 3
(No South Pole in F p ). Let P > 2 be an odd prime. Then the only solution s Z P to
2 s 0 ( mod P )
is s 0 . Equivalently, there is no nonzero pseudo-rational q Q P whose image in Z P has additive order 2.
Proof.
  • Since p is prime, the additive group ( F p , + ) is cyclic of order p. An element s F p has order 2 precisely if
    2 s 0 ( mod P ) .
  • Because gcd ( 2 , p ) = 1 , multiplication by 2 is invertible in F p . Hence, from 2 s 0 ( mod p ) it follows immediately that s 0 ( mod P ) . There is no nontrivial order-2 element.
  • By definition, each pseudo-rational q = a b Q p is represented in the field by
    k ( q ) = a b 1 mod P F p ,
    so Q p F p under the embedding k. If some q Q p mapped to a nonzero order-2 element s = k ( q ) 0 , then 2 s 0 would force s 0 , a contradiction.
Therefore, no “South Pole” antipodal point exists in Q p or Z p , completing the proof. □
These properties of the geometrical point s P are unmistakably consistent with the properties of the concept of infinity in its conventional sense. This gives us the justification to identify the relativistic antipodal point s P with the concept of infinity in the context of F p , and thus denote it as .
To exemplify, let us now consider the concrete example of p = 13 and the corresponding finite framed field F 13 . We can identify the following values for the constants i, e and π in F 13 :
p = 13 , g min = 2 , i = 5 .
The corresponding visual representation of the finite field F 13 is shown in Figure 6. The figure shows the state space of the finite field F 13 as a circle on a 2D plane, with the major structural elements 1 , 0 , 1 , g min , i , as well as indicated. The antipodal point is located at the South Pole of the pseudo-sphere, which is the farthest point from the observer at 0.

7. Unification over Finite Fields

7.1. Approximate Lie Groups

Continuous Lie groups such as SO ( 2 ) , SU ( n ) , and GL ( n , R ) are approximated in F p by discrete symmetry groups generated by modular exponentiation and cyclic subgroup structures [28].
Let G p F p × be a multiplicative cyclic group of order N ( p 1 ) . The mapping:
θ g θ mod p , θ Z / N Z , g a primitive root ,
approximates continuous rotation e i θ by discrete steps. Similarly, discrete matrix groups over F p , such as GL ( n , F p ) , replicate local algebraic behavior of Lie algebras over reals. These finite analogs converge to their continuous counterparts as p and preserve closure, invertibility, and group action properties locally within observer horizons H p as follows.
Let p be a prime with p 1 ( mod 4 ) , and fix a primitive root g of F p × . Set N = p 1 , and identify the cyclic subgroup
G p = g F p ×
with the “discretized” circle via the map
ϕ : R / 2 π Z G p , ϕ ( θ ) = g k ( θ ) where k ( θ ) = N 2 π θ + 1 2 mod N .
Proposition 4
(Angle-approximation error). For every θ [ 0 , 2 π ) , defining k = k ( θ ) , one has
arg ϕ ( θ ) θ π N ϕ ( θ ) e i θ 2 sin π 2 N π N .
Proof. 
By construction, k N 2 π θ 1 2 , so
arg ϕ ( θ ) θ = 2 π N k θ π N .
Thus, using the chord-arc bound | e i α e i β | = 2 | sin α β 2 | ,
ϕ ( θ ) e i θ = 2 sin 1 2 ( arg ϕ ( θ ) θ ) 2 sin π 2 N π N .
Proposition 5
(Group-law error). For any θ 1 , θ 2 [ 0 , 2 π ) , let k i = k ( θ i ) and set ϕ i = ϕ ( θ i ) . Then
ϕ 1 ϕ 2 = ϕ ( θ 1 + θ 2 ) · δ with arg ( δ ) 2 π N ,
and hence
ϕ 1 ϕ 2 e i ( θ 1 + θ 2 ) 2 π N + O N 2 .
Proof. 
We have
ϕ 1 ϕ 2 = g k 1 + k 2 = g k ( θ 1 + θ 2 ) + r = ϕ ( θ 1 + θ 2 ) g r ,
where the “round-off” exponent | r | = k 1 + k 2 k ( θ 1 + θ 2 ) satisfies
r N 2 π θ 1 k 1 + N 2 π θ 2 k 2 + 1 2 1 2 + 1 2 + 1 2 = 3 2 .
Hence, | r | 1 and arg ( g r ) is a multiple of 2 π N with | arg ( g r ) | 2 π N . Setting δ = g r yields the claimed estimates. The final bound follows by combining ϕ ( θ 1 + θ 2 ) = e i ( θ 1 + θ 2 ) + O ( π N ) from Prop. 4 with | δ 1 | O ( 2 π N ) . □

7.2. Finite Langlands Program

In the usual Langlands philosophy one relates two vast worlds: on the one hand the (infinite) Galois representations of a global field, and on the other the automorphic representations of a reductive group over that field [29,30]. If one accepts that only finite rings Z q can exist, then every “infinite” Galois group must be replaced by its finite quotient
Gal ( F ¯ / F ) Gal ( F ¯ / F ) / N Gal ( F N / F ) Perm ( F N ) ,
and every automorphic representation must likewise factor through a finite group of points
G A F G A F / K N G Z q
for some level K N . In this “finite-Langlands” perspective all objects—Galois data and automorphic forms—are built from the same finite base ring Z q , and the conjectural correspondence becomes a bijection between
finite - quotient Galois representations into G L n ( Z q ) irreducible representations of G ( Z q ) .
From the function-field side one already has a prototype: Drinfeld and Lafforgue proved a global Langlands correspondence for G L n over F q ( T ) , where F q is a finite field, and automorphic forms live on G L n ( F q [ T ] ) [31,32]. There, both Galois representations and automorphic sheaves are intrinsically finite objects—perverse sheaves on moduli stacks over F q and -adic representations of π 1 . This suggests that a genuinely finite-universe version of the Langlands program would reorganise every classical component (Hecke operators, L-functions, trace formulas) into purely combinatorial operations on Z q -modules and finite group characters.
In summary, if one accepts that Z q is the only ontologically primitive object, then the Langlands correspondence reduces to an equivalence of categories between Z q -linear Galois modules and Z q -linear automorphic modules. All “infinite” phenomena (analytic continuation, spectral decompositions) become emergent from the finiteness of Z q through limiting processes within finite-dimensional Z q -vector spaces. Such a viewpoint collapses the traditional dichotomy and recasts Langlands duality as a statement about different frames of reference on a single finite ring.

8. Conclusion

This work reconstructs arithmetic over finite fields as a complete, self-consistent relativistic algebra. Number systems conventionally built on actual infinity are shown to emerge from finite, observer-relative structures in F p . This reformulation provides a robust mathematical language for finite informational systems and supports a shift from absolute to structural foundations in mathematics, mathematics and formal logic.

References

  1. Lane, S.M. Categories for the Working Mathematician; Springer, 1998.
  2. Einstein, A. On the Electrodynamics of Moving Bodies. Annalen der Physik 1905, 17, 891–921. [Google Scholar] [CrossRef]
  3. Noether, E. Invariante Variationsprobleme. Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse.
  4. Akhtman, Y. Existence, Complexity and Truth in a Finite Universe. Preprint 2025. [Google Scholar]
  5. Smolin, L. Time Reborn: From the Crisis in Physics to the Future of the Universe; Houghton Mifflin Harcourt, 2013.
  6. Smolin, L. The Trouble with Physics: The Rise of String Theory, the Fall of a Science, and What Comes Next; Houghton Mifflin Harcourt, 2006.
  7. D’Ariano, G.M. Physics Without Physics: The Power of Information-Theoretical Principles. International Journal of Theoretical Physics 2017, 56, 97–128. [Google Scholar] [CrossRef]
  8. Benci, V.; Nasso, M.D. Numerosities of Labelled Sets: A New Way of Counting. Advances in Mathematics 2003, 173, 50–67. [Google Scholar] [CrossRef]
  9. Benci, V.; Nasso, M.D. A Theory of Ultrafinitism. Notre Dame Journal of Formal Logic 2011, 52, 229–247. [Google Scholar]
  10. Yessenin-Volpin, A.S. The Ultra-Intuitionistic Criticism and the Antitraditional Program for Foundations of Mathematics. Proceedings of the International Congress of Mathematicians.
  11. Parikh, R.J. Existence and Feasibility in Arithmetic. Journal of Symbolic Logic 1971, 36, 494–508. [Google Scholar] [CrossRef]
  12. Sazonov, V.Y. On Feasible Numbers. Logic and Computational Complexity.
  13. Avron, A. The Semantics and Proof Theory of Linear Logic. Theoretical Computer Science 2001, 294, 3–67. [Google Scholar] [CrossRef]
  14. Brouwer, L.E.J. On the Foundations of Mathematics; Springer, 1927.
  15. Weyl, H. Philosophy of Mathematics and Natural Science; Princeton University Press, 1949.
  16. Chaitin, G. Thinking about Gödel and Turing: Essays on Complexity, 1970-2007. World Scientific 2007. [Google Scholar]
  17. Lloyd, S. Ultimate Physical Limits to Computation; Nature, 2000.
  18. Burton, D.M. Elementary Number Theory, 7th ed.; McGraw-Hill, 2010.
  19. Dummit, D.S.; Foote, R.M. Abstract Algebra, 3rd ed.; John Wiley & Sons, 2004.
  20. Akhtman, Y. Canonical Frame of Reference on Symbolic Spheroids in Finite Fields of Prime Cardinality. Preprint 2025. [Google Scholar]
  21. Artin, M. Algebra, 2nd ed.; Pearson, 2011.
  22. Knuth, D.E. The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd ed.; Addison-Wesley, 1997.
  23. Serre, J.P. Local Fields; Vol. 67, Graduate Texts in Mathematics, Springer: New York, 1979. [Google Scholar]
  24. Turing, A.M. On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 1936, 42, 230–265. [Google Scholar]
  25. Lamé, G. Mémoire sur la résolution des équations numériques. Comptes Rendus de l’Académie des Sciences 1844, 19, 867–872. [Google Scholar]
  26. Rudin, W. Principles of Mathematical Analysis, 3rd ed.; McGraw-Hill: New York, 1976. [Google Scholar]
  27. Barwise, J.; Perry, J. Situations and Attitudes; MIT Press, 1985.
  28. Hall, B.C. Lie Groups, Lie Algebras, and Representations: An Elementary Introduction, 2nd ed.; Vol. 222, Graduate Texts in Mathematics, Springer, 2015.
  29. Langlands, R.P. Problems in the Theory of Automorphic Forms; Springer-Verlag, 1970.
  30. Borel, A. Automorphic Forms on Reductive Groups; Springer-Verlag, 1979.
  31. Drinfeld, V.G. Elliptic modules. Mathematics of the USSR-Sbornik 1974, 23, 561–592. [Google Scholar] [CrossRef]
  32. Lafforgue, L. Chtoucas de Drinfeld et correspondance de Langlands. Inventiones mathematicae 2002, 147, 1–241. [Google Scholar] [CrossRef]
Figure 1. State diagram for finite framed field F 13 as a 2D spheroid in 4D symmetry space combining the additive—along the prime meridian—, and multiplicative—along the latitudes for multiplicative generator g min = 2 —symmetries.
Figure 1. State diagram for finite framed field F 13 as a 2D spheroid in 4D symmetry space combining the additive—along the prime meridian—, and multiplicative—along the latitudes for multiplicative generator g min = 2 —symmetries.
Preprints 161289 g001
Figure 2. Class of signed pseudo-integers Z over the finite framed field Z 13 . Black labels indicate the newly defined signed integers z Z , while the purple labels represent the corresponding elements k ( z ) Z 13 . The blue line indicates the periodicity of the finite field. The unlabeled gray dots indicate the off-axis elements of Z 13 as they are observed from the top of the 2D spheroid described in Figure 1.
Figure 2. Class of signed pseudo-integers Z over the finite framed field Z 13 . Black labels indicate the newly defined signed integers z Z , while the purple labels represent the corresponding elements k ( z ) Z 13 . The blue line indicates the periodicity of the finite field. The unlabeled gray dots indicate the off-axis elements of Z 13 as they are observed from the top of the 2D spheroid described in Figure 1.
Preprints 161289 g002
Figure 3. Few examples of rational numbers q Q 13 in a finite framed field Z 13 ( 0 , 1 ) . Note the pseudo-rational numbers 6 / 5 , 12 / 10 as well as 11 / 7 that all represent the exact same element 9 Z 13 ( 0 , 1 ) .
Figure 3. Few examples of rational numbers q Q 13 in a finite framed field Z 13 ( 0 , 1 ) . Note the pseudo-rational numbers 6 / 5 , 12 / 10 as well as 11 / 7 that all represent the exact same element 9 Z 13 ( 0 , 1 ) .
Preprints 161289 g003
Figure 4. Uniform grid of rational numbers of the form q = k ( p 1 ) n with step size 1 ( p 1 ) n . Here, we have p = 13 and n = 1 . Black labels indicate the pseudo-rational numbers q Q 13 , while the purple labels represent the corresponding finite field elements k ( q ) Z 13 . The blue line indicates the periodicity of the finite field.
Figure 4. Uniform grid of rational numbers of the form q = k ( p 1 ) n with step size 1 ( p 1 ) n . Here, we have p = 13 and n = 1 . Black labels indicate the pseudo-rational numbers q Q 13 , while the purple labels represent the corresponding finite field elements k ( q ) Z 13 . The blue line indicates the periodicity of the finite field.
Preprints 161289 g004
Figure 5. Pseudo-complex numbers plane C p in a finite framed field Z 13 ( 0 , 1 ) . Horizontal axis represents the pseudo-reals R p on the prime meridian and the vertical axis represents the imaginary numbers c = z · i indicated by their respective red labels. The corresponding elements k ( c ) are depicted in purple. The blue line indicates the periodicity of the finite field.
Figure 5. Pseudo-complex numbers plane C p in a finite framed field Z 13 ( 0 , 1 ) . Horizontal axis represents the pseudo-reals R p on the prime meridian and the vertical axis represents the imaginary numbers c = z · i indicated by their respective red labels. The corresponding elements k ( c ) are depicted in purple. The blue line indicates the periodicity of the finite field.
Preprints 161289 g005
Figure 6. State space of a finite framed field F 13 , visualized as a circle on a 2D plane with the major structural elements 1 , 0 , 1 , g min , i , as well as indicated.
Figure 6. State space of a finite framed field F 13 , visualized as a circle on a 2D plane with the major structural elements 1 , 0 , 1 , g min , i , as well as indicated.
Preprints 161289 g006
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated