all elements of hilbert spaces with orthonormal bases can be written as sums of the basis elements

[[concept]]

[!themes] Topics

Evaluation Error: SyntaxError: Unexpected token '>'

at DataviewInlineApi.eval (plugin:dataview:19027:21)
at evalInContext (plugin:dataview:19028:7)
at asyncEvalInContext (plugin:dataview:19038:32)
at DataviewJSRenderer.render (plugin:dataview:19064:19)
at DataviewJSRenderer.onload (plugin:dataview:18606:14)
at DataviewJSRenderer.load (app://obsidian.md/app.js:1:1182416)
at DataviewApi.executeJs (plugin:dataview:19607:18)
at DataviewCompiler.eval (plugin:digitalgarden:10763:23)
at Generator.next (<anonymous>)
at eval (plugin:digitalgarden:90:61)

Theorem

If {en} is an orthonormal basis of a hilbert space H, then for all u∈H we have

limm→∞∑n=1m⟨u,en⟩en=∑n=1∞⟨u,en⟩en=u
Note

Thus if we have an orthonormal basis, every element can be expanded in this series in terms of the basis elements (called a Bessel-Fourier series). And thus every separable Hilbert space has an orthonormal basis.

Note

ie like in finite-dimensional linear algebra, we can write any element as a linear combination of the basis elements. But in this space, there might be an infinite number of such elements.

Proof (via Bessel's inequality)

First, we prove {∑n=1m⟨u,en⟩en}m is Cauchy. Let ϵ>0. Then by Bessel's inequality, we have

\sum_{n=1}^\infty \lvert \langle u, e_{n} \rangle \rvert { #2} \leq \lvert \lvert u \rvert \rvert { #2} < \infty

Thus, for all M∈N such that for all N≥M we have ∑m=N+1∞|⟨u,en⟩|2<ϵ

Then for all m>ℓ≥M we compute

\begin{align} \left\lvert \left\lvert \sum_{n=1}^m \langle u, e_{n} \rangle e_{n} - \sum_{n=1}^\ell \langle u, e_{n} \rangle e_{n} \right\rvert \right\rvert &= \sum_{n=\ell+1}^m \lvert \langle u, e_{n} \rangle \rvert { #2} \\ &\leq \sum_{\ell+1}^\infty \lvert \langle u, e_{n} \rangle \rvert { #2} \\ &< \epsilon^2 \end{align}

thus the sequence is indeed Cauchy. Since H is complete, there exists some u¯∈H where

u¯=limm→∞∑n=1m⟨u,en⟩en

By continuity of inner product, we know that for all ℓ∈N

⟨u−u¯,eℓ⟩=limm→∞⟨u−∑n=1m⟨u,en⟩en,eℓ⟩=limm→∞[⟨u,eℓ⟩−∑n=1m⟨u,en⟩⟨en,eℓ⟩]=⟨u,eℓ⟩−⟨u,eℓ⋅1⟩=0

Thus ⟨u−u¯,eℓ⟩=0 for all ℓ if and only if u−u¯=0.

◼

References

References

See Also

Mentions

Mentions

const modules = await cJS()

const COLUMNS = [  
	{ id: "Name", value: page => page.$link },  
	{ id: "Last Modified", value: page => modules.dateTime.getLastMod(page) },
];  
  
return function View() {  
	const current = dc.useCurrentFile();
// Selecting `#game` pages, for example. 
	let queryString = `@page and linksto(${current.$link})`;
	let pages = dc.useQuery(queryString);
	
	// check types
	pages = pages.filter( (p) => !modules.typeCheck.checkAll(p, current) ).sort()
	
	
	return <dc.Table columns={COLUMNS} rows={pages} paging={20}/>;  
}  

const { dateTime } = await cJS()

return function View() {
	const file = dc.useCurrentFile();
	return <p class="dv-modified">Created {dateTime.getCreated(file)}     ֍     Last Modified {dateTime.getLastMod(file)}</p>
}