Section 1: Systems and Matrices - 3: Matrix Operations
Matrix operations extend arithmetic to arrays of numbers, forming the computational backbone of linear algebra. Understanding these rules is essential for solving linear systems and beyond.
Addition and Subtraction: Matrices must be the same size (m rows × n columns). Add or subtract corresponding elements. For matrices A and B:
A+B=[aij+bij]
A−B=[aij−bij]
Properties include commutativity (A+B=B+A) and associativity (A+(B+C)=(A+B)+C).
Scalar Multiplication: Multiply every element of a matrix by a scalar (real number) c:
cA=[c⋅aij]
Scalars distribute over matrix addition: c(A+B)=cA+cB.
Matrix Multiplication: The product AB is defined only if A is m×n and B is n×p (columns of A = rows of B). The result is an m×p matrix. The element in row i, column j of AB is computed by taking the dot product of row i of A and column j of B:
(AB)ij=k=1∑naikbkj(sum from k=1 to n)
Key properties:
- Associative: (AB)C=A(BC)
- Distributive: A(B+C)=AB+AC and (A+B)C=AC+BC
- NOT Commutative: AB=BA in general (even if both products exist).
- Identity Matrix: The n×n identity matrix In (1s on diagonal, 0s elsewhere) acts like 1: AI=A and IA=A for compatible A.
Transpose: The transpose of an m×n matrix A, denoted A⊤, is the n×m matrix formed by swapping rows and columns: (A⊤)ij=aji. Properties include:
(A⊤)⊤=A
(A+B)⊤=A⊤+B⊤
(cA)⊤=cA⊤
(AB)⊤=B⊤A⊤(note the order reversal!)
Critical Considerations:
- Dimension Mismatch: Attempting addition/subtraction on different-sized matrices or multiplication where columns of first = rows of second is undefined.
- Zero Matrix: The matrix 0 (all zeros) acts as the additive identity: A+0=A.