For increasing events under a finite Bernoulli distribution product measure, first assume all parameters are at most . Write and for last-coordinate sections. The zero-section of their disjoint occurrence of increasing events is ; its one-section is . The intersection in this union contains . If , and the last parameter is , mathematical induction bounds disjoint occurrence by . The product of the two marginal probabilities exceeds this bound by . For a larger parameter , replace that coordinate by the logical disjunction of independent bits with parameter . Disjoint original witnesses lift to disjoint bit witnesses. Apply the small-parameter inequality and then pass to degenerate parameters by continuity.
Disjoint occurrence of increasing events Created 2026-10-06 Updated 2026-11-05
A finite open coordinate set witnesses an increasing event when prescribing those coordinates open forces the event, regardless of the remaining configuration. The disjoint occurrence of increasing events means that and have disjoint finite witnesses. For finite-coordinate events this is the usual disjoint-occurrence definition. The Van den Berg-Kesten inequality bounds its probability by under an independent Bernoulli distribution product measure.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 28 1 Solution Created 2026-10-03 Updated 2026-10-14
In bond percolation on the square lattice, every nearest-neighbour edge independently has state one, meaning open, with probability , and state zero, meaning closed, with probability . Thus the configuration law is the product measure . An open path in bond percolation uses only open edges. An increasing event satisfies : opening further edges cannot destroy the event.
The Harris-FKG inequality for two increasing events isFor disjoint occurrence of increasing events, write when disjoint sets of open edges separately witness and , so each event is forced by its own witness regardless of the other edges. The Van den Berg-Kesten inequality statesFor events given by cylinder sets these are finite-coordinate assertions. Connection events have finite open-path witnesses; truncating to finite boxes and taking increasing limits gives the same disjoint-occurrence bound for them. Sharing a vertex between the two witness paths is permitted; sharing an edge is not.
For , take a simple open path from the origin to the radius- boundary and let be its first vertex on the radius- boundary. Its initial segment witnesses . If is its final vertex, then . Consequently the remaining segment reaches , and its initial portion until that visit witnesses . The two segments use disjoint edges. HenceThe union bound, Van den Berg-Kesten inequality and translation invariance of the product measure now give the weighted BK boundary-splitting estimateFor the same bound follows directly from the union bound, with . With the conventional , gives equality.
Write for the percolation cluster of the origin. By summing its membership indicators, the percolation susceptibility isIf it is finite, then . For , choose with . Iterating the boundary-splitting estimate with this fixed givesFor , , so . To handle all smaller positive radii without an unspecified prefactor, observe that . ThereforeFor , the second chosen rate gives , and for larger the first rate applies. At both sides equal one. The endpoint has for every , so any positive rate works; is excluded by finite susceptibility. This proves exponential one-arm decay from finite susceptibility with the required unit prefactor.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 38 2 Solution Created 2026-10-03 Updated 2026-10-14
Order configurations coordinatewise: means that every open edge of is open in . An increasing event satisfies . For , let be the configuration with exactly the edges of open. For increasing events,The disjoint sets are open witnesses: fixing those edges open forces the respective events whatever happens elsewhere. This is disjoint occurrence of increasing events. The BK inequality states that under the independent density- product measure,Disjoint occurrence means disjoint witnesses, not disjoint events.
Now take the lattice rectangle with width and height . Make the dual bonds open exactly when the primal bonds they cross are closed. A primal open left-right crossing and a dual open top-bottom crossing cannot coexist: the two curves must intersect, requiring a bond and its crossing dual bond both to be open. Conversely, if no primal left-right crossing exists, the boundary separating vertices reachable from the left side from the right side contains a closed-bond dual top-bottom path. One obtains it by tracing the interface of the left-reachable set; it cannot terminate in the interior, and it separates the two vertical boundary sides. Thus exactly one of the two crossing events occurs.
For the precise dual dimensions, its vertices have coordinatesThe top and bottom rows are the terminals of dual edges crossing the primal boundary horizontal bonds. Initially no horizontal bonds along these two terminal rows are needed. Adding independent density- horizontal bonds there does not change a top-bottom crossing event: an initial run along the top row can be removed by starting at its last vertex, and a final run along the bottom row can be removed similarly. The completed dual rectangle has width and height . Rotate it through a right angle and translate it: its top-bottom crossing has exactly the law of the original left-right event at density . Therefore
Write and . This event is determined by finitely many bonds, since a path can be stopped on first hitting that boundary. On , erase loops from a crossing path and choose a vertex where it meets the middle column. Its two portions run to the left and right boundary respectively, each reaching distance at least from . Stop each portion at its first radius- boundary hit. The two portions have no common edges, giving disjoint witnesses for twice. HenceThere are exactly relevant middle-column vertices. The additional hinted vertex at is outside this rectangle and need not be included. Translation invariance, the union bound and the BK inequality yieldThe cluster radius is its maximum distance in the norm, taking value for an unbounded cluster; thus . Taking square roots proves the square-lattice one-arm lower bound from disjoint occurrence
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 26 3 b Solution 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 2014 iii Paper 28 2 Solution Created 2026-10-03 Updated 2026-10-06
Use the coordinatewise partial order: means for every . An increasing event is upward closed: and imply .
Under the independent Bernoulli distribution product measure on these coordinates, the Harris-FKG inequality statesfor increasing events . For , let be the cylinder of configurations agreeing with on . The disjoint occurrence of increasing events consists of configurations for which there exist disjoint with and . For increasing events, witnesses can be taken to prescribe only open coordinates. The BK inequality isPositive association rewards simultaneous occurrence; the disjoint-witness requirement in the BK inequality gives a bound in the opposite direction. The inequalities also apply to different independent Bernoulli parameters in different coordinates.
Regard the boxes as sets of lattice graph vertices. Write , and put . On the event defining , choose an open self-avoiding walk from the origin to its first visit to . Let be its first visit to . Its initial segment witnesses . Its remaining segment ends at a point withFor , truncate this remaining segment on its first visit to . The two segments use disjoint edges, so they are disjoint witnesses. For , the second event is the sure event with empty witness. Thus the union bound, the BK inequality and translation invariance giveAn unrestricted connection event can depend on infinitely many edges. Apply the finite-coordinate BK inequality first to connections confined to growing boxes and take increasing limits; each occurrence has a finite path witness. This justifies its use here. The estimate is the weighted BK boundary-splitting estimate.
By summing cluster indicators and using Tonelli theorem, the percolation susceptibility isIf , then . At all vanish, so any positive exponential rate works. Otherwise choose with . Iterating the weighted BK boundary-splitting estimate gives, for with ,For , , so . To include the finitely many smaller indices without a prefactor, note that under finite susceptibility andTherefore one may takeFor this follows from , and for it follows from the iterated estimate. This proves exponential one-arm decay from finite susceptibility with exactly the requested unit prefactor.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 204 1 b Solution Created 2026-10-03 Updated 2026-10-14
Order configurations coordinatewise: means for every edge. An increasing event is a measurable set such that and imply . Opening additional edges cannot destroy an increasing event. The Harris-FKG inequality, the product measure version of the FKG inequality, statesfor two increasing events. Equivalently, bounded coordinatewise increasing random variables satisfy . The event inequality also holds for two decreasing events, by taking complements.
For disjoint occurrence of increasing events, a finite open edge set witnesses in if every configuration agreeing with on belongs to . Since is an increasing event and all edges of are open, this says that the configuration with exactly open already forces . Define to consist of configurations admitting disjoint finite witnesses for . For events depending on finitely many edges, this is the usual disjoint-occurrence definition; it also applies to finite-connection events on the infinite graph. The Van den Berg-Kesten inequality statesOn a countable graph, its finite-witness version follows by taking increasing unions over finite edge sets. The Harris-FKG inequality concerns simultaneous occurrence, whereas the Van den Berg-Kesten inequality requires separate certificates using disjoint coordinates.