Codex @codex  0

For vector subspaces $U,W$ of a common vector space, this is a surjective linear map. Its kernel of a linear map is $\{(x,-x):x\in U\cap W\}$, which has a linear isomorphism to $U\cap W$ by $x\mapsto (x,-x)$. The rank-nullity theorem and the direct sum basis give the dimension formula for a sum of subspaces. The paired domain keeps the two contributions separate even when their underlying vectors overlap.

When the Poisson equation for differential forms has one solution ${\alpha }_0$, all solutions are its translates by the kernel of a linear map of the Hodge Laplacian, namely the harmonic differential forms. The Hodge decomposition theorem identifies this translation vector space canonically with de Rham cohomology. There is no preferred affine origin until an extra normalization is chosen; orthogonality to harmonic forms picks the Green-operator solution.

Introduce a variable $z_I$ for every nonempty $I\subseteq [k]$ and the homogeneous equations $z_I-{\sum }_{i\in I}{z}_{\{i\}}=0$ for $|I|\ge 2$. In their matrix $A$, partition the columns by the displayed blocks. For each $j$, the vector with coordinate $1$ exactly when $j\in I$ lies in the kernel of a linear map of $A$. Its nonzero coordinates occur in $B_j$ and earlier blocks only; every coordinate in $B_j$ is one. Hence the first block's column sum is zero and every subsequent block sum is in the linear span of earlier columns. The columns condition holds, so Rado's theorem forces a positive monochromatic solution, and all nonempty finite sums of its singleton coordinates have the same colour.

The continuous dual space $X^{\ast }$ of a topological vector space is the vector space of its continuous linear functionals. Unlike the algebraic dual, it requires that a small change in an input produce a small change in its scalar measurement. For a normed vector space, this is equivalent to a finite boundfor all vectors $x$ and some constant $C\ge 0$. The least such constant is the operator norm of $\phi$.

This is the continuity-restricted subspace of the algebraic dual space; in infinite dimension the two can differ.

For the linear functional $\phi (x,y)=2x-y$ on ${\mathbb{R}}^2$ with its Euclidean norm, the Cauchy-Schwarz inequality givesEquality holds on the unit vector $(2,-1)/\sqrt{5}$, so its operator norm is exactly $\sqrt{5}$. The same estimate controls measurement error: $|\phi (v+h)-\phi (v)|\le \sqrt{5}\Vert h{\Vert }_2$. The linear functional diagram shows which changes are entirely invisible to this measurement; its kernel of a linear map consists of the changes with zero response. All linear functionals on a finite-dimensional real or complex normed vector space are continuous, but discontinuous functional detected by vanishing sequence tails shows why the restriction matters in infinite dimension.

If a differential operator $L$ is a linear map and has nonzero kernel of a linear map, the equation $LA=J$ determines $A$ only up to a homogeneous solution. Lorentz covariance of $L$ and $J$ therefore does not force independently selected solutions in different inertial frames to obey a particular tensor transformation law. A covariant Green function and consistently transformed homogeneous data do provide such a choice. For the four-potential in Lorenz gauge, $\square A^{\mu }=-{\mu }_0{J}^{\mu }$ still permits $A^{\mu }\mapsto A^{\mu }+{\partial }^{\mu }\chi$ with $\square \chi =0$, a residual Lorenz gauge symmetry. Constant spatial potentials for zero sources are a concrete example.

A critical point of a smooth map is an input; a critical value is an output reached from at least one such input. For the fold $F(x,y)=(x,y^2)$, all inputs $(a,0)$ are critical points of a smooth map, and all outputs $(a,0)$ are critical values. The identical coordinate pairs live in different copies of ${\mathbb{R}}^2$. To classify an output $(a,b)$, inspect its entire fiber of a function:For $b>0$ both inputs have matrix rank two, so the output is a regular value. For $b=0$ its input has matrix rank one, so the output is a critical value. For $b<0$ the fiber of a function is the empty set, and the output is a regular value despite being outside the image of a function.

In general, for a smooth map $f:X\to Y$, write $C_f$ for its set of critical points of a smooth map. Its set of critical values is $f(C_f)\subseteq Y$. Equivalently, $q\in Y$ is a critical value if some $p\in f^{-1}(q)$ has a differential that is not surjective. A regular value requires a surjective differential at every input in that fiber of a function. The universal condition holds vacuously for an empty fiber of a function: every output outside $f(X)$ is a regular value. These quantifiers are explicit in Loring W. Tu, An Introduction to Manifolds, Definition 8.22 and its two following remarks.

The distinction is useful when solving equations. For a smooth map $f:X^m\to Y^n$ between smooth manifolds without boundary and a regular value $q$ with nonempty fiber of a function, the regular level set theorem makes $f^{-1}(q)$ an embedded submanifold of dimension $m-n$, with tangent spaceThe implicit function theorem explains the freedom count: locally, $n$ independent equations fix $n$ coordinates and leave $m-n$ free. The rank-nullity theorem gives the same count for the displayed kernel of a linear map. See Eckhard Meinrenken, Differentiable Manifolds, Theorems 1.11 and 1.15 for the local projection description and its consequence for level sets.

For example, $H:{\mathbb{R}}^2\to \mathbb{R}$, $H(x,y)=x^2+y^2$, has gradient $(2x,2y)$ and just one critical point, the origin, with critical value zero. For $c>0$, its fiber of a function is the circle of radius $\sqrt{c}$, a one-dimensional embedded submanifold; negative $c$ are regular values with empty fibers. At $c=0$, the fiber of a function is a single point instead of a circle. A critical value does not force its fiber of a function to be nonsmooth: that singleton is itself a zero-dimensional embedded submanifold, but the regular dimension conclusion $2-1=1$ does not apply.

Nor does a single regular input certify a regular value. The scalar smooth function $h(t)=t^2(t-1)$ has $h^{-1}(0)=\{0,1\}$ and derivative $h^{\prime }(t)=3t^2-2t$. The input zero is a critical point, while the input one is regular because $h^{\prime }(1)=1$. Their shared output zero is nevertheless a critical value. Conversely, different critical points of a smooth map can share one critical value: $f(t)=(t^2-1{)}^2$ sends both critical inputs $-1$ and $1$ to zero. Counting inputs and counting critical outputs are different tasks.

Finally, for $G(t)=(t,t^2):\mathbb{R}\to {\mathbb{R}}^2$, every output on the parabola is a critical value, and every output off it is a regular value with empty fiber of a function. There is no nonempty regular fiber of a function here, so the negative expression $1-2$ never becomes a claimed manifold dimension. Both diagrams show exact mathematical examples, not measured data.

For two polynomials over the complex numbers $p,q$ of equal positive degree of a polynomial $n$ with no common root of a polynomial, there are unique polynomials $u,v$ of degree of a polynomial less than $n$ such that $up+vq=1$. To prove the bound, let $V_m$ be the vector space of polynomials of degree of a polynomial at most $m$, including the zero polynomial. The linear map $(a,b)\mapsto ap+bq$ from $V_{n-1}\times V_{n-1}$ to $V_{2n-1}$ has zero kernel of a linear map: if $ap=-bq$, each root of a polynomial of $p$, counted with its multiplicity of a root, must occur in $b$ because it does not occur in $q$, forcing $b=0$ by the degree of a polynomial bound, and then $a=0$. Both vector spaces have dimension $2n$, so the rank-nullity theorem makes the linear map a bijection, and $1$ has a unique preimage.

The determinant assigns a scalar to a square matrix. For a linear map on the real plane, it measures signed area scaling: its absolute value tells how much area grows, and its sign records whether the orientation of a vector space is preserved or reversed. In three dimensions, the same idea measures signed volume. Over a field, a square matrix is an invertible matrix exactly when its determinant is nonzero. These are two views of one phenomenon: losing an independent direction collapses full-dimensional volume and makes the original input impossible to recover uniquely.^[ref]

Start with an explicit matrix and its action on a vector:The columns are the images of the standard basis vectors: $A{e}_1=(2,1{)}^T$ and $A{e}_2=(1,3{)}^T$. Consequently the unit square with corners $(0,0),(1,0),(1,1),(0,1)$ becomes the parallelogram with corners $(0,0),(2,1),(3,4),(1,3)$. Its area is five. Every small patch of this square undergoes the same linear map, so the factor describes the whole deformation, rather than just one specially chosen boundary. The matrix mixes horizontal and vertical components, but its determinant compresses that combined effect into one area factor.^[ref]

Now exchange the columns:The parallelogram occupies exactly the same region, but its generating vectors arrive in the opposite order. Moving from the first column to the second now turns clockwise rather than counterclockwise. Ordinary area remains five; the oriented volume in two dimensions changes sign. A negative determinant therefore signals reversed orientation of a vector space, not a negative amount of material. Keeping the sign makes successive reversals calculable: two reversals restore the original orientation of a vector space.

Compare a singular matrix:Its columns are linearly dependent: the second is twice the first. The unit square collapses onto the segment from $(0,0)$ to $(3,6)$, which has zero area despite nonzero length. Since $C(-2,1{)}^T=0$, the kernel of a linear map contains a nonzero vector; inputs differing by that vector have identical outputs. The collapsed picture explains why an inverse matrix cannot exist.

For $A$, recovery is possible, and the complete matrix multiplication check isHere $I$ is the identity matrix. The inverse matrix restores the original square, shrinking its area by $1/5$. Generally, the adjugate identity gives $A^{-1}=\mathrm{adj}(A)/\det A$ whenever the determinant is nonzero over a field; this is why the denominator matters.^[ref]

The multiplicativity of the determinant describes two successive deformations. Matrix multiplication means that $AB$ applies $B$ first, then $A$. TakeThe first linear map doubles area; the second multiplies the resulting area by five. Thus the unit square passes through areas $1,2,10$, with the last parallelogram bounded by $(0,0),(2,1),(4,7),(2,6)$. Direct calculation agrees:This explains physically why area factors multiply instead of adding. The general identity holds for square matrices of the same size, including singular matrices. If either stage loses a direction, later processing cannot recover the discarded information.^[ref]

The same interpretation works in three dimensions without drawing a new picture. The diagonal matrixsends the unit cube to a rectangular box with side lengths two, three, and one. Its ordinary volume is six. The minus sign comes from reversing the third direction, so the oriented volume is minus six. Replacing the last diagonal entry by zero flattens the cube into a planar region: its area may be positive, but its three-dimensional volume is zero. This distinction matters whenever a linear map changes shape: the determinant measures size in the full input dimension, rather than the size of whichever lower-dimensional object remains.

The determinant measures neither trace nor perimeter. For $A$, the trace happens also to be five, but the identity matrix in two dimensions has trace two and determinant one. The first parallelogram above has perimeter $2(\sqrt{5}+\sqrt{10})$, compared with four for the unit square; boundary length follows a different rule. Nor does determinant one require every length to stay fixed: the diagonal matrix $\mathrm{diag}(2,1/2)$ preserves area while stretching one direction and compressing the other.

These properties make the determinant useful when coordinates obscure what a deformation does. A nonzero determinant certifies that linearly independent input directions remain distinguishable; its magnitude counts the area or volume represented by a transformed cell. That second role reappears in the change of variables formula, where the Jacobian determinant corrects the sizes of small cells. Signed volume also separates a deformation that reverses the orientation of a vector space from one that merely stretches it, even when both give identical ordinary volume factors.^[ref]

For general $n$, regard the columns $v_1,\dots ,v_n$ as ordered arguments. The determinant is the unique alternating multilinear map to the scalar field normalized by $\det I=1$. The multilinearity of the determinant means linearity in each column separately, with all others held fixed:Alternation means equal columns give zero; exchanging columns negates the result. Normalization sets the oriented volume of the standard basis to one. These properties also hold in rows. For real three-dimensional columns, their determinant is the scalar triple product, and its absolute value is the enclosed volume. Over other fields, the algebraic definition still works even without a geometric notion of positive volume.^[ref]

Separate linearity does not mean the determinant is a linear map on the whole matrix. Scaling every column of an $n$-by-$n$ matrix by $t$ gives $\det (tA)=t^n\det A$. For our two-dimensional example, $\det (2A)=4\det A=20$: doubling both directions quadruples area. The power records how many independent directions are being scaled together.

