Understanding Projectors in Quantum Mechanics: A Mathematical Approach

In summary: Sum_n P_{e_n} = P_{\sum_n e_n} ...This is where things get a little fuzzy. It looks like you are saying that for every pair (\psi, \psi_n) in H,Sum_n P_{e_n} = P_{\sum_n e_n}
  • #1
Sammywu
273
0
I saw some discussions about projectors in some threads. Also, the projector is used in this book to define pure state but did not provide what is a projector.

http://www.math.sunysb.edu/~leontak/book.pdf

Thru some math. check by assuming [tex] TR AP_\psi = (A (\psi) , \psi ) [/tex] ( In this book, that is the expectation vale for [tex] AP_\psi [/tex] ) , I got the answer by
[tex] P_\psi ( e_n ) = \sum_i c_i \overline{c_n } e_i [/tex]
if
[tex] \psi= \sum_i c_i e_i [/tex]
for an orthonormal basis [tex] { e_n } [/tex].

That sounds to be a good one for it.

Also, if
[tex] \psi_1 = c_1 \psi + c_2 \bot \psi [/tex]
then
[tex] P_\psi ( \Psi_1) = c_1 \psi [/tex] , where
[tex] ( \bot\psi, . \psi ) = 0 [/tex] .

Is this right?
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
... did not provide what is a projector.
Definition: P is a "projector" if (and only if):

(i) Pt = P ,

and

(ii) P has eigenvalues 0 and/or 1 .

It then follows that P is a "projector" if, and only if, Pt = P and P2 = P.

--------------------

Thru some math. check by assuming [tex] TR AP_\psi = (A (\psi) , \psi ) [/tex] ( In this book, that is the expectation vale for [tex] AP_\psi [/tex] ) , I got the answer by
[tex] P_\psi ( e_n ) = \sum_i c_i \overline{c_n } e_i [/tex]
if
[tex] \psi= \sum_i c_i e_i [/tex]
for an orthonormal basis [tex] { e_n } [/tex].

That sounds to be a good one for it.
I'm not quite sure what you are asking here. But all of the equations are correct. However, the "Trace" equation is said to be "the expectation value for A when the system is in the state ψ", not "the expectation value for APψ".

--------------------

Also, if
[tex] \psi_1 = c_1 \psi + c_2 \bot \psi [/tex]
then
[tex] P_\psi ( \Psi_1) = c_1 \psi [/tex] , where
[tex] ( \bot\psi, . \psi ) = 0 [/tex] .

Is this right?
Yes.
 
Last edited:
  • #3
Eye,

Thanks.

The error you pointed out was my typo. I will think about the link between the EQ. I derived and your defintion.
 
  • #4
Eye,

Shall it be [tex] \overline{P^t} = P [/tex]?

Thanks
 
  • #5
By the way, this condition is also needed in my EQ:

[tex] \sum_i c_i \overline{c_i } = 1 [/tex]

Otherwise, [tex] P_\psi ( \psi ) = \sum_i c_i \overline{c_i } \psi [/tex]

Or, in general, the EQ shall be:

[tex] P_\psi ( e_n ) = ( 1 / \sum_j c_j \overline{c_j } ) \sum_i c_i \overline{c_n } e_i [/tex]
 
  • #6
Notation conversion between inner product and bra/ket for C and D belonging to the Hilbert Space.

[tex] ( C , D ) = < D | C > = \sum_j c_j \overline{d_j } [/tex]

if [tex] C = \sum_j c_j e_j and D = \sum_j d_j e_j [/tex]
 
  • #7
Eye,

Shall it be [tex] \overline{P^t} = P [/tex]?

Thanks
If by "t" you don't mean the "Hermitian transpose" (called the "adjoint"), then it shall.

------------------------

By the way, this condition is also needed in my EQ:

[tex] \sum_i c_i \overline{c_i } = 1 [/tex]
Oh, I was assuming that. It means that the state ψ is "normalized" (i.e. to unity).


Otherwise, [tex] P_\psi ( \psi ) = \sum_i c_i \overline{c_i } \psi [/tex]
Yes. BUT, then, for nontrivial Pψ (i.e. Pψ ≠ 0), it is not a projector (because the eigenvalue 1 has become Σi|ci|2).


Or, in general, the EQ shall be:

[tex] P_\psi ( e_n ) = ( 1 / \sum_j c_j \overline{c_j } ) \sum_i c_i \overline{c_n } e_i [/tex]
The factor in front should still be a 1 (not 1/Σj|cj|2). (BUT remember: this more general case is no longer a projector!)

------------------------

Notation conversion between inner product and bra/ket for C and D belonging to the Hilbert Space.

[tex] ( C , D ) = < D | C > = \sum_j c_j \overline{d_j } [/tex]

if [tex] C = \sum_j c_j e_j and D = \sum_j d_j e_j [/tex]
Looks fine.
 
Last edited:
  • #8
Does a projector have an inverse. I never thought of it before, but now I'm wondering ... (it doesn't seem to have an inverse)
 
  • #9
idempotent

P2 = P

implies

P-1P2 = P-1P

P = 1 ;

the only one with an inverse is the identity

(alternatively, you can say that on account of a 0 eigenvalue det = 0, and therefore, there is no inverse, except when P = 1)

(alternatively, you can say that when P ≠ 1 (and visualizing it geometrically) the mapping is MANY-to-ONE, and therefore has no inverse)
 
Last edited:
  • #10
I think I derived a few things that seem important to me:

1). For [tex] \psi_1 and \psi_2 \in H [/tex],

In order for
[tex] ( P_\psi_1 + P_\psi_2 ) = P_{\psi_1+\psi_2} [/tex]
then
[tex] \psi_1 \bot \psi_2 i.e. ( \psi_1 , \psi_2 ) = 0 [/tex]

2). From that,

[tex] \sum_n P_{e_n} = P_{\sum_n e_n} [/tex]
 
  • #11
I verified that:

For [tex] \psi and \psi_n \in H [/tex],

where [tex] \psi_n [/tex] are eigenbasis of A,

this holds true:
[tex] < A | P_\psi > = \sum_n c_n \overline{c_n} E_n [/tex]

where
[tex] \psi = \sum_n c_n \psi_n [/tex].
 
  • #12
A question is now whether [tex] P_{e_n} [/tex] can serve as a basis ( or generator ) of GL(H) or A(H)?
 
  • #13
If
[tex] \sum_n a_n P_{e_n} = P_{\sum_n a_n e_n} [/tex]
is true, then [tex] P_{e_n} [/tex] can not serve as a basis, because all its linear combinations are also projectors then.

But [tex] 2 P_{e_n} [/tex] does not seem to be the projector for
[tex] 2 e_n [/tex]; so in general, there seems to be possibility.
 
  • #14
Sammywu said:
I think I derived a few things that seem important to me:

1). For [tex] \psi_1 and \psi_2 \in H [/tex],

In order for
(a) [tex] ( P_\psi_1 + P_\psi_2 ) = P_{\psi_1+\psi_2} [/tex]
then
(b) [tex] \psi_1 \bot \psi_2 i.e. ( \psi_1 , \psi_2 ) = 0 [/tex]
Do you mean "(a) implies (b)", "(b) implies (a)", or both ?


2). From that,

[tex] \sum_n P_{e_n} = P_{\sum_n e_n} [/tex]
Yup.

--------------------------

I verified that:

For [tex] \psi and \psi_n \in H [/tex],

where [tex] \psi_n [/tex] are eigenbasis of A,

this holds true:
[tex] < A | P_\psi > = \sum_n c_n \overline{c_n} E_n [/tex]

where
[tex] \psi = \sum_n c_n \psi_n [/tex].
You didn't mention that the En are the eigenvalues of A. (... I assume you assumed <ψ|ψ> = 1.)

