Projection (linear algebra)

Idempotent linear transformation from a vector space to itself

"Orthogonal projection" redirects here. For the technical drawing concept, see Orthographic projection. For a concrete discussion of orthogonal projections in finite-dimensional linear spaces, see Vector projection.

The transformation P is the orthogonal projection onto the line m.

In linear algebra and functional analysis, a projection is a linear transformation P {\displaystyle P} from a vector space to itself (an endomorphism) such that  P ∘ P = P {\displaystyle P\circ P=P} . That is, whenever  P {\displaystyle P} is applied twice to any vector, it gives the same result as if it were applied once (i.e.  P {\displaystyle P} is idempotent). It leaves its image unchanged.[1] This definition of "projection" formalizes and generalizes the idea of graphical projection. One can also consider the effect of a projection on a geometrical object by examining the effect of the projection on points in the object.

## Definitions

[edit]

A projection on a vector space  V {\displaystyle V} is a linear operator  P : V -> V {\displaystyle P\colon V\to V} such that  P 2 = P {\displaystyle P^{2}=P} .

When  V {\displaystyle V} has an inner product and is complete, i.e. when  V {\displaystyle V} is a Hilbert space, the concept of orthogonality can be used. A projection  P {\displaystyle P} on a Hilbert space  V {\displaystyle V} is called an orthogonal projection if it satisfies  ⟨ P x , y ⟩ = ⟨ x , P y ⟩ {\displaystyle \langle P\mathbf {x} ,\mathbf {y} \rangle =\langle \mathbf {x} ,P\mathbf {y} \rangle } for all  x , y ∈ V {\displaystyle \mathbf {x} ,\mathbf {y} \in V} . A projection on a Hilbert space that is not orthogonal is called an oblique projection.

### Projection matrix

[edit]

* A square matrix P {\displaystyle P} is called a projection matrix if it is equal to its square, i.e. if  P 2 = P {\displaystyle P^{2}=P} .[2]: p. 38
* A square matrix  P {\displaystyle P} is called an orthogonal projection matrix if  P 2 = P = P T {\displaystyle P^{2}=P=P^{\mathrm {T} }} for a real matrix, and respectively  P 2 = P = P ∗ {\displaystyle P^{2}=P=P^{*}} for a complex matrix, where  P T {\displaystyle P^{\mathrm {T} }} denotes the transpose of  P {\displaystyle P} and  P ∗ {\displaystyle P^{*}} denotes the adjoint or Hermitian transpose of  P {\displaystyle P} .[2]: p. 223
* A projection matrix that is not an orthogonal projection matrix is called an oblique projection matrix.

The eigenvalues of a projection matrix must be 0 or 1.

## Examples

[edit]

### Orthogonal projection

[edit]

For example, the function which maps the point  ( x , y , z ) {\displaystyle (x,y,z)} in three-dimensional space  R 3 {\displaystyle \mathbb {R} ^{3}} to the point  ( x , y , 0 ) {\displaystyle (x,y,0)} is an orthogonal projection onto the xy-plane. This function is represented by the matrix  P = [ 1 0 0 0 1 0 0 0 0 ] . {\displaystyle P={\begin{bmatrix}1&0&0\\\0&1&0\\\0&0&0\end{bmatrix}}.}

The action of this matrix on an arbitrary vector is  P [ x y z ] = [ x y 0 ] . {\displaystyle P{\begin{bmatrix}x\\\y\\\z\end{bmatrix}}={\begin{bmatrix}x\\\y\\\0\end{bmatrix}}.}

To see that  P {\displaystyle P} is indeed a projection, i.e.,  P = P 2 {\displaystyle P=P^{2}} , we compute  P 2 [ x y z ] = P [ x y 0 ] = [ x y 0 ] = P [ x y z ] . {\displaystyle P^{2}{\begin{bmatrix}x\\\y\\\z\end{bmatrix}}=P{\begin{bmatrix}x\\\y\\\0\end{bmatrix}}={\begin{bmatrix}x\\\y\\\0\end{bmatrix}}=P{\begin{bmatrix}x\\\y\\\z\end{bmatrix}}.}

Observing that  P T = P {\displaystyle P^{\mathrm {T} }=P} shows that the projection is an orthogonal projection.

### Oblique projection

[edit]

A simple example of a non-orthogonal (oblique) projection is  P = [ 0 0 α 1 ] . {\displaystyle P={\begin{bmatrix}0&0\\\\\alpha &1\end{bmatrix}}.}

Via matrix multiplication, one sees that  P 2 = [ 0 0 α 1 ] [ 0 0 α 1 ] = [ 0 0 α 1 ] = P . {\displaystyle P^{2}={\begin{bmatrix}0&0\\\\\alpha &1\end{bmatrix}}{\begin{bmatrix}0&0\\\\\alpha &1\end{bmatrix}}={\begin{bmatrix}0&0\\\\\alpha &1\end{bmatrix}}=P.} showing that  P {\displaystyle P} is indeed a projection.

The projection  P {\displaystyle P} is orthogonal if and only if α = 0 {\displaystyle \alpha =0} because only then  P T = P . {\displaystyle P^{\mathrm {T} }=P.}

## Properties and classification

[edit]

The transformation T is the projection along k onto m. The range of T is m and the kernel is k.

### Idempotence

[edit]

By definition, a projection  P {\displaystyle P} is idempotent (i.e.  P 2 = P {\displaystyle P^{2}=P} ).

### Open map

[edit]

