Every Euclidean isometry of is a product of at most operations of reflection in a hyperplane. An isometry fixing zero is orthogonal: the polarization identity preserves inner products, and its values on an orthonormal basis determine its linear action. An orthogonal transformation is a product of at most linear reflections, by reflecting the image of the first basis vector back to that vector and inducting on its orthogonal complement. For an arbitrary isometry, first reflect its image of zero back to zero, if necessary, and apply the orthogonal result. Affine reflection hyperplanes, rather than only hyperplanes through zero, are essential here.
For complementary vector subspaces of a real vector space, the rule is a well-defined linear map satisfying . It fixes pointwise and reverses . In a basis formed by adjoining bases of and , its matrix is . Conversely every real linear map with has this form, with and , as follows from .
In a Euclidean space, such a linear map is an orthogonal transformation if and only if and are perpendicular. Necessity follows from ; sufficiency follows by expanding the squared Euclidean norm of . In three dimensions, a fixed plane with reversed complementary line is a possibly oblique reflection, and a fixed line with reversed complementary plane is a possibly oblique axial symmetry. Their diagonal forms alone do not imply a Euclidean reflection in a hyperplane or a Euclidean half-turn.
Use the standard ordered basis for both maps. The reflection in a hyperplane interchanges the second and third coordinates, so its matrix is
Orient the rotation axis along and use the right-hand convention. The rotation matrix for angle sends to , to , and to . For example, the Rodrigues rotation formula gives
Multiplying the rotation matrix by the dilation factor gives
Direct multiplication gives , and . Hence . If the opposite axis orientation is chosen, also has cube . Independently of coordinates, two applications of the reflection give the identity, while three applications of the rotation-dilation give a full turn and dilation by . Every basis represents these resulting maps by and . Thus the equality even holds when the two matrices are expressed in different bases.
Let be the isometry. Since , it preserves norms, and the polarization identity applied to distances gives . For an orthonormal basis , the vectors are again an orthonormal basis, and
Expanding in that basis proves . Hence is a linear map represented by an orthogonal matrix .
A reflection in a hyperplane with nonzero normal is . If , choose . Because , substitution shows . If they agree, no reflection is needed. The resulting orthogonal transformation fixes and preserves its orthogonal complement. Apply the same construction there to fix ; the second normal is perpendicular to , so the first vector remains fixed. Finally the restriction to the remaining line is either the identity or negation; in the latter case a third reflection, normal to , fixes it. Reversing these steps writes as a product of at most three reflections, each in a plane through the origin. This proves the three-dimensional case of the Cartan–Dieudonné theorem.
Three reflections are sometimes necessary. The map is the product of the three coordinate-plane reflections. Its determinant is , excluding zero or two reflections. A single plane reflection fixes a two-dimensional vector subspace, whereas fixes only zero, excluding one. Thus the bound is sharp.
An orthogonal matrix satisfies , so it preserves the Euclidean norm. For a nonzero real eigenvector ,
Therefore . Geometrically, eigenvalue fixes every vector on the linear span of ; eigenvalue reverses every vector on that line. In either case the line is preserved as a set.
For , solving gives , , . For , the equations are and , hence . For , let and , so that . Then is equivalent to . The resulting eigenspaces and their bases are
Solving all the equations shows that these lists contain the maximum possible numbers of independent eigenvectors with eigenvalue .
The columns of form an orthonormal basis, so is an orthogonal matrix. Also . Its fixed axis is the line through , and on the perpendicular plane it acts as a two-dimensional rotation. If denotes the rotation angle, its matrix trace is . Since , we obtain . To fix the orientation relative to , note that and
The component of perpendicular to has squared length , and this scalar triple product equals . Hence . Thus
Equivalently, its unsigned angle is , or its positive angle is about the opposite oriented axis.
For , the reflection in a hyperplane formula gives
It fixes the plane pointwise and maps to , so . These actions also show that is an orthogonal matrix. In contrast, the second column of has squared length , so is not orthogonal and cannot represent either of these Euclidean motions.
A diagonalizable matrix must have a basis of eigenvectors over the field in question. For , a direct determinant computation gives . Its eigenvalues are , where . Only one is real, with one-dimensional eigenspace, so is not diagonalizable over . Over the three eigenvalues are distinct, and the vectors for give an eigenbasis. The upper triangular matrix has only eigenvalue , of algebraic multiplicity , but its eigenspace has dimension over either field. Hence is not diagonalizable over either field. For , the two real plane vectors displayed above, together with , form an eigenbasis, with eigenvalues . They remain independent over . Therefore
For unit , put . Then and , so is an orthogonal matrix. The affine reflection in a hyperplane is . Hence preserves the Euclidean norm and distance, and whenever . Thus it is an Euclidean isometry fixing the hyperplane pointwise.
For , any reflection exchanging them must have normal parallel to , and its fixed hyperplane must contain their midpoint. These requirements determine the perpendicular bisector uniquely:
Changing both signs of leaves the same reflection. It belongs to the orthogonal group exactly when its translation term vanishes, that is, . Since ,
To prove the finite reflection decomposition of a Euclidean isometry, first note that a distance-preserving map fixing zero preserves inner products by the polarization identity. Its values on an orthonormal basis form an orthonormal basis, and shows . Thus is orthogonal.
Every orthogonal transformation is a product of at most linear reflections: if , reflect to using the hyperplane normal , which passes through zero. The resulting orthogonal transformation fixes , and its restriction to is handled inductively in dimension . If , no initial reflection is necessary. Reflections on the complement extend by fixing ; the induction starts in dimension zero.
For an arbitrary isometry , if , first reflect to zero across its perpendicular bisector with zero. Composing this one affine reflection with gives an orthogonal transformation. If , skip the initial reflection. Therefore
The glide reflection cannot use fewer than three: its determinant sign is negative, excluding zero or two reflections, while absence of fixed points excludes a single reflection. Three suffice by reflecting successively in , , and .
Write . The reflection in a hyperplane orthogonal to sends
so
It acts as on and as on the three-dimensional hyperplane . Therefore
Let be the orthogonal projection onto the good linear subspace and write
where the two displayed states are normalized projections into and . Define the reflections
The amplitude amplification iterate preserves the good-bad plane, and its th iterate satisfies
Thus repeated reflections rotate amplitude toward the good subspace, reaching constant success probability after iterations.
Set . Unitary conjugation gives
The operator negates and fixes every vector in orthogonal to it. It is therefore the reflection in a hyperplane whose normal is .
In the ordered orthonormal basis
of , the Pauli Z gate acts as
It fixes the line and negates , so it is the reflection in a hyperplane orthogonal to the good state.
If , every has the decomposition
whose first term belongs to and second to . Their intersection is zero by ii, so is a direct sum. Choosing bases of the two eigenspaces gives a diagonal matrix with entries and .
Since while , we have . Thus is , , or . Reordering the basis gives exactly
For , is point inversion through the origin. For , it fixes the plane pointwise and reverses the complementary line : if in this direct sum, then . For , it fixes the line pointwise and reverses the complementary plane .
These are instances of oblique symmetry of complementary subspaces, allowing oblique eigenspaces. They are a Euclidean reflection in a hyperplane and a rotation in three dimensions through about a line, respectively, when the two eigenspaces are perpendicular. The hypotheses do not require an orthogonal transformation or an orthonormal basis, so that additional metric property cannot be inferred just from the displayed diagonal forms.