TMA4230 Functional analysis 2006

Assorted notes on functional analysis

Errata and updates
This list of errors and updates to my notes on functional analysis refers to the version
dated 2005–05–11.
A reference like 5 + 14 means page 5, line 14 from above. A reference like 5 − 14
means page 5, line 14 from below. Section headings and displayed formulas are
counted, but not footnotes or page headers and footers.

P. 3: The first two paragraphs need a bit of rewriting to be less confusing. I should
define strict and nonstrict partial orders and describe the one-to-one correspon-
dence between them, then define a partial order to be one or the other.

P. 3 − 13: equals sign −→ equality sign

P. 3 − 12: Change the plural to singular.

P. 5 − 17: Since T not −→ Since T is not

P. 7 − 12: smalles −→ smallest

P. 10 − 3: Wether −→ Whether

P. 12 − 10: B εk (x k ) ⊆ B εk (x k ) −→ B εk (x k ) ⊆ B εk−1 (x k−1 )

P. 15 + 2 to 15 + 13: The whole sequence “Let us write . . . completes the proof.” can
be replaced by a simpler proof:
For this, it is enough to show that y is Cauchy. Let ε > 0 and pick some n so that
ky − x n k∞ < ε. Since (x n ) is convergent, it is Cauchy, so there exists some N so that
j , k ≥ N ⇒ |x n j − x nk | < ε. Then if j , k ≥ N :

|y j − y k | ≤ |y j − x n j | + |x n j − x nk | + |x nk − y k | < 3ε,

so y is indeed Cauchy.

P. 22 − 9: kvk1 , and −→ kvk1 = 1, and

P. 23 − 16: chose −→ choose

P. 23 − 5: crierion −→ criterion

Version 2006–04–25
Assorted notes on functional analysis 2

P. 24 − 7: · · · < ε −→ · · · < εp

P. 27 + 3: The existence of ϕ requires the Hahn–Banach theorem.

P. 41 + 9: has the finite intersection property −→ has nonempty intersection

P. 44 − 9: Then U1 , ∪ . . . ∪ Un is a neighbourhood of A whose closure U1 , ∪ . . . ∪ Un

−→ Then U1 ∪ . . . ∪Un is a neighbourhood of A whose closure U1 ∪ . . . ∪Un
(two commas to be deleted from the formulas).

P. 51 − 16: Delete the sentence in parentheses: (We have . . . result holds.)

P. 56 + 4, 56 + 5: supu∈U ≤ −→ supu∈U f (u) ≤

P. 58 − 5: conseqence −→ consequence

P. 58 − 3: (Not really an error, but I shall move Proposition 68 just after Corollary 60
and call it another corollary.)

P. 59 + 7 and 59 + 9: t y + (1 − t )v −→ t u + (1 − t )v

P. 64 − 7: = −→ ≤ (because kx k k ≤ kxkk ).

P. 66 + 16: [−∞, ∞] −→ [−∞, ∞)

P. 67 − 10: kT xk∗ −→ kT xk2

P. 69 + 12: is invertible −→ is invertible by Lemma 81

P. 70 − 4 . . . − 2: δ −→ ε (four occurrences)

P. 70 − 3: G(T ) −→ g (T )

P. 71 + 2: it λ −→ λ

P. 71 + 7: f ∈ C ( f (σ(T ))) −→ f ∈ C (g (σ(T )))

P. 71 − 1: |T | = T + − T − + −→ |T | = T + + T − +

Version 2006–04–25