--------------------------

... All of this will become much, much simpler once you start using Dirac notation.

--------------------------------------------
 
  • #15
Eye,

Thanks.

I have a question for the lemma 1.1 at page 40 in that book.

I don't think there is anythings that says the eigenbasis of a self-adjoint operator can always span the entire Hilbert space.

If that's the case, I can write a

[tex] \psi = \sum_i a_i \Psi_i + b \psi_\bot [/tex]

where

[tex] \Psi_\bot \bot \Psi_n [/tex], for all n.

[tex] ( M (\psi) , \psi ) [/tex]
might not equal to
[tex] ( \sum_i a_i P_\psi_n ( \psi ) , \psi ) [/tex].
 
  • #16
Eye,

What I found is below is the sufficient condition for this Lemma to be true:

[tex] ( M (\psi) , \psi_\bot ) = 0 [/tex]

Any Way, it there is a countable basis, this seems to be true.

I aslo found I can easily set up a self-adjoint operator that only has limited number of eigen values and map the rest of basis to zero.
 
  • #17
turin said:
Does a projector have an inverse. I never thought of it before, but now I'm wondering ... (it doesn't seem to have an inverse)

No it doesn't, except for the trivial projector on the whole space. The "feel it in the bones" argument is that when you project something, you don't know what the orthogonal component was (the one that has been filtered out).
The mathematical argument is of course that a non-trivial projector has 0 eigenvalues (of the orthogonal directions that have been filtered out!).

In fact, this property is at the heart of the "measurement problem" in QM: a projection (such as happens in von Neuman's view) can never be the result of a unitary evolution.

cheers,
Patrick.
 
  • #18
Sammywu said:
A question is now whether [tex] P_{e_n} [/tex] can serve as a basis ( or generator ) of GL(H) or A(H)?
GL(n,C) is a group with respect to matrix multiplication. It is not "closed" under matrix addition, and therefore, does not have the vector space structure you are assuming in your question. On the other hand, the full set of n x n matrices with entries from C, M(n,C), is "closed" under matrix addition (as well as, multiplication, of course). So, you might want to pose your question with respect to M(n,C).

In that case, for n > 1, the answer is "no". M(n,C) has dimension n2, whereas, the Pi will span a subspace with dimension no larger than n (of course, the Pi are in fact linearly independent, so they will span a subspace of dimension equal to n).
 
Last edited:
  • #19
Sammywu said:
If

[1] [tex] \sum_n a_n P_{e_n} = P_{\sum_n a_n e_n} [/tex] ...
The object on the left-hand-side is not (in general) a projector. That object has eigenvalues an , whereas a projector has eigenvalues
0 and / or 1.

--------------------------

At this juncture, it is instructive to consider ordinary 3-D Euclidean space. Pick any unit vector n. Then, the projector corresponding to this unit vector is given by

[2] Pn(v) = (vn) n , for any vector v .

The description of [2] is "the projection of v along n". Do you remember what this means geometrically? (see figure).

--------

NOTE:

In Dirac notation, [2] becomes

Pn|v> = <n|v> |n> = |n> <n|v> = (|n><n|) |v> , for any |v> .

We therefore write:

Pn = |n><n| .

If you think of each ket as a column matrix and the corresponding bra as its Hermitian transpose (a row matrix) then this notation can be taken "literally".

--------------------------

I suggest you reserve the symbol "P", in the above type of context, only for a "projector" proper. Also, I suggest you invoke the rule that the "subscript" of P is always a "unit" vector. These two prescriptions would then disqualify the "legitimacy" of the right-hand-side of [1] on both counts.

At the same time, if you want to consider generalizations for which a relation like [1] holds, then use a symbol "R" (or whatever else) instead of "P". The generalization of [2] which gives a relation like [1] is then simply:

[2'] Ru(v) = [ v ∙ (u/|u|) ] u , for any vector v .

But what is the motivation for reserving a special "symbol" for this operation? Its description is "project the vector v into the direction of u and then multiply by the magnitude of u". The meaningful aspects of this operation are much better expressed by writing the corresponding operator as |u|P(u/|u|).

--------------------------

Now, let's go back the definition I gave in post #2.


Definition: P is a "projector" if (and only if):

(i) Pt = P ,

and

(ii) P has eigenvalues 0 and/or 1 .

It then follows that P is a "projector" if, and only if, Pt = P and P2 = P.
I am now strongly suggesting that we, instead, use the following as our "official" definition:

*************************
* 1a) Given any unit vector e, definite the "projector onto e" by:
*
* Pe(v) = (v,e) e , for any vector v .
*
* Such a projector is said to be "1-dimensional".
*
* 1b) An operator P is said to be a "projector" if (and only if)
* it can be written as a sum of 1-dimensional projectors
* which project onto mutually orthogonal unit vectors.
*
*************************

