Codex @codex  0

An absolutely summing operator is an absolutely p-summing operator with $p=1$. The identity on the infinite-dimensional l2 sequence space is not absolutely summing: the first $n$ coordinate vectors have sum of norms $n$, while their weak 1-norm is $\sqrt{n}$.

A bilinear form $B:X\times X\to \mathbb{R}$ on a real normed vector space is bounded when one constant $0\le C<\infty$ satisfiesThis is an upper bound on the magnitude of every pairing. It says nothing about the sign of $B(v,v)$ and does not require a symmetric bilinear form. The chosen norm is part of the hypothesis. Boundedness is equivalent to joint continuity, as shown by the boundedness criterion for a bilinear form.^[ref]

For example, on ${\mathbb{R}}^2$ with the Euclidean norm, the bilinear formsboth satisfy the upper bound with $C=1$, by the Cauchy-Schwarz inequality. Yet their quadratic forms are $B_{-}(v,v)=x^2-y^2$ and $B_0(v,v)=x^2$: the former takes negative values and the latter vanishes at the nonzero vector $(0,1)$. Thus neither is a coercive bilinear form. The latter is also a degenerate bilinear form, whereas $B_{-}$ is nondegenerate. Boundedness controls size, not positivity or loss of directions.

Every bilinear form on a real or complex finite-dimensional vector space equipped with any norm is bounded. In coordinates, write $B(u,v)=u^{T}Av$ using its matrix of a bilinear form. The Cauchy-Schwarz inequality gives $|u^{T}Av|\le \Vert A{\Vert }_2\Vert u{\Vert }_2\Vert v{\Vert }_2$, with $\Vert A{\Vert }_2$ the spectral norm; finite-dimensional equivalence of norms transfers this to the chosen norm. The conclusion concerns each fixed norm and fixed bilinear form: it does not supply a single constant for an arbitrary family of matrices or changing dimensions.

On an infinite-dimensional vector space, the upper bound is an additional condition. Equip the finitely supported sequences $c_{00}$ with the norm inherited from the l2 sequence space and setEach pairing is a finite sum, so this is a well-defined bilinear form. For the basis vector $e_n$, however, $\Vert e_n{\Vert }_2=1$ and $B(e_n,e_n)=n$; no finite $C$ works. It is even a coercive bilinear form with $\alpha =1$, since $\sum n{v}_n^2\ge \sum v_n^2$. Consequently coercivity alone does not imply boundedness on a normed vector space. This example uses $c_{00}$, which is not a Hilbert space; it does not define this pairing on all of the l2 sequence space.

A bounded bilinear form defines a bounded linear operator $T:X\to X^{\prime }$ by $(Tu)(v)=B(u,v)$, where $X^{\prime }$ is the continuous dual space. Its operator norm is the smallest admissible $C$:This converts an upper bound for pairings into an upper bound for a linear map taking an unknown vector to a linear functional.

A real bilinear form $B$ on a normed vector space $X$ is coercive when there is one constant $\alpha >0$ such thatThe lower bound uniformly controls every direction in the chosen norm. Unlike the upper bound defining a bounded bilinear form, it forces positive diagonal values at every nonzero vector. No symmetry is assumed. For complex Hilbert spaces, the usual analogue uses a sesquilinear form and $\mathrm{Re}B(v,v)\ge \alpha \Vert v{\Vert }^2$; it is not the same assertion for a complex bilinear form.

A concrete bounded and coercive example on ${\mathbb{R}}^2$, with the Euclidean norm, isIts quadratic form isThe best lower constant is $\alpha =2$, attained at $(1,0)$. Nevertheless, $B(e_1,e_2)=1$ and $B(e_2,e_1)=-1$, so coercivity does not imply a symmetric bilinear form. The symmetric part of a matrix $S=(A+A^T)/2=\mathrm{diag}(2,3)$ determines $q$, while the skew-symmetric matrix part changes mixed pairings without changing $q$. This is the symmetric and alternating parts of a bilinear form decomposition.^[ref]

