Mathematics IUnit 49 min read
Matrices & Determinants – definitions, operations, inverses, and applications
Unit 4 of Mathematics I introduces matrices and determinants, covering their types, arithmetic, multiplication, transpose, inverse, determinant calculation, properties, and real‑world uses in computing, finance and engineering.
Key points
- A matrix is a rectangular array of numbers; its order is written as \(m \times n\).
- Matrix addition/subtraction require identical order; multiplication follows the row‑column rule.
- The determinant is a scalar value attached to a square matrix, computed by expansion of minors or row‑reduction.
- An invertible matrix has a non‑zero determinant; its inverse is found via adjugate or elementary row operations.
- Matrices model linear systems, graphics transformations, network flows, and many Nepali e‑commerce/telecom algorithms.
1. Basic Definitions
| Symbol | Meaning |
|---|---|
| Matrix with element in row , column | |
| Order: rows, columns | |
| Transpose of (rows ↔ columns) | |
| Determinant of square matrix | |
| Identity matrix of order (1’s on diagonal, 0’s elsewhere) |
Types of Matrices
- Row matrix:
- Column matrix:
- Square matrix:
- Zero (null) matrix: all entries 0
- Diagonal matrix: non‑zero entries only on the main diagonal
- Scalar matrix: diagonal matrix with equal diagonal entries
- Identity matrix: special scalar matrix with diagonal entry 1
- Symmetric matrix:
2. Matrix Arithmetic
2.1 Addition & Subtraction
Only possible when matrices have the same order.
2.2 Scalar Multiplication
2.3 Matrix Multiplication
If is and is , the product is with
flowchart LR
subgraph A ["Matrix A (2x3)"]
direction TB
A11["1"] --- A12["2"] --- A13["0"]
A21["-1"] --- A22["3"] --- A23["4"]
end
subgraph B ["Matrix B (3x2)"]
direction TB
B11["2"] --- B12["-1"]
B21["0"] --- B22["5"]
B31["3"] --- B32["1"]
end
subgraph C ["Product C (2x2)"]
direction TB
C11["2"] --- C12["9"]
C21["10"] --- C22["20"]
end
A11 --> C11
A12 --> C11
A13 --> C11
A21 --> C21
A22 --> C21
A23 --> C21
B11 --> C11
B21 --> C11
B31 --> C11
B12 --> C12
B22 --> C12
B32 --> C12
B11 --> C21
B21 --> C21
B31 --> C21
B12 --> C22
B22 --> C22
B32 --> C22Visualizing the dot product for each element in matrix multiplication (Worked Example 1)Worked Example 1 – Multiplying Two Matrices
Compute .
3. Transpose and Symmetry
The transpose flips rows and columns: .
A matrix is symmetric if .
4. Determinants
Only defined for square matrices.
4.1 Determinant of a 2×2 Matrix
4.2 Determinant of a 3×3 Matrix (Laplace Expansion)
where and is the minor obtained by deleting row and column .
flowchart TD
A["Matrix A"] --> B["Expand along Row 1"]
B --> C1["Term 1: +2 * Minor(1,1)"]
B --> C2["Term 2: -(-1) * Minor(1,2)"]
B --> C3["Term 3: +0 * Minor(1,3)"]
C1 --> D1["Minor(1,1) = |3 1; 5 -2| = -11"]
C2 --> D2["Minor(1,2) = |4 1; 0 -2| = -8"]
C3 --> D3["Minor(1,3) = |4 3; 0 5| = 20"]
D1 --> E["2 * (-11) = -22"]
D2 --> F["1 * (-8) = -8"]
D3 --> G["0 * 20 = 0"]
E --> H["Sum: -22 - 8 + 0"]
F --> H
G --> H
H --> I["|A| = -30"]Step-by-step Laplace expansion for the 3x3 determinant (Worked Example 2)Worked Example 2 – Determinant of a 3×3 Matrix
Using the matrix from the first figure:
Since , the matrix is invertible.
5. Inverse of a Square Matrix
A matrix has an inverse iff . Two common methods:
Adjugate method (for small orders)
where is the transpose of the cofactor matrix.Gauss‑Jordan elimination (row‑reduction of to ).
Worked Example 3 – Inverse of a 2×2 Matrix
Adjugate:
6. Properties of Determinants (Comparison Table)
| Property | Description |
|---------------------------------------|------------------------------------------------------|
| \(|AB| = |A|\;|B|\) | Determinant of a product equals product of determinants |
| \(|A^{T}| = |A|\) | Transpose does not change determinant |
| \(|kA| = k^{n}|A|\) (for \(n\times n\))| Scaling a matrix by \(k\) multiplies determinant by \(k^{n}\) |
| Swapping two rows (or columns) → sign change | \(|A'| = -|A|\) after one row swap |
| Adding a multiple of one row to another → determinant unchanged | Useful for row‑reduction |
7. Applications
| Application | How Matrices/Determinants are Used |
|---|---|
| Linear Equation Systems | Coefficient matrix and vector → solve using or Cramer's rule (determinants). |
| Computer Graphics | Transformation matrices (rotation, scaling, translation) applied to vertex coordinates. |
| Network Routing (e.g., Ncell) | Adjacency matrix of cell towers; determinant of Laplacian gives number of spanning trees (network reliability). |
| Recommendation Engines (eSewa, Daraz) | User‑item rating matrix factorisation (SVD) – underlying linear algebra. |
| Economics (NEPSE) | Input‑output models use matrices; determinant indicates system solvability. |
8. Worked Real‑World Example
Scenario: A small Nepali shop uses a 2‑item inventory model. Let
flowchart LR
A["Inventory Matrix A"] --> B["Check Determinant"]
B --> C{"|A| != 0?"}
C -- Yes --> D["Calculate Inverse A^-1"]
C -- No --> E["No Unique Solution"]
D --> F["Multiply A^-1 by b"]
F --> G["Solution Vector x"]
G --> H["x1 = 8, x2 = 6"]Algorithm for solving the linear system Ax=b using matrix inverse
where column 1 = units of Item X needed per product, column 2 = units of Item Y needed per product. The shop wants to produce a mix that uses exactly 30 units of X and 40 units of Y.
Solve with .
- Compute .
- Find .
- Multiply:
Interpretation: Produce 8 units of product 1 and 6 units of product 2 to exhaust the stock exactly.
9. In‑Class Tips for Solving Determinants Quickly
- Row‑Reduction: Convert to upper‑triangular form; determinant = product of diagonal entries (adjust sign for row swaps).
- Sarrus’ Rule (only for 3×3): repeat first two columns, sum down‑diagonals, subtract up‑diagonals.
- Cofactor Expansion: Choose the row/column with most zeros to minimise calculations.
In the real world
- Google Search – PageRank algorithm treats the web as a directed graph; the transition matrix’s eigen‑vector (derived from the matrix) ranks pages.
- Daraz Order Management – Inventory across warehouses is represented by a matrix; multiplying the order‑quantity vector by the stock‑availability matrix yields fulfillment feasibility.
- Ncell Network Planning – The adjacency matrix of cell‑tower connections is used; its determinant of the Laplacian matrix tells engineers how many independent spanning trees exist, indicating network robustness.
Exam tip
- Determinant shortcuts: memorize Sarrus for and the 2×2 formula; practice row‑reduction to triangular form for larger matrices.
- Inverse: For always use the adjugate formula; for or higher, be comfortable with the Gauss‑Jordan method – write the augmented matrix and perform elementary row operations until the left side becomes .
- Marking scheme: Full credit is given for each correct elementary operation (row swap, scaling, addition) and for stating the effect on the determinant. Skip unnecessary intermediate steps to save time.
Based on the TU BCA syllabus for Mathematics I (CAMT104), unit 4.
Discussion
Loading…