Skip to main content
Course and syllabus guidance

University Quantum Mechanics I · topic UQMI-09.09

The number operator and stepping the ladder

Connect the ideas, make your working visible, and test the result. Use the hints when you need a starting point; open the full solution after your attempt.

Further practice

Work through a fresh case before tackling the extension.

Further practice · 01

The number operator and stepping the ladder: predict a finite change

The number operator N = a†a counts rungs on the oscillator ladder: its eigenvalues are n = 0, 1, 2, …, H = ħω(N + ½), and a and a† move a state down or up one rung with coefficients √n and √(n + 1). Use the supplied topic model Y_out = nu-min(k,ceil(nu)), where Y_out is N ON THE MARKED RUNG (dimensionless). The output symbol Y_out is distinct from all input symbols. ^ denotes a power; π = 3.141592653589793; min(a,b) selects the smaller value. nu is Trial eigenvalue ν of N, dimensionless. Keep k (Lowerings applied k) = 0 fixed. For this exercise use only 0.425 ≤ nu ≤ 3.575 on this continuous branch. A grid of test settings is an input restriction for this exercise, not by itself a claim of physical quantisation. This calculation retains the topic model's stated assumptions; it does not extend them to a different physical setup. Calculate Y_out at nu = 1.118 and 1.559. Find the signed output change ΔY_out and the average sensitivity ΔY_out/Δnu across this interval. State whether the response increases or decreases; distinguish this interval average from a derivative at one point.

Explore the question data

N ON THE MARKED RUNG against nu

Predictions from the supplied The number operator and stepping the ladder model, with all other inputs fixed as stated in the question. 5 calibration points support a trend comparison; they are not measured data or a straight-line law.

Vertical axis (y): N ON THE MARKED RUNG

N ON THE MARKED RUNG against nuPredictions from the supplied The number operator and stepping the ladder model, with all other inputs fixed as stated in the question. 5 calibration points support a trend comparison; they are not measured data or a straight-line law. Horizontal axis: nu: Trial eigenvalue ν of N. Vertical axis: N ON THE MARKED RUNG. Exact values are available in the data table below.0.2991.14922.853.7010.2991.14922.853.701xy

Horizontal axis (x): nu: Trial eigenvalue ν of N

Axes show the supplied calibration interval; the origin may lie outside the plot.

Reading 1nu: Trial eigenvalue ν of N: 0.425N ON THE MARKED RUNG: 0.425
Read the exact data as a table
N ON THE MARKED RUNG against nu — supplied values
nu: Trial eigenvalue ν of NN ON THE MARKED RUNG
0.4250.425
1.21251.2125
22
2.78749999999999962.7874999999999996
3.57499999999999973.5749999999999997

These are the supplied values, not a worked answer. No fitted trend is drawn.

Show a hint

Substitute each value of nu separately while keeping every other input fixed, then subtract in the same order.

Reveal the worked solution
  1. At nu = 1.118, substitute into Y_out = nu-min(k,ceil(nu)): Y₀ = 1.118.
  2. At nu = 1.559, the same fixed-parameter model gives Y₁ = 1.559.
  3. Signed change: ΔY_out = Y₁ − Y₀ = 0.441; the input change is Δnu = 0.441.
  4. Average sensitivity is ΔY_out/Δnu = 1 1 per unit input. Its positive sign means that this response increases over the specified interval.
  5. This is a secant slope between two settings. It equals a point derivative only for a locally linear relation or in a justified small-interval limit.

Answer Y₀ = 1.118, Y₁ = 1.559; ΔY_out = 0.441; average sensitivity = 1 1 per unit input.

Compare the assumptions, method and units with your attempt. Explain any correction before trying another question.

Extra challenging questions

Work through the linked stages and explain what each result means.

Extra challenging · 01

The number operator and stepping the ladder: infer an input with uncertainty

