Pseudo-determinant

Last updated October 28, 2022

In linear algebra and statistics, the pseudo-determinant^[1] 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:

|\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 rank of A.^[2]

Definition of pseudo-determinant using Vahlen matrix

The Vahlen matrix of a conformal transformation, the Möbius transformation (i.e. $(ax+b)(cx+d)^{-1}$ for $a,b,c,d\in {\mathcal {G}}(p,q)$ ), is defined as $[f]={\begin{bmatrix}a&b\\c&d\end{bmatrix}}$ . By the pseudo-determinant of the Vahlen matrix for the conformal transformation, we mean

\operatorname {pdet} {\begin{bmatrix}a&b\\c&d\end{bmatrix}}=ad^{\dagger }-bc^{\dagger }.

If $\operatorname {pdet} [f]>0$ , the transformation is sense-preserving (rotation) whereas if the $\operatorname {pdet} [f]<0$ , the transformation is sense-preserving (reflection).

Computation for positive semi-definite case

If $A$ is positive semi-definite, then the singular values and eigenvalues of $A$ coincide. In this case, if the singular value decomposition (SVD) is available, then $|\mathbf {A} |_{+}$ may be computed as the product of the non-zero singular values. If all singular values are zero, then the pseudo-determinant is 1.

Supposing $\operatorname {rank} (A)=k$ , so that k is the number of non-zero singular values, we may write $A=PP^{\dagger }$ where $P$ is some n-by-k matrix and the dagger is the conjugate transpose. The singular values of $A$ are the squares of the singular values of $P$ and thus we have $|A|_{+}=\left|P^{\dagger }P\right|$ , where $\left|P^{\dagger }P\right|$ is the usual determinant in k dimensions. Further, if $P$ is written as the block column $P=\left({\begin{smallmatrix}C\\D\end{smallmatrix}}\right)$ , then it holds, for any heights of the blocks $C$ and $D$ , that $|A|_{+}=\left|C^{\dagger }C+D^{\dagger }D\right|$ .

Application in statistics

If a statistical procedure ordinarily compares distributions in terms of the determinants of variance-covariance matrices then, in the case of singular matrices, this comparison can be undertaken by using a combination of the ranks of the matrices and their pseudo-determinants, with the matrix of higher rank being counted as "largest" and the pseudo-determinants only being used if the ranks are equal.^[3] Thus pseudo-determinants are sometime presented in the outputs of statistical programs in cases where covariance matrices are singular.^[4]

Related Research Articles

In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. It allows characterizing some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants . The determinant of a matrix $A$ is denoted $det(A)$ , $det A$ , or $| A |$ .

In linear algebra, the rank of a matrix $A$ is the dimension of the vector space generated by its columns. This corresponds to the maximal number of linearly independent columns of $A$ . This, in turn, is identical to the dimension of the vector space spanned by its rows. Rank is thus a measure of the "nondegenerateness" of the system of linear equations and linear transformation encoded by $A$ . There are multiple equivalent definitions of rank. A matrix's rank is one of its most fundamental characteristics.

In mathematics, a symmetric matrix $with real entries is positive-definite if the real number is positive for every nonzero real column vector where is the transpose of . More generally, a Hermitian matrix is positive-definite if the real number is positive for every nonzero complex column vector where denotes the conjugate transpose of$

In linear algebra, the trace of a square matrix $A$ , denoted $tr(A)$ , is defined to be the sum of elements on the main diagonal of $A$ . The trace is only defined for a square matrix.

In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally,

<span class="mw-page-title-main">Singular value decomposition</span> Matrix decomposition

In linear algebra, the singular value decomposition (SVD) is a factorization of a real or complex matrix. It generalizes the eigendecomposition of a square normal matrix with an orthonormal eigenbasis to any $matrix. It is related to the polar decomposition.$

In mathematics, a square matrix is a matrix with the same number of rows and columns. An n-by-n matrix is known as a square matrix of order $.$ Any two square matrices of the same order can be added and multiplied.

<span class="mw-page-title-main">Symplectic group</span> Mathematical group

In mathematics, the name symplectic group can refer to two different, but closely related, collections of mathematical groups, denoted $Sp(2 n, F)$ and $Sp(n)$ for positive integer n and field F. The latter is called the compact symplectic group and is also denoted by $. Many authors prefer slightly different notations, usually differing by factors of 2 . The notation used here is consistent with the size of the most common matrices which represent the groups. In Cartan's classification of the simple Lie algebras, the Lie algebra of the complex group Sp(2 n, C) is denoted C n, and Sp(n) is the compact real form of Sp(2 n, C) . Note that when we refer to the (compact) symplectic group it is implied that we are talking about the collection of (compact) symplectic groups, indexed by their dimension n .$

