Bound-State Counting
Bound-state counting asks a simpler question than solving the spectrum:
How many normalizable energy eigenstates does this potential support?
In one dimension, the answer is often accessible before the exact energies are known. Boundary conditions, node counting, graphical eigenvalue equations, and scaling estimates can all constrain the count. This page collects the practical undergraduate tools. Detailed WKB derivations and rigorous spectral bounds belong elsewhere.
Throughout this page, assume a real one-dimensional Hamiltonian of the form
with a potential that approaches the continuum threshold at infinity. When as , bound states have and square-integrable wavefunctions.
What Must Be Counted
Section titled “What Must Be Counted”A bound state is a normalizable eigenstate:
For potentials approaching zero at infinity, the continuum begins at . A bound state must lie below that threshold:
Counting bound states therefore means counting the discrete eigenvalues below the continuum threshold, not merely counting oscillatory solutions inside the attractive region. Every candidate must satisfy the matching conditions and decay at infinity.
First Qualitative Rules
Section titled “First Qualitative Rules”Several checks come before algebra:
- A deeper or wider attractive region usually supports more bound states.
- A larger particle mass lowers kinetic-energy cost and usually supports more bound states.
- The one-dimensional ground state is nodeless under ordinary assumptions.
- The th bound state has interior nodes if counting begins with .
- A new bound state enters from threshold with a very long tail.
- For symmetric wells, parity alternates between even and odd states.
The node and parity logic is developed conceptually in Qualitative Features of One-Dimensional Bound States. Here the emphasis is counting.
Finite Square Well Counting
Section titled “Finite Square Well Counting”For the symmetric finite square well
bound states satisfy
Use the standard dimensionless variables
The finite-well page derives
The even bound states obey
and the odd bound states obey
The right-hand side is the upper half of a circle of radius in the - plane. Counting roots becomes a graphical problem.
Graphical Root Intervals
Section titled “Graphical Root Intervals”The even equation has one root in each interval
provided the interval is reached before . The odd equation has one root in each interval
again provided the interval lies below the cutoff .
Thus, away from exact threshold values, the finite square well has approximately
bound states.
This formula should be read with its caveat. If is exactly an integer, the highest would-be state is at threshold and is not square-normalizable. In that exact case, the count is one smaller than the expression above. Small perturbations of the well move such a threshold state either into or out of the bound spectrum.
Thresholds
Section titled “Thresholds”The first even state exists for every attractive finite square well in one dimension. Additional states appear at threshold when crosses half-integer multiples of :
At threshold, , so the outside decay length
diverges. A newly born bound state is therefore spatially large. This is why near-threshold levels are sensitive to small changes in the potential.
Scaling With Depth, Width, And Mass
Section titled “Scaling With Depth, Width, And Mass”The finite-well strength parameter
contains the main scaling information:
- increasing the half-width increases linearly;
- increasing the depth increases like ;
- increasing the mass increases like ;
- increasing would reduce , reflecting stronger wave effects.
The rough count
says that the number of bound states is controlled by how many half-wavelengths can fit inside the attractive region before the continuum threshold is reached.
This scaling is often more useful than the exact finite-well formula. A wide shallow well and a narrow deep well can have the same and therefore similar counts, even though their wavefunctions and energies differ.
Node Counting As A Check
Section titled “Node Counting As A Check”Once a numerical or graphical calculation claims bound states, the node pattern should match:
If a purported third bound state has no node, something is wrong: either the eigenstates were not sorted by energy, the boundary conditions were applied incorrectly, or the calculation is not solving the intended one-dimensional self-adjoint problem.
For an even potential, parity gives another check. The low-lying sequence usually alternates:
Singular potentials, constrained domains, and radial reductions require more care, but the node check is extremely reliable for ordinary one-dimensional wells.
Weak Attractive Wells
Section titled “Weak Attractive Wells”One dimension is special: under broad standard conditions, an arbitrarily weak purely attractive potential can support a bound state. The Delta-Function Potential is the cleanest example. For
there is always one bound state,
This should not be overgeneralized. Potentials with repulsive parts, unusual boundary conditions, higher dimensions, or singular behavior can have different threshold rules. But it is a useful warning against the intuition that a finite minimum depth is always required.
Semiclassical Counting Preview
Section titled “Semiclassical Counting Preview”For a smooth attractive well, a semiclassical estimate counts phase-space area. At energy , the local classical momentum in the allowed region is
The WKB counting rule for levels below has the schematic form
For the total number of bound states in a well with continuum threshold , a rough estimate is
This formula captures the scaling with mass, depth, and width. It does not determine the exact integer count near threshold, and it should not be blindly applied to hard walls, delta potentials, or discontinuous wells without modified endpoint phases.
For the finite square well, the estimate gives
which is precisely the leading part of the finite-well count. The extra order-one information comes from matching and endpoint behavior.
The full WKB derivation is part of Bohr–Sommerfeld Quantization.
Numerical Counting Workflow
Section titled “Numerical Counting Workflow”For a general one-dimensional potential, a practical workflow is:
- Identify the continuum threshold and shift energies consistently.
- Choose a sufficiently large numerical interval so bound-state tails are negligible at the edges.
- Discretize the Hamiltonian or use a spectral method.
- Count eigenvalues below the threshold.
- Check that the wavefunctions decay before the artificial boundary.
- Verify node ordering and, when available, parity.
- Repeat with a larger box or finer grid to ensure the count is stable.
Numerical boxes can create fake discrete levels above threshold. Those are discretized continuum states, not bound states. The decay check is what separates genuine bound states from box artifacts.
Common Mistakes
Section titled “Common Mistakes”- Counting every root of a transcendental equation without checking the energy range.
- Forgetting that a threshold state with is not square-normalizable on the line.
- Using the infinite-well count for a finite well without accounting for tails.
- Treating the semiclassical estimate as an exact integer formula.
- Forgetting that width changes the count more strongly than depth when depth is varied only modestly.
- Missing a weakly bound state because its tail is much longer than the plotted region.
- Counting discretized continuum states from a numerical box as physical bound states.
Where This Is Used
Section titled “Where This Is Used”- Finite Square Well gives the canonical graphical root equations.
- Energy Scales in One Dimension summarizes the confinement, tail, and depth-width scales behind counting estimates.
- Delta-Function Potential illustrates the one-dimensional weak-attraction lesson.
- Double Delta Potential has a second bound state only above an explicit threshold.
- Qualitative Features of One-Dimensional Bound States explains node ordering, tails, and parity checks.
- Sturm–Liouville Theory gives the mathematical framework behind real eigenvalues and ordered nodes.
- Matrix Diagonalization gives a numerical route to stable counts.
- Bohr–Sommerfeld Quantization develops the semiclassical action-counting rule.
References
Section titled “References”- D. J. Griffiths and D. F. Schroeter, Introduction to Quantum Mechanics, 3rd ed., Cambridge University Press, 2018.
- R. Shankar, Principles of Quantum Mechanics, 2nd ed., Springer, 1994.
- L. D. Landau and E. M. Lifshitz, Quantum Mechanics: Non-Relativistic Theory, 3rd ed., Pergamon, 1977.
- G. Teschl, Mathematical Methods in Quantum Mechanics, 2nd ed., American Mathematical Society, 2014.
- S. Flügge, Practical Quantum Mechanics, Springer, 1999.
Exercises
Section titled “Exercises”- A finite square well has . Estimate the number of bound states.
Solution
Use the finite-well counting guide
For ,
Thus
The two states are the ground even state and the first odd state.
- What happens at the exact threshold ?
Solution
The guide formula gives
But the second state is exactly at threshold, where the outside decay constant is . It is not square-normalizable on the line. Therefore the actual number of bound states at the exact threshold is . Just above threshold, the odd state becomes genuinely bound.
- If the width of a finite square well is doubled while and are fixed, how does the rough count change?
Solution
The strength parameter is
Doubling the half-width doubles . Since the leading count scales like
the number of bound states roughly doubles, up to the integer rounding and threshold caveats.
- A numerical calculation finds four bound states in a regular one-dimensional well. How many interior nodes should the highest one have?
Solution
Ordering states from the ground state as , the node rule gives interior nodes for . The fourth bound state is , so it should have three interior nodes.
- Apply the semiclassical estimate to the finite square well and compare with the finite-well count.
Solution
For the square well,
The threshold estimate gives
Using
this becomes
The finite-well graphical count is approximately
away from exact thresholds. The semiclassical estimate captures the leading scale but not the exact integer rounding.