Preprint
Article

This version is not peer-reviewed.

Smith Normal Forms and Matrix Theory over Ordered Pair of Normalized Real Numbers

Submitted:

15 June 2026

Posted:

16 June 2026

You are already at the latest version

Abstract
Ordered pairs of normalized real numbers form a closed arithmetic system once a normalization function is fixed. Their algebraic and matrix-theoretic extensions are governed by a spectral two-channel structure. The normalization function is not specialized: it is only assumed to be continuous, strictly increasing from \( \mathbb{R} \) onto \( (0,1) \), and symmetric in the sense that \( \varphi(x)+\varphi(-x)=1. \) For an OPNs element \( \alpha=(\mu_{\alpha},\nu_{\alpha}) \), we define the spectral-coordinate map \( S_{\varphi}(\alpha)=(p_{\alpha},q_{\alpha}) \), where \( p_{\alpha} = -\varphi^{-1}(\mu_{\alpha}) - \varphi^{-1}(\nu_{\alpha}), \qquad q_{\alpha} = \varphi^{-1}(\mu_{\alpha}) - \varphi^{-1}(\nu_{\alpha}) \). The scalar theory is reorganized as a two-channel real algebra with two primitive idempotents \( e_p \) and \( e_q \). Intrinsically, this algebra is a reduced semisimple Artinian real algebra with exactly two primitive central idempotents. The main result of this paper is an idempotent Smith theory for polynomial matrices over OPNs. Although the polynomial coefficient ring \( \mathcal{O}_{\varphi}[t] \) has zero divisors, every OPNs polynomial matrix admits a Smith normal form whose invariant factors have the two-channel form \( d_i(t)=f_i(t)e_p+g_i(t)e_q, \qquad f_i(t),g_i(t)\in\mathbb{R}[t]. \) The divisibility chain, determinantal ideals, finite-presentation classification over \( \mathcal{O}_{\varphi}[t] \), and uniqueness of these invariant factors are controlled channel by channel, while the resulting invariant factors remain intrinsic OPNs objects. As the constant-matrix shadow of this Smith theory, every rectangular OPNs matrix is equivalent, under invertible OPNs row and column transformations, to a rectangular diagonal matrix whose only possible diagonal entries are \( 1_{\mathcal{O}}, \qquad e_p, \qquad e_q, \qquad 0_{\mathcal{O}}. \) The resulting matrix theory gives canonical descriptions of kernels, images, cokernels, linear systems, determinant theory, the Cayley--Hamilton theorem, minimal polynomial theory, rational canonical classification, regular spectral rectangles, similarity classification, and symmetric matrix inertia.It is also shown that the four-pivot geometry is irreducible: the rank pair controls the stable block-sum monoid, the factorization preorder, orbit dimensions, orbit closures, and the associated determinantal ideal chain. In the polynomial theory, projective rank pairs yield explicit nonfree projective modules over \( \mathcal{O}_{\varphi}[t] \).
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

The theory of Ordered Pair of Normalized Real numbers (OPNs) was introduced by Zhou as a closed arithmetic framework for ordered pairs whose two entries lie in ( 0 , 1 ) [1]. The original construction gives arithmetic operations, inverse operations, powers, roots, elementary functions, ordering, and Cauchy–Schwarz type inequalities in normalized coordinates. The present paper keeps the same normalized setting but reorganizes the algebraic mechanism behind it. The original formulas are closed in ( 0 , 1 ) 2 , but their coordinate expressions, especially multiplication and inverse formulas, are not transparent until the underlying spectral coordinates are separated.
The algebraic core of these formulas is the spectral decomposition induced by S φ . This decomposition leads to a matrix theory over O φ , including matrix equivalence, Smith normal forms, determinant theory, linear systems, similarity, and symmetric congruence. The matrix-theoretic background is the classical theory of matrix equivalence, canonical forms, determinants, invariant factors, and spectral decompositions over fields and principal ideal domains [2,3,4,5]. The module-theoretic background is the structure theory of modules over principal ideal domains and the associated Smith invariant-factor theory [6,7,8,9,10,11].
The scalar observation is simple but powerful, but the main point of the present version is to push it beyond a formal two-channel translation. The paper identifies the intrinsic split semisimple algebra behind OPNs, proves finite module and finite presentation classification theorems, and shows that the four-pivot rank geometry is unavoidable rather than cosmetic. In this sense, the present work should be read as an OPNs reconstruction of several standard parts of linear algebra over split semisimple scalar rings, with the normalization map providing a concrete ordered-pair coordinate model.
Once an admissible normalization function φ is fixed, every OPNs element
α = ( μ α , ν α )
can be represented by two real spectral coordinates
p α = φ 1 ( μ α ) φ 1 ( ν α ) , q α = φ 1 ( μ α ) φ 1 ( ν α ) .
In these coordinates, scalar multiplication, addition, and multiplication reduce to componentwise operations on R × R . The scalar OPNs algebra is therefore a normalized coordinate realization of a two-channel real algebra. This fact explains the existence of two primitive idempotents, two zero-divisor axes, and a complete spectral functional calculus.
The scalar two-channel representation gives the idempotent decomposition. At the matrix level this decomposition produces additional reduction data. A matrix over OPNs has two real spectral components,
A = A p e p + A q e q .
Under row-column equivalence, this decomposition yields a four-pivot reduction theory. A real matrix has only two pivot types, 1 and 0. An OPNs matrix has four:
1 ˜ , e p , e q , 0 ˜ .
The idempotents e p and e q represent one-channel pivots. A pivot equal to 1 1 constrains both spectral channels, a pivot equal to e p constrains only the p-channel, a pivot equal to e q constrains only the q-channel, and a zero pivot constrains neither channel.
The polynomial theory gives the strongest form of the reduction theorem. It is modeled on the classical Smith normal form and the PID module classification theorem [6,7,8,10]. Although O φ [ t ] has zero divisors and is not a principal ideal domain, the primitive idempotents e p and e q split O φ [ t ] into two polynomial PID channels. Consequently polynomial matrices over O φ [ t ] admit idempotent Smith normal forms whose invariant factors are OPNs polynomials of the form f i ( t ) e p + g i ( t ) e q . The four-pivot normal form for ordinary OPNs matrices is the constant-matrix shadow of this polynomial Smith theory. It gives a complete equivalence classification and produces canonical formulas for kernels, images, cokernels, rank defects, determinantal ideals, and solvability of linear systems.
The rest of the paper is organized around a small number of structural reductions. Section 2 develops the scalar spectral algebra, including admissible normalizations, primitive idempotents, zero divisors, and the elementary function calculus. Section 3 proves the matrix splitting principle and the idempotent Smith normal form for polynomial matrices. Section 4 develops the four-pivot rank-pair geometry, including equivalence, stable sums, factorization order, orbit closure, and determinantal recovery. Section 5 treats finite OPNs modules, exact splitting, kernels, images, cokernels, determinantal ideals, and linear systems. Section 6 develops determinant, adjugate, and inverse theory. Section 7 gives characteristic polynomials, invariant factors, rational canonical forms, regular spectral rectangles, and similarity classification. Section 8 treats symmetric matrices, congruence, inertia, and positivity. Section 9 records matrix functions, matrix equations, and gauge equivalence of normalizations. Section 10 concludes.

2. Scalar Spectral Algebra and Elementary Functions

