Matrix Determinant Calculator

Reviewed by Hamza Gujjar, Algorithm Architect & Software Developer Last updated: August 19, 2026

📚 Confused about how this is calculated? Read the full The Determinant: How Much a Transformation Stretches Space →

A Single Number That Summarizes a Matrix

The determinant compresses an entire square matrix into one scalar value that tells you something fundamental about the transformation it represents — whether it can be inverted, and how much it scales area or volume. A determinant of zero means the matrix is singular: it collapses space down a dimension and has no inverse.

The Formulas

2×2: det(A) = a11×a22 − a12×a21
3×3 (cofactor expansion along row 1):
det(A) = a11(a22a33−a23a32) − a12(a21a33−a23a31) + a13(a21a32−a22a31)

Worked Examples

Determinant for sample matrices
Matrix	Determinant
[4, 7; 2, 6]	(4×6) − (7×2) = 10
[1,2,3; 0,1,4; 5,6,0]	1

Where This Matters

Solvability of linear systems — a non-zero coefficient-matrix determinant guarantees a system of equations has exactly one solution.
Area and volume scaling — the absolute value of a 2×2 or 3×3 determinant gives the area or volume scale factor of the linear transformation the matrix represents.
Testing invertibility — before attempting to invert a matrix, checking its determinant is non-zero avoids wasted computation on a singular matrix.

How to Use This Calculator

Choose the matrix size: 2 x 2 Matrix or 3 x 3 Matrix.
Enter each cell value (row1 col1, row1 col2, and so on).
Select Calculate to get the determinant.

Related Calculations

A non-zero determinant means you can invert the matrix with the Matrix Inverse Calculator, or use it directly in the Cramer's Rule Calculator.

Geometric and Algebraic Foundations of the Matrix Determinant

The determinant — denoted as det(A) or |A| — is a scalar property defined exclusively for square matrices (n×n). Geometrically, the absolute value of the determinant represents the geometric volume scaling factor of the linear transformation mapped by the matrix:

2D Determinant: Area of the parallelogram spanned by the two column vectors.
3D Determinant: Volume of the parallelepiped spanned by the three column vectors.
Orientation: The sign of det(A) indicates whether the transformation preserves orientation (det > 0) or reverses spatial orientation (det < 0, spatial reflection).

Formulas for 2x2 and 3x3 Determinants

2x2 Formula: det [ [a, b], [c, d] ] = ad - bc

For a 3×3 matrix, Laplace cofactor expansion along the first row yields:

det(A) = a(ei - fh) - b(di - fg) + c(dh - eg)

Fundamental Properties of Matrix Determinants

Mathematical Property	Formal Algebraic Identity	Operational Consequence
Multiplicative Identity	det(A × B) = det(A) × det(B)	Determinant of matrix product equals product of determinants
Matrix Invertibility	det(A^-1) = 1 / det(A)	Matrix A is invertible if and only if det(A) ≠ 0
Transpose Invariance	det(A^T) = det(A)	Transposing rows into columns does not alter determinant
Row Swap Sign Flip	det(A_swapped) = -det(A)	Swapping any two rows or columns flips algebraic sign
Triangular Matrix	det(A) = ∏ a_ii	Determinant equals the simple product of main diagonal entries

Step-by-Step Worked Calculation Example

Example: Calculating the Determinant of a 3x3 Matrix via Cofactor Expansion

Problem: Calculate the determinant of matrix A = [ [3, 2, -1], [1, 4, 2], [2, 0, 5] ].

Step 1: Perform Laplace expansion along Row 3 (taking advantage of zero entry):

det(A) = a₃₁ × C₃₁ + a₃₂ × C₃₂ + a₃₃ × C₃₃

Step 2: Calculate cofactors:

Minor M₃₁ = det [ [2, -1], [4, 2] ] = (2 × 2) - (-1 × 4) = 4 + 4 = 8 &implies; C₃₁ = +8

Entry a₃₂ = 0 (Term evaluates to 0)

