Linear Algebra: Trace and Determinant Properties

In engineering and applied mathematics, matrices aren't just grids of numbers; they represent systems—whether electrical networks, control systems, or structural models. To understand these systems, you need tools that reveal their core, invariant characteristics. The trace and the determinant are two such fundamental tools. They act as fingerprints of a matrix, providing key numerical summaries that remain unchanged under fundamental transformations and are deeply linked to a matrix’s most important feature: its eigenvalues. Mastering their properties is essential for analyzing stability, simplifying computations, and interpreting system behavior.

Defining the Fundamental Invariants

The trace of a square matrix $A$, denoted $\text{tr}(A)$, is simply the sum of its diagonal entries. If $A$ is an $n\times n$ matrix with entries $a_{ij}$, then: $$\text{tr}(A)=a_{11}+a_{22}+\cdots +a_{nn}=\sum _{i=1}^n{a}_{ii}.$$ Its definition is straightforward, but its importance emerges from its elegant algebraic behavior.

The determinant, denoted $\det (A)$ or $|A|$, is a more complex scalar value computed from all the entries of the matrix. For a $2\times 2$ matrix $A=\left[\begin{array}{cc}a& b\\ c& d\end{array}\right]$, the determinant is $ad-bc$. For larger matrices, computation involves cofactor expansion or row reduction. Conceptually, the determinant gives you the scaling factor of the linear transformation represented by $A$. If $\det (A)=0$, the matrix is singular, meaning it collapses space (it has no inverse and its columns are linearly dependent). A non-zero determinant indicates an invertible (non-singular) transformation.

Core Algebraic Properties

The trace and determinant obey powerful rules that make them indispensable for calculations. A key property is their behavior under cyclic permutations and matrix products. For any two square matrices $A$ and $B$ of the same size, the trace is cyclic: $\text{tr}(AB)=\text{tr}(BA)$. This does not extend to three arbitrary matrices as $\text{tr}(ABC)=\text{tr}(CAB)$, which is a useful simplification. The trace is also linear: $\text{tr}(A+B)=\text{tr}(A)+\text{tr}(B)$ and $\text{tr}(cA)=c\text{tr}(A)$ for a scalar $c$.

The determinant has multiplicative and scaling properties. For two $n\times n$ matrices, $\det (AB)=\det (A)\det (B)$. Scaling a matrix by a factor $c$ (multiplying every entry by $c$) scales the determinant by $c^n$: $\det (cA)=c^n\det (A)$. Furthermore, the determinant of a matrix is equal to the determinant of its transpose: $\det (A)=\det (A^T)$.

The Deep Connection to Eigenvalues

The most profound insights come from linking trace and determinant to a matrix's eigenvalues. If ${\lambda }_1,{\lambda }_2,\dots ,{\lambda }_n$ are the eigenvalues of an $n\times n$ matrix $A$ (counting algebraic multiplicities), then:

• Trace as sum of eigenvalues: $\text{tr}(A)={\lambda }_1+{\lambda }_2+\cdots +{\lambda }_n$.
• Determinant as product of eigenvalues: $\det (A)={\lambda }_1{\lambda }_2\cdots {\lambda }_n$.

This connection is not just beautiful; it's immensely practical. For instance, if you know a $3\times 3$ matrix has eigenvalues 2, 2, and -1, you immediately know its trace is $2+2-1=3$ and its determinant is $2\ast 2\ast (-1)=-4$, without any further calculation. This relationship directly stems from the characteristic polynomial.

The Characteristic Polynomial and Invariance

The characteristic polynomial of a matrix $A$ is defined as $p(\lambda )=\det (\lambda I-A)$, where $I$ is the identity matrix. This polynomial's roots are the eigenvalues. For an $n\times n$ matrix, expanding this determinant reveals that: $$p(\lambda )={\lambda }^n-\text{tr}(A){\lambda }^{n-1}+\cdots +(-1{)}^n\det (A).$$ Here, the coefficient of ${\lambda }^{n-1}$ is $-\text{tr}(A)$ and the constant term is $(-1{)}^n\det (A)$. These coefficients provide a direct algebraic bridge between the matrix entries, the trace, the determinant, and the eigenvalues.

