TheoremBase

Closure and the vector-space laws are checked pointwise; the dual norm is shown to be a norm from its being the least nonnegative bound; a Cauchy sequence of functionals converges pointwise to a bounded linear functional, uniformly on the unit ball; the weak-star statements follow from uniqueness of real limits and the estimate |F(x)-G(x)| <= ||F-G||_* ||x||.

Proof

Throughout, elements of X∗X^{*} are functions X→RX\to\mathbb{R}, two of which are equal when they agree at every point; linear functionals are additive and homogeneous, which is used without further mention; and for F∈X∗F\in X^{*}, BFB_{F} is its set of nonnegative bounds. Two facts about the dual norm are used repeatedly. First, ∥F∥∗≥0\lVert F\rVert_{*}\ge0 and ∥F∥∗\lVert F\rVert_{*} is itself a bound for FF, by The Nonnegative Bounds of a Bounded Linear Functional Have an Infimum, Which Is a Bound (i) and The Nonnegative Bounds of a Bounded Linear Functional Have an Infimum, Which Is a Bound (ii):

∣F(x)∣≤∥F∥∗ ∥x∥(x∈X).(1)|F(x)|\le\lVert F\rVert_{*}\,\lVert x\rVert\qquad(x\in X).\tag{1}

Second, ∥F∥∗≤C\lVert F\rVert_{*}\le C for every nonnegative bound CC of FF, because the infimum ∥F∥∗=inf⁡BF\lVert F\rVert_{*}=\inf B_{F} is a lower bound of BFB_{F} (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv), Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (i)).

Step 1: closure. Let F,G∈X∗F,G\in X^{*}, with bounds CC and DD, and λ∈R\lambda\in\mathbb{R}. The pointwise sum is additive, since (F+G)(u+v)=F(u)+F(v)+G(u)+G(v)=(F+G)(u)+(F+G)(v)(F+G)(u+v)=F(u)+F(v)+G(u)+G(v)=(F+G)(u)+(F+G)(v), and homogeneous in the same way; and C+DC+D is a bound for it, since ∣F(x)+G(x)∣≤∣F(x)∣+∣G(x)∣≤(C+D)∥x∥|F(x)+G(x)|\le|F(x)|+|G(x)|\le(C+D)\lVert x\rVert. Likewise λF\lambda F is linear with bound ∣λ∣C|\lambda|C, because ∣λF(x)∣=∣λ∣ ∣F(x)∣|\lambda F(x)|=|\lambda|\,|F(x)|. The zero function is linear and has the bound 00. Hence F+GF+G, λF\lambda F and 00 lie in X∗X^{*} (Bounded Linear Functionals and the Dual Space of a Real Normed Space (iv)), and so does −F=(−1)F-F=(-1)F.

Step 2: the vector-space laws. The pointwise operations on real-valued functions on XX satisfy the commutative-ring and scalar laws carried by the setting: addition is associative and commutative, F+0=FF+0=F and F+(−F)=0F+(-F)=0, and λ(μF)=(λμ)F\lambda(\mu F)=(\lambda\mu)F, 1F=F1F=F, λ(F+G)=λF+λG\lambda(F+G)=\lambda F+\lambda G and (λ+μ)F=λF+μF(\lambda+\mu)F=\lambda F+\mu F. By Step 1 these identities hold within X∗X^{*}, which gives Vector Space over a Field (i), Vector Space over a Field (ii), Vector Space over a Field (iii) (with z=0z=0), Vector Space over a Field (v), Vector Space over a Field (vi), Vector Space over a Field (vii) and Vector Space over a Field (viii). For Vector Space over a Field (iv), let z∈X∗z\in X^{*} satisfy H+z=HH+z=H for every H∈X∗H\in X^{*}; taking H=0H=0 gives z=z+0=0+z=0z=z+0=0+z=0, and then y=−Fy=-F satisfies F+y=zF+y=z. So X∗X^{*} is a real vector space (Vector Space over a Field (x)). Its zero vector is 00 and the negative of FF is −F-F, since these satisfy the defining properties; hence the difference F−G=F+(−G)F-G=F+(-G) is the pointwise difference, (F−G)(x)=F(x)−G(x)(F-G)(x)=F(x)-G(x). This proves (i). Combined with (1), it gives