This section fixes the algebraic meaning of the OPNs operations. The normalized pair ( μ , ν ) is not used as a coordinate system in which multiplication is componentwise. Instead, the normalized pair is first sent by S φ to the spectral pair ( p , q ) , the direct product algebra structure of R × R is used there, and the result is transported back to ( 0 , 1 ) 2 . This distinction is essential: the idempotents, the zero-divisor axes, and the later four-pivot matrix form are consequences of the transported product algebra, not of ordinary coordinatewise multiplication in normalized coordinates.
Definition 2.1
(Admissible normalization and spectral coordinates). A function
φ : R ( 0 , 1 )
is called admissible if it is continuous, strictly increasing, onto ( 0 , 1 ) , and satisfies
φ ( x ) + φ ( x ) = 1 , x R .
For a fixed admissible φ, set O φ = ( 0 , 1 ) 2 . For α = ( μ α , ν α ) O φ , define
x α = φ 1 ( μ α ) , y α = φ 1 ( ν α ) ,
and
p α = ( x α + y α ) , q α = x α y α .
The spectral map is
S φ : O φ R 2 , S φ ( α ) = ( p α , q α ) .
The symmetry condition gives φ ( 0 ) = 1 / 2 and
φ 1 ( 1 t ) = φ 1 ( t ) , 0 < t < 1 .
Indeed, putting x = 0 in (2.1) gives 2 φ ( 0 ) = 1 . If t = φ ( x ) , then 1 t = φ ( x ) , and applying φ 1 proves (2.3). Solving the linear system (2.2) gives
S φ 1 ( p , q ) = φ q p 2 , φ p + q 2 , ( p , q ) R 2 .
Thus S φ is a bijection.
The inverse formula also explains why no special choice of logistic, arctangent, or other normalization is needed. The normalization only provides a smooth or topological chart from real spectral data back into the open square ( 0 , 1 ) 2 . Algebraically, all subsequent operations are performed in the spectral variables and are therefore independent of the particular visual shape of φ .
Throughout the paper, R × R is regarded as the direct product real algebra, with
( p 1 , q 1 ) + ( p 2 , q 2 ) = ( p 1 + p 2 , q 1 + q 2 ) , c ( p , q ) = ( c p , c q ) , ( p 1 , q 1 ) ( p 2 , q 2 ) = ( p 1 p 2 , q 1 q 2 ) .
Its zero and unit are ( 0 , 0 ) and ( 1 , 1 ) . The following theorem collects the scalar consequences of this choice. It is the scalar engine of the paper: after it is proved, every later construction is obtained by applying ordinary real algebra separately in the two spectral channels and then recombining the results with e p and e q .
Theorem 2.2
(Scalar spectral algebra theorem). There is a unique real algebra structure on O φ for which S φ is an isomorphism from O φ onto the direct product algebra R × R . Explicitly, for α , β O φ and c R ,
α + β = S φ 1 ( p α + p β , q α + q β ) , c α = S φ 1 ( c p α , c q α ) , α β = S φ 1 ( p α p β , q α q β ) .
The transport identities
S φ ( α + β ) = S φ ( α ) + S φ ( β ) , S φ ( c α ) = c S φ ( α ) , S φ ( α β ) = S φ ( α ) S φ ( β )
hold, with the operations on the right computed componentwise in R × R . The additive and multiplicative identities are
0 ˜ = S φ 1 ( 0 , 0 ) = 1 2 , 1 2 , 1 ˜ = S φ 1 ( 1 , 1 ) = φ ( 0 ) , φ ( 1 ) .
Define the primitive idempotents by
e p = S φ 1 ( 1 , 0 ) , e q = S φ 1 ( 0 , 1 ) .
Then
e p 2 = e p , e q 2 = e q , e p e q = 0 ˜ , e p + e q = 1 ˜ .
Every α O φ has the unique decomposition
α = p α e p + q α e q .
The two coordinate ideals are
I p = { α O φ : p α = 0 } = R e q , I q = { α O φ : q α = 0 } = R e p .
The ideals of O φ are precisely { 0 ˜ } , I p , I q , and O φ . An element α is a unit precisely when p α q α 0 , and it is a zero divisor precisely when p α q α = 0 . In normalized coordinates the two zero-divisor lines are
μ α + ν α = 1 , μ α = ν α .
Proof. 
The bijection S φ allows the direct product algebra structure on R × R to be transported to O φ . Formula (2.5) is exactly this pullback definition. Applying S φ to each formula in (2.5) gives the three identities in (2.6); conversely, the transport identities determine the operations because S φ is injective. Associativity, commutativity, distributivity, compatibility with real scalar multiplication, and the existence of 0 ˜ and 1 ˜ all follow by applying S φ and using the corresponding componentwise identities in R × R . This proves that O φ is a commutative real algebra with identity and that S φ is a real-algebra isomorphism.
The formulas for 0 ˜ and 1 ˜ follow from (2.4). For 0 ˜ , one obtains S φ 1 ( 0 , 0 ) = ( φ ( 0 ) , φ ( 0 ) ) = ( 1 / 2 , 1 / 2 ) . For 1 ˜ , one obtains S φ 1 ( 1 , 1 ) = ( φ ( 0 ) , φ ( 1 ) ) .
The idempotent laws are direct consequences of the componentwise product in R × R . For example,
S φ ( e p 2 ) = S φ ( e p ) S φ ( e p ) = ( 1 , 0 ) ( 1 , 0 ) = ( 1 , 0 ) = S φ ( e p ) .
Injectivity of S φ gives e p 2 = e p . The same calculation gives e q 2 = e q , e p e q = 0 ˜ , and e p + e q = 1 ˜ from the identities ( 0 , 1 ) 2 = ( 0 , 1 ) , ( 1 , 0 ) ( 0 , 1 ) = ( 0 , 0 ) , and ( 1 , 0 ) + ( 0 , 1 ) = ( 1 , 1 ) .
For the decomposition, apply the transport identities for addition and scalar multiplication:
S φ ( p α e p + q α e q ) = p α S φ ( e p ) + q α S φ ( e q ) = p α ( 1 , 0 ) + q α ( 0 , 1 ) = ( p α , q α ) .
This is S φ ( α ) , so injectivity gives (2.10). If also α = a e p + b e q with a , b R , then applying S φ gives ( p α , q α ) = ( a , b ) , so a = p α and b = q α . Hence the decomposition is unique.
Under the isomorphism S φ , ideals of O φ correspond to ideals of R × R . Since the only ideals of R are 0 and R , the only ideals of R × R are 0 × 0 , 0 × R , R × 0 , and R × R . Their inverse images are respectively { 0 ˜ } , I p , I q , and O φ . The identities I p = R e q and I q = R e p follow from S φ ( e q ) = ( 0 , 1 ) and S φ ( e p ) = ( 1 , 0 ) .
An element ( p , q ) R × R is a unit precisely when both components are nonzero, with inverse ( 1 / p , 1 / q ) . Transporting this statement gives
α 1 = S φ 1 1 p α , 1 q α , p α q α 0 .
Similarly, an element of the product algebra is a zero divisor precisely when at least one component is zero. Translating p α = 0 gives x α + y α = 0 , hence ν α = φ ( x α ) = 1 μ α . Translating q α = 0 gives x α = y α , hence μ α = ν α . This proves (2.12). □
The preceding theorem also has an intrinsic ring-theoretic interpretation. It is useful to state this explicitly, because it explains why the later matrix theory has exactly two spectral channels and exactly four local pivot types. The following result is not an additional assumption; it is the structural content of the transported algebra.
Theorem 2.3
(Intrinsic split semisimple structure and rigidity). The algebra O φ is a reduced semisimple Artinian commutative real algebra. Its only central idempotents are
0 ˜ , e p , e q , 1 ˜ ,
and e p , e q are the only nonzero primitive central idempotents. Consequently
O φ = O φ e p O φ e q = R e p R e q
as a direct product of two simple real algebras. Every unital real-algebra automorphism of O φ either fixes e p , e q separately or interchanges them, and therefore
Aut R a l g ( O φ ) C 2 .
Moreover,
Der R ( O φ ) = 0 .
Proof. 
The isomorphism S φ : O φ R × R identifies O φ with the direct product of two copies of the field R . Since a field is reduced, Artinian, and simple as an algebra over itself, the product R × R is reduced, semisimple, and Artinian. Transporting these properties through S φ proves the first assertion.
An idempotent in R × R is a pair ( u , v ) satisfying ( u 2 , v 2 ) = ( u , v ) . Since the only idempotents in R are 0 and 1, the only idempotents of the product algebra are ( 0 , 0 ) , ( 1 , 0 ) , ( 0 , 1 ) , and ( 1 , 1 ) . Their inverse images under S φ are exactly 0 ˜ , e p , e q , 1 ˜ . The two nonzero proper idempotents ( 1 , 0 ) and ( 0 , 1 ) cannot be decomposed into sums of two nonzero orthogonal idempotents, because each is supported on a single field factor. Hence e p and e q are primitive. Conversely, 1 ˜ = e p + e q is decomposable and 0 ˜ is not nonzero, so no other nonzero primitive central idempotents exist. Commutativity makes all idempotents central.
The decomposition (2.14) follows from 1 ˜ = e p + e q and e p e q = 0 ˜ . The two summands are isomorphic to R through their nonzero spectral coordinates, hence they are simple real algebras. Any unital real-algebra automorphism preserves 0 ˜ , 1 ˜ , and primitive central idempotents. Since the primitive central idempotents are exactly e p and e q , an automorphism either fixes both or interchanges them. Conversely, both possibilities are realized in the product algebra by the identity and the transposition of the two real factors. This proves (2.15).
It remains to prove the rigidity statement for derivations. Let D : O φ O φ be a real derivation. From e p 2 = e p one obtains
D ( e p ) = D ( e p 2 ) = D ( e p ) e p + e p D ( e p ) = 2 e p D ( e p ) .
Write D ( e p ) = a e p + b e q with a , b R . The last identity becomes
a e p + b e q = 2 a e p ,
so a = b = 0 and D ( e p ) = 0 . The same argument applied to e q 2 = e q gives D ( e q ) = 0 . Since every element of O φ has the form p e p + q e q and D is R -linear, D vanishes on all of O φ . Hence (2.16) holds. □
The scalar structure theorem says more than that OPNs support addition and multiplication. It says that any real operation whose domain is meaningful in both spectral channels has a canonical OPNs lift. The original elementary formulas for powers, roots, logarithms, exponentials, and trigonometric functions are all instances of this single channelwise principle.
Proposition 2.4
(Channelwise scalar functional calculus). Let D R m and let F : D R be a real function. For α 1 , , α m O φ , write
S φ ( α j ) = ( p j , q j ) , 1 j m .
If ( p 1 , , p m ) and ( q 1 , , q m ) lie in D, define
F O φ ( α 1 , , α m ) = S φ 1 F ( p 1 , , p m ) , F ( q 1 , , q m ) .
For one variable this gives
f O φ ( α ) = S φ 1 f ( p α ) , f ( q α ) = φ f ( q α ) f ( p α ) 2 , φ f ( p α ) + f ( q α ) 2 .
The lift respects composition whenever the corresponding real compositions are defined. If f ( t ) = k = 0 c k t k converges at p α and q α , then
S φ k = 0 c k α k = ( f ( p α ) , f ( q α ) ) .
Proof. 
The definition (2.17) is meaningful because S φ 1 is defined on all of R 2 . For composition, suppose H ( x ) = F ( G 1 ( x ) , , G m ( x ) ) is a real composition. Applying S φ to the OPNs expression
F O φ ( G 1 ) O φ ( β 1 , , β n ) , , ( G m ) O φ ( β 1 , , β n )
gives a p-channel equal to H ( p β 1 , , p β n ) and a q-channel equal to H ( q β 1 , , q β n ) . These are exactly the two channels of H O φ ( β 1 , , β n ) , so injectivity proves the composition law. For the power series, repeated use of (2.6) gives S φ ( α k ) = ( p α k , q α k ) for every k 0 . Real linearity and convergence in the two channels then give (2.19). □
The elementary operations are recovered from Proposition 2.4. For α , β O φ and c R ,
α + β = S φ 1 ( p α + p β , q α + q β ) , α β = S φ 1 ( p α p β , q α q β ) , c α = S φ 1 ( c p α , c q α ) , α β = S φ 1 ( p α p β , q α q β ) , α 1 = S φ 1 1 p α , 1 q α , α β = S φ 1 p α p β , q α q β .
The inverse and quotient formulas require the corresponding denominators to be nonzero. For real powers, roots, exponentials, and logarithms,
α a = S φ 1 ( p α a , q α a ) , α n = S φ 1 p α n , q α n , exp O φ ( α ) = S φ 1 e p α , e q α , log O φ ( α ) = S φ 1 log p α , log q α .
The real power and root formulas are taken on any real branch on which both channel values are defined, and the logarithm formula requires p α > 0 and q α > 0 .
The trigonometric functions are
sin O φ ( α ) = S φ 1 sin p α , sin q α , cos O φ ( α ) = S φ 1 cos p α , cos q α , tan O φ ( α ) = S φ 1 tan p α , tan q α , cot O φ ( α ) = S φ 1 cot p α , cot q α , sec O φ ( α ) = S φ 1 sec p α , sec q α , csc O φ ( α ) = S φ 1 csc p α , csc q α .
The usual nonvanishing denominator conditions are imposed channel by channel. On the real domains of the inverse trigonometric functions,
arcsin O φ ( α ) = S φ 1 arcsin p α , arcsin q α , arccos O φ ( α ) = S φ 1 arccos p α , arccos q α , arctan O φ ( α ) = S φ 1 arctan p α , arctan q α , arccot O φ ( α ) = S φ 1 arccot p α , arccot q α .
The formulas for arcsin O φ and arccos O φ require | p α | 1 and | q α | 1 . The hyperbolic functions are
sinh O φ ( α ) = S φ 1 sinh p α , sinh q α , cosh O φ ( α ) = S φ 1 cosh p α , cosh q α , tanh O φ ( α ) = S φ 1 tanh p α , tanh q α , coth O φ ( α ) = S φ 1 coth p α , coth q α .
The formula for coth O φ requires p α 0 and q α 0 .