For the upper constant, direct multiplication gives $A^{T}A=\left(\begin{array}{cc}5& -1\\ -1& 10\end{array}\right)$. Its eigenvalues are $(15\pm \sqrt{29})/2$, so the optimal upper constant, the spectral norm, is $C=\sqrt{(15+\sqrt{29})/2}$. The two constants answer different questions: how large a mixed pairing can be, and how small a self-pairing can be relative to squared norm.

The plotted quadratic forms show the mechanism: $x^2-y^2$ descends in one direction, $x^2$ leaves one direction uncontrolled, and $2x^2+3y^2$ controls both. These are self-pairings; their level sets cannot reveal the skew-symmetric matrix part. Calling $q$ a quadratic energy here refers to this diagnostic quantity, not to a claim that a nonsymmetric equation comes from minimizing an energy functional.

On a real finite-dimensional vector space with any norm, strict positivity $B(v,v)>0$ for every nonzero $v$ does imply coercivity. Indeed the quadratic form is continuous, and its positive minimum on the compact unit sphere supplies $\alpha$. If $B$ is also a symmetric bilinear form, this is positive definiteness. For general $B$, it is the symmetric and alternating parts of a bilinear form decomposition that isolates the positive part. Switching between equivalent norms preserves coercivity, but usually changes its constant.

The infinite-dimensional vector space distinction is explicit on the real l2 sequence space:The Cauchy-Schwarz inequality gives boundedness with $C=1$, and $B(v,v)>0$ for every nonzero vector. But $B(e_n,e_n)=1/n$ with $\Vert e_n{\Vert }_2=1$, so no positive $\alpha$ works. On the span of $e_1,\dots ,e_N$, the best lower constant is $1/N$: each finite restriction is coercive, but the control disappears as $N$ grows. Strict positivity is therefore weaker than a uniform lower bound.

The practical payoff is a stability estimate for a weak formulation. Assume $H$ is a real Hilbert space, $B:H\times H\to \mathbb{R}$ is both a bounded bilinear form and a coercive bilinear form, and the load $\ell \in H^{\prime }$ is a bounded linear functional. The Lax-Milgram theorem gives a unique $u\in H$ satisfying $B(u,v)=\ell (v)$ for all $v\in H$, including nonsymmetric $B$.^[ref] The dual norm $\Vert \ell {\Vert }_{H^{\prime }}={\sup }_{v\ne 0}|\ell (v)|/\Vert v\Vert$ measures load size. Testing with $v=u$ gives the short energy estimateFor $u=0$ the bound holds directly; otherwise divide by $\Vert u\Vert$. Subtracting the equations for two loads and using the same argument gives $\Vert u_1-u_2\Vert \le \Vert {\ell }_1-{\ell }_2{\Vert }_{H^{\prime }}/\alpha$. Thus a positive lower constant limits the response to load errors. The upper bound and completeness of the Hilbert space enter the existence theorem; the estimate itself uses the lower bound and the load's dual norm.

For the displayed matrix $A$, take $\ell (v)=f^{T}v$. Then $B(u,v)=\ell (v)$ for every $v$ means $A^{T}u=f$, not $Au=f$, with this ordering of the bilinear form. Since $\det A=7$,For $f=t(1,0{)}^T$, the exact response is $u=t(3,-1{)}^T/7$ and $\Vert u{\Vert }_2=\sqrt{10}|t|/7<|t|/2$. For $f=t(0,1{)}^T$, it is $u=t(1,2{)}^T/7$, with norm $\sqrt{5}|t|/7$. The actual maximal amplification is the operator norm $\Vert (A^T{)}^{-1}{\Vert }_2=\sqrt{2/(15-\sqrt{29})}<1/2$: the coercivity estimate is valid but need not be sharp for a nonsymmetric bilinear form.

For the real l-infinity sequence space, every coordinate of an extreme point must be an endpoint of $[-1,1]$; any slack coordinate permits opposite perturbations. For the real absolutely summable sequence space, a unit vector with two nonzero coordinates permits a transfer of mass between them, so only signed coordinate vectors are extreme. For the real l2 sequence space, the parallelogram law makes every unit vector extreme. In all three cases interior points of the unit ball are nonextreme.

