Presentation is loading. Please wait.

Presentation is loading. Please wait.

Quantum One.

Similar presentations


Presentation on theme: "Quantum One."— Presentation transcript:

1 Quantum One

2

3 The General Formalism of Quantum Mechanics

4 The General Formalism of Quantum Mechanics Postulate One

5 In the last lecture, we completed our review of Schrödinger's wave mechanics for a free quantum particle, by completing our solution to the initial value problem, which we summarize below. For a free particle described by an initial real space wave function Compute the initial momentum space wave function so that Then, evolve the state of the system, as

6 We also observed that, even when the particle is not free, i. e
We also observed that, even when the particle is not free, i.e., when it is acted upon by forces, we can still, at any instant, expand the system in momentum eigenfunctions in terms of a momentum space wave function so that predictions of measurements of momentum can be made based upon the probability density

7 We concluded with the observation, that there actually appears to be many ways to represent the dynamical state of this quantum mechanical system. In this lecture, we therefore begin a presentation of the postulates of quantum mechanics in a form that is Manifestly representation independent (but which allows for the natural emergence of appropriate numerical representations), and which In principle applies to arbitrary quantum mechanical systems. One of our goals in going forward is also to provide an appropriate mathematical framework for understanding the content of the more generally formulated postulates.

8 We concluded with the observation, that there actually appears to be many ways to represent the dynamical state of this quantum mechanical system. In this lecture, we therefore begin a presentation of the postulates of quantum mechanics in a form that is Manifestly representation independent (but which allows for the natural emergence of appropriate numerical representations), and which In principle applies to arbitrary quantum mechanical systems. One of our goals in going forward is also to provide an appropriate mathematical framework for understanding the content of the more generally formulated postulates.

9 We concluded with the observation, that there actually appears to be many ways to represent the dynamical state of this quantum mechanical system. In this lecture, we therefore begin a presentation of the postulates of quantum mechanics in a form that is Manifestly representation independent (but which allows for the natural emergence of appropriate numerical representations), and which In principle applies to arbitrary quantum mechanical systems. One of our goals in going forward is also to provide an appropriate mathematical framework for understanding the content of the more generally formulated postulates.

10 We concluded with the observation, that there actually appears to be many ways to represent the dynamical state of this quantum mechanical system. In this lecture, we therefore begin a presentation of the postulates of quantum mechanics in a form that is Manifestly representation independent (but which allows for the natural emergence of appropriate numerical representations), and which In principle applies to arbitrary quantum mechanical systems. One of our goals in going forward is also to provide an appropriate mathematical framework for understanding the content of the more generally formulated postulates.

11 We concluded with the observation, that there actually appears to be many ways to represent the dynamical state of this quantum mechanical system. In this lecture, we therefore begin a presentation of the postulates of quantum mechanics in a form that is Manifestly representation independent (but which allows for the natural emergence of appropriate numerical representations), and which In principle applies to arbitrary quantum mechanical systems. One of our goals in going forward is also to provide an appropriate mathematical framework for understanding the content of the more generally formulated postulates.

12 To this end it is useful to adopt an approach which mixes these two tasks.
Thus, we start out by simply stating the first postulate, and then follow this statement by a general discussion of its mathematical structure. This procedure will then be repeated for the remaining three postulates. Following the general structure introduced earlier, we therefore begin with the first postulate, which describes the means by which an arbitrary dynamical state of an arbitrary quantum mechanical system may be specified or represented.

13 To this end it is useful to adopt an approach which mixes these two tasks.
Thus, we start out by simply stating the first postulate, and then follow this statement by a general discussion of its mathematical structure. This procedure will then be repeated for the remaining three postulates. Following the general structure introduced earlier, we therefore begin with the first postulate, which describes the means by which an arbitrary dynamical state of an arbitrary quantum mechanical system may be specified or represented.

14 To this end it is useful to adopt an approach which mixes these two tasks.
Thus, we start out by simply stating the first postulate, and then follow this statement by a general discussion of its mathematical structure. This procedure will then be repeated for the remaining three postulates. Following the general structure introduced earlier, we therefore begin with the first postulate, which describes the means by which an arbitrary dynamical state of an arbitrary quantum mechanical system may be specified or represented.

15 To this end it is useful to adopt an approach which mixes these two tasks.
Thus, we start out by simply stating the first postulate, and then follow this statement by a general discussion of its mathematical structure. This procedure will then be repeated for the remaining three postulates. Following the general structure introduced earlier, we therefore begin with the first postulate, which describes the means by which an arbitrary dynamical state of an arbitrary quantum mechanical system may be specified or represented.

16 Postulate I - The dynamical state of a quantum mechanical system is, at each instant of time, associated with a state vector |ψ〉. Possible state vectors are elements of a complex linear vector space S, referred to as the state space or the Hilbert space of the system. Obviously, a prerequisite to our understanding of this postulate and its implications is an understanding of the idea of a linear vector space. So we have the following (This gets a little mathematical, but in the end all the mathspeak will simply allows us to do to states, what we did with functions) Definition: A set S = {|ψ〉,|ζ〉,|ξ〉,…} of elements (which we will call vectors or states) forms a linear vector space (or LVS) if the set is closed under two mutually distributive operations: an associative and commutative law of vector addition, and multiplication by elements of an associated field F = {λ,μ,ν,…} of scalars.

17 Postulate I - The dynamical state of a quantum mechanical system is, at each instant of time, associated with a state vector |ψ〉. Possible state vectors are elements of a complex linear vector space S, referred to as the state space or the Hilbert space of the system. Obviously, a prerequisite to our understanding of this postulate and its implications is an understanding of the idea of a linear vector space. So we have the following (This gets a little mathematical, but in the end all the mathspeak will simply allows us to do to states, what we did with functions) Definition: A set S = {|ψ〉,|ζ〉,|ξ〉,…} of elements (which we will call vectors or states) forms a linear vector space (or LVS) if the set is closed under two mutually distributive operations: an associative and commutative law of vector addition, and multiplication by elements of an associated field F = {λ,μ,ν,…} of scalars.

