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 37 5 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Right censoring occurs when a subject's exact failure time is unobserved but it is known that , where is the censoring time. The observed pair is and . For example, a living participant at study closure contributes a survival lower bound rather than a recorded death at closure. Right censoring differs from simply omitting the subject: time spent in the risk set remains informative.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 2 c ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Put and . Both events consist of loops surrounding ; lies in the disc of radius , so its loops remain in . Translation invariance and the pointed representation implySince , cancel it. Outer boundaries commute with translation, and is exactly . HenceThe half-disc condition ensures that translating a relevant filled Brownian trace still lies inside the original unit-disc cutoff. This proves the asserted event identity; it does not claim translation invariance of the entire measure rooted at .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 2 c i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Restrict first to loops surrounding . This satisfies the pointed restriction property, so for one constant ,A single rooted pushforward cannot equal the whole : it only sees loops surrounding its root. The rest is recovered by moving that root.
For , choose a disc automorphism with . Conformal restriction yieldswith the same constant. Let be a countable dense set in . Every simple loop contained in surrounds one of these points. Make this cover disjoint by . For a measurable event of loops in ,This explicitly relates the entire loop measure to the single-root measure without overcounting a loop once for every point in its interior. It also proves that knowledge of , up to normalization, determines . Nontriviality gives : otherwise all countably many pointed patches would vanish. Using the usual unrooted Brownian loop measure, the same construction is commonly expressed as its outer-boundary pushforward, up to a constant.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 2 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let be the outer boundary of a planar compact set applied to the Brownian loop. For the pinned Brownian measure here, its outer boundary is almost surely simple and surrounds its root. If is simply connected, thenThe forward implication uses the fact that filling a compact subset of a simply connected domain cannot leave that domain. For the converse, the Brownian trace is contained in the closed filled interior of its outer boundary, and that interior also lies in . This is precisely why simply connected domains are used.
Let , a pushforward measure on simple loops surrounding . Its deficits areThey agree with those of and . The recovery argument from part (i), now with explicitly finite deficits, givesIf , the measure is zero on every cutoff window and hence zero. The rooted Brownian loop itself is not a simple loop; taking its outer boundary is essential.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 2 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let be the normalized maps, and put . A simple loop in has its interior there, so applying preserves the property of surrounding . There is a disjoint decompositionThe conformal restriction property identifies the measure of the second set with . ThereforeThe composition fixes and has positive derivative there, so it is exactly the normalized map onto . No interchange of infinite differences is needed: the argument is additivity on disjoint sets. The later logarithmic expression is consistent with this identity because .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 2 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use finite cutoff windows to avoid subtracting two infinite masses. Write for the unit disc, on loops surrounding , and . For , let . These increase to all loops in surrounding as .
On the finite-mass windows, the domain-containment events form a pi-system. Indeed, if are simply connected and contain , a simple loop surrounding that lies in both has its filled interior in both. It therefore lies in the component of containing , which is simply connected. Thus, on the support of ,Inclusion-exclusion for the finite deficits givesTaking and subtracting from gives the useful recovery formulaThe assumed generation of the loop sigma-field by domain-containment events and the uniqueness theorem for measures now determine the finite restriction to . Increasing these windows recovers ; conformal transport recovers its restriction to any simply connected domain containing the marked point. If a simply connected domain omits , no loop in it can surround .
The argument uses finite annular deficits. This is the usual local-finiteness convention for these loop measures and is explicitly ensured by the finite logarithmic formula assumed in the continuation. Bare sigma-finiteness must not be used as permission for formal subtraction. This is the recovery of a loop measure from conformal deficits.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 1 d iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The time-changed diffusion has generator . For , its boundary hitting probability from a diffusion scale function isTo see this directly, stop the scale local martingale on and pass to . Exit from occurs in finite clock time: the scale density behaves as and the speed density as , so the usual scale-times-speed exit integral is finite at . More explicitly, with the finite-interval diffusion exit Green kernel givesThe equation follows by differentiation and the derivative jump at , so stopping the corresponding Itô identity gives this exit bound. The integrand near is ; elsewhere it is bounded. At large the drift is bounded, excluding explosion at infinity in finite clock time.
Here is why these exits describe the original swallowing event. In clock time,If hits at finite , its integrated stochastic differential equation shows : the Brownian term has a finite limit and both positive drift integrals must then have finite limits. Consequently , hits zero and stays positive. This gives .
Conversely is finite by part (b). If its clock ends at a finite value, the diffusion must hit ; an interior endpoint with positive would leave positive. If the clock runs forever without hitting , the standard one-dimensional scale classification gives escape to infinity whenever . This cannot represent a strict swallowing event, which has and . Hence the surviving event represents . This reasoning also explains why a simultaneous collision must be treated separately rather than assigned the boundary value at .
For , the scale is unbounded. The maximal inequality for a nonnegative supermartingale gives ; letting rules out escape. Finite-interval exit then forces a hit at . For , taking givesThe strict-event probability is also positive, since for finite .
For , first intersect the probability-one strict-order events over rational . The real boundary flow gives nondecreasing swallowing times on . For any , choose rational ; then . This proves the simultaneous assertionThe range is positive points, as in the definition of ; reflection reverses the ordering on the negative axis. At the printed endpoint , each fixed positive point has . Thus if equality of extended times is allowed, but there is no finite simultaneous-swallowing assertion there. The preceding formulas assume .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 1 d iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For any function , the Itô formula and the ratio equation giveThe bracket is zero for the functions just found. On compact localized intervals the stochastic integrand is bounded, so the stochastic integral is a martingale. Removing localization proves that , on , is a local martingale. It is nonnegative because and .
In particular it is a nonnegative local martingale, hence a supermartingale after the usual stopping and extension by its endpoint limit. This is the justification for using its maximal inequality; it is not automatically an unstopped uniformly integrable martingale.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 1 d ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
As , . ThereforeThus every positive solution is unbounded when κ ≥ 8, including the logarithmically divergent critical case. For , by contrast,For example the substitution identifies this normalizing constant as , with both beta function parameters positive.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 1 d i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Differentiate once less than might seem necessary: writing turns the equation intoUniqueness for this first-order linear equation also covers the solution . Thus every solution has . Since , the derivative is integrable at . The specified boundary value fixes the additive constant, givingThe strict positivity forces ; gives the zero function. These are all the positive solutions. The function is the increasing scale function of a one-dimensional diffusion for the ratio process.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 1 c ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Put , and . Before , order preservation gives and . The common noise cancels from their difference:Since has finite variation, applying the Itô formula to gives the SLE two-boundary-point ratio diffusionWith the strictly increasing clock , the Dambis-Dubins-Schwarz theorem yields a Brownian motion for which the time-changed process obeysThe sign of the new Brownian motion has absorbed the minus sign above.
The domain Markov property of a chordal Loewner chain says that, conditionally on the past before , the mapped future is a fresh SLE. Its boundary marked points are . HenceLocalize, for example, where , and . On each such stopped interval this is a bounded conditional-expectation martingale, and therefore a genuine martingale. No smoothness assumption on is needed for this argument. The exit calculation below identifies it explicitly.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 1 c i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For , define . Differentiating the Chordal Loewner equation givesBrownian scaling makes have the original driver law. The corresponding hull is , soThe time scaling applies to the whole coupled hull process. In particular, the joint law of swallowing times satisfies .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 2 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let be the increasing events that an infinite simple open ray in a graph starts at the indicated side and immediately leaves the box, with all later graph vertices outside it. A corner exit is assigned according to the direction of its outgoing edge. The four events have the same probability by rotational symmetry. Their union is from the preceding step.
The Harris-FKG inequality applies to these exterior-ray events by approximation with finite connections to larger boxes and passage to decreasing limits. Positive association of the four decreasing events , by iterating the Harris-FKG inequality, givesEquivalently, one may apply the preceding square-root bound for increasing events first to the two opposite-side unions and then to the two individual sides of one pair. ThereforeA union bound now showsChoose such that . ThenThe infinite exterior clusters touched by these two sides need not be the same. The same argument works for dual boxes and any sufficiently large size; this permits the matching primal/dual contours used in the full proof.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 30 2 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Assume . The event that some infinite percolation cluster exists is invariant under lattice translations. By translation ergodicity of Bernoulli percolation, its positive probability is therefore one.
Let be the event that an infinite percolation cluster meets the finite graph vertex box . These increasing events increase with , and their union is the event that some infinite percolation cluster exists. Continuity from below of a measure givesAn infinite percolation cluster meeting contains an infinite simple open ray in a graph from a graph vertex of the box. This follows from local finiteness and the König infinity lemma. That ray visits the finite box only finitely many times; its last box graph vertex lies on the boundary, and the subsequent ray is outside. Thus is also the event that the box boundary intersects an infinite percolation cluster, and is the union of the four exterior-side arm events.
Consequently, for every , choose withFor any sufficiently large still satisfies the strict inequality. No uniqueness assertion is needed for this preliminary step.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 28 3 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For each finite place , choose such that is the unramified quadratic extension. Such a choice exists even at residue characteristic two. At odd residue characteristic use a unit with nonsquare residue. At residue characteristic two, choose for which is irreducible over the finite residue field, lift to , and set . The lifted polynomial has unit derivative at every residue point and gives the unramified degree-two extension; its root is .
The square classes are open in . Indeed the strong form of Hensel lemma applied to at shows that is a square whenever . Thus any sufficiently close approximation to has square. By weak approximation for number fields, choose satisfying this at every finite . Then the local extensions are all unramified of degree two. At least one such condition ensures is not a square in . If contains no finite place, impose the same condition at one auxiliary finite place.
Set . At every specified finite prime there is one prime of above it, with ramification index one and residue degree two. Hence . The dyadic case is covered by the unramified construction, rather than by a nonexistent nonsquare residue unit in characteristic two.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 28 3 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The idele group is the restricted productwith componentwise multiplication and the restricted product topology on the idele group relative to the unit groups at finite places. We need weak approximation for number fields only at the finitely many specified coordinates, not density in the full restricted-product topology.
Here is a proof including the Archimedean places. At each finite place in , choose sufficiently close to , using the definition of the completion. Choose a nonzero clearing their denominators. Pick powers so that whenever . Put . For each positive rational integer coprime to the rational primes below these places, the Chinese remainder theorem gives with . All of satisfy the same congruences.
Under the Minkowski embedding of a number field, is a full lattice in . A fundamental parallelepiped is bounded, so every real vector is within a fixed distance of this lattice, uniformly over its translates. Choose a target vector whose coordinates at the specified Archimedean places are those of , assigning arbitrary values at the other Archimedean places. There is within that fixed distance of the target. Dividing by makes all specified Archimedean errors tend to zero as through the allowed integers. At finite places is a unit, so the earlier congruence bounds persist. By taking the initial approximations sufficiently close, the ultrametric inequality gives the requested errors there too. Thus some satisfies every required inequality. If there are no finite places, set and omit the congruences.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 28 1 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Take the formal Laurent series field , with the least exponent of a nonzero term and . Its value group is , so this is a discrete valuation. A Cauchy sequence has an eventually stable coefficient at every exponent, and its tail has a common lower bound on its exponents. The stabilized coefficients therefore give a formal Laurent series field element to which the sequence converges. Hence is complete.
Its valuation ring is , and its residue field is the infinite field . If were locally compact, the previous compact-ball argument would make compact. Its quotient by the open ideal would then be compact and discrete, hence finite, contradicting its identification with . Thus .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 28 1 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The compactness and completeness proved above apply again. The finite ring has a positive integer characteristic , so and . Prime factorization supplies a prime with . In characteristic zero the restriction to is therefore a positive power of the p-adic absolute value, by the preceding classification. Completing embeds the P-adic number field into the complete field .
Now is open, so is finite. It is an -vector space; choose lifts of a basis. Successively reducing modulo gives, for every ,Convergence in follows from . Every element of becomes integral after multiplication by a power of , so . Consequently : is a p-adic field. This finite-module proof does not assume discreteness of the original value group in advance.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 28 1 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Write . First, is compact. A compact neighborhood of zero contains a sufficiently small closed ball , since ; that ball is closed in the compact neighborhood. Scaling back proves compactness of . Also is complete: a Cauchy sequence has a tail in a translate of a compact neighborhood, hence a convergent subsequence, and the Cauchy condition makes the whole sequence converge. This is the completeness of locally compact nontrivially valued fields argument.
The additive subgroup is open: a sufficiently small ball around any of its points stays in by the ultrametric inequality. Thus the compact discrete quotient is finite. Choose a set of representatives, with zero representing the zero coset. For , recursively choose and such that , beginning with . ThenFor arbitrary , multiply first by a large power of to put it in , then divide the resulting expansion by that power. This gives the digit expansion with a nonuniformizer.
For uniqueness, take the first exponent at which two expansions differ. After dividing their difference by , all the later terms belong to the closed subgroup , whereas does not, because the representatives are distinct. The difference cannot be zero. Conversely every series with coefficients in and only finitely many nonzero negative-index terms converges by completeness and . Every element therefore has a unique expansion , with the harmless initial zero coefficients understood as part of the same indexed series. No assumption that is a uniformizer is needed.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 21 4 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let and choose a profinite Sylow subgroup at the prime . Its image in every finite quotient of is a Sylow -subgroup. Put . Every finite intermediate field has degree prime to , because its corresponding open subgroup contains . Condition (iii), together with the preceding Kummer reduction, gives for each such field. The cohomology continuity at closed subgroups property saysfor a discrete -module . Applying it to gives .
The action of the pro-p group on is trivial. Indeed it maps continuously to , whose order is prime to ; every finite image of is a -group, so that image is trivial. Choosing a primitive root identifies this module with the trivial module . Thus .
We spell out why this controls arbitrary -primary coefficients. A finite discrete -primary -module has a composition series with trivial factors: its action factors through a finite -group, whose only simple module in characteristic is the trivial one. Induction through the long exact cohomology sequence therefore gives vanishing of for every such finite module. Any discrete -primary -module is the filtered union of finite -stable submodules. The orbit of an element is finite by continuity, and its orbit generates a finite abelian -group. Continuous cohomology commutes with these filtered unions, sofor every discrete -primary module . This is the mechanism behind trivial coefficients detect the cohomological dimension of a pro-p group.
Now let be any discrete -primary -module and . Its restriction to is zero. Continuity at the closed subgroup makes its restriction zero in some open . The index is prime to , and the restriction-corestriction identity in group cohomology for the corestriction map in group cohomology givesBut has -power order, so multiplication by is invertible on the cyclic group it generates. Hence . This proves for all discrete -primary . Dimension shifting through an acyclic coinduced module gives vanishing in every higher degree, which is exactly .
Therefore (iii) implies (i), completing the equivalence of all three conditions. The key reason prime-to- extensions suffice is that they approximate a pro- Sylow subgroup, where the cyclotomic module becomes trivial; prime-to- transfer then detects every -primary cohomology class.
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





