What is an Orthogonal Matrix? The Intuition
Imagine you have a set of coordinate axes — the usual x, y, and z directions. Now suppose you rotate the whole space. The axes change direction, but something important stays the same: lengths of vectors, angles between them, and the fact that the new axes are still perpendicular (orthogonal) to each other.
An orthogonal matrix is the mathematical tool that describes exactly this kind of transformation — a rotation (or a reflection) that preserves distances and angles. It's a square matrix whose columns are mutually perpendicular unit vectors.
The word "orthogonal" comes from Greek: orthos (straight/right) + gonia (angle). It literally means "right-angled."
The Precise Definition
A square matrix Q of size n×n is called orthogonal if its transpose equals its inverse:
QTQ=QQT=I
where I is the identity matrix. Equivalently:
This single equation captures everything. Let's see why.
What This Property Actually Means
1. Columns are orthonormal
Write Q in terms of its column vectors: Q=[c1c2⋯cn].
When you compute QTQ, the (i,j) entry is the dot product ci⋅cj. The equation QTQ=I says:
- For i=j: ci⋅ci=1 — each column is a unit vector.
- For i=j: ci⋅cj=0 — different columns are perpendicular.
So the columns form an orthonormal basis for Rn.
2. Rows are also orthonormal
Exactly the same reasoning applied to QQT=I shows that the rows of Q also form an orthonormal set. This is a special symmetry — if columns are orthonormal, rows automatically are too.
3. Lengths are preserved
For any vector x, the transformed vector Qx has the same length:
∥Qx∥2=(Qx)T(Qx)=xTQTQx=xTIx=∥x∥2
This is why orthogonal matrices are called isometries — they preserve distances.
4. Angles are preserved
The dot product is also preserved:
(Qx)⋅(Qy)=xTQTQy=xTy
Since angles are defined through dot products, angles between vectors remain unchanged.
The determinant of an orthogonal matrix is always ±1. If detQ=+1, it represents a rotation (orientation preserved). If detQ=−1, it represents a reflection (orientation reversed).
A Simple 2×2 Example
The rotation matrix by angle θ:
Q=[cosθsinθ−sinθcosθ]
Check: QT=[cosθ−sinθsinθcosθ], and
QTQ=[cos2θ+sin2θ00sin2θ+cos2θ]=I
The columns are (cosθ,sinθ) and (−sinθ,cosθ) — both unit vectors, and their dot product is −cosθsinθ+sinθcosθ=0.
Why This Matters in Exams
The orthogonal matrix property appears in:
- Linear algebra: diagonalizing symmetric matrices (they have orthogonal eigenvectors)
- Coordinate geometry: changing between orthonormal bases
- Physics: representing rotations in 3D space
- Statistics: principal component analysis (PCA)
To quickly test if a given matrix is orthogonal, multiply it by its transpose. If you get the identity matrix, it's orthogonal. No need to compute the inverse separately.
Common Mistake to Avoid
An orthogonal matrix does not mean "all entries are orthogonal to each other." It means the columns (as vectors) are orthogonal to each other. A matrix with all entries being 0 or 1 is almost never orthogonal.
The Bottom Line
An orthogonal matrix is a square matrix whose columns (and rows) form an orthonormal set. It preserves lengths and angles, and its inverse is simply its transpose.
QTQ=IandQ−1=QT