Matrices and Systems of Linear Equations

Advanced

Matrices arrange the coefficients of linear systems into tables: master addition, scalar multiplication, multiplication and determinants, solve systems of two and three linear equations by inverse matrices, Cramer's rule or Gaussian elimination, and read the existence of solutions from whether the determinant is zero.

For:Secondary 6 Mathematics Extended Part · Unit:Algebra and Calculus (M2) · Lesson 2 of 6 in the learning path

After this lesson, you can:
  • Matrix multiplication pairs rows with columns and never commutes; AB is defined when A's columns equal B's rows.
  • The determinant decides invertibility: det A = 0 means singular and no inverse; the order-two inverse swaps the main diagonal, negates the anti-diagonal, divides by det.
  • Know the inverse properties: (A⁻¹)⁻¹ = A, (AB)⁻¹ = B⁻¹A⁻¹, (Aᵀ)⁻¹ = (A⁻¹)ᵀ; check the determinant before inverting.
文體:數學概念說明文有聲朗讀

文體小知識:數學概念說明文——由矩陣運算與行列式走到逆矩陣,再以逆矩陣法、克萊瑪法則與高斯消去法解線性方程組,並用奇異矩陣討論解的存在性。

數學延伸單元Mathematics Extended Part
Before this lesson you should know: Integration and Its Applications

§Text Passage

1Solving linear systems by elimination becomes messy as variables multiply. Matrices arrange the coefficients into rectangular tables, and determinants with inverse matrices provide a systematic theory. Module 2 requires addition, scalar multiplication and multiplication of matrices, determinants of orders two and three, inverse matrices and their properties, and three methods for solving systems of two and three linear equations — the map of this lesson.

2Matrix multiplication is both the key point and the trap: the number of columns of the left matrix must equal the number of rows of the right, each entry being a row-times-column sum; in general AB does not equal BA and the order must never be swapped. Multiplication is associative and distributive, and the identity matrix I leaves every matrix unchanged; transposition exchanges rows and columns. These properties underpin the methods that follow.

3The determinant compresses a square matrix into a single number, written |A| or det A. For order two it is the product of the main diagonal minus the product of the anti-diagonal; for order three, expand along the first row with alternating signs, each entry times its cofactor. A square matrix with zero determinant is called singular and has no inverse; otherwise the inverse exists and is unique. The order-two inverse: swap the main diagonal, negate the anti-diagonal, divide by the determinant.

4There are three methods for linear systems. The inverse method writes AX = B and left-multiplies by the inverse of A; Cramer's rule divides determinants, replacing one column of A by the constants each time; Gaussian elimination applies row operations to the augmented matrix until it is in reduced echelon form and the solution is read off. Each has its strength: the inverse method suits one coefficient matrix with many constant vectors, elimination is the most universal, and Cramer's rule is handy for two-variable systems by hand.

5Singular matrices are the detector of solutions: when the determinant is zero, the system has either no solution or infinitely many. A homogeneous system AX = 0 always has the all-zero solution, the trivial solution; the curriculum's theorem states that it has a non-trivial solution if and only if the coefficient matrix is singular. For example, when two lines through the origin coincide, every point on the line is a non-trivial solution, corresponding to a zero determinant.

1Summary 重點摘要

Matrices arrange the coefficients of linear systems into tables: master addition, scalar multiplication, multiplication and determinants, solve systems of two and three linear equations by inverse matrices, Cramer's rule or Gaussian elimination, and read the existence of solutions from whether the determinant is zero.

2Vocabulary cards Vocabulary

m
matrix矩陣

A rectangular array of numbers arranged in rows and columns, operated on as a whole.

s
square matrix方陣

A matrix with equal numbers of rows and columns; only square matrices have determinants and inverses.

i
identity matrix單位矩陣

The square matrix I with ones on the main diagonal and zeros elsewhere, the identity for multiplication.

d
determinant行列式

The single number associated with a square matrix, written |A| or det A; zero means the matrix is singular.

s
singular matrix奇異矩陣

A square matrix with zero determinant, hence no inverse; the corresponding system has no or infinitely many solutions.