18 Postulate I - The dynamical state of a quantum mechanical system is, at each instant of time, associated with a state vector |ψ〉. Possible state vectors are elements of a complex linear vector space S, referred to as the state space or the Hilbert space of the system. Obviously, a prerequisite to our understanding of this postulate and its implications is an understanding of the idea of a linear vector space. So we have the following (This gets a little mathematical, but in the end all the mathspeak will simply allows us to do to states, what we did with functions) Definition: A set S = {|ψ〉, |ζ〉, |ξ〉, …} of elements (which we will call vectors or states) forms a linear vector space (or LVS) if the set is closed under two mutually distributive operations: an associative and commutative law of vector addition, and multiplication by elements of an associated field F = {λ,μ,ν,…} of scalars.

19 Postulate I - The dynamical state of a quantum mechanical system is, at each instant of time, associated with a state vector |ψ〉. Possible state vectors are elements of a complex linear vector space S, referred to as the state space or the Hilbert space of the system. Obviously, a prerequisite to our understanding of this postulate and its implications is an understanding of the idea of a linear vector space. So we have the following (This gets a little mathematical, but in the end all the mathspeak will simply allows us to do to states, what we did with functions) Definition: A set S = {|ψ〉, |ζ〉, |ξ〉, …} of elements (which we will call vectors or states) forms a linear vector space (or LVS) if the set is closed under two mutually distributive operations: an associative and commutative law of vector addition, and multiplication by elements of an associated field F = {λ,μ,ν,…} of scalars.

20 Postulate I - The dynamical state of a quantum mechanical system is, at each instant of time, associated with a state vector |ψ〉. Possible state vectors are elements of a complex linear vector space S, referred to as the state space or the Hilbert space of the system. Obviously, a prerequisite to our understanding of this postulate and its implications is an understanding of the idea of a linear vector space. So we have the following (This gets a little mathematical, but in the end all the mathspeak will simply allows us to do to states, what we did with functions) Definition: A set S = {|ψ〉, |ζ〉, |ξ〉, …} of elements (which we will call vectors or states) forms a linear vector space (or LVS) if the set is closed under two mutually distributive operations: an associative and commutative law of vector addition, and multiplication by elements of an associated field F = {λ, μ, ν, …} of scalars.

21 The first operation of vector addition is assumed to satisfy the following properties. For all states |ψ〉 and |ξ〉 in S, 1. there exists a state |χ〉 in S such that |χ〉 = |ψ〉 + |ξ〉. 2. |ψ〉 + |ξ〉 = |ξ〉 + |ψ〉. 3. |ψ〉 + (|ξ〉 + |χ〉) = (|ψ〉 + |ξ〉) + |χ〉. 4. There exists a unique null vector 0 in S such that 0 + |ξ〉 = |ξ〉. 5. For each |ξ〉 in S there exists a state -|ξ〉, such that |ξ〉 + ( -|ξ〉 ) = |ξ〉 - |ξ〉 = 0. Note: When the elements of S are all complex functions, these rules are automatically satisfied. Here, we just borrow those rules, so they apply automatically to the more abstract notion of a quantum states.

22 The first operation of vector addition is assumed to satisfy the following properties. For all states |ψ〉 and |ξ〉 in S, 1. there exists a state |χ〉 in S such that |χ〉 = |ψ〉 + |ξ〉. 2. |ψ〉 + |ξ〉 = |ξ〉 + |ψ〉. 3. |ψ〉 + (|ξ〉 + |χ〉) = (|ψ〉 + |ξ〉) + |χ〉. 4. There exists a unique null vector 0 in S such that 0 + |ξ〉 = |ξ〉. 5. For each |ξ〉 in S there exists a state -|ξ〉, such that |ξ〉 + ( -|ξ〉 ) = |ξ〉 - |ξ〉 = 0. Note: When the elements of S are all complex functions, these rules are automatically satisfied. Here, we just borrow those rules, so they apply automatically to the more abstract notion of a quantum states.

23 The first operation of vector addition is assumed to satisfy the following properties. For all states |ψ〉 and |ξ〉 in S, 1. there exists a state |χ〉 in S such that |χ〉 = |ψ〉 + |ξ〉, 2. |ψ〉 + |ξ〉 = |ξ〉 + |ψ〉. 3. |ψ〉 + (|ξ〉 + |χ〉) = (|ψ〉 + |ξ〉) + |χ〉. 4. There exists a unique null vector 0 in S such that 0 + |ξ〉 = |ξ〉. 5. For each |ξ〉 in S there exists a state -|ξ〉, such that |ξ〉 + ( -|ξ〉 ) = |ξ〉 - |ξ〉 = 0. Note: When the elements of S are all complex functions, these rules are automatically satisfied. Here, we just borrow those rules, so they apply automatically to the more abstract notion of a quantum states.

24 The first operation of vector addition is assumed to satisfy the following properties. For all states |ψ〉 and |ξ〉 in S, 1. there exists a state |χ〉 in S such that |χ〉 = |ψ〉 + |ξ〉, 2. |ψ〉 + |ξ〉 = |ξ〉 + |ψ〉, 3. |ψ〉 + (|ξ〉 + |χ〉) = (|ψ〉 + |ξ〉) + |χ〉. 4. There exists a unique null vector 0 in S such that 0 + |ξ〉 = |ξ〉. 5. For each |ξ〉 in S there exists a state -|ξ〉, such that |ξ〉 + ( -|ξ〉 ) = |ξ〉 - |ξ〉 = 0. Note: When the elements of S are all complex functions, these rules are automatically satisfied. Here, we just borrow those rules, so they apply automatically to the more abstract notion of a quantum states.

25 The first operation of vector addition is assumed to satisfy the following properties. For all states |ψ〉 and |ξ〉 in S, 1. there exists a state |χ〉 in S such that |χ〉 = |ψ〉 + |ξ〉, 2. |ψ〉 + |ξ〉 = |ξ〉 + |ψ〉, 3. |ψ〉 + (|ξ〉 + |χ〉) = (|ψ〉 + |ξ〉) + |χ〉, 4. There exists a unique null vector 0 in S such that 0 + |ξ〉 = |ξ〉. 5. For each |ξ〉 in S there exists a state -|ξ〉, such that |ξ〉 + ( -|ξ〉 ) = |ξ〉 - |ξ〉 = 0. Note: When the elements of S are all complex functions, these rules are automatically satisfied. Here, we just borrow those rules, so they apply automatically to the more abstract notion of a quantum states.

