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 2012 iii Paper 30 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The Burton-Keane theorem says that for independent bond percolation on the hypercubic lattice , , at every fixed , there is almost surely at most one infinite percolation cluster. It does not assert that such a cluster exists, nor does it assert absence of percolation at the critical parameter. The cases and are immediate; assume for the proof.
Let be the number of infinite percolation clusters. This random variable is translation invariant. By translation ergodicity of Bernoulli percolation, it is almost surely a constant . One way to see ergodicity is to approximate an invariant event by events on finite sets of edges, translate one approximation far enough to make the two approximations independent, and then let the approximation error vanish. Its probability equals its square, hence is zero or one.
The other probabilistic input is the finite-energy property of Bernoulli percolation. Conditionally on all edges outside a finite set, every prescribed inside configuration has positive probability, namely a product of powers of and . Thus an event of positive probability can be followed by a specified finite modification and still gives a positive-probability image event. Outside infinite arms are unaffected.
First exclude a finite . Some finite box meets at least two infinite percolation clusters with positive probability. Open all edges in and incident to that box. These clusters merge. Opening finitely many edges cannot create an infinite percolation cluster solely out of finite clusters, since it joins only finitely many such clusters. Hence the number of infinite percolation clusters decreases with positive probability, contradicting its almost-sure constant value. This rules out every finite multiplicity greater than one.
Now suppose . With positive probability a finite box meets at least three distinct infinite percolation clusters. Retain an exterior infinite ray from each of three of them. Replace the finitely many interior and boundary edges by a minimal tree joining their three attachment graph vertices, and close all unused edges there. The exterior rays belong to distinct original clusters, so have no outside connections to each other. The resulting joined cluster has a branch graph vertex with exactly three incident open edges, and deleting leaves three infinite components. If a terminal lies in the middle of the interior connecting path, its exterior ray supplies the third branch there. Such a graph vertex is a trifurcation vertex in percolation. A finite box has only finitely many candidate locations and modifications; therefore some fixed graph vertex has positive trifurcation probability. By translation invariance, that probability is a common number at every graph vertex.
The decisive deterministic input is the trifurcation boundary-counting lemma. Let be all these degree-three trifurcation vertices in percolation in a finite box . In each infinite percolation cluster meeting , delete the graph vertices of , contract each remaining connected component of a graph adjacent to to a node, and retain the incidences with the deleted graph vertices, including direct edges between graph vertices of . This is a finite tree: a cycle would connect two neighbours of an original trifurcation vertex in percolation without passing through it, contradicting its three-way separation. Every deleted graph vertex has degree three. Every leaf component is infinite, since a finite leaf would give a finite branch after removing its adjacent trifurcation vertex in percolation. The elementary tree degree identity therefore supplies at least infinite leaf components for a cluster containing .
Each such infinite component reaches the outer graph vertex boundary , and different components reach different boundary graph vertices. Summing over the clusters yields, in particular,For a nearest-neighbour lattice box,Taking expectations and using the common trifurcation probability givesThis contradicts and excludes infinitely many infinite percolation clusters. Thus only or remains:The proof explains the role of the amenable boundary growth of lattice boxes: finite-energy property of Bernoulli percolation would make branching points have positive volume density, while their disjoint infinite branches can only be supplied through a boundary of lower order. It uses no planar duality and works in every indicated dimension.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 3 5 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The coordinate ring is . The induced action is contragredient on functions:It is a group action by degree-preserving algebra automorphisms, extending the dual action on linear polynomial functions. Its polynomial invariant ring isFor a monic polynomial , its polynomial discriminant is . This is symmetric in the roots, hence polynomial in the coefficients, and is zero exactly when a root is repeated.
For the alternating group action, let be the elementary symmetric polynomials and put . If is -invariant and is any transposition, decomposeNormality and index two of show that is symmetric and transforms by the sign character of . Any alternating polynomial vanishes when , so every divides it. These pairwise nonassociate prime factors have product , so with symmetric. The Fundamental theorem of symmetric polynomials yieldsThe sum is direct, since a polynomial that is both symmetric and alternating is zero in characteristic zero. Also , where is the discriminant polynomial ofThus, more precisely than the requested quotient assertion,Surjectivity follows from the direct-sum expression. Divide any putative kernel element by the monic quadratic in ; its remainder is . The direct sum forces , and algebraic independence of the gives . Hence the displayed relation is the entire kernel. The argument also covers , where is trivial.
Now let be finite with no nontrivial linear characters, and write , . The polynomial ring is a unique factorization domain. Factor a nonzero invariant in ; invariance permutes the associate classes of its irreducible factors and makes their exponents constant on each orbit. For an orbit , choose representatives and form its orbit product of polynomial factorsFor every , for a nonzero scalar . Applying two group elements proves that is a homomorphism. The hypothesis forces , so .
This orbit product is prime in . If it divides with , one factor divides or in . Invariance of that chosen polynomial makes every factor in the orbit divide it. Their product therefore divides it in , and the quotient is invariant because numerator and denominator are invariant and cancellation is valid in the integral domain . Thus divides or in . Every nonzero is a scalar times a product of these prime orbit products, and the only units of are nonzero constants, as they are units in . Therefore is a unique factorization domain. This gives a direct proof, without assuming a divisor-class-group theorem.
For a failure in characteristic zero, let the cyclic group of order two act on by . Its coordinate invariants areEvery invariant monomial has even total degree: its exponents are either both even, or both odd, giving the indicated generators. Reducing powers of to at most one shows that is the only relation, since and map to distinct monomials. The three quadratic invariants are irreducible in : each nonconstant invariant has degree at least two, so a product of two nonunits has degree at least four. They are pairwise nonassociate, butgives two different irreducible factorizations. Hence this invariant ring is not a unique factorization domain. The nontrivial sign character is precisely the kind of character excluded in the preceding theorem.
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





