Notes:Functional Analysis II
From Maths
Contents
[hide]Official notes: 8/2/2017 edition
Conventions
- K - in line with our conventions means either the field of the reals, R, or the field of complex numbers, C
Chapter 1
Banach spaces: norms and separability
- Norm
- Metric induced by a norm
- Closed unit ball - we will use ¯B or ¯BX as always.
- He uses BX(0,1) - ball notation for (X,∥⋅∥) centred at 0 of radius 1 - Caveat:easily muddled with open ball.
- Symmetric set (in a vector space) - Let S∈P(X) be given. Symmetric if ∀x∈S[−x∈S]
TODO: Make own lemma
- Suppose that N:X→R satisfies the following three properties:
- ∀x∈X[N(X)≥0],
- ∀x∈X[N(x)=0⟺x=0], and
- ∀x∈X∀λ∈K[N(λx)=|λ|N(x)] TODO: Positive definiteness or something right? There's a name for this!
- Then we have:
- If is a convex set then N is a norm on X
- Proof:
- We already have 3 of the 4 properties required for N to be a norm, we only need the 4th:
- ∀x,y∈X[N(x+y)≤N(x)+N(y)] to be done
- With this in mind we start the proof:
- Let x,y∈X be given
- Suppose x=0, then N(x+y)=N(y) and N(x)=0 so we see N(x+y)=N(y)=N(y)+N(x) and this implies N(x+y)≤N(x)+N(y) as required
- Suppose x≠0, now we have two cases, y=0 and y≠0:
- Suppose y=0, then N(x+y)=N(x) and N(y)=0 so we see N(x+y)=N(y)=N(y)+N(x) and this implies N(x+y)≤N(x)+N(y) as required
- Suppose y≠0 also
- If we want: N(x+y)≤N(x)+N(y) then - after noticing that N(x)>0, N(x+y)>0 and N(y)>0 - we see this is equivalent to N(x+y)N(x)+N(y)≤1 and we notice N(x+y)N(x)+N(y)=N(x+yN(x)+N(y))
- Note also that y∈B⟺N(y)≤1 too! Thus
- We really want to show: x+yN(x)+N(y)∈B
- By basic algebra we see: x+yN(x)+N(y)=1N(x)+N(y)x1+1N(x)+N(y)y1
- Recall from useful field equalities that 1−aa+b=ba+b so we can attempt to show:
- N(x)N(x)+N(y)xN(x)+N(y)N(x)+N(y)yN(y)∈B which is just (1−N(y)N(x)+N(y))xN(x)+N(y)N(x)+N(y)yN(y)∈B TODO: Saving work here - rushed this carry on from here
- N(x)N(x)+N(y)xN(x)+N(y)N(x)+N(y)yN(y)∈B which is just (1−N(y)N(x)+N(y))xN(x)+N(y)N(x)+N(y)yN(y)∈B
- Lemma: ∀x∈X[n≠0⟹xN(x)∈B]
- Let x∈X be given
- Suppose x=0 then by the nature of logical implication we do not care about the truth or falsity of the RHS and we're done
- Suppose x≠0, now we must show 1N(x)x∈B
- However y∈B⟺N(y)≤1 so we want to show the equivalent condition: N(xN(x))≤1
- N(xN(x))=|1N(x)|N(x)=1N(x)N(x)=1
- Thus xN(x)∈B - as required
- Since x∈X was arbitrary we have shown this holds for all x∈X
- Let x∈X be given
- The lemma is shown.
- Using the lemma we see: xN(x)∈B and yN(y)∈B
- By convexity of B we see:
- ∀t∈[0,1]⊂R[x+t(y−x)∈B] and note that x+t(y−x)=(1−t)x+ty, thus:
- ∀t∈[0,1]⊂R[(1−t)x+ty∈B]
- Hmm
- By convexity of B we see:
- If we want: N(x+y)≤N(x)+N(y) then - after noticing that N(x)>0, N(x+y)>0 and N(y)>0 - we see this is equivalent to N(x+y)N(x)+N(y)≤1 and we notice N(x+y)N(x)+N(y)=N(x+yN(x)+N(y))
- We already have 3 of the 4 properties required for N to be a norm, we only need the 4th: