The dual space here is the algebraic dual space , consisting of every linear functional; no topology or boundedness is imposed. For a basis , define . These are linear functionals satisfying . Evaluating on each gives , proving linear independence. Conversely, for every ,
This proves spanning and hence proves, without assuming a dimension theorem, that the dual basis is a basis and .
The canonical bidual evaluation map is
Its definition makes no choice of basis and it is linear. If , one coordinate functional is nonzero on , so is injective. For any , choose . Expanding in the dual basis gives , proving surjection explicitly. Thus is an isomorphism.
If is any basis of , its dual basis in exists by the result just proved. Put . These vectors form a basis of , and . Every basis of the finite-dimensional dual is a dual basis, of a uniquely determined basis of .
For a separating subspace of an algebraic dual , choose a basis of . The linear map is injective because separates nonzero vectors. The rank-nullity theorem implies ; but implies . Hence
The zero-dimensional case also has this conclusion.
For , the monomials form an infinite basis, each polynomial using only finitely many of them. The map identifies with all real sequences, because any sequence defines . The linear subspace of finitely supported sequences is proper (it excludes ) and separating (one coefficient functional detects any nonzero polynomial). Thus
Using the usual zero-boundary Sobolev space convention,
where weak derivatives define and is the space of test functions. In the Gaussian free field convention, the same notation often denotes the Dirichlet energy space, the completion in the gradient norm alone. On bounded domains the Poincare inequality makes the two definitions equivalent; on unbounded domains one must distinguish them. The following gradient-pairing argument applies in either setting whenever the energy completion is realized as weak functions.
Identify with a vector subspace of by zero extension of H01. Approximating by test functions in shows that this is an isometric embedding in the inhomogeneous Sobolev norm and also in the Dirichlet inner product norm. In particular, arbitrary irregularity of causes no additional boundary term.
Define
These are weakly harmonic Sobolev functions. For , integration by parts in the weak sense gives . If , choose converging to in , or in energy for the homogeneous convention. The Cauchy-Schwarz inequality gives
Hence the orthogonality of supported and harmonic Dirichlet functions is
Both are linear vector subspaces. In the inhomogeneous convention they are closed: the first is the isometric image of a complete space, and the second is the intersection of the kernels of the linear functionals . No spanning assertion is needed. The PDF contains this orthogonality statement; the TeX has badly corrupted it into an assertion about openness.
For multi-indices , define
These seminorms define the Fréchet space topology of the Schwartz space: exactly when every tends to zero. An equivalent increasing family is
A tempered distribution is a continuous linear functional on this space. Equivalently, for some . The usual weak convergence of tempered distributions means for every fixed Schwartz function. The strong dual topology instead requires uniform convergence on every subset of the Schwartz space that is a bounded set in a topological vector space; the Fourier maps below are continuous in both topologies.
Using , differentiation under the integral and integration by parts give
The omitted coefficient has modulus one. By the Leibniz rule, every integrand is a finite sum of a polynomial times a derivative of . Inserting the integrable weight bounds its L1 norm by finitely many Schwartz space seminorms. In particular . Thus the Fourier transform maps continuously into itself.
For completeness, the Fourier inversion theorem follows here by Gaussian regularization. The inverse transform of is . The Fourier transform of a Gaussian and Fubini's theorem show
As , the right side tends to by the approximate identity property, while the left side tends to the undamped inverse integral by dominated convergence theorem, since . Hence
The inverse is times reflection composed with the continuous Fourier transform, and is therefore continuous on the Schwartz space. This proves a continuous linear isomorphism with continuous inverse.
Define the Fourier transform of a tempered distribution by
The continuous map on Schwartz space makes this a tempered distribution; the transpose of supplies its inverse. Pointwise convergence of pairings proves weak continuity. For the strong dual topology, the transform of a bounded set of Schwartz functions is bounded, so uniform convergence of pairings on bounded sets proves continuity of both Fourier maps there too.
Now let be a rotation matrix in the special orthogonal group and write . A change of variables with unit Jacobian gives
The rotation equivariance of the Fourier transform on tempered distributions follows by duality:
Therefore . Applying this identity and the inverse Fourier transform gives the two directions:
This is precisely preservation of radial tempered distributions. For , acts transitively on spheres, so an invariant smooth function is an ordinary radial function.
Use the real Hilbert space , the zero-boundary Sobolev space, with norm . The Poincare inequality makes this equivalent to its usual Sobolev space norm. Define the symmetric bilinear form and continuous linear functional
The Cauchy-Schwarz inequality and the sharp interval Poincare inequality imply
Thus is a bounded bilinear form and a coercive bilinear form, and is bounded because is square-integrable. The Lax-Milgram theorem supplies a unique weak solution:
This is obtained from the differential equation by integration by parts; the test functions have zero boundary trace. Conversely, the weak solution satisfies in the sense of distributions. Since , it belongs to and solves the equation almost everywhere.
Equivalently, the Ritz method minimizes
over . Indeed , since the mixed term is . This proves existence and uniqueness of the minimizer directly from the weak solution, as well as its equivalence to the variational problem.
The continuous dual space consists of all bounded real linear functionals on , with operator norm . Let be Cauchy in this norm. For each , , so converges in ; define its limit to be .
Pointwise limits of the linear identities show that is linear. The sequence of norms is bounded, say by , so and . Given , choose so that for all . Holding fixed and taking the pointwise limit in gives for all . Thus , proving
Completeness of is not needed; completeness of the scalar field supplies the pointwise limit.
On the one-dimensional linear subspace , define . It is linear and obeys even for negative . The norm on is a sublinear functional, so the real Hahn-Banach theorem extends to a linear functional with for every .
Apply this also to to get . Hence , proving continuity and . At the extension satisfies , forcing the reverse norm inequality. Therefore
The exclusion of is what ensures that this particular construction attains norm one.
Take , which is a Banach space by the completeness of the dual just proved. The canonical embedding into the bidual is
For fixed this is a bounded linear functional on , since , and is linear in . This gives . For , the norming functional from the Hahn-Banach theorem has and , giving the reverse inequality. At zero equality is immediate. Thus
In particular is injective and isometric. If a dense isometric embedding is wanted, rather than merely the stated embedding, take the norm closure of in ; a closed subspace of a Banach space is complete and supplies a completion of a normed space.
The dual vector space is , the vector space of all linear functionals on . For a vector subspace , its annihilator of a vector subspace is
Given a basis , define by and extend linearly. If , evaluation at gives , so the are linearly independent. Every satisfies
so they also span and therefore form its dual basis.
Write . The condition is
Gaussian elimination gives and . Hence
Use the usual connected-manifold convention for this assertion. Suppose, for contradiction, that . The Dolbeault theorem gives , and the Hodge decomposition theorem for compact Kähler manifolds and its conjugation symmetry give . Hence every real class in has a real harmonic differential form of type as its representative.
The intersection form is . Its value on the Kähler class is positive: . Every real harmonic form splits uniquely as , with primitive and constant. Indeed, is a harmonic function, hence constant by connectedness, and ; subtracting kills , and part (b) makes primitive.
Part (c) gives , while . Thus
This proves the Hodge index theorem for compact Kähler surfaces in this case: has signature .
On the alleged two-dimensional totally isotropic subspace , the linear functional has a nonzero vector in its kernel. Its harmonic differential form representative is primitive, so the preceding negative-definiteness statement gives , contradicting the vanishing of on . Therefore
Connectedness is essential if one's definition of a manifold allows disconnected spaces. For , with , one has . Take on each component the pullback of the degree-two class from its first factor. Each class has square zero, and their mutual pairing is zero because their supports lie on different components. Their span is then a two-dimensional totally isotropic subspace, disproving the unqualified disconnected version.
Rado's criterion. Let be a matrix over the rational numbers, with columns . A partition regular matrix is one for which every finite coloring of the positive integers gives a monochromatic positive vector with ; repeated coordinates are allowed. The columns condition is the existence of an ordered set partition of into nonempty blocks such that
Rado's theorem states
Necessity. Clear denominators so the columns are integer vectors. For each pair of disjoint index sets , with , for which is outside the linear span of the -columns, choose an integer linear functional that vanishes on those columns and satisfies . Such a functional exists by extending a basis of the span to one also containing , defining a functional on that basis, and clearing its rational denominators.
There are only finitely many such pairs. Choose a prime number dividing none of these nonzero integer evaluations. If there are no such pairs, any prime will do. Use the last nonzero digit coloring: write , with , and color by . Since is a partition regular matrix, this coloring supplies a monochromatic positive solution, so all its unit parts have a common nonzero residue .
Group the coordinates by increasing P-adic valuation, obtaining blocks with valuations . Suppose for some the sum lay outside the linear span of the earlier columns, with earlier index set . Apply to . Earlier terms vanish exactly. Divide the remaining integer equation by and reduce modulo . Later terms vanish modulo , while the current block gives
contrary to the choice of . Thus every block sum lies in the earlier linear span, and for the first block this means it is zero. This proves the columns condition by the finite separating-functional proof of the columns condition.
Sufficiency. Suppose the columns condition holds. For , choose rational coefficients , indexed by earlier columns, such that
Take a positive integer clearing their denominators and bounding all . We use the allowed monochromatic m-p-c set theorem with levels. Its M-p-c set is the full set
where the generators make every displayed expression positive. Positivity is part of this convention, rather than a rule that discards nonpositive expressions. For , set
All these numbers lie in the monochromatic set . The coefficient of in is
with the first coefficient zero by . Hence . This Rado solution inside an m-p-c set proves sufficiency.
The equality-or-inequality dichotomy. If every finite coloring gives a monochromatic solution with , the first alternative holds. Otherwise fix a finite coloring admitting no such solution. Given any other finite coloring , use the refinement of a finite coloring . Since is a partition regular matrix, it supplies a solution monochromatic for both colorings. Its first two coordinates cannot be equal, by the defining property of , so it is the required unequal solution for . Thus one of the two universal alternatives always holds. This is the partition regularity dichotomy under an extra constraint; the alternatives are not asserted to be mutually exclusive.
Both restrictions can fail. The Schur matrix
is a partition regular matrix: blocks and satisfy the columns condition. Color by , using the 2-adic valuation. An equal-coordinate solution would have , and , so its coordinates cannot be monochromatic. This exhibits failure of the equality restriction.
Conversely, satisfies the columns condition in one block. Every solution has , so even the constant one-color finite coloring admits no unequal-coordinate solution. Consequently
Work in the real zero-boundary Sobolev space , whose members have square-integrable weak derivatives and zero endpoint trace. Define the bounded bilinear form and linear functional
The weak formulation is to find with for every . Integration by parts recovers the differential equation for a smooth solution; conversely, this identity is the definition of its weak solution.
Use the full norm. The Cauchy-Schwarz inequality gives and . Also , so is a coercive bilinear form with constant one. The Lax-Milgram theorem states that a bounded, coercive bilinear form on a real Hilbert space determines a unique weak solution for every bounded linear functional. It therefore applies here.
The equivalent minimization problem is
If is the weak solution, symmetry and give
This is positive unless , proving a unique global minimizer. Conversely, differentiating at gives the weak identity. Thus the unique energy minimizer is exactly the unique weak solution. As a check, the classical representative is
It satisfies both endpoint conditions and .
The starting point of a conforming finite element method is a weak formulation in a Hilbert space . For example, a homogeneous Dirichlet boundary condition on a bounded Lipschitz domain gives . One seeks
where is a bounded bilinear form, , and is a bounded linear functional. A conforming finite element space is finite dimensional and is typically built from functions that are polynomial on each element of a finite element mesh. With a basis , the Galerkin method imposes the same identity only for , giving
The stiffness matrix is sparse when basis supports overlap only locally. Local element integrals assemble its entries; the mass matrix represents an term. This separates the choice of trial functions from the variational principle determining their coefficients.
The fundamental well-posedness theorem is the Lax-Milgram theorem: if for some , there is a unique solution for each , with . The same theorem on gives a unique discrete solution. The constants must be independent of the mesh for uniform stability of a numerical method. Boundary conditions are built into the trial space when they are essential constraints; flux conditions arise through boundary terms in integration by parts and are natural constraints in the weak formulation.
When is symmetric and a coercive bilinear form, the Ritz method minimizes
over . Its first variation is exactly the Galerkin method, so Ritz minimization and Galerkin testing coincide for symmetric coercive problems. The energy norm turns the approximation into an orthogonal projection. Indeed, subtracting the exact and discrete weak equations gives Galerkin orthogonality, . For every the Pythagorean identity becomes
so
This exact best-approximation property is the central advantage of the Ritz method.
Symmetry is unnecessary for the Galerkin method. For any bounded, coercive form, the Céa lemma gives
To prove it, put . Galerkin orthogonality yields , so coercivity and boundedness give . Divide when and take the infimum. Thus approximation capability plus uniform coercivity gives convergence. In contrast, minimizing for a nonsymmetric form differentiates its symmetric part and generally does not solve the original weak equation.
A concrete symmetric example is the one-dimensional reaction-diffusion problem from Question 5. Continuous piecewise-linear hat functions give the diffusion stiffness matrix with diagonal and neighbouring entries , and the mass matrix with diagonal and neighbouring entries . Therefore and . Its positive-definite matrix is the coordinate form of the continuous energy. The exact smooth solution makes this an explicit test of the method, not just an abstract existence result.
For a nonsymmetric example, take positive , constant real , and
Its form is . Since , it has coercivity constant in the full norm, although it is not symmetric when . The Galerkin method remains well posed. On the uniform hat basis, , where , and . The skew-symmetric matrix cancels from , proving nonsingularity. A Ritz energy would omit precisely this advection contribution. Small may nevertheless make the approximation constant large and produce poorly resolved layers; algebraic solvability is not an accuracy guarantee.
Quantitative convergence uses a finite element interpolation estimate. On a shape-regular mesh, for piecewise-linear conforming elements and in the usual low-dimensional setting,
The Céa lemma therefore gives an energy error. The Aubin–Nitsche duality argument improves the L2 norm error when the dual elliptic problem has regularity: solve and use
Consequently
with constants depending on the solution and regularity bounds. The second estimate is conditional on dual regularity; corners or insufficient data regularity can reduce the rate.
The same Galerkin method handles evolution equations. For the homogeneous heat equation, the semidiscrete finite element heat equation is . Because is a positive-definite matrix and is a positive semidefinite matrix,
The decreasing quadratic form is exactly the L2 norm squared of the finite-element function. This separates spatial stability of a numerical method from the subsequent time integrator, just as in the Schrodinger equation example. Conformity, coercivity and approximation estimates together explain convergence.
Let . Choose a basis of the intersection of vector subspaces, extend it to a basis of , and independently extend it to a basis of . The combined list
spans the sum of vector subspaces . It is also linearly independent: a vanishing linear combination says that a combination of the belongs to , and its expression in the chosen basis of forces all its coefficients to vanish; the coefficients of the then vanish in the same way. This proves the dimension formula for a sum of subspaces
Parametrize the two linear subspaces as
Putting a vector of in first forces its fourth coordinate to vanish; the remaining defining equation is then automatic. Thus
and the dimension formula gives .
The linear functional
vanishes on each displayed generator of and . Its kernel is three-dimensional because , so the inclusion between two three-dimensional subspaces is equality.
Write an element of the diagonal Cartan subalgebra as
and define the linear functionals . The root-space decomposition of the symplectic Lie algebra then has the C3 root system
The map
is a nonzero linear functional: otherwise would lie in the radical of a bilinear form, contradicting nondegeneracy. Its kernel is , so the rank-nullity theorem gives . Antisymmetry gives , hence .
Suppose is orthogonal to every vector of . Since , it is also orthogonal to , and therefore to
For a nondegenerate bilinear form, : both sides have dimension one and the latter is contained in the former. Thus , proving that the restriction to is nondegenerate.
The space has dimension and again carries a nondegenerate antisymmetric form. Induction, starting from the zero-dimensional space, shows that is even. Therefore is even. Equivalently, every finite-dimensional symplectic vector space has even dimension.
Linearity in follows from linearity of the weak derivative and Lebesgue integration. By the Holder inequality, the three-dimensional Sobolev inequality, and the preceding interpolation estimate,
Thus is a linear functional and a continuous linear map on .
Using multi-index notation, the Schwartz space is
A sequence converges to in this Fréchet space when for every . The space of tempered distributions is the continuous dual of , and there means weak convergence of distributions, namely for every .
Continuity of a linear functional immediately implies that entails . Conversely, enumerate the Schwartz seminorms as . If were not continuous, then for each one could choose such that
Every fixed seminorm tends to zero along this sequence, so in , contradicting the assumed sequential property. This is the sequential continuity criterion for a linear map on a metrizable topological vector space.
Since maps the Schwartz space continuously to itself, the formula
defines a continuous linear functional on , hence a tempered distribution. For a locally integrable function , the change of variables formula gives
so this dilation of a distribution agrees with ordinary function dilation.
Let be a rational matrix with columns . It is a partition regular matrix when every finite coloring of the positive integers has a monochromatic vector with . It has the columns property when the column indices have an ordered partition such that
and, for every ,
Rado's theorem states that is partition regular if and only if it has the columns property.
First suppose is partition regular, and clear its denominators. For a prime number , apply the last nonzero digit coloring in base : if with , its color is . Choose a monochromatic solution and group its coordinates into blocks of equal -adic valuation, in increasing order of valuation. Only finitely many ordered partitions are possible, so one partition occurs for infinitely many primes.
For any such prime, divide by the lowest power of and reduce modulo . All coordinates in have the same nonzero leading digit , while later blocks vanish, so
The integer vector is divisible by infinitely many primes and therefore equals zero.
Now fix , and let be the common valuation on . Reduction modulo gives
If the first sum of columns were outside the rational linear span of the earlier columns, an integer linear functional would vanish on every earlier column but not on that sum. Applying it to the congruence would say that infinitely many primes divide one fixed nonzero integer, a contradiction. Thus the displayed partition has the columns property.
Conversely, suppose has the columns property. For , choose rational numbers such that
Let equal for , equal in the earlier blocks, and equal zero in the later blocks. For , let be the indicator of . Then
for every . Choose a positive integer clearing all denominators and a positive integer with whenever is later than the block containing .
By the monochromatic m-p-c set theorem, the coloring contains a monochromatic -set with generators . Define
If , then
so every lies in that one monochromatic M-p-c set. Moreover,
Thus is partition regular, proving Rado's theorem.
For the equation , a monochromatic solution in the last nonzero base- digit coloring would, at the least -adic valuation among , force a nonempty subset sum of to vanish modulo . The seven possible sums are
None is divisible by , so base gives no monochromatic solution. The smaller primes do admit solutions: works for base , whose coloring has one color, and is monochromatic in base . Hence the smallest prime is
For , use the last nonzero base- digit itself. The nonempty subset sums of are
none zero modulo . This is the required -coloring.
For a -coloring, identify each nonzero residue modulo with , giving the five colors
If a monochromatic solution existed, reduction at the least -adic valuation would give a signed nonempty subset sum of equal to zero modulo . Singles have absolute residues ; pairs have absolute residues ; and triples have absolute residues . None is zero modulo , which proves that this -coloring works.