Matrix inverse: A⁻¹ such that AA⁻¹ = A⁻¹A = I, provided det(A) ≠ 0
- Calculate the determinant: det(A) = ad - bc
- If det(A) ≠ 0, compute A⁻¹ using the formula
- Verify AA⁻¹ = I and A⁻¹A = I
For A = \(\begin{bmatrix} a & b \\ c & d \end{bmatrix} = \begin{bmatrix} 3 & 1 \\ 4 & 2 \end{bmatrix}\)
det(A) = ad - bc = (3×2) - (1×4) = 6 - 4 = 2
For 2×2 matrices: A⁻¹ = \(\frac{1}{\text{det}(A)}\begin{bmatrix} d & -b \\ -c & a \end{bmatrix}\)
A⁻¹ = \(\frac{1}{2}\begin{bmatrix} 2 & -1 \\ -4 & 3 \end{bmatrix} = \begin{bmatrix} 1 & -0.5 \\ -2 & 1.5 \end{bmatrix}\)
AA⁻¹ = \(\begin{bmatrix} 3 & 1 \\ 4 & 2 \end{bmatrix} \begin{bmatrix} 1 & -0.5 \\ -2 & 1.5 \end{bmatrix}\)
Row 1, Col 1: (3×1) + (1×(-2)) = 3 - 2 = 1
Row 1, Col 2: (3×(-0.5)) + (1×1.5) = -1.5 + 1.5 = 0
Row 2, Col 1: (4×1) + (2×(-2)) = 4 - 4 = 0
Row 2, Col 2: (4×(-0.5)) + (2×1.5) = -2 + 3 = 1
So AA⁻¹ = \(\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} = I\) ✓
A⁻¹A = \(\begin{bmatrix} 1 & -0.5 \\ -2 & 1.5 \end{bmatrix} \begin{bmatrix} 3 & 1 \\ 4 & 2 \end{bmatrix}\)
Row 1, Col 1: (1×3) + ((-0.5)×4) = 3 - 2 = 1
Row 1, Col 2: (1×1) + ((-0.5)×2) = 1 - 1 = 0
Row 2, Col 1: ((-2)×3) + (1.5×4) = -6 + 6 = 0
Row 2, Col 2: ((-2)×1) + (1.5×2) = -2 + 3 = 1
So A⁻¹A = \(\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} = I\) ✓
The inverse is A⁻¹ = \(\begin{bmatrix} 1 & -0.5 \\ -2 & 1.5 \end{bmatrix}\)
• 2×2 inverse formula: A⁻¹ = (1/det(A))[d -b; -c a]
• Invertibility condition: det(A) ≠ 0
• Verification: AA⁻¹ = A⁻¹A = I
Non-invertible matrix: Also called singular matrix, has det(A) = 0
For B = \(\begin{bmatrix} 2 & 6 \\ 1 & 3 \end{bmatrix}\)
det(B) = (2×3) - (6×1) = 6 - 6 = 0
Since det(B) = 0, matrix B is not invertible
A matrix is invertible if and only if its determinant is non-zero
det(B) = 0 means B collapses the plane to a line
The rows of B are linearly dependent: [2, 6] = 2[1, 3]
This means B is not one-to-one and not onto
Row 1 = 2 × Row 2: [2, 6] = 2[1, 3]
This confirms the rows are linearly dependent
Hence, the matrix cannot have full rank
Since B has linearly dependent rows, the system Bx = 0 has non-trivial solutions
This violates the requirement for invertibility
Matrix B is not invertible because det(B) = 0
• Invertibility condition: det(A) ≠ 0
• Linear dependence: Zero determinant implies dependent rows/columns
• Rank deficiency: Singular matrices have reduced rank
Rotation matrix: Orthogonal matrix with determinant 1
For R = \(\begin{bmatrix} \cos θ & -\sin θ \\ \sin θ & \cos θ \end{bmatrix}\)
det(R) = (cos θ)(cos θ) - ((-sin θ)(sin θ)) = cos²θ + sin²θ = 1
R⁻¹ = \(\frac{1}{1}\begin{bmatrix} \cos θ & \sin θ \\ -\sin θ & \cos θ \end{bmatrix} = \begin{bmatrix} \cos θ & \sin θ \\ -\sin θ & \cos θ \end{bmatrix}\)
Rᵀ = \(\begin{bmatrix} \cos θ & \sin θ \\ -\sin θ & \cos θ \end{bmatrix}\)
Both matrices are identical: R⁻¹ = Rᵀ
This confirms that rotation matrices are orthogonal: RᵀR = RRᵀ = I
R⁻¹ represents rotation by -θ (opposite direction)
Rᵀ also represents rotation by -θ (since sin(-θ) = -sin(θ), cos(-θ) = cos(θ))
The inverse of the rotation matrix equals its transpose
• Orthogonal matrices: R⁻¹ = Rᵀ
• Rotation matrices: det(R) = 1, preserve length and angles
• Trigonometric identity: cos²θ + sin²θ = 1
Product of invertible matrices: If A and B are invertible, then AB is invertible
We need to show that (B⁻¹A⁻¹)(AB) = I and (AB)(B⁻¹A⁻¹) = I
Left multiplication: (B⁻¹A⁻¹)(AB) = B⁻¹(A⁻¹A)B = B⁻¹IB = B⁻¹B = I
Right multiplication: (AB)(B⁻¹A⁻¹) = A(BB⁻¹)A⁻¹ = AIA⁻¹ = AA⁻¹ = I
For A = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}\): det(A) = (2×1) - (1×1) = 1
A⁻¹ = \(\begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)
For B = \(\begin{bmatrix} 1 & 0 \\ 1 & 2 \end{bmatrix}\): det(B) = (1×2) - (0×1) = 2
B⁻¹ = \(\frac{1}{2}\begin{bmatrix} 2 & 0 \\ -1 & 1 \end{bmatrix} = \begin{bmatrix} 1 & 0 \\ -0.5 & 0.5 \end{bmatrix}\)
B⁻¹A⁻¹ = \(\begin{bmatrix} 1 & 0 \\ -0.5 & 0.5 \end{bmatrix} \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)
= \(\begin{bmatrix} 1 & -1 \\ -1 & 1.5 \end{bmatrix}\)
AB = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} 1 & 0 \\ 1 & 2 \end{bmatrix} = \begin{bmatrix} 3 & 2 \\ 2 & 2 \end{bmatrix}\)
det(AB) = (3×2) - (2×2) = 2
(AB)⁻¹ = \(\frac{1}{2}\begin{bmatrix} 2 & -2 \\ -2 & 3 \end{bmatrix} = \begin{bmatrix} 1 & -1 \\ -1 & 1.5 \end{bmatrix}\)
This matches B⁻¹A⁻¹ ✓
(AB)⁻¹ = B⁻¹A⁻¹ as proven and verified
• Inverse of product: (AB)⁻¹ = B⁻¹A⁻¹
• Associativity: Matrix multiplication is associative
• Verification: Direct computation confirms the result
Upper triangular matrix: Matrix with zeros below the main diagonal
For A = \(\begin{bmatrix} 1 & 1 \\ 0 & 1 \end{bmatrix}\): det(A) = (1×1) - (1×0) = 1 ≠ 0
Since det(A) ≠ 0, A is invertible
A⁻¹ = \(\frac{1}{1}\begin{bmatrix} 1 & -1 \\ 0 & 1 \end{bmatrix} = \begin{bmatrix} 1 & -1 \\ 0 & 1 \end{bmatrix}\)
A² = \(\begin{bmatrix} 1 & 1 \\ 0 & 1 \end{bmatrix} \begin{bmatrix} 1 & 1 \\ 0 & 1 \end{bmatrix}\)
= \(\begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix}\)
For A² = \(\begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix}\): det(A²) = 1
(A²)⁻¹ = \(\begin{bmatrix} 1 & -2 \\ 0 & 1 \end{bmatrix}\)
(A⁻¹)² = \(\begin{bmatrix} 1 & -1 \\ 0 & 1 \end{bmatrix} \begin{bmatrix} 1 & -1 \\ 0 & 1 \end{bmatrix}\)
= \(\begin{bmatrix} 1 & -2 \\ 0 & 1 \end{bmatrix}\)
Both equal \(\begin{bmatrix} 1 & -2 \\ 0 & 1 \end{bmatrix}\) ✓
This confirms the general property: (Aⁿ)⁻¹ = (A⁻¹)ⁿ
(A²)⁻¹ = (A⁻¹)² as verified by direct computation
• Power rule: (Aⁿ)⁻¹ = (A⁻¹)ⁿ for invertible A
• Triangular matrices: Easy to invert, determinant is product of diagonal elements
• Verification: Direct computation confirms theoretical results
Matrix inverse: For square matrix A, A⁻¹ exists if AA⁻¹ = A⁻¹A = I
Invertible matrix: Also called nonsingular matrix, has non-zero determinant
Singular matrix: Non-invertible matrix with zero determinant
- Check invertibility: Calculate det(A) ≠ 0
- For 2×2 matrices: Use the simple formula
- For larger matrices: Use adjugate formula or row reduction
- Verify result: Check AA⁻¹ = I
• Definition: AA⁻¹ = A⁻¹A = I
• Invertibility: det(A) ≠ 0
• Uniqueness: If A⁻¹ exists, it's unique
• Product: (AB)⁻¹ = B⁻¹A⁻¹
• Transpose: (Aᵀ)⁻¹ = (A⁻¹)ᵀ
• Power: (Aⁿ)⁻¹ = (A⁻¹)ⁿ
• Determinant and invertibility relationship
• Properties of invertible matrices
• Common patterns in matrix inverses
Analysis: The visualization shows how different matrix properties relate to invertibility.
- Determinant must be non-zero for invertibility
- Full rank is necessary for invertibility
- Linear independence of rows/columns is required