Fact-checked by Grok 2 weeks ago

Matrix addition

Matrix addition is a fundamental operation in linear algebra that combines two matrices of identical dimensions by adding the corresponding elements in each position, resulting in a new matrix of the same size.^[1]^[2] For two m \times n matrices A = (a_{ij}) and B = (b_{ij}), the sum C = A + B is defined such that c_{ij} = a_{ij} + b_{ij} for all i = 1, \dots, m and j = 1, \dots, n.^[3]^[4] This operation inherits key properties from scalar addition, including commutativity (A + B = B + A) and associativity ((A + B) + C = A + (B + C)), making it well-suited for algebraic manipulations in vector spaces and systems of equations.^[5]^[6] Additionally, matrix addition is closed under the set of all m \times n matrices over a given field, such as the real numbers, ensuring the result remains a valid matrix.^[7] In practice, matrix addition underpins broader matrix arithmetic, including scalar multiplication and transposition, and serves as a building block for solving linear systems, transformations in computer graphics, and data analysis in statistics.^[1]^[8] Unlike matrix multiplication, which requires compatible dimensions and is non-commutative, addition is straightforward and applies uniformly to conformable matrices, highlighting its role in introductory linear algebra.^[2]

Fundamentals

Definition

Matrix addition is an operation in linear algebra that combines two matrices to produce a third matrix, provided the matrices have identical dimensions. Specifically, addition is defined only for matrices that are both of size m \times n, where m represents the number of rows and n the number of columns.^[9] The process of matrix addition is performed element-wise, analogous to the addition of scalars but applied component by component across the matrices. For two m \times n matrices A = (a_{ij}) and B = (b_{ij}), their sum C = A + B is the matrix whose entries are given by

c_{ij} = a_{ij} + b_{ij}

for all i = 1 to m and j = 1 to n. This assumes the fundamental structure of a matrix as an ordered rectangular array of elements arranged in rows and columns.^[10] The concept of matrix addition originated in the foundational work of Arthur Cayley, who developed the theory of matrices in his 1858 memoir, where he first described matrices as entities that could be added alongside other operations.^[11]

Notation and Compatibility

In matrix addition, the operation is denoted using the standard plus symbol (+), where the sum of two matrices \mathbf{A} and \mathbf{B} is written as \mathbf{A} + \mathbf{B} = \mathbf{C}, with matrices conventionally represented by uppercase letters in boldface or sans-serif font to distinguish them from scalars.^[12] This notation aligns with the element-wise nature of the addition, ensuring clarity in algebraic expressions. For the addition to be defined, the matrices must be compatible, meaning they share identical dimensions—specifically, the same number of rows m and columns n, so both are m \times n matrices.^[9] If the dimensions differ, the operation is undefined, as there are no corresponding entries to sum.^[13] In advanced contexts like functional analysis, this compatibility extends to infinite-dimensional settings, where linear operators on vector spaces (such as Hilbert spaces) can be added provided they share the same domain and codomain, with addition defined pointwise on the operators.^[14] A common pitfall arises from conflating addition's strict same-dimension requirement with matrix multiplication's compatibility rule, which allows multiplication when the first matrix's columns match the second's rows, potentially leading to erroneous attempts to add incompatible matrices.^[9]^[15]

Properties

Algebraic Properties

Matrix addition exhibits several fundamental algebraic properties that establish it as an operation within the structure of linear algebra. For two matrices A and B of the same dimensions m \times n, their sum A + B is defined by adding corresponding entries: (A + B)_{ij} = A_{ij} + B_{ij} for all i = 1, \dots, m and j = 1, \dots, n.^[16] One key property is closure: the sum of two m \times n matrices is always another m \times n matrix, preserving the dimensions under the entry-wise addition operation.^[16] This follows directly from the definition, as each entry of the resulting matrix is a valid scalar sum from the underlying field (such as the real or complex numbers).^[17] Matrix addition is commutative, meaning A + B = B + A for any compatible matrices A and B. To see this, consider the (i,j)-th entry: (A + B)_{ij} = A_{ij} + B_{ij} = B_{ij} + A_{ij} = (B + A)_{ij}, relying on the commutativity of addition in the base field.^[16] It is also associative: for compatible matrices A, B, and C, (A + B) + C = A + (B + C). The proof proceeds entry-wise: the (i,j)-th entry of the left side is ((A + B) + C)_{ij} = (A + B)_{ij} + C_{ij} = (A_{ij} + B_{ij}) + C_{ij}, which equals A_{ij} + (B_{ij} + C_{ij}) by associativity in the field, matching the right side.^[16] These properties—closure, commutativity, and associativity—position matrix addition as the addition operation in an abelian group structure on the set of all m \times n matrices over a field, isomorphic to the vector space \mathbb{F}^{mn} where \mathbb{F} is the field.^[17] This alignment with field axioms for addition ensures that matrices behave like vectors under summation, facilitating their use in broader algebraic frameworks without introducing scalar multiplication details here.^[16]

