In QM, the probability of a measurement outcome, p(R=Δ), is the square of the norm of the component of the state vector on the related subspace, ‖|ψΔ⟩‖2. The components of vectors on some subspaces are found by applying a projection operator to the vector. Therefore an elementary knowledge about how these projection operators are constructed is essential. :-) It is "remember your linear algebra!" time. (In this entry I'll assume that the operator has discrete spectra, and it is finite dimensional).
 |
| The set on the left consists of possible outcomes of the measurement, hence the eigenvalues of the observable. Right set depicts the related vector spaces corresponding to eigenvalues. |
The set on the right, H, is the N dimensional Hilbert space. (A Hilbert space is an abstract vector space on which an inner product is defined to measure the lengths of vectors.) The state of a quantum system is described by a vector |ψ⟩ that lives in H. For each eigenvalue rn in the set {rn} there is corresponding vector |rn⟩ in H which satisfies the relation R|rn⟩=rn|rn⟩. That vector is called the eigenvector of R (corresponding to the eigenvalue rn).
Linear algebra tells us that the eigenvectors of a N×N hermitian operator R, {|rn⟩}, is a complete set that spans all of the N-dim Hilbert space. Span{{|rn⟩}}=H. As we talked previously, if R is non-degenerate (all eigenvalues are ), then {|rn⟩} is not only a complete set but a complete orthonormal set (CONS) of which elements satisfy the relation ⟨rm|rn⟩=δmn. If R is degenerate, then eigenvectors in {|rn⟩} are only linearly independent (LI) (assuming R is not a pathological case) but one can always construct a CONS from a LI set (remember Grams-Schmidt process). Any vector |ψ⟩ in H can be written as a linear combination of elements of {|rN⟩} or its orthonormalized version {|uN⟩}.
The set of eigenvectors |rΔ⟩ related to a subset of {|rN⟩} that we will call Δ can not span the whole H but a subset of it, that we will call V. Span{|rΔ⟩}=V. If Δ has M elements then |rΔ⟩ has too. And V is an M dimensional subspace of H. We will call the rest of the Hilbert space V⊥ which is the complementary set of V. H=V⊕V⊥ and V∩V⊥=0.
Any vector |ψ⟩ can be written as a sum of its two components, one belonging to V and other to V⊥. |ψ⟩=|ψV⟩+|ψV⊥⟩. |ψV⟩∈V and |ψV⊥⟩∈V⊥. (Or we could call them |ψV⟩ and |ψΔ⊥⟩ )
Our aim is to construct the projection operator MR(Δ) which will give |ψV⟩ when applied to any |ψ⟩ for a chosen operator R and range Δ.
Constructing the Projection Operator onto a subspace using a LI set of vectors that span that subspace
Simple Case: Projection onto a line on R2
First let me demonstrate this by working in R2 and projection onto a line L. Say, our subspace is the 1D line L, which is spanned by a vector →r. L= {c→r|c∈R} =Span{→r}. ProjL(→v)≡→vL and →v −ProjL(→r) =→vL⊥.
We can express the projected line mathematically using this relation: →v−ProjL(→v) ⊥L. Which means that, the projection of →v onto L is a vector ProjL(→v) on L of which difference from →v is perpendicular to all vectors on L. Any vector on L can be described by a real multiple of →r. Hence →vL=c→r. To find the projection, we have to find this c.
The inner product of two perpendicular vectors is 0. →a⋅→b=0 if →a⊥→b. Using perpendicularity between →v−→vL=→vL⊥ and L we can write (→v−c→r)⋅→v=0→v⋅→r−c→r⋅→r=0⇒c=→v⋅→r→r⋅→r⇒ProjL(→v)=→v⋅→r→r⋅→r→rProjSpan{→r}(→v)=→r→r⋅→v→r⋅→r →r is not unique, it can be any vector on L. Picking a unit vector will simplify the calculations. Let →u=→r‖→r‖, projection becomes ProjSpan{→u}(→v)=→u(→u⋅→v)
(Projection is a linear operation)
Let me show that this operation is linear.
- ProjL(→a+→b) = →u(→u⋅(→a+→b)) =→u(→u⋅→a+→u⋅→b) =→u(→u⋅→a)+→u(→u⋅→b) =ProjL(→a)+ProjL(→b).
- ProjL(c→a) =→u(→u⋅c→a) =c→u(→u⋅→a) =cProjL(c→a).
Mmn=⟨m|M|n⟩=⟨m|ProjL(|n⟩)=→m⋅(→u(→u⋅→n))=→m⋅(→uun)=un→m⋅→u=umun,OR=⟨m|(|u⟩⟨u|n⟩)=⟨m|u⟩un=umun
Hence ML=(u2xuxuyuxuyu2y) =|u⟩⟨u|.
General Case: Projection onto a K-dimensional subspace on RN
In the general case H is N-dimensional, and the subspace V is K-dimensional. Say, V is spanned by a set of K LI vectors {→rK}. Then any vector on V can be expressed as a liner combination of →ri's. →x∈V ⇒→x=∑Kici→ri.
If we think of these ci's as components of a vector →c, then this relation between →v, ci's and {→rK} can be shown with a matrix multiplication. Define an K×N dimensional matrix A A=(↑↑↑→r1→r2…→rK↓↓↓)
Then, for each →x∈V, →x=A→c where →c is unique to chosen →x. The projection of a vector →v∈H onto V, called →vV, is a vector in V. Hence it can be expressed by the same matrix multiplication form. →v= →vV +→vV⊥. Or →v= ProjV(→v) +ProjV⊥(→v) and ProjV(→v) =A→c.
Then, for each →x∈V, →x=A→c where →c is unique to chosen →x. The projection of a vector →v∈H onto V, called →vV, is a vector in V. Hence it can be expressed by the same matrix multiplication form. →v= →vV +→vV⊥. Or →v= ProjV(→v) +ProjV⊥(→v) and ProjV(→v) =A→c.
According to this definition of A, V is the "column-space" of A. V =C(A). A columnspace of a matrix is the subspace spanned by its column vectors. Some deep and mysterious relations of linear algebra tells us that, the complementary subspace of V, which is V⊥, is the left-null-space of A, or the null-space of A transpose, A⊤. V⊥ =C(A)⊥, =N(A⊤). Therefore, ProjV⊥(→v) ∈N(A⊤).
If a vector belongs to the null-space of a matrix, it means that, when the matrix is applied to that vector the result is the null-vector. A⊤→vV⊥=→0A⊤(→v−ProjV(→v))=A⊤(→v−A→c)=A⊤→v−A⊤A→c=→0⇒A⊤→v=A⊤A→c
Another linear algebra proverb says that, if the columns of a matrix A are linearly independent then A⊤A (which is an (N×K)(K×N)=N×N dimensional square matrix) is invertable. Therefore →c=(A⊤A)−1A⊤→v. This is the way of calculating the {ci} coefficients of the linear combination (in the form of →c) to expand the projection vector →vV in this LI vectors basis, C(A). Remember →vV =A→c Hence: ProjV(→v)=A(A⊤A)−1A⊤→v
If a vector belongs to the null-space of a matrix, it means that, when the matrix is applied to that vector the result is the null-vector. A⊤→vV⊥=→0A⊤(→v−ProjV(→v))=A⊤(→v−A→c)=A⊤→v−A⊤A→c=→0⇒A⊤→v=A⊤A→c
Another linear algebra proverb says that, if the columns of a matrix A are linearly independent then A⊤A (which is an (N×K)(K×N)=N×N dimensional square matrix) is invertable. Therefore →c=(A⊤A)−1A⊤→v. This is the way of calculating the {ci} coefficients of the linear combination (in the form of →c) to expand the projection vector →vV in this LI vectors basis, C(A). Remember →vV =A→c Hence: ProjV(→v)=A(A⊤A)−1A⊤→v
A(A⊤A)−1A⊤ is the projection matrix MV≡MR(Δ) that we are looking for. It only depends on the subspace, not the basis we chose to span that subspace. Different bases will give different A matrices but MV will be the same for all bases. In QM, the eigenvectors of the observables, the hermitian matrices, are orthonormal. (or degenerate eigenvectors can be orthogonalized). It may be good to look at the orthonormal basis case. And in general, from any linear independent set of vectors, one can create an orthonormal basis with Gramm-Schmidt process.
Assume the orthonormal basis {→uK} spans the K-dimensional subspace V. This time the A⊤A will be identity I. A⊤A=(←→u1→←→u2→←⋮→←→uK→)(↑↑↑→u1→u2…→uK↓↓↓)=(→u1⋅→u1→u1⋅→u2⋯→u1⋅→uK→u2⋅→u1→u2⋅→u2⋯→u2⋅→uK⋮⋮⋮→uK⋅→u1→uK⋅→u2⋯→uK⋅→uK)=(10⋯001⋯0⋮⋮⋮00⋯1)
Hence the expression for the projection operator reduces to ProjV(→v)=AA⊤→v Let us explicitly calculate its matrix elements. Let um,n be the nth component of the →um. AA⊤=(↑↑↑→u1→u2…→uK↓↓↓)(←→u1→←→u2→←⋮→←→uK→)=(u1,1u2,1⋯uK,1u1,2u2,2⋯uK,2⋮⋮⋮u1,Nu2,N⋯uK,N)(u1,1u1,2⋯u1,Nu2,1u2,2⋯u2,N⋮⋮⋮uK,1uK,2⋯uK,N)=(∑Kiui,1ui,1∑Kiui,1ui,2⋯∑Kiui,1ui,N∑Kiui,2ui,1∑Kiui,2ui,2⋯∑Kiui,2ui,N⋮⋮⋮∑Kiui,Nui,1∑Kiui,Nui,2⋯∑Kiui,Nui,N)=K∑i(ui,1ui,1ui,1ui,2⋯ui,1ui,Nui,2ui,1ui,2ui,2⋯ui,2ui,N⋮⋮⋮ui,Nui,1ui,Nui,2⋯ui,Nui,N)=K∑i|ui⟩⟨ui|
If the individual terms of the sum are thought as the projections onto the lines spanned by →ui then the projection onto the subspace is the sum of the projections onto orthogonal lines. This seems plausible because each term gives one component of the projection vector in {→uK} basis. Hence using an orthonormal basis to span V we get MV=AA⊤=K∑i|ui⟩⟨ui|=K∑iMLi
Hence the expression for the projection operator reduces to ProjV(→v)=AA⊤→v Let us explicitly calculate its matrix elements. Let um,n be the nth component of the →um. AA⊤=(↑↑↑→u1→u2…→uK↓↓↓)(←→u1→←→u2→←⋮→←→uK→)=(u1,1u2,1⋯uK,1u1,2u2,2⋯uK,2⋮⋮⋮u1,Nu2,N⋯uK,N)(u1,1u1,2⋯u1,Nu2,1u2,2⋯u2,N⋮⋮⋮uK,1uK,2⋯uK,N)=(∑Kiui,1ui,1∑Kiui,1ui,2⋯∑Kiui,1ui,N∑Kiui,2ui,1∑Kiui,2ui,2⋯∑Kiui,2ui,N⋮⋮⋮∑Kiui,Nui,1∑Kiui,Nui,2⋯∑Kiui,Nui,N)=K∑i(ui,1ui,1ui,1ui,2⋯ui,1ui,Nui,2ui,1ui,2ui,2⋯ui,2ui,N⋮⋮⋮ui,Nui,1ui,Nui,2⋯ui,Nui,N)=K∑i|ui⟩⟨ui|
If the individual terms of the sum are thought as the projections onto the lines spanned by →ui then the projection onto the subspace is the sum of the projections onto orthogonal lines. This seems plausible because each term gives one component of the projection vector in {→uK} basis. Hence using an orthonormal basis to span V we get MV=AA⊤=K∑i|ui⟩⟨ui|=K∑iMLi
Note that MH=∑Ki|ui⟩⟨ui|=I.
1 Whole idea of the A matrix and calculations of projection operators are stolen from Khan Academy's linear algebra online lectures.
1 Whole idea of the A matrix and calculations of projection operators are stolen from Khan Academy's linear algebra online lectures.
Nice but bit complicated blog and I am here to discuss about algebra that is,It is the part of mathematics in which numbers and quantities in formula and equations can be represented by letters and other symbols.
ReplyDeletemath word problems