\documentclass[12pt,titlepage]{article}

\usepackage{amsmath}
\usepackage{mathrsfs}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{mathbbol}
\usepackage{graphicx}
\usepackage{color}
\usepackage{ucs}
\usepackage[utf8x]{inputenc}
\usepackage{xparse}
\usepackage{hyperref}

%----Macros----------
%
% Unresolved issues:
%
%  \righttoleftarrow
%  \lefttorightarrow
%
%  \color{} with HTML colorspec
%  \bgcolor
%  \array with options (without options, it's equivalent to the matrix environment)

% Of the standard HTML named colors, white, black, red, green, blue and yellow
% are predefined in the color package. Here are the rest.
\definecolor{aqua}{rgb}{0, 1.0, 1.0}
\definecolor{fuschia}{rgb}{1.0, 0, 1.0}
\definecolor{gray}{rgb}{0.502, 0.502, 0.502}
\definecolor{lime}{rgb}{0, 1.0, 0}
\definecolor{maroon}{rgb}{0.502, 0, 0}
\definecolor{navy}{rgb}{0, 0, 0.502}
\definecolor{olive}{rgb}{0.502, 0.502, 0}
\definecolor{purple}{rgb}{0.502, 0, 0.502}
\definecolor{silver}{rgb}{0.753, 0.753, 0.753}
\definecolor{teal}{rgb}{0, 0.502, 0.502}

% Because of conflicts, \space and \mathop are converted to
% \itexspace and \operatorname during preprocessing.

% itex: \space{ht}{dp}{wd}
%
% Height and baseline depth measurements are in units of tenths of an ex while
% the width is measured in tenths of an em.
\makeatletter
\newdimen\itex@wd%
\newdimen\itex@dp%
\newdimen\itex@thd%
\def\itexspace#1#2#3{\itex@wd=#3em%
\itex@wd=0.1\itex@wd%
\itex@dp=#2ex%
\itex@dp=0.1\itex@dp%
\itex@thd=#1ex%
\itex@thd=0.1\itex@thd%
\advance\itex@thd\the\itex@dp%
\makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}}
\makeatother

% \tensor and \multiscript
\makeatletter
\newif\if@sup
\newtoks\@sups
\def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}%
\def\reset@sup{\@supfalse\@sups={}}%
\def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else%
  \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}%
  \else \append@sup#2 \@suptrue \fi%
  \expandafter\mk@scripts\fi}
\def\tensor#1#2{\reset@sup#1\mk@scripts#2_/}
\def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2%
  \reset@sup\mk@scripts#3_/}
\makeatother

% \slash
\makeatletter
\newbox\slashbox \setbox\slashbox=\hbox{$/$}
\def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$}
  \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa
  \copy\slashbox \kern-\@tempdima \box\@tempboxa}
\def\slash{\protect\itex@pslash}
\makeatother

% math-mode versions of \rlap, etc
% from Alexander Perlis, "A complement to \smash, \llap, and lap"
%   http://math.arizona.edu/~aprl/publications/mathclap/
\def\clap#1{\hbox to 0pt{\hss#1\hss}}
\def\mathllap{\mathpalette\mathllapinternal}
\def\mathrlap{\mathpalette\mathrlapinternal}
\def\mathclap{\mathpalette\mathclapinternal}
\def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}}
\def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}}
\def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}}

% Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2}
\let\oldroot\root
\def\root#1#2{\oldroot #1 \of{#2}}
\renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}}

% Manually declare the txfonts symbolsC font
\DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n}
\SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n}
\DeclareFontSubstitution{U}{txsyc}{m}{n}

% Manually declare the stmaryrd font
\DeclareSymbolFont{stmry}{U}{stmry}{m}{n}
\SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n}

% Manually declare the MnSymbolE font
\DeclareFontFamily{OMX}{MnSymbolE}{}
\DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n}
\SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n}
\DeclareFontShape{OMX}{MnSymbolE}{m}{n}{
    <-6>  MnSymbolE5
   <6-7>  MnSymbolE6
   <7-8>  MnSymbolE7
   <8-9>  MnSymbolE8
   <9-10> MnSymbolE9
  <10-12> MnSymbolE10
  <12->   MnSymbolE12}{}