3. Matrix Splitting and Polynomial Smith Theory

The scalar decomposition now passes entrywise to matrices. This passage is formally simple but structurally decisive. It converts matrix questions over O φ into pairs of real matrix questions, while the recombination by e p and e q produces new OPNs-level invariants, most notably the rank pair and the four-pivot profile. The point is not to replace OPNs matrices by two unrelated real matrices; rather, the two real components are the spectral coordinates of a single OPNs matrix.
Let M m , n ( O φ ) denote the set of m × n matrices with entries in O φ . For A = ( α i j ) M m , n ( O φ ) define real matrices
A p = ( p α i j ) , A q = ( q α i j ) .
Equivalently,
A = A p e p + A q e q .
This formula should be read as a spectral expansion of the whole matrix, not merely as a notation for its entries. Matrix multiplication, invertibility, polynomial evaluation, determinants, and linear systems will all respect this expansion because the idempotents annihilate the mixed terms.
Theorem 3.1
(Matrix splitting and transfer principle). The component map
A ( A p , A q )
identifies M m , n ( O φ ) with M m , n ( R ) × M m , n ( R ) as a real vector space. For compatible matrices,
( A B ) p = A p B p , ( A B ) q = A q B q .
Thus M n ( O φ ) is isomorphic as a real algebra to M n ( R ) × M n ( R ) . If X = X p e p + X q e q M n ( O φ ) , then X is invertible over O φ precisely when X p and X q are invertible over R , and then
X 1 = X p 1 e p + X q 1 e q .
Under the same component map, transpose, polynomial evaluation, determinants, kernels, images, cokernels, and linear equations are computed channel by channel.
Proof. 
The entrywise decomposition of the scalar algebra gives the vector-space identification immediately. To prove multiplication, write A = A p e p + A q e q and B = B p e p + B q e q . The idempotent laws give
A B = ( A p e p + A q e q ) ( B p e p + B q e q ) = A p B p e p 2 + A p B q e p e q + A q B p e q e p + A q B q e q 2 = A p B p e p + A q B q e q .
This proves (3.3). Addition, scalar multiplication, and transpose split entrywise, so the square case gives the stated algebra isomorphism.
If X p and X q are invertible, then (3.3) gives
( X p e p + X q e q ) ( X p 1 e p + X q 1 e q ) = I e p + I e q = I ,
and the same computation in the other order gives a two-sided inverse. Conversely, if Y = Y p e p + Y q e q is an inverse of X, then X Y = Y X = I implies
X p Y p = Y p X p = I , X q Y q = Y q X q = I .
Thus both real components are invertible, and (28) follows.
For a polynomial h ( t ) = h p ( t ) e p + h q ( t ) e q and a square matrix A = A p e p + A q e q , repeated use of (3.3) gives
h ( A ) = h p ( A p ) e p + h q ( A q ) e q .
The determinant statement follows by applying the Leibniz formula entrywise. Finally, a vector x = x p e p + x q e q satisfies A x = b precisely when A p x p = b p and A q x q = b q . Hence kernels, images, cokernels, and linear equations split into the two real channels. □
The four-pivot normal form for ordinary OPNs matrices is the degree-zero case of a polynomial theory over O φ [ t ] . This is the point where the zero divisors of O φ could have obstructed a Smith theory. The obstruction is avoided not because O φ [ t ] is a PID in the usual sense, but because the idempotents split it into two honest polynomial PID channels. Thus divisibility is not a single-chain phenomenon inside an integral domain; it is a paired divisibility relation in two real polynomial rings.
Theorem 3.2
(Polynomial splitting over OPNs). Every polynomial h ( t ) O φ [ t ] has a unique representation
h ( t ) = h p ( t ) e p + h q ( t ) e q , h p ( t ) , h q ( t ) R [ t ] .
The map
O φ [ t ] R [ t ] × R [ t ] , h ( t ) ( h p ( t ) , h q ( t ) )
is an isomorphism of commutative real algebras. If
a ( t ) = a p ( t ) e p + a q ( t ) e q , b ( t ) = b p ( t ) e p + b q ( t ) e q ,
then a ( t ) divides b ( t ) in O φ [ t ] precisely when a p ( t ) divides b p ( t ) and a q ( t ) divides b q ( t ) in R [ t ] , with the convention that 0 divides only 0. The units of O φ [ t ] are precisely the elements
c p e p + c q e q , c p , c q R { 0 } .
A square polynomial matrix U ( t ) = U p ( t ) e p + U q ( t ) e q is unimodular over O φ [ t ] precisely when U p ( t ) and U q ( t ) are unimodular over R [ t ] , and then
U ( t ) 1 = U p ( t ) 1 e p + U q ( t ) 1 e q .
Proof. 
Write every coefficient of h ( t ) = i α i t i in the form α i = a i e p + b i e q . Then
h ( t ) = i a i t i e p + i b i t i e q ,
which proves existence of (3.5). If h p ( t ) e p + h q ( t ) e q = 0 , then comparison under the scalar decomposition forces all coefficients of h p and h q to vanish; hence the representation is unique. Addition and real scalar multiplication are componentwise. Multiplication follows from
( h p e p + h q e q ) ( k p e p + k q e q ) = h p k p e p + h q k q e q ,
because the mixed products contain e p e q and vanish. Thus (3.6) is an algebra isomorphism.
A polynomial h = h p e p + h q e q is a unit exactly when there is k = k p e p + k q e q with h k = 1 ˜ . Component comparison gives h p k p = 1 and h q k q = 1 in R [ t ] , so h p and h q are nonzero real constants. The converse is immediate from the inverse c p 1 e p + c q 1 e q . The divisibility assertion is proved in the same way: b = a c holds in O φ [ t ] precisely when b p = a p c p and b q = a q c q hold in R [ t ] .
The unimodular statement is the matrix version of the same argument. If U ( t ) W ( t ) = W ( t ) U ( t ) = I , comparison of the two channels gives polynomial inverses for U p ( t ) and U q ( t ) . Conversely, channelwise polynomial inverses combine by (3.8), and multiplication is valid because the mixed idempotent products vanish. □
The next theorem is the polynomial normal form behind the whole paper. Its invariant factors are not ordinary real polynomials, and they are not arbitrary elements of a ring with zero divisors. They are paired real invariant factors joined by the two primitive idempotents. This is why the theorem produces intrinsic OPNs data even though its proof uses two classical Smith normal forms.
Theorem 3.3
(Idempotent Smith normal form and determinantal ideals). Let F ( t ) M m , n ( O φ [ t ] ) and write
F ( t ) = F p ( t ) e p + F q ( t ) e q .
Then there exist unimodular OPNs polynomial matrices U ( t ) G L m ( O φ [ t ] ) and V ( t ) G L n ( O φ [ t ] ) such that
U ( t ) F ( t ) V ( t ) = D ( t ) ,
where
D ( t ) = diag ( d 1 ( t ) , , d s ( t ) , 0 , , 0 ) , s = min ( m , n ) ,
and
d i ( t ) = f i ( t ) e p + g i ( t ) e q , f i ( t ) , g i ( t ) R [ t ] .
The divisibility chains
f i ( t ) f i + 1 ( t ) , g i ( t ) g i + 1 ( t )
hold for all admissible i. The factors d i ( t ) are unique up to multiplication by units of O φ [ t ] . If Δ k ( F ) denotes the ideal of O φ [ t ] generated by all k × k minors of F ( t ) and Δ 0 ( F ) = O φ [ t ] , then
Δ k ( F ) = d 1 ( t ) d 2 ( t ) d k ( t ) , 1 k s .
Equivalently,
Δ k ( F ) = f 1 f k e p g 1 g k e q .
Proof. 
Since R [ t ] is a principal ideal domain, the ordinary Smith normal form applies separately to F p ( t ) and F q ( t ) . Thus there exist unimodular real polynomial matrices U p , V p , U q , V q such that
U p F p V p = D p , U q F q V q = D q ,
where
D p = diag ( f 1 , , f s , 0 , , 0 ) , D q = diag ( g 1 , , g s , 0 , , 0 ) ,
and the two real divisibility chains in (3.12) hold. Put
U = U p e p + U q e q , V = V p e p + V q e q .
By Theorem 3.2, U and V are unimodular over O φ [ t ] . Multiplying in the two channels gives
U F V = U p F p V p e p + U q F q V q e q = D p e p + D q e q ,
whose diagonal entries are f i e p + g i e q . This proves existence.
For uniqueness, let D = diag ( d i ) and D = diag ( d i ) be two OPNs Smith diagonals equivalent to F. Splitting the equivalence into the two polynomial channels gives two ordinary Smith forms for F p and two ordinary Smith forms for F q . The uniqueness part of the real Smith theorem gives
f i ( t ) = c p , i f i ( t ) , g i ( t ) = c q , i g i ( t ) ,
with nonzero real constants c p , i and c q , i , with the usual zero-factor convention. Therefore
d i ( t ) = ( c p , i e p + c q , i e q ) d i ( t ) ,
and the multiplier is a unit by (3.7). This proves the stated uniqueness.
Unimodular row and column operations preserve determinantal ideals, so it is enough to compute the ideal for the Smith diagonal. A k × k minor of D is either zero or a product of k chosen diagonal entries. The divisibility chains imply that d 1 d k divides every nonzero such product, while the leading k × k principal minor is exactly d 1 d k . Hence the minors generate the principal ideal (3.13). Expanding the product through the idempotents gives (3.14). □
The Smith theorem is equivalent to a classification of finite presentations over O φ [ t ] . This form is deeper than the matrix statement because it identifies the module category controlled by the polynomial theory. The zero divisors of O φ [ t ] do not disappear; instead, they force every finite presentation to split into two ordinary PID presentations.
Theorem 3.4
(Finite presentation classification over OPNs polynomial modules). Let M be a finitely presented O φ [ t ] -module. Then there are uniquely determined nonnegative integers a , b and uniquely determined monic nonconstant real polynomial chains
f 1 ( t ) f 2 ( t ) f r ( t ) , g 1 ( t ) g 2 ( t ) g s ( t ) ,
up to omission of unit factors, such that
M R [ t ] a i = 1 r R [ t ] / ( f i ( t ) ) e p R [ t ] b j = 1 s R [ t ] / ( g j ( t ) ) e q .
Equivalently, finitely presented O φ [ t ] -modules are classified by a pair of ordinary finitely generated R [ t ] -module invariant data, one in the p-channel and one in the q-channel.
Proof. 
Since e p and e q are orthogonal idempotents with sum 1 ˜ , every O φ [ t ] -module M decomposes as
M = e p M e q M .
The summand e p M is naturally a module over the p-channel ring e p O φ [ t ] R [ t ] , and e q M is naturally a module over the q-channel ring e q O φ [ t ] R [ t ] . If M has a finite presentation over O φ [ t ] , applying e p and e q to that presentation gives finite presentations of e p M and e q M over the two copies of R [ t ] .
The structure theorem for finitely generated modules over the PID R [ t ] gives decompositions
e p M R [ t ] a i = 1 r R [ t ] / ( f i ( t ) ) , e q M R [ t ] b j = 1 s R [ t ] / ( g j ( t ) ) ,
where the displayed invariant chains are unique after taking the nonzero torsion factors to be monic and nonconstant. Recombining the two summands with the idempotents gives (3.16). Conversely, every module of the displayed form is finitely presented over O φ [ t ] , because each summand is finitely presented over its corresponding PID channel and the two channels recombine through the product algebra. Uniqueness follows from the uniqueness of the PID invariant factors in each channel and from the uniqueness of the idempotent splitting M = e p M e q M . □
The finite-presentation theorem also reveals an obstruction that does not occur over a single polynomial PID. The projective-module background follows the usual module-theoretic viewpoint over product rings and PID channels [12,13]. Projective modules over O φ [ t ] carry two independent ranks. Equality of these ranks is exactly the condition for freeness.
Theorem 3.5
(Projective rank pairs and nonfree projectives over the OPNs polynomial ring). Let R O φ = O φ [ t ] . Every finitely generated projective R O φ -module P has a unique rank pair ( a , b ) such that
P R [ t ] a e p R [ t ] b e q .
Moreover, P is free as an R O φ -module if and only if a = b . In particular, R O φ e p and R O φ e q are finitely generated projective R O φ -modules which are not free.
Proof. 
The idempotent splitting of R O φ gives
R O φ = R [ t ] e p R [ t ] e q .
For every R O φ -module P there is a corresponding decomposition
P = e p P e q P .
If P is finitely generated and projective over R O φ , then e p P and e q P are finitely generated projective modules over the two channel rings R [ t ] e p R [ t ] and R [ t ] e q R [ t ] . Since R [ t ] is a principal ideal domain, every finitely generated projective module over R [ t ] is free. Thus there exist uniquely determined nonnegative integers a , b such that
e p P R [ t ] a e p , e q P R [ t ] b e q .
Recombining the two idempotent summands gives (3.17). The uniqueness of ( a , b ) follows from the uniqueness of ranks of free modules over the domain R [ t ] in the two channels.
If P is free of rank r over R O φ , then
P R O φ r = R [ t ] r e p R [ t ] r e q ,
so its projective rank pair is ( r , r ) . Conversely, if a = b = r , then
R [ t ] r e p R [ t ] r e q R O φ r ,
and P is free. Taking P = R O φ e p gives rank pair ( 1 , 0 ) , and taking P = R O φ e q gives rank pair ( 0 , 1 ) . Since neither pair is diagonal, neither module is free, although both are direct summands of the free module R O φ and hence projective. □