Every projection is an open map onto its image, meaning that it maps each open set in the domain to an open set in the subspace topology of the image.[citation needed] That is, for any vector  x {\displaystyle \mathbf {x} } and any ball  B x {\displaystyle B_{\mathbf {x} }} (with positive radius) centered on  x {\displaystyle \mathbf {x} } , there exists a ball  B P x {\displaystyle B_{P\mathbf {x} }} (with positive radius) centered on  P x {\displaystyle P\mathbf {x} } that is wholly contained in the image  P ( B x ) {\displaystyle P(B_{\mathbf {x} })} .

### Complementarity of image and kernel

[edit]

Let  W {\displaystyle W} be a finite-dimensional vector space and  P {\displaystyle P} be a projection on  W {\displaystyle W} . Suppose the subspaces U {\displaystyle U} and  V {\displaystyle V} are the image and kernel of  P {\displaystyle P} respectively. Then  P {\displaystyle P} has the following properties:

1. P {\displaystyle P} is the identity operator I {\displaystyle I} on  U {\displaystyle U} :  ∀ x ∈ U : P x = x . {\displaystyle \forall \mathbf {x} \in U:P\mathbf {x} =\mathbf {x} .}
2. We have a direct sum W = U ⊕ V {\displaystyle W=U\oplus V} . Every vector  x ∈ W {\displaystyle \mathbf {x} \in W} may be decomposed uniquely as  x = u + v {\displaystyle \mathbf {x} =\mathbf {u} +\mathbf {v} } with  u = P x {\displaystyle \mathbf {u} =P\mathbf {x} } and  v = x − P x = ( I − P ) x {\displaystyle \mathbf {v} =\mathbf {x} -P\mathbf {x} =\left(I-P\right)\mathbf {x} } , and where  u ∈ U , v ∈ V . {\displaystyle \mathbf {u} \in U,\mathbf {v} \in V.}

The image and kernel of a projection are complementary, as are  P {\displaystyle P} and  Q = I − P {\displaystyle Q=I-P} . The operator  Q {\displaystyle Q} is also a projection as the image and kernel of  P {\displaystyle P} become the kernel and image of  Q {\displaystyle Q} and vice versa. We say  P {\displaystyle P} is a projection along  V {\displaystyle V} onto  U {\displaystyle U} (kernel/image) and  Q {\displaystyle Q} is a projection along  U {\displaystyle U} onto  V {\displaystyle V} .

### Spectrum

[edit]

In infinite-dimensional vector spaces, the spectrum of a projection is contained in  { 0 , 1 } {\displaystyle \\{0,1\\}} as  ( λ I − P ) − 1 = 1 λ I + 1 λ ( λ − 1 ) P . {\displaystyle (\lambda I-P)^{-1}={\frac {1}{\lambda }}I+{\frac {1}{\lambda (\lambda -1)}}P.} Only 0 or 1 can be an eigenvalue of a projection. This implies that an orthogonal projection  P {\displaystyle P} is always a positive semi-definite matrix. In general, the corresponding eigenspaces are (respectively) the kernel and range of the projection. Decomposition of a vector space into direct sums is not unique. Therefore, given a subspace  V {\displaystyle V} , there may be many projections whose range (or kernel) is  V {\displaystyle V} .

If a projection is nontrivial it has minimal polynomial x 2 − x = x ( x − 1 ) {\displaystyle x^{2}-x=x(x-1)} , which factors into distinct linear factors, and thus  P {\displaystyle P} is diagonalizable.

### Product of projections

[edit]

The product of projections is not in general a projection, even if they are orthogonal. If two projections commute then their product is a projection, but the converse is false: the product of two non-commuting projections may or may not be a projection.

If two orthogonal projections commute then their product is an orthogonal projection. If the product of two orthogonal projections is an orthogonal projection, then the two orthogonal projections commute (more generally: two self-adjoint endomorphisms commute if and only if their product is self-adjoint).

### Orthogonal projections

[edit]

Main articles: Hilbert projection theorem and Complemented subspace

When the vector space  W {\displaystyle W} has an inner product and is complete (is a Hilbert space) the concept of orthogonality can be used. An orthogonal projection is a projection for which the range  U {\displaystyle U} and the kernel  V {\displaystyle V} are orthogonal subspaces. Thus, for every  x {\displaystyle \mathbf {x} } and  y {\displaystyle \mathbf {y} } in  W {\displaystyle W} ,  ⟨ P x , ( y − P y ) ⟩ = ⟨ ( x − P x ) , P y ⟩ = 0 {\displaystyle \langle P\mathbf {x} ,(\mathbf {y} -P\mathbf {y} )\rangle =\langle (\mathbf {x} -P\mathbf {x} ),P\mathbf {y} \rangle =0} . Equivalently:  ⟨ x , P y ⟩ = ⟨ P x , P y ⟩ = ⟨ P x , y ⟩ . {\displaystyle \langle \mathbf {x} ,P\mathbf {y} \rangle =\langle P\mathbf {x} ,P\mathbf {y} \rangle =\langle P\mathbf {x} ,\mathbf {y} \rangle .}

