A norm on E is a map ∥⋅∥:E→R+ with, for all x,y∈E, λ∈K:
∥x∥=0⟺x=0,∥λx∥=∣λ∣∥x∥,∥x+y∥≤∥x∥+∥y∥.
Then d(x,y)=∥x−y∥ is a distance, and all of Chapter 4 applies. The reverse triangle inequality ∥x∥−∥y∥≤∥x−y∥ makes the norm itself 1-Lipschitz; addition and scalar multiplication are continuous (estimates ∥(x+y)−(x′+y′)∥≤∥x−x′∥+∥y−y′∥, etc.).
(∥⋅∥2 is a norm by Cauchy–Schwarz, Year 1 volume). On C([a,b]):
∥f∥∞=sup∣f∣,∥f∥1=∫ab∣f∣,∥f∥2=(∫ab∣f∣2)1/2,
the last two being norms thanks to strict positivity of the integral and integral Cauchy–Schwarz (Year 1 volume). On matrices: any norm on Mn(K)≃Kn2; the operator norms below are the structurally important ones.
Example 5.4(Non-equivalence in infinite dimension)
On C([0,1]): ∥f∥1≤∥f∥∞ always, but no reverse bound holds: fn(x)=xn has ∥fn∥∞=1 and ∥fn∥1=n+11→0. So fn→0 for ∥⋅∥1 but not for ∥⋅∥∞: the two norms disagree about convergence itself.
Example 5.5(Explicit constants in dimension n)
On Kn the three classical norms are equivalent with sharp constants:
∥x∥∞≤∥x∥2≤∥x∥1≤n∥x∥2≤n∥x∥∞,
the middle bound ∥x∥1≤n∥x∥2 coming from Cauchy–Schwarz against the all-ones vector. Extremal vectors: e1 makes the first two inequalities equalities, (1,1,…,1) the last two. The dimension n sits visibly in the constants — the quantitative seed of the failure in infinite dimension: as n→∞ no uniform constant survives, which is exactly what Example 5.4 exhibits on function spaces.