4. Four-Pivot Rank-Pair Geometry

The constant-matrix theory is where the OPNs structure becomes visibly different from ordinary real matrix theory. A real matrix under row-column equivalence has only two local possibilities on a diagonal coordinate: a pivot or no pivot. An OPNs matrix has two spectral channels, so each diagonal coordinate can be active in both channels, only the p-channel, only the q-channel, or neither channel. This gives four pivot types and forces rank to become a pair rather than a single integer. The rank pair does more than classify normal forms: it controls stable direct sums, factorization through matrices, orbit geometry, and determinantal ideal chains.
Two matrices A , B M m , n ( O φ ) are called equivalent if there exist U G L m ( O φ ) and V G L n ( O φ ) such that B = U A V . For 0 k min ( m , n ) , let E k m , n be the m × n real matrix whose first k diagonal entries are 1 and whose remaining entries are 0; when the size is clear, write E k .
Theorem 4.1
(Four-pivot rank-pair geometry). Fix nonnegative integers m , n and let s = min ( m , n ) . The action
( U , V ) · A = U A V , ( U , V ) G L m ( O φ ) × G L n ( O φ ) ,
on M m , n ( O φ ) has the following structure.
(1)
The orbits are indexed by rank pairs
( a , b ) = ( rank A p , rank A q ) , 0 a , b s .
The orbit of rank pair ( a , b ) contains the four-pivot diagonal D a , b m , n whose diagonal entries consist of
1 ˜ , , 1 ˜ min ( a , b ) , e p , , e p ( a b ) + , e q , , e q ( b a ) + , 0 ˜ , , 0 ˜ s max ( a , b ) ,
with all off-diagonal entries equal to 0 ˜ and with extra zero rows or columns when m n .
(2)
For A , B M m , n ( O φ ) , the following conditions are equivalent:
(a)
A and B are equivalent over O φ ;
(b)
rank A p = rank B p and rank A q = rank B q ;
(c)
A and B have the same four-pivot profile
ρ 1 = min ( a , b ) , ρ p = ( a b ) + , ρ q = ( b a ) + , ρ 0 = s max ( a , b ) .
(3)
The four local pivots
1 ˜ , e p , e q , 0 ˜
are pairwise inequivalent. Consequently the rank pair
rank O ( A ) = ( rank A p , rank A q )
is the minimal complete rank-type invariant for OPNs matrix equivalence; no single integer-valued rank function that identifies two distinct rank pairs can classify all rectangular OPNs matrices under equivalence.
(4)
Let M O φ be the commutative monoid of stable equivalence classes of finite rectangular OPNs matrices under block direct sum, where zero source and zero target summands are ignored. Then the rank-pair map induces a monoid isomorphism
M O φ N 2 .
Under this isomorphism,
[ e p ] ( 1 , 0 ) , [ e q ] ( 0 , 1 ) , [ 1 ˜ ] ( 1 , 1 ) , [ 0 ˜ ] ( 0 , 0 ) .
(5)
Let A M m , n ( O φ ) and B M r , u ( O φ ) . Then A factors through B, meaning that there exist OPNs matrices C , D of compatible sizes with
A = C B D ,
if and only if
rank A p rank B p , rank A q rank B q .
Thus the stable factorization preorder is exactly the product order on N 2 .
(6)
As a real manifold, the orbit
O a , b m , n = { A M m , n ( O φ ) : rank A p = a , rank A q = b }
has dimension
dim R O a , b m , n = a ( m + n a ) + b ( m + n b ) .
Its Euclidean closure in M m , n ( O φ ) is
O a , b m , n ¯ = 0 c a 0 d b O c , d m , n .
(7)
Let J k ( A ) be the ideal of O φ generated by the k × k minors of A, with J 0 ( A ) = O φ . For an ideal J O φ , write
π p ( J ) = { p α : α J } , π q ( J ) = { q α : α J } .
Then the rank pair of A is recovered by
rank A p = max { k : π p ( J k ( A ) ) 0 } , rank A q = max { k : π q ( J k ( A ) ) 0 } .
Consequently the determinantal ideal chain is an intrinsic complete invariant for matrix equivalence over O φ .
Proof. 
The matrix splitting theorem identifies M m , n ( O φ ) with M m , n ( R ) × M m , n ( R ) by sending A to ( A p , A q ) . Under this identification, the group G L m ( O φ ) × G L n ( O φ ) becomes the product of the two real left-right equivalence groups in the two spectral channels. Therefore two OPNs matrices lie in the same orbit precisely when their p-components have the same real rank and their q-components have the same real rank. This proves that the orbits are indexed by rank pairs ( a , b ) .
For a real matrix of rank a, ordinary row-column equivalence reduces it to E a m , n . Applying this in the p-channel and the q-channel independently gives real invertible matrices U p , V p , U q , V q such that
U p A p V p = E a , U q A q V q = E b .
Recombining
U = U p e p + U q e q , V = V p e p + V q e q ,
gives invertible OPNs matrices and
U A V = E a e p + E b e q .
At each diagonal coordinate, the possible pairs of real diagonal entries are ( 1 , 1 ) , ( 1 , 0 ) , ( 0 , 1 ) , and ( 0 , 0 ) , which correspond respectively to 1 ˜ , e p , e q , 0 ˜ . Counting the overlap of the first a and first b diagonal positions gives the diagonal in (4.2). Conversely, equivalence over O φ splits into equivalence in both real channels, so the two real ranks are preserved. This proves the normal form and the equivalence of the three classification conditions. The pivot profile is computed from ( a , b ) by (4.3), while the rank pair is recovered from the profile by
a = ρ 1 + ρ p , b = ρ 1 + ρ q .
The four 1 × 1 pivots have rank pairs
( 1 , 1 ) , ( 1 , 0 ) , ( 0 , 1 ) , ( 0 , 0 ) ,
respectively. Since matrix equivalence preserves the two real ranks, these four local types are pairwise inequivalent. The classification just proved shows that the ordered pair ( rank A p , rank A q ) is complete. Any rank-type invariant that collapses two distinct pairs cannot distinguish the corresponding four-pivot normal forms, and hence cannot classify OPNs matrices up to equivalence. Thus the irreducible information is the rank pair, or equivalently the four-pivot profile.
Block direct sum adds real ranks in each channel:
rank ( A B ) p = rank A p + rank B p , rank ( A B ) q = rank A q + rank B q .
Hence the rank-pair map is a homomorphism from the stable monoid of OPNs matrices to N 2 . Surjectivity follows because the direct sum of a copies of e p and b copies of e q has rank pair ( a , b ) . Injectivity follows from the normal-form classification: two stable classes with the same rank pair have the same four-pivot stable normal form after zero source and target summands are removed. This proves (4.6), and the displayed images of e p , e q , 1 ˜ , 0 ˜ are immediate from their rank pairs.
For the factorization statement, suppose first that A = C B D . Passing to spectral components gives
A p = C p B p D p , A q = C q B q D q .
The ordinary real rank inequality gives
rank A p rank B p , rank A q rank B q .
Conversely, assume the two inequalities in (49). Over a field, a matrix X factors through a matrix Y if and only if rank X rank Y . Applying this real fact in the two spectral channels, there exist real matrices C p , D p , C q , D q such that
A p = C p B p D p , A q = C q B q D q .
Set
C = C p e p + C q e q , D = D p e p + D q e q .
The matrix transfer principle gives
C B D = C p B p D p e p + C q B q D q e q = A p e p + A q e q = A .
This proves the factorization criterion and identifies the stable factorization preorder with the product order on N 2 .
The orbit dimension and closure formula follow from the same product description, now using the standard geometry of real rank strata. The real rank-a stratum in M m , n ( R ) is a smooth manifold of dimension a ( m + n a ) . Since the OPNs rank-pair orbit is the product of the real rank-a and real rank-b strata, its real dimension is the sum
a ( m + n a ) + b ( m + n b ) ,
which proves (4.9). The Euclidean closure of the real rank-a stratum consists of all real matrices of rank at most a. Taking the product of the two closure relations gives (4.10).
It remains to connect the same rank-pair geometry with determinantal ideals. A k × k minor of A has spectral components equal to the corresponding k × k minors of A p and A q . Hence J k ( A ) has nonzero p-projection if and only if A p has at least one nonzero k × k minor, which is equivalent to k rank A p . The same argument in the q-channel shows that J k ( A ) has nonzero q-projection if and only if k rank A q . The two formulas in (4.11) follow. Since the rank pair classifies matrix equivalence, the determinantal ideal chain is an intrinsic complete invariant for equivalence. □
The theorem shows that four-pivot form is not merely a convenient diagonal notation. It is the common normal form for equivalence, stable addition, factorization, orbit closure, and determinantal recovery. In particular, the objects e p and e q behave as two independent primitive rank generators, while 1 1 represents their simultaneous occurrence in one coordinate.

