2×2 Orthogonal Matrix Mastery — A Generalised Construction

2×2 Orthogonal Matrix Mastery — A Generalised Construction

Orthogonal matrices in two dimensions reveal one of the cleanest structures in linear algebra. A 2×2 matrix is orthogonal when its columns (and rows) satisfy two conditions:

  • They are perpendicular (their dot product is zero);
  • They have unit length (their magnitude is one).

This article presents a clear generalisation: any pair of perpendicular vectors with equal magnitude can be normalised to form an orthogonal matrix.

2×2 Orthogonal Matrix Mastery — A Generalised Construction


1. Begin with two perpendicular vectors

Let the first vector be: 

(a, b)

A perpendicular vector can be chosen as: 

(−b, a)

Their dot products confirm orthogonality: 

(a, b) · (−b, a) = −ab + ab = 0
(a, −b) · (b, a) = ab − ab = 0

2. Compute their shared magnitude

Both vectors have the same length: 

|(a, b)| = √(a² + b²)

We can therefore normalise each one by dividing by √(a² + b²).

3. Form the matrix using the normalised vectors

Place the two normalised vectors as the columns of a matrix: 

(1 / √(a² + b²)) ·
[  a   −b ]
[  b    a ]

4. Verify orthogonality

Multiply the matrix by its transpose: 

(1 / (a² + b²)) ·
[  a   −b ] [  a    b ]
[  b    a ] [ −b    a ]

Carrying out the multiplication yields: 

(1 / (a² + b²)) ·
[ a² + b²      0     ]
[    0      a² + b²  ]

Dividing through by (a² + b²) gives the identity matrix: 

[ 1   0 ]
[ 0   1 ]

This confirms that the matrix is orthogonal.

Conclusion

Any pair of perpendicular vectors with the same magnitude can be normalised to produce a 2×2 orthogonal matrix. This general construction offers a clean and geometric viewpoint of rotations, reflections, and other transformations in two dimensions.

Adapted from handwritten notes for educational use.

Popular posts from this blog

Orthogonal Matrices and Mutually Orthogonal Vectors

Orthogonal Matrices and Mutually Orthogonal Vectors Orthogonal matrices appear naturally throughout linear algebra, geometry, physics, and computer graphics. They preserve lengths, angles, and orientation, which makes them fundamental in describing rotations and rigid motions in three-dimensional space. This article provides a clear and carefully structured explanation of what orthogonal matrices are, why they matter, and how to verify that a given matrix is orthogonal. 1. Definition of an Orthogonal Matrix Let M be an n × n square matrix. M is called orthogonal if it satisfies: M M T = I Here: M T is the transpose of M. I is the identity matrix of the same size. Because of this property, every orthogonal matrix has a very useful consequence: M -1 = M T This means that the inverse of an orthogonal matrix is obtained simply by transposing it. This property is central to rigid-body transformations in 3D geometry and computer graphics. 2...
Read more

A Geometric Way to Visualise sin(x + y) and cos(x + y)

Image
The angle–addition identities for sine and cosine often appear as algebraic formulas, but they can also be understood by combining two right triangles in a simple geometric construction. The calculations for the side lengths follow directly from the definitions of sine and cosine. sin(x + y) = sin x cos y + cos x sin y cos(x + y) = cos x cos y − sin x sin y Start with a right triangle of angle y and hypotenuse 1. From basic trigonometry, its horizontal and vertical sides are: cos y and sin y. Next, attach a second right triangle with angle x . Its hypotenuse is the side of length cos y from the first triangle, so its adjacent and opposite sides become: adjacent = cos x · cos y opposite = sin x · cos y Likewise, if the first triangle's vertical side sin y is used as a hypotenuse in a similar way, it contributes: adjacent = cos x · sin y opposite = sin x · sin y When the horizontal components are combined, they give the expression for cos(x + y...
Read more

The Shortest Distance Between Two Skew Lines in ℝ³

The Shortest Distance Between Two Skew Lines in ℝ³ This post derives, from first principles, a vector formula for the shortest distance between two skew lines in ℝ³. The argument uses only the definitions and basic properties of the dot product and cross product; no higher results are assumed. 1. Vector Equations of the Lines Let the two lines be given in vector form by r = a + λb r = c + μd where: a , c are position vectors of fixed points on each line, b , d are non-zero direction vectors, λ, μ ∈ ℝ are parameters. The lines are skew if they are neither parallel nor intersecting. Our goal is to find a closed-form expression for the minimum distance between them. 2. Direction of the Common Perpendicular The segment that realises the shortest distance lies along a line perpendicular to both direction vectors b and d . A vector perpendicular to both is given by their cross product: b × d. Assuming b and d are not parallel, b × d ≠ 0. A unit ...
Read more