Add, subtract, multiply matrices, find determinant, inverse, transpose, and eigenvalues for 2Γ2 and 3Γ3 matrices with full step-by-step solutions.
Matrices are rectangular arrays of numbers that form the backbone of linear algebra, one of the most powerful branches of mathematics with applications spanning computer graphics, economics, physics, machine learning, and engineering. Our free matrix calculator handles addition, subtraction, multiplication, determinant, inverse, transpose, and eigenvalue calculations for 2Γ2 and 3Γ3 matrices, complete with step-by-step working shown instantly.
Whether you are a student studying A-Level Further Mathematics in the UK, taking a Linear Algebra course at a US university, or simply need a quick matrix calculation for a project, this tool provides fast, accurate, and clearly explained results.
A matrix is a rectangular arrangement of numbers, symbols, or expressions laid out in rows and columns. The size (or order) of a matrix is described as m Γ n, where m is the number of rows and n is the number of columns. A 3Γ3 matrix has 3 rows and 3 columns, containing 9 elements in total.
Individual elements are referenced using subscript notation. The element in row i and column j of matrix A is written as aij. For example, in a 3Γ3 matrix A, the element a23 is the value in the second row, third column.
| Matrix Type | Description | Example |
|---|---|---|
| Square matrix | Same number of rows and columns | 2Γ2, 3Γ3, 4Γ4 |
| Row vector | Single row, multiple columns | 1Γ3 |
| Column vector | Single column, multiple rows | 3Γ1 |
| Identity matrix (I) | 1s on diagonal, 0s elsewhere | [[1,0],[0,1]] |
| Zero matrix | All elements are zero | [[0,0],[0,0]] |
| Diagonal matrix | Non-zero only on main diagonal | [[3,0],[0,5]] |
Adding or subtracting two matrices requires them to be the same size β the same number of rows and the same number of columns. The operation is performed element-by-element.
Rule: (A + B)ij = aij + bij
For example, adding two 2Γ2 matrices:
| A | B | A + B |
|---|---|---|
| [[1, 2], [3, 4]] | [[5, 6], [7, 8]] | [[6, 8], [10, 12]] |
Subtraction works identically: (A β B)ij = aij β bij. If the matrices are different sizes, addition and subtraction are undefined.
Matrix addition is commutative (A + B = B + A) and associative ((A + B) + C = A + (B + C)), which makes it analogous to ordinary number addition in those respects.
Matrix multiplication is more complex than addition. To multiply matrix A by matrix B, the number of columns in A must equal the number of rows in B. The result C = A Γ B has dimensions equal to the number of rows of A by the number of columns of B.
Formula: cij = Ξ£ aik Γ bkj (summed over k)
For two 2Γ2 matrices:
If A = [[a, b], [c, d]] and B = [[e, f], [g, h]], then:
A Γ B = [[ae+bg, af+bh], [ce+dg, cf+dh]]
Important: Matrix multiplication is not commutative. In general, A Γ B β B Γ A. This is a fundamental difference from scalar multiplication and catches many students out when first learning linear algebra.
The determinant is a single scalar value that can be computed from any square matrix. It encodes crucial information about the matrix, including whether it has an inverse and how it transforms geometric space.
For a 2Γ2 matrix A = [[a, b], [c, d]]:
det(A) = ad β bc
Example: for [[3, 2], [1, 4]], det = (3Γ4) β (2Γ1) = 12 β 2 = 10
For a 3Γ3 matrix, we expand along the first row:
det(A) = a11(a22a33 β a23a32) β a12(a21a33 β a23a31) + a13(a21a32 β a22a31)
A determinant of zero means the matrix is singular β it has no inverse. A non-zero determinant means the matrix is invertible.
| Determinant Value | Meaning |
|---|---|
| det = 0 | Singular matrix β no inverse exists; rows/columns are linearly dependent |
| det > 0 | Orientation-preserving transformation |
| det < 0 | Orientation-reversing transformation (reflection) |
| det = 1 | Volume-preserving transformation (rotation, special orthogonal) |
The inverse of a square matrix A, written Aβ1, satisfies: A Γ Aβ1 = Aβ1 Γ A = I (the identity matrix). The inverse exists only when det(A) β 0.
For A = [[a, b], [c, d]] with det(A) = ad β bc:
Aβ1 = (1/det(A)) Γ [[d, βb], [βc, a]]
The inverse of a 3Γ3 matrix involves computing the matrix of cofactors, transposing it (forming the adjugate or adjoint), and dividing by the determinant:
Aβ1 = adj(A) / det(A)
The cofactor Cij = (β1)i+j Γ Mij, where Mij is the minor β the determinant of the 2Γ2 sub-matrix formed by removing row i and column j from A.
The transpose of a matrix A, written AT, is formed by flipping the matrix over its main diagonal β swapping rows and columns. Element (i,j) of AT equals element (j,i) of A.
For a 2Γ2 matrix: if A = [[1, 2], [3, 4]], then AT = [[1, 3], [2, 4]].
For a 3Γ3 matrix: the first row becomes the first column, the second row becomes the second column, and so on.
Transpose has several important properties: (AT)T = A; (A + B)T = AT + BT; (AB)T = BTAT.
The identity matrix I is the matrix equivalent of the number 1. It has 1s along the main diagonal and 0s everywhere else. For any matrix A of compatible dimensions: A Γ I = I Γ A = A.
The 2Γ2 identity matrix is [[1, 0], [0, 1]]. The 3Γ3 identity is [[1,0,0],[0,1,0],[0,0,1]].
When you multiply a matrix by its inverse, you always get the identity matrix. This makes the identity matrix the "neutral element" of matrix multiplication.
For a square matrix A, an eigenvalue Ξ» and eigenvector v satisfy: A Γ v = Ξ» Γ v. In other words, multiplying v by A only scales v by the scalar Ξ» β the direction of v is unchanged.
For a 2Γ2 matrix, eigenvalues are found by solving the characteristic equation: det(A β Ξ»I) = 0, which gives a quadratic λ² β trace(A)Ξ» + det(A) = 0.
Eigenvalues reveal fundamental properties: the product of all eigenvalues equals the determinant, and their sum equals the trace (sum of diagonal elements). In physics and engineering, eigenvectors represent directions of stable behaviour under transformation.
Every rotation, scaling, shearing, and reflection you see in video games, CAD software, and 3D rendering is performed using matrix multiplication. A 3D transformation pipeline β from model coordinates to screen coordinates β involves multiplying a vertex (position vector) by a series of 4Γ4 transformation matrices. OpenGL, DirectX, and game engines like Unity all use matrix maths at their core.
Economist Wassily Leontief (Nobel Prize 1973) developed input-output analysis using matrices to model how industries depend on each other. If x is a vector of production levels and A is the matrix of input requirements, the model is: x = Ax + d, where d is final demand. Solving gives x = (I β A)β1d β requiring matrix inversion to find equilibrium production levels across an entire economy.
Neural networks are essentially a sequence of matrix multiplications and non-linear activations. Training a deep learning model involves computing gradients through matrices of weights. Principal Component Analysis (PCA), a dimensionality reduction technique, requires computing eigenvectors of the covariance matrix of a dataset.
In England, Wales, and Northern Ireland, matrices appear in the Further Mathematics A-Level syllabus. Students learn matrix operations including multiplication, finding determinants and inverses of 2Γ2 matrices, solving simultaneous equations using matrix methods, and geometric interpretations of 2Γ2 matrices as transformations. OCR, AQA, and Edexcel all include matrix topics in Further Pure 1.
In the United States, Linear Algebra is typically taken in the first or second year of a college mathematics, engineering, computer science, or physics degree. The standard textbook by Gilbert Strang (MIT) covers matrix operations extensively. Topics covered include row reduction, null spaces, column spaces, eigenvalue decomposition, singular value decomposition (SVD), and least squares β all built on the foundational matrix operations this calculator provides.
To add two matrices, they must have identical dimensions (same number of rows and columns). Add corresponding elements position by position. If A and B are both 2Γ2, then (A+B)11 = a11 + b11, and so on for all positions. The result has the same dimensions as the original matrices.
For a 2Γ2 matrix A = [[a, b], [c, d]], the determinant is det(A) = ad β bc. This is the product of the main diagonal elements minus the product of the anti-diagonal elements. A zero determinant means the matrix has no inverse (it is singular).
No. To multiply matrix A by matrix B (written AB), the number of columns in A must equal the number of rows in B. Two 3Γ3 matrices can always be multiplied. A 2Γ3 matrix can be multiplied by a 3Γ2 matrix (giving a 2Γ2 result), but not by a 2Γ3 matrix. Matrix multiplication is also not commutative β AB generally does not equal BA.
A determinant of zero means the matrix is singular β it has no inverse. Geometrically, it means the matrix collapses space into fewer dimensions (a 3Γ3 singular matrix maps all of 3D space onto a 2D plane or a line). In systems of equations, a singular coefficient matrix means the system either has no solution or infinitely many solutions.
First calculate det(A) β if it is zero, no inverse exists. Then find the 3Γ3 matrix of cofactors (each cofactor is the signed minor of the corresponding element). Transpose the cofactor matrix to get the adjugate. Finally, divide every element of the adjugate by det(A). The result is Aβ1. Verify by checking A Γ Aβ1 = I.
Eigenvalues tell you how a matrix scales along its principal directions. In data science, eigenvalues of the covariance matrix reveal how much variance exists along each principal component (used in PCA). In structural engineering, eigenvalues of stiffness matrices give natural vibration frequencies. In quantum mechanics, eigenvalues of operator matrices correspond to measurable physical quantities.
Matrix operations are not part of the standard GCSE Mathematics syllabus in England. They appear in the A-Level Further Mathematics syllabus (all major exam boards β AQA, Edexcel, OCR). Students learn 2Γ2 matrix multiplication, determinants, inverses, and geometric transformations. 3Γ3 determinants and inverses typically appear at degree level.
The transpose AT is formed by swapping rows and columns of A. If A is mΓn, then AT is nΓm. Transposes are used extensively in linear algebra: a symmetric matrix satisfies A = AT; orthogonal matrices satisfy AT = Aβ1. In machine learning, the transpose is used constantly in backpropagation and dot product calculations.
Results are for educational purposes. Matrix calculations involve floating-point arithmetic and very large or ill-conditioned matrices may show rounding errors. Always verify critical calculations independently.