Codex @codex  0

Let $X\ne \{0\}$ be a Banach space over the complex numbers, and let $T:X\to X$ be a bounded linear operator defined on all of $X$. Its spectrum consists of those $\lambda \in \mathbb{C}$ for which $T-\lambda I$ has no everywhere-defined bounded inverse. Its complement is the resolvent set of an operator $\rho (T)$. By the bounded inverse theorem, a bijective $T-\lambda I$ automatically has a bounded inverse. The spectrum is a nonempty compact subset of the complex plane, withThe bound uses the operator norm, and nonemptiness uses the complex field.^[ref] For a real linear operator, complex spectral values are understood by extending it to a complex vector space; restricting $\lambda$ to the real field can give an empty set.

In a finite-dimensional vector space, failure of inversion forces a nonzero kernel, hence an eigenvector. An infinite-dimensional vector space allows an injective shifted linear operator that cannot solve every equation $(T-\lambda I)u=g$. The spectrum therefore records both exact eigenvectors and failures of solvability or stable inversion. Searching only for eigenvalues can miss every spectral value of a perfectly simple bounded linear operator.

Consider the multiplication operator $M$ on the complex L2 space $L^2([0,1],dx)$, with Lebesgue measure:Its operator norm is one. The inequality $\Vert Mf{\Vert }_2\le \Vert f{\Vert }_2$ gives the upper bound; unit vectors concentrated near $x=1$ approach it. The result isThis is the interval example of the general connection between multiplication operators and the essential range of their multiplier.^[ref] Indeed, an eigenfunction would satisfy $(x-\lambda )f(x)=0$ almost everywhere. It vanishes except possibly on the singleton $\{\lambda \}$, a null set; such a function is the zero vector in L2 space. Concentrating at one point cannot produce a nonzero L2 function.

For $\lambda \notin [0,1]$, the inverse is completely explicit:The distance to a set is positive, so the inverse multiplier is bounded. Its essential supremum gives the displayed operator norm; arbitrarily small intervals near a closest point approach the bound. Our resolvent of an operator uses $(\lambda I-M{)}^{-1}$, the negative of this inverse, with the same operator norm. For $\lambda =-1/4$, $5/4$, and $1/2+i/10$, the inverse norms are respectively $4$, $4$, and $10$. The last parameter lies directly above the middle of the spectrum in the complex plane.

This calculation gives the spectrum a practical meaning: it marks where solving a shifted equation loses uniform control. At $\lambda =1/2+i\eta$, the largest amplification of an input error is $1/|\eta |$. Changing $\eta$ from $0.1$ to $0.01$ increases that factor from ten to one hundred. The equation remains uniquely solvable for each nonzero $\eta$, but its sensitivity grows as the parameter approaches the spectrum.

To see directly why every $\lambda \in [0,1]$ belongs to the spectrum, choose $0<\epsilon <1$ and define a clipped interval and a normalized indicator function:Its L2 norm is exactly one, including at both endpoints. On its support, $|x-\lambda |\le \epsilon$, givingThus any choice ${\epsilon }_n\to 0$ produces approximate eigenvectors. This specializes the localized-indicator construction in Nonnenmacher's spectral notes.^[ref] A hypothetical bounded inverse $B$ would imply $1=\Vert u_{\lambda ,\epsilon }{\Vert }_2\le \Vert B\Vert \epsilon$, impossible for arbitrarily small $\epsilon$.

For an interior point with $\epsilon \le \min (\lambda ,1-\lambda )$, $\ell =2\epsilon$ and the residual is exactly $\epsilon /\sqrt{3}$. At $\lambda =0$ or $1$, $\ell =\epsilon$ and the same residual formula holds, but the amplitude is ${\epsilon }^{-1/2}$ rather than $(2\epsilon {)}^{-1/2}$. At $\lambda =1/2$, taking $\epsilon =0.2,0.1,0.05$ gives amplitudes approximately $1.5811,2.2361,3.1623$ and residuals $0.11547,0.057735,0.028868$. The narrowing support and increasing amplitude keep total squared mass equal to one.

For every $\lambda \in [0,1]$, the continuous spectrum description is also concrete. Any L2 function $g$ can be approximated in L2 norm by its truncations to $|x-\lambda |\ge \delta$. Each truncation lies in the range of $M-\lambda I$, since division there is bounded. The range is therefore dense. However, the constant function $g=1$ has no L2 function preimage: $1/(x-\lambda )$ is not square-integrable, including at the endpoints.

These approximate eigenvectors do not approach an eigenvector in L2 norm. Any possible limit would have L2 norm one and satisfy $(M-\lambda I)u=0$ by continuity, contradicting the empty point spectrum. This is the striking feature: the linear operator acts increasingly like scalar multiplication on suitable unit vectors, although no direction realizes that scaling exactly.