This definition [1a) and 1b) taken together] is equivalent to the original one I gave. But I think it makes the meaning of "projector" much clearer.

------------------------------------------------------

All that I have said above should clarify matters like:


Sammywu said:
But [tex] 2 P_{e_n} [/tex] does not seem to be the projector for
[tex] 2 e_n [/tex] ...
-----------
 

Attachments

  • projector.jpg
    projector.jpg
    6.9 KB · Views: 664
Last edited:
  • #20
Sammywu said:
I don't think there is anythings that says the eigenbasis of a self-adjoint operator can always span the entire Hilbert space.
[Note: you wrote "eigenbasis", when you meant "eigenvectors".]

The answer to your query is given in that book by Theorem 1.1 (called "The Spectral Theorem"), on p. 38. In simple language, it is saying that the answer is: "Yes, a self-adjoint operator will always have eigenvectors (or "generalized" eigenvectors) spanning the entire Hilbert space."

HOWEVER, you must NOTE that the definition of "self-adjoint" (in the case of an infinite-dimensional Hilbert space) is nontrivial (... in that book, the appropriate definition is given at the top of p. 36, in 1.1.1 Notations).

------------------------

For the sake of giving you (at least) something, here is some basic information. Let A be a linear operator acting in the Hilbert space.

Definition: A is "symmetric" iff <g|Af> = <Ag|f> for all f,g Є Domain(A).

Definition: A is "self-adjoint" iff: (i) A is symmetric; (ii) the "adjoint" At exists; and (iii) Domain(A) = Domain(At).

Lemma: At, the "adjoint" of A, exists iff Domain(A) is dense in the Hilbert space.

All that is missing in the above is a definition of "adjoint" (which I have omitted for the sake of brevity and simplicity). That definition would then give us a specification of Domain(At) and thereby complete the definition of "self-adjoint".

------------------------

Now, you might ask: How can it be that there is a linear operator A with a domain "smaller" than the whole Hilbert space, yet, at the same time, A has eigenvectors which span the entire space?

Well, first of all, this can only happen in an infinite-dimensional Hilbert space. Suppose A has eigenfunctions φn(x) with corresponding eigenvalues an. So,

[1] Aφn(x) = anφn(x) .

Since the φn(x) span the entire space, an arbitrary element ψ(x) of the space can be written as

[2] ψ(x) = Σn cnφn(x) .

The right-hand-side of [2] is an infinite sum, and, therefore, involves a limit. While every finite subsum is necessarily in the domain of A, it is possible that in the limit of the infinite sum, the resulting vector is no longer in that domain. ... As you can see, this sort of phenomenon can only occur when the Hilbert space is infinite-dimensional.

But what do we get if we, nevertheless, attempt to "apply" A to ψ(x) by linearity and use [1]? Let's try it:

Aψ(x) = Σn cnn(x)

= Σn ancnφn(x) [3] .

As you may have guessed, when ψ(x) is not in Domain(A), the following occurs in [3]: while every finite subsum is necessarily an element of the Hilbert space, in the limit of the infinite sum the "result" is no longer in the Hilbert space.