In mathematics, particularly in linear algebra, a skew-symmetricmatrix is a square matrix whose transpose equals its negative. That is, it satisfies the condition

In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices. Elements of the main diagonal can either be zero or nonzero. An example of a 2×2 diagonal matrix is $, while an example of a 3\times3 diagonal matrix is . An identity matrix of any size, or any multiple of it, is a diagonal matrix.$

<span class="mw-page-title-main">Covariance matrix</span> Measure of covariance of components of a random vector

In probability theory and statistics, a covariance matrix is a square matrix giving the covariance between each pair of elements of a given random vector. Any covariance matrix is symmetric and positive semi-definite and its main diagonal contains variances.

In linear algebra, the adjugate or classical adjoint of a square matrix $A$ is the transpose of its cofactor matrix and is denoted by $adj(A)$ . It is also occasionally known as adjunct matrix, or "adjoint", though the latter today normally refers to a different concept, the adjoint operator which is the conjugate transpose of the matrix.

In linear algebra, an n-by-n square matrix $A$ is called invertible, if there exists an n-by-n square matrix $B$ such that

In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots. It has the determinant and the trace of the matrix among its coefficients. The characteristic polynomial of an endomorphism of a finite-dimensional vector space is the characteristic polynomial of the matrix of that endomorphism over any base. The characteristic equation, also known as the determinantal equation, is the equation obtained by equating the characteristic polynomial to zero.

In linear algebra, a QR decomposition, also known as a QR factorization or QU factorization, is a decomposition of a matrix A into a product A = QR of an orthogonal matrix Q and an upper triangular matrix R. QR decomposition is often used to solve the linear least squares problem and is the basis for a particular eigenvalue algorithm, the QR algorithm.

In geometry, Euler's rotation theorem states that, in three-dimensional space, any displacement of a rigid body such that a point on the rigid body remains fixed, is equivalent to a single rotation about some axis that runs through the fixed point. It also means that the composition of two rotations is also a rotation. Therefore the set of rotations has a group structure, known as a rotation group.

In linear algebra, an eigenvector or characteristic vector of a linear transformation is a nonzero vector that changes at most by a scalar factor when that linear transformation is applied to it. The corresponding eigenvalue, often denoted by $, is the factor by which the eigenvector is scaled.$

In linear algebra, eigendecomposition is the factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and eigenvectors. Only diagonalizable matrices can be factorized in this way. When the matrix being factorized is a normal or real symmetric matrix, the decomposition is called "spectral decomposition", derived from the spectral theorem.

In linear algebra, a branch of mathematics, a (multiplicative) compound matrix is a matrix whose entries are all minors, of a given size, of another matrix. Compound matrices are closely related to exterior algebras, and their computation appears in a wide array of problems, such as in the analysis of nonlinear time-varying dynamical systems and generalizations of positive systems, cooperative systems and contracting systems.

In statistics, the complex Wishart distribution is a complex version of the Wishart distribution. It is the distribution of $times the sample Hermitian covariance matrix of zero-mean independent Gaussian random variables. It has support for Hermitian positive definite matrices.$

References

↑ Minka, T.P. (2001). "Inferring a Gaussian Distribution". PDF
↑ Florescu, Ionut (2014). Probability and Stochastic Processes. Wiley. p. 529.
↑ SAS documentation on "Robust Distance"
↑ Bohling, Geoffrey C. (1997) "GSLIB-style programs for discriminant analysis and regionalized classification", Computers & Geosciences, 23 (7), 739–761 doi : 10.1016/S0098-3004(97)00050-2

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[minka-1] Minka, T.P. (2001). "Inferring a Gaussian Distribution". PDF

[2] Florescu, Ionut (2014). Probability and Stochastic Processes. Wiley. p. 529.

[3] SAS documentation on "Robust Distance"

[4] Bohling, Geoffrey C. (1997) "GSLIB-style programs for discriminant analysis and regionalized classification", Computers & Geosciences, 23 (7), 739–761 doi : 10.1016/S0098-3004(97)00050-2

[1]

[2]

[3]

[4]