Functional Analysis Lecture 5

[[lecture-data]]

← Lecture 4 | Lecture 6 → Lecture Notes: Rodriguez, page 22

 

1. Norm and Banach Spaces

Las time, we talked about the Hahn-Banach theorem.

Recall from last time:

Zorn's Lemma

If every chain in a nonempty, partially ordered set has an upper bound, then contains a maximal element.

[!def] Hamel basis

A Hamel basis is a linearly independent set such that every element of is a finite linear combination of elements in .

Example

1 \\ 0 \end{bmatrix}, \begin{bmatrix} 0 \\ 1 \end{bmatrix} \right\}$$ is a [[Hamel basis]] for $\mathbb{R}^2$.

It is not immediately obvious that every vector space has a Hamel basis, so we start by proving this via Zorn’s lemma.

Theorem

If is a vector space, then has a Hamel basis.

Proof

Let be the set of linearly independent subsets of . Define a partial order on , via inclusion: Towards applying Zorn, let be a chain in . Define This is a linearly independent subset:

  • Let . Thus there exist where for all we have .
  • Since is a chain, there exists some such that for all we have (ie ). Thus .

Now, since is a linearly independent subset, this implies that are themselves linearly independent. Thus

Thus for all , we have . ie, there is an upper bound of .

By Zorn’s lemma, has a maximal element . I claim that spans .

Suppose BWOC that does not span . Then there exists some such that cannot be written as a finite linear combination of elements in . Then is linearly independent. But then and so is not maximal

Thus spans .

Thus every vector space has a Hamel basis \tag*{$\blacksquare$}

see every vector space has a hamel basis

Hahn-Banach theorem

Let be a normed vector space and a subspace. If is a linear map such that for all (ie, we have a bounded linear functional), then there exists a continuous extension such that and (with the same as above)

Lemma

If is a normed vector space and is a subspace and is linear such that for all , and

  • Then there exists a function which is linear
  • (Where ) Such that and for all we have

See we can always extend functions on subspaces

Strategy for using this lemma to prove Hahn-Banach:

  1. Place a partial order on all continuous extensions of
  2. Apply Zorn’s lemma to this set, giving us a maximal element
  3. Use the lemma to show that this maximal extension is defined on all of our desired space

Proof (of Hahn-Banach)

Let be the set of all continuous extensions of : ie, each element is a bounded linear functional on with the same bound as the original functional .

Now, define the partial order on as follows: Let be a chain in indexed by the set : Then for all either or vice versa. Now, let be the union of all such subspaces . We can show that is indeed a subspace.

Let and . Then there exist such that and . Since is a chain, WLOG, .

Then is a subspace of .

Now we can define by

  • if then

Is this well-defined? ie, if does this mean ?

  • Suppose and . Since then . Thus is an extension of

Similarly, we can show that is linear and also the extension of any .

So then for all , we have . ie, is an upper bound for .

By Zorn, has a maximal element and claim . Suppose BWOC this is not the case. Then let . Then since we can always extend functions on subspaces, there exists a continuous extension of for (ie, ). But then we have so is not maximal \tag*{$\blacksquare$}

Proof (of Lemma)

First, note that if then there exists unique and such that .

Thus, upon choosing , the map is well-defined on and is linear.

WLOG, suppose . We want to choose such that Once is fixed, is our continuous extension. When , this inequality holds regardless of (because it holds on ). Thus we only need to choose for . When , we have

\lvert u'(t) + a\lambda \rvert \leq \lvert \lvert t + ax \rvert \rvert&\iff \left\lvert \left\lvert u\left( \frac{t}{-a} \right) -\lambda \right\rvert \right\rvert \leq \left\lvert \left\lvert \frac{t}{-a} -x \right\rvert \right\rvert \quad\forall t \in M \\ &\iff \lvert u(t) - \lambda \rvert \leq \lvert \lvert t - x \rvert \rvert \quad\forall t \in M \end{align}$$ Since $\frac{t}{-a} \in M$. We first show there exists some $\alpha \in \mathbb{R}$ such that $$\lvert w(t) - \alpha \rvert \leq \lvert \lvert t-x \rvert \rvert \quad \forall t \in M$$ where $w(t) = \frac{u(t) - \overline{u(t)}}{2} = \mathrm{Re}(u(t))$. Now, note that $$\begin{align} \lvert w(t) \rvert & = \lvert \mathrm{Re}(u(t)) \rvert \\ & \leq \lvert u(t) \rvert \\ & \leq \lvert \lvert t \rvert \rvert \\ \implies w(t_{1}) - w(t_{2}) & =w(t_{1}-t_{2}) \quad \forall t_{1},t_{2} \in M\\ & \leq \lvert w(t_{1}-t_{2}) \rvert \\ & \leq \lvert \lvert t_{1}-t_{2} \rvert \rvert \\ & \leq \lvert \lvert t_{1}-x \rvert \rvert + \lvert \lvert t_{2}-x \rvert \rvert\\ \implies w(t_{1}) - \lvert \lvert t_{1}-x \rvert \rvert & \leq w(t_{2}) + \lvert \lvert t_{2}-x \rvert \rvert \quad\forall t_{1},t_{2}\in M \\ \implies \sup_{t \in M} w(t) -\lvert \lvert t-x \rvert \rvert & \leq w(t_{2}) + \lvert \lvert t_{2} - x \rvert \rvert \quad \forall t_{2} \in M\\ \implies \sup_{t \in M} w(t) -\lvert \lvert t-x \rvert \rvert & \leq\inf_{t \in M} w(t) + \lvert \lvert t-x \rvert \rvert \end{align}$$ So we can choose an $\alpha$ between these two quantities such that for all $t \in M$ we have $$\begin{align} w(t) - \lvert \lvert t-x \rvert \rvert &\leq \alpha &\leq w(t) + \lvert \lvert t-x \rvert \rvert \\ \implies - \lvert \lvert t-x \rvert \rvert &\leq \alpha - w(t) &\leq \lvert \lvert t-x \rvert \rvert \\ \implies \lvert w(t) - \alpha \rvert &\leq \lvert \lvert t-x \rvert \rvert \end{align}$$ Using the same process for the imaginary part of $u(t)$ and repeating the argument with $ix$, we can find a $\lambda$ such that the desired bound holds. > [!NOTE] > To see this, we can verify that since the bound holds on both the real and imaginary components of $x$, it holds for all complex multiples of $x$ This defines our function $$u'(t+ax) = u(t) + a\lambda$$ on all of $M +\mathbb{C}x$. Thus we are done. $$\tag*{$\blacksquare$}$$
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>
}