Addition of matrices

A matrix is just a rectangular table of numbers, and adding two of them is the simplest operation the Class 12 Matrices chapter offers — you add the entries that sit in the same position, nothing more. The catch is a single rule that governs everything else in this topic: the two matrices must have exactly the same order (the same number of rows and the same number of columns) before you may add them at all. A $2\times3$ table and a $3\times2$ table both hold six numbers, but they cannot be added, because "same position" only makes sense when the grids line up exactly. This article expands the core addition rule into the full toolkit tested in board exams: the entrywise definition, matrix subtraction as "add the negative," the algebraic properties that let you rearrange long sums freely, and how to solve for an unknown matrix $X$ inside an equation like $X + A = B$ . Every worked number below matches the Pass-1 article, extended with one further check and a second solved equation.

The core insight

Two matrices can be added only when they share the same order, and the sum is found by adding each entry to the entry in the identical row-and-column position of the other matrix.

The core idea

Same order, or not defined at all. If $A$ has order $m \times n$ (that is, $m$ rows and $n$ columns) and $B$ also has order $m \times n$ , their sum is defined. If the orders differ in even one dimension, $A + B$ simply does not exist — there is no fallback rule, no padding with zeros, nothing to compute.

Add entry by entry. For matrices $A = [a_{ij}]_{m\times n}$ and $B = [b_{ij}]_{m\times n}$ , the sum is the matrix formed by adding corresponding entries:

A + B = [a_{ij} + b_{ij}]_{m \times n}

where: $a_{ij}$ is the entry of $A$ in row $i$ , column $j$ ; $b_{ij}$ is the entry of $B$ in the same row-column position; and the resulting sum matrix keeps the same order $m \times n$ as the two matrices being added.

Subtraction is addition of the negative. Matrix subtraction reuses the same rule: $A - B = A + (-1)B$ , which in practice just means subtracting corresponding entries, again only when $A$ and $B$ share the same order.

Addition behaves like ordinary number addition. For matrices of any order (not only square ones), addition is commutative, $A + B = B + A$ , and associative, $(A+B)+C = A+(B+C)$ . There is an identity element, the zero matrix $O$ (every entry $0$ , same order as $A$ ), satisfying $A + O = A$ , and every matrix $A$ has an additive inverse $-A$ (negate every entry) with $A + (-A) = O$ . These four properties are why a long chain of matrix additions and subtractions can be regrouped or reordered freely, exactly as with ordinary numbers.

Figure

Two 2 by 3 grids of numbers combining entry by entry into a third grid of sums

Derivation AWhy the order-matching rule is unavoidable

Show that matrix addition can only ever be defined entrywise, so that requiring $A$ and $B$ to share the same order $m \times n$ is not an arbitrary convention but a direct consequence of what "adding corresponding entries" has to mean, and see why relaxing that requirement immediately breaks the operation.

Step 1. Suppose $A$ has order $m \times n$ and $B$ has order $p \times q$ . To form a sum $A + B$ by adding corresponding entries, every entry $a_{ij}$ of $A$ needs a partner entry $b_{ij}$ of $B$ sitting in the identical row $i$ and column $j$ .

Step 2. If $m \neq p$ , then $A$ has a row index (say $i = m$ ) that does not exist in $B$ , so the entry $a_{mj}$ has no partner to add to — the operation stalls before it can even be attempted for that row.

Step 3. Likewise, if $n \neq q$ , then $A$ has a column index that does not exist in $B$ , and the same failure happens column by column. So both dimensions must match, i.e. $A$ and $B$ must have the same order $m \times n$ , for every entry to have exactly one partner entry.

Step 4. Once $m = p$ and $n = q$ , every entry $a_{ij}$ has a unique partner $b_{ij}$ , and the sum $A + B = [a_{ij} + b_{ij}]_{m \times n}$ is fully and unambiguously defined, with no leftover, unmatched entries in either matrix.

Step 5. Because the resulting matrix is built from $m \times n$ sums, it also has order $m \times n$ — addition never changes the order of the matrices involved, it only combines their entries.

Worked example

Given: $A = \begin{bmatrix} 2 & -1 & 3 \\ 0 & 4 & 5 \end{bmatrix}$ , $B = \begin{bmatrix} 1 & 6 & -2 \\ 3 & -4 & 7 \end{bmatrix}$ , find $A + B$ , and then find the matrix $X$ satisfying $X + \begin{bmatrix} 3 & 2 \\ -1 & 4 \end{bmatrix} = \begin{bmatrix} 5 & 0 \\ 2 & 7 \end{bmatrix}$ .