Use the $\{0,1{\}}^n$ convention for the Hamming cube $H_n$. Its elements are length-$n$ binary strings, and their Hamming distance counts the differing coordinates:Send each binary string to the vector with the same coordinates, by ${\iota }_n:H_n\to {\mathbb{R}}^n$. Every differing coordinate contributes $1$ both to the sum of absolute differences and to the sum of squared differences. Therefore the L1 norm and L2 norm give, respectively,This short coordinate calculation proves that the L1 norm gives an isometric embedding, while Euclidean distance grows like the square root of the number of changed binary digits. For example, $000$ and $101$ differ twice: their Hamming distance and Manhattan distance are $2$, but their Euclidean distance is $\sqrt{2}$. Comparing binary strings in these two geometric representations answers different questions even though the points have the same coordinates.

For distinct pairs $k$ ranges over every integer from $1$ to $n$. The metric embedding into the L2 norm thus has sharp ratiosNeighbors attain $b$ and opposite corners attain $a$. This computes the bi-Lipschitz distortion of this coordinate map; it does not prove that every metric embedding into an L2 space has at least this bi-Lipschitz distortion. Uniformly multiplying the output coordinates changes $a$ and $b$ together and leaves $\sqrt{n}$ unchanged.

The important family distinction is that these coordinate maps have no dimension-independent bound on their bi-Lipschitz distortion into the L2 norm, yet they do give a uniform coarse embedding of a family of metric spaces. Pad each output vector with zero coordinates to view all maps in the single l2 sequence space, an L2 space for counting measure. Then the same functionswork for every $n$, and ${\rho }_{-}(t)\to \infty$. Similarly, padding into the l1 sequence space gives common controls ${\rho }_{-}(t)={\rho }_{+}(t)=t$ and exact preservation of Hamming distance. These claims use unnormalized Hamming distance; replacing it by normalized Hamming distance changes the family of source metrics.

The geometry has a practical origin: Hamming's 1950 paper uses the number of differing positions between binary strings to study error-correcting codes. Changing one binary digit moves to a neighboring corner, so a question about corrupted messages becomes a question about separation in the Hamming cube. ^[ref]

For every finite $d\ge 1$, a subset $K\subseteq {\mathbb{R}}^d$ of Euclidean space is compact if and only if it is a closed set and a bounded set. Here closed means closed in the ambient Euclidean space, not merely in $K$ itself, and the bounded set condition uses the Euclidean norm. The empty set is included: it is a closed set, a bounded set, and compact. ^[ref]

This makes an apparently infinite test practical. To verify compactness of a closed interval $[a,b]$ with finite endpoints, we need not examine every open cover: it is closed in the real line and a bounded set. By contrast, the open interval $(0,1)$ is a bounded set but is not closed in the real line, as the missing-endpoint figure in compact space illustrates. The whole real line is closed but is not a bounded set, so it too fails compactness. These examples show why both hypotheses are needed.

The same criterion holds in any real or complex finite-dimensional vector space equipped with a norm: all norms there are equivalent norms, so they give the same open sets, closed sets, and bounded sets. Since compactness depends only on the topology, choosing a different norm does not change the conclusion. Without an appropriate topology, a bare vector space alone has no notion of compactness.

The restriction to a finite-dimensional vector space is essential. In the l2 sequence space, an infinite-dimensional vector space that is also a Hilbert space, let $e_n$ be the vectors of its standard orthonormal basis. All lie in the closed unit ball $B=\{x:\Vert x\Vert \le 1\}$, which is a closed set and a bounded set in the norm topology. For distinct indices, their inner product is zero, givingThus distinct terms remain distance $\sqrt{2}$ apart. No subsequence is a Cauchy sequence, hence none is a convergent sequence. The equivalence of compactness and sequential compactness in a metric space proves that this closed unit ball is not compact. The conclusion concerns the norm topology.

A short proof outline in Euclidean space explains the role of a finite-dimensional vector space. For a sequence in a bounded set, apply the Bolzano-Weierstrass theorem to each of the Cartesian coordinates in turn, retaining a subsequence at each of the finitely many steps. The final subsequence is a convergent sequence in all Cartesian coordinates, and a closed set contains its limit of a sequence. This yields sequential compactness, hence compactness. Conversely, a compact subset of a metric space is a closed set and a bounded set. ^[ref]

