Matrices — Study Notes

1. Introduction

A matrix is a rectangular arrangement of numbers (or functions) in rows and columns enclosed in square brackets. Matrices provide a compact and powerful notation for handling large collections of data and for solving systems of linear equations. The German mathematician Arthur Cayley is regarded as the father of matrix theory, and today matrices appear in physics, economics, computer graphics, engineering, and statistics.

This chapter introduces the notation of a matrix, the order (dimension) of a matrix, and the different types of matrices such as row, column, square, diagonal, scalar, identity, zero, and triangular matrices. It then develops matrix equality, the arithmetic of matrices including addition, scalar multiplication, and matrix multiplication, and the special properties and algebraic rules these operations obey. The chapter closes with the transpose of a matrix, symmetric and skew-symmetric matrices, and elementary row and column operations.

Matrices are important not merely as an abstract structure but as a computational tool. The operations developed here, especially matrix multiplication and the transpose, will be used in the next chapter on determinants, in solving linear equations by the matrix method, and in understanding the geometric transformations in three-dimensional geometry. A careful study of when matrix multiplication is defined, and why AB need not equal BA, is the single most important skill in this chapter.

2. Notation and Order of a Matrix

A matrix with m rows and n columns is said to be of order m x n (read as m by n). It is generally written as

$$A = [a_{ij}]_{m \times n}$$

where $a_{ij}$ denotes the entry in the i-th row and j-th column. The element $a_{ij}$ is located at the intersection of the i-th row and j-th column.

For example, the matrix $$A = \begin{bmatrix} 2 & 5 & -1 \ 3 & 0 & 4 \end{bmatrix}$$ is of order 2 x 3. Here $a_{11} = 2$, $a_{12} = 5$, $a_{13} = -1$, $a_{21} = 3$, $a_{22} = 0$, and $a_{23} = 4$.

A matrix is a rectangular array only; it is not a number, and its determinant (defined in the next chapter) exists only for square matrices.

3. Types of Matrices

• Row matrix: A matrix with exactly one row, of order 1 x n.
• Column matrix: A matrix with exactly one column, of order m x 1.
• Square matrix: A matrix with equal numbers of rows and columns, of order n x n. In a square matrix $[a_{ij}]$, the entries $a_{11}, a_{22}, \ldots, a_{nn}$ form the principal (main) diagonal.
• Diagonal matrix: A square matrix in which every non-diagonal entry is zero.
• Scalar matrix: A diagonal matrix in which all diagonal elements are equal to the same non-zero constant.
• Identity matrix: A diagonal matrix in which every diagonal element is 1. Denoted by $I_n$.
• Zero matrix: A matrix (of any order) in which every entry is zero.
• Upper triangular matrix: A square matrix in which all entries below the main diagonal are zero.
• Lower triangular matrix: A square matrix in which all entries above the main diagonal are zero.

4. Equality of Matrices

Two matrices A and B are equal if and only if they have the same order and $a_{ij} = b_{ij}$ for every corresponding pair of entries. Matrices of different orders can never be equal, no matter what their entries are.

5. Operations on Matrices

Addition

Two matrices A and B can be added only when they have the same order. Then $A + B = [a_{ij} + b_{ij}]$, adding corresponding entries.

Scalar Multiplication

If k is a scalar (number), then $kA = [ka_{ij}]$; every entry is multiplied by k. The negative of a matrix is $-A = [-a_{ij}]$, and subtraction is defined as $A - B = A + (-B)$.

Matrix Multiplication

Two matrices A and B can be multiplied as AB only if the number of columns of A equals the number of rows of B. If A is of order m x n and B is of order n x p, then AB is of order m x p, and