--------
 
  • #21
Eye,

I wanted to print your response in oder to read it clearer. Unfortunatelly, I got some troubles with my printer. Hopefully I can print it tomorrow.

One of the issue I saw in your last response is that you seem to extend your defintion of self-adjoint to "non-trivial" one, my guess is you want to extend that to the one with eigenvectors that can span the entire Hilbert space.

Is it necessary?

Because if you do so, then [tex] P_{e_n} [/tex] is not self-adjoint then. Note it has only [tex] e_n [/tex] as its eigen vector.

I did overlook that theorem, I shall look closer into it.

Any way, I found these facts that help me to see it clearer:
Below, I was assuming a relaxed self-adjoint definition.

1).
[tex] \sum_n a_n P_{e_n} [/tex]
can be simply represented as the diagonal matrix as [tex] diag( a_1, a_2, a_3 ... ) [/tex].

So, it actually spans the group ( or ring ) formed by the matrix with only diagonal elements with values.

2). In general, they are not self-adjoint unless all [tex] a_i [/tex] are real.

3). If all [tex] a_i [/tex] are real, for any [tex] a_i [/tex] not zero, [tex] e_i [/tex] is one of its eigenvectors.

4). In particular, if
[tex] \sum_n a_n = 1 [/tex] and [tex] a_n >= 0 [/tex]
then it's a "state". If more than one [tex] a_n > 0 [/tex] , then it's a mixed state.

5). This also tells me that a set of { [tex] P_{e_n} [/tex] } is defintely not enough to span ( or generate ) all states, even though the { [tex] e_n [/tex] } can span the Hilbert Space.
 
  • #22
Eye,

By the way, are you Leon?

In the page 37, the mapping defining projection valued measure is not necessary 1-1 & onto, right?
 
  • #23
Sammywu said:
Because if you do so, then [tex] P_{e_n} [/tex] is not self-adjoint then. Note it has only [tex] e_n [/tex] as its eigen vector.
Every vector orthogonal to en is an eigenvector of Pn with eigenvalue zero. Clearly, Pn has a complete set of eigenvectors.


1).
[tex] \sum_n a_n P_{e_n} [/tex]
can be simply represented as the diagonal matrix as [tex] diag( a_1, a_2, a_3 ... ) [/tex].

So, it actually spans the group ( or ring ) formed by the matrix with only diagonal elements with values.

2). In general, they are not self-adjoint unless all [tex] a_i [/tex] are real.

3). If all [tex] a_i [/tex] are real, for any [tex] a_i [/tex] not zero, [tex] e_i [/tex] is one of its eigenvectors.

4). In particular, if
[tex] \sum_n a_n = 1 [/tex] and [tex] a_n >= 0 [/tex]
then it's a "state". If more than one [tex] a_n > 0 [/tex] , then it's a mixed state.

5). This also tells me that a set of { [tex] P_{e_n} [/tex] } is defintely not enough to span ( or generate ) all states, even though the { [tex] e_n [/tex] } can span the Hilbert Space.
1) The only problematic part here is the expression "spans the group (or ring)". True, the said objects form a group with respect to +, and monoid with respect to ∙ , and that defines a ring. But when you talk about spanning, you are thinking of the of the group aspect (with the + operation) over the field C. This gives a vector space ... and if you want to acknowledge the monoid aspect with respect to ∙ , then it's called an (associative) algebra. In short, the simplest correct thing to say is:

So, it actually spans the vector space formed by the matrices ... over C.

(... if you have a "thing" for such terminologies try mathworld)

2) True.

3) This is the same error as the one identified at the beginning of this post ... eigenvalues can be 0 (it's the eigenvectors! which can't).

4) True.

5) True, the Pn are not enough. But what is the "this" that tells you?
 
  • #24
Eye,

Got you. My error was assuming zero can not be eigenvalue.
 
  • #25
Eye,

