ΘρϵηΠατπ

Linear Functional
Suppose that V is a vector space over a field K∈{ℝ,ℂ}, then a linear functional is a linear operator f:V→K

Note that in the case of the reals or complex we have the norm as the absolute value. Also we say that a linear functional is real if F=ℝ and say that it is complex if F=ℂ

Bounded Linear Functional
We say that a linear functional f is bounded when it is a bounded linear operator

The above equates to saying that there exists some c∈ℝ+ such that for all x∈dom⁡(f),|f(x)|≤c‖x‖

Dual Space
Suppose that X is a normed vector space over a field F then we define the the dual space to be the set of all bounded linear functionals, denoted by X∗
The Dual Space Is a Normed Vector Space
Given a vector space X then X∗ is a normed vector space using the operator norm.
TODO: Add the proof here.
The Dual Space Is a Banach Space
Given a vector space X then X∗ is a banach space
TODO: Add the proof here.

What's interesting is that the above holds whether or not X is a banach space.

The Dual Space of Rn Is Rn
The dual space of (ℝ)n is isomorphic to ℝn
TODO: Add the proof here.
The Dual of Lp Is Lq
The dual space of lp is lq where q∈(1,∞) and 1p+1q=1
A Schauder basis for lp is (ek), where ek=(δki) as in the preceding example. Then every x∈lp has a unique representation (9) x=∑k=1∞ξkek Given any f in the dual space of lp, since it is f is linear and bounded we have: f(x)=∑k=1∞ξkγkγk=f(ek) Let q be the conjugate of p (cf. 1.2-3) and consider xn=(ξk(n)) with ξk(n)={|γk|q/γk if k≦n and γk≠00 if k>n or γk=0 Thus we have: f(xn)=∑k=1∞ξk(n)γk=∑k=1n|γk|4 We also have, using (11) and (q−1)p=q, f(xn)≦‖f‖‖xn‖=‖f‖(∑|ξk(n)|p)1/p=‖f‖(∑|γk|(q−1)p)1/p=‖f‖(∑|γk|q)1/p (sum from 1 to n ). Together, f(xn)=∑|γk|q≤‖f‖(∑|γk|q)1/p Dividing by the last factor and using 1−1/p=1/q, we get (∑k=1n|γk|q)1−1/p=(∑k=1n|γk|q)1/q≤‖f‖.
The Dual Space of l1 Is l Infinity
As per title.
We first recall that a Schauder basis for l1 is given by ek=(δkj), that is ek has 1 in the kth place and zeros everywhere else, so that every x∈l1 has a unique representation of the form x=∑k=1∞ckek. We consider any f in the dual space of l1. Since f is linear and bounded then we know f(x)=∑k=1∞ckf(ek) By construction we note that ‖ek|=1 and therefore we have: |f(ek)|=≤‖f‖op⁡‖ek‖=‖f‖op⁡ Therefore we can conclude that supk⁡|f(ek)|≤‖f‖op⁡ so then (f(ek))k∈l∞. But for every b=(βk)∈l∞ then g defined by g(x)=∑k=1∞ckβk where (cn)∈l1 is linear, additionally it is bounded: |g(x)|≤∑k=1∞|ckβk|≤supi⁡|βi|∑k=1∞|ck|=‖x‖supi⁡|βi| Therefore we can conclude that g is in the dual of l1. We will now show that the norm of f is the norm on the space l∞ |f(x)|=|∑k=1∞ckf(ek)|≤supj⁡|f(ek)|∑k=1∞|ck|=‖x‖supj⁡|f(ej)| Therefore when we take this supremum over all x on the unit circle we attain that: ‖f‖op⁡≤supj⁡|f(ek)| But earlier in the proof we had the other direction of the above inequality so we have ‖f‖op⁡=supj⁡|f(ej)| which is the l∞ norm, that is we have ‖f‖op⁡=‖y‖∞ where y=(f(ek))∈l∞, showing that the mapping f↦(y) is a bijective linear mapping of l1 onto l∞ therefore it is an isomorphism, as needed.
Hahn Banach
Let X be a real vector space, p a sublinear functional on 𝒳,ℳ a subspace of 𝒳, and f a linear functional on ℳ such that f(x)≤p(x) for all x∈ℳ. Then there exists a linear functional F on 𝒳 such that F(x)≤p(x) for all x∈𝒳 and F|ℳ=f.
We begin by showing that if x∈X\2M,f can be extended to a linear functional g on ℳ+ℝx satisfying g(y)≤p(y) there. If y1,y2∈ℳ, we have f(y1)+f(y2)=f(y1+y2)≤p(y1+y2)≤p(y1−x)+p(x+y2), or f(y1)−p(y1−x)≤p(x+y2)−f(y2). Hence sup⁡{f(y)−p(y−x):y∈ℳ}≤inf⁡{p(x+y)−f(y):y∈ℳ}. Let α be any number satisfying sup⁡{f(y)−p(y−x):y∈𝒩}≤α≤inf⁡{p(x+y)−f(y):y∈ℳ} and define g:ℳ+ℝx→ℝ by g(y+λx)=f(y)+λα. Then g is clearly linear, and g|ℳ=f, so that g(y)≤p(y) for y∈ℳ. Moreover, if λ>0 and y∈ℳ. g(y+λx)=λ[f(y/λ)+α]≤λ[f(y/λ)+p(x+(y/λ))−f(y/λ)]=p(y+λx), whereas if λ=−μ<0, g(y+λw)−μ[f(y/μ)−a]≤μ[f(y/μ)−f(y/μ)+p((y/μ)−x)]=p(y+λx) Thus g(z)≤p(z) for all z∈ℳ+ℝx. Evidently the same reasoning can be applied to any linear extension F of f satisfying F≤p on its domain, and it shows that the domain of a maximal linear extension satisfying F≤p must be the whole space X. But the family ℱ of all tinear extensions F of f satisfying F≤p is partially ordered by inclusion (maps from subspaces of X to ℝ being regarded as subsets of X×ℝ ). Since the union of any increasing family of subspaces of X is agath a subspace, one casily sees that the union of a linearly ordered subfamily of ℱ lies in ℱ. The proof is therefore completed by invoking Zom's lemma.

5.6 The Hahn-Banach Theorem.
5.7 The Complex Hahn-Banach Theorem. Let 𝒳 be a complex vector space, p a seminorm on X,ℳ a subspace of 𝒳, and f a complex linear functional on ℳ such that |f(x)|≤p(x) for x∈ℳ. Then there exists a complex linear functional F on X such that |F(x)|≤p(x) for all x∈𝒳 and F|ℳ=f. Proof. Let u=Re⁡f. By Theorem 5.6 there is a real linear extension U of u to X such that |U(x)|≤p(x) for all x∈X. Let F(x)=U(x)−iU(ix) as in Proposition 5.5. Then F is a complex linear extension of f, and as in the proof of Proposition 5.5, if α=sgn⁡F(x) we have |F(x)|=αF(x)=F(αx)=U(αx)≤p(αx)=p(x).
5.8 Theorem. Let x be a normed vector space. a. If ℳ is a closed subspace of X˙ and x∈X˙\ℳ, there exists f∈X such that f(x)≠0 and f|ℳ=0. In fact, if δ=infy∈ℳ⁡‖x−y‖.f can be taken to satisfy ‖f‖=1 and f(x)=δ. b. If x≠0∈X, there exists f∈X∗ such that ‖f‖=1 and f(x)=‖x‖. c. The bounded linear functionals on X separate points. d. If x∈X, define x^:X+→ℂ by x^(f)=f(x). Then the map x↦x^ is a linear isometry from X into X∗∗ (the dual of X∗ ). Proof. To prove (a), define f on ℳ+ℂx by f(y+λx)=λδ(y∈ℳ,λ∈ℂ). Then f(x)=δ,f|ℳ=0, and for λ≠0,|f(y+λx)|=|λ|δ≤|λ|‖λ−1y+x||= ‖y+λx‖. Thus the Hahn-Banach theorem can be applied, with p(x)=‖x‖ and ℳ replaced by M+ℂx. (b) is the spectal case of (a) with M={0}, and (c) follows immediately: if x≠y, there exists f∈X+with f(x−y)≠0, i.e., f(x)≠f(y). As for (d), obviously x^ is a linear functional on X∗ and the map x↦x^ is linear. Moroever, |x^(f)|=|f(x)|≤‖f‖‖x‖, so ‖x^‖≤‖x‖. On the other hand, (b) implies that ‖2^‖≥‖x‖. With notation as in Theorem 5.8d, let X^={x^:x∈X}. Since x∗ is always complete, the closure X^ of X^ in X∗∗ is a Banach space, and the map x↦x^ embeds x into X‾ as a dense subspace. x‾ is called the completion of X. In particular, if X is itself a Banach space then x‾=x^. If x is finite-dimensional, then of course x^=x∗∗, since these spaces have the same dimension. For infinite-dimensional Banach spaces it may or may not happen that x^=x⋅∗; if it does, x is called reflexive. The examples of Banach spaces we have examined so far are not reflexive except in trivial cases where they turn out to be finite-dimensional. We shall prove some cases of this assertion and present examples of reflexive Banach spaces in later sections. Usually we shall identify x^ with x and thus regard x∗∗ as a superspace of x; reflexivity then means that x∗∗=x
We already know (Background Information): (Folland)Theorem 5.8 - Let 𝒳 be a normed vector space. a.) If M is a closed subspace of 𝒳 and x∈𝒳\M, there exists f∈𝒳∗ such that f(x)≠0 and f(M)={0}. In fact, if δ=infy∈M⁡‖x−y‖,f can be taken to satisfy ‖f‖=1 and f(x)=δ. Question: Let X be a normed vector space. a.) If M is a closed subspace and x∈X\M then M+ℂx is closed. (Use Theorem 5.8a.)). b.) Every finite-dimensional subspace of X is closed. Proof a.) - Let M be a proper closed subspace of X and let x∈X\M. There exists f∈X∗ such that f(x)≠0 and f(M)={0}. Let {un+anx}1∞ be a sequence in M+Kx that converges to y∈X. Then f(y)=f(limn→∞⁡(un+anx))=limn→∞⁡f(un+anx)=limn→∞⁡anf(x) since f is continuous, so {an}1∞ converges to a:=f(y)/f(x), which implies that {anx}1∞ converges to ax. Therefore {un}1∞={(un+anx)−anx}1∞→(y−ax) which lies in M because M is closed. It follows that y∈M+Kx, which shows that M+Kx is closed. Proof b.) - Let Y be a finite dimensional subspace of X. Let {e1,…,en} be a basis of Y. Now, note that M={0} is a closed subspace of X. So, by item a.), M+Ce1 is a closed subspace of X. Again, by item a.) we have that M+ℂe1+ℂ𝕖e2 is a closed subspace of X. Repeating the argument enough times, we have that M+ℂ𝕖e1+…+ℂen is a closed subspace of X. But M+ℂ𝕖e1+…+ℂen=Y. So we have proved that Y is a closed subspace of X.