Derivative seminorms on a compact interval 2026-10-14
Here means the real- or complex-valued functions continuous on , smooth on , with every interior derivative having a continuous extension to the endpoints; endpoint values of derivatives are these extensions. On this space of smooth functions on a compact interval, defineThese finite-valued seminorms increase with and separate points. In fact every is a norm, since it includes . The terminology seminorm includes norms; it does not assert that every measurement has a nontrivial kernel of a seminorm. Smooth convergence means for every fixed , equivalently uniform convergence of every derivative separately. It does not demand one tolerance or one convergence index that works for all orders simultaneously. The maximum convention is equivalent to the derivative supremum norm convention using a finite sum, since .
For a worked example, gives , , , and for . The linear functional obeys and is continuous. Similarly, differentiation is a continuous linear operator for smooth convergence, because .
The space of smooth functions on a compact interval is complete for this seminorm topology. A Cauchy sequence has uniform limits for its derivatives of each order. Passing to the limit in the fundamental theorem of calculus identitygives , so and belongs to the same space. This is the completeness of the smooth-function metric argument; the metric there and the increasing- metric above induce the same smooth topology and the same Cauchy sequences.
The first iterate isOn the prescribed box, is continuous, , and . The initial value is distance nine from the nearer horizontal edge. Thus on , the Picard map keeps functions within the box: its values differ from one by at most .
Successive differences satisfy, by induction,The Weierstrass M-test proves uniform convergence on this local interval. The uniform limit is continuous, and the Lipschitz estimate allows passage to the limit inside the integral, giving the displayed integral equation. Differentiation gives , . The same local Lipschitz bound proves local uniqueness.
Direct differentiation gives , , and as . On the common positive existence interval put . It satisfies , , so the integrating-factor formula givesThus . Let be the maximal forward existence endpoint. The solution is strictly increasing because . If were finite and remained bounded, its finite limit and the smooth right side would allow local continuation, contradicting maximality. Comparison with prevents existence through . ConsequentlyThere is no contradiction with Picard's theorem, which gives local existence and uniqueness. Its box estimate gives only a short guaranteed interval, and the Lipschitz constant for is not globally bounded in .
Past exam of the differential equations 1 course of the University of Oxford 2021 2 a 1 Solution 2026-10-25
For the Weierstrass M-test proof of the Picard-Lindelöf theorem, the required bound isTo see this, use Picard iteration starting with andIf takes its values in , then . Thus every Picard iterate remains in the rectangle where the hypotheses hold. Successive applications of the Lipschitz condition and integration give the factorial estimate for Picard iterationFor example, the estimate is , and integrating the th estimate multiplied by proves the next one. The sum of the uniform bounds isfor every finite , by the exponential series. Hence the telescoping series of Picard iterates converges uniformly by the Weierstrass M-test. The uniform limit stays in the closed rectangle, and the Lipschitz condition permits passage to the limit in the integral equation. The fundamental theorem of calculus then gives the desired solution of a differential equation on .
Past exam of the differential equations 1 course of the University of Oxford 2023 1 b iii Solution 2026-10-25
The difference of two successive Picard iterates factors asThe preceding bound and the kernel estimate therefore giveMoreover . Summing the resulting geometric series, for ,Thus there is a uniform limit on , continuous by the uniform limit theorem, with . The integral passes to this limit becauseTherefore satisfies the Volterra integral equation, and hence the initial value problem. This proves global existence by Global Picard iteration with a decaying kernel. The same estimate gives the useful error boundIf , every iterate is zero and the convergence assertion is immediate.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 58 6 Solution Created 2026-10-03 Updated 2026-10-14
The Weierstrass approximation theorem asserts that every real continuous function on a compact interval is a uniform limit of polynomials. An affine change of variable reduces the interval to . There are two complementary routes: construct positive approximation operators, or construct an algebra dense enough to approximate absolute values and hence pointwise maxima and minima.
For the first route, the Korovkin theorem reduces convergence of positive linear operators on continuous functions to the three tests . Here is its proof. Given and , uniform continuity supplies a such that for . For all one then hasApply positivity to the two real inequalities obtained from this bound. At this givesThe expression in brackets is nonnegative and tends uniformly to zero by the three test assumptions. Also uniformly. Taking the upper limit of the supremum norm and then letting proves convergence for every . This is the quadratic barrier estimate for positive approximation operators.
The Bernstein polynomial supplies the constructive corollaryThe binomial theorem makes its nonnegative weights sum to one. Differentiating the binomial theorem, or using the first two binomial distribution moments, givesThe Korovkin theorem proves uniformly, and each is a polynomial, proving the Weierstrass approximation theorem. The same criterion gives the Schoenberg spline operator convergence in Solution 3. For periodic functions its counterpart uses : the nonnegative barrier is bounded away from zero outside any fixed small arc. This periodic Korovkin test set gives convergence of the normalized Fejér sums and density of trigonometric polynomials.
The Lebesgue convergence criterion for approximation operators addresses stability. Suppose bounded linear operators converge to the identity on every polynomial. Then they converge on every continuous function if and only if . Sufficiency is the extension of approximation operators from a dense subspace: for a polynomial with and a common bound ,First let , then . Necessity follows from the Uniform boundedness principle, since a convergent is bounded for every . Applied to approximation projectors, the Lebesgue inequality for approximation projectors isIndeed makes ; take the infimum. Thus density of the ranges and a uniform bound on the Lebesgue constants of interpolation imply convergence. Density alone does not control a sequence of interpolation projectors.
There is also a kernel version of this stability criterion, useful for trigonometric polynomial approximation. If integrable periodic kernels have uniformly bounded norms, their integrals tend to one, and for every , then convolution with converges uniformly to every continuous periodic function. Subtract and split the error into a small arc, bounded by , and its complement, bounded by . The remaining mass error tends to zero. This approximate identity argument shows directly why nonnegative unit-mass Fejér kernels work even though ordinary Fourier partial sums need not converge uniformly for every continuous target.
Lebesgue's constructive approach to the Weierstrass approximation theorem starts instead with the absolute value. On define the polynomial recurrence for the absolute valueInduction gives , monotonicity, andThe pointwise limit satisfies and is nonnegative, hence equals . Dini's theorem makes the convergence uniform. More explicitly, the continuous decreasing errors have, for any positive tolerance, open sublevel sets covering the compact interval; a finite subcover supplies one index valid everywhere. Every continuous piecewise linear function has the formThe are its changes in slope. Scaling and translating the absolute-value approximation shows that is uniformly approximable by polynomials. Solution 4, or polygonal interpolation and uniform continuity, makes these piecewise linear functions dense in . Approximating first by and then by a polynomial is another complete proof of the Weierstrass approximation theorem.
The Stone-Weierstrass theorem generalizes from intervals to a compact Hausdorff space : a real subalgebra containing the constants and separating points is uniformly dense. Its proof uses the same absolute-value mechanism. The uniform closure of a function algebra is an algebra. If belongs to this closure, approximation of by polynomials on a bounded interval containing its range proves that also belongs to the closure. Therefore the closure containsPoint separation and constants allow exact interpolation of any two real values: choose with and solve for in . The lattice approximation from two-point approximation proved in Solution 4 now makes the closure all of .
The complex version requires a unital, point-separating subalgebra closed under complex conjugation. Its real-valued members separate points using real or imaginary parts, so the real result approximates both parts of every complex target. Conjugation closure is essential: polynomials in alone on the closed unit disk cannot approximate uniformly, because whereas .
Among the corollaries are density of multivariate polynomials on compact subsets of real Euclidean space, since coordinates separate points, and density of trigonometric polynomials on the circle, since sine and cosine separate points there. On a compact interval, polynomials with rational coefficients are a countable dense family, giving separability of . The real and complex approximation results above concern uniform approximation of continuous targets; neither asserts convergence of arbitrary interpolation schemes or arbitrary Fourier series.
Past exam of the mathematics course of the University of Cambridge 2003 ib Paper 4 1F Solution Created 2026-09-24 Updated 2026-10-14
Uniform convergence on an interval means that for every there is such that for every and every . Equivalently, the supremum of this difference tends to zero. A uniform limit of continuous functions is continuous: at a point , choose one uniformly within of , then use continuity of to make . The triangle inequality gives . Thus is integrable on the compact interval, andFor the half-line example, differentiating gives . The maximum is attained at , where . Therefore uniformly on . Nevertheless, the substitution givesThe integral does not tend to zero. This is the phenomenon that uniformly vanishing functions can retain a nonzero integral: the finite-length estimate above has no finite analogue for the entire half-line.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 6 1 iv Solution Created 2026-10-03 Updated 2026-10-14
The real space is a Banach space in the uniform norm: a uniformly Cauchy sequence has a uniform pointwise limit by completeness of , and that uniform limit is continuous. Each functional from the preceding part is bounded, but their norms are unbounded.
For integers , defineEach is closed, being an intersection of inverse images of closed intervals under continuous functionals. It has empty interior. Otherwise some ball would be contained in it. For every of norm at most one, both and would belong to that ball, soTaking the supremum over would give for all , contradicting the preceding part.
Thus the are nowhere dense. The Baire category theorem says their union cannot cover . A function outside that union satisfiesso its Fourier series diverges at zero. In fact these functions form a dense subset of . This proves the relevant Uniform boundedness principle argument directly and establishes generic unbounded Fourier sums at a fixed point.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 9 1 Solution Created 2026-10-03 Updated 2026-10-14
Let be a nonconstant rational map of the Riemann sphere, and write for its -fold iterate, with the identity. The appropriate notion of convergence is uniform convergence on compact subsets in the chordal metric, which treats poles as ordinary values at infinity. A family of meromorphic maps is a normal family if every sequence in it has a subsequence converging locally uniformly in that metric; the limit is meromorphic or constant, possibly the constant infinity.
The Fatou set consists of points with a neighborhood on which the iterate family is normal. The complementary Julia set is . Thus the sphere is the disjoint union of an open stability region and a closed instability region . These definitions concern all subsequences of iterates, rather than assuming that the iterates themselves converge on every stable region.
Equicontinuity makes this distinction precise. On a compact subset of a neighborhood, the family is equicontinuous if, for every , some makes whenever and , uniformly in . The Arzelà-Ascoli theorem says that equicontinuity of continuous maps from a compact domain to a compact metric target gives relative compactness for uniform convergence. Apply it to a compact exhaustion and take a diagonal subsequence to obtain local normality. Locally uniform spherical limits of meromorphic maps are again meromorphic or constant, by using finite target charts and the locally uniform limit theorem for holomorphic functions. Conversely, if equicontinuity failed, there would be maps and points with bounded below by a positive number. A subsequence converging uniformly on a compact neighborhood contradicts this. Hence local normality and local equicontinuity are equivalent here.
Both sets are completely invariant:For the inverse direction, if the family is normal near , composition with makes normal near , and adding the identity does not affect normality. For the forward direction, suppose the iterates are equicontinuous near . A nonconstant holomorphic sphere map is open. Thus each sufficiently small neighborhood of maps onto a neighborhood of ; every nearby target point has a preimage as close to as desired. Thenis uniformly small. Applying this at each point of the image neighborhood proves equicontinuity there. This argument works at rational critical points and requires no single-valued inverse branch. Surjectivity of supplies the asserted image equalities. Also and for : one direction follows by taking a subfamily, and the other by splitting into the finitely many residue classes , .
For degree , the Julia set is nonempty. Otherwise the family would be equicontinuous on the whole compact sphere, giving a subsequence converging uniformly to a continuous sphere map . Maps sufficiently close in chordal distance are homotopic, using the unique short spherical geodesic between their values. They therefore have equal topological degrees. This is impossible because whereas has one fixed degree.
It cannot be a nonempty finite set either. Complete invariance would make a permutation of that finite set, with just one sphere preimage for each of its points. That preimage would have local degree of a holomorphic map . Every holomorphic cycle in this set would consequently be superattracting for its return map, hence lie in , a contradiction. In particular contains at least three points.
The Montel theorem in the form used here says that a family of meromorphic maps on a domain, each omitting the same three distinct points of the sphere, is normal for spherical convergence. It also shows that is perfect. If were isolated in , choose a disc with and four distinct points of . For each , complete invariance makes have at most the single point . Partition the iterates into finitely many families according to which of the four points, if any, that single value equals. Each family omits at least three fixed points, so each is normal by Montel; their finite union is normal. This would put in , a contradiction. Therefore the degree-at-least-two Julia set is compact, infinite and has no isolated points.
The same omitted-value argument explains its global reach. If an open meets , then can omit at most two sphere points, since three omissions would imply normality on . If had an interior and were not the whole sphere, these image sets would remain in and their complement would contain the nonempty open set , impossible. Thus a proper Julia set has empty interior and equals the boundary of . If the Julia set is the whole sphere, the Fatou set is empty instead.
An attracting periodic point and its holomorphic cycle has a contracting return map in a small disc, so its basin is in the Fatou set. Repelling periodic points belong to the Julia set: return iterates fix the point but have derivatives equal to unbounded powers of their periodic-orbit multiplier, contradicting derivative bounds for a normal subsequence near that fixed value. A standard further global property is that repelling periodic points are dense in the Julia set. Fatou components can also support convergence towards a parabolic cycle on the boundary, or rotation behavior in a Siegel disc or a Herman ring; normality need not mean attraction. For example, has , with the interior converging to zero and the exterior to infinity. On the unit circle, arbitrarily close radii have incompatible limiting behavior, preventing normality there.
Degree one has a different picture. A rational map of degree one is a Möbius transformation. Up to Möbius conjugacy, an elliptic map is with ; its iterates are rotations and are equicontinuous on the sphere, so is the whole sphere and is empty (including the identity). For with , all compact subsets away from zero converge to infinity, while and prevent equicontinuity at zero. Thus ; for the reciprocal coordinate gives . A nonidentity parabolic map is conjugate to . Its iterates converge locally uniformly to infinity on the finite plane, but has , so . Holomorphic conjugacy carries these sets to the corresponding fixed points of the original map. These finite Julia sets explain why the degree restriction in many global Julia-set properties is essential.
Past exam of the mathematics course of the University of Cambridge 2007 ib Paper 4 13H Solution Created 2026-09-24 Updated 2026-10-14
The contraction mapping theorem says that if is a nonempty complete metric space and satisfies for a constant , then has exactly one fixed point.
For the proof, start at and set . Iterating the contraction bound gives . The triangle inequality then gives, for ,Thus is a Cauchy sequence and has a limit by completeness. Since the contraction is continuous, . If is another fixed point, then , forcing distance zero. This proves existence and uniqueness.
For the integral map, the fundamental theorem of calculus shows that is continuous whenever is continuous. In the supremum norm,Hence . We can chooseThe space with this supremum norm is complete: a uniformly Cauchy sequence has pointwise real limits, the Cauchy bound passes to those limits to give uniform convergence, and a uniform limit of continuous functions is continuous. The contraction mapping theorem therefore gives a unique continuous with . The fundamental theorem of calculus makes this differentiable, with and . Conversely every solution of that initial-value problem obeys the integral equation, so uniqueness transfers to the ordinary differential equation. Explicitly on , as direct differentiation confirms.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 9 1 Solution Created 2026-10-03 Updated 2026-10-14
Assume is nonempty, as is necessary for a probability measure to exist. Give its isometry group the uniform metricEvery distance-preserving self-map of a compact metric space is onto. Indeed, if , then , and for the iterates satisfy . This infinite separated set contradicts compactness. Consequently is a group under composition, with the identity and inverses again isometries.
The metric is invariant under both left and right multiplication: left invariance uses preservation of distances, and right invariance uses surjectivity. Inversion is an isometry for , and proves continuity of multiplication. Moreover, is compact. A sequence of isometries has a subsequence converging at every point of a countable dense subset of , by a diagonal argument. Their common Lipschitz constant and finite epsilon-nets of make this subsequence uniformly Cauchy. Its uniform limit preserves distances and is onto by the preceding argument. Thus is a compact metrizable topological group. A transitive group action means that for every some has .
We construct the invariant Borel probability measure directly. The Hall marriage theorem says that a finite bipartite graph with equal-sized vertex classes has a perfect matching precisely when every subset has at least neighbours in . Its following consequence is useful. If are -separated subsets of maximum cardinality in a compact metric space, join points whose distance is less than . If some had fewer than neighbours, replacing those neighbours in by would produce a larger -separated set. This contradicts maximal cardinality. Hence there is a bijection between and moving each point by less than .
Choose and maximum-cardinality -separated sets . Such sets exist: a finite covering by balls of radius less than bounds every separated set's cardinality. Fix and define the empirical probability measuresFor let , which tends to zero with by uniform continuity. For every , left invariance of makes another maximum-cardinality separated set. Match it to as above. ThenThe allowed compactness of probability measures on a compact metric space supplies a subsequence converging to in the weak-star topology. Passing to that limit for each fixed gives . The same subsequence works for every , since the displayed estimate held for all of them before taking the limit.
For uniqueness, put . For , right invariance of lets us match with . Transitivity therefore gives the uniform estimate for every . If is any invariant Borel probability measure, thenTwo invariant probability measures consequently differ on the integral of by at most , hence agree on every continuous function. Continuous functions determine Borel probability measures on a compact metric space, so the invariant probability measure exists and is unique.
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 4 22I b Solution Created 2026-09-24 Updated 2026-09-29
Write with every equicontinuous. Its closure is still equicontinuous, because uniform limits preserve the same oscillation inequalities. The Baire category theorem applied to the Banach space shows that some has nonempty interior. Hence there are and such that the open ball lies in .
Fix . Equicontinuity of gives a neighborhood of on which every member of changes by less than . If were distinct from , the normality of a compact Hausdorff space and the Urysohn lemma would give with , , and . Both and belong to , yeta contradiction. Thus , so every point is isolated and is a discrete space. A compact discrete space is finite, since its cover by singleton open sets has a finite subcover.
Past exam of the mathematics course of the University of Cambridge 2025 ib Paper 1 10G Solution Created 2026-09-23 Updated 2026-09-25
Uniform continuity means that for every there is a single such that implies for all . A -Cauchy sequence converges uniformly pointwise to a bounded function; passing a uniform-continuity estimate through a sufficiently close member proves that the limit is uniformly continuous. Thus is complete.
If , decay at infinity and compactness of a ball make it bounded. Uniform continuity on a sufficiently large compact ball, together with small values outside it, proves global uniform continuity. Hence .
A uniform limit of functions vanishing at infinity also vanishes at infinity, so is closed. It is not compact: translate a fixed compactly supported bump of height one so that the supports are disjoint. The resulting sequence has pairwise sup distance one and no convergent subsequence.
Past exam of the mathematics course of the University of Cambridge 2025 ib Paper 2 2G i Solution Created 2026-09-24 Updated 2026-09-25
Pointwise, tends to according as . This limit is discontinuous, whereas a uniform limit of continuous functions is continuous. Convergence is therefore not uniform.
Let and let be its uniform limit. Choose a finite with for all . The partial sums of the multiplied series are , andFor any , uniform convergence supplies making for all and . The displayed estimate then gives an error less than . Thus
The Uniform Cauchy criterion says that converges uniformly on if and only ifFor necessity, use the triangle inequality through the uniform limit. For sufficiency, the condition makes a Cauchy sequence for each , so completeness of the real numbers defines a pointwise limit . Apply the condition with and let to obtain uniformly in .
Assume, as required for the displayed integrals, that the are Riemann integrable on . Their uniform limit is also Riemann integrable: if , the upper and lower Darboux sums for a partition of an interval differ for by at most the corresponding difference for plus . Choosing and then a sufficiently fine partition of an interval proves the Riemann integrability criterion for .
The integral estimate then givesThis proves that uniform convergence preserves integrals on a compact interval. Some integrability hypothesis is necessary: uniform convergence alone cannot make the integral of an arbitrary starting function exist.
Morera's theorem states that a continuous function on a domain is holomorphic if its contour integral around every triangle whose filled-in interior lies in the domain is zero.
The uniform limit is a continuous function, by the uniform limit theorem. For any such triangle , the estimation lemma givesEach integral of vanishes by the Cauchy integral theorem. Hence the integral of vanishes too, and Morera's theorem proves is holomorphic on . This is the basic locally uniform convergence of holomorphic functions argument; the given uniform convergence on all of is more than needed.
The space of polynomials is not complete for the supremum norm metric . ConsiderThe geometric series has sum , and for its tail satisfiesThus converges uniformly to and is a Cauchy sequence for .
There is no polynomial agreeing with on : otherwise the polynomial would vanish at infinitely many points and therefore be the zero polynomial. Evaluating this identity at gives . By uniqueness of the uniform limit, has no limit in . This proves the claimed failure of completeness.
Continuity and nonvanishing on the compact interval implyHence . A -Cauchy sequence is therefore uniformly Cauchy, so (i) gives a continuous uniform limit; the upper bound then gives convergence in . Thus . The positive lower bound is what makes the argument work.
Yes. A Cauchy sequence of continuous functions in the supremum norm is Cauchy in the given complete space of bounded functions, so it has a uniform limit there. A uniform limit of continuous functions is continuous: at a point, use two uniform errors smaller than and continuity of one sufficiently late term for the remaining error. Thus the limit is in , proving completeness. Equivalently this is a closed subspace of the given complete space.