A projection is orthogonal if and only if it is self-adjoint. Using the self-adjoint and idempotent properties of  P {\displaystyle P} , for any  x {\displaystyle \mathbf {x} } and  y {\displaystyle \mathbf {y} } in  W {\displaystyle W} we have  P x ∈ U {\displaystyle P\mathbf {x} \in U} ,  y − P y ∈ V {\displaystyle \mathbf {y} -P\mathbf {y} \in V} , and  ⟨ P x , y − P y ⟩ = ⟨ x , ( P − P 2 ) y ⟩ = 0 {\displaystyle \langle P\mathbf {x} ,\mathbf {y} -P\mathbf {y} \rangle =\langle \mathbf {x} ,\left(P-P^{2}\right)\mathbf {y} \rangle =0} where  ⟨ ⋅ , ⋅ ⟩ {\displaystyle \langle \cdot ,\cdot \rangle } is the inner product associated with  W {\displaystyle W} . Therefore,  P {\displaystyle P} and  I − P {\displaystyle I-P} are orthogonal projections.[3] The other direction, namely that if  P {\displaystyle P} is orthogonal then it is self-adjoint, follows from the implication from  ⟨ ( x − P x ) , P y ⟩ = ⟨ P x , ( y − P y ) ⟩ = 0 {\displaystyle \langle (\mathbf {x} -P\mathbf {x} ),P\mathbf {y} \rangle =\langle P\mathbf {x} ,(\mathbf {y} -P\mathbf {y} )\rangle =0} to  ⟨ x , P y ⟩ = ⟨ P x , P y ⟩ = ⟨ P x , y ⟩ = ⟨ x , P ∗ y ⟩ {\displaystyle \langle \mathbf {x} ,P\mathbf {y} \rangle =\langle P\mathbf {x} ,P\mathbf {y} \rangle =\langle P\mathbf {x} ,\mathbf {y} \rangle =\langle \mathbf {x} ,P^{*}\mathbf {y} \rangle } for every  x {\displaystyle x} and  y {\displaystyle y} in  W {\displaystyle W} ; thus  P = P ∗ {\displaystyle P=P^{*}} .

The existence of an orthogonal projection onto a closed subspace follows from the Hilbert projection theorem.

#### Properties and special cases

[edit]

An orthogonal projection is a bounded operator. This is because for every  v {\displaystyle \mathbf {v} } in the vector space we have, by the Cauchy–Schwarz inequality:  ‖ P v ‖ 2 = ⟨ P v , P v ⟩ = ⟨ P v , v ⟩ ≤ ‖ P v ‖ ⋅ ‖ v ‖ {\displaystyle \left\|P\mathbf {v} \right\|^{2}=\langle P\mathbf {v} ,P\mathbf {v} \rangle =\langle P\mathbf {v} ,\mathbf {v} \rangle \leq \left\|P\mathbf {v} \right\|\cdot \left\|\mathbf {v} \right\|} Thus  ‖ P v ‖ ≤ ‖ v ‖ {\displaystyle \left\|P\mathbf {v} \right\|\leq \left\|\mathbf {v} \right\|} .

For finite-dimensional complex or real vector spaces, the standard inner product can be substituted for  ⟨ ⋅ , ⋅ ⟩ {\displaystyle \langle \cdot ,\cdot \rangle } .

##### Formulas

[edit]

A simple case occurs when the orthogonal projection is onto a line. If  u {\displaystyle \mathbf {u} } is a unit vector on the line, then the projection is given by the outer product P u = u u T . {\displaystyle P_{\mathbf {u} }=\mathbf {u} \mathbf {u} ^{\mathsf {T}}.} (If  u {\displaystyle \mathbf {u} } is complex-valued, the transpose in the above equation is replaced by a Hermitian transpose). This operator leaves u invariant, and it annihilates all vectors orthogonal to  u {\displaystyle \mathbf {u} } , proving that it is indeed the orthogonal projection onto the line containing u.[4] A simple way to see this is to consider an arbitrary vector  x {\displaystyle \mathbf {x} } as the sum of a component on the line (i.e. the projected vector we seek) and another perpendicular to it,  x = x ∥ + x ⊥ {\displaystyle \mathbf {x} =\mathbf {x} _{\parallel }+\mathbf {x} _{\perp }} . Applying projection, we get  P u x = u u T x ∥ + u u T x ⊥ = u ( sgn ⁡ ( u T x ∥ ) ‖ x ∥ ‖ ) + u ⋅ 0 = x ∥ {\displaystyle P_{\mathbf {u} }\mathbf {x} =\mathbf {u} \mathbf {u} ^{\mathsf {T}}\mathbf {x} _{\parallel }+\mathbf {u} \mathbf {u} ^{\mathsf {T}}\mathbf {x} _{\perp }=\mathbf {u} \left(\operatorname {sgn} \left(\mathbf {u} ^{\mathsf {T}}\mathbf {x} _{\parallel }\right)\left\|\mathbf {x} _{\parallel }\right\|\right)+\mathbf {u} \cdot \mathbf {0} =\mathbf {x} _{\parallel }} by the properties of the dot product of parallel and perpendicular vectors.

This formula can be generalized to orthogonal projections on a subspace of arbitrary dimension. Let  u 1 , … , u k {\displaystyle \mathbf {u} _{1},\ldots ,\mathbf {u} _{k}} be an orthonormal basis of the subspace  U {\displaystyle U} , with the assumption that the integer  k ≥ 1 {\displaystyle k\geq 1} , and let  A {\displaystyle A} denote the  n × k {\displaystyle n\times k} matrix whose columns are  u 1 , … , u k {\displaystyle \mathbf {u} _{1},\ldots ,\mathbf {u} _{k}} , i.e.,  A = [ u 1 ⋯ u k ] {\displaystyle A={\begin{bmatrix}\mathbf {u} _{1}&\cdots &\mathbf {u} _{k}\end{bmatrix}}} . Then the projection is given by:[5] P A = A A T {\displaystyle P_{A}=AA^{\mathsf {T}}} which can be rewritten as  P A = ∑ i ⟨ u i , ⋅ ⟩ u i . {\displaystyle P_{A}=\sum _{i}\langle \mathbf {u} _{i},\cdot \rangle \mathbf {u} _{i}.}