The number operator N = a†a counts rungs on the oscillator ladder: its eigenvalues are n = 0, 1, 2, …, H = ħω(N + ½), and a and a† move a state down or up one rung with coefficients √n and √(n + 1). Use the supplied topic model Y_out = nu-min(k,ceil(nu)), where Y_out is N ON THE MARKED RUNG (dimensionless). The output symbol Y_out is distinct from all input symbols. ^ denotes a power; π = 3.141592653589793; min(a,b) selects the smaller value. nu is Trial eigenvalue ν of N, dimensionless. Keep k (Lowerings applied k) = 0 fixed. For this exercise use only 0.425 ≤ nu ≤ 3.575 on this continuous branch. A grid of test settings is an input restriction for this exercise, not by itself a claim of physical quantisation. This calculation retains the topic model's stated assumptions; it does not extend them to a different physical setup. A reading gives Y_out = 2.3465, with a bounded reading uncertainty ±0.18427. Treat the model and all fixed inputs as exact for this exercise; the bound is not a standard deviation. First estimate the unknown nu by straight-line interpolation between the two endpoint predictions. Then solve the actual model on the stated branch to an absolute input tolerance of 0.000315, using a numerical bracket if required. Find the full input interval consistent with the bounded reading uncertainty and compare it with a symmetric input-error assumption. Do not assume that the supplied calibration points prove monotonicity outside this branch.

Explore the question data

N ON THE MARKED RUNG against nu

Predictions from the supplied The number operator and stepping the ladder model, with all other inputs fixed as stated in the question. 5 calibration points support a trend comparison; they are not measured data or a straight-line law.

Vertical axis (y): N ON THE MARKED RUNG

N ON THE MARKED RUNG against nuPredictions from the supplied The number operator and stepping the ladder model, with all other inputs fixed as stated in the question. 5 calibration points support a trend comparison; they are not measured data or a straight-line law. Horizontal axis: nu: Trial eigenvalue ν of N. Vertical axis: N ON THE MARKED RUNG. Exact values are available in the data table below.0.2991.14922.853.7010.2991.14922.853.701xy

Horizontal axis (x): nu: Trial eigenvalue ν of N

Axes show the supplied calibration interval; the origin may lie outside the plot.

Reading 1nu: Trial eigenvalue ν of N: 0.425N ON THE MARKED RUNG: 0.425
Read the exact data as a table
N ON THE MARKED RUNG against nu — supplied values
nu: Trial eigenvalue ν of NN ON THE MARKED RUNG
0.4250.425
1.21251.2125
22
2.78749999999999962.7874999999999996
3.57499999999999973.5749999999999997

These are the supplied values, not a worked answer. No fitted trend is drawn.

Show a hint

The model's endpoint predictions bracket the reading. Solve Y_out(nu) = Y_measured and then solve again at Y_measured − u and Y_measured + u; a nonlinear inverse can give unequal input deviations.

Reveal the worked solution
  1. Endpoint predictions are Y_out(0.425) = 0.425 and Y_out(3.575) = 3.575. The target lies between them. On the selected branch the response is strictly increasing.
  2. Endpoint interpolation gives nu_line = 0.425 + (2.3465 − 0.425)(3.575 − 0.425)/(3.575 − 0.425) = 2.3465. This estimates the inverse of the endpoint chord, rather than assuming that chord is the physical model.
  3. Use the actual equation, not the chord, and bracket its root. Evaluating the midpoint and retaining the sign-changing half-interval gives nu = 2.3465; substituting back gives Y_out = 2.3465.
  4. The interpolation error in the input is |nu_line − nu| = 0. This is within the requested numerical tolerance.
  5. Invert both limits Y_out = 2.16223 and 2.53077. Sort the roots even if the response decreases: 2.16223 ≤ nu ≤ 2.53077.
  6. The lower and upper input deviations are 0.18427 and 0.18427. They agree on this branch; this does not establish linearity for changes in other inputs or outside the interval. This interval includes reading uncertainty only, not model error or uncertainty in fixed inputs.

Answer nu ≈ 2.3465; compatible interval [2.16223, 2.53077]. Endpoint interpolation gives 2.3465.

Compare the assumptions, method and units with your attempt. Explain any correction before trying another question.