Additive Inverse

The additive inverse of a matrix A = (a_{ij}), an m \times n matrix over a field such as the real numbers \mathbb{R} or complex numbers \mathbb{C}, is the matrix -A = (-a_{ij}), where each entry is negated, satisfying A + (-A) = O for the zero matrix O.^[18]^[19] This negation operation is equivalent to scalar multiplication by -1, so -A = (-1)A, ensuring the inverse exists uniquely for every matrix of fixed dimensions.^[20] The zero matrix O, an m \times n matrix with all entries equal to zero, acts as the additive identity in matrix addition, meaning A + O = O + A = A for any m \times n matrix A.^[21]^[22] This property holds because adding zero to each entry of A leaves the entries unchanged, mirroring the role of zero in scalar addition.^[23] Matrix subtraction is defined as the addition of the additive inverse: for compatible m \times n matrices A = (a_{ij}) and B = (b_{ij}), the difference A - [B](/page/Subtraction) is the matrix whose (i,j)-th entry is a_{ij} - b_{ij}. To derive this, note that -[B](/page/Negation) = (-b_{ij}), so

(A - B)_{ij} = (A + (-B))_{ij} = a_{ij} + (-b_{ij}) = a_{ij} - b_{ij},

which confirms that subtraction reduces to addition after negation, preserving the entry-wise nature of the operations.^[20]^[24] The set of all m \times n matrices over a field F (e.g., \mathbb{R} or \mathbb{C}) forms an abelian group under addition, with the zero matrix as the identity element and each matrix having its additive inverse as described.^[25]^[26] This group structure is commutative due to the entry-wise addition, ensuring the operation is well-defined and satisfies all group axioms for fixed dimensions.

Examples and Applications

Computational Examples

To illustrate the process of matrix addition, consider the following 2×2 matrices:

A = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}, \quad B = \begin{pmatrix} 5 & 6 \\ 7 & 8 \end{pmatrix}.

The sum A + B is computed by adding the corresponding entries element-wise:

A + B = \begin{pmatrix} 1 + 5 & 2 + 6 \\ 3 + 7 & 4 + 8 \end{pmatrix} = \begin{pmatrix} 6 & 8 \\ 10 & 12 \end{pmatrix}.

This operation requires that both matrices have the same dimensions to ensure each entry has a counterpart for addition./02%3A_Matrix_Arithmetic/2.01%3A_Matrix_Addition_and_Scalar_Multiplication) Matrix addition also applies to rectangular matrices, provided they share identical dimensions. For example, take these 2×3 matrices:

C = \begin{pmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \end{pmatrix}, \quad D = \begin{pmatrix} 7 & 8 & 9 \\ 10 & 11 & 12 \end{pmatrix}.

Adding them entry-wise yields:

C + D = \begin{pmatrix} 1 + 7 & 2 + 8 & 3 + 9 \\ 4 + 10 & 5 + 11 & 6 + 12 \end{pmatrix} = \begin{pmatrix} 8 & 10 & 12 \\ 14 & 16 & 18 \end{pmatrix},

which retains the original 2×3 shape./02%3A_II._Linear_Algebra/01%3A_Matrices/1.02%3A_Addition_and_Multiplication_of_Matrices) The zero matrix serves as the additive identity, meaning that adding it to any matrix leaves the original unchanged. For the matrix A above, the 2×2 zero matrix is

O = \begin{pmatrix} 0 & 0 \\ 0 & 0 \end{pmatrix},

and A + O = A. This holds because each entry of A is added to zero.^[21] Addition is undefined for matrices of incompatible dimensions, as there are no corresponding entries to pair. For instance, attempting to add the 2×2 matrix A to a 3×3 matrix such as

E = \begin{pmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end{pmatrix}

fails, since the row and column counts do not match, preventing element-wise summation./02%3A_Matrix_Arithmetic/2.01%3A_Matrix_Addition_and_Scalar_Multiplication)

Role in Linear Systems

