📊 Properties Calculators

The Determinant: What It Means

The determinant of a square matrix is a scalar value that encodes geometric and algebraic information about the linear transformation the matrix represents. For a 2×2 matrix [[a, b], [c, d]], det = ad − bc. Geometrically, the absolute value of the determinant gives the scale factor by which the transformation stretches or shrinks area (in 2D) or volume (in 3D). A determinant of 0 means the matrix is singular — it collapses space into a lower dimension, and the matrix has no inverse. A negative determinant means the transformation includes a reflection (it reverses orientation). The determinant of an identity matrix is always 1; multiplying the determinant by a scalar k scales the determinant by k^n for an n×n matrix.

Matrix Inverse and When It Exists

The inverse of a matrix A, written A⁻¹, is the unique matrix such that A × A⁻¹ = A⁻¹ × A = I (the identity matrix). An inverse exists if and only if the determinant is non-zero (i.e., the matrix is non-singular). For a 2×2 matrix [[a, b], [c, d]] with det = ad − bc ≠ 0, the inverse is (1/det) × [[d, −b], [−c, a]]. For 3×3 matrices, the inverse is computed via the adjugate matrix divided by the determinant. Matrix inverses are used to solve systems of equations (x = A⁻¹b), compute transformations in computer graphics, and factor matrices in machine learning algorithms. Note that matrix inverse is not element-wise division — it is a fundamentally different operation.

Eigenvalues and Eigenvectors

An eigenvector of a matrix A is a non-zero vector v such that Av = λv — the matrix transforms the vector by scaling it (not rotating it) by the scalar factor λ, called the eigenvalue. To find eigenvalues, solve the characteristic equation det(A − λI) = 0, which produces a polynomial in λ. For a 2×2 matrix, this gives a quadratic equation with up to two eigenvalues; a 3×3 matrix yields a cubic. Eigenvalues can be real or complex. Eigenvalues and eigenvectors are central to principal component analysis (PCA) in data science, quantum mechanics (energy levels), structural engineering (resonant frequencies), and Google's PageRank algorithm. The trace of a matrix equals the sum of its eigenvalues; the determinant equals their product.

Matrix Rank and Linear Independence

The rank of a matrix is the maximum number of linearly independent rows (or equivalently, columns). A row is linearly independent if it cannot be expressed as a linear combination of the other rows. Rank is found by reducing the matrix to row echelon form via Gaussian elimination and counting the non-zero rows. An n×n matrix has full rank n if and only if its determinant is non-zero (it is invertible). The rank-nullity theorem states that rank + nullity = n, where nullity is the dimension of the null space (the set of vectors x such that Ax = 0). Rank determines whether a system of linear equations has a unique solution, no solution, or infinitely many solutions — it is the single most important property for solving linear systems.