The Lumenary · First-year graduate
Mathematical foundations of quantum mechanics
Name: ______________________
Date: ______________________
You will learn to
- State the postulates of quantum mechanics in Hilbert-space language and compute measurement probabilities with the spectral theorem
- Explain why observables are modelled by self-adjoint, possibly unbounded, operators, why their domains matter, and why the canonical commutation relation has no bounded solution
- Derive unitary time evolution from the Schrödinger equation and state Stone's theorem
- Derive the Robertson–Heisenberg uncertainty relation from commutators and identify the states that saturate it
- Solve the quantum harmonic oscillator with ladder operators, including its eigenfunctions and their completeness
- 1.
A qubit is in the state . Measuring , what is the probability of the outcome ?
- A.
- B.
- C.
- D.
- 2.
A three-level system has an observable with orthonormal eigenvectors and eigenvalues . In the state , what is the expectation ?
- 3.
In the state (spin up along ), compare with , using .
- A.Both equal : the state saturates Robertson's inequality.
- B.The left side is because is an eigenvector.
- C.The right side is because the expectation of a commutator always vanishes.
- D.: the inequality holds strictly.
- 4.
On let with domain . Which statement is true?
- A. is symmetric but not self-adjoint; its adjoint is on all of .
- B. is self-adjoint because is formally symmetric.
- C. is not even symmetric.
- D. has real spectrum, like every symmetric operator.
- 5.
The proof of the Hellinger–Toeplitz theorem shows that the graph of an everywhere-defined symmetric operator is closed. Which theorem then gives that is bounded?
- A.The closed graph theorem.
- B.The uniform boundedness principle.
- C.The Riesz representation theorem.
- D.The spectral theorem.
- 6.
With , and , compute .
- 7.
Which Lean statement correctly formalises no complex matrices satisfy with (and is provable)?
- A.
∀ {n : ℕ}, 0 < n → ∀ (X P : Matrix (Fin n) (Fin n) ℂ) {c : ℂ}, c ≠ 0 → X * P - P * X ≠ c • 1 - B.
∀ {n : ℕ} (X P : Matrix (Fin n) (Fin n) ℂ) {c : ℂ}, c ≠ 0 → X * P - P * X ≠ c • 1 - C.
∀ {n : ℕ}, 0 < n → ∀ (X P : Matrix (Fin n) (Fin n) ℂ) (c : ℂ), X * P - P * X ≠ c • 1 - D.
∀ {n : ℕ}, 0 < n → ∀ (X P : Matrix (Fin n) (Fin n) ℂ), X * P ≠ P * X
- A.
- 8.
In Wielandt's proof that () is impossible for bounded operators, one needs for every . Why does no power of vanish?
- A.If , the identity forces ; descending, , impossible on a nonzero space.
- B.Because is self-adjoint, and self-adjoint operators are never nilpotent.
- C.Because for every bounded operator.
- D.Because the spectrum of is non-empty.
- 9.
Which normalised states satisfy exactly? Select all that apply.
- A.The oscillator ground state (with ).
- B.A displaced, boosted, squeezed Gaussian .
- C.The excited oscillator states with .
- D.A plane wave , which has .
- 10.
Write
expectation(A, psi)returning for a square matrixA(list of rows) and a vectorpsi(list of complex numbers), andstd_dev(A, psi)returning for a normalisedpsiand HermitianA. The tests check Robertson's inequality for Pauli matrices.Computational — Practice