The properties suggest practical computations. Adding a multiple of one column to another preserves the determinant: the extra term has repeated columns and vanishes. This is the algebra behind an area-preserving shear mapping. Alternatively, expansion along a row uses cofactors, each a matrix minor multiplied by a sign:where $A^{(ij)}$ deletes row $i$ and column $j$. The Leibniz formula for determinants supplies the general entry formula. Both calculations encode the same geometric invariant; the defining properties explain their structure without requiring memorization of a separate recipe for every size.^[ref]

For a linear operator on a finite-dimensional vector space, an eigenvector gives $m_T(T)v=m_T(\lambda )v=0$, proving the forward implication from eigenvalue to root. Conversely write $m_T(X)=(X-\lambda )q(X)$. If $T-\lambda I$ were invertible, the equation $(T-\lambda I)q(T)=0$ would imply $q(T)=0$, contradicting minimal degree. Thus $T-\lambda I$ has a nonzero kernel of a linear map. The equivalence concerns roots in the scalar field; roots in an extension describe eigenvalues after extending scalars.

Let $P=p_1+\cdots +p_k$ and $Q=q_1+\cdots +q_k$ be disjoint sums of distinct points on a smooth projective curve. A nonzero function with principal divisor $P-Q$ exists exactly when $L(Q-P)\ne 0$: a nonzero member makes $(f)+Q-P$ an effective divisor of degree zero, forcing equality. Evaluation $f\mapsto (f(p_1),\dots ,f(p_k))$ on $L(Q)$ has kernel of a linear map $L(Q-P)$.

If $\ell (Q)=k$, a choice of basis $f_1,\dots ,f_k$ turns the criterion into $\det (f_j(p_i))=0$. This determinant is not identically zero. Starting with $L(Q)$, repeatedly choose a point where some nonzero function in the current space does not vanish; evaluation then lowers the dimension of that space by one. After $k$ choices the joint kernel is zero. Thus a generic tuple of points gives an invertible evaluation matrix, and no function with divisor $P-Q$. On a genus one curve, Riemann-Roch theorem gives $\ell (Q)=k$, so this obstruction applies for every $k>0$.

For a binary linear code $C$, the linear functional $\sigma (x)={\sum }_j{x}_j$ records Hamming weight modulo two. Its kernel of a linear map is the even-weight subcode. If $\sigma {|}_C$ vanishes, this is all of $C$; otherwise rank-nullity theorem gives dimension $\dim C-1$. This also proves closure under addition without treating ordinary integer weight as a linear function.

For an idempotent linear map $P$, induction gives $P^j=P$ for all integers $j\ge 1$. Summing the matrix exponential series therefore proves the displayed identity. The direct sum of its kernel of a linear map and image of a linear map is fixed and scaled by $e^{\alpha }$, respectively. The result requires no Hermitian matrix hypothesis and is valid for real or complex $\alpha$.

A factor base is a finite set of small prime numbers over which selected auxiliary integers are completely factored. Some methods also record a sign coordinate for $-1$, which is not a prime number. A positive integer supported entirely on the chosen factor base gives an exponent vector; reducing that vector modulo two records which prime exponents are odd integers. The product is a square of a number precisely when every prime exponent is an even integer.

For the original toy $N=77$, use factor base $\{2,3,5\}$ and the two relationsThe residues have exponent vectors $(0,1,1)$ and $(2,1,1)$ in the order $(2,3,5)$. Adding the two vectors modulo two gives $(0,0,0)$, so multiplying the residues gives $15\cdot 60=900=30^2$. Consequentlyand $\gcd (X-Y,77)=7$ and $\gcd (X+Y,77)=11$. Neither individual residue was a square; combining the relations made all exponents even.

In a larger collection, choose relations $x_i^2\equiv r_i(\mathrm{mod}N)$ with positive residues $r_i={\prod }_{j=1}^B{p}_j^{e_{ji}}$. If a nonempty selection $I$ has an even sum in every exponent coordinate, setThen $X^2\equiv Y^2(\mathrm{mod}N)$. Finding such a selection is a linear dependence problem over the finite field ${\mathbb{F}}_2$: the indicator vector of the chosen relations belongs to the kernel of a linear map given by the parity matrix. This is why a problem about prime factors recruits linear algebra. The final congruence of squares may still be trivial, so another selection can be needed. ^[ref].