26 The first operation of vector addition is assumed to satisfy the following properties. For all states |ψ〉 and |ξ〉 in S, 1. there exists a state |χ〉 in S such that |χ〉 = |ψ〉 + |ξ〉, 2. |ψ〉 + |ξ〉 = |ξ〉 + |ψ〉, 3. |ψ〉 + (|ξ〉 + |χ〉) = (|ψ〉 + |ξ〉) + |χ〉, 4. There exists a unique null vector 0 in S such that 0 + |ξ〉 = |ξ〉, 5. For each |ξ〉 in S there exists a state -|ξ〉, such that |ξ〉 + ( -|ξ〉 ) = |ξ〉 - |ξ〉 = 0. Note: When the elements of S are all complex functions, these rules are automatically satisfied. Here, we just borrow those rules, so they apply automatically to the more abstract notion of a quantum states.

27 The first operation of vector addition is assumed to satisfy the following properties. For all states |ψ〉 and |ξ〉 in S, 1. there exists a state |χ〉 in S such that |χ〉 = |ψ〉 + |ξ〉, 2. |ψ〉 + |ξ〉 = |ξ〉 + |ψ〉, 3. |ψ〉 + (|ξ〉 + |χ〉) = (|ψ〉 + |ξ〉) + |χ〉, 4. There exists a unique null vector 0 in S such that 0 + |ξ〉 = |ξ〉, 5. For each |ξ〉 in S there exists a state -|ξ〉, such that |ξ〉 + ( -|ξ〉 ) = |ξ〉 - |ξ〉 = 0. Note: When the elements of S are all complex functions, these rules are automatically satisfied. Here, we just borrow those rules, so they apply automatically to the more abstract notion of a quantum states.

28 The first operation of vector addition is assumed to satisfy the following properties. For all states |ψ〉 and |ξ〉 in S, 1. there exists a state |χ〉 in S such that |χ〉 = |ψ〉 + |ξ〉, 2. |ψ〉 + |ξ〉 = |ξ〉 + |ψ〉, 3. |ψ〉 + (|ξ〉 + |χ〉) = (|ψ〉 + |ξ〉) + |χ〉, 4. There exists a unique null vector 0 in S such that 0 + |ξ〉 = |ξ〉, 5. For each |ξ〉 in S there exists a state -|ξ〉, such that |ξ〉 + ( -|ξ〉 ) = |ξ〉 - |ξ〉 = 0. Note: When the elements of S are all complex functions, these rules are automatically satisfied. Here, we just borrow those rules, so they apply automatically to the more abstract notion of a quantum states.

29 The scalar field F with respect to which the space is defined is just a set of numbers (usually the set R of real numbers or the set C of complex numbers) the elements of which we may use to multiply the states of the space itself. (where, as we will see, they can serve as quantum amplitudes). This operation involving multiplication of states |ψ〉 of S by elements λ of F is assumed to have the following properties: For all vectors |ψ〉 and |ξ〉 in S and all scalars λ, λ₁, λ₂ in F There exists a vector |χ〉 in S such that |χ〉 = λ |ξ〉. λ [|ψ〉 + |ξ〉] = λ |ψ〉 + λ |ξ〉. λ₁ |ψ〉 + λ₂ |ψ〉 = ( λ₁ + λ₂ ) |ψ〉. λ₁ ( λ₂ |ψ〉) = (λ₁λ₂) |ψ〉.

30 The scalar field F with respect to which the space is defined is just a set of numbers (usually the set R of real numbers or the set C of complex numbers) the elements of which we may use to multiply the states of the space itself. (where, as we will see, they can serve as quantum amplitudes). This operation involving multiplication of states |ψ〉 of S by elements λ of F is assumed to have the following properties: For all vectors |ψ〉 and |ξ〉 in S and all scalars λ, λ₁, λ₂ in F There exists a vector |χ〉 in S such that |χ〉 = λ |ξ〉. λ [|ψ〉 + |ξ〉] = λ |ψ〉 + λ |ξ〉. λ₁ |ψ〉 + λ₂ |ψ〉 = ( λ₁ + λ₂ ) |ψ〉. λ₁ ( λ₂ |ψ〉) = (λ₁λ₂) |ψ〉.

31 The scalar field F with respect to which the space is defined is just a set of numbers (usually the set R of real numbers or the set C of complex numbers) the elements of which we may use to multiply the states of the space itself. (where, as we will see, they can serve as quantum amplitudes). This operation involving multiplication of states |ψ〉 of S by elements λ of F is assumed to have the following properties: For all vectors |ψ〉 and |ξ〉 in S and all scalars λ, λ₁, λ₂ in F There exists a vector |χ〉 in S such that |χ〉 = λ |ξ〉. λ [|ψ〉 + |ξ〉] = λ |ψ〉 + λ |ξ〉. λ₁ |ψ〉 + λ₂ |ψ〉 = ( λ₁ + λ₂ ) |ψ〉. λ₁ ( λ₂ |ψ〉) = (λ₁λ₂) |ψ〉.

32 The scalar field F with respect to which the space is defined is just a set of numbers (usually the set R of real numbers or the set C of complex numbers) the elements of which we may use to multiply the states of the space itself. (where, as we will see, they can serve as quantum amplitudes). This operation involving multiplication of states |ψ〉 of S by elements λ of F is assumed to have the following properties: For all vectors |ψ〉 and |ξ〉 in S and all scalars λ, λ₁, λ₂ in F There exists a vector |χ〉 in S such that |χ〉 = λ |ξ〉. λ [|ψ〉 + |ξ〉] = λ |ψ〉 + λ |ξ〉. λ₁ |ψ〉 + λ₂ |ψ〉 = ( λ₁ + λ₂ ) |ψ〉. λ₁ ( λ₂ |ψ〉) = (λ₁λ₂) |ψ〉.

33 The scalar field F with respect to which the space is defined is just a set of numbers (usually the set R of real numbers or the set C of complex numbers) the elements of which we may use to multiply the states of the space itself. (where, as we will see, they can serve as quantum amplitudes). This operation involving multiplication of states |ψ〉 of S by elements λ of F is assumed to have the following properties: For all vectors |ψ〉 and |ξ〉 in S and all scalars λ, λ₁, λ₂ in F There exists a vector |χ〉 in S such that |χ〉 = λ |ξ〉. λ [|ψ〉 + |ξ〉] = λ |ψ〉 + λ |ξ〉. λ₁ |ψ〉 + λ₂ |ψ〉 = ( λ₁ + λ₂ ) |ψ〉. λ₁ ( λ₂ |ψ〉) = (λ₁λ₂) |ψ〉.

