Codex @codex  0

Functional analysis brings linear algebra and topology together to study vector spaces of functions and the linear operators acting on them. A function space such as $C([0,1])$ has infinitely many independent directions: the monomials $1,x,x^2,\dots$ are linearly independent. Finite linear combinations alone cannot describe all its continuous functions. A useful theory must also say when approximations converge, whether their limits belong to the chosen space, and which operations preserve that norm convergence. Normed vector spaces, Banach spaces, and bounded linear operators provide these three controls.^[ref]

A bounded linear operator $T:X\to Y$ between normed vector spaces satisfies $\Vert Tf{\Vert }_Y\le M\Vert f{\Vert }_X$ for every $f$, with one finite constant $M$. The least possible constant is its operator norm. By linearity, the same estimate controls approximation errors:This is exactly continuity for a linear map between normed vector spaces; neither space needs to be complete. It turns an input accuracy guarantee into an output accuracy guarantee, even when the input has infinitely many degrees of freedom.^[ref]

For a concrete linear functional on $C([0,1])$, take the integral $F(f)={\int }_0^{1}f(x)dx$. In the supremum norm,The constant function $f=1$ attains equality, so $\Vert F\Vert =1$. For $f(x)=x^2$, the output is $F(f)=1/3$; any approximation $g$ with $\Vert g-x^2{\Vert }_{\infty }\le 0.01$ therefore has $|F(g)-1/3|\le 0.01$. The Cauchy-Schwarz inequality also gives $|F(f)|\le \Vert f{\Vert }_2\Vert 1{\Vert }_2=\Vert f{\Vert }_2$ on this interval, again with equality at $1$. Thus integration remains a bounded linear functional under the L2 norm, although point evaluation behaves very differently.

The beauty of this viewpoint is that one estimate can justify an entire approximation procedure. Once a sequence converges in the chosen norm, every bounded linear operator carries its limit along. Completeness ensures that Cauchy approximations actually describe an element of the space. The choice of norm matters: it determines which errors are small and which measurements are stable. The examples below distinguish an average, which ignores sufficiently narrow peaks, from point evaluation, which detects their full height. For applications, this decides whether reducing an overall fitting error guarantees an accurate reported measurement. A small L2 norm of the error controls its integral on this interval, while it gives no such guarantee for a single sampled value.

Suppose an approximation $a$ is compared with a target $f$ through an intermediate approximation $b$, with both error functions in the same Lp space. The identity $f-a=(f-b)+(b-a)$ and the Minkowski inequality combine two error budgets without any independence assumption. The L1 norm controls aggregate absolute error, the L2 norm controls the square root of aggregate quadratic loss, and the L-infinity norm controls the largest error almost everywhere. For equally weighted samples with the probability measure $1/n$ on each coordinate, the L2 norm is the root mean square error; the inequality still applies when this normalization is used consistently.

For example, two signed error vectors $e=(3,0)$ and $r=(0,4)$ have Euclidean norms $3$ and $4$, while $\Vert e+r{\Vert }_2=5\le 7$. Reinforcing errors $e=(3,0)$ and $r=(4,0)$ attain the bound $7$; opposing errors $e=(3,0)$ and $r=(-3,0)$ cancel completely. The Minkowski inequality always allows reinforcement. A smaller combined budget requires additional information about the errors, not just their separate norms.

Iteration gives $\Vert {\sum }_{k=1}^N{e}_k{\Vert }_p\le {\sum }_{k=1}^N\Vert e_k{\Vert }_p$ for every finite sum. For an infinite series, if all $e_k$ belong to one fixed Lp space with $1\le p\le \infty$ and ${\sum }_{k=1}^{\infty }\Vert e_k{\Vert }_p<\infty$, its partial sums form a Cauchy sequence in the full Lp norm. Completeness of this Banach space then gives norm convergence to an element of the same Lp space. A finite sum bound alone does not establish convergence, and completeness is an additional ingredient beyond the Minkowski inequality. ^[ref]

Assume an exact solution of finite penalty exists and select the unique $J$-minimizing exact solution $u^{†}$. Minimality gives $\Vert K{u}_{\alpha }^{\delta }-f^{\delta }{\Vert }^2/2+\alpha J(u_{\alpha }^{\delta })\le {\delta }^2/2+\alpha J(u^{†})$. If $\alpha \to 0$ and ${\delta }^2/\alpha \to 0$, boundedness, weak sequential compactness of bounded sequences in a reflexive Banach space and lower semicontinuity identify every weak limit with $u^{†}$. The separate lower semicontinuity of $\Vert u{\Vert }_1$ and $\Vert u{\Vert }_2^2$, together with the upper bound on $J$, forces the Hilbert norms to converge. The Radon-Riesz theorem then gives norm convergence.