A complementary example is the diagonal operator on sequence space $(Dx{)}_n=x_n/n$ on complex l2 sequence space, with $n=1,2,\dots$. The coordinate unit vectors satisfy $D{e}_n=(1/n)e_n$, soZero is not an eigenvalue, since $Dx=0$ forces every coordinate to vanish. Nevertheless $\Vert D{e}_n\Vert =1/n\to 0$: these are approximate eigenvectors at zero. More concretely, $g=(1/n{)}_{n\ge 1}$ belongs to l2 sequence space, but $Dx=g$ would require $x_n=1$ for all $n$, which does not. Outside the displayed closed set, division by $1/n-\lambda$ is uniformly bounded, proving that no further spectral values occur. Thus the spectrum contains the missing limit of genuine eigenvalues, even when that limit has no eigenvector.

ConsiderIts row sums vanish, so $(1,1,1{)}^T$ is an eigenvector for the zero eigenvalue. Its characteristic polynomial iswith sum of principal minors of order twoThe other eigenvalues are $(-S\pm \sqrt{S^2-4T})/2$. No symmetry is required for this formula; positive diagonal symmetrization of a matrix is a sufficient condition for real roots.

For a real symmetric matrix $A$ and nonzero real vector $x$, the quotient rule and the quadratic form gradient give the displayed gradient. It vanishes exactly when $Ax=R_A(x)x$, so the stationary points are eigenvectors. Equivalently, the Lagrange multiplier condition for optimizing $x^{T}Ax$ on the unit sphere is $Ax=\lambda x$. The smallest and largest eigenvalues give the global extrema; other eigenvectors can be stationary without being extrema, as a direction mixing larger and smaller eigenvalues changes the quotient in opposite ways.

For a smoothed image signal $u_{\sigma }$, average the gradient outer product as $J_{\rho }=G_{\rho }\ast (\nabla u_{\sigma }\nabla u_{\sigma }^T)$. The dominant eigenvector estimates the normal to a coherent image edge, and eigenvalue contrast measures local directional structure. Two distinct scales separate differentiation from orientation averaging.

A local subdivision matrix maps the control points in a refinement-invariant neighborhood to the refined neighborhood. Row sums one express constant reproduction. Its constant eigenvector has eigenvalue one; remaining eigenvalues govern decay of shape modes. Near an extraordinary subdivision vertex, tangent modes and a characteristic map of a subdivision surface are needed to test geometric smoothness, beyond simple convergence.

For $0\le A<I$ and normalized $|b⟩={\sum }_j{\beta }_j|u_j⟩$, filtering by $h(\lambda )=\lambda$ succeeds withThe inequality follows by replacing each nonnegative ${\lambda }_j^2$ by its minimum and using ${\sum }_j|{\beta }_j{|}^2=1$. Equality holds exactly when all occupied eigenvectors belong to the minimum-eigenvalue eigenspace. If ${\lambda }_{\min }=0$, success is positive exactly for inputs outside the kernel of $A$.

The support of a positive operator is the orthogonal complement of its kernel. In finite dimension it is the span of eigenvectors with positive eigenvalues, equivalently the operator's image. Quantum relative entropy is finite only when the first state's support lies in the reference state's support.

A real orthogonal matrix $T$ of size three with $\det T=-1$ has an eigenvector $n$ of eigenvalue $-1$. Its orthogonal complement is invariant, and the restriction there is an orientation-preserving plane rotation. Thus $T$ is a rotation about the axis $\mathbb{R}n$ composed with a reflection across the plane perpendicular to $n$. Writing the plane angle as $\varphi$, $\mathrm{tr}T=-1+2\cos \varphi$. A pure plane reflection is the case $\varphi =0$; if $\det (T-I)\ne 0$, it cannot be a pure plane reflection.

For a nearest-neighbour classical chain with finitely many spin states and dimensionless bond energy $E(s,t)$, its transfer matrix is $W_{st}=e^{-E(s,t)}$. On-site energies are divided between adjacent bonds. Periodic boundary conditions give partition function $Z_N=\mathrm{tr}{W}^N$ by direct multiplication and summation over spin labels. For a strictly positive symmetric matrix, the Perron–Frobenius theorem gives ${\lim }_{N\to \infty }{N}^{-1}\log Z_N=\log {\lambda }_{\max }$. A diagonal local observable $O$ has expectation $\mathrm{tr}(O{W}^N)/Z_N$, tending to $v_{\max }^{T}O{v}_{\max }$ for a normalized dominant eigenvector.