5. Modules, Determinantal Ideals, and Linear Systems

In this section a matrix A M m , n ( O φ ) is regarded as an O φ -module homomorphism A : O φ n O φ m . The passage from a diagonal normal form to kernels and cokernels is not merely a bookkeeping exercise. Because e p and e q are zero divisors, a one-channel pivot has both an image contribution and a complementary kernel or cokernel contribution. This is the module-theoretic meaning of the four-pivot normal form.
Theorem 5.1
(Finite OPNs module classification and exact splitting). Every finitely generated O φ -module M decomposes as
M = e p M e q M ,
where e p M and e q M are finite-dimensional real vector spaces. Hence there are uniquely determined nonnegative integers a , b such that
M ( O φ e p ) a ( O φ e q ) b .
Equivalently, if r = min ( a , b ) , then
M O φ r ( O φ e p ) a r ( O φ e q ) b r .
Moreover, every short exact sequence of finitely generated O φ -modules
0 M M M 0
splits. Consequently, every submodule of a finitely generated O φ -module is a direct summand.
Proof. 
Since 1 ˜ = e p + e q and e p e q = 0 ˜ , every element x M decomposes as
x = e p x + e q x .
The intersection of e p M and e q M is zero, because if x = e p u = e q v , then applying e p gives x = e p x = e p e q v = 0 . This proves (5.1). The summand e p M is a vector space over O φ e p R , and e q M is a vector space over O φ e q R . Finite generation over O φ implies finite dimensionality over these two real fields. Therefore e p M ( O φ e p ) a and e q M ( O φ e q ) b for uniquely determined dimensions a , b , which gives (5.2). Pairing r = min ( a , b ) copies of O φ e p with O φ e q gives O φ r , and the unpaired summands give (5.3).
For a short exact sequence as in (5.4), applying e p and e q gives two short exact sequences of finite-dimensional real vector spaces. Both split over R . Choosing real splittings in the two channels and recombining them with e p and e q gives an O φ -linear splitting of the original sequence. If N M is a submodule, the exact sequence
0 N M M / N 0
splits, so N is a direct summand. □
Theorem 5.2
(Canonical module and determinantal structure). Let A M m , n ( O φ ) and let a = rank A p and b = rank A q . Then
ker A ( O φ e q ) ( a b ) + ( O φ e p ) ( b a ) + O φ n max ( a , b ) , im A O φ min ( a , b ) ( O φ e p ) ( a b ) + ( O φ e q ) ( b a ) + , coker A ( O φ e q ) ( a b ) + ( O φ e p ) ( b a ) + O φ m max ( a , b ) .
The two-channel rank-nullity identity is
rank O ( A ) + nullity O ( A ) = ( n , n ) ,
where
rank O ( A ) = ( rank A p , rank A q ) , nullity O ( A ) = ( dim ker A p , dim ker A q ) .
For 1 k min ( m , n ) , let J k ( A ) be the ideal of O φ generated by the k × k minors of A, with J 0 ( A ) = O φ . Then
J k ( A ) = O φ , k a and k b , I q , k a and k > b , I p , k > a and k b , { 0 ˜ } , k > a and k > b .
Proof. 
The one-coordinate maps determine the module structure of a four-pivot diagonal. If x = x p e p + x q e q , then e p x = x p e p . Therefore multiplication by e p has kernel O φ e q , image O φ e p , and cokernel naturally isomorphic to O φ e q . Similarly, multiplication by e q has kernel O φ e p , image O φ e q , and cokernel isomorphic to O φ e p . Multiplication by 1 ˜ has zero kernel and cokernel and image O φ , while multiplication by 0 ˜ has kernel O φ , image 0, and cokernel O φ .
By Theorem 4.1, there are invertible matrices U and V with U A V = D a , b m , n . Multiplication by V is a domain automorphism and multiplication by U is a codomain automorphism, so A and D a , b m , n have isomorphic kernels, images, and cokernels. The diagonal map D a , b m , n is a direct sum of the one-coordinate maps just computed, together with extra zero rows or columns when m n . A 1 ˜ -pivot contributes one copy of O φ to the image and no kernel or cokernel; an e p -pivot contributes O φ e q to the kernel, O φ e p to the image, and O φ e q to the cokernel; an e q -pivot contributes O φ e p to the kernel, O φ e q to the image, and O φ e p to the cokernel. The fully zero part and extra domain coordinates contribute free kernel summands, while extra target coordinates contribute free cokernel summands. Counting these contributions gives (5.5). The rank-nullity identity follows either from the displayed kernel formula by reading the two channels or directly from the real identities rank A p + dim ker A p = n and rank A q + dim ker A q = n .
For determinantal ideals, a k × k minor of A has spectral components equal to the corresponding minors of A p and A q . If k a and k b , then both real matrices have a nonzero k × k minor, so the generated ideal has nonzero projection in both channels and must be O φ . If k a and k > b , then some p-minor is nonzero while every q-minor is zero; all OPNs minors lie in I q = R e p , and at least one has nonzero p-component, so the ideal is I q . The case k > a and k b gives I p by the same argument with the two channels interchanged. If k > a and k > b , all such minors vanish in both channels, so J k ( A ) = { 0 ˜ } . □
The same diagonal analysis gives the correct form of linear-system solvability. The usual real Rouché–Capelli theorem survives, but it must be imposed simultaneously in the p- and q-channels. After four-pivot reduction, the equations separate into coordinates that fix both spectral components, coordinates that fix only one component, and coordinates that impose compatibility on the right-hand side.
Theorem 5.3
(Linear systems and four-pivot Rouché–Capelli theorem). Let A M m , n ( O φ ) and b O φ m . The system
A x = b
has a solution in O φ n precisely when the two real systems
A p x p = b p , A q x q = b q
have real solutions. Equivalently,
rank A p = rank ( A p | b p ) , rank A q = rank ( A q | b q ) .
When solutions exist, the solution set is x 0 + ker A for any particular solution x 0 . If U A V = D a , b m , n and one sets c = U b and y = V 1 x , then (5.8) is equivalent to D a , b m , n y = c . In this reduced system, a 1 1 -pivot fixes both spectral components of the corresponding unknown, an e p -pivot fixes only the p-component, an e q -pivot fixes only the q-component, and a 0 ˜ -pivot imposes vanishing of the corresponding right-hand side coordinate while leaving the corresponding domain coordinate free when such a coordinate is present.
Proof. 
Write x = x p e p + x q e q and b = b p e p + b q e q . By the matrix product splitting,
A x = ( A p x p ) e p + ( A q x q ) e q .
Thus A x = b holds exactly when the two real equations in (5.9) hold. Applying the ordinary real Rouché–Capelli theorem to the two channel systems gives (5.10). If x 0 is one solution, then x is another solution precisely when A ( x x 0 ) = 0 ˜ , which means x x 0 ker A .
For the four-pivot interpretation, multiply A x = b on the left by U and substitute x = V y . The resulting equation is D a , b m , n y = c . Each diagonal coordinate is then one of the four one-coordinate equations 1 ˜ y i = c i , e p y i = c i , e q y i = c i , or 0 ˜ y i = c i . The assertions follow from the multiplication rules used in the proof of Theorem 5.2. For instance, e p y i = c i is solvable exactly when c i O φ e p ; in that case the p-component of y i is fixed and the q-component is free. □

