Matrix Trace Calculator

The trace of a square matrix is the sum of the entries on its main diagonal, running from the upper-left corner to the lower-right corner. For a 2 by 2 matrix with diagonal values a and d, the trace is simply a plus d. Off-diagonal values do not contribute directly. This makes trace one of the fastest important matrix quantities to compute. Trace is defined only for square matrices because only they have a main diagonal that pairs every row with a corresponding column. The result is a scalar and may be positive, negative, or zero. A zero trace does not mean the matrix is a zero matrix or a singular matrix; positive and negative diagonal entries may simply cancel. The trace has several valuable algebraic properties. It is linear, so the trace of A plus B equals the trace of A plus the trace of B, and scaling a matrix scales its trace. It is also invariant under similarity transformations. Similar matrices represent the same linear transformation in different bases, yet their traces agree. This makes trace a useful coordinate-independent summary. Another key identity is that the trace of a product A times B equals the trace of B times A whenever both products are defined and square. Matrix multiplication itself is not commutative, but trace permits this cyclic rearrangement. For longer products, factors can be rotated cyclically without changing the trace, a fact used frequently in statistics, optimization, and quantum mechanics. The trace also equals the sum of a matrix's eigenvalues, counted with algebraic multiplicity, even when those eigenvalues are complex. It appears in characteristic polynomials, divergence calculations, covariance analysis, expected quadratic forms, and descriptions of quantum states. In differential equations, trace can help characterize local expansion or contraction of a dynamical system. This calculator validates that every row has the same length and that the matrix is square, then adds the diagonal entries directly. Integers, negative numbers, and decimals are accepted. Because only one addition per diagonal entry is needed, the method remains immediate even as matrix size grows. The displayed value is rounded only to remove insignificant floating-point noise.