About (5), what it means to me is that I will have no gurantee that I can generate a "position" eigenstate by linear combination of "energy"'s eigenstates even though I can generate its eigenfunction by "energy"'s eigenfunction. Or, a mixed state by "energy"'s eigenfunction won't equal to any combination of "postion"s' pure states.

I followed through the rest to page 45. Operators P and Q should be unbounded. What does it exactly mean by that?

Thanks
 
  • #26
Sammywu said:
By the way, are you Leon?
No. (... I think he is too busy writing difficult eBooks to be in the forum.)

-----------------------

In the page 37, the mapping defining projection valued measure is not necessary 1-1 & onto, right?
It appears to me that such a mapping can never be one-to-one. It is certainly never onto.

-----------------------

Operators P and Q should be unbounded. What does it exactly mean by that?
Definition: A linear operator L is bounded iff there exists a constant C such that

(Lψ, Lψ) < C (ψ, ψ) , for all ψ Є H .

Can you see that there is no such constant C for Q or for P?
 
  • #27
Eye,

I take definition of inner product in L2(R, dq) as
[tex] ( \varphi, \psi ) = \int \overline{\psi} \varphi dq [/tex]
.

[tex] (q \psi , q \psi ) = \int \overline{q \psi } q \psi dq [/tex]
[tex] = \int \overline{q} \overline{\psi} q \psi dq [/tex]
[tex] = \int q^2 \overline{\psi } \psi dq [/tex]

because q is real.

If it's bounded, then

[tex] \int ( q^2 - C ) \overline{\psi } \psi dq < 0 [/tex]
.

Now all I need to do is proving this is not possible for a C exits.

Am I on right track?

Thanks
 
  • #28
I think that this track will lead you to a proof that Q is an unbounded operator.
 
  • #29
Eye,

Now to keep it easy, I pick a
[tex] \psi = ( | q - q_0 | e^{-(q-q_0)^2 })^{1/2} [/tex]
.

It's easy to prove that
[tex] ( \psi , \psi ) = 1 [/tex]
.

Considering in the interval
[ q_0-1 , q_0 +1 ] ,
[tex] \int_{q_0-1}^{q_0+1) q^2 * | \psi |^2 >= ( q_0 - 1)^2 * 2 * 1/2 * 1/e [/tex]
.

I can prove [tex] ( q \psi , q \psi ) > ( q_0 - 1 )^2 / e [/tex]
.

This is definitely unbounded, because all I need to do is moving q_0 to one end of R line, this value will grow with it without bound.

Does this look fine?

Thanks
 
Last edited:
  • #30
OK. If that shows how Q is an unbounded operator.

What I did not show is how the commutator of two bounded operators can not be I. At this point, all I find is
[tex] ( (AB-BA) \psi , (AB-BA) \psi ) = ( AB \psi, AB \psi) + (BA \psi, BA \psi ) [/tex]
.

So if AB-BA = I, then [tex] 1/2 <= C_1 * C_2 [/tex]
. Not further.

Any way, I guess originally I was bothered is because the definition of < Q | M > = TR QM and only bounded operators' trace was defined.

So, here the problem is actually QM need to be bounded even if Q is not bounded.
 
  • #31
So, I just try to see whether QM is always of trace class.

Let [tex] M = \sum_n a_n P_{\psi_n} [/tex]
where
[tex] \sum_n a_n = 1 [/tex]

TR [tex] QM = \sum_n ( Q \sum_i a_i P_{\psi_i} \psi_n , \psi_n ) [/tex]
[tex] = \sum_n ( Q a_n \psi_n , \psi_n ) [/tex]
[tex] = \sum_n a_n ( Q \psi_n, \psi_n ) [/tex]

Assuming
[tex] b_n = | ( Q \psi_n, \psi_n ) | [/tex]
, whether QM is of trace class will depends on whether
[tex] \sum_n a_n b_n [/tex] converges.

