Examples of spectral decompositions

  • Context: MHB 
  • Thread starter Thread starter Boromir
  • Start date Start date
Click For Summary
SUMMARY

This discussion focuses on spectral decompositions for normal compact and non-compact operators on Hilbert spaces. Key examples include the spectral resolution of a normal \( n \times n \) matrix, which can be diagonalized, and the resolvent of a self-adjoint differential operator, specifically using Sturm–Liouville theory. The discussion highlights the importance of eigenvalues and eigenvectors in obtaining spectral decompositions, particularly in the context of the operator \( L(f) = f'' \) defined on the space of smooth \( 2\pi \)-periodic functions.

PREREQUISITES
  • Understanding of Hilbert spaces and their properties
  • Familiarity with normal operators and their spectral properties
  • Knowledge of Sturm–Liouville theory
  • Basic concepts of differential equations and eigenvalue problems
NEXT STEPS
  • Study the spectral decomposition of normal operators in Hilbert spaces
  • Learn about Sturm–Liouville theory and its applications in spectral analysis
  • Explore the properties of self-adjoint operators and their eigenvalues
  • Investigate Fourier analysis and its relation to spectral decompositions
USEFUL FOR

Mathematicians, physicists, and engineers interested in functional analysis, particularly those working with differential operators and spectral theory.

Boromir
Messages
37
Reaction score
0
I would like examples of spectral decompositions and how they are obtained for normal compact operators and normal non-compact operators on a hilbert space.
I have googled it, but all I can find are proofs of the theorems; no concrete examples. I can't imagine it is that hard, for example for normal compact operator we only need the eigenvalues and eigenvectors of the operator.

Thanks
 
Physics news on Phys.org
Boromir said:
I would like examples of spectral decompositions and how they are obtained for normal compact operators and normal non-compact operators on a hilbert space.
The easiest example of a spectral resolution is the finite-dimensional case, where the spectral decomposition of a normal $n\times n$ matrix is equivalent to the fact that the matrix can be diagonalised. The spectral subspaces are then just the eigenspaces of the matrix.

A more complicated example is given by the resolvent of a selfadjoint differential operator. In that case, the spectral resolution is obtained by the techniques of Sturm–Liouville theory.
 
Opalg said:
The easiest example of a spectral resolution is the finite-dimensional case, where the spectral decomposition of a normal $n\times n$ matrix is equivalent to the fact that the matrix can be diagonalised. The spectral subspaces are then just the eigenspaces of the matrix.

A more complicated example is given by the resolvent of a selfadjoint differential operator. In that case, the spectral resolution is obtained by the techniques of Sturm–Liouville theory.

ok are compact normal operator more promising (easier) ground?
 
Boromir said:
I would like examples of spectral decompositions and how they are obtained for normal compact operators and normal non-compact operators on a hilbert space.
I have googled it, but all I can find are proofs of the theorems; no concrete examples. I can't imagine it is that hard, for example for normal compact operator we only need the eigenvalues and eigenvectors of the operator.

Thanks

Based on what Opalg said consider the following example.

Let $X$ be the space of all smooth ($\mathcal{C}^{\infty}$) function that are $2\pi$-periodic. In other words, $X$ consists of all functions of all smooth $f:\mathbb{R}\to \mathbb{C}$ such that $f(x+2\pi) = f(x)$.

We define a (Herminitian) inner product $\left< \cdot , \cdot \right>: X\times X \to \mathbb{C}$ by,
$$ \left< f,g\right> = \int_{-\pi}^{\pi} f\cdot \overline{g} $$

Verify that $(X, \left< \cdot , \cdot \right>)$ is a compact space with an inner product. Define the following operator,
$$ L:X\to X \text{ by }L(f) = f'' $$
We argue that this operator is self-adjoint, by integration by parts,
$$ \left< L(f),g\right> = \int_{-\pi}^{\pi} f''\cdot \overline{g} = f'\overline{g}'\bigg|_{-\pi}^{\pi} - \int_{-\pi}^{\pi}f'\overline{g}' = -\int_{-\pi}^{\pi}f'\overline{g}' $$
Note, the evaluation at $\pm \pi$ cancels out because $f',g'$ are $2\pi$-periodic functions. Now by repeating integration by parts a second time we see,
$$ -\int_{-\pi}^{\pi}f'\overline{g}' = \int_{-\pi}^{\pi} f\overline{g}'' = \left< f,L(g)\right> $$
Now that $\left< L(f),g\right> = \left<f,L(g)\right>$ is self-adjoint.

It now follows by the theory of self-adjoint operators that the eigenvalues of $L$ are real. Let us suppose that $k$ is an eigenvalue of $k$ so $L(f) = kf$ for some non-zero $f$. Thus, we are led to the differencial equation $f'' = kf$.

Suppose that $k>0$ so can then write $k=a^2$ for real number $a$, the solution to the DE gives us that $f = c_1\sin(ax) + c_2\cos(ax)$. But $f$ must have period $2\pi$ and so it means that $a = n$ must be an integer. Therefore, $\sin(nx)$ and $\cos(nx)$ where $n\in \mathbb{Z}$ is a collection of eigenvectors of $L$. Since sine is odd and cosine is even we can describe these eigenvectors of $L$ by $E=\{1,\sin(nx),\cos(nx)\}$ where $n\geq 1$. Furthermore, every eigenvector with positive eigenvalue of $L$ is a linear combination of these ones.

The case $k\leq 0$ leads to no eigenvalues, it is an exercise to confirm this. Thus, our list above $E$ is a complete list of all eigenvalues of $L$, in the sense that every eigenvalue is a linear combination of the ones we gave above.

It is not true however that given any $f\in X$ we can express $f$ as a linear combination of $E$. But we can do it if we allow infinitely many of the $E$, more precisely, $f$ can be expressed as an infinite series (convergence in the inner-product sense) of those eigenvalues, this is exactly what Fourier analysis is about.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 33 ·
2
Replies
33
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K