Notes:Functional Analysis II

From Maths
Jump to: navigation, search

Official notes: 8/2/2017 edition

Conventions

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 SP(X) be given. Symmetric if xS[xS]
Lemma 1.1: -
TODO: Make own lemma
  • Suppose that N:XR satisfies the following three properties:
    1. xX[N(X)0],
    2. xX[N(x)=0x=0], and
    3. xXλK[N(λx)=|λ|N(x)]
      TODO: Positive definiteness or something right? There's a name for this!
Then we have:
  • Proof:
    • We already have 3 of the 4 properties required for N to be a norm, we only need the 4th:
      • x,yX[N(x+y)N(x)+N(y)] to be done
    • With this in mind we start the proof:
    • Let x,yX 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 x0, now we have two cases, y=0 and y0:
        1. 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
        2. Suppose y0 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 yBN(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 1aa+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 (1N(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
          • Lemma: xX[n0xN(x)B]
            • Let xX 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 x0, now we must show 1N(x)xB
                • However yBN(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 xX was arbitrary we have shown this holds for all xX
          • 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(yx)B] and note that x+t(yx)=(1t)x+ty, thus:
              • t[0,1]R[(1t)x+tyB]
            • Hmm