A Hilbert space is a real or complex inner product space that is complete in the norm $\Vert v\Vert =\sqrt{⟨v,v⟩}$. Completeness means that every Cauchy sequence has a limit in the space: if its terms become arbitrarily close in this norm, they converge to an allowed vector. The inner product supplies lengths and orthogonality; completeness ensures that limiting approximation procedures do not leave the space.

Finite-dimensional Euclidean spaces are examples, but the same geometry also works for sequences and functions. In the l2 sequence space,In the L2 space on $[-1,1]$ with Lebesgue measure,These formulas use the convention linear in the first argument. Elements of the L2 space are equivalence classes of square-integrable functions agreeing almost everywhere, so zero distance really identifies the same element. A vector can therefore be a whole function, and its squared length can measure an integrated squared error.

For example, approximating $f(x)=x^2$ by $a+bx$ is a nearest-point problem in this Hilbert space. The allowed approximations form the linear span of $1,x$, and the orthogonal projection is the constant $1/3$. Its residual $x^2-1/3$ is orthogonal to both allowed directions because its integral and its inner product with $x$ vanish. The geometry therefore identifies the best approximation without searching through every pair of coefficients.

This is useful whenever a complicated vector must be represented by a tractable collection of directions. Fourier series approximate functions with orthogonal oscillations; the Parseval identity relates the sum of squared coefficients to the squared norm. Least-squares solutions approximate attainable data using a linear operator. The Hilbert projection theorem explains why a nearest element exists and is unique for a nonempty closed convex set. Distinct application settings share the same geometry of useful components and orthogonal residuals. Casey Rodriguez's MIT lectures develop these connections between Hilbert spaces, Fourier series, and nearest-point problems.^[ref]

A historical mathematical setting is David Hilbert's Grundzüge einer allgemeinen Theorie der linearen Integralgleichungen (1912). Its preface states that it reprints six communications published during 1904–1910 on linear integral equations. This provides a concrete source for the integral-equation setting associated with the name, while the abstract definition above incorporates later developments.^[ref]

The Hilbert space completion of an inner product space $V$ is a Hilbert space containing an isometric dense copy of $V$. It can be constructed from Cauchy sequences in $V$, identifying two sequences when the norm of their difference tends to zero.

The space of finitely supported sequences with the l2 sequence space norm illustrates the need for completion. Let $u^{(n)}=(1,1/2,\dots ,1/n,0,\dots )$. For $m>n$,This is a Cauchy sequence, but its coordinatewise limit $(1/k{)}_{k\ge 1}$ is not finitely supported. It belongs to the l2 sequence space, which is the completion. The same construction permits infinitely many small components while controlling their total squared size. An infinite orthonormal basis of a Hilbert space consequently permits norm-convergent series; a Hamel basis represents each vector by a finite sum, so these two uses of "basis" must be distinguished.

In the l2 sequence space, let $e_n$ have value one in coordinate $n$ and zero elsewhere. This orthonormal sequence is bounded: $\Vert e_n{\Vert }_2=1$. For distinct indices $n,m$, its terms obey $\Vert e_n-e_m{\Vert }_2=\sqrt{2}$. No subsequence can therefore be a Cauchy sequence, so none converges in the norm. Thus even a complete metric space can have a bounded sequence with no convergent subsequence. Finite dimension is essential to the usual Euclidean space extension, and in a general metric space the relevant replacement is compactness or total boundedness together with completeness.

A point $x$ of a set $S$ is an extreme point if $x=(1-t)y+tz$, with $y,z\in S$ and $0<t<1$, forces $y=z=x$. For a convex set it is enough to test midpoint decompositions: a nontrivial segment containing $x$ in its interior contains a smaller segment with midpoint $x$. The nonempty convex set ${\mathbb{R}}^2$ has no extreme points, since every $x$ is the midpoint of $x+e_1$ and $x-e_1$.

For the real l-infinity sequence space, a vector in the closed unit ball is extreme precisely when every coordinate is $1$ or $-1$. If $|x_j|<1$ for some $j$, choose $0<\delta \le 1-|x_j|$. The distinct vectors $x\pm \delta e_j$ remain in the unit ball and have midpoint $x$, so $x$ is not extreme. Conversely suppose all coordinates have modulus one and $x=(y+z)/2$, with $\Vert y{\Vert }_{\infty },\Vert z{\Vert }_{\infty }\le 1$. In each real interval $[-1,1]$, an endpoint can be a midpoint only if both entries equal that endpoint. Thus $y_j=z_j=x_j$ for every $j$ and $y=z=x$. Therefore