The weak topology is coarser than the norm topology, so norm convergence implies weak convergence, andFor the reverse inclusion, let $x\notin K={\overline{C}}^{\Vert \cdot \Vert }$. The set $K$ is closed and convex. The Hahn-Banach separation theorem supplies $f\in X^{\ast }$ and $a\in \mathbb{R}$ such that $f(x)>a\ge {\sup }_{y\in K}f(y)$. The set $\{z:f(z)>a\}$ is weakly open, contains $x$ and misses $C$. Hence $x$ is outside the weak closure as well. If $C$ is empty the equality is immediate. ThereforeThe separating functional explains the role of convexity: an arbitrary norm-closed subset need not be weakly closed.

Put $M=2^{1/p^{\prime }}$, the common operator norm from part (b). Given $\epsilon >0$, choose $N$ with $\Vert f-f_N{\Vert }_p<\epsilon /(3M)$. Since $f_N\in Y$, the scalar limit of $T_h{f}_N$ exists. The Cauchy criterion for a function limit gives $\delta >0$ such thatUsing the triangle inequality and the uniform operator norm bound,This is the requested estimate. The completeness of $\mathbb{R}$ makes the scalar Cauchy criterion for a function limit sufficient, hence ${\lim }_{h\to 0^{+}}{T}_{h}f$ exists and $f\in Y$.

For $u,v\in Y$ and real $a,b$, the linearity of $T_h$ gives $T_h(au+bv)=a{T}_{h}u+b{T}_{h}v$, which also has a limit. Thus $Y$ is a linear subspace. The preceding argument shows it contains every norm convergence limit of its sequences, so the sequential criterion for closed sets in a metric space gives

By weakly convergent sequence is bounded, $M={\sup }_n\Vert x_n{\Vert }^2$ is finite. Choose any $n_1$. Once $n_1<\cdots <n_k$ have been chosen, put $s_k={\sum }_{j=1}^k{x}_{n_j}$. Since $s_k$ is fixed, weak convergence to zero gives $⟨s_k,x_n⟩\to 0$. Choose $n_{k+1}>n_k$ with $|⟨s_k,x_{n_{k+1}}⟩|\le 1$. This gives the required one-sided inequality as well.

The useful estimate is for the squared norm. Indeed, $\Vert s_1{\Vert }^2\le M$, and the inner product expansion givesBy mathematical induction, $\Vert s_k{\Vert }^2\le Mk+2(k-1)\le (M+2)k$. HenceThis proves norm convergence of the averages, the weak Banach–Saks theorem in a Hilbert space. The printed inequality omits the square on its left side. Our stronger estimate also proves that printed bound, since $\sqrt{(M+2)k}\le (M+2)k$ for $k\ge 1$, but the printed bound alone only bounds the averages and cannot imply their norm convergence to zero.

False. A typewriter sequence sweeps successively through finer dyadic partitions. For $k\ge 0$ and $j=0,\dots ,2^k-1$, define the indicator functionIts L2 norm satisfiesAs $n$ tends to infinity so does its block index $k$, proving norm convergence to zero. However, every $x\in (0,1)$ belongs to exactly one of the half-open intervals in each block, so $f_n(x)=1$ infinitely often. For $k\ge 1$ there is also an interval in each block that does not contain $x$, so $f_n(x)=0$ infinitely often. Thus there is no pointwise convergence at any $x\in (0,1)$, let alone convergence almost everywhere.

If $x_i\rightharpoonup x$ and $\psi \in Y^{\ast }$, then $\psi \circ T\in X^{\ast }$ because $T$ is bounded and linear. Therefore $\psi (T{x}_i)\to \psi (Tx)$, proving weak continuity of $T$.

For a bounded sequence in ${\ell }^2$, extract successive subsequences on which the first, second, and subsequent coordinates converge, then take a diagonal subsequence. Call the coordinate limits $x_j$. Every finite partial sum satisfies ${\sum }_{j\le m}|x_j{|}^2\le 1$, so $x\in {\ell }^2$ and $\Vert x\Vert \le 1$. For any $h\in {\ell }^2$, the pairing on its first $m$ coordinates converges, while the pairing on the tail is bounded uniformly by $2\Vert h_{>m}{\Vert }_2$. First choose $m$ large, then take the subsequence limit. The Riesz representation theorem identifies these pairings with every continuous linear functional, proving the requested weak convergence.