34 The basic result of all these formal definitions, is that we are free to form linear superpositions of quantum states, as though they were complex valued-wave functions, i.e., if we have a set of quantum states , then we can form a linear superposition of them of the form with arbitrary complex amplitudes, and the resulting object is itself a state. Perhaps the most familiar linear vector space is the set 𝑟 of displacement vectors 𝑟 = x 𝑖 +y 𝑗 + z 𝑘 in R³, which is a linear vector space with respect to the field R of real numbers (that is, it’s a real vector space).

35 The basic result of all these formal definitions, is that we are free to form linear superpositions of quantum states, as though they were complex valued-wave functions, i.e., if we have a set of quantum states , then we can form a linear superposition of them of the form with arbitrary complex amplitudes, and the resulting object is itself a state. Perhaps the most familiar linear vector space is the set 𝑟 of displacement vectors 𝑟 = x 𝑖 +y 𝑗 + z 𝑘 in R³, which is a linear vector space with respect to the field R of real numbers (that is, it’s a real vector space).

36 The basic result of all these formal definitions, is that we are free to form linear superpositions of quantum states, as though they were complex valued-wave functions, i.e., if we have a set of quantum states , then we can form a linear superposition of them of the form with arbitrary complex amplitudes, and the resulting object is itself a state in S. Perhaps the most familiar linear vector space is the set 𝑟 of displacement vectors 𝑟 = x 𝑖 +y 𝑗 + z 𝑘 in R³, which is a linear vector space with respect to the field R of real numbers (that is, it’s a real vector space).

37 The basic result of all these formal definitions, is that we are free to form linear superpositions of quantum states, as though they were complex valued-wave functions, i.e., if we have a set of quantum states , then we can form a linear superposition of them of the form with arbitrary complex amplitudes, and the resulting object is itself a state in S. Perhaps the most familiar linear vector space is the set 𝑟 of displacement vectors 𝑟 = x 𝑖 +y 𝑗 + z 𝑘 in R³, which is a linear vector space with respect to the field R of real numbers (that is, it’s a real vector space).

38 The notation we are adopting, which distinguishes vectors |ξ〉 of S from scalars λ (elements of the field) is due to Dirac. It is obviously similar to the use of arrows, boldface symbols, etc. to distinguish vectors in R³ from their scalar counterparts. Let us consider some mathematical examples of vector spaces more relevant to quantum mechanics. Note: In all cases of quantum mechanical interest the relevant field is the set C of complex numbers. In quantum mechanics we are interested in complex vector spaces. (as stated explicitly in the first postulate)

39 The notation we are adopting, which distinguishes vectors |ξ〉 of S from scalars λ (elements of the field) is due to Dirac. It is obviously similar to the use of arrows, boldface symbols, etc. to distinguish vectors in R³ from their scalar counterparts. Let us consider some mathematical examples of vector spaces more relevant to quantum mechanics. Note: In all cases of quantum mechanical interest the relevant field is the set C of complex numbers. In quantum mechanics we are interested in complex vector spaces. (as stated explicitly in the first postulate)

40 The notation we are adopting, which distinguishes vectors |ξ〉 of S from scalars λ (elements of the field) is due to Dirac. It is obviously similar to the use of arrows, boldface symbols, etc. to distinguish vectors in R³ from their scalar counterparts. Let us consider some mathematical examples of vector spaces more relevant to quantum mechanics. Note: In all cases of quantum mechanical interest the relevant field is the set C of complex numbers. In quantum mechanics we are interested in complex vector spaces. (as stated explicitly in the first postulate)

41 The notation we are adopting, which distinguishes vectors |ξ〉 of S from scalars λ (elements of the field) is due to Dirac. It is obviously similar to the use of arrows, boldface symbols, etc. to distinguish vectors in R³ from their scalar counterparts. Let us consider some mathematical examples of vector spaces more relevant to quantum mechanics. Note: In all cases of quantum mechanical interest the relevant field is the set C of complex numbers. In quantum mechanics we are interested in complex vector spaces (as stated explicitly in the first postulate).

42 Example 1. The set 𝐶 𝑁 of column vectors having N complex elements
Example 1. The set 𝐶 𝑁 of column vectors having N complex elements. The field here is that of the complex numbers and vector addition is defined by which are equivalent to the "pointwise" relations

43 Example 1. The set 𝐶 𝑁 of column vectors having N complex elements
Example 1. The set 𝐶 𝑁 of column vectors having N complex elements. The field here is that of the complex numbers and vector addition is defined by which are equivalent to the "pointwise" relations

44 Example 1. The set 𝐶 𝑁 of column vectors having N complex elements
Example 1. The set 𝐶 𝑁 of column vectors having N complex elements. The field here is that of the complex numbers and vector addition is defined by which are equivalent to the "pointwise" relations

45 Example 1. The set 𝐶 𝑁 of column vectors having N complex elements
Example 1. The set 𝐶 𝑁 of column vectors having N complex elements. The field here is that of the complex numbers and vector addition is defined by which are equivalent to the "pointwise" relations

46 Example 1. The set 𝐶 𝑁 of column vectors having N complex elements
Example 1. The set 𝐶 𝑁 of column vectors having N complex elements. The field here is that of the complex numbers and vector addition is defined by which are equivalent to the "pointwise" relations while

47 Example 1. The set 𝐶 𝑁 of column vectors having N complex elements
Example 1. The set 𝐶 𝑁 of column vectors having N complex elements. The field here is that of the complex numbers and vector addition is defined by which are equivalent to the "pointwise" relations

48 Example 1. The set 𝐶 𝑁 of column vectors of length N having complex elements. The field here is that of the complex numbers and vector addition is defined by which are equivalent to the "pointwise" relations

49 Example 1. The set 𝐶 𝑁 of column vectors of length N having complex elements. The field here is that of the complex numbers and vector addition is defined by which are equivalent to the "pointwise" relations

50 Example 1. The set 𝐶 𝑁 of column vectors of length N having complex elements. The field here is that of the complex numbers and vector addition is defined by While scalar multiplication is defined by the relations

51 Example 1. The set 𝐶 𝑁 of column vectors of length N having complex elements. The field here is that of the complex numbers and vector addition is defined by While scalar multiplication is defined by the relations