Matrix addition plays a central role in solving systems of linear equations through algorithms like Gaussian elimination, where it facilitates the elimination of variables by adding multiples of one row to another in the augmented matrix. This row addition operation, which presupposes scalar multiplication to scale rows before adding, transforms the system into an upper triangular form, enabling back-substitution to find solutions. For instance, to eliminate an entry below a pivot, a multiple of the pivot row is added to the target row, preserving the solution set while simplifying the matrix structure.^[27]^[28] A key special case of matrix addition arises with column vectors, treated as n \times 1 matrices, where addition corresponds directly to vector addition in \mathbb{R}^n. This equivalence underpins many linear system representations, as solutions to Ax = b can be viewed as linear combinations of columns, with addition combining these vector components element-wise to yield the final result vector. Such vector additions are fundamental in iterative methods for large sparse systems, where partial solutions are accumulated through successive summations.^[29]^[30] In computer graphics, matrix addition supports affine transformations, particularly translations, by adding translation vectors—represented as column matrices—to position vectors in homogeneous coordinates, effectively shifting objects in space without altering their orientation or scale. This operation is essential for composing scene movements, such as relocating models in 3D environments, where the addition integrates displacement into the overall transformation pipeline. Affine spaces leverage this to model real-world motions, ensuring that translations remain linear in the extended coordinate system.^[31]^[32] Numerical stability in matrix addition, especially for large matrices in floating-point arithmetic, can introduce rounding errors due to the limited precision of representations like IEEE 754, where element-wise additions may accumulate discrepancies if operands differ significantly in magnitude. These errors, unique to specific implementations such as those in BLAS libraries, can propagate in linear system solvers, potentially magnifying inaccuracies in ill-conditioned matrices; techniques like compensated summation help mitigate this by estimating and correcting round-off. Additive inverses enable subtraction in augmented matrices by adding the negative, aiding pivot adjustments without separate operations.^[33]^[34]^[35]

References