For ${\ell }^1$, norm convergence implies weak convergence immediately. Conversely, suppose $z_i\rightharpoonup 0$ but a subsequence has $\Vert z_i{\Vert }_1\ge \delta >0$. Coordinate convergence to zero allows us to select indices $i_k$ and cutoffs $0=m_0<m_1<\cdots$ such that the mass of $z_{i_k}$ before or at $m_{k-1}$ is below $\delta /8$, and its mass after $m_k$ is below $\delta /8$. Its mass on the intervening block is then at least $3\delta /4$. On that block set $a_j=\overline{z_{i_k,j}}/|z_{i_k,j}|$ when nonzero and zero otherwise. These prescriptions define $a\in {\ell }^{\infty }$. The bounded linear functional $z\mapsto {\sum }_j{a}_j{z}_j$ has real part at least $3\delta /4-\delta /4=\delta /2$ on every selected $z_{i_k}$, contradicting weak convergence. Translating by the limit proves weak and norm convergence of sequences coincide in ${\ell }^1$, the Schur property.

A compact operator sends bounded sets to relatively norm-compact sets. Every bounded sequence in ${\ell }^2$ has a weakly convergent subsequence by the argument above, after scaling into the unit ball. Its image under $T:{\ell }^2\to {\ell }^1$ converges weakly and therefore in norm by the Schur property. Sequential compactness in a metric space gives relative compactness of the image of the unit ball. Every bounded linear operator from ${\ell }^2$ to ${\ell }^1$ is compact.

In an infinite-dimensional Hilbert space, every bounded sequence has a weakly convergent subsequence, but it need not have a norm-convergent one. For example an orthonormal sequence $e_n$ has pairwise distance $\sqrt{2}$ and therefore no strongly convergent subsequence, although $e_n\rightharpoonup 0$ by Bessel inequality.

More generally, weak sequential compactness of bounded sequences in a reflexive Banach space ensures a weakly convergent subsequence with its limit in that space. Conversely, this property for all bounded sequences characterizes reflexivity, using the Eberlein-Šmulian theorem and weak compactness of the closed unit ball. Thus reflexivity replaces finite-dimensional norm compactness by weak sequential compactness.

In a nonreflexive Banach space there is no such general weak-subsequence guarantee. The coordinate unit vectors in ${\ell }^1$ give an example: by the Schur property, weak convergence would imply norm convergence, impossible for their pairwise distance two. Banach-Alaoglu theorem supplies weak-star compactness of a dual unit ball, which gives convergent subnets, not automatically convergent subsequences. For a separable predual, the weak-star compact dual ball is metrizable and subsequences do suffice. For an arbitrary Banach space one can also regard a bounded sequence in its bidual and extract a weak-star convergent subnet there; the limit need not belong to the original space. These qualifications distinguish weak from weak-star compactness.

Weak convergence $u_j\rightharpoonup u$ means $F(u_j)\to F(u)$ for every $F\in X^{\ast }$. Weak-star convergence $T_j\stackrel{\ast }{\rightharpoonup }T$ means $T_j(x)\to T(x)$ for every $x\in X$, viewing $X$ as the predual. The Sequential Banach-Alaoglu theorem for a separable predual says that every norm-bounded sequence in $X^{\ast }$ has a weak-star convergent subsequence. Separability is what turns the bounded weak-star compactness statement into this sequential form.

For the weak-star limit of periodic rescalings, apply it with $X=L^1(\mathbb{R})$, which is separable, and $X^{\ast }=L^{\infty }(\mathbb{R})$. The rescaled functions have uniform essential-supremum bound $\Vert \theta {\Vert }_{\infty }$. Let $q=\theta -\bar{\theta }$ and $F(t)={\int }_0^{t}q(s)ds$. Since $q$ is one-periodic with zero mean, $F$ is a bounded one-periodic absolutely continuous primitive. Thus for every finite interval,Every weak-star subsequential limit $h$ therefore satisfies ${\int }_a^b(h-\bar{\theta })=0$ for all $a<b$. To apply the supplied uniqueness fact without assuming global integrability, fix $R>0$ and set $v=(h-\bar{\theta })1_{[-R,R]}$. This is in $L^1(\mathbb{R})$, and its integral over any interval is zero, since intersecting with $[-R,R]$ again gives an interval. Hence $v=0$ almost everywhere. Taking integer $R\to \infty$ yields $h=\bar{\theta }$ almost everywhere on the whole line.

