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 31 1 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Write and expand it by permutations. The assumptions ensure that the indicated single-variable integrals exist; the finite-rank projection kernel constructed above satisfies them with . No symmetry of a general kernel is needed for the following argument.
If a permutation fixes , its product contains the separate factor . Integration gives times the term of the corresponding permutation of . These terms contribute .
Otherwise belongs to a longer permutation cycle. Let precede and let follow it. The only factors containing are , whose integral is by the reproducing assumption. Delete from the cycle to obtain a permutation on letters. Inserting back after any of the possible letters reconstructs exactly one permutation; its sign of a permutation is , since increasing a cycle length by one reverses its sign. Thus the nonfixed terms contribute .
Combining these two disjoint classes proves projection kernel determinant integration:For , use the empty determinant , and the statement is precisely the assumed diagonal integral. For our kernel, orthonormality directly yieldsso every step of the marginal integration is justified.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose real monic orthogonal polynomials of degree , , for on , and letExtend each by zero to negative . The resulting functions form an orthonormal set in . Define the orthogonal polynomial projection kernelThe formula on the right is for nonnegative arguments; the kernel is zero when either argument is negative. With , the kernel evaluation matrix is . By the determinant multiplication identity and the preceding monic basis change,Thus initially .
Use the symmetric labelled joint probability density on the full orthant. Expanding the two copies of into permutations and integrating all variables, orthonormality makes a term vanish unless the two permutations agree. Each of the surviving terms integrates to . HenceIf the eigenvalues are instead listed in increasing order on a single ordered chamber, that chamber's density is times this symmetric density. We keep the full-orthant convention throughout.
An explicit choice is in terms of the Generalized Laguerre polynomials. To verify the normalization independently, their Rodrigues' formula givesIntegrating by parts times proves orthogonality to every lower-degree polynomial. The boundary terms vanish at zero and infinity for . Taking the other factor to be and using gives , where is the Gamma function. The Laguerre projection kernel is thereforefor .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Write . The evaluation matrix is , where is upper triangular with diagonal entries . Its determinant is therefore unchanged. This is Vandermonde determinant invariance under monic basis change:For on , multiply row by . The requested weighted product becomes the weighted Vandermonde determinant squareThe sign difference between the two orientations of the Vandermonde product disappears on squaring. For interpret the weight at zero by continuity, so ; for , .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let . It is an alternating polynomial: exchanging two variables exchanges two rows of the Vandermonde matrix and reverses its determinant. Hence vanishes whenever , so each factor divides it. The distinct linear factors are pairwise coprime polynomials, and their product therefore divides . Both have total degree , soThe coefficient of in the determinant is , by expansion along its last row. The same coefficient in the product is . Thus , and . Consequently the Vandermonde determinant identity isThis is a polynomial identity, including repeated coordinates; no division by a possibly zero numerical Vandermonde product is needed.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 3 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use consistently wired boundary conditions in increasing finite boxes and let be the usual wired infinite-volume random-cluster measure. The finite-volume comparison just proved applies with boundary graph vertices identified, since it is still a comparison on a finite graph. Passing to the infinite-volume limit preserves the inequality for every increasing event determined by finitely many edges.
For fixed , let be the event that the origin connects by an open path in to its boundary. It is such a finite increasing event. Therefore, for ,The events decrease to the event that the origin has an infinite percolation cluster, by local finiteness. Continuity from above of a measure givesDefine the random-cluster critical probability by . The set in which percolation occurs at is a subset of that at , whenceThe same proof works if free boundary conditions are used consistently throughout. It compares critical probabilities; it does not presume whether an infinite percolation cluster exists at the critical parameter itself.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Identify a configuration with its set of open edges. Let count the connected components of a graph on the full graph vertex set, including isolated graph vertices. The random-cluster measure isFor and finite all its weights are positive. We compare , taking and .
The key fact is supermodularity of graph component count:To prove it, orient the graph edges arbitrarily and let be the real span of their incidence vectors for edges in . Its dimension of a vector space is : on each connected component of a graph these vectors span the vectors whose coordinates sum to zero. Since and , the dimension formula for a sum of subspaces giveswhich is exactly the component-count inequality.
Put and . The preceding inequality gives . In the ratio of the two sides of Holley's condition, the normalization constants and Bernoulli edge factors cancel, because . The ratio is thereforeBy the Holley inequality, stochastically dominates . Thus increasing cluster weight suppresses every increasing event:The random-cluster single-edge conditional probability confirms the mechanism: it is when the endpoints are already connected, and otherwise. Larger favours configurations with more separate components. The condition enters explicitly in the last factor .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For the coordinatewise lattice operations and , Holley's condition isThis sufficient condition implies by the Holley inequality. It is often stated first for strictly positive probability weights, as will hold for the random-cluster application, but the displayed condition is also sufficient for nonnegative weights.
For clarity about the zero-weight case, apply the four functions theorem to an increasing event , with the first two functions and , and the last two and . If and , then and . The pointwise hypothesis is exactly the displayed cross-lattice inequality. Its summed conclusion giveswhich rearranges to . This establishes the same statement without a positivity-of-support assumption.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Order configurations coordinatewise: means for every edge. Then stochastic domination is the conditionEquivalently, for every real-valued order-preserving function . The equivalence follows on this finite space by writing , up to an additive constant, as a nonnegative linear combination of indicators of its increasing upper level sets. A coupling of probability distributions supported on pairs with proves this domination; conversely such an ordered coupling of probability distributions exists on a finite partially ordered space.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
At , explore the directed out-cluster of the origin by a deterministic breadth-first procedure. Maintain the set of reached graph vertices and a queue of untested edges with one reached and one unreached endpoint. For each such edge, reveal its orientation. Add the unreached endpoint if the arrow points from the reached endpoint to it; otherwise discard that edge. edges whose endpoints are both already reached need no further test.
An untested edge has an independent fair orientation even though the choice of the next edge depends on earlier discoveries. Its probability of pointing toward the unreached endpoint is , whichever geometric direction that represents. Thus the discovery procedure has exactly the same transition probabilities as the ordinary bond percolation cluster exploration at density . In particular, for every , the probability of reaching at least graph vertices agrees in the two models. The uniform random orientation out-cluster comparison impliesA locally finite graph has an infinite directed simple ray from the origin exactly when its directed out-cluster is infinite: the exploration predecessor edges form a finitely branching rooted tree, to which the König infinity lemma applies. Conversely, such a ray visits infinitely many reachable graph vertices. HenceFairness of orientations is essential to this comparison; for general the success probability depends on the geometric direction of exploration. As usual, an infinite directed path means a ray with distinct graph vertices. Allowing a finite directed cycle to be traversed repeatedly would define an infinite walk instead and would make the claimed conclusion false.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 2 b i by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Write . The complements are decreasing events. The Harris-FKG inequality for a product measure givesThe same correlation inequality for two decreasing events follows from that for their increasing complements, since their covariance is unchanged. ThusBoth and the square root are nonnegative, so rearranging gives the square-root bound for increasing events:No independence between the events themselves is asserted; independence is the coordinate property of the underlying product measure.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Count partially directed self-avoiding walks using north, east and west steps. Within one horizontal level, a self-avoiding walk must move consistently east or consistently west. It can change horizontal direction only after a north step. Conversely, these rules guarantee self-avoidance: every visited horizontal level is new, and its horizontal run is monotone.
Let count these walks, including . A horizontal run has generating functionEvery walk decomposes uniquely into an initial horizontal run followed by zero or more pairs consisting of a north step and a horizontal run. Therefore the generating function isComparing coefficients yields , , and for . Solving this linear recurrence relation givesThese are a subset of all self-avoiding walks, so andAllowing either horizontal direction at successive heights gives the strict gain over the north-east-only family.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Split a self-avoiding walk of length after its first steps. Its prefix is one of the walks, and its translated suffix is a self-avoiding walk of length from the origin. The pair determines the original walk, although not every pair can be concatenated without intersection. ThereforeAll are positive, so is a subadditive sequence. The Fekete lemma gives existence of and consequently of the connective constant.
For a lower bound, all words of length using only north and east steps produce distinct self-avoiding walks: the sum of the two coordinates increases at each step. Thus . For an upper bound, there are four choices for the first step and at most three thereafter, since a self-avoiding walk cannot immediately reverse its previous edge. Hence . Taking th roots provesThe elementary upper bound counts all non-backtracking walks, including some that self-intersect, so it is an upper estimate rather than an equality.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
This is the Fekete lemma, with its possible extended-real limit made explicit. Put . Since , cannot be ; it may be .
Fix and write , with . Repeated subadditivity giveswhere for this calculation set . The finitely many possible remainder terms are bounded. Since ,This holds for every , whereas by the definition of an infimum. If is finite, the upper and lower bounds agree. If , choosing with arbitrarily negative shows that . ThusA finite real limit is not guaranteed: is a subadditive sequence and has . If the limit is intended to be real rather than extended real, one must add a linear lower bound.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 28 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
We count extensions up to -isomorphism. An extension of degree has a maximal unramified extension inside it, with , and is totally ramified of degree . The unramified extension of each degree is unique, so there are only finitely many possibilities for .
Fix and . The coefficient space of monic degree- Eisenstein polynomials is compact: its nonconstant nonleading coefficients lie in the compact maximal ideal, and its constant coefficient lies in the compact set . Each such polynomial has a root generating a degree- extension. For sufficiently close coefficients of a polynomial , the numbers and are arbitrarily small, while because the characteristic is zero. The strong form of Hensel lemma, applied in , supplies a root of as close to as desired. Choose the neighborhood so that the Krasner's lemma inequality holds. Then , and both degrees are , so the extensions are equal. Compactness gives a finite cover by such neighborhoods, proving finiteness of degree- extensions. If extensions are realized as subfields of a fixed algebraic closure rather than counted up to isomorphism, each has only finitely many embeddings, so that count is finite too.
For odd , write . The square map is bijective on by Hensel lemma, and the finite residue field has cyclic multiplicative group of even order. ThusThe quadratic extensions from square classes correspond to its three nontrivial classes. Representatives are , where is a unit with nonsquare residue. There are quadratic extensions: is unramified, while and are totally ramified. For completeness, two nonsquare parameters give the same extension only if their ratio is a square: writing and squaring forces , hence .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 28 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
One form of Krasner's lemma is: if is a complete non-Archimedean field, is separable over , and is algebraic withwhere ranges over the other -conjugates, then . If , the conclusion is immediate.
To prove the nontrivial case, let be an automorphism of an algebraic closure fixing . The unique extension of an absolute value to a finite extension implies that preserves the extended absolute value. ThereforeThis is strictly less than the distance to every other conjugate, so . As is separable over , being fixed by all these automorphisms puts it in . This proves . The strict inequality is what prevents switching to another conjugate.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 28 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Normalize to have value group , and extend it to an algebraic closure. Suppose is a root of a monic Eisenstein polynomial of degree . A root cannot have nonpositive valuation: the leading term would then have uniquely smallest valuation. If , the constant term has valuation one, all the other nonleading terms have valuation strictly greater than one, and the leading term has valuation . Cancellation forces . The value group of is , so . Since , equality holds throughout. Thus the polynomial is irreducible and the extension is totally ramified.
Conversely, let be totally ramified of degree , and choose a uniformizer . Its extended value is . The same denominator argument gives , so . Every conjugate has valuation , by the unique extension of an absolute value to a finite extension of a complete field. The nonleading coefficients of its minimal polynomial are elementary symmetric expressions in these conjugates, so their valuations are positive, hence at least one because the coefficients lie in . The constant coefficient is their product and has valuation exactly one. Its minimal polynomial is an Eisenstein polynomial, and .
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





