Homework 03

  • Click here to download this notebook

  • Homework 3: Functional Analysis

    Due date:

    Student Name:

    Exercise 1. Normed Spaces

    Examples:

    a. The normed vector space l2l^2 is the space of infinite sequences with the norm {xi}2=i=1xi2<\|\{x_i\}\|_2=\sqrt{\sum_{i=1}^{\infty} x_i^2} < \infty .

    b. The normed vector space ll^{\infty} is the space of infinite sequences with the norm {xi}=supi{xi}\|\{x_i\}\|_{\infty}=sup_{i}\{|x_i|\}. That is, the space of all bounded sequences.

    c. The normed vector space C[a,b]C[a,b] is the space of continuous functions with the norm fc=supx[a,b]{f(x)}\|f\|_c=sup_{x\in [a,b]}\{|f(x)|\}. That is, the space of bounded continuous functions on [a,b][a,b].

    1. Show that the norms defined in the previous example are indeed norms.

    1. Show that there are sequences in ll^{\infty} that do not belong to

    l2l^2. Hint: Find one of them.

    1. Show that {xi}n:=i=1xinnnsupi{xi}\|\{x_i\}\|_n := \sqrt[n]{\sum_{i=1}^{\infty} |x_i|^n}_{\stackrel{ \textstyle \longrightarrow}{\scriptstyle n \to \infty}} sup_i \{|x_i|\}.

    2. Convince yourself that, unlike the finite-dimensional case, an infinite-dimensional normed space is not necessarily complete. To illustrate this, consider the normed vector space l0l_0^{\infty}, which is a subspace of ll^{\infty} consisting of all bounded sequences with only a finite number of non-zero terms. Each sequence {xi}n=(1,1/2,1/3,,1/n,0,0,)\{x_i\}_n= (1,1/2,1/3,\ldots,1/n,0,0,\ldots) is in

    l0l_0^{\infty}, the sequence of sequences {{xi}n}\{\{x_i\}_n\} is Cauchy

    ({xi}m{xi}n=1n+1n0) \left( \|\{x_i\}_{m}-\{x_i\}_n\|_{\infty}=\frac{1}{n+1}_{\stackrel{\textstyle\longrightarrow} {\scriptstyle n\to\infty}} 0 \right)

    and converges to the sequence {xi}=(1,1/2,1/3,)l\{x_i\}_{\infty}=( 1,1/2, 1/3 ,\ldots)\in l^{\infty}which does not belong to l0l_0^{\infty}. Therefore, l0l_0^{\infty} is not complete.

    1. See that in l2l^2 the unit ball is not compact.

    Hint: find an infinite sequence in the unit ball that has no accumulation point.

    Exercise 2. Hilbert Spaces The following identity for norms arising from a scalar product is called the parallelogram law,

    x+y2+xy2=2(x2+y2). \|\vec{x} + \vec{y}\|^2 + \|\vec{x} - \vec{y}\|^2 = 2(\|\vec{x}\|^2 + \|\vec{y}\|^2).

    Show that a norm satisfies it if and only if it comes from an inner product. Hint: Use the so-called polarization identity to define an inner product from the norm,

    x,y=14{[x+y2xy2][x+y2xy2]} \langle\vec{x}, \vec{y}\rangle = \frac{1}{4}\{ [\|\vec{x} + \vec{y}\|^2 - \|\vec{x} - \vec{y}\|^2] -\Im [\|\vec{x} + \Im \vec{y}\|^2 - \|\vec{x} - \Im \vec{y}\|^2]\}

    Exercise 3. Orthonormal Bases Use Gram-Schmidt to obtain an orthonormal basis from the monomials

    1, x, x2, ,xn,, 1,\;x,\;x^2,\;\ldots,x^n,\ldots,

    with respect to the Hilbert spaces obtained from the following inner products:

    1. f,g=11fˉg dx\langle f,g \rangle = \int^1_{-1} \bar fg \;dx (In this case you will obtain the

    Legendre polynomials.)

    1. f,g=fˉgex2 dx\langle f,g \rangle = \int^{\infty}_{-\infty} \bar f g e^{-x^2} \;dx

    (In this case you will obtain the Hermite polynomials.)

    1. f,g=0fˉgex dx\langle f,g \rangle = \int^{\infty}_0 \bar f g e^{-x}\; dx

    (In this case you will obtain the Laguerre polynomials.)

    Exercise 4 Linear maps and dual spaces

    1. Let ϕ:HC\phi:H \to \Complex be a linear map. Show that ϕ\phi is continuous

    if and only if it is bounded.

    1. Show that the map I:C[a,b]I:C[a,b] \to \Re given by

    I(f):=abf(x)dx, I(f) := \int_a^b f(x)dx,
    is a linear and continuous map.

    1. Let VV be a finite-dimensional space and let {ui}, i=1..n\{\vec{u}_i\},\;\;i=1..n

    be a basis and {θi}, i=1..n\{\vec{\theta}^i\},\;\;i=1..n the corresponding dual basis. Let x=i=1nxiui\vec{x} = \sum_{i=1}^n x^i \vec{u}_i be any vector in VV and ω=i=1nωiθi\vec{\omega} = \sum_{i=1}^n \omega_i \vec{\theta}^i be any linear functional, i.e., an element of VV'. Consider the norm in VV

    xp:=(i=1nxip)1p. \|\vec{x}\|_p := (\sum_{i=1}^n |x^i|^p)^{\frac{1}{p}}.
    See that this is a norm and prove that the norm induced in VV' by this is given by,
    ωq:=(i=1nωiq)1q, \|\vec{\omega}\|_q := (\sum_{i=1}^n |\omega_i|^q)^{\frac{1}{q}},
    where
    1p+1q=1 (p,q1); \frac{1}{p} + \frac{1}{q} = 1\;\;\;\;\;\;\; (p,q \geq 1);
    Hint: Express ω(x)\vec{\omega}(\vec{x}) in components with respect to the given bases/dual bases and then use (prove) Holder's inequality:
    i=1nxiωi(i=1nxip)1p(i=1nωiq)1q. |\sum_{i=1}^{n} x^i \omega_i | \leq (\sum_{i=1}^n |x^i|^p)^{\frac{1}{p}} (\sum_{i=1}^n |\omega_i|^q)^{\frac{1}{q}}.

    1. Optional! Let c0c_0 be the space of sequences

    {x}=(x1,x2, )\{x\} = (x_1,x_2, \dots) converging to zero (limnxn=0\lim_{n \to \infty} x_n = 0) with the norm

    {x}c0:=supi{xi}. \|\{x\}\|_{c_0} := \sup_{i} \{|x_i|\}.
    Prove that the dual of the space c0c_0 is the space l1l_1 of absolutely summable sequences {ω}=(ω1,ω2, )\{\omega\}= (\omega_1,\omega_2, \dots) with the norm
    {ω}l1:=i=1ωi. \|\{\omega\}\|_{l_1} := \sum_{i=1}^{\infty} |\omega_i|.
    Hints: Note that given an element of l1l_1, {ω}=(ω1,ω2, )\{\omega\}=(\omega_1,\omega_2,\dots), we have a linear functional given by,
    ω({x}):=i=1xiωi. \vec{\omega}(\{x\}) := \sum_{i=1}^{\infty} x_i \omega_i.
    Prove that this satisfies
    ω{ω}l1. \|\vec{\omega}\| \leq \|\{\omega\}\|_{l_1}.
    Then find an element of norm equal to or less than one in c0c_0 and with its help see that
    ω{ω}l1. \|\vec{\omega}\| \geq \|\{\omega\}\|_{l_1}.
    From which it is concluded that the norms are the same, that is, the map that sends l1c0l_1 \to c_0' is an isometry. Warning! one is tempted to use as the element above xn=sign(yn)x_n = sign(y_n) but that vector might not be an element of c0c_0!, so a limiting procedure must be used. It only remains to see that for each element of the dual of c0c_0, ω\vec{\omega}, there exists an element of l1l_1, {ω}=(ω1,ω2, )\{\omega\}=(\omega_1,\omega_2,\dots) such that ω({x})=i=1xiωi\vec{\omega}(\{x\}) = \sum_{i=1}^{\infty} x_i \omega_i holds. To do this, construct a basis of c0c_0 and the respective basis of its dual. Note: at some point, you will have to use that the considered linear functionals are continuous.

    Below is a conversation with Deep Seek about the above problem.

    It illustrates how to get some information from it, but also that makes mistakes. The process of learning something is more complicated than just the process of getting the information. One has to formulate questions and attep to answer them. Produce and carry on ejamples and exercises, mostly simple ones.

    of what sequence space is l_1 the dual?

    The space 1 \ell_1 is the dual of c0 c_0 , the space of sequences converging to zero (equipped with the supremum norm).

    Key Result:

    c01, c_0^* \cong \ell_1,

    where \cong denotes an isometric isomorphism.

    Explanation:

    1. The space c0 c_0 consists of all real (or complex) sequences x=(xn) x = (x_n) such that:

    limnxn=0, \lim_{n \to \infty} x_n = 0,

    with the norm:

    x=supnxn. \|x\|_{\infty} = \sup_{n} |x_n|.
    1. Dual space c0 c_0^* :

      • Every continuous linear functional f f on c0 c_0 can be represented uniquely by a sequence y=(yn)1 y = (y_n) \in \ell_1 , acting as:

    f(x)=n=1xnynfor all xc0. f(x) = \sum_{n=1}^{\infty} x_n y_n \quad \text{for all } x \in c_0.
    • The norm of f f is given by:

    f=n=1yn=y1. \|f\| = \sum_{n=1}^{\infty} |y_n| = \|y\|_1.

    Why not \ell_\infty ?

    • While 1 \ell_1^* \cong \ell_\infty , the reverse is not true: \ell_\infty^* is much larger than 1 \ell_1 .

    • Instead, 1 \ell_1 is the dual of the smaller space c0 c_0 .

    Intuition:

    • c0 c_0 is a natural subspace of \ell_\infty (all sequences that "vanish at infinity").

    • The dual pairing 1=c0 \ell_1 = c_0^* reflects that 1 \ell_1 -sequences can "integrate" against c0 c_0 -sequences, but not against general \ell_\infty -sequences (where finitely additive measures are needed).

    Summary:

    • 1 \ell_1 is the dual of c0 c_0 .

    • 1 \ell_1 is not the dual of \ell_\infty (instead, \ell_\infty^* is much larger and more complicated).

    This is a key example in functional analysis where duality pairs a sequence space with a natural subspace of its double dual.

    produce a proof of this

    Here’s a detailed proof that the dual space of c0 c_0 is isometrically isomorphic to 1 \ell_1 , i.e.,

    c01. c_0^* \cong \ell_1.

    Step 1: Define the Duality Mapping

    Consider the pairing ,:1×c0R \langle \cdot, \cdot \rangle : \ell_1 \times c_0 \to \mathbb{R} (or C \mathbb{C} ) given by:

    y,x=n=1ynxn,where y1, xc0. \langle y, x \rangle = \sum_{n=1}^\infty y_n x_n, \quad \text{where } y \in \ell_1, \, x \in c_0.

    We must show that:

    1. Every y1 y \in \ell_1 induces a bounded linear functional on c0 c_0 .

    2. Every bounded linear functional on c0 c_0 arises this way.

    3. The map yfy y \mapsto f_y (where fy(x)=y,x f_y(x) = \langle y, x \rangle ) is an isometric isomorphism.


    Step 2: 1 \ell_1 Embeds into c0 c_0^* (Boundedness)

    Let y1 y \in \ell_1 . Then for any xc0 x \in c_0 ,

    y,x=n=1ynxnn=1ynxnxn=1yn=xy1. | \langle y, x \rangle | = \left| \sum_{n=1}^\infty y_n x_n \right| \leq \sum_{n=1}^\infty |y_n| |x_n| \leq \|x\|_\infty \sum_{n=1}^\infty |y_n| = \|x\|_\infty \|y\|_1.

    Thus, fy f_y is bounded with fyy1 \|f_y\| \leq \|y\|_1 .

    Sharpness of the bound: Take x=(sgn(yn)) x = (\text{sgn}(y_n)) , where sgn(yn)=yn/yn \text{sgn}(y_n) = y_n / |y_n| if yn0 y_n \neq 0 and 0 0 otherwise. Then xc0 x \in c_0 (since yn0 y_n \to 0 , as y1 y \in \ell_1 ), x1 \|x\|_\infty \leq 1 , and

    fy(x)=n=1yn=y1. f_y(x) = \sum_{n=1}^\infty |y_n| = \|y\|_1.

    Thus, fy=y1 \|f_y\| = \|y\|_1 , proving the embedding is isometric.


    Step 3: Every Functional in c0 c_0^* Comes from 1 \ell_1 (Surjectivity)

    Let fc0 f \in c_0^* . Define yn=f(en) y_n = f(e_n) , where en e_n is the n n -th standard basis vector (en(k)=δnk e_n(k) = \delta_{nk} ).

    Claim: y=(yn)1 y = (y_n) \in \ell_1 , and f(x)=n=1ynxn f(x) = \sum_{n=1}^\infty y_n x_n for all xc0 x \in c_0 .

    Proof:

    1. For any NN N \in \mathbb{N} , define x(N)=(sgn(y1),,sgn(yN),0,0, )c0 x^{(N)} = (\text{sgn}(y_1), \dots, \text{sgn}(y_N), 0, 0, \dots) \in c_0 . Then,

    f(x(N))=n=1Nynfx(N)=f. f(x^{(N)}) = \sum_{n=1}^N |y_n| \leq \|f\| \|x^{(N)}\|_\infty = \|f\|.

    Since N N is arbitrary, n=1ynf< \sum_{n=1}^\infty |y_n| \leq \|f\| < \infty , so y1 y \in \ell_1 .

    1. For any xc0 x \in c_0 , approximate x x by its first N N coordinates:

    x(N)=(x1,,xN,0,0, )c0. x^{(N)} = (x_1, \dots, x_N, 0, 0, \dots) \in c_0.

    Then xx(N)=supk>Nxk0 \|x - x^{(N)}\|_\infty = \sup_{k > N} |x_k| \to 0 as N N \to \infty (since xc0 x \in c_0 ). By continuity of f f ,

    f(x)=limNf(x(N))=limNn=1Nynxn=n=1ynxn. f(x) = \lim_{N \to \infty} f(x^{(N)}) = \lim_{N \to \infty} \sum_{n=1}^N y_n x_n = \sum_{n=1}^\infty y_n x_n.

    Thus, f f corresponds to y1 y \in \ell_1 .


    Step 4: Isomorphism and Isometry

    The map Φ:1c0 \Phi : \ell_1 \to c_0^* defined by Φ(y)=fy \Phi(y) = f_y is:

    • Linear: Clear from the definition.

    • Injective: If fy=0 f_y = 0 , then yn=fy(en)=0 y_n = f_y(e_n) = 0 for all n n .

    • Surjective: By Step 3, every fc0 f \in c_0^* is fy f_y for some y1 y \in \ell_1 .

    • Isometric: fy=y1 \|f_y\| = \|y\|_1 (Step 2).

    Hence, Φ \Phi is an isometric isomorphism, proving c01 c_0^* \cong \ell_1 .


    Conclusion

    The dual of c0 c_0 is 1 \ell_1 , with the duality given by the natural pairing y,x=n=1ynxn \langle y, x \rangle = \sum_{n=1}^\infty y_n x_n . This contrasts with \ell_\infty^* , which is much larger than 1 \ell_1 .

    Key Takeaways

    1. Every y1 y \in \ell_1 defines a bounded linear functional on c0 c_0 .

    2. Every bounded linear functional on c0 c_0 arises this way.

    3. The correspondence is norm-preserving (fy=y1 \|f_y\| = \|y\|_1 ).

    This is a fundamental result in functional analysis, illustrating how duality interacts with sequence spaces.

    I don't see why x = (sign(yn)) is in c0 for y in l_1

    You're absolutely right to question this! The argument I gave was incorrect because x=(sgn(yn)) x = (\text{sgn}(y_n)) is not necessarily in c0 c_0 for an arbitrary y1 y \in \ell_1 . (For example, if y=(1,1/2,1/3, ) y = (1, 1/2, 1/3, \dots) , then x=(1,1,1, ) x = (1, 1, 1, \dots) , which does not converge to 0 0 .)

    Revised Proof of fy=y1 \|f_y\| = \|y\|_1

    We need a different way to show that the operator norm fy \|f_y\| equals y1 \|y\|_1 . Here’s the corrected approach:

    1. For any xc0 x \in c_0 with x1 \|x\|_\infty \leq 1 :

    fy(x)=n=1ynxnn=1ynxnxn=1yny1. |f_y(x)| = \left| \sum_{n=1}^\infty y_n x_n \right| \leq \sum_{n=1}^\infty |y_n| |x_n| \leq \|x\|_\infty \sum_{n=1}^\infty |y_n| \leq \|y\|_1.

    Thus, fyy1 \|f_y\| \leq \|y\|_1 .

    1. Constructing a sequence x(N)c0 x^{(N)} \in c_0 to approximate the supremum: For a given y1 y \in \ell_1 , define the truncated sign sequence:

    xn(N)={sgn(yn)if nN,0if n>N. x^{(N)}_n = \begin{cases} \text{sgn}(y_n) & \text{if } n \leq N, \\ 0 & \text{if } n > N. \end{cases}

    Then x(N)c0 x^{(N)} \in c_0 (since it’s finitely supported), and x(N)1 \|x^{(N)}\|_\infty \leq 1 .

    Now,

    fy(x(N))=n=1Nynsgn(yn)=n=1Nyn. f_y(x^{(N)}) = \sum_{n=1}^N y_n \text{sgn}(y_n) = \sum_{n=1}^N |y_n|.

    Taking N N \to \infty , we get:

    fysupNfy(x(N))=n=1yn=y1. \|f_y\| \geq \sup_N f_y(x^{(N)}) = \sum_{n=1}^\infty |y_n| = \|y\|_1.

    Combining with the earlier inequality, fy=y1 \|f_y\| = \|y\|_1 .

    Why This Fixes the Issue

    • The original mistake was assuming (sgn(yn))c0 (\text{sgn}(y_n)) \in c_0 , which is false in general.

    • The fix uses finitely supported sequences x(N) x^{(N)} , which do belong to c0 c_0 and approximate the norm.

    Final Conclusion

    The corrected proof shows that:

    1. Every y1 y \in \ell_1 induces a functional fyc0 f_y \in c_0^* with fy=y1 \|f_y\| = \|y\|_1 .

    2. Every functional in c0 c_0^* arises this way (as previously established).

    Thus, c01 c_0^* \cong \ell_1 isometrically.

    Thanks for catching that error—it’s an important subtlety in duality arguments!

Last modified: June 14, 2025.
Website built with Franklin.jl and the Julia programming language.