The Setting
The linear data for the three-graph construction are two explicit complex matrices acting on . Their product is considered through a matrix of eigenvectors, while a common fixed point concerns the two projective transformations separately.
The scalars are defined by (1), with the imaginary unit and the square roots taken positive: (1) The matrices are the matrices in (2): (2) Write and also for the associated linear automorphisms of and for their induced projective transformations. A point is the line spanned by a nonzero vector , and the projective actions are and .
For a real parameter , the expanding root and the contracting root are the numbers defined by (3), where the real square root is taken to be zero on negative arguments. (3) For a complex matrix and a real parameter , the hyperbolic basis matrix is the matrix in (4). (4) The eigenbasis matrix for is defined in (5), where denotes the corresponding expanding root: (5)✦
The Claim
Theorem 1. For the matrices and in (2), the determinant identities are (6) and (7): (6)✦ (7)✦ Their traces are given by (8) and (9): (8)✦ (9)✦ The relative matrix and the product have the traces in (10) and (11): (10)✦ (11)✦ With the identity matrix, their cubes satisfy (12) and (13): (12)✦ (13)✦ For every real , the root functions in (3) satisfy (14): (14)✦ For and in (5), the diagonalization is (15), with the bound (16): (15)✦ (16)✦ The projective actions satisfy (17): (17)✦
In the paper, the result reads: have , and ; the linear orders of , and are respectively , and , and have projective order , the eigenvalues of are positive real reciprocals of distinct moduli, and and have no common eigenline.
What Is Checked
The statements concern the explicit matrices and of (2), their associated linear automorphisms and projective transformations, the eigenbasis matrix of (5), and the root functions of (3) for real parameters .