$$(AB){ij} = \sum$$}^{n} a_{ik} b_{kj

The entry in the i-th row and j-th column of AB is the dot product of the i-th row of A with the j-th column of B.

Properties of Matrix Operations

• Matrix addition is commutative and associative: $A + B = B + A$, $(A + B) + C = A + (B + C)$.
• Matrix multiplication is associative: $A(BC) = (AB)C$, whenever the products are defined.
• Matrix multiplication distributes over addition: $A(B + C) = AB + AC$ and $(A + B)C = AC + BC$.
• Matrix multiplication is generally NOT commutative: $AB \neq BA$ in general, even when both products are defined.
• $AI = IA = A$ for an identity matrix of the appropriate order.
• $A \cdot O = O$ and $O \cdot A = O$ for the zero matrix of appropriate order.

6. Transpose of a Matrix

If A is a matrix of order m x n, its transpose $A^T$ (or A') is the matrix of order n x m obtained by interchanging rows and columns: $(A^T){ij} = a$.

Properties of Transpose

$$(A + B)^T = A^T + B^T, \quad (kA)^T = kA^T, \quad (AB)^T = B^T A^T, \quad (A^T)^T = A$$

Note the reversal of order in the product rule for transpose: the transpose of a product is the product of the transposes in reverse order.

7. Symmetric and Skew-Symmetric Matrices

A square matrix A is symmetric if $A^T = A$, so that $a_{ij} = a_{ji}$ for all i, j. A square matrix A is skew-symmetric if $A^T = -A$, so that $a_{ij} = -a_{ji}$ for all i, j.

Key Properties

• The diagonal elements of a skew-symmetric matrix are always zero, since $a_{ii} = -a_{ii}$ forces $a_{ii} = 0$.
• For any square matrix A, the matrix $A + A^T$ is symmetric and $A - A^T$ is skew-symmetric.
• Every square matrix can be uniquely expressed as the sum of a symmetric and a skew-symmetric matrix: $$A = \frac{1}{2}(A + A^T) + \frac{1}{2}(A - A^T)$$

8. Elementary Operations on a Matrix

There are three types of elementary (row or column) operations: - Interchange any two rows (or columns): denoted $R_i \leftrightarrow R_j$. - Multiply all entries of a row (or column) by a non-zero scalar: $R_i \to kR_i$. - Add to one row a scalar multiple of another row: $R_i \to R_i + kR_j$.

These operations are the foundation of the matrix method of solving linear equations and of computing determinants and inverses, developed in later chapters.

Quick Revision Tables

Table 1: Types of Matrices

Table 2: When Operations Are Defined

Table 3: Algebraic Properties

Mind Map

Important Diagrams (SVG)

Diagram 1: Matrix Multiplication Compatibility and Entry Computation

Diagram 2: Symmetric and Skew-Symmetric Matrix Structure

Common Mistakes

1. Adding two matrices of different orders. Matrix addition is defined only when both matrices have identical dimensions.
2. Multiplying matrices when the inner dimensions do not match. For AB, the number of columns of A must equal the number of rows of B; otherwise the product does not exist.
3. Assuming AB = BA. Matrix multiplication is generally not commutative; even when both products are defined they usually differ.
4. Using (AB)^T = A^T B^T. The correct identity is (AB)^T = B^T A^T; the order reverses.
5. Forgetting the condition for symmetric or skew-symmetric matrices: the matrix must be square.
6. Writing the diagonal elements of a symmetric matrix as anything free; symmetric means aij = aji, which constrains entries across the diagonal.
7. Forgetting that the scalar in a scalar matrix multiplies every diagonal element and all off-diagonal entries remain zero.
8. Confusing the identity matrix with the scalar matrix. The identity matrix has diagonal entries exactly 1; a scalar matrix can have any constant on the diagonal.
9. In the equality of matrices, comparing only entries while ignoring the order; matrices of different order can never be equal.
10. Treating A - A^T as symmetric; it is skew-symmetric. A + A^T is symmetric and A - A^T is skew-symmetric.

Exam Tips

1. Always check the orders before performing addition or multiplication; write the orders explicitly in the solution to earn clarity marks.
2. To test if AB is defined, compare columns of A with rows of B; the answer matrix has order rows(A) x columns(B).
3. In one-mark questions, remember the zero matrix times any conformable matrix is the zero matrix, and the identity matrix leaves any conformable matrix unchanged.
4. To prove A is symmetric, show A^T = A by writing out A^T; to prove skew-symmetric, show A^T = -A and note the zero diagonal.
5. To express a matrix as sum of symmetric and skew-symmetric parts, compute (A + A^T)/2 and (A - A^T)/2 exactly as given by the formula.
6. For problems with matrix equations, equate corresponding entries, not just some of them, and solve the resulting linear system.
7. In MCQ questions on transpose, apply (AB)^T = B^T A^T and (A^T)^T = A, and check the order reversal carefully.
8. Practise the elementary row operations R_i <-> R_j, R_i -> kR_i, and R_i -> R_i + kR_j since they will reappear in determinants and in solving linear systems by the matrix method.

Conclusion

Matrices are one of the most widely applicable structures in mathematics because they encode tabular data and linear transformations in a single notational framework. This chapter's core content, the order of a matrix, its types, the operations of addition, scalar multiplication, and especially matrix multiplication, and the transpose with its reversal rule for products, provides the working vocabulary for the rest of the algebra sequence. The classification of square matrices as symmetric and skew-symmetric, and the decomposition of any square matrix into these two parts, is a result of real significance, as is the family of elementary operations that will power the computation of determinants and inverses. Because matrices unify many seemingly unrelated ideas, a thorough grasp of this chapter converts matrix methods into a favourite tool for the board examination and beyond.