No: pointwise convergence need not be uniform convergence. The continuous function maps into itself and is strictly below the identity. Its iteration of a map gives
For every finite , these values tend to as , so . With , choosing gives . Thus no single iterate works for every starting point, although each fixed starting point tends to zero.
For uniform convergence to on , for every there is such that for all and all . The bound proves uniform convergence to zero, whereas its derivative is . On an interval containing zero these derivatives diverge at zero, so they cannot converge uniformly. This supplies a counterexample to differentiating a uniformly convergent sequence without additional hypotheses.
For uniform derivative convergence with an anchored value, put and . A uniform limit of continuous functions is continuous. The fundamental theorem of calculus gives
Thus , with error bounded by
This is uniform on bounded subintervals, and on all of if it is bounded. The fundamental theorem of calculus now gives , so is continuously differentiable. For an unbounded , no global uniform convergence of follows merely from the displayed hypotheses, but local uniform convergence and the claimed differentiability do.
For the series, use partial sums and differentiate their individual terms:
For , their absolute values are at most , a summable bound. The Weierstrass M-test makes the derivative series uniformly convergent, while every partial sum is zero at . The anchored-value result therefore proves continuous differentiability on , with derivative equal to the displayed termwise derivative series.
The contraction mapping theorem states that a map of a nonempty complete metric space into itself, satisfying for some , has a unique fixed point. Iteration from any point converges to it; for example .
Assume is nonempty. Its boundedness makes finite. Symmetry, positivity and separation follow pointwise from , and taking the supremum of proves the triangle inequality. Hence is a uniform metric.
If is a Cauchy sequence in this uniform metric, each converges by completeness of ; denote its limit by . Given , choose so that for . Letting gives for all , so uniformly. To prove continuity, fix and use
Choose so the outside terms are small, then use continuity of for the middle term. Thus , proving completeness of the continuous-map space in the uniform metric.
The contraction subspace is not necessarily complete. On , , , are contraction mappings and converge to the identity by uniform convergence. Their only possible uniform limit is not a contraction, so this Cauchy sequence has no limit in .
Nevertheless the fixed point assignment is continuous. Fix with contraction constant , and put , . Then
Consequently . This proves continuity of the fixed-point assignment at without requiring one contraction constant valid for every .
The space of test functions is : its elements are smooth functions with compact support. For a fixed compact set , put and use the seminorms . The space of test functions carries the usual test-function inductive limit topology of these spaces. In particular, a sequence converges precisely when its supports eventually lie in one compact set and every derivative converges uniformly. Thus means that a common contains their supports and for every .
A distribution is a continuous linear functional on this space of test functions, and denotes their space. We use complex-linear, bilinear pairings . Equivalently, for every compact set there are and a nonnegative integer such that
The usual weak convergence of distributions is if for every test function. This specifies the convergence used below; it does not require convergence in any norm.
The distributional derivative is defined by
The derivative map sends continuously to itself, with . The preceding continuity estimate therefore proves that is again a distribution. This definition extends the ordinary derivative of a smooth function, by integration by parts.
Choose the translation of a distribution convention . Its action on a test function is
For fixed , the translated test functions have translated compact support and unchanged derivative sup norms, so this defines a distribution. For the differentiability of distribution translations, apply the Taylor theorem in integral form:
All supports lie in one slightly enlarged compact set for , and the same identity for every derivative proves uniform convergence. The continuity of now gives
The minus sign in the translation parameter is necessary for this convention.
For (a), choose a test function with . If , then is a test function, since the zero integral makes it vanish beyond both ends of the compact support. If , then . Decompose to obtain
Conversely, these constant regular distributions have zero distributional derivative. This also proves the general fact that a distribution with zero derivative is constant.
For (b), choose a cutoff function equal to one near zero. Every test function decomposes as
The quotient extends as a smooth function at zero, and it has compact support. If , the definition of multiplication of a distribution by a smooth function gives . Conversely, . Thus the kernel of multiplication by a coordinate is exactly
In particular, derivatives of the Dirac delta distribution are not additional solutions: .
Now write and , where . The characteristic roots of a constant-coefficient differential equation are the distinct roots of a polynomial of , with multiplicities . The distributional regularity of a constant-coefficient ordinary differential equation can be proved without assuming regularity in advance. Put and . Since the are coprime polynomials, polynomial division and Bezout identity give polynomials such that
For example, invert modulo , sum the resulting expressions, and absorb a remaining multiple of into one coefficient. For , the kernel decomposition for coprime polynomials therefore gives
The Leibniz rule for multiplication of a distribution by a smooth function implies . Repeatedly using a distribution with zero derivative is constant shows that a distribution with th derivative zero is a polynomial of degree at most : subtract the polynomial primitive of its constant st derivative, and induct on . Consequently the most general exponential polynomial solution of a constant-coefficient differential equation is
Every displayed term is annihilated by , so all coefficients are allowed. For the linear independence of these functions, on a relation, apply ; on times a polynomial of degree less than , each remaining factor acts invertibly on that polynomial space. Hence the th polynomial must vanish. Every distributional solution is an analytic function, and in particular a classical solution. For real coefficients and real-valued distributions, take complex conjugate coefficients at conjugate characteristic roots of a constant-coefficient differential equation, or equivalently use the corresponding real sine and cosine forms.
For the last equation, the operator is : the coordinate multiplies the result of differentiation. The kernel of multiplication by a coordinate says precisely that
Choose the retarded fundamental solution of a constant-coefficient ordinary differential operator , where is the Heaviside function and is the analytic solution of with
Such exists uniquely by the elementary initial value problem for a constant-coefficient ordinary differential equation; alternatively the residue construction in the next solution gives it explicitly. The distributional jump formula for a Heaviside product is
It follows by induction from , using integration by parts. With the chosen initial derivatives, every lower-order jump term vanishes and the leading coefficient gives . Subtracting reduces the last equation to the homogeneous one. Thus the coordinate-degenerate constant-coefficient differential equation has exactly the solutions
There are independent constants. For , derivatives through order match at zero, while the derivative of order may jump; for , the function itself may jump. An arbitrary distribution concentrated at zero cannot be added, because its image under the nonzero leading derivative would contain a nonvanishing highest derivative of the Dirac delta distribution.
The original PDF has indices ; the exponent is lost in the TeX transcription. This lacunary indexing is essential to the positive lacunary Chebyshev series argument below.
Let be the least nonnegative integer with , so for . Define
For the sum is empty and means the zero polynomial. Each included Chebyshev polynomial has degree at most . Also on the interval, so summability of the positive coefficients gives uniform convergence by the Weierstrass M-test, and
Choose and the points , . For every omitted index , the integer is odd. Consequently,
Every term of the tail has the same sign at a given point, and therefore
This shows both that the error norm is exactly and that it alternates at distinct points. The points are in decreasing order; reversing their order still gives alternation. The Chebyshev alternation theorem proves that this partial sum is the unique best uniform approximation. Hence
In particular, and . The equal signs of all tail terms at the same extrema are the reason positivity and the odd integer frequency ratios are useful.
By the Weierstrass M-test, absolute summability of the Fourier coefficients makes uniformly convergent to a continuous periodic function . Termwise integration is justified by that uniform convergence, and orthogonality gives
Part (ii) then implies . Thus the Fourier series converges uniformly to the original function, not merely to some continuous limit. In particular,
For positive linear operators on continuous functions, a general Korovkin theorem, in its compact Korovkin test space form, can be stated using a test space , where is a compact Hausdorff space. Assume contains a strictly positive function . Require that, for every , the only positive linear functional on with for all is evaluation at . Then convergence on the test space implies convergence on every continuous function:
By the Riesz-Markov-Kakutani representation theorem, the functional condition equivalently says that a positive measure with these test moments must be . This permits arbitrary test families, not just the interval tests .
For completeness, let . Positivity gives , so the operator norms are uniformly bounded. If the conclusion failed for some , choose where its error is bounded away from zero. The evaluation functionals have uniformly bounded norm. Compactness of and the Banach-Alaoglu theorem give a subnet on which and converges in the weak-star topology to a positive . For every , uniform test convergence gives . The hypothesis forces , contradicting the chosen errors. Complex-valued functions follow by applying the real result to their real and imaginary parts.
A useful concrete sufficient condition is that and for each there is with and zero set exactly . Its zero moment forces the representing measure to be supported at , while the constant moment fixes its mass.
For the circle, take . The nonnegative function belongs to and vanishes only at on the circle. Thus the periodic Korovkin test set is
Uniform convergence on these three functions is sufficient for uniform convergence on .
The unknown Neumann boundary condition can be removed by the Fokas method. Evaluate the global relation for the half-line free Schrodinger equation at :
Consequently . In the representation from part (a), the last term has integral , by the Cauchy integral theorem and Jordan lemma. It is analytic in the upper half-plane, and the exponential decays on the closing first-quadrant arc. Hence an expression involving only the given data is
One may replace by in the upper limit defining : the contribution of boundary times closes to zero in , since then decays there. Using makes causality transparent.
For an explicit proof of uniform convergence, it is useful to apply boundary lifting before inversion. Set , , , and
The compatibility condition gives . The Fourier sine transform of satisfies , with initial value . The integrating factor therefore gives the equivalent representation
This last integral is absolutely and uniformly convergent for , under concrete sufficient hypotheses , decay of the boundary terms, and . Indeed, two integrations by parts give for . Another integration by parts, this time in , gives
Thus the initial term is uniformly and the forcing term uniformly . For , use and the bounded time integral. An integrable majorant proves the claimed uniform convergence and permits evaluation at both boundaries.
At , Fourier sine inversion gives . At , the integral vanishes, giving , including the compatible corner. To verify the equation, note that and the transformed equation implies
Adding the lifted part gives . Under the stated smoothness, this holds classically in the interior; differentiated spectral integrals can first be Gaussian-regularized, or read in the sine-transform sense and then identified with the smooth solution. Uniform convergence of itself does not require claiming uniform convergence of every differentiated integral at the corner.
Consider the operators on all of or , extending the displayed positive-function formula linearly. Here is the space of continuous functions vanishing at infinity. The multiplier has modulus at most one, so , and multiplication of exponentials gives and . For strong continuity on , choose a compact outside which is small. On the continuous is bounded, making uniform; outside , . For , use pointwise convergence and the dominated convergence theorem with bound . Thus both are contraction semigroups, even when is unbounded.
The generator of a multiplication semigroup is
Indeed pointwise difference quotients converge to . A norm limit therefore forces the displayed domain condition, using an almost-everywhere convergent subsequence for the case. Conversely , so the dominated convergence theorem proves the limit when . In write the error as times , with the value at supplied by continuity. That second factor tends uniformly to zero where is bounded and has modulus at most one; the compact-set and small-tail argument applied to proves uniform convergence. To prove directly that is a closed operator, take and . Pointwise limits in , or a common almost-everywhere convergent subsequence in , give . Thus is in the appropriate generator domain and . In the domain is dense because ; in compactly supported continuous functions are a dense subspace contained in the domain.
A real multiplication operator on its maximal domain is an unbounded self-adjoint operator. One direct verification is to test the adjoint relation against functions supported on . If is in the adjoint operator domain with representing vector , those tests force on each such set, hence . The converse follows by integration. On the sigma-finite measure spaces used below, the spectrum of a real multiplication operator is its essential range; spectral values are detected by unit vectors supported where the multiplier is arbitrarily close to that value, while outside the essential range its reciprocal is a bounded resolvent multiplier.
For the heat semigroup on , take the normalization . The unitary Fourier transform converts it to multiplication by , and converts the semigroup to multiplication by . Consequently
The Sobolev space domain is exactly . The continuous spectrum comes from the full essential range of , not from square-integrable Fourier eigenvectors.
For the Ornstein-Uhlenbeck semigroup on standard Gaussian measure, the normalized Probabilists' Hermite polynomials form an orthonormal basis. The construction below gives and , so the Hermite coefficient map turns it into a real multiplication operator on . Therefore
Finally, the heat semigroup on the whole real line has no positive spectral gap, whereas the standard Ornstein-Uhlenbeck semigroup has gap one. For the first claim, take a nonzero smooth compactly supported and set . Then , but . This disproves a uniform whole-line Poincare inequality ; one can also choose . Lebesgue measure here is infinite, so it has no normalized probability mean to subtract. For Gaussian measure, the Hermite expansion instead gives the sharp Gaussian Poincaré inequality
Equality holds for affine functions. The identity on the right is interpreted on the energy-form domain, which is larger than the full operator domain.
Differentiation satisfies , so its operator norm is at most . With , the ratio tends to . Hence .
Normalize , so . Their derivatives are . Distinct cosine functions are orthogonal in , and these normalizing factors stay bounded away from zero. Consequently the derivative images have pairwise distances bounded away from zero. Since uniform convergence would imply convergence, no subsequence converges uniformly. Thus is not compact.
Write . Since ,
A Schwartz function is bounded and uniformly continuous. Given a tolerance, first choose so the tail integral of is small. On , uniform continuity makes the difference uniformly small for every when is small. On the tail it is bounded by . This proves uniform convergence, without assuming , and is the approximate identity argument.
For the radial regularization of the three-dimensional fundamental solution of the Laplace equation, direct differentiation gives
The radial integral is . This even approximate identity therefore gives for .
The function is locally integrable and determines a tempered distribution. We have , and is integrable near zero and infinity for a Schwartz test function. Integration by parts and the dominated convergence theorem give
Thus , proving that is a fundamental solution of a linear differential operator. In this last part the test-function space is ; the printed in the three-dimensional integral is understood with .