This leads to a critical concept: similarity invariance. Two matrices $A$ and $B$ are similar if there exists an invertible matrix $P$ such that $B=P^{-1}AP$. Similar matrices represent the same linear transformation under a change of basis. Crucially, similar matrices share the same eigenvalues, and therefore the same trace and determinant. In other words, both $\text{tr}(A)$ and $\det (A)$ are invariant under similarity transformations. This is why they are considered fundamental matrix invariants—they capture essential properties of the transformation itself, independent of the coordinate system chosen to describe it.

Applications to Engineering System Analysis

These properties are not merely abstract; they are workhorses in engineering analysis. Consider a linear time-invariant system described by the state-space model $\dot{x}=Ax$. The stability of this system is determined by the eigenvalues of the system matrix $A$. The system is stable if all eigenvalues have negative real parts.

• Quick Stability Checks: The trace and determinant offer rapid insights, especially for $2\times 2$ systems. For a $2\times 2$ matrix $A$, the characteristic polynomial is ${\lambda }^2-\text{tr}(A)\lambda +\det (A)=0$. By the Routh-Hurwitz criteria for a second-order polynomial, stability requires $\text{tr}(A)<0$ and $\det (A)>0$. You can assess potential stability without fully computing eigenvalues.
• Controllability and Observability: In control theory, the trace appears in measures of system performance and in the computation of Gramians, which are used to analyze how easily a system can be controlled or observed.
• Volume and Scaling: In robotics and computer graphics, the determinant of a transformation matrix tells you how it scales volumes. A determinant of 1 preserves volume (a rotation), while a determinant of 0 indicates the transformation projects onto a lower-dimensional space.
• Numerical Methods: The property $\text{tr}(AB)=\text{tr}(BA)$ is frequently used to simplify complex expressions in derivations for finite element analysis or signal processing algorithms.

Common Pitfalls

1. Assuming $\text{tr}(ABC)=\text{tr}(ACB)$: The cyclic property allows you to move the first matrix to the end: $\text{tr}(ABC)=\text{tr}(BCA)=\text{tr}(CAB)$. You cannot arbitrarily swap any two matrices. For example, $\text{tr}(ABC)$ is generally not equal to $\text{tr}(ACB)$.
2. Forgetting the $c^n$ factor in $\det (cA)$: A frequent error is to write $\det (cA)=c\det (A)$. Remember, multiplying a row by $c$ multiplies the determinant by $c$, but multiplying the entire matrix by $c$ multiplies every row by $c$, hence the factor is $c^n$.
3. Confusing invariance properties: Trace and determinant are invariant under similarity transformations ($B=P^{-1}AP$). They are not generally invariant under other operations like transposition (trace is, determinant is), or under left-multiplication by an arbitrary matrix.
4. Mixing up sum and product identities: In the heat of an exam, it’s easy to mistakenly think the trace is the product of eigenvalues or the determinant is the sum. A quick mnemonic: "Trace starts with T, which looks like a plus sign (+). Determinant starts with D, which is like a product sign (×)."

Summary

• The trace is the sum of diagonal entries and is linear and cyclic ($\text{tr}(AB)=\text{tr}(BA)$). The determinant measures the scaling factor of a linear transformation and is multiplicative ($\det (AB)=\det (A)\det (B)$).
• Both are intimately connected to eigenvalues: the trace equals their sum, and the determinant equals their product. These relationships are evident in the coefficients of the characteristic polynomial.
• Trace and determinant are similarity invariants; they remain unchanged when the matrix is expressed in a different basis, making them fundamental properties of the underlying linear transformation.
• In engineering, these properties enable rapid system stability checks (especially for second-order systems), simplify complex derivations, and provide insight into volume scaling and system controllability.