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 2013 iii Paper 27 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use the Chordal Loewner equation with Loewner driving function , and set . Before the Loewner swallowing time,The upper-half-plane branch of the logarithm has imaginary part . The Itô formula givesand therefore the SLE angle process satisfiesAt the drift vanishes. Since , the stopped local martingale is a true bounded martingale, and the SLE4 angle martingale is global for each fixed point almost surely, using fixed-interior-point avoidance of SLE4 for the simple parameter-four Loewner trace.
Conversely, take . If this semimartingale were a local martingale, uniqueness of its finite-variation decomposition would force throughout every compact interval before swallowing. Because , for this would force to be identically zero on such an interval. Its Brownian component has quadratic variation , which makes that impossible. Thus for positive , the martingale parameter is exactly four.
If the degenerate value is admitted, there is one exception to a fixed-point reading of the assertion: for on the positive imaginary axis the deterministic flow stays on that axis until swallowing, and is constant. For all starting points simultaneously, the unique parameter giving the martingale property is still four.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 27 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
As printed, the lower bound needs a connectedness hypothesis. This illustrates that radius gives no positive lower bound for disconnected harmonic hull capacity. A compact H-hull need not have connected closure. To see the obstruction, take , set , and use three disjoint vertical slits,Their complement in the complex upper half-plane is a simply connected domain: the three slits attach to the real boundary, and create no interior holes. Symmetry shows that the smallest enclosing half-disc is centred at zero and has radius one. More explicitly, any real centre has maximum distance to the two outer tips at least , while the unit half-disc contains every slit. Also and has modulus one.
For a vertical slit of height , the mapping-out function of a vertical slit maps its two faces onto an interval of length , so its harmonic capacity from infinity in the upper half-plane is . Subadditivity of harmonic hull capacity, from the union bound for the Brownian hitting events, givesThus the requested conclusion does not follow from the printed assumptions.
The intended reflection lower bound for harmonic hull capacity works when the closure is a connected continuum joining the two specified points, as for a slit hull. Reflect in the vertical line through , using . The reflected continuum joins to . Together the original and reflected continua form a barrier between infinity and the segment together with the real interval between and . One can first verify this separation for polygonal simple arcs, then use decreasing connected neighbourhoods of the continuum. Hence, for Brownian motion started at , large, reaching or the real interval between and requires a hit of the original or reflected barrier. Reflection symmetry and the union bound giveFor the connected slit setting, the real attachment endpoints have zero harmonic measure, so the last event may be written with .
For , use the branch of the square root fixed by hydrodynamic normalization at infinity:The two slit faces together have image length . The interval has image length , by the square-root formula on the appropriate real side. Thus the image length of is . Multiply the probability inequality by and use part (i); the allowed starting approach includes . We obtainunder the stated connected-barrier interpretation. If , the model slit is empty and has length , giving the same lower bound by the real-interval argument. The connectedness repair is essential, as the explicit three-slit counterexample demonstrates.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 27 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The capacity in this question is harmonic capacity from infinity in the upper half-plane, which has units of length; it is distinct from half-plane capacity, which has units of length squared.
Here is a proof of existence that also works with irregular real attachments. The functionis bounded and harmonic on , by the Strong Markov property and the mean-value characterization of harmonic functions. Therefore is a bounded harmonic function on the complex upper half-plane, with a Poisson kernel representationThe boundary function vanishes outside a bounded interval. Indeed, far enough along either real ray the original domain contains a half-disc neighbourhood, and extends there; the probability of hitting the bounded hull before the real boundary tends to zero as the starting point approaches that ray. Applying the same dominated-limit calculation as in part (i) yieldsWhen the intrinsic boundary pieces landing on the hull are identified, is their indicator almost everywhere and this is the length of their image under . For ordinary finite slit hulls this is exactly the image of , since real attachment endpoints have zero harmonic measure. The Poisson representation avoids requiring that boundary identification in the general existence argument.
If , couple the two exit events using the same planar Brownian motion, stopped at its first hit of the real axis. Any path that hits before the real axis also hits before the real axis. Consequentlyand taking the limits proves monotonicity of this capacity.
For a half-disc of radius centred at , the mapping-out function isIts semicircular boundary maps onto , of length . Hence its harmonic capacity from infinity in the upper half-plane is . Withenclose in such a half-disc and use monotonicity. Letting the enclosing radius decrease to the infimum provesThe same conclusion holds if radius is instead measured about a specified real centre.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 27 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use the intrinsic boundary of a simply connected domain, so different approaches to the two sides of a slit remain distinct. The mapping-out function extends as a homeomorphism from this intrinsic compactification to that of the complex upper half-plane. Set . The imaginary coordinate of planar Brownian motion hits zero in finite time almost surely, and is no larger than that time. Thus and continuity gives a finite Euclidean exit point.
By conformal invariance of planar Brownian motion, is a planar Brownian motion in the complex upper half-plane, run with clockThe terminal clock cannot be infinite: that would make the transformed Brownian motion stay in the upper half-plane forever. It cannot stop while the transformed path is in the interior either, since continuity of would then put the original exit point inside . Hence the terminal clock is precisely the transformed Brownian exit time. The transformed path converges to a real boundary point, and applying the extended inverse proves almost sure convergence to a point of the intrinsic boundary.
Write , and let . The point at infinity has zero harmonic measure. Conformal invariance of planar Brownian motion and the Poisson kernel for the upper half-plane giveThe hydrodynamic normalization at infinity gives , so along the specified approach and . For each fixed real ,If , dominated convergence applies because is eventually bounded. If , Fatou's lemma makes the limit infinite. This proves the harmonic-measure asymptotic at infinitywith the equality understood in the extended nonnegative reals.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 26 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For every site, . This event depends only on edges with both endpoints in : any connecting path can be stopped on its first hit of that boundary. Since , , so all clusters have finite radius almost surely, by a countable union over sites. Set the radius of an isolated site to zero.
Write . It suffices to take , since larger error intervals contain one such interval. For any small , the decay-rate limit gives, for all large ,For the upper tail use and a union bound:provided .
For the lower tail let . Choose sites in spaced by in each coordinate. Their radius- boxes are vertex-disjoint, so their local connection events are independent. There are such sites for large . If , none of these events occurs. Thuswhereif . Choose one satisfying both restrictions. The integer choices give the required strict inequalities. Thus the maximum cluster radius under exponential one-arm decay has convergence in probability:The logarithmic box-packing loss does not change the leading constant .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 26 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A connection to a box boundary can be witnessed by a finite self-avoiding open path stopped at its first boundary hit. On the event of reaching radius , split such a path at its first graph vertex . Its prefix witnesses connection from zero to within . Its remaining segment reaches a point with , so ; truncate it at its first hit of . The two witnessing edge sets are disjoint, giving disjoint occurrence of increasing events.
Use the BK inequality: for increasing finite-coordinate events in a Bernoulli product measure, , where the square means disjoint open-edge witnesses. For each fixed , the first event has probability at most , and the second has probability exactly by translation invariance. A union bound over givesThe two boxes can overlap, so replacing BK by an independence claim would be incorrect. Restricting each event to paths stopped at its local boundary makes all the relevant coordinate sets finite, as required by the stated inequality.
Put and . Here , so . A fixed straight open path of length gives . Part (a) therefore gives the almost-subadditive percolation decay rateIn particular the limit is finite for the prescribed .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 26 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Fix and write with and . Repeatedly use the given inequality with its second index equal to . This yieldsThere are only finitely many possible remainders for fixed , soTaking rules out positive infinity for this upper limit. Let , which may be negative infinity, and choose with . The assumption then gives . This also works when , by taking an arbitrarily negative upper bound. Therefore the asymmetrically almost-subadditive sequence hasThe last infimum identity follows from the fixed- bound and from the convergence of the corrected ratios to . No positivity assumption on is required.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 26 1 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Consider a walk in the replaced graph that starts and ends in . Each passage through a triangle enters at one port and leaves at a different port. It cannot revisit that triangle: the first passage uses at least two of its three vertices, whereas a later completed passage would need two previously unused ports. Nor can it immediately return through its entry port, since that would repeat a graph vertex. Contracting each passage therefore gives a self-avoiding walk in ending in .
Conversely, each length- walk of this kind in visits distinct vertices of . At each one, its incoming and outgoing ports determine exactly two routes through the triangle: the direct internal edge or the two internal edges through the third port. Including the two external edges, these have lengths three and four. The choices at distinct triangles are independent combinatorial choices, so that walk contributes to the new generating function. This triangle replacement for self-avoiding walks givesFor , the square-root argument increases strictly from zero to infinity. Nonnegative coefficients and the radius from part (iii) therefore give the unique positive thresholdThis identifies the radius of the restricted series, without assuming that the new graph has equal counts from every graph vertex.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 26 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The bipartite graph property means that a walk starting in ends there precisely when its length is even. Thus the even-length walk generating function on a bipartite graph is . Deleting the last edge of an odd-length self-avoiding walk leaves an even-length one; each such prefix has at most possible last-edge choices. Hence , and for ,These inequalities also hold with infinite values. Their finite positive prefactor shows that the two power series have the same radius of convergence ; alternatively apply the root formula to the even subsequence.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 26 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The equal rooted counts imply that the self-avoiding walk generating function is . The Cauchy-Hadamard theorem identifies the radius of a power series as the reciprocal of . ConsequentlyEquivalently, the root test gives convergence when and divergence when . At the positive boundary , the preceding infimum formula gives , so this particular series diverges there as well.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 26 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A self-avoiding walk is a finite sequence of graph vertices in which successive vertices are adjacent and no graph vertex is repeated; its length is , the number of edges. Include the zero-length walk.
Split a length- walk from into its first edges and remaining edges. After fixing the first segment, the number of possible suffixes is at most , since forgetting the prohibition on revisiting its earlier vertices can only increase that number. Thus , and taking the supremum givesEvery finite-radius ball is finite because degrees are bounded. An infinite connected graph has vertices arbitrarily far from each root, so shortest paths give . Also for : after the first edge, an immediate reversal is forbidden. In particular and these suprema are finite.
Apply the Fekete lemma: a real subadditive sequence satisfies , allowing negative infinity. Here , so the limit is finite. The uniform connective constant of a bounded-degree graph is therefore
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 6 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For the drifted Brownian motion on , the diffusion generator is . Seek a bounded solution of with . The exponential ansatz givesBecause , the plus root is positive and the minus root is negative. Boundedness on therefore selectsIt satisfies the boundary condition and all hypotheses of part (d). HenceThis is the first-passage Laplace transform for Brownian motion with drift, with . At it reduces to . As , it gives , agreeing with certainty of hitting when the drift points towards zero and a possible escape when it points away.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 6 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
On the event , continuity puts on the boundary, where . The limit found in part (c) is therefore , defining this expression to be zero when . Taking expectations and using the bounded convergence justified in part (c) givesThe conclusion does not require almost-sure finiteness of . It is the discounted boundary-hitting representation for a bounded solution of .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 6 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Continuity and adaptedness make the first boundary hit a stopping time. A continuous path starting in the open domain cannot leave it before meeting its boundary. Thus , with the usual interpretation when . If on this set, thenThe stopped process is a bounded local martingale; the bounded local martingale criterion makes it a martingale and, in fact, a uniformly integrable martingale. The martingale convergence theorem gives almost sure and convergence as .
Its limit can also be identified pathwise. On the stopped process is eventually constant at . On its absolute value is at most and hence tends to zero. Thus the limit is .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Apply the Itô product rule to the deterministic discount factor and :The prescribed differential equation makes the drift vanish. ThereforeThis is the discounted generator-eigenfunction martingale underlying the Feynman-Kac formula.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 6 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let . The multidimensional Itô formula gives the second-order diffusion generatorIndeed,The integrand is locally bounded along the continuous path after stopping on compact sets, because the coefficients and derivatives are continuous. Thus the final stochastic integral is a local martingale. No global growth or uniqueness assumption on this already-given weak solution of a stochastic differential equation is needed.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 5 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Fix . The given normal distribution and part (d) implyOne can deduce determinism without any moment assumption on the bracket. Put . Taking gives and , so . Therefore almost surely. Applying this at every rational time and using continuity of quadratic variation gives simultaneously for all outside a single null set.
The Lévy characterization of Brownian motion states that a continuous local martingale starting at zero with this bracket is Brownian motion in its filtration. To see the independent-increment conclusion directly, the Itô formula shows that is a martingale on any fixed bounded time interval: it is a local martingale with a deterministic bound on its modulus. ThusThe deterministic conditional characteristic function identifies an increment independent of . Together with the given path continuity and , this proves is Brownian motion.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 5 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
At the terminal time, , so the martingale from part (c) has terminal value . Its initial value is , since . Taking expectations givesHere may be a nonconstant -measurable variable; the tower property of conditional expectation still gives . This characteristic function under conditionally symmetric martingale increments identity relates the characteristic function of the terminal martingale to the Laplace transform of a nonnegative random variable given by its quadratic variation.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Put . The Itô formula givesThe explicit decreasing exponential contributes half the finite-variation term; the other half is the quadratic correction from . Now the Itô product rule and part (b) yieldThe finite-variation terms cancel because . This proves the product is a local martingale. Moreover and . The bounded local martingale criterion therefore proves the product is a true martingale.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let be the quadratic variation. We use bilinear quadratic covariation for the complex martingale: . The Itô formula givesBy the Itô product rule, the finite-variation part of isPart (a) says the product is a martingale, so uniqueness of the continuous semimartingale decomposition makes this finite-variation part zero. For , division givesFor , and both sides are zero, so the identity holds without exception.
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