[1]
M.2 Matrix Arithmetic | STAT ONLINE - Penn State
To perform matrix addition, two matrices must have the same dimensions. This means they must have the same number of rows and columns.
[2]
[PDF] 2.2 Addition and Subtraction of Matrices and Multiplication of a ...
Feb 16, 2007 · If A and B are both m × n matrices, then we define addition (or the sum) of A and B, denoted by A + B, to be the m × n matrix whose elements ...
[3]
Matrices and Operations
Matrices. Addition Definition: If A and B are any two matrices of the same size, then the sum A+B is the matrix obtained by adding together the ...
[4]
MAT-0010: Addition and Scalar Multiplication of Matrices - Ximera
Matrix addition involves adding corresponding entries of same-sized matrices. Scalar multiplication multiplies each entry of a matrix by a scalar.
[5]
160 Linear Systems: Matrix Algebra
Because it is defined by addition of components, matrix addition is commutative, A + B = B + A, and associative, (A + B) + C = A + (B + C), just like ordinary ...
[6]
[PDF] matrix addition, scalar multiplication, and matrix multiplication
Oct 11, 2016 · Clearly, matrix addition is always commutative (A + B = B + A) and associative (A +. (B + C)=(A + B) + C), as addition of real numbers satisfies ...
[7]
NOTES ON LINEAR ALGEBRA
[4] MATRIX ADDITION. Let A and B be two matrices. When can we add them, and what is the answer? We define matrix addition by adding componentwise. For ...
[8]
15.3 Matrix Addition, Multiplication and Multiplication by a Number
You may add two matrices which have the same shape: to do so add corresponding elements to get the corresponding element of the sum. Example. 3. You may form ...
[9]
Matrix addition - StatLect
Definition. Two matrices can be added together if and only if they have the same dimension. Their sum is obtained by summing each element of one matrix to the ...Definition · Properties of matrix addition · Solved exercisesMissing: linear | Show results with:linear
[10]
II. A memoir on the theory of matrices - Journals
It will be seen that matrices (attending only to those of the same order) comport themselves as single quantities; they may be added, multiplied or compounded ...<|control11|><|separator|>
[11]
Matrix addition & subtraction (article) | Khan Academy
To add matrices, add corresponding entries. To subtract, subtract corresponding entries. Matrices must have the same dimensions.
[12]
Matrix Addition, Subtraction, and Multiplication by a Scalar - Nool
To add or subtract matrices, they must be the same size as one another!! This is very important! (You can't add or subtract if the sizes are different.)
[13]
[PDF] Functional Analysis Review - MIT
Feb 8, 2010 · We will see how matrices represent linear functions between finite dimensional vector spaces, and develop a parallel theory on linear operators ...
[14]
Matrix Multiplication Rules: AP® Precalculus Review - Albert.io
May 5, 2025 · Common Mistakes in Matrix Multiplication. Avoid these traps: Mismatched dimensions: Verify row-column compatibility. Incorrect dot product: ...
[15]
https://www.albert.io/blog/matrix-multiplication-rules-ap-precalculus-review/
[16]
[PDF] Properties of matrix operations
Addition: if A and B are matrices of the same size m × n, then A + B, their sum, is a matrix of size m × n. • Multiplication by scalars: if A is a matrix of ...
[17]
[PDF] Applied Matrix Algebra — Lecture Notes — Section 2.1 - KSU Math
(3) The additive inverse −A of a matrix A = [aij]m×n is the matrix with entries −aij,. i.e. −A = [−aij]. (4) The difference A−B of two m×n matrices A, B is ...
[18]
[PDF] 8. Matrix Algebra
Aug 30, 2022 · Additive Inverse. Each matrix A has a unique additive inverse −A, which can be obtained by multiplying A by (−1).
[19]
Math 221: LINEAR ALGEBRA - Emory University
Definition. Let m and n be positive integers. ▷ An m × n matrix is a rectangular array of numbers having m rows and n columns. Such a matrix is said to ...
[20]
Zero Matrix -- from Wolfram MathWorld
Zero matrices are sometimes also known as null matrices (Akivis and Goldberg 1972, p. 71). A zero matrix is the additive identity of the additive group of m×n ...
[21]
6.2 - Operations with Matrices
Zero Matrix · Matrix of any order · Consists of all zeros · Denoted by capital O · Additive Identity for matrices · Any matrix plus the zero matrix is the original ...
[22]
[PDF] mat 260 linear algebra lecture 19
The zero matrix, i.e. a matrix with all the entries 0, is often denoted by O. It is the additive identity for matrix addition. By that, we mean. A + O = A and.
[23]
[PDF] Lecture 2 Matrix Operations - EE263
Matrix addition & subtraction if A and B are both m×n, we form A+B by adding ... we define negative powers of A via A−k = A−1 k. Matrix Operations. 2 ...
[24]
[PDF] 1.4 Groups
The set Mn(R) of all n × n real matrices with addition is an abelian group. However, Mn(R) with matrix multiplication is NOT a group. (e.g. the zero matrix has ...
[25]
[PDF] Matrix Groups
Jan 20, 2018 · As a special case, the n × n matrices with real entries forms a group under matrix addition. This group is denoted M(n, R). As you might guess, ...<|control11|><|separator|>
[26]
[PDF] Gaussian elimination
Oct 2, 2019 · The row-echelon matrix A is said to be in reduced row-echelon form if in addition. 1. each pivot entry is equal to 1, and. 2. all the other ...
[27]
[PDF] 4. Gaussian Elimination - Numerical Analysis Lecture Notes
May 18, 2008 · If A is any m×n matrix, then the matrix product EA is equal to the matrix obtained from A by the elementary row operation adding c times row j ...
[28]
[PDF] Chapter 4: Vectors, Matrices, and Linear Algebra
A vector is a list of numbers, and a scalar is a number. Vectors can be added and subtracted, and their magnitude is their length.
[29]
[PDF] column and row vectors
The sum of two n-component vectors (either row or column) is defined by componentwise addition in an analogous manner, and yields another n-component vector.
[30]
[PDF] Affine Transformations
x0 = "x cos θ − y sin θ x sin θ + y cos θ # . x0 = "x + by y + dx # . In summary, we have the four basic affine transformations shown in the figure below:
[31]
[PDF] Affine transformations - Washington
The addition of translation to linear transformations gives us affine transformations. In matrix form, 2D affine transformations always look like this: 2D ...
[32]
[PDF] Notes on Numerical Stability - UT Computer Science
Oct 10, 2014 · In the presence of round-off error, an algorithm involving numerical computations cannot be expected to yield the exact result. Thus, the ...
[33]
Basic Issues in Floating Point Arithmetic and Error Analysis
This lecture is a quick survey of issues in floating point arithmetic relevant to numerical linear algebra, including parallel numerical linear algebra.
[34]
[PDF] What Every Computer Scientist Should Know About Floating Point ...
The most natural way to measure rounding error is in ulps. For example rounding to the nearest floating-point number corresponds to an error of less than or ...<|control11|><|separator|>