Minor M₃₃ = det [ [3, 2], [1, 4] ] = (3 × 4) - (2 × 1) = 12 - 2 = 10 &implies; C₃₃ = +10

Step 3: Sum expansion terms:

det(A) = (2 × 8) + (0) + (5 × 10) = 16 + 50 = +66

Conclusion: det(A) = 66. Because det(A) ≠ 0, matrix A is non-singular and invertible, scaling 3D volumes by a factor of 66.

Common Pitfalls in Determinant Calculations

Sign Errors in Cofactor Checkerboard Pattern: Cofactor signs follow (-1)^i+j; element (1,2) carries a negative sign, while (1,1) and (1,3) carry positive signs.

Eigenvalues and the Characteristic Polynomial

In linear dynamical systems and structural modal analysis, the matrix determinant is the fundamental operator used to find matrix Eigenvalues (λ) — scalar scaling factors where matrix transformation acts as pure stretching: A × v = λ × v.

Eigenvalues are the exact roots of the Characteristic Polynomial:

p(λ) = det(A - λ × I_n) = 0

The determinant satisfies the fundamental spectral identity: the determinant of any matrix equals the product of all its complex eigenvalues:

det(A) = ∏_i=1ⁿ λ_i = λ₁ × λ₂ × … × λ_n

The Jacobian Determinant in Multivariable Calculus

When changing coordinate variables in multi-dimensional integrals (such as transforming Cartesian coordinates to spherical coordinates: (x,y,z) → (r,θ,φ)), the infinitesimal volume element scales by the absolute value of the Jacobian Matrix Determinant:

dx dy dz = | det(J) | dr dθ dφ = r² sin(φ) dr dθ dφ

The Leibniz Permutation Formula for N×N Determinants

In formal mathematical algebra, the general determinant of an n×n matrix A is defined over all n! permutations σ of the symmetric permutation group S_n:

det(A) = ∑_{σ ∈ S_n} [ sgn(σ) × ∏_i=1ⁿ a_{i, σ(i)} ]

Where sgn(σ) is the signature (parity) of permutation σ (+1 for even permutations and -1 for odd permutations). For a 3×3 matrix, this formula generates the 3! = 6 product terms of Sarrus' rule.

Trace-Determinant Relation via Matrix Exponentials

In differential equations and Lie theory, the determinant of a matrix exponential satisfies Jacobi's Formula:

det(e^A) = e^tr(A)

Where tr(A) = ∑ a_ii is the Matrix Trace (sum of main diagonal elements). This identity ensures that continuous linear dynamic flow fields preserve phase-space volume whenever the trace of the velocity gradient matrix is zero (divergence-free incompressible fluid flow).

Vandermonde Determinants in Polynomial Interpolation

In polynomial curve fitting and error-correcting Reed-Solomon codes, the Vandermonde Matrix features geometric progressions across rows (V_ij = α_i^j-1). Its determinant factors into a remarkable closed-form product of all pairwise coordinate differences:

det(V) = ∏_{1 ≤ i < j ≤ n} ( α_j - α_i )

Because det(V) ≠ 0 whenever all coordinate nodes α_i are distinct, a unique interpolating polynomial of degree (n - 1) is mathematically guaranteed to pass through any set of n distinct data points.

Hessian Determinant and Multivariable Optimization

In multivariable calculus and machine learning loss optimization, the Hessian Matrix H(f) contains all second-order partial derivatives (∂²f / ∂x_i ∂x_j). Evaluating the determinant and principal minors of the Hessian classifies critical stationary points: a positive-definite Hessian (all positive principal minors, det(H) > 0) guarantees a strict local minimum, while an indefinite Hessian identifies a saddle point.

Gram Determinants and Linear Independence

In linear algebra, the Gram Matrix G has entries G_ij = v_i · v_j. Its determinant (the Gramian det(G)) is strictly positive if and only if the vectors are linearly independent, equaling the squared volume of the spanned parallelotope.

Circulant Matrix Determinants

In digital communications and circular convolution, circulant matrix determinants factor directly into discrete Fourier transform eigenvalues, accelerating cyclic redundancy check computations.