Matrix (mathematics)

Array of numbers

"Matrix theory" redirects here. For the physics topic, see Matrix theory (physics). For other uses of "Matrix", see Matrix (disambiguation).

An m × n matrix: the m rows are horizontal and the n columns are vertical. Each element of a matrix is often denoted by a variable with two subscripts. For example,  a2,1 represents the element at the second row and first column of the matrix.

In mathematics, a matrix (pl.: matrices) is a rectangular array of numbers or other mathematical objects with elements or entries arranged in rows and columns, usually satisfying certain properties of addition and multiplication.

For example,  [ 1 9 − 13 20 5 − 6 ] {\displaystyle {\begin{bmatrix}1&9&-13\\\20&5&-6\end{bmatrix}}} denotes a matrix with two rows and three columns. This is often referred to as a "two-by-three matrix", a "⁠ 2 × 3 {\displaystyle 2\times 3} ⁠ matrix", or a matrix of dimension ⁠ 2 × 3 {\displaystyle 2\times 3} ⁠.

In linear algebra, matrices are used as linear maps. In geometry, matrices are used for geometric transformations (for example rotations) and coordinate changes. In numerical analysis, many computational problems are solved by reducing them to a matrix computation, and this often involves computing with matrices of huge dimensions. Matrices are used in most areas of mathematics and scientific fields, either directly, or through their use in geometry and numerical analysis.

Square matrices, matrices with the same number of rows and columns, play a major role in matrix theory. The determinant of a square matrix is a number associated with the matrix, which is fundamental for the study of a square matrix; for example, a square matrix is invertible if and only if it has a nonzero determinant and the eigenvalues of a square matrix are the roots of a polynomial determinant.

Matrix theory is the branch of mathematics that focuses on the study of matrices. It was initially a sub-branch of linear algebra, but soon grew to include subjects related to graph theory, algebra, combinatorics and statistics.

## Definition

[edit]

A matrix is a rectangular array of numbers (or other mathematical objects), called the "entries" of the matrix. Matrices are subject to standard operations such as addition and multiplication.[1] Most commonly, a matrix over a field F {\displaystyle F} is a rectangular array of elements of ⁠ F {\displaystyle F} ⁠.[2][3] A real matrix and a complex matrix are matrices whose entries are respectively real numbers or complex numbers. More general types of entries are discussed below. For instance, this is a real matrix:  A = [ − 1.3 0.6 20.4 5.5 9.7 − 6.2 ] . {\displaystyle \mathbf {A} ={\begin{bmatrix}-1.3&0.6\\\20.4&5.5\\\9.7&-6.2\end{bmatrix}}.}

The numbers (or other objects) in the matrix are called its entries or its elements. The horizontal and vertical lines of entries in a matrix are respectively called rows and columns.[4]

### Size

[edit]

The size of a matrix is defined by the number of rows and columns it contains. There is no limit to the number of rows and columns that a matrix (in the usual sense) can have as long as they are positive integers. A matrix with  m {\displaystyle m} rows and  n {\displaystyle n} columns is called an  m × n {\displaystyle m\times n} matrix,[4] or  m {\displaystyle {m}} -by- n {\displaystyle {n}} matrix,[5] where  m {\displaystyle {m}} and  n {\displaystyle {n}} are called its dimensions.[6] For example, the matrix  A {\displaystyle {\mathbf {A} }} above is a  3 × 2 {\displaystyle {3\times 2}} matrix.

Matrices with a single row are called row matrices or row vectors, and those with a single column are called column matrices or column vectors. A matrix with the same number of rows and columns is called a square matrix.[7] A matrix with an infinite number of rows or columns (or both) is called an  infinite matrix. In some contexts, such as computer algebra programs, it is useful to consider a matrix with no rows or no columns, called an  empty matrix.[8]

Overview of a matrix size  Name  | Size  | Example  | Description

|
|
|

Row matrix |  1 × n {\displaystyle 1\times n} |  [ 3 7 2 ] {\displaystyle {\begin{bmatrix}3&7&2\end{bmatrix}}} | A matrix with one row, sometimes used to represent a vector
Column matrix |  n × 1 {\displaystyle n\times 1} |  [ 4 1 8 ] {\displaystyle {\begin{bmatrix}4\\\1\\\8\end{bmatrix}}} | A matrix with one column, sometimes used to represent a vector
Square matrix |  n × n {\displaystyle n\times n} |  [ 9 13 5 1 11 7 2 6 3 ] {\displaystyle {\begin{bmatrix}9&13&5\\\1&11&7\\\2&6&3\end{bmatrix}}} | A matrix with the same number of rows and columns, sometimes used to represent a linear transformation from a vector space to itself, such as reflection, rotation, or shearing.

## Notation

[edit]

The specifics of symbolic matrix notation vary widely, with some prevailing trends. Matrices are commonly written in square brackets or parentheses,[9] so that an  m × n {\displaystyle m\times n} matrix  A {\displaystyle \mathbf {A} } is represented as  A = [ a 11 a 12 ⋯ a 1 n a 21 a 22 ⋯ a 2 n ⋮ ⋮ ⋱ ⋮ a m 1 a m 2 ⋯ a m n ] = ( a 11 a 12 ⋯ a 1 n a 21 a 22 ⋯ a 2 n ⋮ ⋮ ⋱ ⋮ a m 1 a m 2 ⋯ a m n ) . {\displaystyle \mathbf {A} ={\begin{bmatrix}a_{11}&a_{12}&\cdots &a_{1n}\\\a_{21}&a_{22}&\cdots &a_{2n}\\\\\vdots &\vdots &\ddots &\vdots \\\a_{m1}&a_{m2}&\cdots &a_{mn}\end{bmatrix}}={\begin{pmatrix}a_{11}&a_{12}&\cdots &a_{1n}\\\a_{21}&a_{22}&\cdots &a_{2n}\\\\\vdots &\vdots &\ddots &\vdots \\\a_{m1}&a_{m2}&\cdots &a_{mn}\end{pmatrix}}.} This may be abbreviated by writing only a single generic term, possibly along with indices, as in  A = ( a i j ) , [ a i j ] , or ( a i j ) 1 ≤ i ≤ m , 1 ≤ j ≤ n {\displaystyle \mathbf {A} =\left(a_{ij}\right),\quad \left[a_{ij}\right],\quad {\text{or}}\quad \left(a_{ij}\right)_{1\leq i\leq m,\;1\leq j\leq n}} or  A = ( a i , j ) 1 ≤ i , j ≤ n {\displaystyle \mathbf {A} =(a_{i,j})_{1\leq i,j\leq n}} in the case that ⁠ n = m {\displaystyle n=m} ⁠.

Matrices are usually symbolized using upper-case letters (such as  A {\displaystyle {\mathbf {A} }} in the examples above),[10] while the corresponding lower-case letters, with two subscript indices (e.g., ⁠ a 11 {\displaystyle a_{11}} ⁠, or ⁠ a 1 , 1 {\displaystyle a_{1,1}} ⁠), represent the entries.[11] In addition to using upper-case letters to symbolize matrices, many authors use a special typographical style, commonly boldface Roman (non-italic), to further distinguish matrices from other mathematical objects. An alternative notation involves the use of a double-underline with the variable name, with or without boldface style, as in ⁠ A _ _ {\displaystyle {\underline {\underline {A}}}} ⁠.[12]

The entry in the ith row and jth column of a matrix A is sometimes referred to as the  i , j {\displaystyle {i,j}} or  ( i , j ) {\displaystyle (i,j)} entry of the matrix, and commonly denoted by  a i , j {\displaystyle a_{i,j}} or ⁠ a i j {\displaystyle a_{ij}} ⁠.[13] Alternative notations for that entry are  A [ i , j ] {\displaystyle {\mathbf {A} [i,j]}} and ⁠ A i , j {\displaystyle \mathbf {A} _{i,j}} ⁠. For example, the  ( 1 , 3 ) {\displaystyle (1,3)} entry of the following matrix  A {\displaystyle \mathbf {A} } is 5 (also denoted ⁠ a 13 {\displaystyle a_{13}} ⁠, ⁠ a 1 , 3 {\displaystyle a_{1,3}} ⁠,  A [ 1 , 3 ] {\displaystyle \mathbf {A} [1,3]} or ⁠ A 1 , 3 {\displaystyle {\mathbf {A} }_{1,3}} ⁠):  A = [ 4 − 7 5 0 − 2 0 11 8 19 1 − 3 12 ] {\displaystyle \mathbf {A} ={\begin{bmatrix}4&-7&\color {red}{5}&0\\\\-2&0&11&8\\\19&1&-3&12\end{bmatrix}}}

Sometimes, the entries of a matrix can be defined by a formula such as ⁠ a i , j = f ( i , j ) {\displaystyle a_{i,j}=f(i,j)} ⁠. For example, each of the entries of the following matrix  A {\displaystyle \mathbf {A} } is determined by the formula ⁠ a i j = i − j {\displaystyle a_{ij}=i-j} ⁠.  A = [ 0 − 1 − 2 − 3 1 0 − 1 − 2 2 1 0 − 1 ] {\displaystyle \mathbf {A} ={\begin{bmatrix}0&-1&-2&-3\\\1&0&-1&-2\\\2&1&0&-1\end{bmatrix}}} In this case, the matrix itself is sometimes defined by that formula, within square brackets or double parentheses. For example, the matrix above is defined as  A = [ i − j ] {\displaystyle {\mathbf {A} }=[i-j]} or ⁠ A = ( ( i − j ) ) {\displaystyle \mathbf {A} =((i-j))} ⁠. If matrix size is ⁠ m × n {\displaystyle m\times n} ⁠, the above-mentioned formula  f ( i , j ) {\displaystyle f(i,j)} is valid for any  i = 1 , … , m {\displaystyle i=1,\dots ,m} and any ⁠ j = 1 , … , n {\displaystyle j=1,\dots ,n} ⁠. This can be specified separately or indicated using  m × n {\displaystyle m\times n} as a subscript. For instance, the matrix  A {\displaystyle \mathbf {A} } above is ⁠ 3 × 4 {\displaystyle 3\times 4} ⁠, and can be defined as  A = [ i − j ] ( i = 1 , 2 , 3 ; j = 1 , … , 4 ) {\displaystyle {\mathbf {A} }=[i-j](i=1,2,3;j=1,\dots ,4)} or ⁠ A = [ i − j ] 3 × 4 {\displaystyle \mathbf {A} =[i-j]_{3\times 4}} ⁠.

Some programming languages utilize doubly subscripted arrays (or arrays of arrays) to represent an m-by-n matrix. Some programming languages start the numbering of array indexes at zero, in which case the entries of an m-by-n matrix are indexed by  0 ≤ i ≤ m − 1 {\displaystyle 0\leq i\leq m-1} and ⁠ 0 ≤ j ≤ n − 1 {\displaystyle 0\leq j\leq n-1} ⁠.[14] This article follows the more common convention in mathematical writing where enumeration starts from 1.

The set of all m-by-n real matrices is often denoted ⁠ M ( m , n ) {\displaystyle {\mathcal {M}}(m,n)} ⁠, or ⁠ M m × n ( R ) {\displaystyle {\mathcal {M}}_{m\times n}(\mathbb {R} )} ⁠. The set of all m-by-n matrices over another field, or over a ring R, is similarly denoted ⁠ M ( m , n , R ) {\displaystyle {\mathcal {M}}(m,n,R)} ⁠, or ⁠ M m × n ( R ) {\displaystyle {\mathcal {M}}_{m\times n}(R)} ⁠. If m = n, such as in the case of square matrices, one does not repeat the dimension: ⁠ M ( n , R ) {\displaystyle {\mathcal {M}}(n,R)} ⁠, or ⁠ M n ( R ) {\displaystyle {\mathcal {M}}_{n}(R)} ⁠.[15] Often, ⁠ M {\displaystyle M} ⁠, or ⁠ Mat {\displaystyle \operatorname {Mat} } ⁠, is used in place of ⁠ M {\displaystyle {\mathcal {M}}} ⁠.[16]

## Basic operations

[edit]

Several basic operations can be applied to matrices. Some, such as transposition and submatrix do not depend on the nature of the entries. Others, such as matrix addition, scalar multiplication, matrix multiplication, and row operations involve operations on matrix entries and therefore require that matrix entries are numbers or belong to a field or a ring.[17]

In this section, it is supposed that matrix entries belong to a fixed ring, which is typically a field of numbers.

### Addition

[edit]

Main article: Matrix addition

Illustration of the addition of two matrices.

Matrix addition and subtraction require matrices of a consistent size, and are calculated entrywise. The sum A \+ B and the difference A − B of two m×n matrices are:[18]

( A + B ) i , j = A i , j + B i , j , 1 ≤ i ≤ m , 1 ≤ j ≤ n . ( A − B ) i , j = A i , j − B i , j , 1 ≤ i ≤ m , 1 ≤ j ≤ n . {\displaystyle {\begin{aligned}({\mathbf {A}}+{\mathbf {B}})_{i,j}={\mathbf {A}}_{i,j}+{\mathbf {B}}_{i,j},\quad 1\leq i\leq m,\quad 1\leq j\leq n.\\\\({\mathbf {A}}-{\mathbf {B}})_{i,j}={\mathbf {A}}_{i,j}-{\mathbf {B}}_{i,j},\quad 1\leq i\leq m,\quad 1\leq j\leq n.\end{aligned}}}

For example,

[ 1 3 1 1 0 0 ] + [ 0 0 5 7 5 0 ] = [ 1 + 0 3 + 0 1 + 5 1 + 7 0 + 5 0 + 0 ] = [ 1 3 6 8 5 0 ] {\displaystyle {\begin{bmatrix}1&3&1\\\1&0&0\end{bmatrix}}+{\begin{bmatrix}0&0&5\\\7&5&0\end{bmatrix}}={\begin{bmatrix}1+0&3+0&1+5\\\1+7&0+5&0+0\end{bmatrix}}={\begin{bmatrix}1&3&6\\\8&5&0\end{bmatrix}}}

Familiar properties of numbers extend to these operations on matrices: for example, addition is commutative, that is, the matrix sum does not depend on the order of the summands: A \+ B = B \+ A.[19]

### Scalar multiplication

[edit]

Main article: Scalar multiplication

The product cA of a number c (also called a scalar in this context) and a matrix A is computed by multiplying each entry of A by c:[20] ( c A ) i , j = c ⋅ A i , j {\displaystyle (c{\mathbf {A}})_{i,j}=c\cdot {\mathbf {A}}_{i,j}} This operation is called scalar multiplication, but its result is not named "scalar product" to avoid confusion, since "scalar product" is often used as a synonym for "inner product".[21] For example:

2 ⋅ [ 1 8 − 3 4 − 2 5 ] = [ 2 ⋅ 1 2 ⋅ 8 2 ⋅ − 3 2 ⋅ 4 2 ⋅ − 2 2 ⋅ 5 ] = [ 2 16 − 6 8 − 4 10 ] {\displaystyle 2\cdot {\begin{bmatrix}1&8&-3\\\4&-2&5\end{bmatrix}}={\begin{bmatrix}2\cdot 1&2\cdot 8&2\cdot -3\\\2\cdot 4&2\cdot -2&2\cdot 5\end{bmatrix}}={\begin{bmatrix}2&16&-6\\\8&-4&10\end{bmatrix}}}

Matrix subtraction is consistent with composition of matrix addition with scalar multiplication by –1:[22]

A − B = A + ( − 1 ) ⋅ B {\displaystyle \mathbf {A} -\mathbf {B} =\mathbf {A} +(-1)\cdot \mathbf {B} }

### Transpose

[edit]

Main article: Transpose

The transpose of an m×n matrix A is the n×m matrix AT (also denoted Atr or tA) formed by turning rows into columns and vice versa:  ( A T ) i , j = A j , i . {\displaystyle \left({\mathbf {A}}^{\rm {T}}\right)_{i,j}={\mathbf {A}}_{j,i}.} For example:  [ 1 2 3 0 − 6 7 ] T = [ 1 0 2 − 6 3 7 ] {\displaystyle {\begin{bmatrix}1&2&3\\\0&-6&7\end{bmatrix}}^{\mathrm {T} }={\begin{bmatrix}1&0\\\2&-6\\\3&7\end{bmatrix}}}

The transpose is compatible with addition and scalar multiplication, as expressed by (cA)T = c(AT) and (A \+ B)T = AT \+ BT. Finally, (AT)T = A.[23]

### Matrix multiplication

[edit]

Main article: Matrix multiplication

Schematic depiction of the matrix product AB of two matrices A and B

Multiplication of two matrices corresponds to the composition of linear transformations represented by each matrix. It is defined if and only if the number of columns of the left matrix is the same as the number of rows of the right matrix. If A is an m×n matrix and B is an n×p matrix, then their matrix product AB is the m×p matrix whose entries are given by the dot product of the corresponding row of A and the corresponding column of B:[24] [ A B ] i , j = a i , 1 b 1 , j + a i , 2 b 2 , j + ⋯ + a i , n b n , j = ∑ r = 1 n a i , r b r , j , {\displaystyle [\mathbf {AB} ]_{i,j}=a_{i,1}b_{1,j}+a_{i,2}b_{2,j}+\cdots +a_{i,n}b_{n,j}=\sum _{r=1}^{n}a_{i,r}b_{r,j},} where 1 ≤ i ≤ m and 1 ≤ j ≤ p.[25] For example, the underlined entry 2340 in the product is calculated as (2 × 1000) + (3 × 100) + (4 × 10) = 2340: [ 2 _ 3 _ 4 _ 1 0 0 ] [ 0 1000 _ 1 100 _ 0 10 _ ] = [ 3 2340 _ 0 1000 ] . {\displaystyle {\begin{aligned}{\begin{bmatrix}{\underline {2}}&{\underline {3}}&{\underline {4}}\\\1&0&0\\\\\end{bmatrix}}{\begin{bmatrix}0&{\underline {1000}}\\\1&{\underline {100}}\\\0&{\underline {10}}\\\\\end{bmatrix}}&={\begin{bmatrix}3&{\underline {2340}}\\\0&1000\\\\\end{bmatrix}}.\end{aligned}}}

Matrix multiplication satisfies the rules (AB)C = A(BC) (associativity), and (A \+ B)C = AC \+ BC as well as C(A \+ B) = CA \+ CB (left and right distributivity), whenever the size of the matrices is such that the various products are defined.[26] The product AB may be defined without BA being defined, namely if A and B are m×n and n×k matrices, respectively, and m ≠ k. Even if both products are defined, they generally need not be equal, that is:[27] A B ≠ B A . {\displaystyle {\mathbf {AB}}\neq {\mathbf {BA}}.}

In other words, matrix multiplication is not commutative, in marked contrast to (rational, real, or complex) numbers, whose product is independent of the order of the factors.[24] An example of two matrices not commuting with each other is:  [ 1 2 3 4 ] [ 0 1 0 0 ] = [ 0 1 0 3 ] , {\displaystyle {\begin{bmatrix}1&2\\\3&4\\\\\end{bmatrix}}{\begin{bmatrix}0&1\\\0&0\\\\\end{bmatrix}}={\begin{bmatrix}0&1\\\0&3\\\\\end{bmatrix}},} whereas  [ 0 1 0 0 ] [ 1 2 3 4 ] = [ 3 4 0 0 ] . {\displaystyle {\begin{bmatrix}0&1\\\0&0\\\\\end{bmatrix}}{\begin{bmatrix}1&2\\\3&4\\\\\end{bmatrix}}={\begin{bmatrix}3&4\\\0&0\\\\\end{bmatrix}}.}

Besides the ordinary matrix multiplication just described, other less frequently used operations on matrices that can be considered forms of multiplication also exist, such as the Hadamard product and the Kronecker product.[28] They arise in solving matrix equations such as the Sylvester equation.[29]

### Row operations

[edit]

Main article: Row operations

There are three types of row operations:[30][31]

1. row addition, that is, adding a row to another.
2. row multiplication, that is, multiplying all entries of a row by a non-zero constant;
3. row switching, that is, interchanging two rows of a matrix;

These operations are used in several ways, including solving linear equations and finding matrix inverses with Gauss elimination and Gauss–Jordan elimination, respectively.[32]

### Submatrix

[edit]

A submatrix of a matrix is a matrix obtained by deleting any collection of rows and/or columns.[33][34][35] For example, from the following 3-by-4 matrix, we can construct a 2-by-3 submatrix by removing row 3 and column 2:  A = [ 1 2 3 4 5 6 7 8 9 10 11 12 ] → [ 1 3 4 5 7 8 ] . {\displaystyle \mathbf {A} ={\begin{bmatrix}1&\color {red}{2}&3&4\\\5&\color {red}{6}&7&8\\\\\color {red}{9}&\color {red}{10}&\color {red}{11}&\color {red}{12}\end{bmatrix}}\rightarrow {\begin{bmatrix}1&3&4\\\5&7&8\end{bmatrix}}.}

The minors and cofactors of a matrix are found by computing the determinant of certain submatrices.[35][36]

A principal submatrix is a square submatrix obtained by removing certain rows and columns. The definition varies from author to author. According to some authors, a principal submatrix is a submatrix in which the set of row indices that remain is the same as the set of column indices that remain.[37][38] Other authors define a principal submatrix as one in which the first k rows and columns, for some number k, are the ones that remain;[39] this type of submatrix has also been called a leading principal submatrix.[40]

## Linear equations

[edit]

Main articles: Linear equation and System of linear equations

Matrices can be used to compactly write and work with multiple linear equations, that is, systems of linear equations. For example, if A is an m×n matrix, x designates a column vector (that is, n×1-matrix) of n variables x1, x2, ..., xn, and b is an m×1-column vector, then the matrix equation  A x = b {\displaystyle \mathbf {Ax} =\mathbf {b} } is equivalent to the system of linear equations[41] a 1 , 1 x 1 + a 1 , 2 x 2 + ⋯ + a 1 , n x n = b 1     ⋮ a m , 1 x 1 + a m , 2 x 2 + ⋯ + a m , n x n = b m {\displaystyle {\begin{aligned}a_{1,1}x_{1}+a_{1,2}x_{2}+&\cdots +a_{1,n}x_{n}=b_{1}\\\&\ \ \vdots \\\a_{m,1}x_{1}+a_{m,2}x_{2}+&\cdots +a_{m,n}x_{n}=b_{m}\end{aligned}}}

Using matrices, this can be solved more compactly than would be possible by writing out all the equations separately. If n = m and the equations are independent, then this can be done by writing[42] x = A − 1 b {\displaystyle \mathbf {x} =\mathbf {A} ^{-1}\mathbf {b} } where A−1 is the inverse matrix of A. If A has no inverse, solutions—if any—can be found using its generalized inverse.[43]

## Linear transformations

[edit]

Main articles: Linear transformation and Transformation matrix

The vectors represented by a 2-by-2 matrix correspond to the sides of a unit square transformed into a parallelogram.

Matrices and matrix multiplication reveal their essential features when related to linear transformations, also known as linear maps. A real m-by-n matrix A gives rise to a linear transformation  R n → R m {\displaystyle \mathbb {R} ^{n}\to \mathbb {R} ^{m}} mapping each vector x in ⁠ R n {\displaystyle \mathbb {R} ^{n}} ⁠ to the (matrix) product Ax, which is a vector in ⁠ R m . {\displaystyle \mathbb {R} ^{m}.} ⁠ Conversely, each linear transformation  f : R n → R m {\displaystyle f:\mathbb {R} ^{n}\to \mathbb {R} ^{m}} arises from a unique m-by-n matrix A: explicitly, the (i, j)-entry of A is the ith coordinate of f (ej), where ej = (0, ..., 0, 1, 0, ..., 0) is the unit vector with 1 in the jth position and 0 elsewhere. The matrix A is said to represent the linear map f, and A is called the transformation matrix of f.[44]

For example, the 2×2 matrix  A = [ a c b d ] {\displaystyle \mathbf {A} ={\begin{bmatrix}a&c\\\b&d\end{bmatrix}}} can be viewed as the transform of the unit square into a parallelogram with vertices at (0, 0), (a, b), (a \+ c, b \+ d), and (c, d). The parallelogram pictured at the right is obtained by multiplying A with each of the column vectors ⁠ [ 0 0 ] {\displaystyle \left[{\begin{smallmatrix}0\\\0\end{smallmatrix}}\right]} ⁠, ⁠ [ 1 0 ] {\displaystyle \left[{\begin{smallmatrix}1\\\0\end{smallmatrix}}\right]} ⁠, ⁠ [ 1 1 ] {\displaystyle \left[{\begin{smallmatrix}1\\\1\end{smallmatrix}}\right]} ⁠, and ⁠ [ 0 1 ] {\displaystyle \left[{\begin{smallmatrix}0\\\1\end{smallmatrix}}\right]} ⁠ in turn. These vectors define the vertices of the unit square.[45] The following table shows several 2×2 real matrices with the associated linear maps of ⁠ R 2 {\displaystyle \mathbb {R} ^{2}} ⁠. The blue original is mapped to the green grid and shapes. The origin (0, 0) is marked with a black point.

Horizontal shear[46]
with m = 1.25.  | Reflection[47] through the vertical axis  | Squeeze mapping[48]
with r = 3/2  | Scaling[49]
by a factor of 3/2  | Rotation[48]
by π/6 = 30°

|
|
|
|

[ 1 1.25 0 1 ] {\displaystyle {\begin{bmatrix}1&1.25\\\0&1\end{bmatrix}}} |  [ − 1 0 0 1 ] {\displaystyle {\begin{bmatrix}-1&0\\\0&1\end{bmatrix}}} |  [ 3 2 0 0 2 3 ] {\displaystyle {\begin{bmatrix}{\frac {3}{2}}&0\\\0&{\frac {2}{3}}\end{bmatrix}}} |  [ 3 2 0 0 3 2 ] {\displaystyle {\begin{bmatrix}{\frac {3}{2}}&0\\\0&{\frac {3}{2}}\end{bmatrix}}} |  [ cos ⁡ ( π 6 ) − sin ⁡ ( π 6 ) sin ⁡ ( π 6 ) cos ⁡ ( π 6 ) ] {\displaystyle {\begin{bmatrix}\cos \left({\frac {\pi }{6}}\right)&-\sin \left({\frac {\pi }{6}}\right)\\\\\sin \left({\frac {\pi }{6}}\right)&\cos \left({\frac {\pi }{6}}\right)\end{bmatrix}}}
|  |  |  |

Under the 1-to-1 correspondence between matrices and linear maps, matrix multiplication corresponds to composition of maps:[50] if a k-by-m matrix B represents another linear map ⁠ g : R m → R k {\displaystyle g:\mathbb {R} ^{m}\to \mathbb {R} ^{k}} ⁠, then the composition g ∘ f is represented by BA since[51] ( g ∘ f ) ( x ) = g ( f ( x ) ) = g ( A x ) = B ( A x ) = ( B A ) x . {\displaystyle (g\circ f)({\mathbf {x}})=g(f({\mathbf {x}}))=g({\mathbf {Ax}})={\mathbf {B}}({\mathbf {Ax}})=({\mathbf {BA}}){\mathbf {x}}.}

The last equality follows from the above-mentioned associativity of matrix multiplication.

The rank of a matrix A is the maximum number of linearly independent row vectors of the matrix, which is the same as the maximum number of linearly independent column vectors.[52] Equivalently it is the dimension of the image of the linear map represented by A.[53] The rank–nullity theorem states that the dimension of the kernel of a matrix plus the rank equals the number of columns of the matrix.[54]

## Square matrix

[edit]

Main article: Square matrix

A square matrix is a matrix with the same number of rows and columns. An n-by-n matrix is known as a square matrix of order n. Any two square matrices of the same order can be added and multiplied. The entries aii form the main diagonal of a square matrix. They lie on the imaginary line running from the top left corner to the bottom right corner of the matrix.[55]

Square matrices of a given dimension form a noncommutative ring, which is one of the most common examples of a noncommutative ring.[56]

### Main types

[edit]

Name | Example with n = 3

|

Diagonal matrix |  [ a 11 0 0 0 a 22 0 0 0 a 33 ] {\displaystyle {\begin{bmatrix}a_{11}&0&0\\\0&a_{22}&0\\\0&0&a_{33}\\\\\end{bmatrix}}}
Lower triangular matrix |  [ a 11 0 0 a 21 a 22 0 a 31 a 32 a 33 ] {\displaystyle {\begin{bmatrix}a_{11}&0&0\\\a_{21}&a_{22}&0\\\a_{31}&a_{32}&a_{33}\\\\\end{bmatrix}}}
Upper triangular matrix |  [ a 11 a 12 a 13 0 a 22 a 23 0 0 a 33 ] {\displaystyle {\begin{bmatrix}a_{11}&a_{12}&a_{13}\\\0&a_{22}&a_{23}\\\0&0&a_{33}\\\\\end{bmatrix}}}

#### Diagonal and triangular matrix

[edit]

If all entries of A below the main diagonal are zero, A is called an upper triangular matrix. Similarly, if all entries of A above the main diagonal are zero, A is called a lower triangular matrix.[57] If all entries outside the main diagonal are zero, A is called a diagonal matrix.[58]

#### Identity matrix

[edit]

Main article: Identity matrix

The identity matrix In of size n is the n-by-n matrix in which all the elements on the main diagonal are equal to 1 and all other elements are equal to 0,[59] for example,  I 1 = [ 1 ] , I 2 = [ 1 0 0 1 ] , ⋮ I n = [ 1 0 ⋯ 0 0 1 ⋯ 0 ⋮ ⋮ ⋱ ⋮ 0 0 ⋯ 1 ] {\displaystyle {\begin{aligned}\mathbf {I} _{1}&={\begin{bmatrix}1\end{bmatrix}},\\\\[4pt]\mathbf {I} _{2}&={\begin{bmatrix}1&0\\\0&1\end{bmatrix}},\\\\[4pt]\vdots &\\\\[4pt]\mathbf {I} _{n}&={\begin{bmatrix}1&0&\cdots &0\\\0&1&\cdots &0\\\\\vdots &\vdots &\ddots &\vdots \\\0&0&\cdots &1\end{bmatrix}}\end{aligned}}} It is a square matrix of order n, and also a special kind of diagonal matrix. It is called an identity matrix because multiplication with it leaves a matrix unchanged:[59] A I n = I m A = A {\displaystyle {\mathbf {AI}}_{n}={\mathbf {I}}_{m}{\mathbf {A}}={\mathbf {A}}} for any m-by-n matrix A.

A scalar multiple of an identity matrix is called a scalar matrix.[60]

#### Symmetric or skew-symmetric matrix

[edit]

A square matrix A that is equal to its transpose, that is, A = AT, is a symmetric matrix. If instead, A is equal to the negative of its transpose, that is, A = −AT, then A is a skew-symmetric matrix. In complex matrices, symmetry is often replaced by the concept of Hermitian matrices, which satisfies A∗ = A, where the star or asterisk denotes the conjugate transpose of the matrix, that is, the transpose of the complex conjugate of A.[61]

By the spectral theorem, real symmetric matrices and complex Hermitian matrices have an eigenbasis; that is, every vector is expressible as a linear combination of eigenvectors. In both cases, all eigenvalues are real.[62] This theorem can be generalized to infinite-dimensional situations related to matrices with infinitely many rows and columns.[63]

#### Invertible matrix and its inverse

[edit]

A square matrix A is called invertible or non-singular if there exists a matrix B such that[64][65] A B = B A = I n , {\displaystyle {\mathbf {AB}}={\mathbf {BA}}={\mathbf {I}}_{n},} where In is the n×n identity matrix with 1 for each entry on the main diagonal and 0 elsewhere. If B exists, it is unique and is called the inverse matrix of A, denoted A−1.[66]

There are many algorithms for testing whether a square matrix is invertible, and, if it is, computing its inverse. One of the oldest, which is still in common use is Gaussian elimination.[67]

#### Definite matrix

[edit]

Positive definite matrix | Indefinite matrix

|

[ 1 4 0 0 1 ] {\displaystyle {\begin{bmatrix}{\frac {1}{4}}&0\\\0&1\\\\\end{bmatrix}}} |  [ 1 4 0 0 − 1 4 ] {\displaystyle {\begin{bmatrix}{\frac {1}{4}}&0\\\0&-{\frac {1}{4}}\end{bmatrix}}}
Q ( x , y ) = 1 4 x 2 + y 2 {\displaystyle Q(x,y)={\frac {1}{4}}x^{2}+y^{2}} |  Q ( x , y ) = 1 4 x 2 − 1 4 y 2 {\displaystyle Q(x,y)={\frac {1}{4}}x^{2}-{\frac {1}{4}}y^{2}}

Points such that  Q ( x , y ) = 1 {\textstyle Q(x,y)=1}
(Ellipse)  |
Points such that  Q ( x , y ) = 1 {\textstyle Q(x,y)=1}
(Hyperbola)

A symmetric real matrix A is called positive-definite if the associated quadratic form f ( x ) = x T A x {\displaystyle f({\mathbf {x}})={\mathbf {x}}^{\rm {T}}{\mathbf {Ax}}} has a positive value for every nonzero vector x in ⁠ R n {\displaystyle \mathbb {R} ^{n}} ⁠. If f(x) yields only negative values then A is negative-definite; if f does produce both negative and positive values then A is  indefinite.[68] If the quadratic form f yields only non-negative values (positive or zero), the symmetric matrix is called positive-semidefinite (or if only non-positive values, then negative-semidefinite); hence the matrix is indefinite precisely when it is neither positive-semidefinite nor negative-semidefinite.[69]

A symmetric matrix is positive-definite if and only if all its eigenvalues are positive, that is, the matrix is positive-semidefinite and it is invertible.[70] The table at the right shows two possibilities for 2-by-2 matrices. The eigenvalues of a diagonal matrix are simply the entries along the diagonal,[71] and so in these examples, the eigenvalues can be read directly from the matrices themselves. The first matrix has two eigenvalues that are both positive, while the second has one that is positive and another that is negative.

Allowing as input two different vectors instead yields the bilinear form associated to A:[72] B A ( x , y ) = x T A y . {\displaystyle B_{\mathbf {A}}({\mathbf {x}},{\mathbf {y}})={\mathbf {x}}^{\rm {T}}{\mathbf {Ay}}.}

In the case of complex matrices, the same terminology and results apply, with symmetric matrix, quadratic form, bilinear form, and transpose xT replaced respectively by Hermitian matrix, Hermitian form, sesquilinear form, and conjugate transpose xH.[73]

#### Orthogonal matrix

[edit]

Main article: Orthogonal matrix

An orthogonal matrix is a square matrix with real entries whose columns and rows are orthogonal unit vectors (that is, orthonormal vectors).[74] Equivalently, a matrix A is orthogonal if its transpose is equal to its inverse:  A T = A − 1 , {\displaystyle \mathbf {A} ^{\mathrm {T} }=\mathbf {A} ^{-1},\,} which entails  A T A = A A T = I n , {\displaystyle \mathbf {A} ^{\mathrm {T} }\mathbf {A} =\mathbf {A} \mathbf {A} ^{\mathrm {T} }=\mathbf {I} _{n},} where In is the identity matrix of size n.[75]

An orthogonal matrix A is necessarily invertible (with inverse A−1 = AT), unitary (A−1 = A*), and normal (A*A = AA*). The determinant of any orthogonal matrix is either +1 or −1. A special orthogonal matrix is an orthogonal matrix with determinant +1. As a linear transformation, every orthogonal matrix with determinant +1 is a pure rotation without reflection, i.e., the transformation preserves the orientation of the transformed structure, while every orthogonal matrix with determinant −1 reverses the orientation, i.e., is a composition of a pure reflection and a (possibly null) rotation. The identity matrices have determinant 1 and are pure rotations by an angle zero.[76]

The complex analog of an orthogonal matrix is a unitary matrix.[77]

### Main operations

[edit]

#### Trace

[edit]

The trace, tr(A) of a square matrix A is the sum of its diagonal entries. While matrix multiplication is not commutative as mentioned above, the trace of the product of two matrices is independent of the order of the factors:[78] tr ⁡ ( A B ) = tr ⁡ ( B A ) . {\displaystyle \operatorname {tr} (\mathbf {AB} )=\operatorname {tr} (\mathbf {BA} ).} This is immediate from the definition of matrix multiplication:[79] tr ⁡ ( A B ) = ∑ i = 1 m ∑ j = 1 n a i j b j i = tr ⁡ ( B A ) . {\displaystyle \operatorname {tr} (\mathbf {AB} )=\sum _{i=1}^{m}\sum _{j=1}^{n}a_{ij}b_{ji}=\operatorname {tr} (\mathbf {BA} ).} It follows that the trace of the product of more than two matrices is independent of cyclic permutations of the matrices; however, this does not in general apply for arbitrary permutations. For example, tr(ABC) ≠ tr(BAC), in general.[80] Also, the trace of a matrix is equal to that of its transpose,[81] that is,  tr ⁡ ( A ) = tr ⁡ ( A T ) . {\displaystyle \operatorname {tr} ({\mathbf {A}})=\operatorname {tr} ({\mathbf {A}}^{\rm {T}}).}

#### Determinant

[edit]

Main article: Determinant

A linear transformation on ⁠ R 2 {\displaystyle \mathbb {R} ^{2}} ⁠ given by the indicated matrix. The determinant of this matrix is −1, as the area of the green parallelogram at the right is 1, but the map reverses the orientation, since it turns the counterclockwise orientation of the vectors to a clockwise one.

The determinant of a square matrix A (denoted det(A) or |A|) is a number encoding certain properties of the matrix. A matrix is invertible if and only if its determinant is nonzero.[82] Its absolute value equals the area (in ⁠ R 2 {\displaystyle \mathbb {R} ^{2}} ⁠) or volume (in ⁠ R 3 {\displaystyle \mathbb {R} ^{3}} ⁠) of the image of the unit square (or cube), while its sign corresponds to the orientation of the corresponding linear map: the determinant is positive if and only if the orientation is preserved.[83]

The determinant of 2-by-2 matrices is given by[84] det [ a b c d ] = a d − b c . {\displaystyle \det {\begin{bmatrix}a&b\\\c&d\end{bmatrix}}=ad-bc.} The determinant of 3-by-3 matrices involves 6 terms (rule of Sarrus). The more lengthy Leibniz formula generalizes these two formulae to all dimensions.[85]

The determinant of a product of square matrices equals the product of their determinants:  det ( A B ) = det ( A ) ⋅ det ( B ) , {\displaystyle \det({\mathbf {AB}})=\det({\mathbf {A}})\cdot \det({\mathbf {B}}),} or using alternate notation:[86] | A B | = | A | ⋅ | B | . {\displaystyle |{\mathbf {AB}}|=|{\mathbf {A}}|\cdot |{\mathbf {B}}|.} Adding a multiple of any row to another row, or a multiple of any column to another column, does not change the determinant. Interchanging two rows or two columns affects the determinant by multiplying it by −1.[87] Using these operations, any matrix can be transformed to a lower (or upper) triangular matrix, and for such matrices, the determinant equals the product of the entries on the main diagonal; this provides a method to calculate the determinant of any matrix. Finally, the Laplace expansion expresses the determinant in terms of minors, that is, determinants of smaller matrices.[88] This expansion can be used for a recursive definition of determinants (taking as starting case the determinant of a 1-by-1 matrix, which is its unique entry, or even the determinant of a 0-by-0 matrix, which is 1), that can be seen to be equivalent to the Leibniz formula. Determinants can be used to solve linear systems using Cramer's rule, where the division of the determinants of two related square matrices equates to the value of each of the system's variables.[89]

#### Eigenvalues and eigenvectors

[edit]

Main article: Eigenvalues and eigenvectors

A number  λ {\textstyle \lambda } and a nonzero vector v satisfying  A v = λ v {\displaystyle \mathbf {A} \mathbf {v} =\lambda \mathbf {v} } are called an eigenvalue and an eigenvector of A, respectively.[90][91] The number λ is an eigenvalue of an n×n-matrix A if and only if (A − λIn) is not invertible, which is equivalent to[92] det ( A − λ I ) = 0. {\displaystyle \det(\mathbf {A} -\lambda \mathbf {I} )=0.} The polynomial pA in an indeterminate X given by evaluation of the determinant det(XIn − A) is called the characteristic polynomial of A. It is a monic polynomial of degree n. Therefore the polynomial equation pA(λ) = 0 has at most n different solutions, that is, eigenvalues of the matrix.[93] They may be complex even if the entries of A are real.[94] According to the Cayley–Hamilton theorem, pA(A) = 0, that is, the result of substituting the matrix itself into its characteristic polynomial yields the zero matrix.[95]

## Computational aspects

[edit]

Matrix calculations can be often performed with different techniques. Many problems can be solved by both direct algorithms and iterative approaches. For example, the eigenvectors of a square matrix can be obtained by finding a sequence of vectors xn converging to an eigenvector when n tends to infinity.[96]

To choose the most appropriate algorithm for each specific problem, it is important to determine both the effectiveness and precision of all the available algorithms. The domain studying these matters is called numerical linear algebra.[97] As with other numerical situations, two main aspects are the complexity of algorithms and their numerical stability.

Determining the complexity of an algorithm means finding upper bounds or estimates of how many elementary operations such as additions and multiplications of scalars are necessary to perform some algorithm, for example, multiplication of matrices. Calculating the matrix product of two n-by-n matrices using the definition given above needs n3 multiplications, since for any of the n2 entries of the product, n multiplications are necessary. The Strassen algorithm outperforms this "naive" algorithm; it needs only n2.807 multiplications.[98] Theoretically faster but impractical matrix multiplication algorithms have been developed,[99] as have speedups to this problem using parallel algorithms or distributed computation systems such as MapReduce.[100]

In many practical situations, additional information about the matrices involved is known. An important case concerns sparse matrices, that is, matrices whose entries are mostly zero. There are specifically adapted algorithms for, say, solving linear systems Ax = b for sparse matrices A, such as the conjugate gradient method.[101]

An algorithm is, roughly speaking, numerically stable if little deviations in the input values do not lead to big deviations in the result. For example, one can calculate the inverse of a matrix by computing its adjugate matrix:  A − 1 = adj ⁡ ( A ) / det ( A ) . {\displaystyle {\mathbf {A}}^{-1}=\operatorname {adj} ({\mathbf {A}})/\det({\mathbf {A}}).} However, this may lead to significant rounding errors if the determinant of the matrix is very small. The norm of a matrix can be used to capture the conditioning of linear algebraic problems, such as computing a matrix's inverse.[102]

## Decomposition

[edit]

Main articles: Matrix decomposition, Matrix diagonalization, Gaussian elimination, and Bareiss algorithm

There are several methods to render matrices into a more easily accessible form. They are generally referred to as matrix decomposition or matrix factorization techniques. These techniques are of interest because they can make computations easier.

The LU decomposition factors matrices as a product of lower (L) and an upper triangular matrices (U).[103] Once this decomposition is calculated, linear systems can be solved more efficiently by a simple technique called forward and back substitution. Likewise, inverses of triangular matrices are algorithmically easier to calculate. The Gaussian elimination is a similar algorithm; it transforms any matrix to row echelon form.[104] Both methods proceed by multiplying the matrix by suitable elementary matrices, which correspond to permuting rows or columns and adding multiples of one row to another row. Singular value decomposition expresses any matrix A as a product UDV∗, where U and V are unitary matrices and D is a diagonal matrix.[105]

An example of a matrix in Jordan normal form. The grey blocks are called Jordan blocks.

The eigendecomposition or diagonalization expresses A as a product VDV−1, where D is a diagonal matrix and V is a suitable invertible matrix.[106] If A can be written in this form, it is called diagonalizable. More generally, and applicable to all matrices, the Jordan decomposition transforms a matrix into Jordan normal form, that is to say matrices whose only nonzero entries are the eigenvalues λ1 to λn of A, placed on the main diagonal and possibly entries equal to one directly above the main diagonal, as shown at the right.[107] Given the eigendecomposition, the nth power of A (that is, n-fold iterated matrix multiplication) can be calculated via  A n = ( V D V − 1 ) n = V D V − 1 V D V − 1 … V D V − 1 = V D n V − 1 {\displaystyle {\mathbf {A}}^{n}=({\mathbf {VDV}}^{-1})^{n}={\mathbf {VDV}}^{-1}{\mathbf {VDV}}^{-1}\ldots {\mathbf {VDV}}^{-1}={\mathbf {VD}}^{n}{\mathbf {V}}^{-1}} and the power of a diagonal matrix can be calculated by taking the corresponding powers of the diagonal entries, which is much easier than doing the exponentiation for A instead. This can be used to compute the matrix exponential eA, a need frequently arising in solving linear differential equations, matrix logarithms and square roots of matrices.[108] To avoid numerically ill-conditioned situations, further algorithms such as the Schur decomposition can be employed.[109]

## Abstract algebraic aspects and generalizations

[edit]

Matrices can be generalized in different ways. Abstract algebra uses matrices with entries in more general fields or even rings, while linear algebra codifies properties of matrices in the notion of linear maps. It is possible to consider matrices with infinitely many columns and rows. Another extension is tensors, which can be seen as higher-dimensional arrays of numbers, as opposed to vectors, which can often be realized as sequences of numbers, while matrices are rectangular or two-dimensional arrays of numbers.[110] Matrices, subject to certain requirements tend to form groups known as matrix groups.[111] Similarly under certain conditions matrices form rings known as matrix rings.[112] Though the product of matrices is not in general commutative, certain matrices form fields sometimes called matrix fields.[113] (However the term "matrix field" is ambiguous, also referring to certain forms of physical fields that continuously map points of some space to matrices.[114]) In general, matrices over any ring and their multiplication can be represented as the arrows and composition of arrows in a category, the category of matrices over that ring. The objects of this category are natural numbers, representing the dimensions of the matrices.[115]

### Matrices with entries in a field or ring

[edit]

This article focuses on matrices whose entries are real or complex numbers. However, matrices can be considered with much more general types of entries than real or complex numbers. As a first step of generalization, any field, that is, a set where addition, subtraction, multiplication, and division operations are defined and well-behaved, may be used instead of ⁠ R {\displaystyle \mathbb {R} } ⁠ or ⁠ C {\displaystyle \mathbb {C} } ⁠, for example rational numbers or finite fields. For example, coding theory makes use of matrices over finite fields.[116] Wherever eigenvalues are considered, as these are roots of a polynomial, they may exist only in a larger field than that of the entries of the matrix. For instance, they may be complex in the case of a matrix with real entries. The possibility to reinterpret the entries of a matrix as elements of a larger field (for example, to view a real matrix as a complex matrix whose entries happen to be all real) then allows considering each square matrix to possess a full set of eigenvalues.[117] Alternatively one can consider only matrices with entries in an algebraically closed field, such as ⁠ C , {\displaystyle \mathbb {C} ,} ⁠ from the outset.[118]

Matrices whose entries are polynomials,[119] and more generally, matrices with entries in a ring R are widely used in mathematics.[1] Rings are a more general notion than fields in that a division operation need not exist. The very same addition and multiplication operations of matrices extend to this setting, too. The set M(n, R) (also denoted Mn(R)[15]) of all square n-by-n matrices over R is a ring called matrix ring, isomorphic to the endomorphism ring of the left R-module Rn.[120] If the ring R is commutative, that is, its multiplication is commutative, then the ring M(n, R) is also an associative algebra over R. The determinant of square matrices over a commutative ring R can still be defined using the Leibniz formula; such a matrix is invertible if and only if its determinant is invertible in R, generalizing the situation over a field F, where every nonzero element is invertible.[121] Matrices over superrings are called supermatrices.[122]

Matrices do not always have all their entries in the same ring – or even in any ring at all. One special but common case is block matrices, which may be considered as matrices whose entries themselves are matrices. The entries need not be square matrices, and thus need not be members of any ring; but in order to multiply them, their sizes must fulfill certain conditions: each pair of submatrices that are multiplied in forming the overall product must have compatible sizes.[123]

### Relationship to linear maps

[edit]

Linear maps  R n → R m {\displaystyle \mathbb {R} ^{n}\to \mathbb {R} ^{m}} are equivalent to m-by-n matrices, as described above. More generally, any linear map f : V → W between finite-dimensional vector spaces can be described by a matrix A = (aij), after choosing bases v1, ..., vn of V, and w1, ..., wm of W (so n is the dimension of V and m is the dimension of W), which is such that  f ( v j ) = ∑ i = 1 m a i , j w i for   j = 1 , … , n . {\displaystyle f(\mathbf {v} _{j})=\sum _{i=1}^{m}a_{i,j}\mathbf {w} _{i}\qquad {\mbox{for}}\ j=1,\ldots ,n.} In other words, column j of A expresses the image of vj in terms of the basis vectors wi of W; thus this relation uniquely determines the entries of the matrix A. The matrix depends on the choice of the bases: different choices of bases give rise to different, but equivalent matrices.[124] Many of the above concrete notions can be reinterpreted in this light, for example, the transpose matrix AT describes the transpose of the linear map given by A, concerning the dual bases.[125]

These properties can be restated more naturally: the category of matrices with entries in a field  k {\displaystyle k} with multiplication as composition is equivalent to the category of finite-dimensional vector spaces and linear maps over this field.[126]

More generally, the set of m×n matrices can be used to represent the R-linear maps between the free modules Rm and Rn for an arbitrary ring R with unity. When n = m composition of these maps is possible, and this gives rise to the matrix ring of n×n matrices representing the endomorphism ring of Rn.[127]

### Matrix groups

[edit]

Main article: Matrix group

A group is a mathematical structure consisting of a set of objects together with a binary operation, that is, an operation combining any two objects to a third, subject to certain requirements.[128] A group in which the objects are matrices and the group operation is matrix multiplication is called a matrix group.[129][130] All invertible matrices of a given size form a matrix group, called a general linear group. Since every element of a matrix group must be invertible, the general linear groups are the most general matrix groups, in the sense that every matrix group is a subgroup of a general linear group.[131]

Any property of matrices that is preserved under matrix products and inverses can be used to define further matrix groups. For example, matrices with a given size and with a determinant of 1 form a subgroup of (that is, a smaller group contained in) their general linear group, called a special linear group.[132] Orthogonal matrices, determined by the condition  M T M = I , {\displaystyle {\mathbf {M}}^{\rm {T}}{\mathbf {M}}={\mathbf {I}},} form the orthogonal group.[133] Every orthogonal matrix has determinant 1 or −1. Orthogonal matrices with determinant 1 form a subgroup called the special orthogonal group.[134]

Every finite group is isomorphic to a matrix group, as one can see by considering the regular representation of the symmetric group.[135] General groups can be studied using matrix groups, which are comparatively well understood, using representation theory.[136]

### Infinite matrices

[edit]

It is also possible to consider matrices with infinitely many rows and/or columns.[137] The basic operations introduced above are defined the same way in this case. Matrix multiplication, however, and all operations stemming therefrom are only meaningful when restricted to certain matrices, since the sum featuring in the above definition of the matrix product will contain an infinity of summands.[138] An easy way to circumvent this issue is to restrict to finitary matrices all of whose rows (or columns) contain only finitely many nonzero terms.[139] As in the finite case (see above), where matrices describe linear maps, infinite matrices can be used to describe operators on Hilbert spaces, where convergence and continuity questions arise. However, the explicit point of view of matrices tends to obfuscate the matter,[140] and the abstract and more powerful tools of functional analysis are used instead, by relating matrices to linear maps (as in the finite case above), but imposing additional convergence and continuity constraints.

### Empty matrix

[edit]

An empty matrix is a matrix in which the number of rows or columns (or both) is zero.[141][8] Empty matrices can be a useful base case for certain recursive constructions,[142] and can help to deal with maps involving the zero vector space.[143] For example, if A is a 3-by-0 matrix and B is a 0-by-3 matrix, then AB is the 3-by-3 zero matrix corresponding to the null map from a 3-dimensional space V to itself, while BA is a 0-by-0 matrix. There is no common notation for empty matrices, but most computer algebra systems allow creating and computing with them.[144] The determinant of the 0-by-0 matrix is conventionally defined to be 1, consistent with the empty product occurring in the Leibniz formula for the determinant.[145] This value is also needed for consistency with the  2 × 2 {\displaystyle 2\times 2} case of the Desnanot–Jacobi identity relating determinants to the determinants of smaller matrices.[146]

### Matrices with entries in a semiring

[edit]

A semiring is similar to a ring, but elements need not have additive inverses, therefore one cannot do subtraction freely there. The definition of addition and multiplication of matrices with entries in a ring applies to matrices with entries in a semiring without modification. Matrices of fixed size with entries in a semiring form a commutative monoid Mat ⁡ ( m , n ; R ) {\displaystyle \operatorname {Mat} (m,n;R)} under addition.[147] Square matrices of fixed size with entries in a semiring form a semiring  Mat ⁡ ( n ; R ) {\displaystyle \operatorname {Mat} (n;R)} under addition and multipilcation.[147]

The determinant of an  n × n {\displaystyle n\times n} square matrix  M {\displaystyle M} with entries in a commutative semiring R {\displaystyle R} cannot be defined in general because the definition would involve additive inverses of semiring elements. What plays its role instead is the pair of positive and negative determinants

det + M = ∑ σ ∈ Alt ⁡ ( n ) M 1 σ ( 1 ) ⋯ M n σ ( n ) {\displaystyle \det \nolimits _{+}M=\sum _{\sigma \in \operatorname {Alt} (n)}M_{1\sigma (1)}\cdots M_{n\sigma (n)}}
det − M = ∑ σ ∈ Sym ⁡ ( n ) ∖ Alt ⁡ ( n ) M 1 σ ( 1 ) ⋯ M n σ ( n ) {\displaystyle \det \nolimits _{-}M=\sum _{\sigma \in \operatorname {Sym} (n)\setminus \operatorname {Alt} (n)}M_{1\sigma (1)}\cdots M_{n\sigma (n)}}

where the sums are taken over even permutations and odd permutations, respectively.[148][149]

### Matrices with entries in a category

[edit]

Matrices and their multiplication can be defined with entries objects of a category equipped with a "tensor product" similar to multiplication in a ring, having coproducts similar to addition in a ring, in that the former is distributive over the latter.[150] However, the multiplication thus defined may be only associative in a sense weaker than usual. These are part of a bigger structure called the bicategory of matrices. The complete description of the above summmary for interested readers follows.

Let  ( C , ⊗ , I ) {\displaystyle ({\mathcal {C}},\otimes ,I)} be a monoidal category satisfying the following two conditions:

* All (small) coproducts exist; in particular, let  ∅ {\displaystyle \varnothing } be an initial object.
* The functor  ⊗ {\displaystyle \otimes } is distributive over coproducts; i.e., for all object  X {\displaystyle X} and a family of objects  ( Y i ) i ∈ I {\displaystyle (Y_{i})_{i\in I}} in  C {\displaystyle {\mathcal {C}}} , the canonical  C {\displaystyle {\mathcal {C}}} -morphisms  ∐ i ∈ I ( X ⊗ Y i ) → X ⊗ ∐ i ∈ I Y i {\displaystyle \coprod _{i\in I}(X\otimes Y_{i})\to X\otimes \coprod _{i\in I}Y_{i}} ∐ i ∈ I ( Y i ⊗ X ) → ( ∐ i ∈ I Y i ) ⊗ X {\displaystyle \coprod _{i\in I}(Y_{i}\otimes X)\to \left(\coprod _{i\in I}Y_{i}\right)\otimes X} are isomorphisms. In particular, the canonical morphisms  ∅ → X ⊗ ∅ {\displaystyle \varnothing \to X\otimes \varnothing } and  ∅ → ∅ ⊗ X {\displaystyle \varnothing \to \varnothing \otimes X} are isomorphisms.

Then, the bicategory of  C {\displaystyle {\mathcal {C}}} -matrices  Mat ⁡ ( C ) {\displaystyle \operatorname {Mat} ({\mathcal {C}})} is as follows:[150]