i
inverse matrix逆矩陣

A matrix B with AB = BA = I, written A⁻¹; unique when it exists, and A must be non-singular.

C
Cramer's rule克萊瑪法則

The rule solving a linear system as ratios of determinants, each obtained by replacing one column of the coefficient matrix.

G
Gaussian elimination高斯消去法

Applying row operations to the augmented matrix until it is in reduced echelon form, then reading off the solution.

h
homogeneous system of linear equations齊次線性方程組

A system AX = 0 with all constants zero, always possessing the all-zero trivial solution.

n
non-trivial solution非平凡解

A solution of a homogeneous system not all zero, existing if and only if the coefficient matrix is singular.

3Step by step Steps

  1. Step 1: Matrices and their basic operationsA matrix arranges numbers into a rectangular table with m rows and n columns, called an m-by-n matrix; equal row and column counts make a square matrix. Equality needs the same order and every entry equal; addition and subtraction need the same order and work entry by entry; scalar multiplication multiplies every entry. For example, a chain store's stock of two products across three branches is a 2-by-3 matrix: merging two stock tables adds them entry by entry, and raising all prices by ten per cent multiplies the matrix by 1.1. Simple rules — but checking the order is always step one.
  2. Step 2: Matrix multiplication and the identity matrixMultiplication requires the left matrix's column count to equal the right's row count; the entry in row i, column j of the product is the sum of products pairing row i of the left with column j of the right. For example, A = [1 2; 3 4] times B = [5 6; 7 8]: the top-left entry is 1×5 + 2×7 = 19, and so on for all four entries. Multiplication is associative and distributive but in general AB ≠ BA — never swap the order. The identity matrix I has ones on the diagonal and zeros elsewhere, leaving any matrix unchanged; transposition swaps rows and columns, with (AB)ᵀ = BᵀAᵀ.
  3. Step 3: DeterminantsThe determinant compresses a square matrix into one number, written |A| or det A. For order two it is the main-diagonal product minus the anti-diagonal product: [3 2; 1 4] gives 3×4 − 2×1 = 10. For order three, expand along the first row: each entry times its cofactor — the second-order determinant left after deleting its row and column — with signs alternating plus, minus, plus. For example, the three first-row entries a, b, c are each multiplied by their cofactors and summed with signs, yielding a single number. A zero determinant makes the matrix singular — a term that runs through this whole lesson.
  4. Step 4: Inverse matricesIf a square matrix A satisfies AB = BA = I, then B is the inverse A⁻¹; the inverse exists if and only if A is non-singular, and it is unique. Order two has a shortcut: swap the main diagonal, negate the anti-diagonal, divide by the determinant. For example, A = [2 1; 1 −3] has determinant −7, so A⁻¹ = (1/−7)[−3 −1; −1 2]. Order three goes via the adjoint: compute the nine cofactors into the cofactor matrix, transpose to get the adjoint, divide by the determinant. Properties: (A⁻¹)⁻¹ = A, (AB)⁻¹ = B⁻¹A⁻¹ and (Aᵀ)⁻¹ = (A⁻¹)ᵀ — the reversal rule matches transposition.
  5. Step 5: Three methods for linear systemsWrite a system as AX = B with A the coefficient matrix. Inverse method: when A is invertible, X = A⁻¹B — multiplied from the left. Cramer's rule: x equals the determinant of A with its first column replaced by the constants, divided by D; y and z follow likewise, where D = det A. Gaussian elimination: apply row operations to the augmented matrix [A|B] until it is in reduced echelon form and read the solution. For example, a two-variable system starts by computing D to confirm solvability, then finds x and y one by one; three methods agreeing is mutual verification — in the exam use the one that flows and check with another.
  6. Step 6: Singular matrices and classifying solutionsWhen D = 0, Cramer's rule fails: the system has either no solution or infinitely many — parallel lines share no point, coincident lines share all of them, and the case needs separate analysis. A homogeneous system AX = 0 always has the all-zero solution, the trivial solution; the curriculum's theorem states it has a non-trivial solution if and only if the coefficient matrix is singular. For example, x + 2y = 0 and 2x + 4y = 0 describe the same line through the origin, the coefficient determinant is zero, and every solution with x = −2y is non-trivial, such as x = 2, y = −1.
  7. Step 7: Applications and presentationApplications translate a situation into AX = B: define the unknowns, write one equation per sentence, form the coefficient and constant matrices, verify the determinant is non-zero, then solve by the inverse. For example, three pens plus two notebooks cost 31 dollars, one pen plus three notebooks cost 17 dollars: the coefficient matrix [3 2; 1 3] has determinant 7, and multiplying its inverse by the constant column yields the unit prices. In your answer, state the order and the meaning of each row and column, keep the unknown and constant matrices distinct, and conclude in words with units — presentation details carry marks.