The matrix  A T {\displaystyle A^{\mathsf {T}}} is the partial isometry that vanishes on the orthogonal complement of  U {\displaystyle U} , and  A {\displaystyle A} is the isometry that embeds  U {\displaystyle U} into the underlying vector space. The range of  P A {\displaystyle P_{A}} is therefore the final space of  A {\displaystyle A} . It is also clear that  A A T {\displaystyle AA^{\mathsf {T}}} is the identity operator on  U {\displaystyle U} .

The orthonormality condition can also be dropped. If  u 1 , … , u k {\displaystyle \mathbf {u} _{1},\ldots ,\mathbf {u} _{k}} is a (not necessarily orthonormal) basis with  k ≥ 1 {\displaystyle k\geq 1} , and  A {\displaystyle A} is the matrix with these vectors as columns, then the projection is:[6][7] P A = A ( A T A ) − 1 A T . {\displaystyle P_{A}=A\left(A^{\mathsf {T}}A\right)^{-1}A^{\mathsf {T}}.}

The matrix  A {\displaystyle A} still embeds  U {\displaystyle U} into the underlying vector space but is no longer an isometry in general. The matrix  ( A T A ) − 1 {\displaystyle \left(A^{\mathsf {T}}A\right)^{-1}} is a "normalizing factor" that recovers the norm. For example, the rank-1 operator  u u T {\displaystyle \mathbf {u} \mathbf {u} ^{\mathsf {T}}} is not a projection if  ‖ u ‖ ≠ 1. {\displaystyle \left\|\mathbf {u} \right\|\neq 1.} After dividing by  u T u = ‖ u ‖ 2 , {\displaystyle \mathbf {u} ^{\mathsf {T}}\mathbf {u} =\left\|\mathbf {u} \right\|^{2},} we obtain the projection  u ( u T u ) − 1 u T {\displaystyle \mathbf {u} \left(\mathbf {u} ^{\mathsf {T}}\mathbf {u} \right)^{-1}\mathbf {u} ^{\mathsf {T}}} onto the subspace spanned by  u {\displaystyle u} .

In the general case, we can have an arbitrary positive definite matrix  D {\displaystyle D} defining an inner product  ⟨ x , y ⟩ D = y † D x {\displaystyle \langle x,y\rangle _{D}=y^{\dagger }Dx} , and the projection  P A {\displaystyle P_{A}} is given by  P A x = argmin y ∈ range ⁡ ( A ) ⁡ ‖ x − y ‖ D 2 {\textstyle P_{A}x=\operatorname {argmin} _{y\in \operatorname {range} (A)}\left\|x-y\right\|_{D}^{2}} . Then  P A = A ( A T D A ) − 1 A T D . {\displaystyle P_{A}=A\left(A^{\mathsf {T}}DA\right)^{-1}A^{\mathsf {T}}D.}

When the range space of the projection is generated by a frame (i.e. the number of generators is greater than its dimension), the formula for the projection takes the form:  P A = A A + {\displaystyle P_{A}=AA^{+}} . Here  A + {\displaystyle A^{+}} stands for the Moore–Penrose pseudoinverse. This is just one of many ways to construct the projection operator.

If  [ A B ] {\displaystyle {\begin{bmatrix}A&B\end{bmatrix}}} is a non-singular matrix and  A T B = 0 {\displaystyle A^{\mathsf {T}}B=0} (i.e.,  B {\displaystyle B} is the null space matrix of  A {\displaystyle A} ),[8] the following holds:  I = [ A B ] [ A B ] − 1 [ A T B T ] − 1 [ A T B T ] = [ A B ] ( [ A T B T ] [ A B ] ) − 1 [ A T B T ] = [ A B ] [ A T A O O B T B ] − 1 [ A T B T ] = A ( A T A ) − 1 A T + B ( B T B ) − 1 B T {\displaystyle {\begin{aligned}I&={\begin{bmatrix}A&B\end{bmatrix}}{\begin{bmatrix}A&B\end{bmatrix}}^{-1}{\begin{bmatrix}A^{\mathsf {T}}\\\B^{\mathsf {T}}\end{bmatrix}}^{-1}{\begin{bmatrix}A^{\mathsf {T}}\\\B^{\mathsf {T}}\end{bmatrix}}\\\&={\begin{bmatrix}A&B\end{bmatrix}}\left({\begin{bmatrix}A^{\mathsf {T}}\\\B^{\mathsf {T}}\end{bmatrix}}{\begin{bmatrix}A&B\end{bmatrix}}\right)^{-1}{\begin{bmatrix}A^{\mathsf {T}}\\\B^{\mathsf {T}}\end{bmatrix}}\\\&={\begin{bmatrix}A&B\end{bmatrix}}{\begin{bmatrix}A^{\mathsf {T}}A&O\\\O&B^{\mathsf {T}}B\end{bmatrix}}^{-1}{\begin{bmatrix}A^{\mathsf {T}}\\\B^{\mathsf {T}}\end{bmatrix}}\\\\[4pt]&=A\left(A^{\mathsf {T}}A\right)^{-1}A^{\mathsf {T}}+B\left(B^{\mathsf {T}}B\right)^{-1}B^{\mathsf {T}}\end{aligned}}}

If the orthogonal condition is enhanced to  A T W B = A T W T B = 0 {\displaystyle A^{\mathsf {T}}WB=A^{\mathsf {T}}W^{\mathsf {T}}B=0} with  W {\displaystyle W} non-singular, the following holds:  I = [ A B ] [ ( A T W A ) − 1 A T ( B T W B ) − 1 B T ] W . {\displaystyle I={\begin{bmatrix}A&B\end{bmatrix}}{\begin{bmatrix}\left(A^{\mathsf {T}}WA\right)^{-1}A^{\mathsf {T}}\\\\\left(B^{\mathsf {T}}WB\right)^{-1}B^{\mathsf {T}}\end{bmatrix}}W.}