Step 1. Check orders for $A + B$ : both $A$ and $B$ are $2 \times 3$ , so the addition is defined.

Step 2. Add corresponding entries in row 1: $2+1=3$ , $-1+6=5$ , $3+(-2)=1$ ; and row 2: $0+3=3$ , $4+(-4)=0$ , $5+7=12$ , giving $A + B = \begin{bmatrix} 3 & 5 & 1 \\ 3 & 0 & 12 \end{bmatrix}$ .

Step 3. For the equation $X + \begin{bmatrix} 3 & 2 \\ -1 & 4 \end{bmatrix} = \begin{bmatrix} 5 & 0 \\ 2 & 7 \end{bmatrix}$ , isolate $X$ by subtracting the known matrix from both sides, treating the whole matrix as a single algebraic quantity: $X = \begin{bmatrix} 5 & 0 \\ 2 & 7 \end{bmatrix} - \begin{bmatrix} 3 & 2 \\ -1 & 4 \end{bmatrix}$ .

Step 4. Subtract corresponding entries: $(1,1)$ : $5-3=2$ ; $(1,2)$ : $0-2=-2$ ; $(2,1)$ : $2-(-1)=3$ ; $(2,2)$ : $7-4=3$ , so $X = \begin{bmatrix} 2 & -2 \\ 3 & 3 \end{bmatrix}$ .

Step 5. Verify by adding $X$ back to the original matrix: $\begin{bmatrix} 2+3 & -2+2 \\ 3-1 & 3+4 \end{bmatrix} = \begin{bmatrix} 5 & 0 \\ 2 & 7 \end{bmatrix}$ , which matches the given right-hand side, confirming both answers.

The final answers: $A + B = \begin{bmatrix} 3 & 5 & 1 \\ 3 & 0 & 12 \end{bmatrix}$ and $X = \begin{bmatrix} 2 & -2 \\ 3 & 3 \end{bmatrix}$ .

Competitive stretch

The same "isolate $X$ " technique extends directly to equations built from three or more matrices, such as $2A + X = 3B - C$ . Because addition is associative and commutative, all the known matrices can be gathered on one side first (computing $3B - C$ as an ordinary entrywise subtraction), and then $2A$ can be moved across by subtracting it entrywise, leaving $X$ alone — the extra step is only that $2A$ requires scalar multiplication (doubling every entry of $A$ ) before the subtraction, but the underlying add-or-subtract-both-sides logic is identical to the two-matrix case above.

Common traps

Adding matrices of different order without checking first — always confirm both matrices have identical row and column counts before adding.
Adding entries diagonally or in the wrong row-column slot instead of strictly matching position between the two matrices.
Confusing addition with multiplication — matrix addition never multiplies entries together; it only adds entries that share the same position.
Writing something like " $A + 5$ " and adding the number $5$ to every entry — a plain scalar cannot be added directly to a matrix; only two matrices of matching order can be added to each other.
Losing track of signs when several matrix additions and subtractions are chained in one expression, or forgetting to distribute the negative sign across every entry of a matrix being subtracted.

Ask the tutor: Want to try a three-matrix equation like $2A + X = 3B - C$ , or get more practice isolating $X$ in an addition equation? Ask the AI tutor to work through a few more with you.

Why can't I add a 2 by 3 matrix and a 3 by 2 matrix even though both have six numbers

Matrix addition is defined position by position, not by total entry count. Each entry of the sum needs one specific partner entry sitting in the exact same row and column of the other matrix. A $2\times3$ matrix has entries at positions like row 2, column 3, but a $3\times2$ matrix has no such position — its columns stop at 2. With no partner available for several entries, the operation simply is not defined, no matter how many numbers each matrix happens to contain.

Is matrix subtraction a separate rule from matrix addition

No — subtraction is just addition of the additive inverse. Writing $A - B$ is shorthand for $A + (-B)$ , where $-B$ is the matrix obtained by negating every entry of $B$ . In practice you compute it exactly like addition, entrywise, except you subtract each entry of $B$ from the corresponding entry of $A$ instead of adding it. The same same-order requirement applies, since it is still built from the addition rule underneath.

Does the order in which I add several matrices together matter

No, as long as every matrix involved has the same order. Matrix addition is both commutative ( $A+B=B+A$ ) and associative ( $(A+B)+C=A+(B+C)$ ), which together mean you can reorder the matrices and regroup them with brackets however is convenient, and you will always reach the same sum. This mirrors ordinary number addition exactly and is one reason matrix algebra feels familiar once the same-order rule is respected.

Addition of matrices

The core idea

Worked example

Competitive stretch

Common traps

Before this

Where this leads