∣F(x)−G(x)∣≤∥F−G∥∗ ∥x∥(F,G∈X∗, x∈X).(2)|F(x)-G(x)|\le\lVert F-G\rVert_{*}\,\lVert x\rVert\qquad(F,G\in X^{*},\ x\in X).\tag{2}

Step 3: the dual norm is a norm. Let F,G∈X∗F,G\in X^{*} and λ∈R\lambda\in\mathbb{R}. Nonnegativity is the first fact above. Definiteness: if ∥F∥∗=0\lVert F\rVert_{*}=0, then (1) gives ∣F(x)∣≤0|F(x)|\le0, so F(x)=0F(x)=0 for every xx, and F=0F=0. Triangle inequality: by (1), ∣(F+G)(x)∣≤(∥F∥∗+∥G∥∗)∥x∥|(F+G)(x)|\le(\lVert F\rVert_{*}+\lVert G\rVert_{*})\lVert x\rVert, so ∥F∥∗+∥G∥∗\lVert F\rVert_{*}+\lVert G\rVert_{*} is a nonnegative bound of F+GF+G and therefore ∥F+G∥∗≤∥F∥∗+∥G∥∗\lVert F+G\rVert_{*}\le\lVert F\rVert_{*}+\lVert G\rVert_{*}. Absolute homogeneity: in the same way ∣λ∣ ∥F∥∗|\lambda|\,\lVert F\rVert_{*} is a nonnegative bound of λF\lambda F, so

∥λF∥∗≤∣λ∣ ∥F∥∗.(3)\lVert\lambda F\rVert_{*}\le|\lambda|\,\lVert F\rVert_{*}.\tag{3}

If λ=0\lambda=0, then λF=0\lambda F=0, which has the bound 00, so both sides of (3) are 00. If λ≠0\lambda\neq0, then F=λ−1(λF)F=\lambda^{-1}(\lambda F), and (3) applied to λF\lambda F and λ−1\lambda^{-1} gives ∥F∥∗≤∣λ∣−1∥λF∥∗\lVert F\rVert_{*}\le|\lambda|^{-1}\lVert\lambda F\rVert_{*}, that is ∣λ∣ ∥F∥∗≤∥λF∥∗|\lambda|\,\lVert F\rVert_{*}\le\lVert\lambda F\rVert_{*}. So equality holds in (3). By Norms and Real Normed Spaces (v), ∥⋅∥∗\lVert\cdot\rVert_{*} is a norm on the real vector space X∗X^{*}, and (X∗,∥⋅∥∗)(X^{*},\lVert\cdot\rVert_{*}) is a real normed space by Norms and Real Normed Spaces (vi). This proves (ii).

Step 4: a Cauchy sequence has a pointwise limit. Let d∗(F,G)=∥F−G∥∗d_{*}(F,G)=\lVert F-G\rVert_{*} be the norm metric of X∗X^{*}, and let (Fk)k∈N(F_{k})_{k\in\mathbb{N}} be a Cauchy sequence in (X∗,d∗)(X^{*},d_{*}). Fix x∈Xx\in X. Given ε>0\varepsilon>0, choose NN with ∥Fk−Fj∥∗<ε/(∥x∥+1)\lVert F_{k}-F_{j}\rVert_{*}<\varepsilon/(\lVert x\rVert+1) for all k,j≥Nk,j\ge N; by (2), ∣Fk(x)−Fj(x)∣≤ε∥x∥/(∥x∥+1)<ε|F_{k}(x)-F_{j}(x)|\le\varepsilon\lVert x\rVert/(\lVert x\rVert+1)<\varepsilon for all k,j≥Nk,j\ge N. So (Fk(x))k(F_{k}(x))_{k} is a Cauchy sequence of real numbers, and it converges by Completeness of the Real Numbers for Sequences: Monotone Convergence, the Bolzano-Weierstrass Theorem and Cauchy Sequences (v). Let F(x)F(x) be its limit; this defines a function F:X→RF:X\to\mathbb{R}.

Step 5: the limit is linear. For u,v∈Xu,v\in X and λ∈R\lambda\in\mathbb{R} we have Fk(u+v)=Fk(u)+Fk(v)F_{k}(u+v)=F_{k}(u)+F_{k}(v) and Fk(λu)=λFk(u)F_{k}(\lambda u)=\lambda F_{k}(u) for every kk. The left-hand sides converge to F(u+v)F(u+v) and F(λu)F(\lambda u), and the right-hand sides to F(u)+F(v)F(u)+F(v) and λF(u)\lambda F(u) by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (vi); by uniqueness of limits, Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (ii), F(u+v)=F(u)+F(v)F(u+v)=F(u)+F(v) and F(λu)=λF(u)F(\lambda u)=\lambda F(u).

