Ma · Mathematics

Eigenvalues of the Left-Shift Plus Right-Shift Operator

Published By the 9to5Science editorial team

At a glance

  1. 1. Define the shifts

    On sequences indexed by nonnegative integers, take the right shift and its adjoint, the left shift.

  2. 2. Write the recurrence

    An eigenvector must satisfy xₙ₋₁ + xₙ₊₁ = λxₙ, with the boundary condition x₋₁ = 0.

  3. 3. Check square summability

    The recurrence solutions are oscillatory or grow; none is a nonzero square-summable sequence.

  4. 4. Find the spectrum

    The operator is self-adjoint, and finite wave packets show its spectrum is the interval from −2 to 2.

The phrase “left shift plus right shift” usually means the sum of the unilateral shift on sequences and its adjoint. On the Hilbert space of square-summable sequences indexed by 0,1,2,…0,1,2,\ldots, this operator has a simple spectrum: the spectrum is [−2,2][-2,2], but there are no eigenvalues.

The distinction between spectrum and eigenvalues is essential here. Every point of the interval belongs to the spectrum, yet the eigenvalue equation has no nonzero solution in the Hilbert space.

Define the shifts

Let H=ℓ2({0,1,2,…})H=\ell^2(\{0,1,2,\ldots\}). For x=(x0,x1,…)x=(x_0,x_1,\ldots), define the right shift SS and left shift S∗S^* by

(Sx)0=0,(Sx)n=xn−1(n≥1),(Sx)_0=0,\qquad (Sx)_n=x_{n-1}\quad(n\geq 1),

and

(S∗x)n=xn+1(n≥0).(S^*x)_n=x_{n+1}\quad(n\geq 0).

These are adjoints of one another. The operator in question is

A=S+S∗,(Ax)n=xn−1+xn+1,A=S+S^*,\qquad (Ax)_n=x_{n-1}+x_{n+1},

where the boundary convention is x−1=0x_{-1}=0. In particular, AA is bounded and self-adjoint.

Solve the eigenvalue equation

Suppose Ax=λxAx=\lambda x. Then the coordinates satisfy

xn−1+xn+1=λxn(n≥0),x−1=0.x_{n-1}+x_{n+1}=\lambda x_n\quad(n\geq 0),\qquad x_{-1}=0.

For −2<λ<2-2<\lambda<2, write λ=2cos⁡θ\lambda=2\cos\theta with 0<θ<π0<\theta<\pi. The recurrence has solutions built from einθe^{in\theta} and e−inθe^{-in\theta}. Applying the boundary condition gives

xn=Csin⁡((n+1)θ)x_n=C\sin((n+1)\theta)

for a constant CC. If C≠0C\ne 0, this sequence does not tend to zero and is not square-summable. Thus it cannot be an eigenvector in HH.

At the endpoints, the recurrence gives xn=C(n+1)x_n=C(n+1) for λ=2\lambda=2 and xn=C(−1)n(n+1)x_n=C(-1)^n(n+1) for λ=−2\lambda=-2. These are not square-summable unless C=0C=0. For ∣λ∣>2|\lambda|>2, the characteristic equation r2−λr+1=0r^2-\lambda r+1=0 has roots with different magnitudes; the boundary condition leaves a solution that grows, rather than a nonzero square-summable sequence. Hence there are no eigenvalues outside the interval either.

So the point spectrum—the set of eigenvalues—is empty.

Why the spectrum is still [−2,2][-2,2]

Because AA is self-adjoint and ∥A∥≤∥S∥+∥S∗∥=2\|A\|\leq \|S\|+\|S^*\|=2, its spectrum must be contained in [−2,2][-2,2]. To see that every point of this interval is in the spectrum, take any λ=2cos⁡θ\lambda=2\cos\theta and use a long, finite block of the sequence einθe^{in\theta}, supported far from the boundary. In the interior of the block, the recurrence is satisfied exactly. The error is confined to the two ends of the block, while the norm of the block grows like the square root of its length. After normalization, the error therefore tends to zero as the block gets longer.

This produces unit vectors vv with ∥(A−λI)v∥\|(A-\lambda I)v\| arbitrarily small. If A−λIA-\lambda I had a bounded inverse, such vectors could not exist. Thus λ\lambda is in the spectrum. Since this works for each λ∈[−2,2]\lambda\in[-2,2], the spectrum is exactly that interval.

A concrete check: λ=0\lambda=0

For λ=0\lambda=0, the recurrence says xn+1=−xn−1x_{n+1}=-x_{n-1}. Starting from x0=cx_0=c, the boundary equation at n=0n=0 gives x1=0x_1=0, and then

x=(c,0,−c,0,c,0,−c,0,…).x=(c,0,-c,0,c,0,-c,0,\ldots).

If c≠0c\ne 0, the squared coordinates do not have a finite sum. So 00 is in the spectrum, but it is not an eigenvalue. Finite truncations of this alternating pattern, placed farther and farther from the boundary, give approximate eigenvectors instead.

Common mistakes

  • Calling every spectral value an eigenvalue. A spectral value need not have an eigenvector. Here the entire interval is spectrum, but the point spectrum is empty.
  • Ignoring the boundary condition. The equation at index 00 is x1=λx0x_1=\lambda x_0, not an interior recurrence with a freely chosen x−1x_{-1}.
  • Using a bounded oscillating sequence as an eigenvector. Boundedness is not enough: an eigenvector must belong to ℓ2\ell^2, so its squared coordinates must have a finite sum.
  • Confusing ℓ2\ell^2 with L2([0,∞))L^2([0,\infty)). The notation in the title is commonly used informally for sequences on the nonnegative integers. If instead the space is L2L^2 of the continuous half-line and the shifts are translations by a fixed distance hh, the analogous sum of right translation and its adjoint has the same spectrum and no eigenvalues; the coordinates can be grouped into sequences along each arithmetic progression modulo hh.

References

  1. A Course in Functional Analysis — John B. Conway

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.