In linear algebra and statistics, the pseudo-determinant is the product of all non-zero eigenvalues of a square matrix. It coincides with the regular determinant when the matrix is non-singular.
Definition The pseudo-determinant of a square n-by-n matrix A may be defined as:
| A | + = lim α → 0 | A + α I | α n − rank ( A ) {\displaystyle |\mathbf {A} |_{+}=\lim _{\alpha \to 0}{\frac {|\mathbf {A} +\alpha \mathbf {I} |}{\alpha ^{n-\operatorname {rank} (\mathbf {A} )}}}}
where |A| denotes the usual determinant, I denotes the identity matrix and rank(A) denotes the matrix rank of A.
Definition of pseudo-determinant using Vahlen matrix The Vahlen matrix of a conformal transformation, the Möbius transformation (i.e. ( a x + b ) ( c x + d ) − 1 {\displaystyle (ax+b)(cx+d)^{-1}} for a , b , c , d ∈ G ( p , q ) {\displaystyle a,b,c,d\in {\mathcal {G}}(p,q)} ), is defined as [ f ] = [ a b c d ] {\displaystyle [f]={\begin{bmatrix}a&b\\c&d\end{bmatrix}}} . By the pseudo-determinant of the Vahlen matrix for the conformal transformation, we mean
pdet [ a b c d ] = a d † − b c † . {\displaystyle \operatorname {pdet} {\begin{bmatrix}a&b\\c&d\end{bmatrix}}=ad^{\dagger }-bc^{\dagger }.}
If pdet [ f ] > 0 {\displaystyle \operatorname {pdet} [f]>0} , the transformation is sense-preserving (rotation) whereas if the pdet [ f ] < 0 {\displaystyle \operatorname {pdet} [f]<0} , the transformation is sense-preserving (reflection).
… excerpt ends here. Continue reading the full article.