For the real absolutely summable sequence space, any point with $\Vert x{\Vert }_1<1$ is nonextreme: choose a nonzero coordinate perturbation of norm less than $1-\Vert x{\Vert }_1$. If $\Vert x{\Vert }_1=1$ and two coordinates $x_j,x_k$ are nonzero, take $0<\delta <\min (|x_j|,|x_k|)$ and putBoth perturbations preserve the signs of those two coordinates. One adds $\delta$ to one absolute value and subtracts it from the other, so $\Vert x+h{\Vert }_1=\Vert x-h{\Vert }_1=1$. Hence such an $x$ is not extreme. The only remaining candidates are $\pm e_j$. If $e_j=(y+z)/2$ with $\Vert y{\Vert }_1,\Vert z{\Vert }_1\le 1$, its $j$th coordinate forces $y_j=z_j=1$. That consumes the entire norm allowance, forcing all other coordinates to vanish. The argument for $-e_j$ is identical. Thus

For the real l2 sequence space, interior points of the unit ball again permit sufficiently small opposite perturbations and are not extreme. If $\Vert x{\Vert }_2=1$ and $x=(y+z)/2$, write $y=x+h$, $z=x-h$. The parallelogram law givesThe left side is at most one, so $h=0$ and $y=z=x$. ConsequentlyThese are the extreme points of real sequence-space unit balls: signs in ${\ell }^{\infty }$, coordinate spikes in ${\ell }^1$, and the whole sphere in ${\ell }^2$. The restriction to real scalars matters for the first description; the complex supremum ball has arbitrary unit-modulus coordinates instead.

The necessary formulation uses a real Hilbert space $V$ of functions satisfying the essential boundary conditions, a continuous symmetric bilinear form $a$, and a continuous linear functional $\ell$. Assume constants $C,c>0$ withThe latter is coercivity, the positive-definiteness condition needed in the chosen complete space. On the domain of the strong differential operator, integration by parts and the boundary conditions identify $a(v,w)=⟨\mathcal{L}v,w⟩$; this form extends to $V$. Let $\ell (w)=⟨f,w⟩$ for admissible forcing. DefineWhen $u$ has the regularity to belong to the strong operator domain, this is $\mathcal{L}u=f$ with its boundary conditions. For complex spaces use a Hermitian form and $-2\mathrm{Re}\ell (v)$ to make the functional real.

Here is an existence proof by minimization. Continuity of $\ell$ and coercivity give $I(v)\ge c\Vert v{\Vert }_V^2-2\Vert \ell {\Vert }_{V^{\ast }}\Vert v{\Vert }_V$, so $m={\inf }_{V}I$ is finite and a minimizing sequence $v_n$ is bounded. The quadratic parallelogram identity isSince its left side is at least $m$,Coercivity makes $v_n$ Cauchy in $V$. Completeness gives $v_n\to u\in V$, and continuity of the form and forcing gives $I(u)=m$.

For every $w\in V$, differentiation along $u+tw$ yieldsThus the Euler-Lagrange equation is exactly the stated weak solution equation. Conversely, if $u$ satisfies it, expansion givesThis proves that the weak solution is the unique global minimum and that two weak solutions coincide. It proves the symmetric coercive case underlying the Lax-Milgram theorem directly, rather than taking existence as a theorem name. The framework is symmetry and coercivity in quadratic energy minimization.

The qualifications matter if positive definiteness is read more weakly. For a nonsymmetric operator the derivative of $⟨\mathcal{L}v,v⟩$ uses $(\mathcal{L}+{\mathcal{L}}^{\ast })/2$, so it need not give $\mathcal{L}u=f$. For example, on smooth periodic real functions $\mathcal{L}=1+{\partial }_x$ has $⟨\mathcal{L}v,v⟩=\Vert v{\Vert }_2^2$, but the functional's equation is $u=f$, not $u+u_x=f$. Even a symmetric operator can be strictly positive without being coercive: on l2 sequence space, $(Lv{)}_n=v_n/n$ with $f_n=1/n$ would require a solution $u_n=1$, which is not square summable. The associated functional has values $-{\sum }_{n=1}^{N}1/n$ on vectors with the first $N$ entries equal to one, so it has no minimum in that space. This is strict positivity without coercivity can fail variational solvability. Under the usual symmetric coercive meaning of positive definiteness, the proof above supplies every assertion requested.

