Unit 6: Matrices and determinants

MTH110 — Remedial Mathematics 7 min read

A matrix is a rectangular array of numbers arranged in horizontal rows and vertical columns, enclosed in brackets and treated as a single algebraic object. The concept underlies the compact handling of linear systems, transformations and data tables; everything in this unit depends on the ideas of order, elements and the square-matrix condition.

  • Notation: A matrix is written , where is the element in row , column ; e.g. sits in row 2, column 3.
  • Order (size): An arrangement of rows and columns has order , read "m by n". A matrix has 6 elements.
  • Square matrix: Order ; only square matrices have determinants and inverses.
  • Equality convention: Two matrices are equal only if they have the same order and for every position.
  • Principal diagonal: In a square matrix, the elements .

II. Types of Matrices

Matrices are classified by shape and by the pattern of their elements, and the classification decides which operations apply.

A. types of matrices

  • Row matrix: A single row, order ; e.g. .
  • Column matrix: A single column, order ; e.g. .
  • Square matrix: Rows equal columns (), the precondition for determinant and inverse.
  • Diagonal matrix: Square, with every off-diagonal element zero, e.g. .
  • Scalar matrix: Diagonal matrix with equal diagonal entries, e.g. .
  • Identity (unit) matrix : Scalar matrix with diagonal entries all 1; acts as the multiplicative identity, .
  • Zero (null) matrix : Every element is 0; the additive identity.
  • Upper/lower triangular: All elements below (or above) the diagonal are zero.
  • Symmetric matrix: , so .
  • Skew-symmetric matrix: , forcing the diagonal to be zero.

III. Matrix Operations

Operations combine matrices under strict order rules; addition and subtraction need identical order, while multiplication needs a matching inner dimension.

A. addition of matrices

Addition is defined element by element for matrices of the same order.

  • Rule: , valid only when and share the same order.
  • Properties: Commutative, ; associative, ; identity .
  • Example:
TEXT
[1 2]   [5 6]   [6  8]
[3 4] + [7 8] = [10 12]

B. subtraction of matrices

Subtraction is addition of the negative, again element by element on matrices of equal order.

  • Rule: .
  • Not commutative: in general.
  • Example:
TEXT
[5 6]   [1 2]   [4 4]
[7 8] - [3 4] = [4 4]

C. multiplication of matrices

Two matrices multiply when the number of columns of the first equals the number of rows of the second; each product entry is a row-by-column dot product.

  • Conformability: ; the inner dimensions () must match.
  • Rule: , i.e. sum of products of row of with column of .
  • Scalar multiplication: multiplies every element by .
  • Properties: Associative and distributive, but not commutative: usually.
  • Worked example:
TEXT
[1 2] [5 6]   [1·5+2·7  1·6+2·8]   [19 22]
[3 4] [7 8] = [3·5+4·7  3·6+4·8] = [43 50]

D. transpose of matrices

The transpose interchanges rows and columns, turning an matrix into .

  • Rule: ; the element in row , column moves to row , column .
  • Properties: ; ; the reversal law .
  • Example: .

IV. Determinants of Second and Third Order

A determinant is a single scalar computed from a square matrix, written or ; it measures whether the matrix is invertible () and scales the associated linear transformation.

A. determinant of second order

For a matrix the determinant is the difference of diagonal products.

  • Formula: for ,
TEXT
|A| = ad − bc
  • Symbols: lie on the principal diagonal; on the secondary diagonal.
  • Example: .

B. determinant of third order

A determinant is evaluated by expansion along a row or column using minors and cofactors.

  • Minor : the determinant left after deleting row and column .
  • Cofactor: ; the sign pattern is .
  • Expansion along row 1: for ,
TEXT
|A| = a1(b2c3 − b3c2) − b1(a2c3 − a3c2) + c1(a2b3 − a3b2)
  • Example: .

C. properties and significance

  • Row/column swap: interchanging two rows changes the sign of .
  • Zero determinant: signals a singular (non-invertible) matrix and linearly dependent rows.
  • Transpose: .

V. Adjoint and Inverse of Non-Singular Matrices

A non-singular matrix is a square matrix with ; only such matrices possess an inverse satisfying , and the inverse is built from the adjoint.

A. adjoint of second and third order

The adjoint is the transpose of the cofactor matrix.

  • Definition: , where are the cofactors.
  • Second order shortcut: for , swap the diagonal entries and negate the off-diagonal:
TEXT
adj A = [ d  −b ]
        [−c   a ]
  • Third order: compute all nine cofactors , arrange as a matrix, then transpose.
  • Key relation: .

B. inverse of non-singular matrices of second and third order

The inverse divides the adjoint by the determinant.

  • Formula:
TEXT
A⁻¹ = (1 / |A|) · adj A ,  provided |A| ≠ 0
  • Symbols: is the determinant, the adjoint; if the inverse does not exist.
  • Second-order example: for , , , so
TEXT
A⁻¹ = (1/10) [ 4  −2 ]  =  [ 0.4  −0.2]
             [−1   3 ]     [−0.1   0.3]
  • Property: , and .

VI. Solution of System of Linear Equations Using Inverse of a Matrix

A linear system can be packed into a matrix equation and solved in one step once the coefficient matrix is inverted.

A. solution of system of linear equations using inverse of a matrix

The method rewrites the system as and isolates .

  • Matrix form: , where is the coefficient matrix, the column of unknowns, the column of constants.
  • Solution: premultiply by : , valid only when (unique solution).
  • Singular case: if the system has either no solution or infinitely many.
  • Worked example: solve .
TEXT
A = [2 1]  B = [ 5]   |A| = 6−1 = 5
    [1 3]      [10]
adj A = [ 3 −1]   A⁻¹ = (1/5)[ 3 −1]
        [−1  2]              [−1  2]
X = A⁻¹B = (1/5)[3·5 −1·10] = (1/5)[ 5] = [1]
                [−1·5 +2·10]        [15]   [3]

So .

VII. Application of Determinant: Cramer's Rule

Cramer's rule solves a linear system directly from determinants, replacing one column of the coefficient matrix at a time with the constant column.

A. application of determinant to solve simultaneous equations by cramer's rule

Each unknown equals a ratio of determinants, so no matrix inversion is required.

  • Two variables: for ,
TEXT
D  = |a1 b1|   Dx = |c1 b1|   Dy = |a1 c1|
     |a2 b2|        |c2 b2|        |a2 c2|
x = Dx / D ,  y = Dy / D ,  D ≠ 0
  • Three variables: is the coefficient determinant; replace the first, second and third columns respectively with the constants, giving , , .
  • Consistency test: gives a unique solution; with some means no solution; all zero means infinitely many.
  • Worked example: solve .
TEXT
D  = |2 1| = 5   Dx = |5  1| = 5   Dy = |2  5| = 15
     |1 3|            |10 3|            |1 10|
x = 5/5 = 1 ,  y = 15/5 = 3
  • Comparison with the inverse method:
    1. Inverse method: finds all unknowns at once through ; efficient when the same recurs with different .
    2. Cramer's rule: computes each unknown from its own determinant; cleaner for small systems but costly as grows because each variable needs a full determinant.