All these formulas also hold for complex inner product spaces, provided that the conjugate transpose is used instead of the transpose. Further details on sums of projectors can be found in Banerjee and Roy (2014).[9] Also see Banerjee (2004)[10] for application of sums of projectors in basic spherical trigonometry.

### Oblique projections

[edit]

The term oblique projections is sometimes used to refer to non-orthogonal projections. These projections are also used to represent spatial figures in two-dimensional drawings (see oblique projection), though not as frequently as orthogonal projections. Whereas calculating the fitted value of an ordinary least squares regression requires an orthogonal projection, calculating the fitted value of an instrumental variables regression requires an oblique projection.

A projection is defined by its kernel and the basis vectors used to characterize its range (which is a complement of the kernel). When these basis vectors are orthogonal to the kernel, then the projection is an orthogonal projection. When these basis vectors are not orthogonal to the kernel, the projection is an oblique projection, or just a projection.

#### A matrix representation formula for a nonzero projection operator

[edit]

Let  P : V -> V {\displaystyle P\colon V\to V} be a linear operator such that  P 2 = P {\displaystyle P^{2}=P} and assume that  P {\displaystyle P} is not the zero operator. Let the vectors  u 1 , … , u k {\displaystyle \mathbf {u} _{1},\ldots ,\mathbf {u} _{k}} form a basis for the range of  P {\displaystyle P} , and assemble these vectors in the  n × k {\displaystyle n\times k} matrix  A {\displaystyle A} . Then  k ≥ 1 {\displaystyle k\geq 1} , otherwise  k = 0 {\displaystyle k=0} and  P {\displaystyle P} is the zero operator. The range and the kernel are complementary spaces, so the kernel has dimension  n − k {\displaystyle n-k} . It follows that the orthogonal complement of the kernel has dimension  k {\displaystyle k} . Let  v 1 , … , v k {\displaystyle \mathbf {v} _{1},\ldots ,\mathbf {v} _{k}} form a basis for the orthogonal complement of the kernel of the projection, and assemble these vectors in the matrix  B {\displaystyle B} . Then the projection  P {\displaystyle P} (with the condition  k ≥ 1 {\displaystyle k\geq 1} ) is given by  P = A ( B T A ) − 1 B T . {\displaystyle P=A\left(B^{\mathsf {T}}A\right)^{-1}B^{\mathsf {T}}.}

This expression generalizes the formula for orthogonal projections given above.[11][12] A standard proof of this expression is the following. For any vector  x {\displaystyle \mathbf {x} } in the vector space  V {\displaystyle V} , we can decompose  x = x 1 + x 2 {\displaystyle \mathbf {x} =\mathbf {x} _{1}+\mathbf {x} _{2}} , where vector  x 1 = P ( x ) {\displaystyle \mathbf {x} _{1}=P(\mathbf {x} )} is in the image of  P {\displaystyle P} , and vector  x 2 = x − P ( x ) . {\displaystyle \mathbf {x} _{2}=\mathbf {x} -P(\mathbf {x} ).} So  P ( x 2 ) = P ( x ) − P 2 ( x ) = 0 {\displaystyle P(\mathbf {x} _{2})=P(\mathbf {x} )-P^{2}(\mathbf {x} )=\mathbf {0} } , and then  x 2 {\displaystyle \mathbf {x} _{2}} is in the kernel of  P {\displaystyle P} , which is the null space of  A . {\displaystyle A.} In other words, the vector  x 1 {\displaystyle \mathbf {x} _{1}} is in the column space of  A , {\displaystyle A,} so  x 1 = A w {\displaystyle \mathbf {x} _{1}=A\mathbf {w} } for some  k {\displaystyle k} dimension vector  w {\displaystyle \mathbf {w} } and the vector  x 2 {\displaystyle \mathbf {x} _{2}} satisfies  B T x 2 = 0 {\displaystyle B^{\mathsf {T}}\mathbf {x} _{2}=\mathbf {0} } by the construction of  B {\displaystyle B} . Put these conditions together, and we find a vector  w {\displaystyle \mathbf {w} } so that  B T ( x − A w ) = 0 {\displaystyle B^{\mathsf {T}}(\mathbf {x} -A\mathbf {w} )=\mathbf {0} } . Since matrices  A {\displaystyle A} and  B {\displaystyle B} are of full rank  k {\displaystyle k} by their construction, the  k × k {\displaystyle k\times k} -matrix  B T A {\displaystyle B^{\mathsf {T}}A} is invertible. So the equation  B T ( x − A w ) = 0 {\displaystyle B^{\mathsf {T}}(\mathbf {x} -A\mathbf {w} )=\mathbf {0} } gives the vector  w = ( B T A ) − 1 B T x . {\displaystyle \mathbf {w} =(B^{\mathsf {T}}A)^{-1}B^{\mathsf {T}}\mathbf {x} .} In this way,  P x = x 1 = A w = A ( B T A ) − 1 B T x {\displaystyle P\mathbf {x} =\mathbf {x} _{1}=A\mathbf {w} =A(B^{\mathsf {T}}A)^{-1}B^{\mathsf {T}}\mathbf {x} } for any vector  x ∈ V {\displaystyle \mathbf {x} \in V} and hence  P = A ( B T A ) − 1 B T {\displaystyle P=A(B^{\mathsf {T}}A)^{-1}B^{\mathsf {T}}} .

