WorksMathematics
Generic arm separation for planar percolation models
Abstract
Arm separation is an important technical tool in the study of critical and near-critical planar percolation systems. When combined with RSW estimates, it proves quasi-multiplicativity of arm-event probabilities, links the derivatives of different events and allows the identification of universal arm exponents. We provide a very generic statement of arm separation that applies to arbitrary planar percolation models. Our argument is based on exploring configurations conditioned on the existence of arms in such a way that "exposed" arms are revealed with positive probability. The exploration algorithm is independent of the percolation model and applies to all polychromatic arm events. As an application, we prove a strong arm-separation result for critical planar FK-percolation.
Introduction
Arm separation is a fundamental tool in the study of planar critical and near-critical percolation. An arm event denotes the existence of disjoint paths of prescribed colours joining the two boundaries of an annulus. Informally, arm separation states that, conditional on such an event, the arms can be chosen so that their endpoints on the outer boundary are separated by distances comparable to the outer radius, with uniformly positive probability. An analogous statement applies at the inner boundary.
Arm separation was introduced by Kesten [23] for planar Bernoulli percolation; see [27] for a detailed exposition. Its usefulness lies in the room it provides to extend arms and join them to other paths using Russo–Seymour–Welsh (RSW) estimates. Keeping the endpoints sufficiently far apart allows these connections to be constructed with uniformly positive probability, which is crucial when comparing events across different scales. Arm separation is thus a technical but essential ingredient in a wide range of applications, including quasi-multiplicativity [23, 27, 7, 11], the derivation of scaling relations [22, 23, 27, 17, 18, 10], the construction of incipient infinite clusters [21 Jár03, 14 BS17], noise sensitivity [30, 16 TV25] and identification and comparison of arm exponents [31, 5 KSL25, GM25, 28] to name just a few.
In this paper, we define a related geometric property, which we call exposition. An exploration algorithm will reveal the configuration step by step and, conditional on the arm event, will produce exposed paths of the prescribed colours with uniformly positive probability. These paths will have adjacent unexplored regions through which suitable crossings may be glued to them. The algorithm is the same for every percolation measure and requires no assumptions such as RSW estimates, positive association or independence.
Unlike classical proofs, which intertwine exploration and RSW techniques, our approach completely separates the geometric and probabilistic aspects of arm separation. We show how to explore the configuration in order to produce exposed arms. One may then use RSW estimates to glue these arms to desired destinations.
As an illustration, we use our approach to produce a strong arm-separation result for critical FK-percolation. This separation property applies to any polychromatic arm event (even non-alternating) in an annulus (with ) and will separate the arms on the outer boundary. It holds even conditionally on the configuration in . A precise statement is provided in § 5.
Definitions and main result
A tiling of the plane is a family of closed, bounded sets, called cells, with pairwise disjoint interiors and whose union is . We assume that every cell is simply connected and bounded by a simple closed curve of finite length. Furthermore, we restrict our attention to locally finite tilings, meaning that every compact set of the plane intersects only a finite number of cells. Finally, we require that no point belongs to the boundaries of more than three cells.
A percolation configuration on is an element of , viewed as an assignment of colours to the cells of . Cells of colour 0 are called closed, while those of colour 1 are called open; these will be represented by yellow and blue1, respectively, in all figures. A percolation model is a probability measure on the set equipped with the standard cylinder -algebra. No further assumptions are imposed on or at this stage.
Fix and . Let denote the box of radius centred at , and set . We write for its topological boundary and for the closed annulus of inner radius and outer radius . Finally, for any subset , we write for the union of cells of intersecting .
A colour sequence is an element of for some . We call it polychromatic if it contains both values 0 and 1, and monochromatic otherwise.
A cell-path is a finite sequence of distinct cells in which consecutive cells are adjacent. Two cell-paths are disjoint if they have no cells in common. For a configuration , a cell-path is called open (resp. closed) in if all its cells are open (resp. closed) in .
Furthermore, a cell-path in is said to be a crossing of the annulus if it contains a cell intersecting and a cell intersecting . We say that contains arms of colours if there exist disjoint cell-paths crossing , indexed in counterclockwise order, such that is open (resp. closed) if (resp. ). The paths are called arms and we write for the event corresponding to their existence. See Figure 1 (left) for an example.
Figure 1. Left: A percolation configuration on a tiling . The annulus is depicted in black. The configuration contains six arms corresponding to the colour sequence . Right: An exploration that exposes each arm. The exposing tubes are marked in red; the exposition zones are the unexplored regions surrounded by bold red lines.
Our approach crucially relies on explored sets. Loosely speaking, an explored set is a union of cells of that is measurable in terms of the colours of the cells it contains, along with a source of randomness independent of the percolation configuration2. We will actually use the term “explored” in a more restrictive sense — see Definition 4 below.
A tube of quality at scale is the union where are distinct points belonging to a common translate of with for all and with . The starting box of is and its ending box is . A crossing of is any continuous curve in starting in and ending in .
Given an explored set , a cell-path is said to be -exposed towards the outside if
,
there exists a tube of quality at scale contained in , whose starting box lies in and such that
any crossing of necessarily intersects and
the connected component of the start of in — henceforth referred to as the exposition zone of in — is disjoint from .
We will also say that is exposed by in . One can define a similar notion of -exposition towards the inside by considering tubes of quality at scale , contained in with their starting box contained in .
Finally, we say -exposes paths of colours towards the outside if
,
contains disjoint cell-paths starting on , with each of colour , indexed in counterclockwise order and
the paths are -exposed towards the outside, with pairwise disjoint exposition zones.
See Figure 1 (right) for an illustration. A similar definition applies towards the inside.
Theorem 1 (Arm exposition). For any polychromatic colour sequence , there exist constants and such that the following holds. For any , any tiling of the plane such that all cells intersecting have diameter at most , and any percolation measure on , there exists an explored set such that
as long as the event in the conditioning has positive probability. An analogous result applies for exposition towards the inside.
Remark 2. A similar statement for monochromatic arm events is only available in a simply connected setting — see Theorem 3 below. We were unable to prove such a statement for the annulus. However, in many applications involving monochromatic arm events, separation may be replaced by applications of the FKG inequality.
Comments and applications
Minimal assumptions. It may be surprising that Theorem 1 applies to any percolation measure, with no assumption of properties of criticality, most notably the RSW property. Note however that the exposition of the different arms is generally only useful when combined with versions of the RSW, Spatial Markov and FKG properties.
Uniformity over percolation models. It will be apparent from the proofs that the set Exp is revealed by an exploration algorithm (formalised as a decision tree in § 2) that queries the colours of cells one by one. When successful, the algorithm produces an explored set that -exposes the desired paths. The same algorithm is used for all percolation models and its probability of success is bounded below by a positive constant depending only on the colour sequence . This allows us to state the theorem uniformly over percolation models on tilings.
Probability of success. The probability of success in (1) may be rendered arbitrarily close to 1 by shrinking . Indeed, for fixed , taking small enough, one may force the exploration in Theorem 1 to satisfy
for any , without affecting the probability of success . Repeating the procedure in successive annuli of “thickness” yields independent attempts at exposition, so that the overall probability of success is at least . Taking small enough renders the probability of success arbitrarily close to one.
Robustness. The interpretation of percolation as colourings of cells allows one to incorporate site or bond percolation models on any bi-periodic planar lattice, and much more. Bond percolation is recovered by viewing the colour 0 as the dual percolation model, while site percolation is recovered by viewing closed cells as the closed vertices, with the connectivity notion given by the matching graph. See Figure 2 for examples of cell representations of bond and site percolation on .
Figure 2. Left: A bond percolation on the square lattice and its interpretation as a colouring of cells. The cells corresponding to vertices are all blue (open), while those corresponding to faces are all yellow (closed). The cells corresponding to edges are coloured depending on the state of the corresponding edge. Right: A site percolation on the square lattice and its interpretation on the same graph of cells . Here the cells corresponding to edges are all blue and those corresponding to faces are all yellow. The cells corresponding to vertices carry all the randomness.
Theorem 1 also applies to less classical settings, such as Voronoi percolation or percolation on random planar maps, and, with a natural adaptation, to Boolean percolation, where balls of random radius are placed in the plane according to a Poisson point process. In the latter setting, arm events for alternating colour sequences are defined exactly as above. A separate definition is needed to make sense of several consecutive arms in the occupied set, while the corresponding notion for the vacant set does not make sense.
We believe that those interested in applying Theorem 1 in these non-standard settings will find it easily adaptable.
One caveat applies to models such as Voronoi or Boolean percolation, where the tiling itself is random. Theorem 1 may be generalised to this case with Exp revealing both the colour and the shape of each explored cell. We will not detail this here, as the adaptation is immediate. We do however warn the interested reader that, in such contexts, the knowledge of the cell shapes in may affect the RSW estimates in the unexplored regions. For more background on RSW estimates in Voronoi and Boolean percolation, see [32, 1] and [2], respectively. It is worth mentioning that the quenched result of [1] may actually allow one to perform arm exposition by first revealing the Voronoi tessellation and then applying the algorithm of Theorem 1 on it.
Motivation. The present work is mainly motivated by applications to critical FK-percolation, where RSW techniques give lower bounds on the probability of open and closed crossings of tubes of given quality. Combined with the FKG inequality and the spatial Markov property, these estimates allow one to construct crossings in unexplored regions and glue them to exposed paths. This is the basic mechanism underlying arm separation.
The classical proofs of arm separation for Bernoulli percolation [23, 27] extend to FK-percolation when suitable RSW estimates are available. For alternating arm events, the usual box-crossing estimate (see (RSW)) is sufficient. For general colour sequences, a complete proof for FK-Ising percolation is given in [7], using stronger RSW estimates for arbitrary topological rectangles. The same approach extends to using [11], but does not cover , where these stronger estimates are expected to fail.
Our argument treats arbitrary polychromatic colour sequences using only RSW estimates uniform over boundary conditions at macroscopic distance. These estimates remain valid at , so our approach provides a unifying framework. Moreover, it yields a stronger arm-separation result which we describe next.
Strong arm separation under conditioning. An important consequence of our approach is that arm separation remains valid under arbitrary compatible conditioning in the inner annulus . Indeed, fix a configuration in under which has positive conditional probability. Since Theorem 1 applies uniformly over percolation measures, it also applies to the FK-percolation measure conditioned on the fixed configuration in .
To turn the exposed paths into a more standard notion of well-separated arms (see Definition 7), we use RSW constructions in the exposition zones. As we will show in the proof, these zones lie at macroscopic distance from the conditioned region. The spatial Markov property and the uniformity of RSW estimates over boundary conditions at such distances therefore give a positive lower bound on the probability of these constructions, independently of the prescribed configuration in . This yields arm separation uniformly under this conditioning; see Theorem 8 for the precise statement.
In particular, our approach implies the “super-strong” separation statement conjectured by Garban, Pete and Schramm in [17 Conjecture A.4]. A half-plane version was previously obtained in [13] for critical site percolation on the triangular lattice. Our result covers the full-plane case and extends this form of separation to critical FK-percolation.
Exposed crossings in rectangles
An intermediate step in our proof is an exposition result similar to Theorem 1, but for crossings of quads (that is, topological rectangles). We state it in the context of Euclidean rectangles for simplicity.
For , define , with its four sides denoted , , and , in counterclockwise order, starting from the top. For a colour sequence , let be the event that contains disjoint cell-paths from to of colours when indexed from left to right.
An explored set is said to -expose a cell-path towards the top if
,
there exists a tube of quality at scale whose starting box is contained in ,
any crossing of necessarily intersects and
the connected component of the start of in — henceforth referred to as the exposition zone of in — is entirely contained in the unexplored part of .
As before, we will also say that is exposed by in . That the exposition zones are required to be above the height is similar to them being required to be outside of in Theorem 1. It ensures that the exposition actually occurs near the top boundary of the rectangle.
Finally, we say -exposes crossings of colours towards the top if
,
contains disjoint cell-paths starting on with each of colour , indexed from left to right and
the cell-paths are -exposed towards the top, with their exposition zones being disjoint.
Theorem 3. For any colour sequence , there exist constants and such that the following holds. For any , any tiling such that all cells intersecting have diameter at most and any percolation measure on , there exists an explored set such that
as long as the event in the conditioning has positive probability.
Unlike Theorem 1, this result also applies to monochromatic colour sequences. Indeed, the fact that the rectangle has natural notions of left and right boundaries — which boils down to it being simply connected — renders the proof simpler. Actually, we deduce Theorem 1 by cutting the annulus so that it becomes simply connected without altering the arm event, then applying Theorem 3. In the cutting step, we use that the colour sequence is polychromatic to explore an interface.
Structure of the paper. In § 2, we formally define the notion of explored set. § 3 contains the proof of Theorem 3, which is then used in § 4 to show Theorem 1. Finally, § 5 contains consequences for FK-percolation.
Exploration algorithms
As stated in the introduction, the explored set will be the result of an exploration procedure. Such a procedure consists of revealing a random configuration cell by cell, with the choice of the next cell to be revealed depending on all previously revealed information and, potentially, on an external source of randomness that is independent of . We formalise this notion using decision trees.
Decision trees
Fix a tiling and a configuration . For a sequence of cells and , we write and . Write for the collection of ordered -tuples of cells, so that . We will sometimes slightly abuse notation and also write for the set whenever it is convenient.
A decision tree is an initial cell and a set of functions for . It should be seen as associating to each pair of revealed cells the next cell to reveal. In particular, we ask that .
When the decision tree is fixed, we write for the unique sequence starting with and such that for all . In the rest of the paper, we will interpret decision trees as exploration algorithms and refer to them as such.
A stopping time for is a random variable taking values in which is such that is measurable with respect to . The set of cells explored up to the stopping time (including the order in which they were revealed) is and the configuration revealed at that time is .
We call a decision tree random if both the choice of and the functions also depend on an external source of randomness, which may be encoded by a sequence of independent uniform variables on which is independent of . The notion of stopping time adapts readily, by imposing that is measurable with respect to .
Definition 4. An explored set is a random set of cells of for which there exists a random decision tree and a stopping time such that .
Interface exploration
An important example is the exploration of an interface between open and closed cells. See Figure 3 for a helpful illustration.
Figure 3. Interface exploration: A domain surrounded by the black curve, with three points on the boundary. The exploration path starting at and ending on the arc is depicted in red. The cells of adjacent to the arcs and are considered open and closed, respectively. Only the cells in adjacent to the exploration path are explored (brighter colours).
Let be a finite union of cells whose boundary is a simple closed curve. Let and be three distinct points on the boundary of , placed in counterclockwise order, each at the interface of three cells, with exactly one of the three cells belonging to . Write , and for the three boundary arcs going in counterclockwise direction.
The exploration curve will be a path of edges of started from such that all cells on one side of are of one colour and all cells on the other side of are of the opposite colour. For definiteness, we describe an exploration following edges with closed on the left and open on the right. To ensure that remains inside , we impose open boundary conditions on the arc and closed boundary conditions on . This will be made precise below. The remaining arc, including its endpoints and , is the target at which the exploration stops.
We write and for the sequence of vertices and oriented edges3, respectively, visited by . Set . To properly initialise the procedure, we also define as the unique edge between the two exterior cells incident to , oriented towards .
At each step , first check whether lies on the target arc . If so, stop the exploration. Otherwise, proceed as follows.
For , let be the unique cell in incident to . For , let be the unique cell incident to that is not incident to the incoming edge . If belongs to , reveal its colour (unless it has already been revealed) and let be the unique outgoing edge adjacent to that preserves closed on the left and open on the right. If lies outside , use the boundary condition imposed above. More precisely, the following rules should be applied for :
(i) if and is open, let be the outgoing edge to the left as seen from ;
(ii) if and is closed, let be the outgoing edge to the right as seen from ;
(iii) if and lies on , pretend that is open and follow the same procedure as in (i);
(iv) if and lies on , pretend that is closed and follow the same procedure as in (ii).
After choosing the outgoing edge , denote its endpoint by . Recording the cells revealed during this procedure defines a decision-tree exploration.
Due to our imposition of boundary conditions and containing only finitely many cells, the exploration curve will reach the target after finitely many steps. In particular, the number of cells that are revealed before the exploration stops is finite and is a stopping time for the associated decision tree. Formally, the exploration is only defined up to , but one may continue the exploration after using arbitrary rules.
Exposition in a rectangle: Proof of Theorem 3
Before delving into the proof of Theorem 3, let us make some useful observations about the notion of tubes.
Cutting tubes
Recall that a tube of quality at scale is for a sequence of distinct points with for all and and some fixed translation vector .
We may cut any tube of quality at scale lengthwise into two tubes of quality such that and and have disjoint interiors. This is done as follows (see Figure 4 (right) for an example).
Figure 4. Left: A tube of quality at scale (in green) with the start and end marked by shaded squares. An exploration curve (in black) with the open side marked by a solid line and the closed side marked by a dashed line. Its open side is exposed in . The red crossing of the tube hits the open side of the exploration curve first. Right: The lengthwise cutting of into two tubes of quality . Each square is cut depending on the position of the previous and following box.
Denote by the polygonal path obtained by joining each consecutive pair of points and by a line segment for all . Extend the first and last segments to the boundaries of the corresponding starting and ending boxes such that they are cut in half. Note that naturally cuts each box of in two parts and that lie at its right and at its left, respectively. For each , and are each a union of one, two or three boxes for . On each side of , the subsquares can be ordered along the path to form a nearest-neighbour chain. Each chain contains at most squares and . Hence, we obtain tubes of quality by taking and .
An immediate consequence of this construction is that if a cell-path is exposed by in , then is also exposed by and in . Indeed, any crossing of is in particular a crossing of , and hence intersects ; and the connected component of the start of in is contained in the connected component of the start of in , which is unexplored by assumption. The same arguments apply to .
Proof of Theorem 3 for favourable tilings
Fix a tiling and a percolation measure . Also, fix , and as in the statement of the theorem. We start by proving the result in the case where all cells of have diameter at most and where is assumed to be large enough. Below, we will define different tubes of quality at scale . Since and even will be taken large, we may ignore cells crossing the boundary of the tubes. More precisely, we will suppose that and all tubes considered hereafter can be approximated by unions of cells. We will discuss these approximations and the case of more general tilings at the end of the proof.
A quad is a simply connected domain with four marked points , , , on its boundary in counterclockwise order. This defines four boundary arcs , , and , which we also call the bottom, right, top and left of , respectively. Below, all quads will be unions of cells, so one can perform the interface exploration described in the previous section in these domains.
Proof of Theorem 3. Recall that is the length of the colour sequence . Since the scale at which we work is fixed, we will omit it from notation. In particular we henceforth write -exposed and tube of quality without referring to the scale .
Since the result is stated with no assumptions on the percolation measure, we may work under .
We will construct by progressively revealing interfaces up to different stopping times . At each stage, we may have , which means that the exploration procedure failed. The procedure is successful if and we set .
Set for . At the end of stage , if then the following conditions are satisfied.
There exist indices and with such that the explored region contains cell-paths and of colours and , respectively, that are -exposed. Write for the tubes of quality exposing the paths ; they will all be defined on a common translated grid.
If , we will also have a tube that is disjoint from the above and which exposes4 the segment . Similarly, when , we have an additional tube , disjoint from the above, and which exposes the segment .
(2) The explored part at this stage satisfies and the unexplored part is a simply connected domain. Moreover, when , the intersection of with the bottom of is exactly the segment of the latter contained between the starting cells of and . We call this the bottom of .
(3) There exist a.s. disjoint cell-paths from the bottom of to the top of , avoiding and , ordered from left to right, of colours . These paths may use both unexplored and explored cells, but no cells of and .
See Figure 5 and Figure 6 for illustrations.
Figure 5. The green tube is ; its start and end are shaded. This tube exposes the left side of the rectangle. On the right, a primal path has been explored. The explored region at this stage is hatched; the red tube is .
Figure 6. An example of an exploration (hatched) at stage assuming . The black paths are and ; they are exposed through the tubes and , respectively. These tubes are cut lengthwise into and (green) and and . The quad is depicted in yellow.
We will construct the exploration inductively and simultaneously check the points (1), (2) and (3) above. At the end, we will bound the probability that . As mentioned before, an external source of randomness will be used during the procedure. This will be encoded by a series of i.i.d. uniform variables in .
Initial step: To start, set , and let
and
be -shaped tubes; see Figure 5 for an example. These two tubes expose the left and right side of the rectangle, respectively. They only serve to initialise the induction process. Set and . All points are clearly satisfied when . For completeness, we set and . This is a slight abuse of notation since the other will refer to cell-paths.
Induction step: construction. Let and consider the exploration up to stage , assuming that . In particular, this means that conditions (1), (2) and (3) are satisfied at step . Proceed as follows for step of the algorithm.
Cut the tubes and lengthwise. Write for the left half of the former and for its right half. Similarly, write for the right half of the latter and for its left half. For and , cut the tube lengthwise and set to be the left half if and the right half if .5 Observe that the tubes for and are indeed of quality .
We now define a quad ; see Figure 6 for an illustration. Consider the curve obtained by following the left boundary of from the top of up to the first time it reaches the boundary of a cell of — denote this point by . Then, continue extending by following the boundary of down to the first time it reaches the bottom of . Observe that the curve connects top and bottom of . We write for its endpoint on the bottom of .
Let be defined similarly, using the right boundary of and instead of . Denote by the point where the boundary of meets the boundary of a cell of for the first time and by the endpoint of on the bottom of . The fact that the boundaries of the tubes intersect and , respectively, is guaranteed by their respective exposition.
By point (2), the horizontal segment is exactly the bottom part of . Let be the last point of on when is considered as a curve oriented towards . Similarly, let be the last intersection of with this horizontal line. Write for the horizontal segment between and . Let be the region delimited by the horizontal segment , the sub-arc of , the horizontal segment and the sub-arc of ; see Figure 6. By closely following the definitions of and , one may notice that the cells of and are outside of ; some of them being adjacent to the arcs and of the quad .
Note that has length at least . Write for its midpoint. The points defined above lie on the boundary of and are distributed in counterclockwise order. The arc of contains the segment .
As a consequence of point (3), the quad is crossed from to by disjoint paths of colours ordered from left to right.
If , we set to be the leftmost6 cell-path in of colour from to . This path is revealed by using the interface exploration in the domain with marked points , started from and with on its right and on its left. More precisely, is a subset of the cells on the right side of this interface. See Figure 4 (left). We then say that step is successful if the endpoint of is to the left of , i.e., on the arc .
Similarly, if , let be the rightmost path in of colour from to . Then, we say that step is successful if the endpoint of is to the right of , i.e., on the arc .
At this stage, if the exploration is successful, further reveal the state of all unexplored cells that are disconnected from the top of by the explored part. Set to be the end of this exploration step. If the exploration is not successful, reveal the state of all cells in arbitrary order and set .
Induction step: checking conditions. We now prove that, if the exploration is successful at step , then the points (1), (2) and (3) are satisfied at time . Assume we are in the first case , where we explored from the left. The case is handled analogously, with the roles of left and right interchanged. Assuming that step is successful, we have that the endpoint of is on the arc .
We start with point (1). Recall the tubes defined above for and . Their exposition zones are indeed disjoint and do not intersect . As such, they are not affected by the exploration between and , and exposes the corresponding paths for and .
Define the tube as follows — red tube in Figure 7. Follow from its start up to the first box contained in — such an intersection necessarily occurs since exposes in , which is entirely below the level . Then use boxes contained in to connect to . Finally, follow to its end. By the fact that exits on the arc , any crossing of necessarily intersects . The construction of guarantees that the connected component of the start of in is entirely unexplored. Thus is exposed by in .
Figure 7. A case where and (in thick black) lands left of . The cells explored between and are all in , left of . Then is exposed in the unexplored part by the red tube .
Furthermore, the exposition zone of in is disjoint from the exposition zones of in with and . Finally, all are of quality by definition.
Point (2) is clear from the construction. Indeed, the exploration guarantees that is simply connected. Furthermore, since is contained below the line , all explored cells are also contained in this part.
Finally, for point (3), we observe that, since was the leftmost path of colour crossing , the other paths of colours are contained between and .
Conclusion: Set . Observe that, if , then indeed -exposes crossings of colours towards the top for .
Probability of success: We turn to estimating the probability of success of the process. Observe that if then, at step , for any possible configuration in the unexplored region, the leftmost crossing of from to of colour lies to the left of the rightmost crossing of colour . Recall that the existence of these two crossings is a consequence of point (3). As such, at least one of the following holds:
the leftmost crossing of from to of colour exits left of or
the rightmost crossing of from to of colour exits right of .
We conclude that for any (undiscovered) configuration, for at least one of the cases or . Thus
and by repeated applications of the above, we obtain the desired result:
Proof of Theorem 3 for general tilings
We turn to the case of general tilings. Fix such a tiling and a percolation measure on . Moreover, fix , and as in the statement of the theorem. Let be the quantity obtained in Section 3.2. We will prove the theorem for .
Applying the same algorithm as in Section 3.2, we obtain explorations and tubes of quality . Explored cells intersecting the tubes that are used to expose certain paths may however overlap. As such, these tubes do not satisfy the requirements of the theorem. To accommodate this, we replace each tube by a narrower tube lying strictly inside it.
The hypothesis of the theorem requires that all cells of intersecting have diameter at most . In particular, this bound applies to every cell revealed by the exploration. As such, each tube contains a tube of quality at scale , whose start is contained in the start of , whose end is contained in the end of and such that the distance between and is at least .
The algorithm above, together with the paths and the tubes satisfies the conclusion of the theorem.
Exposition in an annulus: Proof of Theorem 1
Fix all quantities as in the statement of Theorem 1. As in the proof of Theorem 3, we will assume that our measure is already conditioned on , and thus that . We will see later how to choose and , depending only on the length of the colour sequence. As stated in the theorem, we assume that all cells of intersecting are of diameter at most .
Since is polychromatic, there exists at least one open/closed interface crossing the annulus from to . Our algorithm will consist of two steps. First, we explore an interface starting from up to . This will allow us to cut the annulus in order to reduce the problem to a quad as in Theorem 3. In the second step, we apply a slight variation of the algorithm of Theorem 3.
Interface exploration in annuli
We start by describing how to explore an interface from up to the first time it exits . Note that, since is assumed to occur, at least cells intersect . After a small perturbation of , we may also assume that contains no triple point of .
Fix an arbitrary ordering of the edges of crossing and orient each of them outwards. Examine these edges in the chosen order, revealing their adjacent cells if they have not been revealed previously. Do so until an edge separating opposite colours is found. Starting from this edge, follow the interface, preserving the colours on either side of the interface, until it either exits or returns to . In the former case, stop the exploration. In the latter case, consider the next unexplored edge crossing and proceed as before. Repeat the procedure until the exploration exits .
Due to our assumption, at least one interface exists between and . As such, the exploration above does eventually reach , and stops. We denote by the set of all edges examined during this procedure, excluding those intersecting which separate cells of same colour. See Figure 8 for an illustration.
Figure 8. The explored edges, starting at the marked point on , with the ordering being given by the counterclockwise order. The exploration process stops when reaching .
The purpose of the exploration above is to represent the arms of as crossings of a suitable quad to which we can adapt the argument of Theorem 3. The important property of the set of edges is that no arm of can cross since these edges are between cells of opposite colour. So one may view as a union of walls that cuts the annulus into disjoint connected components. There is a unique connected component of that contains — we denote this component by . Since the arms producing may not cross , they all occur in . Note, however, that they may use revealed cells of on either side of .
At this stage is topologically still an annulus, and not a rectangle as desired. It does however have long stretches on its inner boundary where arms may not originate from: the part of the inner boundary formed by . We exploit this feature in the next section.
Remark 5. It may be tempting to actually explore the interface until it reaches , rather than stopping at . This would produce an unexplored outer region which is a topological rectangle. The problem with doing this is that the exploration may come arbitrarily close to several times before finally reaching . As such, the topological rectangle obtained above may degenerate, which would prevent the application of the algorithm of Theorem 3.
Producing a good quad
Recall that is the connected component of containing and that all arms occur in this topological annulus. After rotating the picture, we may consider that ends on the top side of . We now describe how to obtain a domain in which we may apply the algorithm of Theorem 3. Figure 9 provides a useful illustration.
Figure 9. A sketch of the procedure in Section 4.2. Left: The exploration of is depicted in blue and yellow. To be precise, is the edge-path between the blue and yellow sides. The horizontal lines are dashed. A domain is depicted in grey. We assume here that is good; the line is dotted and the points are marked. The exposition zones contained in and are green. Right: The grey region is the simply connected domain , with the marked points. We separated the two sides of for clarity. The target arc (which corresponds to the top of the quad) is depicted by a slightly bolder black line. Observe that the arcs and of correspond to the inside of , which is assumed to be good, and hence no arm originates from these arcs. Depicted in deeper colours are five arms, one open (dark blue) and four closed (orange). They are allowed to use the revealed cells on the boundary of . The purple lines play the role of the horizontal levels of Figure 6 and Figure 7.
Consider equally spaced points on the right side of :
Let be the line segment starting from and travelling horizontally to the left until it meets . We will actually approximate by paths of edges of ; by taking sufficiently small, we may assume that such approximate disjoint lines exist.
For , let be the connected component of that contains the part of between and . The regions are pairwise disjoint.
We now make a crucial observation. Fix a configuration such that occurs and choose arms realising the event. Each arm has a starting point on . Since there are regions and only starting points for the arms, at least one region contains no starting point of any of the chosen arms. We say that is good (for this configuration) if may be realised with no arms originating in .
In the final algorithm, one of the regions will be chosen uniformly at random. For now, we describe how to construct a quad in order to apply the algorithm of Theorem 3 for a fixed index , under the assumption that is good.
Let be the horizontal line segment starting from and running left until the first time it meets . As before, we use a discrete approximation using edges of .
We now set ; this is a simply connected domain. Define the four points (or rather prime ends to be more precise) in counterclockwise order on as follows. The left endpoints of and are and respectively. The left endpoint corresponds to both and ; is part of the boundary as seen from above, while is seen as part of the boundary of the lower part. We denote by , , and the four arcs of the boundary of . See Figure 9.
Let be the subset of lying on the inner boundary . Observe that does not intersect . Thus, in any configuration for which is good, there exist arms of colours prescribed by starting from and ending on the arc . To be precise, there exists a cyclic permutation of such that paths of colours cross between and , ordered from left to right. We denote this event by . The parts of created by the exploration of are not admissible as starting points for the arms but the arms may subsequently use cells adjacent to . The event will serve as the starting point for the induction in the proof of Theorem 3.
Let us also define the tubes appearing in condition (1) of the induction for the initial step. Set ,
and
and view them as tubes starting at their rightmost squares and ending at their leftmost squares. These are indeed tubes of quality . Observe that the tube exposes7 the boundary arc of the quad and the tube exposes the arc . See again Figure 9.
Assume that we know the cyclic permutation for which occurs. Then we may adapt the algorithm of Theorem 3 in the domain with the colour sequence . Indeed, at each induction step, we select the leftmost or rightmost crossing in among those starting on . The final additional detail needed is to define an equivalent for the horizontal strips used to switch between the left and right tube when constructing or in the induction step. In our case, these strips are defined as the intersections of with the annuli . Thus, the adaptation of the algorithm, if successful, produces an exploration in and disjoint tubes of quality that expose paths of colours towards the outside.
Conclusion
In conclusion, the algorithm for Theorem 1 is the following.
Explore starting from an arbitrary point on until it reaches .
Define the regions and choose uniformly in . Also, choose a cyclic permutation of uniformly at random.
Finally, attempt the algorithm of Theorem 3 in for arms of colours .
For any fixed configuration, there exists a chance of at least that step (2) correctly identifies a good and that is such that occurs. Thus, using the estimate of Theorem 3, we obtain a uniform lower bound on the probability of success of this algorithm. □
Application to FK-percolation
Theorems 1 and 3 expose arms without imposing any assumptions on the percolation measure. In this section, we show how exposition of arms can be combined with crossing estimates to obtain arm separation. We work with FK-percolation for concreteness. The argument relies on the spatial Markov property, positive association and RSW estimates (all of which will be recalled below). As explained in § 1.2, the notion of exploration and the result of Theorem 1 can readily be adapted to the case of bond percolation on . We shall use such an adaptation implicitly.
FK-percolation and the necessary tools
Let us start by briefly recalling the definition of FK-percolation and the properties that will be used below. For more detailed statements and proofs, see [19, 9, 26]. Let be a finite subgraph of with vertex set and edge set . A percolation configuration is the spanning subgraph of obtained by retaining the edges for which and discarding the others. Retained edges are said to be open while the discarded edges are said to be closed. A boundary condition is a partition of the boundary vertices of ; vertices belonging to the same partition element are identified.
For and , the FK-measure on with boundary condition is
where is the number of open edges in , is the number of connected components after the identifications prescribed by , and is a normalising constant. The case corresponds to Bernoulli bond percolation.
The dual configuration is defined by declaring a dual edge open precisely when the corresponding primal edge is closed. In the terminology of the previous sections, primal open paths have colour 1 and dual open paths have colour 0. See also the discussion in § 1.2 and Figure 2.
Throughout this section, we fix and , the critical parameter [3]. We suppress these from notation. Also write for the unique infinite-volume FK-measure on [12].
We will use the following form of the RSW estimates deduced readily from [12]. Recall the notion of tube of quality at scale and that of crossing of such a tube.
Proposition 6. For any there exists such that, for any large enough, any tube of quality at scale and any boundary conditions on ,
Note that the crossings in the above are not required to touch the boundary of ; they only need to connect the starting box with the ending box of . Thus, the inequalities above are indeed valid for all .
When working with (RSW) estimates, a particularly convenient property of FK-percolation is positive association: for any increasing events and and any graph and boundary conditions
Here, an event is increasing if opening additional edges preserves its occurrence. The same inequality holds for two decreasing events.
Finally, after an exploration, the spatial Markov property identifies the conditional law in the unexplored region as an FK-measure with the same parameters and with the boundary conditions induced by the revealed configuration.
Combining these properties allows us to construct crossings in the exposition zones and attach them to the exposed arms.
Flower domains and separated arms
We formulate separation of arms using flower domains, following [10]. A particularly convenient feature of flower domains is that they can be explored from one side while leaving the region on the other side unexplored.
For , the inner flower domain explored from to is obtained by exploring the interfaces of starting on and retaining the unexplored domain containing the inner box . Similarly, the outer flower domain explored from to is obtained by exploring the interfaces of starting on and retaining the domain containing the exterior of . See Figure 10 (left) for an illustration.
Figure 10. Left: The outer flower domain between scales and is -well-separated. This flower domain is revealed by exploring part of the hatched region. Some of the interfaces revealed during the process are drawn. Right: A realisation of the event . This event is revealed by exploring the outer flower domain between and and the entire configuration in . This correspond to the hatched region. In particular, the arms can be extended in the unexplored region by using the properties of FK-percolation.
The boundaries of these domains consist of alternating primal and dual arcs, called petals, or of a single primal or dual circuit. For the inner flower domain, the endpoints of petals lie on and for the outer flower domain, they lie on . An inner flower domain on is -well-separated if it contains at least two petals and any two distinct petal endpoints are at distance greater than . For an outer flower domain on to be -well-separated, the corresponding requirement is that the endpoints lie at a distance greater than .
Definition 7 (Separated arm events). Fix and . Let be the inner flower domain explored from to , and let be the outer flower domain explored from to . Let be the event that and are - and -well-separated, respectively, and that can be realised by arms connecting distinct petals of to distinct petals of , with each arm attached to petals of its own colour.
We write when only the inner separation is imposed and when only the outer separation is imposed. See Figure 10 (right).
Requiring distinct arms to use distinct petals also separates consecutive arms of the same colour; unused petals may lie between them. The well-separated petals provide enough room to continue the arms through additional crossings. The following theorem shows that imposing this separation costs only a uniformly positive factor, even when the configuration away from the target boundary is fixed.
Theorem 8 (Arm separation). Fix a polychromatic sequence . For sufficiently small , there exists such that the following holds for all :
separation towards the inside:
separation towards the outside:
separation in both directions:
Here, and denote fixed configurations on the respective annuli , and . Each inequality holds for every such conditioning of positive probability.
To experts, the above will appear as a direct consequence of Theorem 1 and the properties of FK-percolation, particularly (RSW). We prefer stating separation for FK-percolation in terms of flower domains, as these are explored using a standard algorithm, rather than the bespoke algorithm appearing in Theorem 1. Furthermore, flower domains and their exploration already appeared in [10 GM25] and seem particularly adapted to surgeries for FK-percolation and similar models.
Remark 9. In certain contexts, it may be useful to consider half-plane arm events, i.e., arm events where the arms are restricted to lie in a given half-plane. The notion of flower domain adapts naturally to this context, so one can prove an analogue of Theorem 8 for arm events in the half-plane by using the same method. This construction uses Theorem 3 directly, rather than Theorem 1. Thus, in the case of half-plane arm events, one is not restricted to polychromatic arm events.
From exposition to separation
We now explain how exposed arms can be extended to well-separated arms with uniformly positive probability. Several variants of this construction will be used below, depending on the direction of exposition and the configurations already revealed. For clarity, we state the outward version with the configuration in the inner part of the annulus revealed. The particular radii chosen below only serve to provide a macroscopic buffer between the revealed configuration and the regions used to construct the connections.
Lemma 10 (Extending exposed arms). Fix a sequence and sufficiently small. Then there exists such that the following holds for all . Fix a configuration on $\operatorname{Ann}(r,R/2) and consider the FK-measure conditioned on . Suppose that an exploration -exposes paths of colours $\sigma towards the outside by only revealing edges in . Write $\omega_{\mathrm{exp}} for the revealed configuration. Then,
as long as the conditioning is non-degenerate.
Proof sketch. The lemma follows by a standard (RSW) construction which we sketch here. Fix a realisation of the configuration , and a realisation of the exploration; we write for the explored configuration and for the explored set. Write for the arms exposed by the exploration.
First, we explore an -well-separated double -petal flower domain between and . This consists of the inner flower domain explored from to and the outer flower domain explored from to . We say that they form an -well-separated double flower domain with petals if each has petals, with the corresponding petals connected in by disjoint paths of the appropriate colours, and both are -well-separated. See Figure 11 for an example. It is a direct generalisation of [10 Lemma 3.4] that, for any , there exist and such that
Figure 11. A double -petal flower domain between and for . This domain is revealed by exploring the corresponding inner and outer flower domains and ; the resulting explored region is hatched. Note that the petals of and are connected as required by the definition.
for any configuration as above.
Assume that the exploration of did produce an -well-separated double -petal flower domain. Select distinct petals of whose colours, in cyclic order, agree with .
By the exposition condition, there exist disjoint tubes of quality at scale such that, for each , any crossing of induces a connection in between and . Here is a constant depending only on and .
Assume now that is such that . Conditionally on , the exploration producing , and any configuration outside of , the measure inside dominates . Indeed, the only edges on the boundary of this domain that are contained in are those of or , which are open. As such, we find
with given by (RSW). Combining the two inequalities above yields
which concludes the proof.
Proof of Theorem 8. We first prove separation towards the outside; separation towards the inside can be treated similarly. Fix a configuration in and assume that . Apply Theorem 1 in the annulus to the arm event corresponding to . This yields an exploration that reveals no edges outside and, on success, exposes paths towards the outside of with some quality . Write for the configuration revealed by the algorithm. Since the exposition occurs with positive probability uniformly over the conditioning on , we have
with being the same constant as in Theorem 1.
Let us write for the event that -exposes paths of colours . We now work under the measure , without conditioning on the arm event. Lemma 10 gives
for any possible realisation of the explored configuration . Averaging over successful explorations, it follows from the previous inequalities that
Internal separation follows by the same argument using exposition and extension towards the inside instead.
We finally treat the case of separation in both directions. There is a slight subtlety here in that the outward exploration must preserve the distinct attachments to the inner flower domain obtained by the inward separation or vice versa. The following argument shows how the exploration algorithm can be adapted to deal with this issue.
Fix a configuration in . Averaging the separation estimate towards the inside over configurations outside gives
Fix now a configuration in such that . We now wish to apply the algorithm of Theorem 1 for the measure . While this measure is conditioned on having arms separated towards the inside, it may still be possible to find a family of arms that are not separated towards the inside. Thus, we have no guarantee that the algorithm of Theorem 1 exposes toward the outside a family of arms that are already separated toward the inside.
To overcome this small difficulty, we adapt the algorithm of Theorem 1 to only search for arms originating from distinct petals of . More precisely, change the definitions of and by taking (resp. ) to be the leftmost (resp. rightmost) path crossing the quad among those starting from an unused petal of .
Using this adapted algorithm and the same argument as for separation towards the outside gives
Averaging over and combining the two inequalities gives
which concludes the proof.
Statement on the use of AI
This work was entirely developed without the use of AI. AI was then used in proofreading selected passages, which were then rewritten manually.
Acknowledgements
This work was financially supported by the Swiss National Science Foundation (SNSF). The third author further acknowledges support from the swissuniversities “cotutelle de thèse” grant.
References
University of Fribourg, Switzerland Email address: [email protected]
University of Fribourg, Switzerland Email address: [email protected]
University of Fribourg, Switzerland and University of Innsbruck, Austria Email address: [email protected]
References
- [1]Daniel Ahlberg, Simon Griffiths, Robert Morris, and Vincent Tassion. Quenched Voronoi percolation. Adv. Math., 286:889–911, 2016.
- [2]Daniel Ahlberg, Vincent Tassion, and Augusto Teixeira. Sharpness of the phase transition for continuum percolation in R². Probab. Theory Related Fields, 172(1-2):525–581, 2018.
- [3]Vincent Beffara and Hugo Duminil-Copin. The self-dual point of the two-dimensional random-cluster model is critical for q ≥ 1. Probab. Theory Related Fields, 153(3-4):511–542, 2012.
- [4]Vincent Beffara and Hugo Duminil-Copin. Planar percolation with a glimpse of Schramm-Loewner evolution. Probab. Surv., 10:1–50, 2013.arxiv.org/abs/1107.0158
- [5]Vincent Beffara and Pierre Nolin. On monochromatic arm exponents for 2D critical percolation. Ann. Probab., 39(4):1286–1304, 2011.DOI
- [7]Dmitry Chelkak, Hugo Duminil-Copin, and Clément Hongler. Crossing probabilities in topological rectangles for the critical planar FK-Ising model. Electron. J. Probab., 21:Paper No. 5, 28, 2016.arxiv.org/abs/1312.7785
- [8]Federico Camia and Charles M. Newman. Two-dimensional critical percolation: the full scaling limit. Comm. Math. Phys., 268(1):1–38, 2006.
- [9]Hugo Duminil-Copin. Lectures on the Ising and Potts models on the hypercubic lattice. In Random Graphs, Phase Transitions, and the Gaussian Free Field, pages 35–161. Springer International Publishing, 2020.
- [10]Hugo Duminil-Copin and Ioan Manolescu. Planar random-cluster model: scaling relations. Forum of Mathematics, Pi, 10:e23, 2022.
- [11]Hugo Duminil-Copin, Ioan Manolescu, and Vincent Tassion. Planar random-cluster model: fractal properties of the critical phase. Probab. Theory Related Fields, 181(1-3):401–449, 2021.
- [12]Hugo Duminil-Copin, Vladas Sidoravicius, and Vincent Tassion. Continuity of the phase transition for planar random-cluster and Potts models with 1 ≤ q ≤ 4. Comm. Math. Phys., 349(1):47–107, 2017.
- [13]Hang Du, Yifan Gao, Xinyi Li, and Zijie Zhuang. Sharp asymptotics for arm probabilities in critical planar percolation. Comm. Math. Phys., 405(8):Paper No. 182, 51, 2024.arxiv.org/abs/2205.15901
- [14]Michael Damron and Artëm Sapozhnikov. Outlets of 2D invasion percolation and multiple-armed incipient infinite clusters. Probab. Theory Related Fields, 150(1-2):257–294, 2011.DOI
- [16]Christophe Garban, Gábor Pete, and Oded Schramm. The Fourier spectrum of critical percolation. Acta Math., 205(1):19–104, 2010.
- [17]Christophe Garban, Gábor Pete, and Oded Schramm. Pivotal, cluster, and interface measures for critical planar percolation. J. Amer. Math. Soc., 26(4):939–1024, 2013.arxiv.org/abs/1008.1378
- [18]Christophe Garban, Gábor Pete, and Oded Schramm. The scaling limits of near-critical and dynamical percolation. J. Eur. Math. Soc. (JEMS), 20(5):1195–1268, 2018.arxiv.org/abs/1305.5526
- [19]Geoffrey Grimmett. The random-cluster model, volume 333 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 2006.
- [21]Harry Kesten. The incipient infinite cluster in two-dimensional percolation. Probab. Theory Related Fields, 73(3):369–394, 1986.DOI
- [22]Harry Kesten. A scaling relation at criticality for 2D-percolation. In Percolation theory and ergodic theory of infinite particle systems (Minneapolis, Minn., 1984–1985), volume 8 of IMA Vol. Math. Appl., pages 203–212. Springer, New York, 1987.DOI
- [23]Harry Kesten. Scaling relations for 2D-percolation. Comm. Math. Phys., 109(1):109–156, 1987.DOI
- [25]Mikhail Khristoforov, Mikhail Skopenkov, and Stanislav Smirnov. A generalization of Cardy’s and Schramm’s formulae. Comm. Math. Phys., 406(5):Paper No. 105, 17, 2025.DOI
- [26]Ioan Manolescu. Exploring the phase transition of planar FK-percolation. Preprint arXiv:2502.08394, 2025.arxiv.org/abs/2502.08394
- [27]Pierre Nolin. Near-critical percolation in two dimensions. Electron. J. Probab., 13:no. 55, 1562–1623, 2008.
- [28]Ritvik Ramanan Radhakrishnan and Vincent Tassion. Strict inequalities for arm exponents in planar percolation. Probability Theory and Related Fields, 195:659–688, 2026.
- [29]Stanislav Smirnov. Critical percolation in the plane: conformal invariance, Cardy’s formula, scaling limits. C. R. Acad. Sci. Paris Sér. I Math., 333(3):239–244, 2001.DOI
- [30]Oded Schramm and Jeffrey E. Steif. Quantitative noise sensitivity and exceptional times for percolation. Annals of Mathematics, 171(2):619–672, 2010.
- [31]Stanislav Smirnov and Wendelin Werner. Critical exponents for two-dimensional percolation. Math. Res. Lett., 8(5-6):729–744, 2001.arxiv.org/abs/math/0109120
- [32]Vincent Tassion. Crossing probabilities for Voronoi percolation. Ann. Probab., 44(5):3385–3398, 2016.arxiv.org/abs/1410.6773










