Exercises — Orthogonal matrices — properties, det = ±1
This is a self-test page for Orthogonal matrices — properties, det = ±1. Work each problem first, then open the collapsible solution. Problems climb five levels — from "spot one" to "build and prove". Everything you need was defined in the parent note: a matrix is orthogonal when (its columns are unit-length and mutually perpendicular), and then .
Recall One reminder we lean on repeatedly: why
Transposing a matrix does not change its determinant. Quick reason: the determinant is a sum over permutations of products of entries ; transposing just relabels each such product (swap row and column indices), giving the same set of products with the same signs. So for every square . We use this in Level 5.
Level 1 — Recognition
Exercise 1.1
Which of these matrices are orthogonal? Justify with the column test.
Recall Solution 1.1
Test each: are both columns unit length, and perpendicular to each other?
: columns , . Lengths and ✓. Dot product ✓. Orthogonal.
: columns , . First column length ✗. NOT orthogonal (it stretches the -axis by ).
: columns , . Length each ✓. Dot ✓. Orthogonal.
Answer: and are orthogonal; is not.
Exercise 1.2
For each orthogonal matrix above, compute and say rotation or reflection.
Recall Solution 1.2
→ rotation (it's a turn, orientation kept). → reflection (handedness flips).
Level 2 — Application
Exercise 2.1
Complete the matrix to orthogonal (a rotation):
The picture below shows the whole idea: the first column sits on the unit circle (yellow), and we need a second column that is (a) also on the unit circle and (b) at a right angle to it. There are exactly two such vectors — a left turn (blue) and a right turn — and only one gives .

Recall Solution 2.1
The first column already has length ( ✓; see the yellow arrow on the unit circle). We need unit-length AND perpendicular to .
Why rotate by ? In , the vector perpendicular to is (turn left — the blue arrow) or (turn right) — both unit if the original is. This is the fastest way to guarantee (the pink right-angle mark in the figure).
Left turn: . Check : ✓ (, so this is the right choice).
(The other perpendicular — the right turn — gives , a reflection — rejected.)
Exercise 2.2
Verify directly that from 2.1 satisfies .
Recall Solution 2.2
Level 3 — Analysis
Exercise 3.1
Let be orthogonal with . Prove that has as an eigenvalue when is odd (say ).
Before the proof, the figure below sketches why the eigenvalues of an orthogonal matrix live on the unit circle, and why the complex ones pair up: since , each eigenvalue is a point on the circle; because is real, its characteristic polynomial has real coefficients, so any non-real root must be accompanied by its mirror-image partner (a conjugate pair, symmetric across the horizontal axis).

Recall Solution 3.1
What we use: eigenvalues of orthogonal satisfy (they sit on the unit circle in the figure); complex eigenvalues come in conjugate pairs (whose product is ); and = product of all eigenvalues.
For , the eigenvalues (with multiplicity) are either three reals from , or one real plus a conjugate pair .
Case A (one real + a pair): product . This equals , so . ✓ eigenvalue present.
Case B (three reals from ): their product is , so the count of 's is odd — hence at least one . ✓
Conclusion: in either case is an eigenvalue. Geometrically, an odd-dimensional orientation-flip must reverse some axis — that reversed axis is the eigenvector. See Eigenvalues and eigenvectors.
Exercise 3.2
Show that a orthogonal matrix with must have the form .
Recall Solution 3.2
Column 1 is a unit vector in , so it lies on the unit circle: write it as for some angle . (Why? Every unit vector in the plane is — that's the definition of the unit circle.)
Column 2 is a unit vector perpendicular to column 1, so it is (the two turns of column 1).
- Choosing gives ✓.
- Choosing gives ✗ (rejected).
So forces the rotation form. See Rotations and reflections in $\mathbb{R}^2$ and $\mathbb{R}^3$.
Level 4 — Synthesis
Exercise 4.1
Using Orthonormal bases & Gram–Schmidt, build a orthogonal matrix whose first column is . Give one valid and state its .
Recall Solution 4.1
Step 1 — first column . Check length: ✓.
Step 2 — pick , then normalize. Choose raw ; check ✓. Length , so .
Step 3 — . The clean way is the cross product (guaranteed perpendicular to both):
Why is automatically unit length? The magnitude formula for a cross product is , where is the angle between and . Here and are orthonormal: and , so . Hence — no extra normalization needed. Direct check: ✓.
Result: Because follows the right-hand rule, this is a right-handed frame: . (Swapping would give .)
Exercise 4.2
Prove: if is orthogonal and with , then is a rotation about some axis (it has a fixed direction).
Recall Solution 4.2
Claim: is an eigenvalue, and its eigenvector is the rotation axis. For , eigenvalues are one real plus either two more reals from or a pair . Product .
- If a conjugate pair is present: . ✓
- If all three real: their product is , so the number of 's is even (0 or 2), leaving at least one . ✓
So there is a nonzero with : the axis. Vectors perpendicular to are rotated by the angle from the pair. This is exactly a rotation about . Links to Spectral theorem and Eigenvalues and eigenvectors.
Level 5 — Mastery
Exercise 5.1
Prove the general QR-flavoured fact: for orthogonal , and any matrix , . Then use it to show that similar-via-orthogonal matrices share eigenvalues.
Recall Solution 5.1
Determinant part. Using and (the reminder at the top of the page): Since orthogonal :
Eigenvalue part. Let . Then for any scalar : using . Taking determinants and applying the fact above with : The two characteristic polynomials are identical, so and have the same eigenvalues. This is the backbone of the Spectral theorem and QR decomposition (orthogonal similarity preserves spectrum). See also Inner product spaces.
Exercise 5.2
A orthogonal has and satisfies . What geometric maps are possible? Give one explicit .
Recall Solution 5.2
Use to pin the eigenvalues. If then , so , i.e. — no genuine complex pair survives (a pair would need , forcing , which is again real ).
Now impose . With eigenvalues each and their product , the number of 's must be odd: either one or three 's. Two possibilities:
- Eigenvalues → a reflection across a plane: the two directions span the mirror plane (fixed), the single direction is flipped.
- Eigenvalues → the point inversion : every direction is flipped through the origin.
Explicit example (reflection across the -plane): Here the mirror plane is (the eigenspace) and the flipped axis is (the eigenvector). The other case, , also satisfies and .
The figure below shows this reflection: a vector (yellow) is sent to (pink) by flipping only its -component across the mirror plane (blue).