% Declare specific arrows from txfonts without loading the full package
\makeatletter
\def\re@DeclareMathSymbol#1#2#3#4{%
    \let#1=\undefined
    \DeclareMathSymbol{#1}{#2}{#3}{#4}}
\re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46}
\re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12}
\re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64}
\re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6}
\re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77}
\re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77}
\makeatother

% \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE
\makeatletter
\def\Decl@Mn@Delim#1#2#3#4{%
  \if\relax\noexpand#1%
    \let#1\undefined
  \fi
  \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}}
\def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}}
\def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}}
\Decl@Mn@Open{\llangle}{mnomx}{'164}
\Decl@Mn@Close{\rrangle}{mnomx}{'171}
\Decl@Mn@Open{\lmoustache}{mnomx}{'245}
\Decl@Mn@Close{\rmoustache}{mnomx}{'244}
\makeatother

% Widecheck
\makeatletter
\DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}}
\def\@widecheck#1#2{%
    \setbox\z@\hbox{\m@th$#1#2$}%
    \setbox\tw@\hbox{\m@th$#1%
       \widehat{%
          \vrule\@width\z@\@height\ht\z@
          \vrule\@height\z@\@width\wd\z@}$}%
    \dp\tw@-\ht\z@
    \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@
    \setbox\tw@\hbox{%
       \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box
\tw@}}}%
    {\ooalign{\box\tw@ \cr \box\z@}}}
\makeatother

% \mathraisebox{voffset}[height][depth]{something}
\makeatletter
\NewDocumentCommand\mathraisebox{moom}{%
\IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{%
\IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}%
}{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}%
\mathpalette\@temp{#4}}
\makeatletter

% udots (taken from yhmath)
\makeatletter
\def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.}
\mkern2mu\raise4\p@\hbox{.}\mkern1mu
\raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}}
\makeatother