So, if I can find a set of [tex] \psi_n [/tex] such that [tex] b_n = 2/a_n [/tex] , then I have a QM not of trace class.
 
  • #32
Sammywu said:
Now to keep it easy, I pick a
[tex] \psi = ( | q - q_0 | e^{-(q-q_0)^2 })^{1/2} [/tex]
This is not easy.


[tex] ( \psi , \psi ) = 1 [/tex]
True.


Considering in the interval
[ q_0-1 , q_0 +1 ] ,
[tex] q^2 * | \psi |^2 >= ( q_0 - 1)^2 * 2 * 1/2 * 1/e [/tex]
How so? For q = qo the LHS is 0.

------
... The idea behind the proof will work. But for technical reasons the proof has failed. Why not really keep it easy and choose ψ like below?

ψ(q)

= 1 , q Є (qo, qo + 1)
= 0 , otherwise

Then (Qψ, Qψ) > qo2 .

------------------------------------

Define: ║φ║ = √(φ, φ)

Then: ║φ + ξ║ ≤ ║φ║ + ║ξ║

.... :surprise:

------------------------------------

So, I just try to see whether QM is always of trace class.
In the most general case, QM may or may not be.

In the following, you carry out the inquiry well:

So, I just try to see whether QM is always of trace class.

Let [tex] M = \sum_n a_n P_{\psi_n} [/tex]
where
[tex] \sum_n a_n = 1 [/tex]

TR [tex] QM = \sum_n ( Q \sum_i a_i P_{\psi_i} \psi_n , \psi_n ) [/tex]
[tex] = \sum_n ( Q a_n \psi_n , \psi_n ) [/tex]
[tex] = \sum_n a_n ( Q \psi_n, \psi_n ) [/tex]

Assuming
[tex] b_n = | ( Q \psi_n, \psi_n ) | [/tex]
, whether QM is of trace class will depends on whether
[tex] \sum_n a_n b_n [/tex] converges.
Remember also that M is a state. So we also have

0≤an≤1 as well as ∑nan=1 .

But still, this is not enough. In general the series can still diverge.

This tells us that our current definition for a state M is still too general. While all physical states do satisfy the definition of M, not all M's are physical states.
 
Last edited:
  • #33
Eye,

Note I just added an integral sign in front.

Considering in the interval
[ q_0-1 , q_0 +1 ] ,
[tex] \int_{q_0-1}^{q_0+1} q^2 * | \psi |^2 >= ( q_0 - 1)^2 * 2 * 1/2 * 1/e [/tex]

Any way, I agree your proof is much easier and quicker than mine.

I need to read your response more thoroughly.

It seems you used the extended triangular inequality; that was what I was thinking yesterday but can't get it proved and working.

I did branch out to think the issue of mixed state:

[tex] < Q , P_{\sum_n a_n \psi_n} > = TR \ QP_{\sum_n a_n \psi_n} = [/tex]
[tex] \sum_n ( QP_{\sum_i a_i \psi_i} \psi_n , \psi_n ) = \sum_n ( Q \sum_j a_j \overline{a_n} \psi_j , \psi_n ) = [/tex]
[tex] \sum_n \overline{a_n} ( \sum_j a_j Q \psi_j , \psi_n ) = \sum_n \overline{a_n} \sum_j a_j ( Q \psi_j , \psi_n ) [/tex]

[tex] <Q | M > = < Q , \sum_n a_n P_{\psi_n } > = TR \ Q \sum_n a_n P_{\psi_n} = [/tex]
[tex]\sum_n a_n ( Q P_{\psi_n} \psi_n , \psi_n ) = \sum_n a_n ( Q \psi_n , \psi_n ) [/tex]

This shows that even though [tex] P_{\sum_n a_n \psi_n} \ and \ \sum_n a_n P_{\psi_n } [/tex], but they do have the same expectation value.

