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 2007 iii Paper 15 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Regard as the real vector space of derivations at a point : a vector acts on germs of smooth functions by a linear map satisfying . In a coordinate chart , the coordinate derivations form a basis, so , with . To see that these exhaust all derivations, the first-order Taylor theorem locally writes with . The product rule gives ; applying this to the coordinate functions also proves independence. Equivalently one can use velocities of smooth curves through .
Set , with projection . Over a coordinate chart defineGive the disjoint union the topology generated by the inverse images of open sets under these bijections. For overlapping charts , the chain rule gives the tangent coordinate transitionIt is a smooth bijection with smooth inverse . Thus the induced charts form a smooth atlas of dimension . The chain rule gives the cocycle on triple overlaps, and any additional smooth coordinate chart gives compatible induced charts, so the structure is independent of the starting atlas.
The total space is Hausdorff: different base points can be separated downstairs, and two distinct vectors over one point can be separated in a common product chart. A countable coordinate cover, together with countable bases for its products, gives second countability. Hence this atlas defines a smooth manifold. In every local trivialization, is projection onto the first factor and the fibre change is an invertible linear map depending smoothly on . Fibrewise addition and scalar multiplication are smooth in these product coordinates. Consequently is naturally a smooth real vector bundle of rank .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 14 4 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
LetThis is the dense countable family of cofinite infinite subsets. Every ordinary basic open set contains the cofinite set . Thus is -dense: its ordinary closure is the whole space, so it is not -nowhere dense.
It is -closed. Indeed, for an infinite noncofinite , the Ellentuck topology neighbourhood contains only noncofinite sets, because every subset of misses the infinite complement of . This neighbourhood is disjoint from .
Finally every nonempty basic -open set contains a smaller basic -open set disjoint from : enumerate and let consist of every second point. Then is infinite, and contains no cofinite set. In particular has empty -interior. As it is already -closed, its -closure has empty -interior, proving that it is -nowhere dense.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 14 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The same cone on an infinite coinfinite ground set works:It is -closed: a set outside has an odd point, and the ordinary neighbourhood given by its initial segment through that point remains outside . Its -interior is empty, since every ordinary basic open set admits an extension having an odd point. Hence its ordinary closure equals itself and has empty interior, proving that it is a -nowhere dense set.
In the Ellentuck topology, however, is itself a nonempty open set. Its -closure therefore has nonempty -interior, so is not -nowhere dense.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 14 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Take the cone on an infinite coinfinite ground setIt is -open because is a basic open set of the Ellentuck topology. It is not -open: if , every ordinary basic neighbourhood of contains an infinite extension of having an odd point larger than . That extension is outside . Therefore no point of has an ordinary open neighbourhood contained in .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 14 1 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Every ultrafilter contains exactly one cell of any finite set partition. Indeed, two disjoint cells cannot both belong to a proper filter, while if none belonged to the ultrafilter, all their complements would belong to it and their finite intersection would be empty.
Apply this property to the two colour classes in (iii). One belongs to any proposed ultrafilter, but neither contains a symmetric weighted-pair configuration from an increasing infinite sequence. This contradicts the proposed property of every member. Therefore no such ultrafilter exists.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 14 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the alternating dyadic colouring excludes symmetric weighted pair sums construction:Thus consecutive dyadic intervals have opposite colours. Suppose an increasing infinite sequence had all its distinct-index weighted sums in one colour class. Set , the distance to the next strictly larger power of .
If is unbounded on , fix a term and choose a later term with . Put , so . ThenThese two weighted sums lie in adjacent dyadic intervals and therefore have opposite colours.
If is bounded by on , choose a term and a later term . With the same , we haveFor the upper bounds, and . These weighted sums also lie in adjacent dyadic intervals. In both cases they are and for two distinct indices, contradicting the common colour class. Hence the symmetric distinct-index conclusion is false, even for this two-colour finite colouring.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 14 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For the finite colouring , colour each unordered pair , written with , by . The infinite Ramsey theorem for r-sets again gives an infinite homogeneous set for a colouring. If its increasing enumeration is , thenThe ordering in this pair colouring is essential: it assigns the coefficient to the larger member.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 14 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be the given finite colouring, with . Give each unordered pair the colour . The infinite Ramsey theorem for r-sets, in its two-element case, gives an infinite homogeneous set for a colouring . Enumerate it as . Every distinct-index sum has the common pair colour, soThis application of the infinite Ramsey theorem for r-sets uses only unordered pairs.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 6 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Fix , and use separated-block percolation renormalization to apply the preceding one-independent bond percolation result. Place a squareat each coarse vertex . For a horizontal coarse edge , let be the width-, height- rectangle joining the two endpoint squares. Declare good if has a horizontal open crossing and both endpoint squares have vertical open crossings. For vertical coarse edges use the rotated definition.
The rectangle crossing in bond percolation limit proved above shows that each of these three events has probability tending to one. The Harris lemma givesChoose so large that every coarse bond has good probability at least the from the preceding part.
The good-bond process really is one-independent. Its determining bonds lie entirely in the corresponding . Nonincident horizontal coarse edges either lie in rows separated by at least , while their strips have width , or in the same row separated by at least one coarse edge; their rectangles are then separated by at least . The vertical case is identical. A horizontal rectangle and a vertical rectangle can intersect only if the horizontal edge's endpoint column is the vertical edge's column and the vertical edge has an endpoint in the horizontal edge's row, which would make the coarse edges incident. Thus sets of nonincident coarse edges use disjoint fine-bond sets, and those sets are independent. The positive gap avoids the shared-boundary-bond problem that occurs with touching block constructions.
An infinite good coarse cluster produces an infinite connected fine open set. To verify connectivity, a long horizontal crossing of contains a horizontal crossing of each endpoint square. It therefore meets every vertical crossing of that square. For collinear good edges the transverse crossing of their shared square joins their long crossings; for perpendicular good edges their long crossings meet inside the shared square. Concatenating along the coarse cluster gives a connected open fine set visiting boxes at arbitrarily large distances.
The one-independent result gives positive probability that the coarse origin belongs to an infinite good cluster. On this event some vertex of the finite square belongs to an infinite fine open cluster. The union bound and translation invariance of the original independent law implyso . Since this holds for every , and the Harris theorem for square-lattice bond percolation gives for , we obtain the Harris-Kesten theorem:
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 6 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put . In one-independent bond percolation, bond states in two sets with disjoint endpoint sets are independent as collections. In particular, the states of any finite matching in a graph are mutually independent, by induction on its size. Neither translation invariance nor the Harris lemma is assumed for this law.
If the origin's open cluster is finite, the outer boundary of the union of its vertex-centered unit squares contains a closed dual circuit surrounding the origin. A specified circuit of length corresponds to distinct closed primal bonds. Partition those bonds into four matchings in a graph: horizontal bonds according to the parity of the left endpoint's horizontal coordinate, and vertical bonds according to the parity of the lower endpoint's vertical coordinate. Some class has at least bonds. Their mutual independence and their individual closed probabilities at most implyThis is the Peierls circuit bound for one-independent percolation.
There are at most dual circuits of length enclosing the origin. To obtain this crude bound, choose a crossing of the positive horizontal ray; its distance from the origin is at most , since the circuit also extends to the other side of the origin. There are at most choices for its dual edge, at most two orientations, and at most three choices at each subsequent step of a nonbacktracking walk. The stated bound allows extra slack and overcounting. The union bound now givesFor instance choose , so . The exact sum isIt follows that . This deliberately nonoptimal constant suffices for existence of a universal .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 6 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be the torus graph , with independent bond density . For large, all rectangles below are too small to identify any of their own vertices or edges. Let be the event that somewhere in there is a horizontal open crossing of a by rectangle or a vertical open crossing of an by rectangle. It is increasing and invariant under translations and a quarter turn. These symmetries act transitively on all bonds, including both orientations. Thus it is a transitive increasing event.
A fixed by rectangle has its ordinary planar distribution, so the supplied lower bound gives . Choose any . Since is fixed and , the Friedgut-Kalai sharp threshold theorem implies for all sufficiently large . As is arbitrary,It remains to transfer this symmetric statement to a fixed rectangle, without a growing union-bound loss. On each circular coordinate take the ten positions , . Consecutive circular gaps are at most . Use the one hundred by rectangles starting at pairs and their one hundred quarter-turn images. Every crossed by rectangle contains the full horizontal width of one of the first family, with its vertical span contained in that rectangle's height- span: the permissible starting intervals in each coordinate have length , so the chosen positions always supply a suitable start. The crossing, restricted between those two vertical sides, gives a crossing of the chosen by rectangle. The analogous assertion holds in the rotated family.
Consequently implies at least one of these two hundred increasing crossing events. Their common success probability is . The nth root trick givesOnly two hundred translates are used, independently of scale. This bounded exponent is the essential finite-torus crossing amplification step.
For a requested height , set . Glue width-, height- rectangles, each successive pair overlapping in a square of side . Their horizontal crossings and the vertical overlap crossings imply a crossing of the union, which has width . An overlap square has crossing probability at least . Thus the Harris lemma givesChoose fixed and large enough that for all sufficiently large . Increasing height and shortening width can only help, so uniformly for ,In particular it exceeds for every sufficiently large , with the bound depending only on .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 6 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Harris lemma says that, in any finite product of independent Bernoulli coordinates, two increasing events satisfyThe coordinates need not have the same parameter. For completeness, the same statement for increasing functions follows by induction on the number of coordinates. Conditional on the last bit, induction makes the conditional covariance nonnegative; the covariance of the two conditional means is . The covariance decomposition proves the induction step. Complementing both events gives the inequality for decreasing events too. Finite-cylinder approximation extends it to the countable product setting when needed.
For increasing events of a common probability , their decreasing complements giveTherefore the nth root trick isThis is a lower bound for an individual success probability when a symmetric union is very likely. Without equality of the individual probabilities, the conclusion applies to their maximum. Independence among the is not required.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 5 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Harris theorem for square-lattice bond percolation asserts , and hence . Work in the dual square lattice, declaring a dual bond open precisely when its primal bond is closed. At this is again independent bond percolation of density one half.
Around a square centered at the origin place four dual rectangles of dimensions by , one on each side, with overlap squares at the corners. Long crossings of all four must meet in the corner squares and their union contains a dual circuit surrounding the central square. The fixed-aspect crossing bound and the Harris lemma give this dual barrier a probability at least , independent of .
Take geometrically increasing integer radii, for example with a factor of eight, and shift by half a lattice spacing to lie on the dual lattice. The four-rectangle annuli then have disjoint bond sets. Their barrier events are independent. An infinite primal open path from the origin would have to avoid every closed dual circuit, so the independent annular barriers for percolation giveLetting provesThe extension to smaller follows by the monotone coupling of Bernoulli percolation. Translation and a countable union also show that no infinite open cluster exists anywhere at .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 5 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We first derive the reflected attachment estimate for percolation. Put , , and . Let require an open vertical crossing of together with an open path in attaching it to the right side of . ThenTo prove this, explore the leftmost vertical open crossing of , revealing bonds on and to its left, but none strictly to its right. One can implement this exploration by following the boundary of the set accessible from the left using closed dual bonds; its right boundary is the extremal open crossing when that crossing exists. Thus fixing its outcome leaves right-side bonds in their original independent distribution.
For each possible explored , reflect its geometry in and join it to its reflection to obtain a bottom-to-top separator of . This reflected portion is only a geometrical separator and is not presumed open. Let and mean that an open path from the right boundary reaches, respectively, the lower or upper half of , staying to its right until its endpoint. Any horizontal open crossing of , followed from right to left until its first meeting with , witnesses at least one of these events. Reflection in swaps and and preserves the independent measure. HenceThe bonds tested by remain unexposed after specifying ; conditional on that exploration its probability is still the unconditional one for this deterministic separator. Its occurrence attaches the genuinely open lower crossing to the right side. Average over to obtain the attachment estimate.
Now take and , with common corner square . Use , its horizontal reflection in , and a horizontal open crossing of . The last crossing meets the vertical crossings of in both attachment events, so these three events give a horizontal crossing of . All three events are increasing events, so the Harris lemma gives
For all aspect ratios, glue a width-, height- rectangle to a width-, height- rectangle with an overlap square of side . Their horizontal crossings and an overlap vertical crossing imply a crossing of their union. Again the Harris lemma givesAdding a -wide rectangle therefore yieldsFor height , let , so and . Choose an integer . For , we have ; restricting to height and extracting a shorter horizontal crossing givesFor , the horizontal bottom-row path gives whenever the allowed integer exists. Thus one may take . This proves the requested uniform rectangle crossing in bond percolation bound, rather than assuming the Russo-Seymour-Welsh theorem.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 5 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the induced square lattice rectangle with lattice spacings as its side lengths. An open left-to-right crossing and a top-to-bottom crossing of closed dual bonds are mutually exclusive: their embedded paths must intersect, and a primal open bond cannot have its crossing dual bond closed. They are exhaustive. Indeed, explore all vertices connected to the left side by open paths. If that exploration does not reach the right side, the interface separating the explored set from the right side supplies a top-to-bottom path of closed dual bonds. This is the planar crossing alternative for dual bond percolation.
For a primal rectangle of width and height , the dual crossing can be represented using the dual columns at and the exterior rows at . The terminal portions can be moved horizontally along the wired top and bottom boundary, so the random edges involved have exactly the law of a vertical crossing of a rectangle of width and height . ConsequentlyThis is why the boundary offset is needed; one cannot simply assert that a finite square has crossing probability exactly one half. For and , the second term is the same as the first after rotation and translation. ThereforeShortening a rectangle can only help a horizontal crossing, so as well.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Partition bits into tribes of size , and let the tribes function be one when some tribe consists entirely of ones. Permuting tribes and permuting bits within a tribe acts transitively on the coordinates, so this is a transitive increasing event. Under independent bits of density , its exact success probability isChoose . Then , while . For fixed , its unique -quantile isPut . Expanding givesThus, for fixed ,This positive window prevents an improvement to in the Friedgut-Kalai sharp threshold theorem. Moreover, as the fixed error parameter tends to zero, the displayed logarithmic coefficient is , so the theorem's logarithmic error dependence is also optimal up to constants. This last comparison takes for each fixed ; the expansion is not being claimed uniformly for arbitrarily tiny -dependent errors.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We prove the following precise form of the Friedgut-Kalai sharp threshold theorem. There is an absolute such that, for a nontrivial transitive increasing event , , and , its success probability increases from to over an interval of length at mostIn particular, and , with , imply . Here denotes independent bits equal to one with probability . Symmetry means invariance under a permutation group acting transitively on the coordinates, not necessarily invariance under all coordinate permutations.
Use the allowed weighted-cube influence theorem in this exact form: an absolute exists such that, for every , , and zero-one Boolean function of mean under , some coordinate has pivotal probability at least . A coordinate's pivotal event is determined by the other coordinates and means that the two possible values of that coordinate give different outputs. This uniform form is a consequence of the weighted Kahn-Kalai-Linial theorem; it applies to nonsymmetric functions as well.
Write . Differentiating the finite product expression for , one coordinate at a time, givesThe last equality uses monotonicity, so each summand is the pivotal probability. This derives the Margulis–Russo formula in the normalization being used. Transitivity makes all the influences equal; applying the weighted influence theorem therefore yieldsNontriviality ensures throughout . Dividing and integrating the derivative of the log odds givesAt the two specified quantiles the left side is . Taking proves the window bound and, with a strict starting inequality, the asserted strict final inequality. This is the sharp threshold conclusion, rather than an assumption about a discontinuous finite- probability curve.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put and . If the assertion is immediate. Otherwise, supposeSince , this makes , so is sufficiently small to apply the maximum-influence logarithmic lower bound once is large. That bound givesFor all sufficiently large , the last quantity exceeds , contradicting . The choice of sufficiently large is independent of . Therefore
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Work on the unbiased Boolean hypercube with values for the coordinates and for . Write its Fourier-Walsh transform asThe flip-probability influences satisfyThese factors of four are essential for zero-one . If , the conclusion is immediate. Otherwise suppose, for a contradiction, that , where . Take small enough that . The high-level Fourier weight obeysThis proves the first intermediate claim, including when is not an integer.
Set and . For the discrete derivative of a Boolean function, has magnitude exactly on a set of measure . Beckner's inequality, in the precise form for the noise operator on the Boolean hypercube, yieldsFor , concavity of shows that is at least the smaller endpoint value , and this is at least since . Therefore the low-level Fourier weight gives the second required intermediate bound:On the other hand, and the assumed bound on giveCombining these inequalities would imply . But and , so the inequality is impossible. ConsequentlyIn fact, this proof needs sufficiently small but no separate lower bound on .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 13 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
With a cyclically oriented independence digraph of events, each event is independent of one of the other two. Independence is symmetric, so all three pairs are independent events. This does not imply mutual independence. Put . The inclusion-exclusion principle givesbecause . Thus the oriented case guarantees positive avoidance exactly when .
For sharpness, for any prescribe the law of the three event indicators by assigning mass to each of the three singleton success patterns, to each doubleton, to the tripleton, and zero to the zero-success pattern. All masses are nonnegative and their sum is one. Each marginal isand each pair intersection has mass . These events satisfy the oriented independence conditions and have zero avoidance probability.
The unoriented triangle imposes no independence conditions at all: every vertex is adjacent to every other. The union bound gives positive avoidance if . To see that this is sharp for every , use uniform measure on the circle of circumference one and take three arcs of length starting at . They cover the circle. Hence the unoriented case guarantees positive avoidance exactly when .
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






