Posts

Showing posts with the label FP3

Linear Transformations in ℝ³ and 3×3 Matrices

Linear Transformations in ℝ³ and 3×3 Matrices Matrices give us a compact way to describe linear transformations in three-dimensional space. A linear transformation is a mapping T : ℝ³ → ℝ³ that sends a point with position vector (x, y, z) to another point, according to a rule with two key properties. What Makes a Transformation Linear? A transformation T : ℝ³ → ℝ³ is called linear if, for all real numbers λ and all vectors (x, y, z) in ℝ³, T(λx, λy, λz) = λ T(x, y, z), and for all vectors (x₁, y₁, z₁) and (x₂, y₂, z₂) in ℝ³, T(x₁ + x₂, y₁ + y₂, z₁ + z₂) = T(x₁, y₁, z₁) + T(x₂, y₂, z₂). The point that (x, y, z) is sent to is called the image of (x, y, z) under T. The Standard Basis Vectors To find the matrix that represents a particular transformation, it is enough to know what happens to three special vectors, called the standard basis for ℝ³: î = (1, 0, 0) ĵ = (0, 1, 0) k̂ = (0, 0, 1) Once we know the images of î, ĵ and k̂, th...

Finding the Inverse of a 2x2 Matrix from Scratch

Finding the Inverse of a 2x2 Matrix from Scratch This post shows a complete, step-by-step derivation of the inverse of a 2x2 matrix. Everything is expressed using stable, browser-safe ASCII formatting so the layout displays correctly on all devices and all templates. FIRST PART. Start with the matrix equation: A = [[a, b], [c, d]] A^(-1) = [[w, x], [y, z]] Goal: A * A^(-1) = I This produces the column equations: [aw + by, cw + dy]^T = [1, 0]^T [ax + bz, cx + dz]^T = [0, 1]^T Which gives the four equations: aw + by = 1 cw + dy = 0 ax + bz = 0 cx + dz = 1 SECOND PART. Use the first two equations to find w. aw + by = 1 cw + dy = 0 Multiply: (ad)w + (bd)y = d (first eq multiplied by d) (bc)w + (bd)y = 0 (second eq multiplied by b) Subtract: (ad - bc)w = d w = d / (ad - bc) (ad - bc != 0) THIRD PART. Use the next pair to find x. ax + bz = 0 cx + dz = 1 Multiply: (ad)x + (bd)z = 0 (bc)x + (bd)z = b Subtract: (ad - bc)...