Matrix Definition and Types
A matrix is a rectangular array of numbers, symbols, or expressions arranged in rows and columns. Matrices are one of the most powerful tools in mathematics, used to represent systems of linear equations, perform transformations in geometry, model networks, and solve real-world problems in physics, economics, and computer science. The study of matrices forms the foundation of linear algebra. Every matrix has an order (also called its dimensions or size), written as m × n, where m is the number of rows and n is the number of columns. The individual entries of a matrix are called elements, and the element in the i-th row and j-th column is denoted a_{ij}. For example, in a matrix A, the element a_{23} sits in the 2nd row and 3rd column. Matrices are typically named with capital letters and written inside square or round brackets. Matrices come in many special types — square, diagonal, identity, zero, symmetric, and more — each with unique properties that make them useful in different contexts. Two matrices are considered equal if and only if they have exactly the same order and every corresponding element is equal. Understanding these fundamental ideas about matrix definition, order, types, and equality is the essential first step into linear algebra.
- What Is a Matrix?
- Order (Size) of a Matrix
- Row Matrix and Column Matrix
- Square Matrix
- Zero (Null) Matrix
- Diagonal and Scalar Matrices
- Identity Matrix
- Upper and Lower Triangular Matrices
- Symmetric and Skew-Symmetric Matrices
- Equality of Matrices
What Is a Matrix?
A matrix is a rectangular arrangement of numbers (or variables) laid out in rows and columns, enclosed in brackets. For example, A = [[3, -1, 0], [2, 5, 7]] is a matrix with 2 rows and 3 columns. The numbers inside are called elements or entries. We write a general m × n matrix as A = [a_{ij}], where i ranges from 1 to m and j ranges from 1 to n.
Order (Size) of a Matrix
The order of a matrix is expressed as m × n (read 'm by n'), where m = number of rows and n = number of columns. A matrix with 3 rows and 4 columns has order 3 × 4 and contains 3 × 4 = 12 elements in total. Note: the row count always comes first. A matrix of order m × n has m·n elements. If m = n, the matrix is called a square matrix of order n.
Row Matrix and Column Matrix
A row matrix (or row vector) has exactly one row and any number of columns, so its order is 1 × n. Example: R = [4, -2, 9] has order 1 × 3. A column matrix (or column vector) has exactly one column and any number of rows, with order m × 1. Example: C = [[6], [0], [-3]] has order 3 × 1. These are building blocks for describing vectors in linear algebra.
Square Matrix
A square matrix has the same number of rows and columns (m = n). The elements a_{11}, a_{22}, a_{33}, ..., a_{nn} form the main (principal) diagonal. For instance, A = [[1, 2], [3, 4]] is a 2 × 2 square matrix. Square matrices are the only type for which operations like determinant and inverse are defined.
Zero (Null) Matrix
A zero matrix (denoted O or 0) is a matrix in which every element equals zero. It plays the role of the additive identity in matrix addition: A + O = A for any matrix A of the same order. A zero matrix can be of any order, such as the 2 × 3 zero matrix: O = [[0,0,0],[0,0,0]].
Diagonal and Scalar Matrices
A diagonal matrix is a square matrix where all elements outside the main diagonal are zero. Example: D = [[5, 0, 0],[0, -2, 0],[0, 0, 8]]. A scalar matrix is a special diagonal matrix in which all diagonal elements are equal: D = k·I for some scalar k. These matrices simplify many computations because their eigenvalues are simply the diagonal entries.
Identity Matrix
The identity matrix I_n is a diagonal matrix of order n × n with every diagonal element equal to 1 and every off-diagonal element equal to 0. It satisfies A · I = I · A = A for any compatible square matrix A, making it the multiplicative identity. The 3 × 3 identity is I_3 = [[1,0,0],[0,1,0],[0,0,1]].
Upper and Lower Triangular Matrices
An upper triangular matrix has all entries below the main diagonal equal to zero: a_{ij} = 0 whenever i > j. A lower triangular matrix has all entries above the main diagonal equal to zero: a_{ij} = 0 whenever i < j. These appear naturally in Gaussian elimination and LU decomposition when solving linear systems.
Symmetric and Skew-Symmetric Matrices
A square matrix A is symmetric if A = A^T, meaning a_{ij} = a_{ji} for all i, j (the matrix equals its own transpose). Example: [[1, 3],[3, 7]] is symmetric. A skew-symmetric (antisymmetric) matrix satisfies A^T = -A, so a_{ij} = -a_{ji} and all diagonal entries must be 0. These arise frequently in physics (e.g., angular velocity tensors).
Equality of Matrices
Two matrices A and B are equal (written A = B) if and only if: (1) they have the same order (both are m × n), and (2) every corresponding element is equal — a_{ij} = b_{ij} for all valid i and j. For example, if A = [[x, 2],[3, y]] equals B = [[4, 2],[3, -1]], then we must have x = 4 and y = -1. You cannot call matrices equal if their sizes differ, even if the numbers inside match a subset.
The Key Equation
- A — Matrix (dimensionless): The entire rectangular array, named with a capital letter.
- a_{ij} — Element (dimensionless): The entry in row i and column j of matrix A; i is the row index (1 to m) and j is the column index (1 to n).
- m — Number of rows (positive integer): Total count of horizontal rows in the matrix.
- n — Number of columns (positive integer): Total count of vertical columns in the matrix.
- m \times n — Order (size) (dimensionless): The dimensions of the matrix; always stated as rows × columns.
Worked Example
Problem. Given matrices A = [[2, x-1, 4],[3, 0, y+2]] and B = [[2, 5, 4],[3, 0, 9]], find x and y such that A = B. Also state the order of each matrix and identify what type of matrix B is.
Answer. x = 6, y = 7. Both matrices have order 2 × 3. Matrix B is a rectangular (non-square) matrix.
Origins · 1 minArthur Cayley and how this was discovered
Arthur Cayley was the first mathematician to formally define and publish a theory of matrices. In his landmark 1858 paper 'A Memoir on the Theory of Matrices,' he introduced matrix multiplication, the identity matrix, the inverse matrix, and proved the Cayley–Hamilton theorem, which states that every square matrix satisfies its own characteristic equation. Before Cayley, matrices were used implicitly but had no formal algebraic theory. Cayley was a lawyer for 14 years while simultaneously publishing hundreds of mathematical papers. He only took a full-time academic post at Cambridge at age 42, after his legal career. During his lifetime he published over 900 mathematical papers — an astonishing output that fills 13 large volumes.
Related Concepts
- Matrix Addition and Scalar Multiplication — Once you understand what a matrix is and its order, the natural next step is learning how to add matrices of the same order and scale them by a scalar — the foundational arithmetic operations on matrices.
- Matrix Multiplication — Matrix multiplication requires understanding matrix order (specifically that an m×n matrix can only multiply an n×p matrix), making it a direct extension of the concepts of order and types introduced here.
- Transpose of a Matrix — The transpose operation swaps rows and columns, directly connecting to the definitions of symmetric and skew-symmetric matrices introduced in this concept.
- Determinant of a Matrix — Determinants are only defined for square matrices — one of the key matrix types discussed here — making this article an essential prerequisite.
- Systems of Linear Equations — Matrices were developed largely to represent and solve systems of linear equations. Understanding matrix order and types shows how a system with m equations and n unknowns maps to an m×n matrix.