6. Determinants, Adjugates, and Inverse Matrices

For square matrices, the determinant retains its familiar formal definition by the Leibniz formula. The difference is in its value: it is an OPNs element whose two spectral coordinates are the two ordinary real determinants. Consequently invertibility is not detected by a single nonzero scalar determinant, but by the unit condition in the scalar OPNs algebra, equivalently by nonvanishing in both channels.
Theorem 6.1
(Determinant, adjugate, inverse, and Cramer theorem). For A = ( α i j ) M n ( O φ ) , define
det O ( A ) = σ S n sgn ( σ ) α 1 σ ( 1 ) α 2 σ ( 2 ) α n σ ( n ) .
Then
S φ ( det O ( A ) ) = ( det A p , det A q ) .
The adjugate matrix defined by the usual cofactor formula satisfies
A adj O ( A ) = adj O ( A ) A = det O ( A ) I .
For A M n ( O φ ) , the following statements are equivalent:
(1)
A is invertible over O φ ;
(2)
A p and A q are invertible over R ;
(3)
det O ( A ) is a unit of O φ ;
(4)
det A p 0 and det A q 0 .
When these conditions hold,
A 1 = A p 1 e p + A q 1 e q = ( det O ( A ) ) 1 adj O ( A ) .
If b O φ n , the unique solution of A x = b is given by
x i = det O ( A i ( b ) ) det O ( A ) , i = 1 , , n ,
where A i ( b ) is obtained from A by replacing its i-th column by b.
Proof. 
Applying S φ to the Leibniz formula (6.1) preserves addition, multiplication, and real signs. The p-component is therefore the ordinary Leibniz formula for det A p , and the q-component is the ordinary Leibniz formula for det A q . This proves (6.2).
The adjugate identity is valid over any commutative ring, and here it can be checked directly. The ( i , j ) entry of A adj O ( A ) is
k = 1 n α i k C j k ,
where C j k is the ( j , k ) cofactor. If i = j , this is the cofactor expansion of det O ( A ) along row i. If i j , it is the determinant of the matrix obtained from A by replacing row j with row i, expanded along row j; that matrix has two equal rows and determinant 0 ˜ . Hence A adj O ( A ) = det O ( A ) I . The identity on the other side is the analogous column expansion.
The equivalence of invertibility of A and invertibility of A p , A q is Theorem 3.1. The equivalence with nonzero real determinants is the ordinary determinant criterion in the two channels. By (6.2) and the scalar unit criterion, det O ( A ) is a unit precisely when det A p and det A q are both nonzero. This proves the four equivalent conditions. Formula (6.4) follows first from the channelwise inverse and then from (6.3) after multiplying by the unit ( det O ( A ) ) 1 .
For Cramer’s rule, det O ( A ) is a unit under the equivalent conditions above. Taking S φ of (6.5), the p-component is the ordinary Cramer formula for A p x p = b p , and the q-component is the ordinary Cramer formula for A q x q = b q . Injectivity of the spectral map gives the OPNs formula. □

7. Characteristic Polynomials, Invariant Factors, and Similarity