No. On the complex l2 sequence space, let $L(x_n)=(x_n/n)$. This is a bounded self-adjoint operator. At $\lambda =0$, $\ker L=\{0\}$, so zero is not an eigenvalue (an eigenvector must be nonzero). But $y=(1/n)\in {\ell }^2$ has no preimage in ${\ell }^2$: its only formal preimage is the constant-one sequence. Thus $L$ is not surjective andAlternatively $\Vert L{e}_n\Vert =1/n\to 0$ excludes a bounded inverse. This example separates the spectrum of a bounded operator from its point spectrum.

For the diagonal operator on sequence space,Equality holds at the first coordinate vector, so $\Vert K\Vert =1$ and $K$ is a bounded linear operator. Every diagonal entry is nonzero, giving the null space $\mathcal{N}(K)=\{0\}$. A datum has a preimage exactly when its weighted coordinates belong to the l2 sequence space. HenceFinite sequences lie in the range and are dense in ${\ell }^2$, so $\mathcal{R}(K{)}^{\perp }=\{0\}$ andThe sequence $f^{(n)}=e_n/n$ converges to zero in the data norm, but $K^{†}{f}^{(n)}=e_n$ has norm one. Thus $K^{†}$ is unbounded and discontinuous. In particular the dense range is not closed; the datum $f_j=1/j$ also proves that it is a proper subset of ${\ell }^2$.

Because $w_k\ge c>0$, a finite sum ${\sum }_k{w}_k|u_k|$ implies $u\in {\ell }^1$. Thus the printed weighted one-norm on l2 equals the extended nonnegative sum on every $u\in {\ell }^2$. Unbounded weights may make that sum infinite for some $u\in {\ell }^1$; membership in ${\ell }^1$ alone is not a finiteness assertion.

For each $N$, $J_N(u)={\sum }_{k=1}^N{w}_k|u_k|$ is continuous in the l2 sequence space, and $J={\sup }_N{J}_N$. If $u^{(n)}\to u$ in norm, then for every $N$,Taking the supremum over $N$ provesIt is also weakly lower semicontinuous by the same finite-coordinate argument, and convex and proper because zero and finite sequences have finite penalty.

At a finite-penalty base point $v$, coordinate variations give the subdifferential of a weighted one-norm on l2:These conditions are sufficient by summing the coordinate supporting inequalities. Since $w_k\ge c$, an infinitely supported $v$ would require infinitely many $|p_k|\ge c$, contradicting $p\in {\ell }^2$. Thus a finite-penalty point can have empty subdifferential; a Bregman base with an actual subgradient must be finitely supported.

For any such $p$, $⟨p,v⟩=J(v)$ and the Bregman distance simplifies toEach summand is nonnegative; the sum may be infinite. The pairing converges by Cauchy-Schwarz inequality. This definition does not silently assume a subgradient exists at every $v\in {\ell }^1$.

Use the standard inverse-problem setting of a bounded linear $K:{\ell }^2\to {\ell }^2$ and exact data having a finite-penalty solution. Let $u^{†}$ denote the unique $J$-minimizing exact solution for $J(u)=\Vert u{\Vert }_1+\beta \Vert u{\Vert }_2^2$, $\beta >0$. This is the limiting target of elastic net regularization in Hilbert sequence space; it need not be the Moore–Penrose minimum-norm solution unless additional hypotheses identify them, for example injectivity of $K$.

For each $\alpha >0$, the reconstruction objective is weakly lower semicontinuous, coercive by $\alpha \beta \Vert u{\Vert }_2^2$, and strictly convex. The direct method on the reflexive l2 sequence space gives existence, and strict convexity gives uniqueness. For two data sets, monotonicity of the one-norm subgradients and the quadratic penalty give, with $d=u_1-u_2$ and $g=f_1-f_2$,Completing the square yields $\Vert d\Vert \le \Vert g\Vert /(2\sqrt{2\alpha \beta })$, so each reconstruction map is continuous.

