Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 15 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Independence or another ergodicity hypothesis is necessary. Read literally for an arbitrary translation-invariant site percolation measure, the assertion is false: the mixture assigning probability to the all-open configuration and to the all-closed configuration is translation-invariant, but the invariant event of an infinite percolation cluster has probability . We prove the zero–one law for the invariant independent law used in part (ii); the proof also works for the stated finite-range independent alternative.
Let be the group of translations, or the specified group of graph automorphisms, and let be invariant under it, up to null sets. An event determined by the states in a finite vertex set is a cylinder set. For every , approximation in the product sigma-algebra provides a cylinder set , supported on a finite set , with . Choose so that and are disjoint. Then and are independent events, have equal probabilities, and . HenceandLetting proves the zero–one law . This is translation ergodicity of Bernoulli percolation.
For a quasi-transitive graph, the required displacement exists: put in a ball about a vertex ; its orbit is infinite, so an automorphism can move , and therefore that whole ball, beyond any prescribed finite neighborhood. A -independent site percolation law means that the sigma-algebras generated by vertex sets at graph distance greater than are independent. Move far enough that and the same proof applies. Thus finite-range independence does give the zero–one law, although it will not give uniqueness.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 15 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Set . Declare a bond of the planar dual graph open when its crossing primal bond is closed. These states have the independent dual bond percolation law with parameter ; the dual square lattice is a translate of the primal square lattice. Part (i) supplies an such thatIn particular every dual cluster is finite almost surely.
Suppose the primal percolation cluster is finite. Fill its finite complementary holes. Every bond on the resulting outer boundary is closed, since an open bond leaving the cluster would reach another cluster vertex. The crossing dual bonds form a connected enclosing contour, possibly touching itself, contained in one dual cluster . This is the dual contour bound for a finite planar cluster. If , a connected set of square-lattice dual vertices has each coordinate width at most . All vertices of lie inside the enclosing contour, soMoreover the contour surrounds and the diameter of is at most in the graph distance. Thus every vertex of lies in the square of radius about . There are at most possible dual vertices in that square, with a harmless enlargement if a boundary convention requires it.
On there is therefore an integer and a dual vertex in that square whose dual cluster has size exactly . The enclosing contour has at least four vertices. A union bound and part (i) givefor constants depending only on . The last estimate follows by bounding the polynomial factor by a constant times and summing a geometric series. This explains the square root: an enclosing dual cluster must have size at least the square root of the primal volume.
For , the Harris-Kesten theorem and imply , so . Choose with . For use the preceding bound; for use the bound . The positive constant gives the required conclusion:For the event is empty, so any works.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 15 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We use three precise inputs. The Harris-Kesten theorem says that independent bond percolation on the square lattice has percolation critical probability . Sharpness of the percolation transition says that, for every , there are such that for all positive integers . Finally, the BK inequality says that increasing connection events with disjoint bond witnesses have joint probability at most the product of their individual probabilities. All three statements concern the independent product law used here.
The sharpness bound implies finite percolation susceptibility. Indeed, with , summing over square shells givesA radius bound alone would give only a square-root exponential volume bound. To obtain the requested exponential volume bound, we prove the tree-graph moment bound for a percolation cluster:where .
Expand the left-hand side as a sum over ordered marked vertices of the probability that belong to one open cluster. Whenever that event occurs, a finite open tree connects the marked vertices. Delete unmarked leaves and suppress unmarked degree-two vertices. Treat a marked internal vertex as a leaf attached by a zero-length connection, and split any higher-degree branch into degree-three branch points, again with zero-length connections. This gives an abstract binary tree with labelled leaves, branch points and connections. Its nonempty connecting paths use disjoint sets of open bonds. Coincident marked vertices are allowed: their zero-length connections have empty witnesses.
There are such binary tree topologies. For example, the topology with two leaves is unique; inserting the next labelled leaf subdivides one of the edges of a topology with leaves, giving the usual double-factorial recursion. For a fixed topology and fixed positions of all its vertices, the BK inequality bounds the disjoint connection event by the product of the corresponding factors. Sum over all and all branch-point positions. Keep the root fixed, and successively sum a leaf away. Translation invariance gives at every step. The resulting sum is . Summing the topologies proves the bound.
Since , expansion of the exponential, justified by monotone convergence, givesTake and write . Markov's inequality yields . To remove the prefactor, choose an integer with . For the bound is at most . For , useFor , setting therefore proves the bound with unit prefactor:At , and any positive works.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 15 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
No. The parallel-bond ray with different site and bond thresholds supplies a locally finite graph counterexample. Take vertices and parallel directed edges from to . Its underlying multigraph is connected and every individual degree is finite, but there is no uniform incoming-degree bound.
For bond percolation rooted at , survival means that every successive group of parallel bonds contains at least one open bond. Independence givesFor , the sum of the failure probabilities is . Eventually these terms are at most , and for . The tail of the infinite product is therefore bounded below by a positive exponential; its finitely many initial factors are positive as well. Thus for every .
For site percolation, however, every vertex of the unique underlying ray must be open. For , the probability that its first vertices are all open is . At the ray is open. Consequently
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 15 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the incoming-edge coupling of site and bond percolation. Start with independent random variables indicating open bonds, each with probability . For a vertex of incoming degree , let indicate that at least one incoming bond is open. ThenThe indicators are independent: the sets of bonds entering different vertices are disjoint. Using an additional independent coin at each vertex, turn some zeros into ones so that the resulting indicators are independent with common probability . Explicitly, when , set with conditional probability .
Every vertex other than in an open bond percolation out-cluster has an open incoming bond, and is consequently an open site. On , the whole bond out-cluster is therefore contained in the site percolation out-cluster. The event of infinite bond reachability does not depend on bonds entering : delete cycles from any finite open directed path starting at . It is thus independent of , including its additional coin. HenceFor every below , monotonicity and the definition of the survival threshold give . Letting yields the quantitative boundIn particular, if , the right-hand side is strictly less than . If , no separation from is implied or generally possible.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 15 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let and be the out-clusters in directed percolation, with the site percolation cluster empty when is closed. Write and , and similarly for site percolation. The survival and susceptibility thresholds for directed percolation are the infima of the parameters at which these quantities become positive and infinite, respectively.
We construct a coupling of probability distributions that compares the whole clusters. First condition the site percolation root to be open. Explore its out-cluster, using a fixed order of the finitely many outgoing bonds at each vertex. When a previously untested vertex is first encountered along a bond from an already reached vertex, use a fresh Bernoulli random variable of parameter both for the state of and for the state of this particular bond. If is open, add it to the exploration; if it is closed, mark it as tested and never add it. Assign fresh independent random variables of the same parameter to every other bond, including bonds leading to vertices already tested. The choice of the next unassigned bond depends only on previously revealed information. Its assigned coin is therefore independent of that information, so the resulting bond configuration has exactly the product bond percolation law. Parallel bonds cause no difficulty; loops may be discarded.
Every reached site has an open parent bond leading from a previously reached site. Consequently the conditional site percolation cluster is contained in the bond percolation cluster. The connected graph is countable because it is a locally finite graph; taking increasing finite stages of the exploration proves the same containment for infinite clusters. Removing the conditioning on the root givesThus positive site percolation survival implies positive bond percolation survival at the same parameter, and infinite percolation susceptibility for site percolation implies infinite percolation susceptibility for bond percolation. Taking the infima in the definitions proves both comparisons:
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 13 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Count a three-term arithmetic progression as an ordered triple , allowing . Inserting Fourier inversion on a finite group into its normalized count and using additive character orthogonality in givesIndeed the two frequency constraints are and , so the surviving frequencies are . The term at zero is .
For odd , let be the balanced indicator function of a finite subset, and put . Its zero coefficient is zero, and its other coefficients equal those of . Since when , the Parseval identity on a finite group givesThe assumed deficit therefore forcesThus and suffice. This is the large Fourier coefficient from a deficit of three-term progressions estimate; no generalized von Neumann theorem is needed. For the remaining prime , the count is , so the deficit hypothesis is impossible. The zero common difference was included throughout.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 13 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Assume is nonempty, so , and put . By the Parseval identity on a finite group, . Select the nonzero frequenciesThen , giving . Outside , the fourth Fourier moment has the boundThe fourfold normalized convolution on a finite group has transform , so Fourier inversion on a finite group gives . It is real and nonnegative, and implies because the convolution counts representations, with a positive normalization.
Use the Bohr set in phase-distance conventionOn this set all retained additive characters have positive real part. The zero-frequency contribution is , and the total absolute contribution of the discarded frequencies is at most . HenceThereforeThis is an explicit Bogolyubov lemma. In the chord-distance convention for a Bohr set, the phase-radius corresponds to chord radius ; alternatively the same positivity proof works directly at chord radius . Thus the requested lower bound on width holds in either convention. If is empty, the Bohr set is the whole group. Nonemptiness of is necessary for the density statement.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 6 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
No additional hypothesis on is needed here for scalar interior regularity. In the elliptic sense of uniform convexity, the assumptions already give constants with for all . The following argument gives interior gradient regularity for uniformly convex autonomous energies.
The first variation at the minimizer exists because , and its weak Euler-Lagrange equation isFor a coordinate difference quotient , subtract the translated equation and the original equation. The averaged linearization of a nonlinear divergence-form equation givesThese measurable symmetric matrices satisfy independently of . The Caccioppoli inequality and the standard bound bound on every smaller interior set. Quoting the Sobolev characterization by bounded difference quotients yields .
Now is globally Lipschitz continuous, so the Sobolev chain rule and commutation of distributional derivatives allow differentiation of the weak equation. Each satisfiesThe De Giorgi-Nash-Moser theorem states that weak solutions of this scalar divergence-form equation with bounded measurable uniformly elliptic coefficients are locally Hölder continuous. It gives a common depending only on and the ellipticity ratio , with for every . A Sobolev function whose weak gradient is continuous has a representative, as follows by local mollification and integration of its gradient. HenceThe higher-regularity conclusion comes from differentiating an autonomous scalar equation; it does not rely on boundary regularity or a higher derivative such as .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 6 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The affine class is nonempty, and part (i) gives a finite comparison energy . Since , its energy infimum satisfies . Choose a minimizing sequence with . ThenThe gradient bounds also control the full Sobolev norm. Indeed , so the Poincaré inequality givesThus is bounded in the Hilbert space . Its weak compactness yields a weakly convergent subsequence . The closed linear subspace is weakly closed, hence and . By part (ii),The direct method in the calculus of variations therefore provesNeither a smooth boundary nor a classical trace theorem is needed: the boundary condition is encoded by the closed zero-boundary Sobolev space.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 6 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Suppose in . Then in . Since is a differentiable convex function, its supporting inequality isTake , and integrate. Part (i) shows that every energy is finite and that the fixed field belongs to , soThe last integral tends to zero by the definition of weak convergence in . ThereforeThis is weak lower semicontinuity of convex gradient energies. It uses a fixed supporting gradient at the limit; weak convergence alone would not justify passing pointwise through the nonlinear integrand.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 6 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let bound the operator norm of ; the bound on individual second derivatives supplies such an depending also on dimension. The Taylor theorem with integral remainder givesThus quadratic growth from a bounded Hessian givesSince is bounded it has finite measure, and a function in the Sobolev space has . The given lower bound also implies that the integrand is nonnegative. ConsequentlyFor later use the same Hessian bound yields , hence .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 5 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Set . Since , the field is , and everywhere, even when the gradient of is unbounded. The divergence theorem on givesLetting proves . This is the fact that an entire bounded vector field cannot have nonzero constant divergence; it holds in every dimension.
The equation is now exactly the minimal surface equation for a graph. Apply the supplied Bernstein theorem for minimal graphs in dimensions to concludeThus no nonzero constant right-hand side is possible for an entire graph, and in the stated dimensions every possible graph is an affine plane.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 5 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let , which is finite because is bounded, and put . Then is harmonic. Choose points with . For any fixed , choose large enough that . Since is harmonic on all of , the Harnack inequality for harmonic functions on givesThe comparison factor is independent of the growing radius, which is essential. Thus for every andThis proves the Liouville theorem for harmonic functions in every dimension. In fact the argument only needs an entire harmonic function to be bounded below; changing its sign gives the corresponding bounded-above result.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 5 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A local form of the Harnack inequality for harmonic functions is: if is harmonic on a neighbourhood of , thenFor , the triangle inequality gives . The ball mean value property for harmonic functions and nonnegativity therefore implyTaking the supremum over and infimum over proves the inequality, including the case where the infimum is zero. No strict positivity assumption was used.
On a connected domain , the equivalent compact-set statement is that for each nonempty compact there exists withHere is the passage from balls to this statement. Cover by finitely many small balls whose quadrupled closed balls lie in . Join their centres to a fixed centre by paths in . Each of the finitely many paths has compact image and positive distance from the boundary, so subdividing it gives a finite chain of overlapping small balls whose quadrupled closures also lie in . The local inequality compares any two points in each ball; using a point in each successive overlap propagates comparisons along the chain. The number of comparisons is bounded uniformly over this finite collection of chains and covering balls. Multiplying the factors gives one finite constant for all pairs , proving the compact-set inequality. In particular a nonnegative harmonic function vanishing at one interior point vanishes throughout a connected domain.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 5 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let have closure contained in the domain of a harmonic function . Put , so and . The sphere and ball mean value properties for harmonic functions areTo prove the sphere formula, define its average using a fixed unit sphere:Differentiating under the integral and applying the divergence theorem givesContinuity gives as , proving the spherical average identity. Integrating that identity over radii with the polar-coordinate weight yieldswhich proves the ball identity. For , the sphere average is the average of the two endpoints, and the same formulas hold with the counting surface measure.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
First perform homogenization of Dirichlet boundary data: put and . Then weakly. Extend both functions oddly across the flat face:The zero Sobolev trace of makes this odd reflection an function. This can also be seen by approximating by smooth compactly supported functions in and reflecting the approximants. Its norm is times that of , and .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We prove the Interior second-derivative estimate for the Poisson equation using difference quotients, rather than differentiating the forcing. Fix a coordinate and write . Choose a smooth cutoff function equal to one on with support compactly contained in , leaving room for all translations with sufficiently small . We can arrange , where .
The standard difference quotient lemmas give discrete integration by parts, , and on the relevant enlarged set. In the weak formulation , use the admissible test function . Moving a difference quotient onto givesSet and . The cross term has absolute value at most . Since , the difference quotient lemma on the right givesThe Young inequality now implies . Moreover , independently of . Hence, for every coordinate ,By the Sobolev characterization by bounded difference quotients, applied to each first weak derivative on smaller interior sets, these uniform bounds give all second weak derivatives. Their bounds pass to the weak limit as . Thus andNo derivative of is used, and no boundary condition is needed for this interior elliptic regularity argument.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
First use weak compactness of bounded sets in the Hilbert space to pass to a subsequence with globally in . The weak lower semicontinuity of the Hilbert norm gives . This global step also applies if is unbounded.
Choose a nested exhaustion by bounded smooth open sets. Part (i) bounds in for every . By the Rellich-Kondrachov compactness theorem, embeds compactly in . Weak compactness in and a diagonal subsequence argument therefore give, for the same subsequence,The local limit agrees with the global weak limit. Using smooth exhaustion sets avoids imposing any unprinted boundary regularity on a general .
For a smooth compactly supported test function, the weak equation passes to the limit: the fixed bounded coefficients multiply fixed test functions, and local weak gradient convergence handles both the principal and drift terms. The zeroth-order term passes by local convergence. Thus weakly, , and the global bound already proved gives .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let . Choose a smooth cutoff function with , on and . Such cutoffs can be constructed by mollifying the indicator of a fixed small neighbourhood of . Write , and ; these are controlled by the individual coefficient bounds and dimension.
The weak formulation, extended to compactly supported tests by density, isWe may use , since . Expanding its gradient and using uniform ellipticity givesApply Young inequality to the first two terms, allocating at most of the gradient integral to each. Bound in the last term. Absorbing those gradient contributions yields the Caccioppoli inequality with bounded lower-order termsConsequently . Adding the norm of proveswhere has precisely the stated dependence on dimension, ellipticity, coefficient bounds and . The proof uses , so no sign condition on the zeroth-order term is required.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