Step 6: a uniform estimate. Let ε>0\varepsilon>0, and choose NN with ∥Fk−Fj∥∗<ε\lVert F_{k}-F_{j}\rVert_{*}<\varepsilon for all k,j≥Nk,j\ge N. Fix k≥Nk\ge N and x∈Xx\in X. By (2), ∣Fk(x)−Fj(x)∣≤ε∥x∥|F_{k}(x)-F_{j}(x)|\le\varepsilon\lVert x\rVert for every j≥Nj\ge N. As j→∞j\to\infty, Fk(x)−Fj(x)→Fk(x)−F(x)F_{k}(x)-F_{j}(x)\to F_{k}(x)-F(x) by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (i) and Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (vi), and then ∣Fk(x)−Fj(x)∣→∣Fk(x)−F(x)∣|F_{k}(x)-F_{j}(x)|\to|F_{k}(x)-F(x)| by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (viii). Passing to the limit in the inequality, Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (x) gives

∣Fk(x)−F(x)∣≤ε ∥x∥(k≥N, x∈X).(4)|F_{k}(x)-F(x)|\le\varepsilon\,\lVert x\rVert\qquad(k\ge N,\ x\in X).\tag{4}

Step 7: the limit lies in X∗X^{*}, and the sequence converges to it. Apply (4) with ε=1\varepsilon=1 and its index N1N_{1}: by (1), ∣F(x)∣≤∣FN1(x)∣+∣F(x)−FN1(x)∣≤(∥FN1∥∗+1)∥x∥|F(x)|\le|F_{N_{1}}(x)|+|F(x)-F_{N_{1}}(x)|\le(\lVert F_{N_{1}}\rVert_{*}+1)\lVert x\rVert for every xx. So the linear functional FF is bounded, and F∈X∗F\in X^{*}. Now let ε>0\varepsilon>0 and let NN be the index of (4) for ε/2\varepsilon/2. For k≥Nk\ge N, (4) and (Fk−F)(x)=Fk(x)−F(x)(F_{k}-F)(x)=F_{k}(x)-F(x) say that ε/2\varepsilon/2 is a nonnegative bound of Fk−FF_{k}-F, so d∗(Fk,F)=∥Fk−F∥∗≤ε/2<εd_{*}(F_{k},F)=\lVert F_{k}-F\rVert_{*}\le\varepsilon/2<\varepsilon. Thus (Fk)(F_{k}) converges to FF in (X∗,d∗)(X^{*},d_{*}). Every Cauchy sequence in (X∗,d∗)(X^{*},d_{*}) therefore converges, so (X∗,d∗)(X^{*},d_{*}) is complete, and (X∗,∥⋅∥∗)(X^{*},\lVert\cdot\rVert_{*}) is a real Banach space by Real Banach Space (i). This proves (iii).

Step 8: weak-star limits. If (Fm)(F_{m}) converges weak-star to FF and to GG, then for every x∈Xx\in X the real sequence (Fm(x))m(F_{m}(x))_{m} converges to F(x)F(x) and to G(x)G(x) by Weak-Star Convergence in the Dual of a Real Normed Space (i), so F(x)=G(x)F(x)=G(x) by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (ii); hence F=GF=G, proving (iv). Suppose now that ∥Fm−F∥∗→0\lVert F_{m}-F\rVert_{*}\to0, and fix x∈Xx\in X. By Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (vi), ∥x∥ ∥Fm−F∥∗→∥x∥⋅0=0\lVert x\rVert\,\lVert F_{m}-F\rVert_{*}\to\lVert x\rVert\cdot0=0, and by (2),

∣Fm(x)−F(x)∣≤∥x∥ ∥Fm−F∥∗(m∈N).|F_{m}(x)-F(x)|\le\lVert x\rVert\,\lVert F_{m}-F\rVert_{*}\qquad(m\in\mathbb{N}).

So Fm(x)→F(x)F_{m}(x)\to F(x) by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (xii). As xx was arbitrary, (Fm)(F_{m}) converges weak-star to FF, proving (v).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…