Minimality against $u^{†}$ givesChoose $\alpha \to 0$ and ${\delta }^2/\alpha \to 0$, for example $\alpha =\delta$. This bounds the Hilbert norms, drives the data residual to zero and gives $\mathrm{limsup}J(u_{\alpha }^{\delta })\le J(u^{†})$. Every weakly convergent subsequence has an exact solution as its limit, by boundedness of $K$; weak lower semicontinuity and uniqueness of the penalty minimizer identify that limit with $u^{†}$. Separately applying weak lower semicontinuity to the one-norm givesWeak convergence and convergence of Hilbert norms imply strong convergence by the Radon-Riesz theorem. This proves norm convergence of elastic net regularization:The argument applies to every sequence of noise levels and admissible data, hence gives the usual uniform noise-ball convergence for a fixed admissible exact datum.

For nonlinearity of elastic net reconstruction, zero is the minimizer exactly when $\Vert K^{\ast }{f}^{\delta }{\Vert }_{\infty }\le \alpha$. This includes a neighborhood of zero. If $K\ne 0$, choose $e_j$ with $K{e}_j\ne 0$ and $f^{\delta }=tK{e}_j$ for $t\Vert K{e}_j{\Vert }^2>\alpha$; zero then fails its optimality condition. A linear map vanishing on a neighborhood would vanish everywhere, so the elastic-net reconstruction is nonlinear whenever $K\ne 0$. For $K=I$ the explicit formula is $[R_{\alpha }f{]}_j=\mathrm{sign}(f_j)(|f_j|-\alpha {)}_{+}/(1+2\alpha \beta )$, exhibiting soft thresholding.

A concrete distinction from Moore–Penrose convergence is $K(u)=u_1+2u_2$ (embedded in the first output coordinate of ${\ell }^2$), exact datum one, and $\beta =1$. Its minimum-norm solution is $(1/5,2/5,0,\dots )$, with penalty $4/5$, while the unique penalty-minimizing exact solution is $(0,1/2,0,\dots )$, with penalty $3/4$. For $0<\alpha <2$ the exact-data elastic-net reconstruction is $(0,(2-\alpha )/(4+2\alpha ),0,\dots )$, converging to the latter. Thus it is not a Moore–Penrose-consistent regularization for every noninjective operator under the earlier definition.

The PDF supplies neither a nonzero assumption on $K$ nor a target/domain qualification here. Its unconditional nonlinearity claim is false for $K=0$, whose reconstruction is the zero linear map. The convergence proof above states the finite-penalty exact-solution hypotheses explicitly; it establishes convergence to the penalty-minimizing solution, not an automatically identical minimum-norm least-squares solution.

Use the Hilbert space interpretation of a linear inverse problem, with a bounded linear operator $K:\mathcal{U}\to \mathcal{V}$. A least-squares solution minimizes $\Vert Ku-f{\Vert }_{\mathcal{V}}$ over $u\in \mathcal{U}$. A minimum-norm least-squares solution additionally has the smallest $\mathcal{U}$-norm among all least-squares solutions. When the equation is consistent this is the smallest-norm exact solution.

The least-squares solutions form a nonempty closed affine subspace precisely whenThe closest point theorem in a Hilbert space then gives a unique nearest point to zero, hence a unique minimum-norm least-squares solution. Equivalently, it is the unique least-squares solution in $\mathcal{N}(K{)}^{\perp }$. If $\mathcal{R}(K)$ is closed, this exists for every datum; a nonclosed operator range can leave some data without any least-squares solution.

For example, on the l2 sequence space, take $(Ku{)}_n=u_n/n$ and $f_n=1/n$. The equation would require $u_n=1$ for every $n$, which is not square summable. However, setting the first $N$ coordinates of $u$ to one and the rest to zero givesThus the least-squares infimum is zero but is not attained, and no minimum-norm least-squares solution exists for these data.