The preceding sections classify matrices under row-column equivalence. Square matrices also carry similarity invariants, and these are controlled by the polynomial matrix t I A . This is where the polynomial Smith theorem reenters: invariant factors for t I A package the rational canonical data of the two real channels into OPNs polynomial invariants.
For A M n ( O φ ) define the characteristic polynomial by
χ A ( t ) = det O ( t I A ) ,
where t is a central real indeterminate.
Theorem 7.1
(Characteristic and minimal polynomial theorem). For every A M n ( O φ ) ,
χ A ( t ) = χ A p ( t ) e p + χ A q ( t ) e q ,
where χ A p ( t ) = det ( t I A p ) and χ A q ( t ) = det ( t I A q ) . The Cayley–Hamilton identity holds:
χ A ( A ) = 0 .
Let m A p ( t ) and m A q ( t ) be the ordinary real minimal polynomials of A p and A q . Among real-coefficient polynomials f ( t ) R [ t ] , the monic polynomial of least degree satisfying f ( A ) = 0 is
lcm ( m A p , m A q ) .
If coefficients in O φ are allowed, the channelwise minimal polynomial is
m A O ( t ) = m A p ( t ) e p + m A q ( t ) e q ,
and it satisfies m A O ( A ) = 0 .
Proof. 
The matrix t I A has spectral components t I A p and t I A q . Applying the determinant splitting from Theorem 6.1 gives (7.2). Evaluating at A = A p e p + A q e q and using the matrix transfer principle gives
χ A ( A ) = χ A p ( A p ) e p + χ A q ( A q ) e q .
The ordinary Cayley–Hamilton theorem over R makes both real terms vanish, proving (7.3).
If f ( t ) R [ t ] , then real coefficients act in both channels in the same way, so
f ( A ) = f ( A p ) e p + f ( A q ) e q .
Thus f ( A ) = 0 precisely when f ( A p ) = 0 and f ( A q ) = 0 . This means that m A p and m A q both divide f in R [ t ] , and the least monic real polynomial with that property is their least common multiple. For OPNs coefficients, evaluation of (7.5) gives m A p ( A p ) e p + m A q ( A q ) e q = 0 . Minimality is channelwise: lowering either channel polynomial would contradict the corresponding real minimality. □
The polynomial Smith theorem gives intrinsic invariant factors for a matrix. Apply Theorem 3.3 to t I A . If the nonzero diagonal entries are
d i A ( t ) = f i A ( t ) e p + g i A ( t ) e q ,
then these are called the OPNs invariant factors of A.
Theorem 7.2
(Similarity and invariant-factor classification). For A , B M n ( O φ ) , the following conditions are equivalent:
(1)
A and B are similar over O φ ;
(2)
A p is similar to B p over R and A q is similar to B q over R ;
(3)
the OPNs invariant factors of A and B agree up to multiplication by units in O φ [ t ] ;
(4)
the ordinary rational canonical data agree in both real channels.
Moreover, A is diagonalizable over O φ precisely when A p and A q are both diagonalizable over R . Over any field extension where real Jordan forms exist, the Jordan data of A are the ordered pair of the Jordan data of A p and A q .
Proof. 
If B = T 1 A T with T = T p e p + T q e q G L n ( O φ ) , then Theorem 3.1 gives
B p = T p 1 A p T p , B q = T q 1 A q T q .
Thus similarity over O φ implies similarity in both real channels. Conversely, if such real similarities are given by T p and T q , then T = T p e p + T q e q is invertible over O φ and the same componentwise multiplication gives B = T 1 A T .
Ordinary rational canonical theory over R says that real similarity is equivalent to equality of ordinary invariant factors, or equivalently equality of rational canonical data. The OPNs invariant factors of A are obtained by taking the Smith invariant factors of t I A p and t I A q and recombining the corresponding real factors as f i A e p + g i A e q . Therefore equality of OPNs invariant factors up to OPNs polynomial units is precisely equality of the two real invariant-factor lists up to nonzero real constants in the two channels. This proves the equivalence of all four conditions.
Diagonalization and Jordan data are special cases of the same similarity splitting. A diagonalization A = T D T 1 over O φ splits into diagonalizations of A p and A q . Conversely, diagonalizations of the two real components combine through T = T p e p + T q e q and D = D p e p + D q e q . The Jordan statement is identical after replacing diagonal forms by the corresponding Jordan normal forms over a field extension where they exist. □
A useful strengthening of the similarity theorem is the channelwise description of commutants. For A M n ( O φ ) define
Cent O φ ( A ) = { X M n ( O φ ) : X A = A X } .
Then
Cent O φ ( A ) = Cent R ( A p ) e p Cent R ( A q ) e q .
Indeed, X A = A X is equivalent to X p A p = A p X p and X q A q = A q X q . Thus the size of the commutant, cyclicity criteria, and all similarity invariants detected by centralizers are also two-channel invariants.
Similarity classification is channelwise, but eigenvalue language requires an additional convention. Because O φ has zero divisors, eigenvectors supported in only one channel produce degenerate spectral phenomena: such vectors can satisfy an eigenvalue equation while testing only half of the matrix. The regular spectral theory excludes this one-channel collapse by requiring both components of the eigenvector to be nonzero. Thus λ O φ is called a regular eigenvalue of A if there exists v = v p e p + v q e q O φ n such that
A v = λ v , v p 0 , v q 0 .
Theorem 7.3
(Regular spectrum and spectral rectangles). For A M n ( O φ ) ,
Spec reg ( A ) = S φ 1 Spec ( A p ) × Spec ( A q ) .
Moreover, if S φ ( λ ) = ( λ p , λ q ) , then the regular eigenmodule associated with λ is
E O ( A , λ ) = E ( A p , λ p ) e p E ( A q , λ q ) e q ,
with both real eigenspaces required to be nonzero for regularity.
Proof. 
Let A v = λ v with v = v p e p + v q e q and S φ ( λ ) = ( λ p , λ q ) . Taking spectral components gives
A p v p = λ p v p , A q v q = λ q v q .
If v p 0 and v q 0 , then λ p Spec ( A p ) and λ q Spec ( A q ) . Conversely, if λ p Spec ( A p ) and λ q Spec ( A q ) , choose nonzero real eigenvectors v p and v q satisfying (7.9). With v = v p e p + v q e q and λ = S φ 1 ( λ p , λ q ) , one obtains
A v = ( A p v p ) e p + ( A q v q ) e q = λ p v p e p + λ q v q e q = λ v .
Both components of v are nonzero, so λ is regular. This proves (7.7), and the eigenspace formula (7.8) is exactly the same componentwise equation written for all eigenvectors. □

8. Symmetric Matrices, Congruence, and Inertia

The row-column normal form and similarity classification concern arbitrary matrices. For symmetric matrices the natural equivalence relation is congruence, and the classical reference point is Sylvester inertia theory for real symmetric forms [3,4]. Since transpose also splits channelwise, congruence over OPNs becomes two independent real congruence problems, and Sylvester inertia becomes a double inertia invariant.
A matrix A M n ( O φ ) is symmetric if A T = A . Two symmetric matrices A and B are congruent over O φ if there exists C G L n ( O φ ) such that
B = C T A C .
For a symmetric A = A p e p + A q e q , define its double inertia by
In O ( A ) = ( n p + , n p , n p 0 ) , ( n q + , n q , n q 0 ) ,
where the two triples are the ordinary real inertias of A p and A q .
Theorem 8.1
(Symmetric congruence and double inertia). Let A , B M n ( O φ ) be symmetric. Then A and B are congruent over O φ precisely when
In O ( A ) = In O ( B ) .
Proof. 
If B = C T A C with C = C p e p + C q e q G L n ( O φ ) , then component comparison gives
B p = C p T A p C p , B q = C q T A q C q .
The ordinary real Sylvester law of inertia gives equality of the two real inertias in each channel, hence (8.2). Conversely, if the double inertias are equal, the real Sylvester law gives real invertible matrices C p and C q with
B p = C p T A p C p , B q = C q T A q C q .
Putting C = C p e p + C q e q gives an invertible OPNs matrix, and multiplication in the two channels yields C T A C = B . □
A symmetric matrix A M n ( O φ ) is spectrally positive semidefinite if A p 0 and A q 0 ; this is the channelwise analogue of the standard real positive-semidefinite cone [3,14]. It is spectrally positive definite if A p 0 and A q 0 . This definition is deliberately spectral rather than based on an order in normalized coordinates: positivity is a quadratic-form property in each real channel, and only then is it transported back to OPNs.
Theorem 8.2
(Spectral positivity, Cholesky factors, and square roots). A symmetric matrix A M n ( O φ ) is spectrally positive semidefinite precisely when x T A x has nonnegative p- and q-spectral components for every x O φ n . If A is spectrally positive definite, then there exists an invertible L M n ( O φ ) such that
A = L L T .
There also exists a unique spectrally positive definite matrix B satisfying
B 2 = A .
More explicitly,
L = L p e p + L q e q , B = A p 1 / 2 e p + A q 1 / 2 e q ,
where L p , L q are ordinary real Cholesky factors of A p , A q .
Proof. 
For x = x p e p + x q e q , the quadratic form splits as
x T A x = ( x p T A p x p ) e p + ( x q T A q x q ) e q .
If A p and A q are positive semidefinite, then both real quadratic forms are nonnegative for all x p and x q . Conversely, by choosing vectors with arbitrary x p and x q = 0 , and then arbitrary x q and x p = 0 , the assumed nonnegativity of the two spectral components gives A p 0 and A q 0 .
If A is spectrally positive definite, then A p and A q are positive definite real symmetric matrices. Choose ordinary Cholesky factors A p = L p L p T and A q = L q L q T with L p , L q invertible. With L = L p e p + L q e q , Theorem 3.1 gives
L L T = L p L p T e p + L q L q T e q = A .
For the square root, let A p 1 / 2 and A q 1 / 2 be the unique real positive definite square roots. Then B = A p 1 / 2 e p + A q 1 / 2 e q is spectrally positive definite and satisfies B 2 = A . If C is another spectrally positive definite square root, then C p 2 = A p and C q 2 = A q ; real uniqueness gives C p = A p 1 / 2 and C q = A q 1 / 2 , hence C = B . □
Equivalently, the spectrally positive cone is the product cone
S n + ( O φ ) = S n + ( R ) e p S n + ( R ) e q ,
and the Loewner order on symmetric OPNs matrices is the product of the two real Loewner orders. Thus positivity is not an additional order imposed on normalized coordinates; it is the intrinsic cone transported from the two real quadratic-form channels.