52 Example 1. The set 𝐶 𝑁 of column vectors of length N having complex elements. The field here is that of the complex numbers and vector addition is defined by While scalar multiplication is defined by the relations

53 Example 1. The set 𝐶 𝑁 of column vectors of length N having complex elements. The field here is that of the complex numbers and vector addition is defined by While scalar multiplication is defined by the relations

54 Example 1. The set 𝐶 𝑁 of column vectors of length N having complex elements.
Note that all we are doing here is "adding by components“, if then,

55 Example 1. The set 𝐶 𝑁 of column vectors of length N having complex elements.
Note that all we are doing here is "adding by components“, i.e., if and if then, then

56 Example 1. The set 𝐶 𝑁 of column vectors of length N having complex elements.
Note that all we are doing here is "adding by components“, i.e., if and if then then

57 Example 1. The set 𝐶 𝑁 of column vectors of length N having complex elements.
Note that all we are doing here is "adding by components“, i.e., if and if then then

58 Example 1. The set 𝐶 𝑁 of column vectors of length N having complex elements.
Note that all we are doing here is "adding by components“, i.e., if and if then then

59 Example 2. The set L²(Rⁿ) of complex-valued square-integrable functions ψ on Rⁿ By definition, the function ψ(x) is in L²(R) if the integral exists and is non-infinite Again the field is that of the complex numbers and vector addition is associated with the pointwise addition and multiplication of functions, i.e.,: |χ〉=|ψ〉+|ξ〉 → χ(x)=ψ(x)+ξ(x) |χ〉=λ|ξ〉 → χ(x)=λξ(x) Note that all we are doing here is "adding by components", as in the example above, except that in this circumstance the components are labeled by a continuous index x, instead of a discrete one.

60 Example 2. The set of complex-valued square-integrable functions ψ on
Example 2. The set of complex-valued square-integrable functions ψ on By definition, the function ψ(x) is in L²(R) if the integral exists and is non-infinite Again the field is that of the complex numbers and vector addition is associated with the pointwise addition and multiplication of functions, i.e.,: |χ〉=|ψ〉+|ξ〉 → χ(x)=ψ(x)+ξ(x) |χ〉=λ|ξ〉 → χ(x)=λξ(x) Note that all we are doing here is "adding by components", as in the example above, except that in this circumstance the components are labeled by a continuous index x, instead of a discrete one.

61 Example 2. The set of complex-valued square-integrable functions ψ on
Example 2. The set of complex-valued square-integrable functions ψ on By definition, the function ψ(x) is in L²(R) if the integral exists and is non-infinite Again the field is that of the complex numbers and vector addition is associated with the pointwise addition and multiplication of functions, i.e., |χ〉 = |ψ〉 + |ξ〉 → χ(x) = ψ(x) + ξ(x) |χ〉 = λ|ξ〉 → χ(x) = λξ(x) Note that all we are doing here is "adding by components", as in the example above, except that in this circumstance the components are labeled by a continuous index x, instead of a discrete one.

62 Example 2. The set of complex-valued square-integrable functions ψ on
Example 2. The set of complex-valued square-integrable functions ψ on By definition, the function ψ(x) is in L²(R) if the integral exists and is non-infinite Again the field is that of the complex numbers and vector addition is associated with the pointwise addition and multiplication of functions, i.e., |χ〉 = |ψ〉 + |ξ〉 → χ(x) = ψ(x) + ξ(x) |χ〉 = λ|ξ〉 → χ(x) = λξ(x) Note that all we are doing here is "adding by components", as in the example above, except that in this circumstance the components are labeled by a continuous index x, instead of a discrete one.

63 Example 2. The set of complex-valued square-integrable functions ψ on
Example 2. The set of complex-valued square-integrable functions ψ on By definition, the function ψ(x) is in L²(R) if the integral exists and is non-infinite Again the field is that of the complex numbers and vector addition is associated with the pointwise addition and multiplication of functions, i.e., |χ〉 = |ψ〉 + |ξ〉 → χ(x) = ψ(x) + ξ(x) |χ〉 = λ|ξ〉 → χ(x) = λξ(x) Note that all we are doing here is "adding by components", as in the example above, except that in this circumstance the components are labeled by a continuous index x, instead of a discrete one.

64 Example 2. The set of complex-valued square-integrable functions ψ on
Example 2. The set of complex-valued square-integrable functions ψ on By definition, the function ψ(x) is in L²(R) if the integral exists and is non-infinite Again the field is that of the complex numbers and vector addition is associated with the pointwise addition and multiplication of functions, i.e., |χ〉 = |ψ〉 + |ξ〉 → χ(x) = ψ(x) + ξ(x) |χ〉 = λ|ξ〉 → χ(x) = λξ(x) Note that all we are doing here is "adding by components", as in 𝐶 𝑁 , except that in this example the components are labeled by a continuous index x, instead of a discrete one.

65 The set L²(Rⁿ) of square integrable functions does not include the plane waves (momentum eigenfunctions), or delta functions (position eigenfunctions), so its useful to enlarge the space by considering the set of Fourier representable functions, i.e., those whose Fourier transform exists. This includes plane waves, whose Fourier transforms are delta functions, and delta functions, whose Fourier transforms are plane waves (work it out and see!) The set L²(Rⁿ) of square integrable functions is actually a subset of the set F(Rⁿ) of Fourier representable functions, and since it is, by itself, a linear vector space under the same operations of vector addition and scalar multiplication defined in F(Rⁿ), it is referred to as a subspace of F(Rⁿ). Definition: A subset S’ ⊂ S, which is, by itself, a linear vector space under the same operations of vector addition and scalar multiplication as defined in S is referred to as a subspace of S.

66 The set L²(Rⁿ) of square integrable functions does not include the plane waves (momentum eigenfunctions), or delta functions (position eigenfunctions), so its useful to enlarge the space by considering the set of Fourier representable functions, i.e., those whose Fourier transform exists. This includes plane waves, whose Fourier transforms are delta functions, and delta functions, whose Fourier transforms are plane waves (work it out and see!) The set L²(Rⁿ) of square integrable functions is actually a subset of the set F(Rⁿ) of Fourier representable functions, and since it is, by itself, a linear vector space under the same operations of vector addition and scalar multiplication defined in F(Rⁿ), it is referred to as a subspace of F(Rⁿ). Definition: A subset S’ ⊂ S, which is, by itself, a linear vector space under the same operations of vector addition and scalar multiplication as defined in S is referred to as a subspace of S.