5Worked example Example

Example: solve the system 2x + y = 5, x − 3y = −8 using an inverse matrix.

  1. Write AX = B: A = [2 1; 1 −3], X = [x; y], B = [5; −8]
  2. Check invertibility: det A = 2×(−3) − 1×1 = −7 ≠ 0, so A⁻¹ exists and is unique
  3. Find the inverse: A⁻¹ = (1/−7)[−3 −1; −1 2] (swap the main diagonal, negate the anti-diagonal, divide by the determinant)
  4. Left-multiply: X = A⁻¹B = (1/−7)[(−3)(5)+(−1)(−8); (−1)(5)+(2)(−8)] = (1/−7)[−7; −21] = [1; 3]
  5. Check: 2(1) + 3 = 5 and 1 − 3(3) = −8, both hold
  6. Answer: x = 1, y = 3. Marking points: the matrix form with the determinant check, the inverse formula, correct entry-by-entry multiplication, and a verification close; omitting the justification det A ≠ 0 is a common deduction, as is unclear matrix notation (X and B must appear).

6Common mistakes Mistakes

✗ Swapping the order freely, replacing AB with BA.
✓ Multiplication is not commutative: AB ≠ BA; to solve AX = B, left-multiply by A⁻¹, giving X = A⁻¹B.
✗ Only negating the anti-diagonal of the order-two inverse, forgetting to divide by the determinant.
✓ The formula is [d −b; −c a] ÷ (ad − bc): all three moves are needed; a zero determinant means no inverse.
✗ Expanding a third-order determinant along the first row with all plus signs.
✓ The signs alternate plus, minus, plus: each entry times the cofactor left by deleting its row and column.
✗ Writing (AB)⁻¹ as A⁻¹B⁻¹.
✓ Inverses reverse order like transposes: (AB)⁻¹ = B⁻¹A⁻¹ — socks before shoes, removed in reverse.
✗ Answering a homogeneous system with the zero solution only, never discussing non-trivial ones.
✓ The trivial solution always exists; compute the coefficient determinant — non-trivial solutions exist if and only if it is zero — and then describe their form.

7Quick check Quick check

Q1When is the matrix product AB defined?

Q2Find the determinant of the matrix [3 2; 1 4].

Q3Find the inverse of A = [1 2; 3 4].

Q4When does a homogeneous system of linear equations have non-trivial solutions?

Q5Solve x + y = 3, x − y = 1 by Cramer's rule.

8Recap Recap

  • Matrix multiplication pairs rows with columns and never commutes; AB is defined when A's columns equal B's rows.
  • The determinant decides invertibility: det A = 0 means singular and no inverse; the order-two inverse swaps the main diagonal, negates the anti-diagonal, divides by det.
  • Know the inverse properties: (A⁻¹)⁻¹ = A, (AB)⁻¹ = B⁻¹A⁻¹, (Aᵀ)⁻¹ = (A⁻¹)ᵀ; check the determinant before inverting.
  • Three methods for systems: the inverse method X = A⁻¹B (left-multiplied), Cramer's ratios of determinants, Gaussian elimination to reduced echelon form.
  • A homogeneous system always has the trivial solution and has non-trivial ones if and only if the coefficient matrix is singular; for D = 0 the non-homogeneous system has no or infinitely many solutions.

Other subjects in this grade

Same subject, other grades