9. Matrix Functions, Matrix Equations, and Gauge Equivalence

The final structural applications are functional calculus and matrix equations. These results do not introduce new algebraic mechanisms; they show that standard analytic constructions commute with the same two-channel splitting. Thus exponential flows, Sylvester equations, and Lyapunov equations over OPNs inherit their solvability criteria from the two real channels; the underlying real theory is standard in matrix analysis and linear systems [4,15,16,17].
Theorem 9.1
(Matrix functional calculus and linear matrix equations). Let f be defined on the spectra of A p and A q by a convergent power series or by the usual real matrix functional calculus. Define
f ( A ) = f ( A p ) e p + f ( A q ) e q .
In particular,
exp ( A ) = exp ( A p ) e p + exp ( A q ) e q ,
and the initial value problem
d X d t = A X , X ( 0 ) = X 0
has the unique solution
X ( t ) = exp ( t A ) X 0 .
For A M m ( O φ ) , B M n ( O φ ) , and C M m , n ( O φ ) , the Sylvester equation
A X X B = C
has a unique solution X M m , n ( O φ ) for every C precisely when
Spec ( A p ) Spec ( B p ) = , Spec ( A q ) Spec ( B q ) = .
Let A , Q M n ( O φ ) with Q symmetric and spectrally positive definite. The Lyapunov equation
A T X + X A = Q
has a unique spectrally positive definite symmetric solution X precisely when both real matrices A p and A q are Hurwitz.
Proof. 
Formula (9.1) is the direct matrix version of the scalar functional calculus. For power series it follows term by term from (3.3); for the usual real matrix functional calculus it is a definition transported through the algebra isomorphism M n ( O φ ) M n ( R ) × M n ( R ) . The exponential formula is the special case f ( z ) = e z . Differentiating exp ( t A ) X 0 gives A exp ( t A ) X 0 , and the value at t = 0 is X 0 . Uniqueness follows because (9.3) splits into the two real initial value problems d X p / d t = A p X p and d X q / d t = A q X q , where ordinary uniqueness applies.
Splitting (9.5) gives the two ordinary real Sylvester equations
A p X p X p B p = C p , A q X q X q B q = C q .
The OPNs equation has a unique solution for every C precisely when each real equation has a unique solution for every corresponding right-hand side. The classical Sylvester criterion gives exactly the two spectral disjointness conditions in (9.6).
Similarly, (9.7) splits into
A p T X p + X p A p = Q p , A q T X q + X q A q = Q q .
Since Q is spectrally positive definite, Q p and Q q are positive definite. The classical real Lyapunov theorem gives a unique positive definite solution in each channel precisely when A p and A q are Hurwitz. Recombining the two solutions gives X = X p e p + X q e q , and spectral positive definiteness is also channelwise. □
The normalization function is not unique. The preceding results therefore have to be separated from any accidental coordinate choice. The following gauge equivalence states precisely that changing the admissible normalization changes only the normalized presentation of the same spectral algebra. All invariants defined through the p- and q-channels are preserved.
Theorem 9.2
(Gauge equivalence). Let φ and ψ be admissible normalization functions. Define
G φ ψ = S ψ 1 S φ : O φ O ψ .
Then G φ ψ is an isomorphism of real algebras. Entrywise application gives algebra isomorphisms
M n ( O φ ) M n ( O ψ )
that preserve scalar operations, primitive idempotents, finite module decompositions, rank pairs, pivot profiles, determinantal ideal chains, Smith invariant factors, determinants, characteristic polynomials, regular spectral rectangles, similarity classes, double inertias, positivity cones, matrix functions, and matrix equations developed above.
Proof. 
For α , β O φ , the transport identities give
S ψ ( G φ ψ ( α + β ) ) = S φ ( α + β ) = S φ ( α ) + S φ ( β ) = S ψ ( G φ ψ ( α ) ) + S ψ ( G φ ψ ( β ) ) = S ψ ( G φ ψ ( α ) + G φ ψ ( β ) ) .
Injectivity of S ψ proves preservation of addition. Scalar multiplication and multiplication are proved by the same calculation, with the corresponding transport identity in place of addition. Hence G φ ψ is a real-algebra isomorphism.
For matrices, apply G φ ψ entrywise. Since the spectral components are unchanged by construction, every invariant defined through A p and A q is preserved. This includes rank pairs, pivot profiles, determinantal ideal chains, Smith invariant factors, determinant components, characteristic polynomial components, spectral rectangles, similarity classes, double inertias, positivity cones, and the four-pivot normal form. □

10. Conclusion

The paper develops OPNs matrix theory from a single structural source: the spectral algebra isomorphism
O φ R e p R e q .
The scalar theory is not merely a collection of closed formulas on normalized coordinates. It is a reduced semisimple Artinian real algebra with two primitive central idempotents. The normalized pair ( μ , ν ) supplies a coordinate presentation, while the spectral pair ( p , q ) supplies the algebraic substance.
This split algebra forces the matrix theory to have two simultaneous real channels and therefore four local pivot types:
1 ˜ , e p , e q , 0 ˜ .
The four-pivot normal form is not a cosmetic rewriting of ordinary rank reduction. The four local pivots are inequivalent, the rank pair is a minimal complete rank-type invariant, and the determinantal ideal chain recovers the rank pair intrinsically. This gives an internal explanation for why a single scalar rank cannot classify OPNs matrices.
The polynomial theory supplies the higher-level source of the constant-matrix normal form. Although O φ [ t ] is not a PID in the integral-domain sense, its idempotent splitting into two copies of R [ t ] gives an idempotent Smith normal form. The same mechanism classifies finitely presented O φ [ t ] -modules by paired real PID invariant data. At the non-polynomial level, finitely generated O φ -modules are classified by their two real dimensions, and the canonical summands O φ , O φ e p , and O φ e q explain the kernel, image, and cokernel formulas attached to the four-pivot form.
For square matrices, determinant theory, adjugates, Cayley–Hamilton, minimal polynomials, invariant factors, regular spectra, similarity, centralizers, symmetric congruence, inertia, positivity, matrix functions, and matrix equations all follow from the same two-channel structure. The final gauge theorem shows that changing the admissible normalization changes only the normalized coordinate presentation, not the intrinsic algebra, module, Smith, similarity, or inertia invariants.
Thus the structural content of OPNs matrix theory is the split semisimple algebra and its irreducible four-pivot linear algebra. The results of the paper are invariant under admissible normalization, complete under row-column equivalence and similarity, and intrinsic at the level of modules and determinantal ideals.

References

  1. Zhou, L. Ordered pair of normalized real numbers. Inf. Sci. 2020, 538, 290–313. [Google Scholar] [CrossRef]
  2. Gantmacher, F.R. The Theory of Matrices; Chelsea Publishing Company: New York, 1959. [Google Scholar]
  3. Horn, R.A.; Johnson, C.R. Matrix Analysis, 2nd Edition; Cambridge University Press: Cambridge, 2013. [Google Scholar]
  4. Lancaster, P.; Tismenetsky, M. The Theory of Matrices, 2nd Edition; Academic Press: Orlando, FL, 1985. [Google Scholar]
  5. Gohberg, I.; Lancaster, P.; Rodman, L. Matrix Polynomials; SIAM: Philadelphia, 2009; Vol. 58. [Google Scholar] [CrossRef]
  6. Smith, H.J.S. On systems of linear indeterminate equations and congruences. Philos. Trans. R. Soc. Lond. 1861, 151, 293–326. [Google Scholar] [CrossRef]
  7. Newman, M. Integral Matrices. In of Pure and Applied Mathematics; Academic Press: New York, 1972; Vol. 45. [Google Scholar]
  8. Atiyah, M.F.; Macdonald, I.G. Introduction to Commutative Algebra; Addison-Wesley: Reading, MA, 1969. [Google Scholar]
  9. Jacobson, N. Basic Algebra I, 2nd Edition; W. H. Freeman: New York, 1985. [Google Scholar]
  10. Lang, S. Algebra, 3rd Edition; Springer: New York, 2002. [Google Scholar] [CrossRef]
  11. Dummit, D.S.; Foote, R.M. Abstract Algebra, 3rd Edition; John Wiley & Sons: Hoboken, NJ, 2004. [Google Scholar]
  12. Hungerford, T.W. Algebra; Springer: New York, 1974. [Google Scholar] [CrossRef]
  13. Lam, T.-Y. Lectures on Modules and Rings; Springer: New York, 1999; Vol. 189. [Google Scholar] [CrossRef]
  14. Bhatia, R. Positive Definite Matrices; Princeton University Press: Princeton, NJ, 2007. [Google Scholar]
  15. Higham, N.J. Functions of Matrices: Theory and Computation; SIAM: Philadelphia, 2008. [Google Scholar] [CrossRef]
  16. Horn, R.A.; Johnson, C.R. Topics in Matrix Analysis; Cambridge University Press: Cambridge, 1991. [Google Scholar]
  17. Kailath, T. Linear Systems; Prentice-Hall: Englewood Cliffs, NJ, 1980. [Google Scholar]
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

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings