Linear Algebra 11 | Matrices

Matrices enter linear algebra as the tool for solving systems of linear equations—problems that can involve many equations at once. A matrix is fundamentally a rectangular array (a two-dimensional table) of numbers. Its layout is determined by two natural numbers: m rows and n columns. That means the matrix contains m × n entries, typically written as a_{ij}, where i identifies the row and j identifies the column. The bottom-right entry is a_{mn}, and the table need not be square; it can be any m-by-n rectangle.

With that structure in place, the set of all m-by-n matrices with real entries is denoted by R^{m×n}. The “m×n” part signals the fixed shape of the rectangle, while the entries come from the real numbers. The transcript then builds the basic operations needed to treat matrices like vectors: addition and scalar multiplication. Addition is only defined when the two matrices have the same shape. For matrices A and B of size m-by-n, their sum C = A + B is formed entry-by-entry: each entry c_{ij} equals a_{ij} + b_{ij}. A quick example with 2-by-2 matrices shows how the rule works in practice, producing another 2-by-2 matrix.

Scalar multiplication takes a matrix A and a real number λ and produces a new matrix λA of the same shape. Again, the operation is entry-wise: each entry becomes λ·a_{ij}. The key point is that both operations preserve the matrix’s dimensions—so the result stays within the same space R^{m×n}.

These definitions are not just formalities; they make matrices behave like a vector space. Under addition, matrices form an abelian group: addition is associative and commutative, there is a zero matrix (the additive identity) with all entries equal to 0, and every matrix has an additive inverse obtained by negating each entry. Scalar multiplication is compatible with multiplication of scalars, and distributive laws connect scalar multiplication with matrix addition. Because these standard vector-space properties carry over entry-by-entry from real-number arithmetic, matrices can be manipulated using the same kinds of algebraic rules used for vectors.

The practical motivation is saved for later: once matrices can be added and scaled reliably, they become the language for systems of linear equations. The next step is to use matrices to organize those equations and compute solutions efficiently—turning a multi-equation problem into a structured algebraic one.