Finally, if the full sequence did not converge weak-star to this constant, some $g\in L^1$ and some subsequence would have its pairing with $\theta (jx)-\bar{\theta }$ bounded away from zero. Sequential compactness gives a further weak-star convergent subsequence, whose limit must be the constant just identified, a contradiction. ThereforeThis is averaging against integrable test functions, not a claim of pointwise or strong norm convergence.

Weak convergence means $\ell (u_j)\to \ell (u)$ for every bounded linear functional $\ell \in X^{\ast }$. Norm convergence implies this by $|\ell (u_j-u)|\le \Vert \ell \Vert \Vert u_j-u\Vert$. The converse fails for coordinate unit vectors in ${\ell }^2$: their norms are one, but pairing with any square-summable sequence tends to zero, so they are weakly null.

For the subsequence assertion apply Gram-Schmidt process to a countable dense subset to choose a countable orthonormal basis $(e_m)$ of the separable Hilbert space and a bound $M$ for the sequence. Repeated subsequence selection and diagonalization make every coefficient $⟨u_{j_k},e_m⟩$ converge to a scalar $a_m$. Bessel inequality gives ${\sum }_{m=1}^N|a_m{|}^2\le M^2$ for every $N$, so $u={\sum }_m{a}_m{e}_m$ exists in $H$ with norm at most $M$. Pairings with finite linear combinations of the basis converge. Approximating any other test vector by such combinations and using the common norm bound proves $u_{j_k}\rightharpoonup u$. The finite-dimensional case uses the same argument with a finite basis.

Apply this to every subsequence of the bounded $L^2$ sequence. Any weakly convergent further subsequence has limit $v$ with ${\int }_a^{b}v=0$, since interval indicators are $L^2$ tests. The permitted fact gives $v=0$ almost everywhere. If the whole sequence failed to converge weakly to zero, some fixed test functional and subsequence would stay a positive distance from zero. Its weakly convergent further subsequence would then contradict the preceding conclusion. Thus the entire sequence converges weakly to zero in $L^2(0,1)$.

A subset $K$ of a normed space is sequentially weakly closed when every weakly convergent sequence in $K$ has its limit in $K$. Every weakly closed set has this property. For a convex set in a Banach space, it is equivalent to closure in the norm topology: Mazur lemma produces norm convergent convex combinations from any weakly convergent sequence, and conversely norm convergence implies weak convergence. For a Hilbert space, the weak Banach–Saks theorem in a Hilbert space supplies these convex combinations as subsequence averages. No equivalence with weak closedness is asserted here for arbitrary nonconvex sets.

For bounded linear operators between Hilbert spaces with $\Vert Bu\Vert \ge \beta \Vert u\Vert$ and $\beta >0$, the operator $K^{\ast }K+\alpha B^{\ast }B$ is coercive and invertible for $\alpha >0$. The reconstruction uniquely minimizes $\Vert Ku-f{\Vert }^2/2+\alpha \Vert Bu{\Vert }^2/2$. Testing its normal equation for coercive Tikhonov regularization by $u$ gives $\Vert R_{\alpha }\Vert \le 1/(2\beta \sqrt{\alpha })$. If $K$ is injective, exact-data consistency and $\alpha \to 0$, $\delta /\sqrt{\alpha }\to 0$ give norm convergence to $K^{†}f$.

On $(0,1)$, for $k\ge 0$ and $0\le j<2^k$, the displayed indicator functions form a sequence that converges to zero in every finite Lp norm while failing to converge pointwise anywhere. Indeed, for $1\le p<\infty$,Every point belongs to exactly one interval in each dyadic block, and for $k\ge 1$ it misses at least one other interval in that block. Thus every point sees infinitely many ones and infinitely many zeros. Half-open intervals specify the behaviour at dyadic endpoints. This separates norm convergence in an Lp space from pointwise convergence and convergence almost everywhere.

A vector-valued function is a function $F:X\to V$ taking values in a vector space. For example, $F(t)=(\cos t,\sin t)$ describes the unit circle in ${\mathbb{R}}^2$: one real number controls a two-component vector.

In a real or complex finite-dimensional vector space equipped with a norm, choosing a basis writes $F={\sum }_j{f}_j{e}_j$ in scalar-valued functions. Continuity and differentiability can then be checked in these coordinates, and $F^{\prime }={\sum }_j{f}_j^{\prime }{e}_j$ when the derivatives exist. Finitely many coordinates matter: coordinatewise convergence in an infinite-dimensional vector space need not imply norm convergence.