67 The set L²(Rⁿ) of square integrable functions does not include the plane waves (momentum eigenfunctions), or delta functions (position eigenfunctions), so its useful to enlarge the space by considering the set of Fourier representable functions, i.e., those whose Fourier transform exists. This includes plane waves, whose Fourier transforms are delta functions, and delta functions, whose Fourier transforms are plane waves (work it out and see!) The set L²(Rⁿ) of square integrable functions is actually a subset of the set of Fourier representable functions. Since it is, by itself, a linear vector space under the same operations of vector addition and scalar multiplication defined in F(Rⁿ), it is referred to as a subspace of Definition: A subset S’ ⊂ S, which is, by itself, a linear vector space under the same operations of vector addition and scalar multiplication as defined in S is referred to as a subspace of S.

68 The set L²(Rⁿ) of square integrable functions does not include the plane waves (momentum eigenfunctions), or delta functions (position eigenfunctions), so its useful to enlarge the space by considering the set of Fourier representable functions, i.e., those whose Fourier transform exists. This includes plane waves, whose Fourier transforms are delta functions, and delta functions, whose Fourier transforms are plane waves (work it out and see!) The set L²(Rⁿ) of square integrable functions is actually a subset of the set of Fourier representable functions. Since it is, by itself, a linear vector space under the same operations of vector addition and scalar multiplication defined in F(Rⁿ), it is referred to as a subspace of Definition: A subset S’ ⊂ S, which is, by itself, a linear vector space under the same operations of vector addition and scalar multiplication as defined in S is referred to as a subspace of S.

69 This idea of a subspace will be very important to us
This idea of a subspace will be very important to us. Geometrically, it is not hard to see that the set of position vectors lying in the xy- plane forms a 2-dimensional subspace of the set of all position vectors in R³. The set of all vectors lying along the z axis forms a 1-dimensional subspace of R³. To proceed we need to provide some additional definitions. We first introduce the notion of a spanning set of vectors:

70 This idea of a subspace will be very important to us
This idea of a subspace will be very important to us. Geometrically, it is not hard to see that the set of position vectors lying in the xy- plane forms a 2-dimensional subspace of the set of all position vectors in R³. The set of all vectors lying along the z axis forms a 1-dimensional subspace of R³. To proceed we need to provide some additional definitions. We first introduce the notion of a spanning set of vectors:

71 This idea of a subspace will be very important to us
This idea of a subspace will be very important to us. Geometrically, it is not hard to see that the set of position vectors lying in the xy- plane forms a 2-dimensional subspace of the set of all position vectors in R³. The set of all vectors lying along the z axis forms a 1-dimensional subspace of R³. To proceed we need to provide some additional definitions. We first introduce the notion of a spanning set of vectors:

72 This idea of a subspace will be very important to us
This idea of a subspace will be very important to us. Geometrically, it is not hard to see that the set of position vectors lying in the xy- plane forms a 2-dimensional subspace of the set of all position vectors in R³. The set of all vectors lying along the z axis forms a 1-dimensional subspace of R³. To proceed we need to provide some additional definitions. We first introduce the notion of a spanning set of vectors:

73 This idea of a subspace will be very important to us
This idea of a subspace will be very important to us. Geometrically, it is not hard to see that the set of position vectors lying in the xy- plane forms a 2-dimensional subspace of the set of all position vectors in R³. The set of all vectors lying along the z axis forms a 1-dimensional subspace of R³. To proceed we need to provide some additional definitions. We first introduce the notion of a spanning set of vectors:

74 Span - A set of states is said to span a space S if every state in S can be written as a linear combination of elements of the set. { 𝑖 , 𝑗 } does not span R³. { 𝑖 , 𝑗 , 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } does span R³. So a spanning set is sufficiently complete, but it may contain too many vectors, and the members may not be particularly well chosen. This leads to the next definition.

75 Span - A set of states is said to span a space S if every state in S can be written as a linear combination of elements of the set. { 𝑖 , 𝑗 } does not span R³. { 𝑖 , 𝑗 , 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } does span R³. So a spanning set is sufficiently complete, but it may contain too many vectors, and the members may not be particularly well chosen. This leads to the next definition.

76 Span - A set of states is said to span a space S if every state in S can be written as a linear combination of elements of the set. { 𝑖 , 𝑗 } does not span R³. { 𝑖 , 𝑗 , 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } does span R³. So a spanning set is sufficiently complete, but it may contain too many vectors, and the members may not be particularly well chosen. This leads to the next definition.

77 Span - A set of states is said to span a space S if every state in S can be written as a linear combination of elements of the set. { 𝑖 , 𝑗 } does not span R³. { 𝑖 , 𝑗 , 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } does span R³. So a spanning set is sufficiently complete, but it may contain too many vectors, and the members may not be particularly well chosen. This leads to the next definition.

78 Span - A set of states is said to span a space S if every state in S can be written as a linear combination of elements of the set. { 𝑖 , 𝑗 } does not span R³. { 𝑖 , 𝑗 , 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } does span R³. So a spanning set is sufficiently complete, but it may contain too many vectors, and the members may not be particularly well chosen. This leads to the next definition.

79 Span - A set of states is said to span a space S if every state in S can be written as a linear combination of elements of the set. { 𝑖 , 𝑗 } does not span R³. { 𝑖 , 𝑗 , 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } does span R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } does span R³. So a spanning set is sufficiently complete, but it may contain too many vectors, and the members may not be particularly well chosen. This leads to the next definition.

80 Linear Independence - A set of states is linearly independent if no member of the set can be written as a linear combination of the others. A set that is not linearly independent, is linearly dependent. This is equivalent to the statement that, the only solution to the equation is { 𝑖 , 𝑗 } is a linearly independent set in R³. { 𝑖 , 𝑗 , 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } is not a linearly independent set in R³. So with a linearly independent set, we don’t have too many, but we might not have enough. But this allows us to introduce two more crucial ideas.

81 Linear Independence - A set of states is linearly independent if no member of the set can be written as a linear combination of the others. A set that is not linearly independent, is linearly dependent. This is equivalent to the statement that, the only solution to the equation is { 𝑖 , 𝑗 } is a linearly independent set in R³. { 𝑖 , 𝑗 , 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } is not a linearly independent set in R³. So with a linearly independent set, we don’t have too many, but we might not have enough. But this allows us to introduce two more crucial ideas.

