Functional Analysis Lecture 4
[[lecture-data]]
← Lecture 3 | Lecture 5 →
Lecture Notes: Rodriguez, page 18
1. Normed and Banach Spaces
Recall from last time
Let
ie for all open subsets
We will first prove that if
So by the [[Baire Category Theorem]], there exists some
Now, since
ie, we can pick some
we choose
Then
If
And this means
ie, (in
for all
Now we prove that
Let
ie,
continuing in this manner, we obtain a sequence
The series
Further, by the [[triangle inequality]], we have
And we can bound this
And since
ie,
Thus, if
Suppose
Since
(see [[open mapping theorem]])
If
see [[bijective bounded linear operators have bounded linear inverses]]
- just need to check all the definitions for the norm
- check that Cauchy sequences in
consist of Cauchy sequences in each of and (similar to completeness of )
see [[the cartesian product of banach spaces is banach]]
If
this may be easier to prove than proving something is a bounded linear operator. Normally, we need to show that sequences
Define
Note that
Further, we have
(we can see it is bounded by the norm of
And so
ie
see [[closed graph theorem]]
[[closed graph theorem]]
Hahn Banach Theorem
See [[Hahn-Banach theorem]]
This theorem tries to answer the question
Given a general, nontrivial, normed space
(recall that we defined the [[dual space]] in the last lecture, and we define these specific duals to be "functionals")
Spaces with nontrivial dual spaces
where for
In general, we want to know if we have elements in the dual space.
framework / axioms from set theory
A partial order on a set
- for all
, - for all
, if and then - for all
, if and , then
see [[partial order]]
An upper bound of a set
see [[upper bound]]
A maximal element of
see [[maximal element]]
Similar definitions for a minimal element
If
ie we can compare all the elements in the chain
see [[chain]]
A Hamel basis
see [[Hamel basis]]
We know from linear algebra that we can find a basis and calculate the dimension of the space. Next time, we'll see how to apply these to infinite vector spaces.
If every partially ordered set
see [[Zorn's lemma]]
- We take this as an axiom of set theory and it can be used to prove the [[Axiom of Choice]]
- We can also show that every [[vector space]] has a [[Hamel basis]]
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>
}