Now, for [tex] P_\sum_n a_n \psi_n [/tex] to be a state, [tex] (\sum_n a_n \psi_n , \sum_n a_n \psi_n ) = \sum a_n \overline\a_n = \sum a_n^2 \ needs \ to \ be \ one [/tex] . This condition is different from the condition for M to be a state in that [tex] TR \ M = \sum_n (\sum_i a_i P_\psi_i \psi_n , \psi_n ) = \sum a_n needs \ to \ be \ one [/tex] .

I thought I might be able to show some Q wll have the same expectation values for the mixed state and the pure state. Apparently this is a little tedious than I thought.
 
Last edited:
  • #34
Eye,

The previous one is a little messy. I was trying to see whether the '//' will give me a new line.

So, I redo it here.

I did branch out to think the issue of mixed state:

[tex] < Q , P_{\sum_n a_n \psi_n} > = TR \ QP_{\sum_n a_n \psi_n} = [/tex]
[tex] \sum_n ( QP_{\sum_i a_i \psi_i} \psi_n , \psi_n ) = [/tex]
[tex] \sum_n ( Q \sum_j a_j \overline{a_n} \psi_j , \psi_n ) = [/tex]
[tex] \sum_n \overline{a_n} ( \sum_j a_j Q \psi_j , \psi_n ) = [/tex]
[tex] \sum_n \overline{a_n} \sum_j a_j ( Q \psi_j , \psi_n ) [/tex]

[tex] <Q | M > = \sum_n a_n ( Q \psi_n , \psi_n ) [/tex]

as we alreday showed in earlier one.


Now, for [tex] P_\sum_n a_n \psi_n [/tex] to be a state,
[tex] (\sum_n a_n \psi_n , \sum_n a_n \psi_n ) = [/tex]
[tex] \sum a_n \overline{a_n} = \sum a_n^2 [\tex]
needs to be one.
This condition is different from the condition for M to be a state in that
[tex] TR \ M = \sum_n (\sum_i a_i P_\psi_i \psi_n , \psi_n ) = [/tex]
[tex] \sum a_n [/tex]
needs to be one.

I thought I might be able to show some Qs wll have the same expectation values for the mixed state and the pure state. Apparently this is a little tedious than I thought.

Any way, why do you say I is unbounded in a infinite dimensional space?

[tex] ( I \psi , I \psi ) = ( \psi , \psi ) < 2 ( \psi , \psi ) [/tex]

whether the space is infinite or finite dimensional.

Thanks
 
Last edited:
  • #35
Eye,

Changing my tactic, I gathered some facts:

Let
[tex] \psi = \sum b_i \psi_i [/tex]
where
[tex] b_i \overline{b_i} = a_i [/tex]
and
[tex] \sum b_i \overline{b_i} = 1 [/tex]
.

Now, this can be changed to:

[tex] < Q , P_{\sum_n b_n \psi_n} > = TR \ QP_{\sum_n b_n \psi_n} = [/tex]
[tex] \sum_n ( QP_{\sum_i b_i \psi_i} \psi_n , \psi_n ) = [/tex]
[tex] \sum_n ( Q \sum_j b_j \overline{b_n} \psi_j , \psi_n ) = [/tex]
[tex] \sum_n \overline{b_n} ( \sum_j b_j Q \psi_j , \psi_n ) = [/tex]
[tex] \sum_n \overline{b_n} \sum_j b_j ( Q \psi_j , \psi_n ) [/tex]

Compare that to:

[tex] <Q | M > = \sum_n a_n ( Q \psi_n , \psi_n ) [/tex]

If I set
[tex] Q = \sum c_n P_{\psi_n} [/tex]
, then
[tex] < Q | P_\psi > = \sum_n \overline{b_n} b_n c_n [/tex]

and

[tex] < Q | M > = \sum_n a_n c_n [/tex]

They are the same.

So for any Qs as [tex] \sum c_n P_{\psi_n} [/tex], we will have the same expectation value for the mixed state and the pure state.
 

Similar threads

Replies
19
Views
4K
Replies
5
Views
2K
Replies
13
Views
2K
Back
Top