Linear Algebra: Trace and Determinant Properties

Understanding a matrix isn't just about its entries; it's about uncovering the fundamental numerical signatures that define its core behavior. In engineering, from control theory to quantum mechanics, two such signatures—the trace and the determinant—serve as powerful invariants. These scalars encapsulate essential information about linear transformations, governing system stability, volume scaling, and eigenvalue analysis, making them indispensable tools for solving real-world problems.

Defining the Fundamental Invariants

We begin by defining these two key quantities for a square matrix $A$ of size $n\times n$.

The trace of a matrix, denoted $\mathrm{tr}(A)$, is the sum of its diagonal entries. Formally, if $A=[a_{ij}]$, then: $$\mathrm{tr}(A)=a_{11}+a_{22}+\cdots +a_{nn}=\sum _{i=1}^n{a}_{ii}.$$ Despite its simple definition, the trace has profound linearity properties: $\mathrm{tr}(A+B)=\mathrm{tr}(A)+\mathrm{tr}(B)$ and $\mathrm{tr}(cA)=c\mathrm{tr}(A)$ for any scalar $c$. Crucially, it is cyclic: $\mathrm{tr}(AB)=\mathrm{tr}(BA)$, even though $AB$ and $BA$ may be completely different matrices.

The determinant, denoted $\det (A)$ or $|A|$, is a more complex scalar that determines whether a matrix is invertible and describes the scaling factor of the linear transformation it represents. A matrix is invertible if and only if $\det (A)\ne 0$. The determinant is multiplicative: $\det (AB)=\det (A)\det (B)$. It also scales linearly with each row: multiplying a single row by a scalar $k$ multiplies the determinant by $k$.

Connection to Eigenvalues: The Spectral View

The deepest insights into trace and determinant come from their relationship with eigenvalues. If ${\lambda }_1,{\lambda }_2,\dots ,{\lambda }_n$ are the eigenvalues of $A$ (counting algebraic multiplicities), then two fundamental identities hold:

1. The trace is the sum of the eigenvalues: $\mathrm{tr}(A)={\lambda }_1+{\lambda }_2+\cdots +{\lambda }_n$.
2. The determinant is the product of the eigenvalues: $\det (A)={\lambda }_1{\lambda }_2\cdots {\lambda }_n$.

These relationships are not just theoretical; they provide a direct computational shortcut. For a $2\times 2$ matrix $A=\left[\begin{array}{cc}a& b\\ c& d\end{array}\right]$, you can verify that $\mathrm{tr}(A)=a+d$ and $\det (A)=ad-bc$. The characteristic polynomial is ${\lambda }^2-(a+d)\lambda +(ad-bc)={\lambda }^2-\mathrm{tr}(A)\lambda +\det (A)$, whose roots are the eigenvalues. This elegantly shows the trace and determinant as the sum and product of the roots, respectively.

Similarity Invariance and the Characteristic Polynomial

A central concept in linear algebra is similarity. 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 but in different bases. Both the trace and determinant are similarity invariants: if $A$ and $B$ are similar, then $\mathrm{tr}(A)=\mathrm{tr}(B)$ and $\det (A)=\det (B)$. This is why they are called invariants—they are properties of the transformation itself, not just its representation in one particular basis.

This invariance is directly linked to the characteristic polynomial, defined as $p(\lambda )=\det (\lambda I-A)$. For an $n\times n$ matrix, this polynomial expands to: $$p(\lambda )={\lambda }^n-\mathrm{tr}(A){\lambda }^{n-1}+\cdots +(-1{)}^n\det (A).$$ The coefficients of this polynomial are themselves invariants. The two most prominent are the coefficient of ${\lambda }^{n-1}$, which is $-\mathrm{tr}(A)$, and the constant term, which is $(-1{)}^n\det (A)$. Since similar matrices share the same characteristic polynomial, the invariance of trace and determinant follows logically.

Applications to Engineering System Analysis

These properties are not mere abstractions; they are workhorses in engineering analysis. Consider a linear time-invariant system described by the state matrix $A$.

• Stability Analysis: The stability of the system is determined by the eigenvalues of $A$. The system is stable if all eigenvalues have negative real parts. While computing eigenvalues explicitly can be intensive, the trace and determinant offer quick checks. For a $2\times 2$ system, a necessary condition for stability is $\mathrm{tr}(A)<0$ (sum of eigenvalues negative) and $\det (A)>0$ (product of eigenvalues positive). A failure of either condition immediately indicates instability.
• Diagonalization and Decoupling: In many physical systems, such as coupled oscillators or electrical circuits, we seek to diagonalize the system matrix. A matrix is diagonalizable if it is similar to a diagonal matrix $D$ containing its eigenvalues. The invariants provide a sanity check: the trace and determinant of the original matrix must equal the trace and determinant of the diagonal matrix $D$, which are simply the sum and product of the diagonal entries (the eigenvalues).
• Volume and Scaling in Transformations: In computer graphics, robotics, and fluid dynamics, the determinant gives the scaling factor of volumes under the linear map. A determinant of 1 preserves volume (an isometry), a positive determinant preserves orientation, and a determinant of zero collapses the space into a lower dimension, indicating a loss of information or a singular system configuration.

Common Pitfalls

1. Assuming Trace/Multiplicative Properties for Non-Square Matrices: The trace and determinant are defined only for square matrices. A common error is trying to compute $\mathrm{tr}(AB)$ when $A$ is $m\times n$ and $B$ is $n\times m$—this is actually valid because $AB$ is square. However, $\mathrm{tr}(A)$ itself is undefined if $A$ is not square.
2. Confusing $\mathrm{tr}(AB)$ with $\mathrm{tr}(A)\mathrm{tr}(B)$: The trace is not multiplicative. In general, $\mathrm{tr}(AB)\ne \mathrm{tr}(A)\mathrm{tr}(B)$. The correct property is the cyclic property: $\mathrm{tr}(AB)=\mathrm{tr}(BA)$.
3. Misapplying the Eigenvalue Properties: The identities $\mathrm{tr}(A)=\sum {\lambda }_i$ and $\det (A)=\prod {\lambda }_i$ hold when all eigenvalues are accounted for according to their algebraic multiplicity. For a matrix with a repeated eigenvalue, that eigenvalue must be summed or multiplied the correct number of times. Furthermore, these properties hold over the complex numbers; a real matrix may have complex eigenvalues, but their sum (the trace) and product (the determinant) will still be real numbers.
4. Overlooking the Determinant's Role in Invertibility: It is easy to computationally check for invertibility by other means, but forgetting that $\det (A)=0$ is the definitive, mathematical litmus test for a singular (non-invertible) matrix can lead to flawed theoretical reasoning about system solvability or transformation reversibility.

Summary

• The trace ($\mathrm{tr}$) is the sum of diagonal entries and is a linear, cyclic invariant. The determinant ($\det$) determines invertibility, is multiplicative, and represents volume scaling.
• Both are similarity invariants and are fundamentally connected to eigenvalues: the trace equals the sum of eigenvalues, and the determinant equals their product.
• They appear as key coefficients in the characteristic polynomial $p(\lambda )=\det (\lambda I-A)$, which is itself invariant under similarity transformations.
• In engineering applications, these invariants are crucial for rapid system stability checks (especially for 2x2 systems), verifying diagonalization, and understanding the geometric impact of linear transformations.
• Avoid common mistakes like applying these concepts to non-square matrices, misremembering their algebraic properties, or neglecting the conditions under which the eigenvalue relationships hold.