82 Linear Independence - A set of states is linearly independent if no member of the set can be written as a linear combination of the others. A set that is not linearly independent, is linearly dependent. This is equivalent to the statement that, the only solution to the equation is { 𝑖 , 𝑗 } is a linearly independent set in R³. { 𝑖 , 𝑗 , 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } is not a linearly independent set in R³. So with a linearly independent set, we don’t have too many, but we might not have enough. But this allows us to introduce two more crucial ideas.

83 Linear Independence - A set of states is linearly independent if no member of the set can be written as a linear combination of the others. A set that is not linearly independent, is linearly dependent. This is equivalent to the statement that, the only solution to the equation is { 𝑖 , 𝑗 } is a linearly independent set in R³. { 𝑖 , 𝑗 , 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } is not a linearly independent set in R³. So with a linearly independent set, we don’t have too many, but we might not have enough. But this allows us to introduce two more crucial ideas.

84 Linear Independence - A set of states is linearly independent if no member of the set can be written as a linear combination of the others. A set that is not linearly independent, is linearly dependent. This is equivalent to the statement that, the only solution to the equation is { 𝑖 , 𝑗 } is a linearly independent set in R³. { 𝑖 , 𝑗 , 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } is not a linearly independent set in R³. So with a linearly independent set, we don’t have too many, but we might not have enough. But this allows us to introduce two more crucial ideas.

85 Linear Independence - A set of states is linearly independent if no member of the set can be written as a linear combination of the others. A set that is not linearly independent, is linearly dependent. This is equivalent to the statement that, the only solution to the equation is { 𝑖 , 𝑗 } is a linearly independent set in R³. { 𝑖 , 𝑗 , 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } is not a linearly independent set in R³. So with a linearly independent set, we don’t have too many, but we might not have enough. But this allows us to introduce two more crucial ideas.

86 Linear Independence - A set of states is linearly independent if no member of the set can be written as a linear combination of the others. A set that is not linearly independent, is linearly dependent. This is equivalent to the statement that, the only solution to the equation is { 𝑖 , 𝑗 } is a linearly independent set in R³. { 𝑖 , 𝑗 , 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 } is a linearly independent set in R³. { 𝑖 ,2 𝑗 , 𝑖 +3 𝑘 , 𝑘 } is not a linearly independent set in R³. So with a linearly independent set, we don’t have too many, but we might not have enough. But this allows us to introduce two more crucial ideas.

87 Dimension - If a linear vector space S contains a subset of N linearly independent vectors, but does not contain a subset of N + 1 linearly independent vectors it has dimension N, or is an N -dimensional space. If there exist subsets of S with N linearly independent vectors for all N, it is said to be infinite dimensional. Many quantum state spaces are of infinite dimension. R³ is a three dimensional vector space. Basis - A linearly independent set of states that spans S forms a basis for the space. A basis set is often referred to as being complete with respect to the vector space that it spans, i.e., it forms a complete set of states for the space.

88 Dimension - If a linear vector space S contains a subset of N linearly independent vectors, but does not contain a subset of N + 1 linearly independent vectors it has dimension N, or is an N -dimensional space. If there exist subsets of S with N linearly independent vectors for all N, it is said to be infinite dimensional. Many quantum state spaces are of infinite dimension. R³ is a three dimensional vector space. Basis - A linearly independent set of states that spans S forms a basis for the space. A basis set is often referred to as being complete with respect to the vector space that it spans, i.e., it forms a complete set of states for the space.

89 Dimension - If a linear vector space S contains a subset of N linearly independent vectors, but does not contain a subset of N + 1 linearly independent vectors it has dimension N, or is an N -dimensional space. If there exist subsets of S with N linearly independent vectors for all N, it is said to be infinite dimensional. Many quantum state spaces are of infinite dimension. R³ is a three-dimensional vector space. Basis - A linearly independent set of states that spans S forms a basis for the space. A basis set is often referred to as being complete with respect to the vector space that it spans, i.e., it forms a complete set of states for the space.

90 Dimension - If a linear vector space S contains a subset of N linearly independent vectors, but does not contain a subset of N + 1 linearly independent vectors it has dimension N, or is an N -dimensional space. If there exist subsets of S with N linearly independent vectors for all N, it is said to be infinite dimensional. Many quantum state spaces are of infinite dimension. R³ is a three-dimensional vector space. Basis - A linearly independent set of states that spans S forms a basis for the space. A basis set is often referred to as being complete with respect to the vector space that it spans, i.e., it forms a complete set of states for the space.

91 Dimension - If a linear vector space S contains a subset of N linearly independent vectors, but does not contain a subset of N + 1 linearly independent vectors it has dimension N, or is an N -dimensional space. If there exist subsets of S with N linearly independent vectors for all N, it is said to be infinite dimensional. Many quantum state spaces are of infinite dimension. R³ is a three dimensional vector space. Basis - A linearly independent set of states that spans S forms a basis for the space. A basis set is often referred to as being complete with respect to the vector space that it spans, i.e., it forms a complete linearly independent set of states for the space.

92 Note that by definition, any spanning set of vectors contains a basis as a subset. (We just have to weed out any unnecessary vectors which can themselves be written as linear combinations of the remaining ones.) Perhaps the most useful distinction between a basis set and a spanning set, is that the expansion coefficients expressing any element of the space in terms of the members of a basis are unique. That is, if form a basis for S, and |ψ〉 is an arbitrary element of S it can be written as a linear combination of these vectors in only one way. This is easy to prove. Assume that there existed another expansion but then so

93 Note that by definition, any spanning set of vectors contains a basis as a subset. (We just have to weed out any unnecessary vectors which can themselves be written as linear combinations of the remaining ones.) Perhaps the most useful distinction between a basis set and a spanning set, is that the expansion coefficients expressing any element of the space in terms of the members of a basis are unique. That is, if form a basis for S, and |ψ〉 is an arbitrary element of S it can be written as a linear combination of these vectors in only one way. This is easy to prove. Assume that there existed another expansion but then so