%% Fix array
\newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}}
%% \itexnum is a noop
\newcommand{\itexnum}[1]{#1}

%% Renaming existing commands
\newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}}
\newcommand{\widevec}{\overrightarrow}
\newcommand{\darr}{\downarrow}
\newcommand{\nearr}{\nearrow}
\newcommand{\nwarr}{\nwarrow}
\newcommand{\searr}{\searrow}
\newcommand{\swarr}{\swarrow}
\newcommand{\curvearrowbotright}{\curvearrowright}
\newcommand{\uparr}{\uparrow}
\newcommand{\downuparrow}{\updownarrow}
\newcommand{\duparr}{\updownarrow}
\newcommand{\updarr}{\updownarrow}
\newcommand{\gt}{>}
\newcommand{\lt}{<}
\newcommand{\map}{\mapsto}
\newcommand{\embedsin}{\hookrightarrow}
\newcommand{\Alpha}{A}
\newcommand{\Beta}{B}
\newcommand{\Zeta}{Z}
\newcommand{\Eta}{H}
\newcommand{\Iota}{I}
\newcommand{\Kappa}{K}
\newcommand{\Mu}{M}
\newcommand{\Nu}{N}
\newcommand{\Rho}{P}
\newcommand{\Tau}{T}
\newcommand{\Upsi}{\Upsilon}
\newcommand{\omicron}{o}
\newcommand{\lang}{\langle}
\newcommand{\rang}{\rangle}
\newcommand{\Union}{\bigcup}
\newcommand{\Intersection}{\bigcap}
\newcommand{\Oplus}{\bigoplus}
\newcommand{\Otimes}{\bigotimes}
\newcommand{\Wedge}{\bigwedge}
\newcommand{\Vee}{\bigvee}
\newcommand{\coproduct}{\coprod}
\newcommand{\product}{\prod}
\newcommand{\closure}{\overline}
\newcommand{\integral}{\int}
\newcommand{\doubleintegral}{\iint}
\newcommand{\tripleintegral}{\iiint}
\newcommand{\quadrupleintegral}{\iiiint}
\newcommand{\conint}{\oint}
\newcommand{\contourintegral}{\oint}
\newcommand{\infinity}{\infty}
\newcommand{\bottom}{\bot}
\newcommand{\minusb}{\boxminus}
\newcommand{\plusb}{\boxplus}
\newcommand{\timesb}{\boxtimes}
\newcommand{\intersection}{\cap}
\newcommand{\union}{\cup}
\newcommand{\Del}{\nabla}
\newcommand{\odash}{\circleddash}
\newcommand{\negspace}{\!}
\newcommand{\widebar}{\overline}
\newcommand{\textsize}{\normalsize}
\renewcommand{\scriptsize}{\scriptstyle}
\newcommand{\scriptscriptsize}{\scriptscriptstyle}
\newcommand{\mathfr}{\mathfrak}
\newcommand{\statusline}[2]{#2}
\newcommand{\tooltip}[2]{#2}
\newcommand{\toggle}[2]{#2}

% Theorem Environments
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{cor}{Corollary}
\newtheorem*{utheorem}{Theorem}
\newtheorem*{ulemma}{Lemma}
\newtheorem*{uprop}{Proposition}
\newtheorem*{ucor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}
\newtheorem{example}{Example}
\newtheorem*{udefn}{Definition}
\newtheorem*{uexample}{Example}
\theoremstyle{remark}
\newtheorem{remark}{Remark}
\newtheorem{note}{Note}
\newtheorem*{uremark}{Remark}
\newtheorem*{unote}{Note}

%-------------------------------------------------------------------

\begin{document}

%-------------------------------------------------------------------


\section*{spectral theorem}

\hypertarget{context}{}\subsubsection*{{Context}}\label{context}

\hypertarget{functional_analysis}{}\paragraph*{{Functional analysis}}\label{functional_analysis}

[[!include functional analysis - contents]]

\hypertarget{contents}{}\section*{{Contents}}\label{contents}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{versions_of_the_theorem}{Versions of the theorem}\dotfill \pageref*{versions_of_the_theorem} \linebreak
\noindent\hyperlink{memory_hook}{Memory hook}\dotfill \pageref*{memory_hook} \linebreak
\noindent\hyperlink{selfadjoint_operators}{Selfadjoint operators}\dotfill \pageref*{selfadjoint_operators} \linebreak
\noindent\hyperlink{borel_functional_calculus}{Borel functional calculus}\dotfill \pageref*{borel_functional_calculus} \linebreak
\noindent\hyperlink{compact_operators}{Compact operators}\dotfill \pageref*{compact_operators} \linebreak
\noindent\hyperlink{normal_operators}{Normal operators}\dotfill \pageref*{normal_operators} \linebreak
\noindent\hyperlink{proofs}{Proofs}\dotfill \pageref*{proofs} \linebreak
\noindent\hyperlink{}{\ldots{}}\dotfill \pageref*{} \linebreak
\noindent\hyperlink{by_lagrange_multipliers}{By Lagrange multipliers}\dotfill \pageref*{by_lagrange_multipliers} \linebreak
\noindent\hyperlink{related_entries}{Related entries}\dotfill \pageref*{related_entries} \linebreak


\hypertarget{idea}{}\subsection*{{Idea}}\label{idea}

The \textbf{spectral theorems} form a cornerstone of [[functional analysis]]. They are a vast generalization to infinite-dimensional [[Hilbert spaces]] of a basic result in linear algebra: an $n \times n$ Hermitian matrix can be diagonalized or conjugated to a diagonal matrix with real entries along the diagonal.

There is a caveat, though: if we consider a separable Hilbert space $\mathcal{H}$ then we can choose a countable orthonormal (Hilbert) basis $\{e_n\}$ of $\mathcal{H}$, a linear operator $A$ then has a matrix representation in this basis just as in finite dimensional linear algebra. The spectral theorem does \emph{not} say that for every selfadjoint $A$ there is a basis so that $A$ has a diagonal matrix with respect to it. The situation that comes closest to the analogy of finite dimensions is the spectral theorem for compact operators.

There are several versions of the spectral theorem, or several spectral theorems, differing in the kind of operator considered (bounded or unbounded, selfadjoint or normal) and the phrasing of the statement (via spectral measures, multiplication operator norm), which is why this page does not consist of \emph{one} statement only. Plus there are several different strategies to prove e.g. the spectral theorem for bounded selfadjoint operators, so there is no \emph{canonical} way to prove it (none is particularly simple).

\hypertarget{versions_of_the_theorem}{}\subsection*{{Versions of the theorem}}\label{versions_of_the_theorem}

\hypertarget{memory_hook}{}\subsubsection*{{Memory hook}}\label{memory_hook}

This is a short description of a way to prove the spectral theorem for bounded, selfadjoint operators in the spectral measure form, it may serve as a memory hook:

Let $\mathcal{H}$ be a Hilbert space and A be an selfadjoint operator on $\mathcal{H}$. Then we can form the smallest [[von Neumann algebra]] $\mathcal{R}$ generated by both A and $\mathbb{1}$, the identity operator. This is an abelian algebra, that is, via the [[Gelfand representation]], the abelian version of the [[Gelfand-Naimark theorem]], isometric isomorph to the algebra of continuous complex valued functions of a compact Hausdorff space. The spectral integral of A now becomes the Lebesgue (or Riemann) integral of a continuous function.

\hypertarget{selfadjoint_operators}{}\subsubsection*{{Selfadjoint operators}}\label{selfadjoint_operators}

\begin{itemize}%
\item theorem: there is a one to one correspondence of (bounded or unbounded) selfadjoint operators $A$ and [[spectral measure]]s E such that\begin{displaymath}
A = \integral \lambda E(d\lambda)
\end{displaymath}
A is bounded iff E is bounded.



\end{itemize}
\hypertarget{borel_functional_calculus}{}\subsubsection*{{Borel functional calculus}}\label{borel_functional_calculus}

As stated on the [[spectral measure]] page, given a resolution of the identity $E$ one can make sense of $E(u)$ for any function $u$ that is Borel measurable. Since we have for a selfadjoint operator $A = E(u)$ for $u(\lambda) = \lambda$, one can define a bounded operator $u(A)$ for every \emph{bounded} Borel measurable function $u$.

\hypertarget{compact_operators}{}\subsubsection*{{Compact operators}}\label{compact_operators}

The special case of compact operators is mentioned here because it comes closest to the finite dimensional situation of diagonalizing Hermitian matrixes.

\begin{itemize}%
\item theorem: let $A$ be a compact selfadjoint operator, then the spectrum of $A$ consists of eigenvalues only, and all eigenvalues $\neq 0$ have finite multiplicity. Therefore, the spectral theorem says in this case, that\begin{displaymath}
A = \sum \lambda_k |x\rangle \langle x|
\end{displaymath}
where $\lambda_k$ is an eigenvalue (each eigenvalue appears n times if n is its multiplicity) and $x$ an eigenvector with eigenvalue $\lambda_k$.



\end{itemize}
The converse statement is of course true, too, given a sequence $(\lambda_n)$ in $\mathbb{C}$ convergent to $0$, the sum above (with arbitrary $x \in \mathcal{H}, \|x\| = 1$) defines a normal compact operator, and a selfadjoint compact operator iff all $\lambda_n$ are real. It is possible to generalize the statement to compact operators on (not necessarily complete) normed spaces.

\hypertarget{normal_operators}{}\subsubsection*{{Normal operators}}\label{normal_operators}

(\ldots{}) [[normal operator]] (\ldots{})

\hypertarget{proofs}{}\subsection*{{Proofs}}\label{proofs}

\hypertarget{}{}\subsubsection*{{\ldots{}}}\label{}

\hypertarget{by_lagrange_multipliers}{}\subsubsection*{{By Lagrange multipliers}}\label{by_lagrange_multipliers}

For the case of symmetric real matrices there is a simple proof using [[Lagrange multiplier]] techniques.

See \href{http://ncatlab.org/nlab/show/Lagrange+multiplier#ApplicationToSpectralTheory}{Lagrange multiplier -- Applications -- To Spectral theory}.

\hypertarget{related_entries}{}\subsection*{{Related entries}}\label{related_entries}

\begin{itemize}%
\item For [[unitary matrices]] the spectal theorem is equivalently \href{maximal+torus#Properties}{Cartan's theorem} that every element in $U(n)$ is conjugate to an element in its [[maximal torus]].

\end{itemize}
[[!redirects spectral theorems]]



\end{document}