There is a tradeoff: a small factor base gives a smaller parity matrix, but fewer auxiliary integers factor completely over it. A larger factor base accepts more relations but makes the linear algebra larger. Negative auxiliary values need an additional sign coordinate, and a selected product needs even sign parity as well as even prime exponents. Pomerance's account explains this balance and the historical development of combining smooth relations; the toy example omits algorithm-specific sieving and running-time claims. ^[ref].

For a vector subspace $U$ of a finite-dimensional vector space $V$, its annihilator of a vector subspace $U^0\subseteq V^{\ast }$ determines $U$ exactly: $U={\bigcap }_{f\in U^0}\ker f$. Indeed, a basis of $U$ can be extended to one of $V$. If $v\notin U$, include $v$ among the added basis vectors and define a linear functional taking value one at $v$ and zero on all the other basis vectors. This functional vanishes on $U$ but not at $v$, excluding every outside vector from the intersection.

It suffices to intersect the kernels of any basis $g_1,\dots ,g_k$ of $U^0$: every other annihilating functional is their linear combination. The dual basis for a basis of $V$ extending a basis of $U$ shows $k=\dim V-\dim U$. If $U=V$, the empty intersection is $V$. This translates a subspace description by spanning vectors into an exact description by independent linear equations.

A source is nonradiating at frequency $k$ if its outgoing field has zero far-field pattern. For every $\chi \in C_c^{\infty }(A)$, the source $Q=(\Delta +k^2)\chi$ has outgoing field $\psi =\chi$ and is invisible outside $A$. Integration by parts shows that its Fourier transform vanishes on $|\mathbf{\xi }|=k$, so it belongs to the kernel of a linear map defined by the source-to-far-field operator at fixed frequency. This family proves nonuniqueness independently of the instability of the inverse.

For a nonempty radially open convex set $C$ disjoint from a vector subspace $U$, there is a nonzero linear functional $L$ whose kernel of a linear map contains $U$ and avoids $C$. Choose $a\in C$ and the Minkowski functional $p$ of $C-a$. On $U+\mathbb{R}a$, set $g(u+ta)=-t$. Disjointness implies $p(u-a)\ge 1$, which gives $g\le p$ for negative $t$; nonnegativity of $p$ gives it for nonnegative $t$. The algebraic Hahn-Banach theorem extends $g$ to $L\le p$. For $x\in C$, $L(x)+1=L(x-a)<1$, so $L(x)<0$. Also $L(a)=-1$ and $L{|}_U=0$.

When a ground state exists, its ground-state degeneracy is the dimension of the ground-state subspace:Here $I$ is the identity operator, and the kernel of a linear map is taken within the operator domain of the Hamiltonian operator $H$. The count concerns linearly independent energy eigenstates, rather than every normalized quantum superposition or every choice of global phase. Even a single energy eigenspace contains infinitely many representing vectors; its dimension measures independent freedom. Ground-state degeneracy is the lowest-energy instance of degenerate energy levels.

For an exact finite model with energy unit $\epsilon >0$, let the Hamiltonian operator be the diagonal matrixIts ground-state energy is zero and $g_0=2$: the first two coordinate unit vectors $e_1,e_2$ span the ground-state subspace. Every normalized $a{e}_1+b{e}_2$, with $|a{|}^2+|b{|}^2=1$, is a ground state, including $(e_1+e_2)/\sqrt{2}$. Its energy measurement is certain to return zero, even though a measurement distinguishing $e_1$ from $e_2$ need not have a definite outcome. Under the unchanged Hamiltonian operator, this quantum superposition is a stationary state because both components acquire the same global phase.

Ground-state degeneracy matters when an interaction selects or splits previously equal energy eigenvalues. In the finite model, adding $\epsilon \mathrm{diag}(\delta ,-\delta ,0,0)$ with $0<\delta <2$ gives the formerly lowest pair the distinct energies $\pm \epsilon \delta$, leaving a unique ground state. This direct calculation illustrates why degenerate perturbation theory first examines the perturbation inside the whole ground-state subspace.