* The objects are the sets.
* A 1-morphism M : A → B {\displaystyle M\colon A\to B} is a map  M : A × B → Ob ⁡ ( C ) {\displaystyle M\colon A\times B\to \operatorname {Ob} ({\mathcal {C}})} ; this is just a matrix over  C {\displaystyle {\mathcal {C}}} .
* The composition of 1-morphisms  M : A → B {\displaystyle M\colon A\to B} and  N : B → C {\displaystyle N\colon B\to C} , which can be understood as matrix multiplication, is  ( N ∘ M ) ( a , c ) = ∐ b ∈ B M ( a , b ) ⊗ N ( b , c ) . {\displaystyle (N\circ M)(a,c)=\coprod _{b\in B}M(a,b)\otimes N(b,c).}
* The identity 1-morphism on  A {\displaystyle A} is  id A ⁡ ( a , b ) = { I a = b ∅ a ≠ b . {\displaystyle \operatorname {id} _{A}(a,b)={\begin{cases}I&a=b\\\\\varnothing &a\neq b\end{cases}}.}
* A 2-morphism between 1-morphisms  M , N : A → B {\displaystyle M,N\colon A\to B} is a family of  C {\displaystyle {\mathcal {C}}} -morphisms  ( f a b : M ( a , b ) → N ( a , b ) ) ( a , b ) ∈ A × B {\displaystyle (f_{ab}\colon M(a,b)\to N(a,b))_{(a,b)\in A\times B}} . The definition of vertical and horizontal composition of 2-morphisms is natural: the vertical composition is componenwise composition of  C {\displaystyle {\mathcal {C}}} -morphisms; the horizontal composition is that derived from the functoriality of  ⊗ {\displaystyle \otimes } and the universal property of coproducts.

In general, the bicategory of matrices need not be a strict 2-category. For example, the composition of 1-morphisms may not be associative in the usual strict sense, but only up to coherent isomorphism.

## Applications

[edit]

There are numerous applications of matrices, both in mathematics and other sciences. Some of them merely take advantage of the compact representation of a set of numbers in a matrix. For example,Text mining and automated thesaurus compilation makes use of document-term matrices such as tf-idf to track frequencies of certain words in several documents.[151]

Complex numbers can be represented by particular real 2-by-2 matrices via  a + i b ↔ [ a − b b a ] , {\displaystyle a+ib\leftrightarrow {\begin{bmatrix}a&-b\\\b&a\end{bmatrix}},} under which addition and multiplication of complex numbers and matrices correspond to each other. For example, 2-by-2 rotation matrices represent the multiplication with some complex number of absolute value 1, as above. A similar interpretation is possible for quaternions[152] and Clifford algebras in general.[153]

In game theory and economics, the payoff matrix encodes the payoff for two players, depending on which out of a given (finite) set of strategies the players choose.[154] The expected outcome of the game, when both players play mixed strategies, is obtained by multiplying this matrix on both sides by vectors representing the strategies.[155] The minimax theorem central to game theory is closely related to the duality theory of linear programs, which are often formulated in terms of matrix-vector products.[156]

Early encryption techniques such as the Hill cipher also used matrices. However, due to the linear nature of matrices, these codes are comparatively easy to break.[157] Computer graphics uses matrices to represent objects; to calculate transformations of objects using affine rotation matrices to accomplish tasks such as projecting a three-dimensional object onto a two-dimensional screen, corresponding to a theoretical camera observation; and to apply image convolutions such as sharpening, blurring, edge detection, and more.[158] Matrices over a polynomial ring are important in the study of control theory.[159]

Chemistry makes use of matrices in various ways, particularly since the use of quantum theory to discuss molecular bonding and spectroscopy. Examples are the overlap matrix and the Fock matrix used in solving the Roothaan equations to obtain the molecular orbitals of the Hartree–Fock method.[160]

### Graph theory

[edit]

An undirected graph with adjacency matrix:  [ 1 1 0 1 0 1 0 1 0 ] . {\displaystyle {\begin{bmatrix}1&1&0\\\1&0&1\\\0&1&0\end{bmatrix}}.}

The adjacency matrix of a finite graph is a basic notion of graph theory.[161] It records which vertices of the graph are connected by an edge. Matrices containing just two different values (1 and 0 meaning for example "yes" and "no", respectively) are called logical matrices. The distance (or cost) matrix contains information about the distances of the edges.[162] These concepts can be applied to websites connected by hyperlinks,[163] or cities connected by roads etc., in which case (unless the connection network is extremely dense) the matrices tend to be sparse, that is, contain few nonzero entries. Therefore, specifically tailored matrix algorithms can be used in network theory.[164]

### Analysis and geometry

[edit]

The Hessian matrix of a differentiable function f : R n → R {\displaystyle f:\mathbb {R} ^{n}\to \mathbb {R} } consists of the second derivatives of ƒ concerning the several coordinate directions, that is,[165] H ( f ) = [ ∂ 2 f ∂ x i ∂ x j ] . {\displaystyle H(f)=\left[{\frac {\partial ^{2}f}{\partial x_{i}\,\partial x_{j}}}\right].}

At the saddle point (x = 0, y = 0) (red) of the function f (x,−y) = x2 − y2, the Hessian matrix  [ 2 0 0 − 2 ] {\displaystyle {\begin{bmatrix}2&0\\\0&-2\end{bmatrix}}} is indefinite.

It encodes information about the local growth behavior of the function: given a critical point x = (x1, ..., xn), that is, a point where the first partial derivatives ∂ f / ∂ x i {\displaystyle \partial f/\partial x_{i}} of f vanish, the function has a local minimum if the Hessian matrix is positive definite. Quadratic programming can be used to find global minima or maxima of quadratic functions closely related to the ones attached to matrices (see above).[166]

Another matrix frequently used in geometrical situations is the Jacobi matrix of a differentiable map ⁠ f : R n → R m {\displaystyle f:\mathbb {R} ^{n}\to \mathbb {R} ^{m}} ⁠. If f1, ..., fm denote the components of f, then the Jacobi matrix is defined as[167] J ( f ) = [ ∂ f i ∂ x j ] 1 ≤ i ≤ m , 1 ≤ j ≤ n . {\displaystyle J(f)=\left[{\frac {\partial f_{i}}{\partial x_{j}}}\right]_{1\leq i\leq m,1\leq j\leq n}.} If n > m, and if the rank of the Jacobi matrix attains its maximal value m, f is locally invertible at that point, by the implicit function theorem.[168]

Partial differential equations can be classified by considering the matrix of coefficients of the highest-order differential operators of the equation. For elliptic partial differential equations this matrix is positive definite, which has a decisive influence on the set of possible solutions of the equation in question.[169]

The finite element method is an important numerical method to solve partial differential equations, widely applied in simulating complex physical systems. It attempts to approximate the solution to some equation by piecewise linear functions, where the pieces are chosen concerning a sufficiently fine grid, which in turn can be recast as a matrix equation.[170]

### Probability theory and statistics

[edit]

Two different Markov chains. The chart depicts the number of particles (of a total of 1000) in state "2". Both limiting values can be determined from the transition matrices, which are given by  [ 0.7 0 0.3 1 ] {\displaystyle \left[{\begin{smallmatrix}0.7&0\\\0.3&1\end{smallmatrix}}\right]} (red) and  [ 0.7 0.2 0.3 0.8 ] {\displaystyle \left[{\begin{smallmatrix}0.7&0.2\\\0.3&0.8\end{smallmatrix}}\right]} (black).

Stochastic matrices are square matrices whose rows are probability vectors, that is, whose entries are non-negative and sum up to one. Stochastic matrices are used to define Markov chains with finitely many states.[171] A row of the stochastic matrix gives the probability distribution for the next position of some particle currently in the state that corresponds to the row. Properties of the Markov chain—like absorbing states, that is, states that any particle attains eventually—can be read off the eigenvectors of the transition matrices.[172]

Statistics also makes use of matrices in many different forms.[173] Descriptive statistics is concerned with describing data sets, which can often be represented as data matrices, which may then be subjected to dimensionality reduction techniques. The covariance matrix encodes the mutual variance of several random variables.[174] Another technique using matrices are linear least squares, a method that approximates a finite set of pairs (x1, y1), (x2, y2), ..., (xN, yN), by a linear function  y i ≈ a x i + b , i = 1 , … , N {\displaystyle y_{i}\approx ax_{i}+b,\quad i=1,\ldots ,N} which can be formulated in terms of matrices, related to the singular value decomposition of matrices.[175]

Random matrices are matrices whose entries are random numbers, subject to suitable probability distributions, such as matrix normal distribution. Beyond probability theory, they are applied in domains ranging from number theory to physics.[176][177]

### Quantum mechanics and particle physics

[edit]

The first model of quantum mechanics (Heisenberg, 1925) used infinite-dimensional matrices to define the operators that took over the role of variables like position, momentum and energy from classical physics.[178] (This is sometimes referred to as matrix mechanics.[179]) Matrices, both finite and infinite-dimensional, have since been employed for many purposes in quantum mechanics. One particular example is the density matrix, a tool used in calculating the probabilities of the outcomes of measurements performed on physical systems.[180][181]

Linear transformations and the associated symmetries play a key role in modern physics. For example, elementary particles in quantum field theory are classified as representations of the Lorentz group of special relativity and, more specifically, by their behavior under the spin group. Concrete representations involving the Pauli matrices and more general gamma matrices are an integral part of the physical description of fermions, which behave as spinors.[182] For the three lightest quarks, there is a group-theoretical representation involving the special unitary group SU(3); for their calculations, physicists use a convenient matrix representation known as the Gell-Mann matrices, which are also used for the SU(3) gauge group that forms the basis of the modern description of strong nuclear interactions, quantum chromodynamics. The Cabibbo–Kobayashi–Maskawa matrix, in turn, expresses the fact that the basic quark states that are important for weak interactions are not the same as, but linearly related to the basic quark states that define particles with specific and distinct masses.[183]

Another matrix serves as a key tool for describing the scattering experiments that form the cornerstone of experimental particle physics: Collision reactions such as occur in particle accelerators, where non-interacting particles head towards each other and collide in a small interaction zone, with a new set of non-interacting particles as the result, can be described as the scalar product of outgoing particle states and a linear combination of ingoing particle states. The linear combination is given by a matrix known as the S-matrix, which encodes all information about the possible interactions between particles.[184]

### Normal modes

[edit]

A general application of matrices in physics is the description of linearly coupled harmonic systems. The equations of motion of such systems can be described in matrix form, with a mass matrix multiplying a generalized velocity to give the kinetic term, and a force matrix multiplying a displacement vector to characterize the interactions. The best way to obtain solutions is to determine the system's eigenvectors, its normal modes, by diagonalizing the matrix equation. Techniques like this are crucial when it comes to the internal dynamics of molecules: the internal vibrations of systems consisting of mutually bound component atoms.[185] They are also needed for describing mechanical vibrations, and oscillations in electrical circuits.[186]

### Geometrical optics

[edit]

Geometrical optics provides further matrix applications. In this approximative theory, the wave nature of light is neglected. The result is a model in which light rays are indeed geometrical rays. If the deflection of light rays by optical elements is small, the action of a lens or reflective element on a given light ray can be expressed as multiplication of a two-component vector with a two-by-two matrix called ray transfer matrix analysis: the vector's components are the light ray's slope and its distance from the optical axis, while the matrix encodes the properties of the optical element. There are two kinds of matrices, viz. a refraction matrix describing the refraction at a lens surface, and a translation matrix, describing the translation of the plane of reference to the next refracting surface, where another refraction matrix applies. The optical system, consisting of a combination of lenses and/or reflective elements, is simply described by the matrix resulting from the product of the components' matrices.[187]

The Jones calculus models the polarization of a light source as a  2 × 2 {\displaystyle 2\times 2} vector, and the effects of optical filters on this polarization vector as a matrix.[48]

### Electronics

[edit]

Electronic circuits that are composed of linear components (such as resistors, inductors and capacitors) obey Kirchhoff's circuit laws, which leads to a system of linear equations, which can be described with a matrix equation that relates the source currents and voltages to the resultant currents and voltages at each point in the circuit, and where the matrix entries are determined by the circuit.[188]

## History

[edit]

Matrices have a long history of application in solving linear equations but they were known as arrays until the 1800s. The Chinese text The Nine Chapters on the Mathematical Art written in the 10th–2nd century BCE is the first example of the use of array methods to solve simultaneous equations,[189] including the concept of determinants. In 1545 Italian mathematician Gerolamo Cardano introduced the method to Europe when he published Ars Magna.[190] The Japanese mathematician Seki used the same array methods to solve simultaneous equations in 1683.[191] The Dutch mathematician Jan de Witt represented transformations using arrays in his 1659 book Elements of Curves (1659).[192] Between 1700 and 1710 Gottfried Wilhelm Leibniz publicized the use of arrays for recording information or solutions and experimented with over 50 different systems of arrays.[190] Cramer presented his rule in 1750.[193][194]

The term "matrix" (Latin for "womb", "dam" (non-human female animal kept for breeding), "source", "origin", "list", and "register", are derived from mater—mother[195]) was coined by James Joseph Sylvester in 1850,[196] who understood a matrix as an object giving rise to several determinants today called minors, that is to say, determinants of smaller matrices that derive from the original one by removing columns and rows. In an 1851 paper, Sylvester explains:[197]

> I have in previous papers defined a "Matrix" as a rectangular array of terms, out of which different systems of determinants may be engendered from the womb of a common parent.

Arthur Cayley published a treatise on geometric transformations using matrices that were not rotated versions of the coefficients being investigated as had previously been done. Instead, he defined operations such as addition, subtraction, multiplication, and division as transformations of those matrices and showed the associative and distributive properties held. Cayley investigated and demonstrated the non-commutative property of matrix multiplication as well as the commutative property of matrix addition.[190] Early matrix theory had limited the use of arrays almost exclusively to determinants and Cayley's abstract matrix operations were revolutionary. He was instrumental in proposing a matrix concept independent of equation systems. In 1858, Cayley published his A memoir on the theory of matrices[198][199] in which he proposed and demonstrated the Cayley–Hamilton theorem.[190]

The English mathematician Cuthbert Edmund Cullis was the first to use modern bracket notation for matrices in 1913 and he simultaneously demonstrated the first significant use of the notation A = [ai,j] to represent a matrix where ai,j refers to the ith row and the jth column.[190]

The modern study of determinants sprang from several sources.[200] Number-theoretical problems led Gauss to relate coefficients of quadratic forms, that is, expressions such as x2 \+ xy − 2y2, and linear maps in three dimensions to matrices. Eisenstein further developed these notions, including the remark that, in modern parlance, matrix products are non-commutative. Cauchy was the first to prove general statements about determinants, using as the definition of the determinant of a matrix A = [ai,j] the following: replace the powers ajk by aj,k in the polynomial a 1 a 2 ⋯ a n ∏ i < j ( a j − a i ) , {\displaystyle a_{1}a_{2}\cdots a_{n}\prod _{i<j}(a_{j}-a_{i}),} where  ∏ {\displaystyle \textstyle \prod } denotes the product of the indicated terms. He also showed, in 1829, that the eigenvalues of symmetric matrices are real.[201] Jacobi studied "functional determinants"—later called Jacobi determinants by Sylvester—which can be used to describe geometric transformations at a local (or infinitesimal) level, see above. Kronecker's Vorlesungen über die Theorie der Determinanten[202] and Weierstrass's Zur Determinantentheorie,[203] both published in 1903, first treated determinants axiomatically, as opposed to previous more concrete approaches such as the mentioned formula of Cauchy. At that point, determinants were firmly established.[204][200]

Many theorems were first established for small matrices only, for example, the Cayley–Hamilton theorem was proved for 2×2 matrices by Cayley in the aforementioned memoir, and by Hamilton for 4×4 matrices. Frobenius, working on bilinear forms, generalized the theorem to all dimensions (1898). Also at the end of the 19th century, the Gauss–Jordan elimination (generalizing a special case now known as Gauss elimination) was established by Wilhelm Jordan. In the early 20th century, matrices attained a central role in linear algebra,[205] partially due to their use in the classification of the hypercomplex number systems of the previous century.[206]

The inception of matrix mechanics by Heisenberg, Born and Jordan led to studying matrices with infinitely many rows and columns.[207] Later, von Neumann carried out the mathematical formulation of quantum mechanics, by further developing functional analytic notions such as linear operators on Hilbert spaces, which, very roughly speaking, correspond to Euclidean space, but with an infinity of independent directions.[208]

### Other historical usages of the word "matrix" in mathematics

[edit]

The word has been used in unusual ways by at least two authors of historical importance.

Bertrand Russell and Alfred North Whitehead in their Principia Mathematica (1910–1913) use the word "matrix" in the context of their axiom of reducibility. They proposed this axiom as a means to reduce any function to one of lower type, successively, so that at the "bottom" (0 order) the function is identical to its extension:[209]

> Let us give the name of matrix to any function, of however many variables, that does not involve any apparent variables. Then, any possible function other than a matrix derives from a matrix using generalization, that is, by considering the proposition that the function in question is true with all possible values or with some value of one of the arguments, the other argument or arguments remaining undetermined.

For example, a function Φ(x, y) of two variables x and y can be reduced to a collection of functions of a single variable, such as y, by "considering" the function for all possible values of "individuals" ai substituted in place of a variable x. And then the resulting collection of functions of the single variable y, that is, ∀ai: Φ(ai, y), can be reduced to a "matrix" of values by "considering" the function for all possible values of "individuals" bi substituted in place of variable y:  ∀ b j ∀ a i : ϕ ( a i , b j ) . {\displaystyle \forall b_{j}\forall a_{i}\colon \phi (a_{i},b_{j}).}

Alfred Tarski in his 1941 Introduction to Logic used the word "matrix" synonymously with the notion of truth table as used in mathematical logic.[210]

## See also

[edit]

* Mathematics portal

* List of named matrices
* Gram–Schmidt process – Orthonormalization of a set of vectors
* Irregular matrix
* Matrix calculus – Specialized notation for multivariable calculus
* Matrix function – Function that maps matrices to matricesPages displaying short descriptions of redirect targets

## Notes

[edit]

1. ^ a b Lang (2002), Chapter XIII.
2. ^ Fraleigh (1976), p. 209.
3. ^ Nering (1970), p. 37.
4. ^ a b Brown (1991), p. 1.
5. ^ Golub & Van Loan (1996), p. 3.
6. ^ Horn & Johnson (1985), p. 5.
7. ^ Gbur (2011), p. 89.
8. ^ a b "A matrix having at least one dimension equal to zero is called an empty matrix", MATLAB Data Structures Archived 2009-12-28 at the Wayback Machine
9. ^ Ramachandra Rao & Bhimasankaram (2000), p. 71.
10. ^ Hamilton (1987), p. 29.
11. ^ Gentle (1998), pp. 52–53.
12. ^ Bauchau & Craig (2009), p. 915.
13. ^ Johnston (2021), p. 21.
14. ^ Oualline (2003), Ch. 5.
15. ^ a b Pop & Furdui (2017).
16. ^ For example, for ⁠ M {\displaystyle M} ⁠, see Mello (2017), p. 48; for ⁠ Mat {\displaystyle \operatorname {Mat} } ⁠, see Axler (1997), p. 50.
17. ^ Brown (1991), Definition I.2.1 (addition), Definition I.2.4 (scalar multiplication), and Definition I.2.33 (transpose).
18. ^ Whitelaw (1991), p. 29.
19. ^ Brown (1991), Theorem I.2.6.
20. ^ Whitelaw (1991), p. 30.
21. ^ Maxwell (1969), p. 46.
22. ^ Lancaster & Tismenetsky (1985), pp. 6–7.
23. ^ Andrilli & Hecker (2022), p. 38, The transpose of a matrix and its properties.
24. ^ a b Lancaster & Tismenetsky (1985), p. 9.
25. ^ Brown (1991), Definition I.2.20.
26. ^ Brown (1991), Theorem I.2.24.
27. ^ Boas (2005), p. 117.
28. ^ Horn & Johnson (1985), Ch. 4 and 5.
29. ^ Van Loan (2000).
30. ^ Perrone (2024), p. 119–120.
31. ^ Lang (1986), p. 71.
32. ^ Watkins (2002), p. 102.
33. ^ Bronson (1970), p. 16.
34. ^ Kreyszig (1972), p. 220.
35. ^ a b Protter & Morrey (1970), p. 869.
36. ^ Kreyszig (1972), pp. 241, 244.
37. ^ Schneider & Barker (2012).
38. ^ Perlis (1991).
39. ^ Anton (2010).
40. ^ Horn, Roger A.; Johnson, Charles R. (2012), Matrix Analysis (2nd ed.), Cambridge University Press, p. 17, ISBN 978-0-521-83940-2.
41. ^ Brown (1991), I.2.21 and 22.
42. ^ Gbur (2011), p. 95.
43. ^ Ben-Israel & Greville (2003), pp. 1–2.
44. ^ Grossman (1994), pp. 494–495.
45. ^ Bierens (2004), p. 263.
46. ^ Johnston (2021), p. 56.
47. ^ Pettofrezzo (1978), p. 60.
48. ^ a b c Han, Kim & Noz (1997).
49. ^ Jeffrey (2010), p. 264.
50. ^ Greub (1975, p. 90). Note however that Greub follows a transposed convention of representing a transformation by multiplying a row vector by a matrix, rather than multiplying a matrix by a column vector, leading to the reversed order for the two matrices in the product that represents a composition.
51. ^ Lang (1986), §VI.1.
52. ^ Brown (1991), Definition II.3.3.
53. ^ Greub (1975), Section III.1.
54. ^ Brown (1991), Theorem II.3.22.
55. ^ Anton (2010), p. 27.
56. ^ Reyes (2025).
57. ^ Anton (2010), p. 68.
58. ^ Gbur (2011), p. 91.
59. ^ a b Boas (2005), p. 118.
60. ^ Horn & Johnson (1985), §0.9.1 Diagonal matrices.
61. ^ Boas (2005), p. 138.
62. ^ Horn & Johnson (1985), Theorem 2.5.6.
63. ^ Conway (1990), pp. 262–263.
64. ^ Brown (1991), Definition I.2.28.
65. ^ Brown (1991), Definition I.5.13.
66. ^ Anton (2010), p. 62.
67. ^ Gbur (2011), pp. 99–100.
68. ^ Horn & Johnson (1985), Chapter 7.
69. ^ Anton (2010), Thm. 7.3.2.
70. ^ Horn & Johnson (1985), Theorem 7.2.1.
71. ^ Boas (2005), p. 150.
72. ^ Horn & Johnson (1985), p. 169, Example 4.0.6.
73. ^ Lang (1986), Appendix. Complex numbers.
74. ^ Horn & Johnson (1985), pp. 66–67.
75. ^ Gbur (2011), pp. 102–103.
76. ^ Boas (2005), pp. 127, 153–154.
77. ^ Boas (2005), p. 141.
78. ^ Horn & Johnson (1985), pp. 40, 42.
79. ^ Lang (1986), p. 281.
80. ^ Tang (2006), p. 226.
81. ^ Bernstein (2009), p. 94.
82. ^ Horn & Johnson (1985), §0.5 Nonsingularity.
83. ^ Margalit & Rabinoff (2019).
84. ^ "Matrix | mathematics", Encyclopedia Britannica, retrieved 2020-08-19
85. ^ Brown (1991), Definition III.2.1.
86. ^ Brown (1991), Theorem III.2.12.
87. ^ Brown (1991), Corollary III.2.16.
88. ^ Mirsky (1990), Theorem 1.4.1.
89. ^ Brown (1991), Theorem III.3.18.
90. ^ Eigen means "own" in German and in Dutch. See Wiktionary.
91. ^ Brown (1991), Definition III.4.1.
92. ^ Brown (1991), Definition III.4.9.
93. ^ Brown (1991), Corollary III.4.10.
94. ^ Anton (2010), pp. 317–319.
95. ^ Bernstein (2009), p. 265.
96. ^ Householder (1975), Ch. 7.
97. ^ Bau III & Trefethen (1997).
98. ^ Golub & Van Loan (1996), Algorithm 1.3.1.
99. ^ Vassilevska Williams et al. (2024).
100. ^ Misra, Bhattacharya & Ghosh (2022).
101. ^ Golub & Van Loan (1996), Chapters 9 and 10, esp. section 10.2.
102. ^ Golub & Van Loan (1996), Chapter 2.3.
103. ^ Press et al. (1992).
104. ^ Stoer & Bulirsch (2002), Section 4.1.
105. ^ Gbur (2011), pp. 146–153.
106. ^ Horn & Johnson (1985), Theorem 2.5.4.
107. ^ Horn & Johnson (1985), Ch. 3.1, 3.2.
108. ^ Arnold (1992), Sections 14.5, 7, 8.
109. ^ Bronson (1989), Ch. 15.
110. ^ Coburn (1955), Ch. V.
111. ^ Tapp (2016).
112. ^ Lam (1999), pp. 461–470, Chapter 7, §17 Matrix Rings, §17A Characterization and Examples.
113. ^ Hachenberger & Jungnickel (2020), p. 302, Definition 7.2.1.
114. ^ Ydri (2016).
115. ^ Riehl (2016), pp. 4-6.
116. ^ Roth (2006), p. 27.
117. ^ Chahal (2018), pp. 115–116.
118. ^ Meckes & Meckes (2018), pp. 360–361.
119. ^ Edwards (2004), p. 80.
120. ^ Lang (2002), p. 643, XVII.1.
121. ^ Lang (2002), Proposition XIII.4.16.
122. ^ Reichl (2004), Section L.2.
123. ^ Jeffrey (2010), pp. 54ff, 3.7 Partitioning of matrices.
124. ^ Greub (1975), Section III.3.
125. ^ Greub (1975), Section III.3.13.
126. ^ Perrone (2024), pp. 99–100.
127. ^ Hungerford (1980), pp. 328–335, VII.1: Matrices and maps.
128. ^ Horn & Johnson (1985), p. 69.
129. ^ Additionally, the group must be closed in the general linear group.
130. ^ Baker (2003), Def. 1.30.
131. ^ Cameron (2014).
132. ^ Baker (2003), Theorem 1.2.
133. ^ Artin (1991), Chapter 4.5.
134. ^ Serre (2007), p. 20.
135. ^ Rowen (2008), p. 198, Example 19.2.
136. ^ See any reference in representation theory or group representation.
137. ^ See the item "Matrix" in Itô 1987.
138. ^ Boos (2000), pp. 34–39, 2.2 Dealing with infinite matrices.
139. ^ Grillet (2007), p. 334.
140. ^ "Not much of matrix theory carries over to infinite-dimensional spaces, and what does is not so useful, but it sometimes helps." Halmos 1982, p. 23, Chapter 5.
141. ^ "Empty Matrix: A matrix is empty if either its row or column dimension is zero", Glossary Archived 2009-04-29 at the Wayback Machine, O-Matrix v6 User Guide
142. ^ Coleman & Van Loan (1988), p. 213.
143. ^ Hazewinkel & Gubareni (2017), p. 151.
144. ^ The notation of empty matrix is used differently from some sources like Bernstein (2009), p. 90 use  0 0 × n {\displaystyle 0_{0\times n}} , resembling the zero matrix; Hazewinkel & Gubareni (2017), p. 151 use  I 0 × n {\displaystyle {\mathfrak {I}}_{0\times n}} .
145. ^ West (2020), p. 750.
146. ^ Brualdi et al. (2018), p. 19.
147. ^ a b Farid, Khan & Wang (2013), 2087.
148. ^ Reutenauer & Straubing (1984), 351.
149. ^ Ghosh (1996), 222.
150. ^ a b Carboni, Kasangian & Walters (1987), 137.
151. ^ Manning & Schütze (1999), Section 15.3.4.
152. ^ Ward (1997), Ch. 2.8.
153. ^ Abłamowicz (2000), p. 436.
154. ^ Fudenberg & Tirole (1983), Section 1.1.1.
155. ^ McHugh (2025), p. 390, 11.2.3 The expected payoff as a vector–matrix–vector product.
156. ^ Matoušek & Gärtner (2007), pp. 136–137.
157. ^ Stinson (2005), Ch. 1.1.5 and 1.2.4.
158. ^ ISRD Group (2005), Ch. 7.
159. ^ Bhaya & Kaszkurewicz (2006), p. 230.
160. ^ Jensen (1999), p. 65–69.
161. ^ Godsil & Royle (2004), Ch. 8.1.
162. ^ Punnen & Gutin (2002).
163. ^ Zhang, Yu & Hou (2006), p. 7.
164. ^ Scott & Tůma (2023).
165. ^ Lang (1987), Ch. XVI.6.
166. ^ Nocedal & Wright (2006), Ch. 16.
167. ^ Lang (1987), Ch. XVI.1.
168. ^ Lang 1987, Ch. XVI.5. For a more advanced, and more general statement see Lang 1969, Ch. VI.2.
169. ^ Gilbarg & Trudinger (2001).
170. ^ Šolin 2005, Ch. 2.5. See also stiffness method.
171. ^ Latouche & Ramaswami (1999).
172. ^ Mehata & Srinivasan (1978), Ch. 2.8.
173. ^ Healy, Michael (1986), Matrices for Statistics, Oxford University Press, ISBN 978-0-19-850702-4
174. ^ Krzanowski (1988), p. 60, Ch. 2.2.
175. ^ Krzanowski (1988), Ch. 4.1.
176. ^ Conrey 2007
177. ^ Zabrodin, Brézin & Kazakov et al. 2006
178. ^ Schiff (1968), Ch. 6.
179. ^ Peres (1993), p. 20.
180. ^ Bohm (2001), sections I.8, II.4, and II.8.
181. ^ Peres (1993), p. 73.
182. ^ Itzykson & Zuber (1980), Ch. 2.
183. ^ Burgess & Moore (2007), section 1.6.3. (SU(3)), section 2.4.3.2. (Kobayashi–Maskawa matrix).
184. ^ Weinberg (1995), Ch. 3.
185. ^ Wherrett (1987), part II.
186. ^ Riley, Hobson & Bence (1997), 7.17.
187. ^ Guenther (1990), Ch. 5.
188. ^ Suresh Kumar (2009), pp. 747–749.
189. ^ Shen, Crossley & Lun 1999 cited by Bretscher 2005, p. 1
190. ^ a b c d e Dossey (2002), pp. 564–565.
191. ^ Needham, Joseph; Wang Ling (1959), Science and Civilisation in China, vol. III, Cambridge: Cambridge University Press, p. 117, ISBN 978-0-521-05801-8`{{cite book}}`: CS1 maint: ignored ISBN errors (link)
192. ^ Dossey (2002), p. 564.
193. ^ Cramer (1750).
194. ^ Kosinski (2001).
195. ^ "matrix", Merriam-Webster dictionary, Merriam-Webster, retrieved April 20, 2009
196. ^ Although many sources state that J. J. Sylvester coined the mathematical term "matrix" in 1848, Sylvester published nothing in 1848. (For proof that Sylvester published nothing in 1848, see Sylvester (1904, vol. 1). His earliest use of the term "matrix" occurs in 1850 in J. J. Sylvester (1850) "Additions to the articles in the September number of this journal, "On a new class of theorems," and on Pascal's theorem," The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 37: 363-370. From page 369: "For this purpose, we must commence, not with a square, but with an oblong arrangement of terms consisting, suppose, of m lines and n columns. This does not in itself represent a determinant, but is, as it were, a Matrix out of which we may form various systems of determinants ... "
197. ^ Sylvester (1904), p. 247, Paper 37.
198. ^ Cayley (1858).
199. ^ Dieudonné (1978), Vol. 1, Ch. III, p. 96.
200. ^ a b Knobloch (1994).
201. ^ Hawkins (1975).
202. ^ Kronecker 1897
203. ^ Weierstrass 1915, pp. 271–286
204. ^ & Miller (1930).
205. ^ Bôcher (2004).
206. ^ Hawkins (1972).
207. ^ van der Waerden (2007), pp. 28–40.
208. ^ Peres (1993), pp. 79, 106–107.
209. ^ Whitehead, Alfred North; and Russell, Bertrand (1913) Principia Mathematica to *56, Cambridge at the University Press, Cambridge UK (republished 1962) cf page 162ff.
210. ^ Tarski (1941), p. 40.

## References

[edit]

### Mathematical references

[edit]

* Andrilli, Stephen; Hecker, David (2022), Elementary Linear Algebra (6th ed.), Academic Press, ISBN 9780323984263
* Anton, Howard (2010), Elementary Linear Algebra (10th ed.), John Wiley & Sons, p. 414, ISBN 978-0-470-45821-1
* Arnold, Vladimir I. (1992), Ordinary differential equations, translated by Cooke, Roger, Berlin, DE; New York, NY: Springer-Verlag, ISBN 978-3-540-54813-3
* Artin, Michael (1991), Algebra, Prentice Hall, ISBN 978-0-89871-510-1
* Axler, Sheldon (1997), Linear Algebra Done Right, Undergraduate Texts in Mathematics (2nd ed.), Springer, ISBN 9780387982595
* Baker, Andrew J. (2003), Matrix Groups: An Introduction to Lie Group Theory, Berlin, DE; New York, NY: Springer-Verlag, ISBN 978-1-85233-470-3
* Bau III, David; Trefethen, Lloyd N. (1997), Numerical linear algebra, Philadelphia, PA: Society for Industrial and Applied Mathematics, ISBN 978-0-89871-361-9
* Ben-Israel, Adi; Greville, Thomas Nall Eden (2003), Generalized Inverses: Theory and Applications (2nd ed.), New York, NY: Springer, doi:10.1007/b97366, ISBN 978-0-387-00293-4
* Bernstein, Dennis S. (2009), Matrix mathematics: theory, facts, and formulas (2nd ed.), Princeton, N.J: Princeton University Press, ISBN 978-1-4008-3334-4
* Bhaya, Amit; Kaszkurewicz, Eugenius (2006), Control Perspectives on Numerical Algorithms and Matrix Problems, Advances in Design and Control, vol. 10, SIAM, ISBN 9780898716023
* Bierens, Herman J. (2004), Introduction to the Mathematical and Statistical Foundations of Econometrics, Cambridge University Press, ISBN 9780521542241
* Boos, Johann (2000), Classical and Modern Methods in Summability, Oxford mathematical monographs, Oxford University Press, ISBN 9780198501657
* Bretscher, Otto (2005), Linear Algebra with Applications (3rd ed.), Prentice Hall
* Bronson, Richard (1970), Matrix Methods: An Introduction, New York: Academic Press, LCCN 70097490
* Bronson, Richard (1989), Schaum's outline of theory and problems of matrix operations, New York: McGraw–Hill, ISBN 978-0-07-007978-6
* Brown, William C. (1991), Matrices and vector spaces, New York, NY: Marcel Dekker, ISBN 978-0-8247-8419-5
* Brualdi, Richard A.; Carmona, Ángeles; van den Driessche, P.; Kirkland, Stephen; Stevanović, Dragan (2018), Encinas, Andrés M.; Mitjana, Margarida (eds.), Combinatorial Matrix Theory, Advanced Courses in Mathematics. CRM Barcelona, Birkhäuser/Springer, Cham, doi:10.1007/978-3-319-70953-6, ISBN 978-3-319-70952-9, MR 3791450
* Cameron, Peter J. (2014), "Matrix groups" (PDF), in Hogben, Leslie (ed.), Handbook of Linear Algebra, Discrete Mathematics and its Applications (Boca Raton) (2nd ed.), CRC Press, Boca Raton, FL, ISBN 978-1-4665-0728-9, MR 3013937
* Carboni, Aurelio; Kasangian, Stefano; Walters, Robert (1987), "An axiomatics for bicategories of modules", Journal of Pure and Applied Algebra, 45 (2): 127–141, doi:10.1016/0022-4049(87)90065-X, ISSN 0022-4049, MR 0889588, Zbl 0615.18006
* Chahal, J. S. (2018), Fundamentals of Linear Algebra, CRC Press, ISBN 9780429758119
* Coburn, Nathaniel (1955), Vector and tensor analysis, New York, NY: Macmillan, OCLC 1029828
* Coleman, Thomas F.; Van Loan, Charles (1988), Handbook for Matrix Computations, Frontiers in Applied Mathematics, vol. 4, SIAM, ISBN 9780898712278
* Conrey, J. Brian (2007), Ranks of elliptic curves and random matrix theory, Cambridge University Press, ISBN 978-0-521-69964-8
* Dossey, John A. (2002), Discrete Mathematics (4th ed.), Addison Wesley, ISBN 9780321079121
* Conway, John B. (1990), A Course in Functional Analysis, Graduate Texts in Mathematics, vol. 96 (2nd ed.), Springer, ISBN 0-387-97245-5
* Edwards, Harold M. (2004), Linear Algebra, Springer Science & Business Media, ISBN 9780817643706
* Farid, F. O.; Khan, Israr Ali; Wang, Qing-Wen (2013), "On matrices over an arbitrary semiring and their generalized inverses", Linear Algebra and its Applications, 439 (7): 2085–2105, doi:10.1016/j.laa.2013.06.002, ISSN 0024-3795, MR 3090456, Zbl 1283.15016
* Fraleigh, John B. (1976), A First Course In Abstract Algebra (2nd ed.), Reading: Addison-Wesley, ISBN 0-201-01984-1
* Fudenberg, Drew; Tirole, Jean (1983), Game Theory, MIT Press
* Gentle, James E. (1998), Numerical Linear Algebra for Applications in Statistics, Springer, ISBN 9780387985428
* Ghosh, Shamik (1996), "Matrices over semirings", Information Sciences, 90 (1–4): 221–230, doi:10.1016/0020-0255(95)00283-9, ISSN 0020-0255, MR 1388422, Zbl 0884.150101–4&rft.pages=221-230&rft.date=1996&rft_id=https://zbmath.org/?format=complete&q;=an:0884.15010#id-name=Zbl&rft_id=https://mathscinet.ams.org/mathscinet-getitem?mr=1388422#id-name=MR&rft.issn=0020-0255&rft_id=info:doi/10.1016/0020-0255(95)00283-9&rft.aulast=Ghosh&rft.aufirst=Shamik&rfr_id=info:sid/en.wikipedia.org:Matrix+(mathematics)" class="Z3988">
* Gilbarg, David; Trudinger, Neil S. (2001), Elliptic partial differential equations of second order (2nd ed.), Berlin, DE; New York, NY: Springer-Verlag, ISBN 978-3-540-41160-4
* Godsil, Chris; Royle, Gordon (2004), Algebraic Graph Theory, Graduate Texts in Mathematics, vol. 207, Berlin, DE; New York, NY: Springer-Verlag, ISBN 978-0-387-95220-8
* Golub, Gene H.; Van Loan, Charles F. (1996), Matrix Computations (3rd ed.), Johns Hopkins, ISBN 978-0-8018-5414-9
* Greub, Werner Hildbert (1975), Linear algebra, Graduate Texts in Mathematics, Berlin, DE; New York, NY: Springer-Verlag, ISBN 978-0-387-90110-7
* Grillet, Pierre Antoine (2007), Abstract Algebra, Graduate Texts in Mathematics, vol. 242 (2nd ed.), Springer, ISBN 9780387715681
* Hachenberger, Dirk; Jungnickel, Dieter (2020), Topics in Galois Fields, Algorithms and Computation in Mathematics, vol. 29, Cham: Springer, doi:10.1007/978-3-030-60806-4, ISBN 978-3-030-60804-0, MR 4233161
* Halmos, Paul Richard (1982), A Hilbert space problem book, Graduate Texts in Mathematics, vol. 19 (2nd ed.), Berlin, DE; New York, NY: Springer-Verlag, ISBN 978-0-387-90685-0, MR 0675952
* Grossman, Stanley I. (1994), Elementary Linear Algebra (5th ed.), Saunders College Pub., ISBN 9780030973543
* Hamilton, A. G. (1987), A First Course in Linear Algebra: With Concurrent Examples, Cambridge University Press, ISBN 9780521310413
* Hazewinkel, Michiel; Gubareni, Nadiya M. (2017), Algebras, Rings and Modules, Volume 2: Non-commutative Algebras and Rings (2nd ed.), CRC Press}
* Horn, Roger A.; Johnson, Charles R. (1985), Matrix Analysis, Cambridge University Press, ISBN 978-0-521-38632-6
* Householder, Alston S. (1975), The theory of matrices in numerical analysis, New York, NY: Dover Publications, MR 0378371
* Hungerford, Thomas W. (1980), Algebra, Graduate Texts in Mathematics, vol. 73, Springer-Verlag, New York-Berlin, ISBN 0-387-90518-9, MR 0600654
* ISRD Group (2005), Computer Graphics, Tata McGraw–Hill, ISBN 978-0-07-059376-3
* Itô, Kiyosi, ed. (1987), Encyclopedic dictionary of mathematics. Vol. I-IV (2nd ed.), MIT Press, ISBN 978-0-262-09026-1, MR 0901762
* Jeffrey, Alan (2010), Matrix Operations for Engineers and Scientists: An Essential Guide in Linear Algebra, Springer, ISBN 9789048192748
* Johnston, Nathaniel (2021), Introduction to Linear and Matrix Algebra, Springer Nature, ISBN 9783030528119
* Kreyszig, Erwin (1972), Advanced Engineering Mathematics (3rd ed.), New York: Wiley, ISBN 0-471-50728-8.
* Krzanowski, Wojtek J. (1988), Principles of multivariate analysis, Oxford Statistical Science Series, vol. 3, The Clarendon Press Oxford University Press, ISBN 978-0-19-852211-9, MR 0969370
* Lam, T. Y. (1999), Lectures on Modules and Rings, Graduate Texts in Mathematics, vol. 189, Springer-Verlag, New York, doi:10.1007/978-1-4612-0525-8, ISBN 0-387-98428-3, MR 1653294
* Lancaster, Peter; Tismenetsky, Miron (1985), The Theory of Matrices: With Applications (2nd ed.), Elsevier, ISBN 9780080519081
* Lang, Serge (1969), Analysis II, Addison-Wesley
* Lang, Serge (1986), Introduction to Linear Algebra (2nd ed.), Springer, ISBN 9781461210702
* Lang, Serge (1987), Calculus of several variables (3rd ed.), Berlin, DE; New York, NY: Springer-Verlag, ISBN 978-0-387-96405-8
* Lang, Serge (2002), Algebra, Graduate Texts in Mathematics, vol. 211 (Revised third ed.), New York: Springer-Verlag, ISBN 978-0-387-95385-4, MR 1878556
* Latouche, Guy; Ramaswami, Vaidyanathan (1999), Introduction to matrix analytic methods in stochastic modeling (1st ed.), Philadelphia, PA: Society for Industrial and Applied Mathematics, ISBN 978-0-89871-425-8
* Manning, Christopher D.; Schütze, Hinrich (1999), Foundations of statistical natural language processing, MIT Press, ISBN 978-0-262-13360-9
* Margalit, Dan; Rabinoff, Joseph (2019), "Determinants and Volumes", Interactive Linear Algebra, Georgia Institute of Technology, retrieved 2025-05-10
* Matoušek, Jiří; Gärtner, Bernd (2007), Understanding and Using Linear Programming, Springer Science & Business Media, ISBN 9783540307174
* Maxwell, E. A. (1969), Algebraic Structure and Matrices, Being Part II of Advanced Algebra, Cambridge University Press
* McHugh, Andrew (2025), Finite Mathematics: An Introduction with Applications in Business, Social Sciences, and Music, Academic Press, ISBN 9780443290954
* Meckes, Elizabeth S.; Meckes, Mark W. (2018), Linear Algebra, Cambridge University Press, ISBN 9781316836026
* Mehata, K. M.; Srinivasan, S. K. (1978), Stochastic processes, New York, NY: McGraw–Hill, ISBN 978-0-07-096612-3
* Mello, David C. (2017), Invitation to Linear Algebra, Textbooks in Mathematics, CRC Press, ISBN 9781498779586
* Mirsky, Leonid (1990), An Introduction to Linear Algebra, Courier Dover Publications, ISBN 978-0-486-66434-7
* Misra, Chandan; Bhattacharya, Sourangshu; Ghosh, Soumya K. (June 2022), "Stark: Fast and scalable Strassen's matrix multiplication using Apache Spark", IEEE Transactions on Big Data, 8 (3): 699–710, arXiv:1811.07325, doi:10.1109/tbdata.2020.2977326
* Nering, Evar D. (1970), Linear Algebra and Matrix Theory (2nd ed.), New York: Wiley, LCCN 76-91646
* Nocedal, Jorge; Wright, Stephen J. (2006), Numerical Optimization (2nd ed.), Berlin, DE; New York, NY: Springer-Verlag, p. 449, ISBN 978-0-387-30303-1
* Oualline, Steve (2003), Practical C++ programming, O'Reilly, ISBN 978-0-596-00419-4
* Perrone, Paolo (2024), Starting Category Theory, World Scientific, doi:10.1142/9789811286018_0005, ISBN 978-981-12-8600-1
* Pettofrezzo, Anthony J. (1978), Matrices and Transformations, Dover Books on Mathematics, Courier Corporation, ISBN 9780486636344
* Perlis, Sam (1991), Theory of Matrices, Dover books on advanced mathematics, Courier Dover Corporation, p. 103, ISBN 978-0-486-66810-9
* Pop; Furdui (2017), Square Matrices of Order 2, Springer International Publishing, ISBN 978-3-319-54938-5
* Press, William H.; Flannery, Brian P.; Teukolsky, Saul A.; Vetterling, William T. (1992), "LU Decomposition and Its Applications" (PDF), Numerical Recipes in FORTRAN: The Art of Scientific Computing (2nd ed.), Cambridge University Press, pp. 34–42, archived from the original on 2009-09-06
* Protter, Murray H.; Morrey, Charles B. Jr. (1970), College Calculus with Analytic Geometry (2nd ed.), Reading: Addison-Wesley, LCCN 76087042
* Punnen, Abraham P.; Gutin, Gregory (2002), The traveling salesman problem and its variations, Boston, MA: Kluwer Academic Publishers, ISBN 978-1-4020-0664-7
* Ramachandra Rao, A.; Bhimasankaram, P. (2000), Linear Algebra, Texts and Readings in Mathematics, vol. 19 (2nd ed.), Springer, ISBN 9789386279019
* Reutenauer, Christophe; Straubing, Howard (1984), "Inversion of matrices over a commutative semiring", Journal of Algebra, 88 (2): 350–360, doi:10.1016/0021-8693(84)90070-X, ISSN 0021-8693, MR 0747520, Zbl 0563.15011
* Reyes, Manuel (2025), "A tour of noncommutative spectral theories", Notices of the American Mathematical Society, 72 (2): 145–153, arXiv:2409.08421, doi:10.1090/noti3100, MR 4854325
* Riehl, Emily (2016), Category Theory in Context, Dover, ISBN 9780486809038
* Roth, Ron (2006), Introduction to Coding Theory, Cambridge University Press, ISBN 9780521845045
* Rowen, Louis Halle (2008), Graduate Algebra: noncommutative view, Providence, RI: American Mathematical Society, ISBN 978-0-8218-4153-2
* Schneider, Hans; Barker, George Phillip (2012), Matrices and Linear Algebra, Dover Books on Mathematics, Courier Dover Corporation, p. 251, ISBN 978-0-486-13930-2
* Scott, J.; Tůma, M. (2023), "Sparse Matrices and Their Graphs", Algorithms for Sparse Linear Systems, Nečas Center Series, Cham: Birkhäuser, pp. 19–30, doi:10.1007/978-3-031-25820-6_2, ISBN 978-3-031-25819-0
* Serre, Denis (2007), Matrices: Theory and Applications, Graduate Texts in Mathematics, vol. 216, Springer Science & Business Media, doi:10.1007/978-1-4419-7683-3, ISBN 9780387227580
* Šolin, Pavel (2005), Partial Differential Equations and the Finite Element Method, Wiley-Interscience, ISBN 978-0-471-76409-0
* Stinson, Douglas R. (2005), Cryptography, Discrete Mathematics and its Applications, Chapman & Hall/CRC, ISBN 978-1-58488-508-5
* Stoer, Josef; Bulirsch, Roland (2002), Introduction to Numerical Analysis (3rd ed.), Berlin, DE; New York, NY: Springer-Verlag, ISBN 978-0-387-95452-3
* Suresh Kumar, K. S. (2009), Electric Circuits and Networks, Dorling Kindersley, ISBN 978-81-317-1390-7
* Tang, K. T. (2006), Mathematical Methods for Engineers and Scientists 1: Complex Analysis, Determinants and Matrices, Springer, ISBN 978-3-540-30273-5
* Tapp, Kristopher (2016), Matrix Groups for Undergraduates, Student Mathematical Library, vol. 79 (2nd ed.), Providence, Rhode Island: American Mathematical Society, doi:10.1090/stml/079, ISBN 978-1-4704-2722-1, MR 3468869
* Van Loan, Charles F. (2000), "The ubiquitous Kronecker product", Journal of Computational and Applied Mathematics, 123 (1–2): 85–100, Bibcode:2000JCoAM.123...85L, doi:10.1016/S0377-0427(00)00393-9, MR 17985201–2&rft.pages=85-100&rft.date=2000&rft_id=https://mathscinet.ams.org/mathscinet-getitem?mr=1798520#id-name=MR&rft_id=info:doi/10.1016/S0377-0427(00)00393-9&rft_id=info:bibcode/2000JCoAM.123...85L&rft.aulast=Van+Loan&rft.aufirst=Charles+F.&rfr_id=info:sid/en.wikipedia.org:Matrix+(mathematics)" class="Z3988">
* Vassilevska Williams, Virginia; Xu, Yinzhan; Xu, Zixuan; Zhou, Renfei (2024), "New bounds for matrix multiplication: from alpha to omega", Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 3792–3835, arXiv:2307.07970, doi:10.1137/1.9781611977912.134, ISBN 978-1-61197-791-2
* Ward, J. P. (1997), Quaternions and Cayley numbers, Mathematics and its Applications, vol. 403, Dordrecht, NL: Kluwer Academic Publishers Group, doi:10.1007/978-94-011-5768-1, ISBN 978-0-7923-4513-8, MR 1458894
* Watkins, David S. (2002), Fundamentals of Matrix Computations, John Wiley & Sons, ISBN 978-0-471-46167-8
* West, Douglas B. (2020), Combinatorial Mathematics, Cambridge University Press, ISBN 9781108889520
* Whitelaw, T. A. (1991), Introduction to Linear Algebra (2nd ed.), CRC Press, p. 29, ISBN 9780751401592
* Zhang, Yanchun; Yu, Jeffrey Xu; Hou, Jingyu (2006), Web Communities: Analysis and Construction, Springer, ISBN 978-3-540-27737-8

### Physics references

[edit]

* Abłamowicz, Rafał (2000), Clifford Algebras and their Applications in Mathematical Physics, Volume 1: Algebra and Physics, Progress in Mathematical Physics, vol. 18, Birkhäuser / Springer, ISBN 9780817641825
* Bauchau, O. A.; Craig, J. I. (2009), Structural Analysis: With Applications to Aerospace Structures, Solid Mechanics and Its Applications, vol. 163, Springer, ISBN 9789048125166
* Boas, Mary L. (2005), Mathematical Methods in the Physical Sciences (3rd ed.), John Wiley & Sons, ISBN 978-0-471-19826-0
* Bohm, Arno (2001), Quantum Mechanics: Foundations and Applications, Springer, ISBN 0-387-95330-2
* Burgess, Cliff; Moore, Guy (2007), The Standard Model. A Primer, Cambridge University Press, Bibcode:2007smp..book.....B, ISBN 978-0-521-86036-9
* Gbur, Greg (2011), Mathematical Methods in Optical Physics and Engineering, Cambridge University Press, Bibcode:2011mmop.book.....G, ISBN 978-0-521-51610-5
* Guenther, Robert D. (1990), Modern Optics, John Wiley, ISBN 0-471-60538-7
* Han, D.; Kim, Y. S.; Noz, Marilyn E. (September 1997), "Jones-matrix formalism as a representation of the Lorentz group", Journal of the Optical Society of America A, 14 (9), Optica Publishing Group: 2290, arXiv:physics/9703032, Bibcode:1997JOSAA..14.2290H, doi:10.1364/josaa.14.002290
* Itzykson, Claude; Zuber, Jean-Bernard (1980), Quantum Field Theory, McGraw–Hill, ISBN 0-07-032071-3
* Jensen, Frank (1999), Introduction to Computational Chemistry, John Wiley & Sons, ISBN 0-471-98085-4
* Peres, Asher (1993), Quantum Theory: Concepts and Methods, Kluwer, ISBN 978-0-7923-3632-7
* Reichl, Linda E. (2004), The transition to chaos: conservative classical systems and quantum manifestations, Berlin, DE; New York, NY: Springer-Verlag, ISBN 978-0-387-98788-0
* Riley, Kenneth F.; Hobson, Michael P.; Bence, Stephen J. (1997), Mathematical methods for physics and engineering, Cambridge University Press, ISBN 0-521-55506-X
* Schiff, Leonard I. (1968), Quantum Mechanics (3rd ed.), McGraw–Hill
* Weinberg, Steven (1995), The Quantum Theory of Fields. Volume I: Foundations, Cambridge University Press, ISBN 0-521-55001-7
* Wherrett, Brian S. (1987), Group Theory for Atoms, Molecules and Solids, Prentice–Hall International, ISBN 0-13-365461-3
* Ydri, Badis (2016), Lectures on Matrix Field Theory, Lecture Notes in Physics, vol. 929, Springer, ISBN 9783319460031
* Zabrodin, Anton; Brézin, Édouard; Kazakov, Vladimir; Serban, Didina; Wiegmann, Paul (2006), Applications of Random Matrices in Physics (NATO Science Series II: Mathematics, Physics and Chemistry), Berlin, DE; New York, NY: Springer-Verlag, ISBN 978-1-4020-4530-1

### Historical references

[edit]

* Bôcher, Maxime (2004), Introduction to Higher Algebra, New York, NY: Dover Publications, ISBN 978-0-486-49570-5, reprint of the 1907 original edition
* Cayley, Arthur (December 1858), "A memoir on the theory of matrices", Philosophical Transactions of the Royal Society of London, 148: 17–37, doi:10.1098/rstl.1858.0002, JSTOR 108649; reprinted in The collected mathematical papers of Arthur Cayley, vol. II, Cambridge University Press, 1889, pp. 475–496.
* Cayley, Arthur (1889), The collected mathematical papers of Arthur Cayley, vol. I (1841–1853), Cambridge University Press, pp. 123–126
* Cramer, Gabriel (1750), Introduction à l'Analyse des lignes Courbes algébriques (in French), Geneva: Europeana, pp. 656–659, retrieved 2012-05-18
* Dieudonné, Jean, ed. (1978), Abrégé d'histoire des mathématiques 1700-1900, Paris, FR: Hermann
* Hawkins, Thomas (1972), "Hypercomplex numbers, Lie groups, and the creation of group representation theory", Archive for History of Exact Sciences, 8 (4): 243–287, doi:10.1007/bf00328434
* Hawkins, Thomas (1975), "Cauchy and the spectral theory of matrices", Historia Mathematica, 2: 1–29, doi:10.1016/0315-0860(75)90032-4, ISSN 0315-0860, MR 0469635
* Knobloch, Eberhard (1994), "From Gauß to Weierstraß: determinant theory and its historical evaluations", in Sasaki, Chikara; Sugiura, Mitsuo; Dauben, Joseph W. (eds.), The Intersection of History and Mathematics, Science Networks: Historical Studies, vol. 15, Birkhäuser, pp. 51–66, doi:10.1007/978-3-0348-7521-9_5, ISBN 3-7643-5029-6, MR 1308079
* Kosinski, A. A. (2001), "Cramer's Rule is due to Cramer", Mathematics Magazine, 74 (4): 310–312, doi:10.2307/2691101, JSTOR 2691101
* Kronecker, Leopold (1897), Hensel, Kurt (ed.), Leopold Kronecker's Werke, Teubner
* Miller, G. A. (May 1930), "On the history of determinants", The American Mathematical Monthly, 37 (5): 216–219, doi:10.1080/00029890.1930.11987058, JSTOR 2299112
* Shen, Kangshen; Crossley, John N.; Lun, Anthony Wah-Cheung (1999), Nine Chapters of the Mathematical Art, Companion and Commentary (2nd ed.), Oxford University Press, ISBN 978-0-19-853936-0
* Sylvester, J. J. (1904), Baker, H. F. (ed.), The Collected Mathematical Papers of James Joseph Sylvester, Volume I (1837–1853), Cambridge, England: Cambridge University Press
* van der Waerden, B. L., ed. (2007) [1968], Sources of Quantum Mechanics, Dover, ISBN 978-0-486-45892-2
* Tarski, Alfred (1941), Introduction to Logic and the Methodology of Deductive Sciences, Oxford University Press, MR 0003375; reprint of 1946 corrected printing, Dover Publications, 1995, ISBN 0-486-28462-X
* Weierstrass, Karl (1915), Collected Works, vol. 3

## Further reading

[edit]

* "Matrix", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
* Petersen, Kaare Brandt; Petersen, Michael Syskind (November 15, 2012), The Matrix Cookbook (PDF), University of Waterloo, retrieved 24 March 2014
* Brookes, Mike (2005), The Matrix Reference Manual, London: Imperial College, archived from the original on 16 December 2008, retrieved 10 Dec 2008

## External links

[edit]

Matrix (mathematics) at Wikipedia's sister projects

* Definitions from Wiktionary
* Media from Commons
* Textbooks from Wikibooks
* Resources from Wikiversity
* Data from Wikidata

* O'Connor, J. J.; Robertson, E. F. (February 1996), "Matrices and determinants", MacTutor History of Mathematics Archive, University of St Andrews
* Matrices and Linear Algebra on the Earliest Uses Pages
* Earliest Uses of Symbols for Matrices and Vectors

* v
* t
* e

Linear algebra

* Outline
* Glossary

Basic concepts|

* Scalar
* Vector
* Vector space
* Scalar multiplication
* Vector projection
* Linear span
* Linear map
* Linear projection
* Linear independence
* Linear combination
* Multilinear map
* Basis
* Change of basis
* Row and column vectors
* Row and column spaces
* Kernel
* Eigenvalues and eigenvectors
* Transpose
* Linear equations

Matrices|

* Block
* Decomposition
* Invertible
* Minor
* Multiplication
* Rank
* Transformation
* Cramer's rule
* Gaussian elimination
* Productive matrix

Bilinear|

* Orthogonality
* Dot product
* Hadamard product
* Inner product space
* Outer product
* Kronecker product
* Gram–Schmidt process

Multilinear algebra|

* Determinant
* Cross product
* Triple product
* Seven-dimensional cross product
* Geometric algebra
* Exterior algebra
* Bivector
* Multivector
* Tensor
* Outermorphism

Vector space constructions|

* Dual
* Direct sum
* Function space
* Quotient
* Subspace
* Tensor product

Numerical|

* Floating-point
* Numerical stability
* Basic Linear Algebra Subprograms
* Sparse matrix
* Comparison of linear algebra libraries

* Category

* v
* t
* e

Tensors

Glossary of tensor theory

Scope|

| Mathematics|

* Coordinate system
* Differential geometry
* Dyadic algebra
* Euclidean geometry
* Exterior calculus
* Multilinear algebra
* Tensor algebra
* Tensor calculus

|

* Physics
* Engineering

* Computer vision
* Continuum mechanics
* Electromagnetism
* General relativity
* Transport phenomena

Notation|

* Abstract index notation
* Einstein notation
* Index notation
* Multi-index notation
* Penrose graphical notation
* Ricci calculus
* Tetrad (index notation)
* Van der Waerden notation
* Voigt notation

Tensor
definitions|

* Tensor (intrinsic definition)
* Tensor field
* Tensor density
* Tensors in curvilinear coordinates
* Mixed tensor
* Antisymmetric tensor
* Symmetric tensor
* Tensor operator
* Tensor bundle
* Two-point tensor

Operations|

* Covariant derivative
* Exterior covariant derivative
* Exterior derivative
* Exterior product
* Hodge star operator
* Lie derivative
* Raising and lowering indices
* Symmetrization
* Tensor contraction
* Tensor product
* Transpose (2nd-order tensors)

Related
abstractions|

* Affine connection
* Basis
* Cartan formalism (physics)
* Connection form
* Covariance and contravariance of vectors
* Differential form
* Dimension
* Exterior form
* Fiber bundle
* Geodesic
* Levi-Civita connection
* Linear map
* Manifold
* Matrix
* Multivector
* Pseudotensor
* Spinor
* Vector
* Vector space

Notable tensors|

| Mathematics|

* Kronecker delta
* Levi-Civita symbol
* Metric tensor
* Nonmetricity tensor
* Ricci curvature
* Riemann curvature tensor
* Torsion tensor
* Weyl tensor

|

Physics|

* Moment of inertia
* Angular momentum tensor
* Spin tensor
* Cauchy stress tensor
* stress–energy tensor
* Einstein tensor
* EM tensor
* Gluon field strength tensor
* Metric tensor (GR)

Mathematicians|

* Élie Cartan
* Augustin-Louis Cauchy
* Elwin Bruno Christoffel
* Albert Einstein
* Leonhard Euler
* Carl Friedrich Gauss
* Hermann Grassmann
* Tullio Levi-Civita
* Gregorio Ricci-Curbastro
* Bernhard Riemann
* Jan Arnoldus Schouten
* Woldemar Voigt
* Hermann Weyl

Authority control databases

National|

* Germany
* United States
* France
* BnF data
* Czech Republic
* Spain
* Latvia
* Israel

Other|

* Encyclopedia of Modern Ukraine

*[pl.]: plural
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template