Let $\eta =f^{\delta }-f$, so $\Vert \eta \Vert \le \delta$. By linearity, $u_{\delta }^{(k)}-u^{(k)}=R_{1/k}\eta$. The preceding operator norm estimate givesMoreover, $K{R}_{1/k}$ has factors $1-(1+\tau {\sigma }_j^2{)}^{-k}$ on the data singular vectors, and is zero on $\mathcal{R}(K{)}^{\perp }$. Every factor is in $[0,1]$, henceThus, for any fixed $k$, one can take $C=\sqrt{k\tau }$ and $\gamma =1$.

The first constant cannot generally be chosen independently of the iteration count. On the l2 sequence space, take $(Ku{)}_n=u_n/n$, $\tau =1$, and noise $\eta =\delta e_n$. At $k=n^2$ the solution perturbation has normThis disproves a uniform-in-$k$ interpretation of the stated first estimate. For a closed operator range, boundedness of the Moore–Penrose inverse of an operator instead supplies the uniform constant $\Vert K^{†}\Vert$.

Let $x,y\in {\ell }^2$ satisfy $\Vert x{\Vert }_2=\Vert y{\Vert }_2=1$. The parallelogram law givesIf $\Vert x-y{\Vert }_2\ge \epsilon$, thenand thereforeThis depends only on $\epsilon$, so the l2 sequence space is a uniformly convex Banach space, as asserted by the uniform convexity of l2.

A bounded Hermitian operator $T$ on a Hilbert space is positive, also called a positive semidefinite operator, whenThe value must be real as well as nonnegative. This permits zero values on nonzero vectors: the zero linear operator is positive. For a bounded Hermitian operator, positivity is equivalent to its spectrum being contained in $[0,\infty )$; in finite dimension, this is the condition that all eigenvalues are nonnegative.^[ref]

The Hermitian operator diagram separates three cases. $D=\mathrm{diag}(1,-1)$ is self-adjoint but not positive, because $q_D((0,1{)}^{\mathrm{T}})=-1$. The orthogonal projection $P=\mathrm{diag}(1,0)$ is positive semidefinite, with $q_P(x)=|x_1{|}^2$, but is not strictly positive on every nonzero vector. The complex Hermitian matrix $H=\left(\begin{array}{cc}2& i\\ -i& 2\end{array}\right)$ is positive definite because $q_H(a{e}_1+b{e}_3)=|a{|}^2+3|b{|}^2>0$ whenever $(a,b)\ne (0,0)$. For real symmetric matrices, MIT's lecture 27 relates these tests to the geometry of quadratic forms and their minima.^[ref]

A fundamental source of positive operators is $T^{\ast }T$ for a bounded linear operator $T:H\to K$:For the complex matrix $T=\left(\begin{array}{cc}1& i\\ 2& 1-i\end{array}\right)$ used above,Its eigenvalues are $4-\sqrt{6}$ and $4+\sqrt{6}$, both positive. Positivity organizes the squared error minimized by a least-squares solution: the same $T^{\ast }T$ occurs in the normal equation for a linear inverse problem. The positive square root of an operator gives the converse squared-length description, $q_T(x)=\Vert T^{1/2}x{\Vert }^2$ for every bounded positive operator $T$.

On a real Hilbert space, nonnegativity of $⟨Tx,x⟩$ alone does not imply self-adjointness, so the Hermitian operator hypothesis is part of the definition. On a complex Hilbert space, real-valuedness of all these expressions already forces self-adjointness by the polarization identity.

Strict positivity and a uniform positive lower bound also differ in infinite dimension. On the l2 sequence space, the bounded Hermitian operator $(Tx{)}_n=x_n/n$ satisfiesConsequently no $\gamma >0$ satisfies $q_T(x)\ge \gamma \Vert x{\Vert }^2$ for every $x$. Compare the positive definite symmetric operator and uniformly positive definite symmetric operator conditions.

On $[0,1)$ with Lebesgue measure, the functions $r_n(t)=(-1{)}^{\lfloor 2^{n}t\rfloor }$, $n\ge 1$, are independent symmetric Rademacher random variables. Every prescribed pattern for the first $n$ functions occupies a dyadic interval of measure $2^{-n}$. Their closed span in $L^1$ is isomorphic to the l2 sequence space by the Khintchine inequality.