94 Note that by definition, any spanning set of vectors contains a basis as a subset. (We just have to weed out any unnecessary vectors which can themselves be written as linear combinations of the remaining ones.) Perhaps the most useful distinction between a basis set and a spanning set, is that the expansion coefficients expressing any element of the space in terms of the members of a basis are unique. That is, if form a basis for S, and |ψ〉 is an arbitrary element of S it can be written as a linear combination of these vectors in only one way. This is easy to prove. Assume that there existed another expansion but then so

95 Note that by definition, any spanning set of vectors contains a basis as a subset. (We just have to weed out any unnecessary vectors which can themselves be written as linear combinations of the remaining ones.) Perhaps the most useful distinction between a basis set and a spanning set, is that the expansion coefficients expressing any element of the space in terms of the members of a basis are unique. That is, if form a basis for S, and |ψ〉 is an arbitrary element of S it can be written as a linear combination of these vectors in only one way. This is easy to prove. Assume that there existed another expansion but then so

96 Note that by definition, any spanning set of vectors contains a basis as a subset. (We just have to weed out any unnecessary vectors which can themselves be written as linear combinations of the remaining ones.) Perhaps the most useful distinction between a basis set and a spanning set, is that the expansion coefficients expressing any element of the space in terms of the members of a basis are unique. That is, if form a basis for S, and |ψ〉 is an arbitrary element of S it can be written as a linear combination of these vectors in only one way. This is easy to prove. Assume that there existed another expansion but then so

97 Note that by definition, any spanning set of vectors contains a basis as a subset. (We just have to weed out any unnecessary vectors which can themselves be written as linear combinations of the remaining ones.) Perhaps the most useful distinction between a basis set and a spanning set, is that the expansion coefficients expressing any element of the space in terms of the members of a basis are unique. That is, if form a basis for S, and |ψ〉 is an arbitrary element of S it can be written as a linear combination of these vectors in only one way. This is easy to prove. Assume that there existed another expansion but then so

98 Note that by definition, any spanning set of vectors contains a basis as a subset. (We just have to weed out any unnecessary vectors which can themselves be written as linear combinations of the remaining ones.) Perhaps the most useful distinction between a basis set and a spanning set, is that the expansion coefficients expressing any element of the space in terms of the members of a basis are unique. That is, if form a basis for S, and |ψ〉 is an arbitrary element of S it can be written as a linear combination of these vectors in only one way. This is easy to prove. Assume that there existed another expansion but then so

99 As a final definition before we close this lecture, its useful to define a form of the word span that is a noun, rather than a verb. Given any set of vectors, we can consider the set S′ = { } of all possible linear combinations of members of the set. This a set is closed under vector addition and scalar multiplication, and thus forms a subspace of S. We will refer to this subspace S′ as the span of , and denote it by S′ = Span( ). Clearly, if the set of vectors is complete, then its span is the entire space S itself.

100 As a final definition before we close this lecture, its useful to define a form of the word span that is a noun, rather than a verb. Given any set of vectors, we can consider the set S′ = { } of all possible linear combinations of members of the set. This a set is closed under vector addition and scalar multiplication, and thus forms a subspace of S. We will refer to this subspace S′ as the span of , and denote it by S′ = Span( ). Clearly, if the set of vectors is complete, then its span is the entire space S itself.

101 As a final definition before we close this lecture, its useful to define a form of the word span that is a noun, rather than a verb. Given any set of vectors, we can consider the set S′ = { } of all possible linear combinations of members of the set. This set is closed under vector addition and scalar multiplication, and thus forms a subspace of S. We will refer to this subspace S′ as the span of , and denote it by S′ = Span( ). Clearly, if the set of vectors is complete, then its span is the entire space S itself.

102 As a final definition before we close this lecture, its useful to define a form of the word span that is a noun, rather than a verb. Given any set of vectors, we can consider the set S′ = { } of all possible linear combinations of members of the set. This set is closed under vector addition and scalar multiplication, and thus forms a subspace of S. We will refer to this subspace S′ as the span of , and denote it by S′ = Span( ). Clearly, if the set of vectors is complete, then its span is the entire space S itself.

103 As a final definition before we close this lecture, its useful to define a form of the word span that is a noun, rather than a verb. Given any set of vectors, we can consider the set S′ = { } of all possible linear combinations of members of the set. This a set is closed under vector addition and scalar multiplication, and thus forms a subspace of S. We will refer to this subspace S′ as the span of , and denote it by S′ = Span( ). Clearly, if the set of vectors is complete, then its span is the entire space S itself.

104 So in this lecture, we stated the first postulate of the general form of quantum mechanics, and we worked our way through a lot of definitions that will be absolutely crucial if we want to understand the mathematical structure of quantum mechanics. In giving these definitions we considered sets of vectors labeled by a discrete index. But we will often encounter sets of states that are labeled by a continuous index. In the next lecture, we extend our definitions to include sets of this type, and work our way towards general notions of length and direction in our quantum mechanical state space, by introducing the idea of an inner product.

105 So in this lecture, we stated the first postulate of the general form of quantum mechanics, and we worked our way through a lot of definitions that will be absolutely crucial if we want to understand the mathematical structure of quantum mechanics. In giving these definitions we considered sets of vectors labeled by a discrete index. But we will often encounter sets of states that are labeled by a continuous index. In the next lecture, we extend our definitions to include sets of this type, and work our way towards general notions of length and direction in our quantum mechanical state space, by introducing the idea of an inner product.

106 So in this lecture, we stated the first postulate of the general form of quantum mechanics, and we worked our way through a lot of definitions that will be absolutely crucial if we want to understand the mathematical structure of quantum mechanics. In giving these definitions we considered sets of vectors labeled by a discrete index. But we will often encounter sets of states that are labeled by a continuous index. In the next lecture, we extend our definitions to include sets of this type, and work our way towards general notions of length and direction in our quantum mechanical state space, by introducing the idea of an inner product.

107 So in this lecture, we stated the first postulate of the general form of quantum mechanics, and we worked our way through a lot of definitions that will be absolutely crucial if we want to understand the mathematical structure of quantum mechanics. In giving these definitions we considered sets of vectors labeled by a discrete index. But we will often encounter sets of states that are labeled by a continuous index. In the next lecture, we extend our definitions to include sets of this type, and work our way towards general notions of length and direction in our quantum mechanical state space, by introducing the idea of an inner or scalar product.

108


Download ppt "Quantum One."

Similar presentations


Ads by Google