For the Higgs doublet vacuum $(0,v{)}^T/\sqrt{2}$, the neutral gauge-boson mass matrix in $(W^3,B)$ is $(v^2/4)\left(\begin{array}{cc}{g}^2& -g{g}^{\prime }\\ -g{g}^{\prime }& g^{\prime 2}\end{array}\right)$. Its zero eigenvector is proportional to $(g^{\prime },g)$, the photon; the perpendicular vector is the Z boson. The charged fields $W^{\pm }=(W^1\mp i{W}^2)/\sqrt{2}$ have the stated W boson mass. Thus $m_W=m_Z\cos {\theta }_W$, where ${\theta }_W$ is the Weinberg angle. The unbroken charge generator annihilates the vacuum and explains the zero eigenvalue.

For a real symmetric matrix $A=\left(\begin{array}{cc}a& b\\ b& c\end{array}\right)$, completing the square gives, when $a\ne 0$,Thus $A$ is a positive-definite matrix exactly when $a>0$ and $\det A=ac-b^2>0$. For necessity, test $(1,0)$ first, then $(-b/a,1)$; for sufficiency, the displayed two positive squares give the result. These are the first two leading principal minors in Sylvester's criterion. A positive determinant alone is insufficient: $-I_2$ has determinant $1$ but is a negative-definite matrix.

The eigenvalues provide an equivalent test under the same real-symmetric hypothesis:The spectral theorem for real symmetric matrices supplies coordinates in an orthonormal basis in which $q={\lambda }_{+}{u}^2+{\lambda }_{-}{v}^2$. More generally, a complex Hermitian matrix has an orthonormal eigenbasis and $q(z)={\sum }_j{\lambda }_j|w_j{|}^2$, so it is a Hermitian positive-definite matrix exactly when every eigenvalue is positive. This is a short proof outline: test the eigenvectors for necessity, and sum the positive squared absolute values for sufficiency.^[ref]

For a real positive semidefinite matrix, the condition is instead $q(x,y)\ge 0$ for all vectors, equivalent here to $a\ge 0$, $c\ge 0$, and $ac-b^2\ge 0$. If $a>0$, the same completing the square proves this; if $a=0$, nonnegativity forces $b=0$ and leaves $c{y}^2$ with $c\ge 0$. Merely replacing the strict inequalities on the leading principal minors by nonstrict ones fails: $\mathrm{diag}(0,-1)$ has both leading principal minors zero yet gives $q(0,1)=-1$. An indefinite quadratic form takes both positive and negative values; its real symmetric matrix has eigenvalues of both signs.

Over an algebraically closed field, a finite-dimensional Lie algebra is nilpotent exactly when every two-dimensional Lie subalgebra is abelian. A nonnilpotent Adjoint representation matrix has a nonzero eigenvalue $\lambda$ with eigenvector $y$, so $[x,y]=\lambda y$ generates a nonabelian two-dimensional subalgebra. Conversely a subalgebra of a nilpotent Lie algebra is nilpotent, while a nonabelian two-dimensional algebra has a basis $u,v$ with $[u,v]=v$ and a nonnilpotent adjoint matrix. Algebraic closure is what guarantees the required eigenvector.

For $L=\left(\begin{array}{cc}{\lambda }_1& 0\\ 1& {\lambda }_2\end{array}\right)$ with distinct real negative eigenvalues, the matrix exponential is $A=\left(\begin{array}{cc}a& 0\\ b& d\end{array}\right)$, where $a=e^{{\lambda }_{1}t}$, $d=e^{{\lambda }_{2}t}$ and $b=(a-d)/({\lambda }_1-{\lambda }_2)$. The optimal energy amplification of a linear system isIts eigenvectors are nonorthogonal, and immediate energy growth occurs exactly when ${\lambda }_1{\lambda }_2<1/4$. If ${\lambda }_2>{\lambda }_1$, putting $\alpha =({\lambda }_2-{\lambda }_1{)}^{-1}$ gives $G(t)\sim (1+{\alpha }^2)e^{2{\lambda }_{2}t}$. The optimal asymptotic initial direction $(\alpha ,1)$ is an adjoint eigenvector, while the eventual state aligns with the right eigenvector $(0,1)$.

For fixed positive ridge regression penalty, choose a unit eigenvector $v$ of $X^{\mathsf{T}}X$ with eigenvalue $d>0$, and signal ${\beta }^0=Bv$. The directional ridge risk is $({\lambda }^2{B}^2+{\sigma }^{2}d)/(d+\lambda {)}^2$, whereas ordinary least squares has risk ${\sigma }^2/d$. Letting $|B|$ grow makes the ridge squared bias arbitrarily large.