In the case that  P {\displaystyle P} is an orthogonal projection, we can take  A = B {\displaystyle A=B} , and it follows that  P = A ( A T A ) − 1 A T {\displaystyle P=A\left(A^{\mathsf {T}}A\right)^{-1}A^{\mathsf {T}}} . By using this formula, one can easily check that  P = P T {\displaystyle P=P^{\mathsf {T}}} . In general, if the vector space is over complex number field, one then uses the Hermitian transpose A ∗ {\displaystyle A^{*}} and has the formula  P = A ( A ∗ A ) − 1 A ∗ {\displaystyle P=A\left(A^{*}A\right)^{-1}A^{*}} . Recall that one can express the Moore–Penrose inverse of the matrix  A {\displaystyle A} by  A + = ( A ∗ A ) − 1 A ∗ {\displaystyle A^{+}=(A^{*}A)^{-1}A^{*}} since  A {\displaystyle A} has full column rank, so  P = A A + {\displaystyle P=AA^{+}} .

#### Singular values

[edit]

I − P {\displaystyle I-P} is also an oblique projection. The singular values of  P {\displaystyle P} and  I − P {\displaystyle I-P} can be computed by an orthonormal basis of  A {\displaystyle A} . Let  Q A {\displaystyle Q_{A}} be an orthonormal basis of  A {\displaystyle A} and let  Q A ⊥ {\displaystyle Q_{A}^{\perp }} be the orthogonal complement of  Q A {\displaystyle Q_{A}} . Denote the singular values of the matrix  Q A T A ( B T A ) − 1 B T Q A ⊥ {\displaystyle Q_{A}^{T}A(B^{T}A)^{-1}B^{T}Q_{A}^{\perp }} by the positive values  γ 1 ≥ γ 2 ≥ … ≥ γ k {\displaystyle \gamma _{1}\geq \gamma _{2}\geq \ldots \geq \gamma _{k}} . With this, the singular values for  P {\displaystyle P} are:[13] σ i = { 1 + γ i 2 1 ≤ i ≤ k 0 otherwise {\displaystyle \sigma _{i}={\begin{cases}{\sqrt {1+\gamma _{i}^{2}}}&1\leq i\leq k\\\0&{\text{otherwise}}\end{cases}}} and the singular values for  I − P {\displaystyle I-P} are  σ i = { 1 + γ i 2 1 ≤ i ≤ k 1 k + 1 ≤ i ≤ n − k 0 otherwise {\displaystyle \sigma _{i}={\begin{cases}{\sqrt {1+\gamma _{i}^{2}}}&1\leq i\leq k\\\1&k+1\leq i\leq n-k\\\0&{\text{otherwise}}\end{cases}}} This implies that the largest singular values of  P {\displaystyle P} and  I − P {\displaystyle I-P} are equal, and thus that the matrix norm of the oblique projections are the same. However, the condition number satisfies the relation  κ ( I − P ) = σ 1 1 ≥ σ 1 σ k = κ ( P ) {\displaystyle \kappa (I-P)={\frac {\sigma _{1}}{1}}\geq {\frac {\sigma _{1}}{\sigma _{k}}}=\kappa (P)} , and is therefore not necessarily equal.

### Finding projection with an inner product

[edit]

Let  V {\displaystyle V} be a vector space (in this case a plane) spanned by orthogonal vectors  u 1 , u 2 , … , u p {\displaystyle \mathbf {u} _{1},\mathbf {u} _{2},\dots ,\mathbf {u} _{p}} . Let  y {\displaystyle y} be a vector. One can define a projection of  y {\displaystyle \mathbf {y} } onto  V {\displaystyle V} as  proj V ⁡ y = y ⋅ u i u i ⋅ u i u i {\displaystyle \operatorname {proj} _{V}\mathbf {y} ={\frac {\mathbf {y} \cdot \mathbf {u} ^{i}}{\mathbf {u} ^{i}\cdot \mathbf {u} ^{i}}}\mathbf {u} ^{i}} where repeated indices are summed over (Einstein sum notation). The vector  y {\displaystyle \mathbf {y} } can be written as an orthogonal sum such that  y = proj V ⁡ y + z {\displaystyle \mathbf {y} =\operatorname {proj} _{V}\mathbf {y} +\mathbf {z} } .  proj V ⁡ y {\displaystyle \operatorname {proj} _{V}\mathbf {y} } is sometimes denoted as  y ^ {\displaystyle {\hat {\mathbf {y} }}} . There is a theorem in linear algebra that states that this  z {\displaystyle \mathbf {z} } is the smallest distance (the orthogonal distance) from  y {\displaystyle \mathbf {y} } to  V {\displaystyle V} and is commonly used in areas such as machine learning.

y is being projected onto the vector space V.

## Canonical forms

[edit]

Any projection  P = P 2 {\displaystyle P=P^{2}} on a vector space of dimension  d {\displaystyle d} over a field is a diagonalizable matrix, since its minimal polynomial divides  x 2 − x {\displaystyle x^{2}-x} , which splits into distinct linear factors. Thus there exists a basis in which  P {\displaystyle P} has the form

P = I r ⊕ 0 d − r {\displaystyle P=I_{r}\oplus 0_{d-r}}

where  r {\displaystyle r} is the rank of  P {\displaystyle P} . Here  I r {\displaystyle I_{r}} is the identity matrix of size  r {\displaystyle r} ,  0 d − r {\displaystyle 0_{d-r}} is the zero matrix of size  d − r {\displaystyle d-r} , and  ⊕ {\displaystyle \oplus } is the direct sum operator. If the vector space is complex and equipped with an inner product, then there is an orthonormal basis in which the matrix of P is[14]

P = [ 1 σ 1 0 0 ] ⊕ ⋯ ⊕ [ 1 σ k 0 0 ] ⊕ I m ⊕ 0 s . {\displaystyle P={\begin{bmatrix}1&\sigma _{1}\\\0&0\end{bmatrix}}\oplus \cdots \oplus {\begin{bmatrix}1&\sigma _{k}\\\0&0\end{bmatrix}}\oplus I_{m}\oplus 0_{s}.}

where  σ 1 ≥ σ 2 ≥ ⋯ ≥ σ k > 0 {\displaystyle \sigma _{1}\geq \sigma _{2}\geq \dots \geq \sigma _{k}>0} . The integers k , s , m {\displaystyle k,s,m} and the real numbers  σ i {\displaystyle \sigma _{i}} are uniquely determined.  2 k + s + m = d {\displaystyle 2k+s+m=d} . The factor  I m ⊕ 0 s {\displaystyle I_{m}\oplus 0_{s}} corresponds to the maximal invariant subspace on which  P {\displaystyle P} acts as an orthogonal projection (so that P itself is orthogonal if and only if  k = 0 {\displaystyle k=0} ) and the  σ i {\displaystyle \sigma _{i}} -blocks correspond to the oblique components.

## Projections on normed vector spaces

[edit]

When the underlying vector space  X {\displaystyle X} is a (not necessarily finite-dimensional) normed vector space, analytic questions, irrelevant in the finite-dimensional case, need to be considered. Assume now  X {\displaystyle X} is a Banach space.

Many of the algebraic results discussed above survive the passage to this context. A given direct sum decomposition of  X {\displaystyle X} into complementary subspaces still specifies a projection, and vice versa. If  X {\displaystyle X} is the direct sum  X = U ⊕ V {\displaystyle X=U\oplus V} , then the operator defined by  P ( u + v ) = u {\displaystyle P(u+v)=u} is still a projection with range  U {\displaystyle U} and kernel  V {\displaystyle V} . It is also clear that  P 2 = P {\displaystyle P^{2}=P} . Conversely, if  P {\displaystyle P} is projection on  X {\displaystyle X} , i.e.  P 2 = P {\displaystyle P^{2}=P} , then it is easily verified that  ( 1 − P ) 2 = ( 1 − P ) {\displaystyle (1-P)^{2}=(1-P)} . In other words,  1 − P {\displaystyle 1-P} is also a projection. The relation  P 2 = P {\displaystyle P^{2}=P} implies  1 = P + ( 1 − P ) {\displaystyle 1=P+(1-P)} and  X {\displaystyle X} is the direct sum  rg ⁡ ( P ) ⊕ rg ⁡ ( 1 − P ) {\displaystyle \operatorname {rg} (P)\oplus \operatorname {rg} (1-P)} .

However, in contrast to the finite-dimensional case, projections need not be continuous in general. If a subspace  U {\displaystyle U} of  X {\displaystyle X} is not closed in the norm topology, then the projection onto  U {\displaystyle U} is not continuous. In other words, the range of a continuous projection  P {\displaystyle P} must be a closed subspace. Furthermore, the kernel of a continuous projection (in fact, a continuous linear operator in general) is closed. Thus a continuous projection  P {\displaystyle P} gives a decomposition of  X {\displaystyle X} into two complementary closed subspaces:  X = rg ⁡ ( P ) ⊕ ker ⁡ ( P ) = ker ⁡ ( 1 − P ) ⊕ ker ⁡ ( P ) {\displaystyle X=\operatorname {rg} (P)\oplus \ker(P)=\ker(1-P)\oplus \ker(P)} .

The converse holds also, with an additional assumption. Suppose  U {\displaystyle U} is a closed subspace of  X {\displaystyle X} . If there exists a closed subspace  V {\displaystyle V} such that X = U ⊕ V, then the projection  P {\displaystyle P} with range  U {\displaystyle U} and kernel  V {\displaystyle V} is continuous. This follows from the closed graph theorem. Suppose xn → x and Pxn → y. One needs to show that  P x = y {\displaystyle Px=y} . Since  U {\displaystyle U} is closed and {Pxn} ⊂ U, y lies in  U {\displaystyle U} , i.e. Py = y. Also, xn − Pxn = (I − P)xn → x − y. Because  V {\displaystyle V} is closed and {(I − P)xn} ⊂ V, we have  x − y ∈ V {\displaystyle x-y\in V} , i.e.  P ( x − y ) = P x − P y = P x − y = 0 {\displaystyle P(x-y)=Px-Py=Px-y=0} , which proves the claim.

The above argument makes use of the assumption that both  U {\displaystyle U} and  V {\displaystyle V} are closed. In general, given a closed subspace  U {\displaystyle U} , there need not exist a complementary closed subspace  V {\displaystyle V} , although for Hilbert spaces this can always be done by taking the orthogonal complement. For Banach spaces, a one-dimensional subspace always has a closed complementary subspace. This is an immediate consequence of Hahn–Banach theorem. Let  U {\displaystyle U} be the linear span of  u {\displaystyle u} . By Hahn–Banach, there exists a bounded linear functional φ {\displaystyle \varphi } such that φ(u) = 1. The operator  P ( x ) = φ ( x ) u {\displaystyle P(x)=\varphi (x)u} satisfies  P 2 = P {\displaystyle P^{2}=P} , i.e. it is a projection. Boundedness of  φ {\displaystyle \varphi } implies continuity of  P {\displaystyle P} and therefore  ker ⁡ ( P ) = rg ⁡ ( I − P ) {\displaystyle \ker(P)=\operatorname {rg} (I-P)} is a closed complementary subspace of  U {\displaystyle U} .

## Applications and further considerations

[edit]

Projections (orthogonal and otherwise) play a major role in algorithms for certain linear algebra problems:

* QR decomposition (see Householder transformation and Gram–Schmidt decomposition);
* Singular value decomposition
* Reduction to Hessenberg form (the first step in many eigenvalue algorithms)
* Linear regression
* Projective elements of matrix algebras are used in the construction of certain K-groups in Operator K-theory

As stated above, projections are a special case of idempotents. Analytically, orthogonal projections are non-commutative generalizations of characteristic functions. Idempotents are used in classifying, for instance, semisimple algebras, while measure theory begins with considering characteristic functions of measurable sets. Therefore, as one can imagine, projections are very often encountered in the context of operator algebras. In particular, a von Neumann algebra is generated by its complete lattice of projections.

## Generalizations

[edit]

More generally, given a map between normed vector spaces  T : V -> W , {\displaystyle T\colon V\to W,} one can analogously ask for this map to be an isometry on the orthogonal complement of the kernel: that  ( ker ⁡ T ) ⊥ -> W {\displaystyle (\ker T)^{\perp }\to W} be an isometry (compare Partial isometry); in particular it must be onto. The case of an orthogonal projection is when W is a subspace of V. In Riemannian geometry, this is used in the definition of a Riemannian submersion.

## See also

[edit]

* Centering matrix, which is an example of a projection matrix.
* Dykstra's projection algorithm to compute the projection onto an intersection of sets
* Invariant subspace
* Least-squares spectral analysis
* Orthogonalization
* Properties of trace

## Notes

[edit]

1. ^ Meyer, pp 386+387
2. ^ a b Horn, Roger A.; Johnson, Charles R. (2013). Matrix Analysis, second edition. Cambridge University Press. ISBN 9780521839402.
3. ^ Meyer, p. 433
4. ^ Meyer, p. 431
5. ^ Meyer, equation (5.13.4)
6. ^ Banerjee, Sudipto; Roy, Anindya (2014), Linear Algebra and Matrix Analysis for Statistics, Texts in Statistical Science (1st ed.), Chapman and Hall/CRC, ISBN 978-1420095388
7. ^ Meyer, equation (5.13.3)
8. ^ See also Linear least squares (mathematics) § Properties of the least-squares estimators.
9. ^ Banerjee, Sudipto; Roy, Anindya (2014), Linear Algebra and Matrix Analysis for Statistics, Texts in Statistical Science (1st ed.), Chapman and Hall/CRC, ISBN 978-1420095388
10. ^ Banerjee, Sudipto (2004), "Revisiting Spherical Trigonometry with Orthogonal Projectors", The College Mathematics Journal, 35 (5): 375–381, doi:10.1080/07468342.2004.11922099, S2CID 122277398
11. ^ Banerjee, Sudipto; Roy, Anindya (2014), Linear Algebra and Matrix Analysis for Statistics, Texts in Statistical Science (1st ed.), Chapman and Hall/CRC, ISBN 978-1420095388
12. ^ Meyer, equation (7.10.39)
13. ^ Brust, J. J.; Marcia, R. F.; Petra, C. G. (2020), "Computationally Efficient Decompositions of Oblique Projection Matrices", SIAM Journal on Matrix Analysis and Applications, 41 (2): 852–870, doi:10.1137/19M1288115, OSTI 1680061, S2CID 219921214
14. ^ Doković, D. Ž. (August 1991). "Unitary similarity of projectors". Aequationes Mathematicae. 42 (1): 220–224\. doi:10.1007/BF01818492. S2CID 122704926.

## References

[edit]

* Banerjee, Sudipto; Roy, Anindya (2014), Linear Algebra and Matrix Analysis for Statistics, Texts in Statistical Science (1st ed.), Chapman and Hall/CRC, ISBN 978-1420095388
* Dunford, N.; Schwartz, J. T. (1958). Linear Operators, Part I: General Theory. Interscience.
* Meyer, Carl D. (2000). Matrix Analysis and Applied Linear Algebra. Society for Industrial and Applied Mathematics. ISBN 978-0-89871-454-8.
* Brezinski, Claude: Projection Methods for Systems of Equations, North-Holland, ISBN 0-444-82777-3 (1997).

## External links

[edit]

* MIT Linear Algebra Lecture on Projection Matrices on YouTube, from MIT OpenCourseWare
* Linear Algebra 15d: The Projection Transformation on YouTube, by Pavel Grinfeld.
* Planar Geometric Projections Tutorial – a simple-to-follow tutorial explaining the different types of planar geometric projections.

* v
* t
* e

Linear algebra

* Outline
* Glossary

Basic concepts|

* Scalar
* Vector
* Vector space
* Scalar multiplication
* Vector projection
* Linear span
* Linear map
* Linear projection
* Linear independence
* Linear combination
* Multilinear map
* Basis
* Change of basis
* Row and column vectors
* Row and column spaces
* Kernel
* Eigenvalues and eigenvectors
* Transpose
* Linear equations

Matrices|

* Block
* Decomposition
* Invertible
* Minor
* Multiplication
* Rank
* Transformation
* Cramer's rule
* Gaussian elimination
* Productive matrix
* Gram matrix

Bilinear|

* Orthogonality
* Dot product
* Hadamard product
* Inner product space
* Outer product
* Kronecker product
* Gram–Schmidt process

Multilinear algebra|

* Determinant
* Cross product
* Triple product
* Seven-dimensional cross product
* Geometric algebra
* Exterior algebra
* Bivector
* Multivector
* Tensor
* Outermorphism

Vector space constructions|

* Dual
* Direct sum
* Function space
* Quotient
* Subspace
* Tensor product

Numerical|

* Floating-point
* Numerical stability
* Basic Linear Algebra Subprograms
* Sparse matrix
* Comparison of linear algebra libraries

* Category

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template