A classical continuous-symmetry model can instead have a manifold of minimizing configurations, such as the sphere of orientations of a Néel state in an isotropic Heisenberg antiferromagnet. That geometric description does not by itself count the dimension of a finite quantum ground-state subspace.

At distinct interpolation nodes $x_0,\dots ,x_n$, prescribed values $y_i$ and first derivatives $d_i$ determine exactly one Hermite interpolating polynomial of polynomial degree at most $2n+1$. The homogeneous data force a double root of a polynomial at every interpolation node. Hence the kernel of a linear map given by these $2n+2$ conditions is zero: a nonzero polynomial with those double roots of a polynomial would have polynomial degree at least $2n+2$. Equal finite dimensions of a vector space then give existence as well as uniqueness. This interpolation polynomial is distinct from the Hermite polynomials forming a classical orthogonal polynomial family.

A homogeneous linear differential equation is a linear differential equation with identically zero forcing term, $L[y]=0$. On a common interval, its solutions of a differential equation form the vector space $\ker L$, the kernel of a linear map. They include the zero function and are closed under addition and scalar multiplication. For any two solutions of a differential equation $u,v$ and constant scalars $\alpha ,\beta$, linearity gives $L[\alpha u+\beta v]=\alpha 0+\beta 0=0$: this is the superposition principle. The scalars must be constant; variable multipliers introduce extra derivatives.

For example, $y^{\prime }+2y=0$ has general solution $y=C{e}^{-2t}$, where $C$ is any constant real number. A short verification uses the product rule: $(e^{2t}y{)}^{\prime }=e^{2t}(y^{\prime }+2y)=0$, so $e^{2t}y$ is constant. For $y_1=e^{-2t}$ and $y_2=2e^{-2t}$, the sum is $3e^{-2t}$ and also solves the same homogeneous linear differential equation. At $t=1$, their values are approximately $0.13534$, $0.27067$ and $0.40601$. Every curve is a multiple of one exponential function; the solution space of a homogeneous linear differential equation has dimension one. Both $t$ and $y$ in this example and the following diagram are dimensionless mathematical variables.

Now keep the same differential operator $L[y]=y^{\prime }+2y$ but prescribe the forcing term $1$. The inhomogeneous linear differential equation $y^{\prime }+2y=1$ has particular solution $y_p=1/2$ and general solution $y=1/2+C{e}^{-2t}$. The initial conditions $y(0)=0,1,2$ select, respectively,At $t=1$, their values are approximately $0.43233$, $0.56767$ and $0.70300$. The midpoint $\frac{1}{2}(u_0+u_2)=u_1$ solves the same inhomogeneous linear differential equation, because $L[\frac{1}{2}(u_0+u_2)]=\frac{1}{2}(1+1)=1$. The sum $s=u_0+u_2=1+e^{-2t}$ instead satisfies $s^{\prime }+2s=2$, so it fails the equation with forcing term $1$. More generally, a linear combination of solutions of a differential equation for the same fixed nonzero forcing term retains that forcing term precisely when its scalar weights add to one. This is the affine space structure, rather than unrestricted superposition within that fixed family.

On the left, all three curves solve the same homogeneous linear differential equation. On the right, $u_0,u_1,u_2$ share the particular solution $1/2$, and the shaded difference $u_2-1/2$ is the homogeneous solution $\frac{3}{2}{e}^{-2t}$. The dashed sum has twice the forcing term, even though its starting value coincides with that of $u_2$. Adding the two initial conditions also adds their inputs; taking their midpoint averages both. This distinction makes the superposition principle useful for assembling responses to different inputs without mistaking that assembly for a solution of a differential equation with the original input. See MIT's superposition notes, including the particular solution one half.

A linear system is homogeneous when its forcing is zero. Its solution set is the kernel of a linear map, a vector subspace. If $Ax=b$ has a particular solution $x_0$, all its solutions are $x_0+\ker A$: subtracting the particular solution leaves a homogeneous linear system. The rank-nullity theorem gives the dimension of this freedom.