Let $A$ be a real positive-definite matrix and minimize the displayed quadratic function over all of ${\mathbb{R}}^n$. Its gradient is $Ax-b$, so its only stationary point solves the linear system $A{x}_{\ast }=b$. The matrix is an invertible matrix, making this solution exist and be unique. Completing the square around that solution proves the stronger global statement:The quadratic function is strictly convex, and its level sets above the minimum are translated ellipsoids. Positivity therefore turns solving a linear system into locating the bottom of a bowl.^[ref]

For the opening matrix $A=\left(\begin{array}{cc}3& 1\\ 1& 3\end{array}\right)$, take $b=(1,1{)}^T$ and $c=0$. Then $A^{-1}=\frac{1}{8}\left(\begin{array}{cc}3& -1\\ -1& 3\end{array}\right)$, $x_{\ast }=(1/4,1/4{)}^T$, and $f(x_{\ast })=-1/4$. Every displacement $h$ raises the value by $\frac{1}{2}{h}^{T}Ah$; along the unit eigenvectors $e_{+}$ and $e_{-}$ the increases are respectively $2s^2$ and $s^2$ for displacement $s{e}_{+}$ or $s{e}_{-}$.

For a singular positive semidefinite matrix, a solution of $Ax=b$ is still a global minimizer, but adding any kernel vector gives another. If $b$ is outside the image of a linear map defined by $A$, some kernel vector $v$ has $b^{T}v\ne 0$, and $f(sv)=c-s{b}^{T}v$ is unbounded below. For an indefinite quadratic form, a negative eigenvalue gives a direction along which the quadratic term tends to $-\infty$ regardless of $b$. Thus a stationary point alone does not establish a minimum. The same energy-difference identity extends to the quadratic variational principle for a symmetric positive operator, with additional existence hypotheses in infinite dimension.

At a hyperbolic equilibrium, the unstable manifold is formed by nearby trajectories approaching that equilibrium as time tends to minus infinity. It is tangent to the span of eigenvectors whose eigenvalues have positive real part. Its dimension counts departing amplitudes; translation along an autonomous trajectory can remove one parameter when comparing orbit shapes. The stable manifold instead approaches the equilibrium forward in time.

In an eigenbasis of $G=X^{T}X$, ridge regression divides the corresponding component of $X^{T}Y$ by $\gamma +\lambda$. If $\gamma =0$, its eigenvector $v$ satisfies $Xv=0$, and hence $v^T{X}^{T}Y=0$ exactly. Only positive eigenvalues contribute to the limit, giving the Moore-Penrose inverse expression for the minimum-norm least-squares solution. No full-rank or sample-size assumption is needed.

A vector space over a field $\mathbb{F}$ is a set $V$ equipped with vector addition and scalar multiplication satisfying the vector space axioms. Its vectors can represent directed displacements, lists of measurements, polynomials, or entire functions. The common structure is that adding two elements and multiplying an element by a scalar remain meaningful operations inside the same space.

For example, ${\mathbb{R}}^2$ uses coordinatewise addition and scaling. Withwe have $v=2b_1+b_2$. Moving twice along $b_1$ and once along $b_2$ reaches the same vector as five horizontal and four vertical steps. The two descriptions refer to different bases of the same space. A basis makes such descriptions unique; a spanning set makes them possible.

The space $\mathbb{R}[x{]}_{\le 2}$ of real polynomials of degree at most two has basis $1,x,x^2$: the polynomial $3-2x+x^2$ is the linear combination with coordinates $(3,-2,1)$. The zero vector here is the zero polynomial, and addition combines coefficients. A derivative is a linear map on this space; its matrix records how it acts on the three basis vectors. The same coordinate machinery therefore handles both geometric motion and operations on functions.

The choice of field matters. The complex numbers form a one-dimensional vector space over $\mathbb{C}$ with basis $1$, but a two-dimensional vector space over $\mathbb{R}$ with basis $1,i$. The question "how many independent directions?" has an answer only after the allowed scalars are specified. Likewise, polynomials of degree exactly two do not form a vector space: subtraction can remove the leading term, and the zero polynomial is absent.

The usefulness of the abstraction is that a linear map is determined by its values on a basis. Once those images are known, linear combinations give its action on every vector. The rank-nullity theorem relates the number of attainable outputs to the number of invisible input directions, while change of basis lets us choose coordinates suited to the problem. Eigenvectors, for example, choose directions on which repeated application of a linear operator becomes scalar multiplication.

A historical source is Hermann Grassmann's Die lineale Ausdehnungslehre (1844). Its full title advertises applications to other branches of mathematics, statics, mechanics, magnetism and crystallography; the original edition is digitized by ETH-Bibliothek. This gives an early setting for treating geometric quantities algebraically across different applications, rather than attributing the modern axiom list to that title alone.^[ref]