Dimension (In)equalities and Hölder Continuous Curves in Fractal Percolation

We relate various concepts of fractal dimension of the limiting set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{C}$\end{document} in fractal percolation to the dimensions of the set consisting of connected components larger than one point and its complement in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{C}$\end{document} (the “dust”). In two dimensions, we also show that the set consisting of connected components larger than one point is almost surely the union of non-trivial Hölder continuous curves, all with the same exponent. Finally, we give a short proof of the fact that in two dimensions, any curve in the limiting set must have Hausdorff dimension strictly larger than 1.


Introduction and Main Results
In this paper we are concerned with a percolation model, first introduced in [12], which is known as Mandelbrot's fractal percolation process and which can be informally described as follows. For any integers d ≥ 2 and N ≥ 2, we start by dividing the unit cube [0, 1] d ⊂ R d into N d closed subcubes of equal size 1/N ×1/N ×· · ·×1/N . Given p ∈ [0, 1] and a subcube, we retain the subcube with probability p and discard it with probability 1 − p. This is done independently for every subcube of the partition. Sometimes we adopt the terminology calling retained cubes black and deleted cubes white. We define the random set C 1 N = C 1 N (d, p) ⊂ [0, 1] d as the union of all retained subcubes. Next consider any retained (assuming that C 1 N = ∅) subcube B in C 1 N . We repeat the described procedure on a smaller scale by dividing B into N d further subcubes, discarding or retaining them as above. We do this for every retained subcube of C 1 N . This yields a new random set C 2 N ⊂ C 1 N . Iterating the procedure on every smaller scale yields an infinite sequence of random sets [0, 1] d ⊃ C 1 N ⊃ C 2 N ⊃ · · · and we define the limiting set We will hereafter suppress the N in our notation and simply write C for C N .
We will need a more formal definition of the model as well. Let where n ≥ 1 and 1 ≤ k ≤ N n . For k = (k 1 , . . . , k d ), consider the subcube D n k of [0, 1] d defined by D n k := I n k 1 × I n k 2 ×· · ·×I n k d , and let D := {D n k : n ≥ 1, 1 ≤ k l ≤ N n }. A cube D n k will sometimes be called a level-n cube. We define the sample space by and denote an element of Ω by ω. We let B be the Borel σ -algebra on Ω generated by the cylinders and let P p denote the product measure on B with density p ∈ [0, 1], that is, we let P p (ω(D n k ) = 1) = p independently for every D n k ∈ D. The limiting set is then defined to be the intersection of all D n k ∈ D such that ω(D n k ) = 1. Let CR([0, 1] d ) denote the event that C contains a connected component which intersects the left-hand side {0} × [0, 1] d−1 of the unit cube and also intersects the right-hand side {1} × [0, 1] d−1 . In this case we say that a left-right crossing of the unit cube occurs.
We define the percolation function θ N,d by The critical value is defined as It has been shown in [8] that the phase transition in Mandelbrot's fractal percolation is non-trivial, i.e. 0 <p c (N, d) < 1. Furthermore, it was discovered in [8] that for d = 2, θ N,d (p) is discontinuous atp c (see [10] for an easy proof). This was generalized in [4] to all d ≥ 3 and N large enough but the result is conjectured to hold for all N in any dimension. (At this point we remark that as a corollary to the proof of Theorem 1.1 below, we obtain an explicit bound for the size of the discontinuity at the critical value p c , defined below and conjectured to coincide withp c , in terms of the Hausdorff dimension of the set C c , also to be defined below.) In d = 2, the set C is a.s. totally disconnected for p <p c (N, 2). This is also known to be true in higher dimensions for the same set of N for which it is known that θ N,d (p) is discontinuous atp c (see [5]) and is conjectured to be true for all d and N . It is therefore natural to work with the following critical value: It is known (see [5]) that for any d ≥ 2 and N ≥ 2, (N, d). Given this, it is an easy exercise to show that for p ≥ p c (N, d), C = ∅ implies that the set C c consisting of the union of all connected components larger than one point is a.s. not empty.
We now fix N, d ≥ 2 and assume that p c (N, d) ≤ p < 1. For any point x ∈ C, let C x ⊂ C be the set of points y ∈ C that are connected to x in C. We call C x the connected component of x. It is known (see [13]) that for p ≥ p c (N, d) there exist a.s. uncountably many x ∈ C such that C x = {x}. We partition C into two sets, C d := {x ∈ C : C x = {x}} and the aforementioned C c := C \ C d . (To understand the notation: d is short for "dust", and c is short for "connected".) Before we can state our results we will need some more definitions. The reader is referred to [11] for a general overview of the subject of fractal sets.
Define the s-dimensional Hausdorff measure of F as follows: which also turns out to be equal to sup{s : H s (F ) = ∞}. The Hausdorff dimension of the limiting set in fractal percolation is a.s. given by the following equation, whose proof can be found in [8] or [11], Proposition 15.4: There are many other concepts of dimensionality and we will in particular use the following. For a bounded set F ⊂ R d let M δ (F ) be the minimal number of closed cubes of side length δ that is needed to cover F . The Lower Box counting dimension of F ⊂ R d is given by If dim B (F ) = dim B (F ) then the common value is denoted dim B (F ) and called the Box counting dimension of F . It is known (see e.g. [11]) that for any bounded set The next two theorems contain our dimension results for fractal percolation.
from which it easily follows that a.s.
Note that if p < p c (N, d), C c =∅ a.s. and so (6) still holds as long as dim H (C) >0.
For > 0, let C c, be the union of the connected components of diameter at least . The following result suggests that the "small components" of C c are the ones which actually determine its Box counting dimension.
When p ≥p c , it is natural to ask about the nature of the left-right crossings of the unit cube. For d = 2, it was shown in [13] that C contains at least one continuous curve crossing the square as soon as a connected component crossing the square Fig. 1 The interface curves are drawn with broken lines. Arrows indicate the orientation exists. It was later established in [7] (again for d = 2) that any curve in C must have Hausdorff dimension strictly larger than 1.
In this paper, focusing again on the two-dimensional version of the model, we take the issue of the existence of continuous curves in C much further, using the sophisticated machinery of Aizenman and Burchard [1]. Their paper deals with scaling limits of systems of random curves, but we will show how their results can be useful in the context of fractal percolation as well. This is perhaps somewhat surprising, since the scaling limits in [1] deal with convergence in distribution, whereas in the fractal context, the fractal limiting set is an a.s. limit. The key will be a very careful comparison between convergence in the weak sense of curves in an appropriate topology, and convergence in the a.s. sense of compact sets in another topology. From such a comparison, one can obtain information about the compact sets that make up the a.s. limit of the fractal construction.
In order to state our results, we need some definitions. First of all, we define interface curves in the fractal process. The complement R 2 \ C n consists of a finite number of connected components, exactly one of which is unbounded. The boundary of any such connected component can be split into closed curves (loops). We call such loops interface curves and denote by F n the collection of interface curves after n iterations of the fractal process. In order for our interface curves to be uniquely defined, we orient them in such a way that they have black (retained) squares on the left and white (discarded) squares on the right, and assume that they turn to the right at corners where two white and two black squares meet in a checkerboard configuration, see Fig. 1.
A connected subset of an interface curve delimited by a starting and an ending point will be called an interface segment.
We continue with some general definitions concerning curves, mostly taken from [1] (see also [6]). We regard curves in [0, 1] 2 as equivalence classes of continuous functions from [0, 1] to [0, 1] 2 modulo strictly monotonic re-parameterizations. Be-low, γ will represent a particular curve and γ (t) a particular parameterization of γ . Denote by S the complete separable metric space of curves in [0, 1] 2 with metric where the infimum is over all parameterizations of γ 1 and γ 2 . The distance between two sets F and F of curves is defined by the Hausdorff metric induced by D, that is, The space Σ of closed subsets of S with the metric Dist is also a complete separable metric space. The fractal process induces a probability measure μ n on Σ , where μ n denotes the distribution of F n . With this notation, we can present our main result on continuous curves in C.

Theorem 1.4
The sequence of measures (μ n ) has subsequential weak limits. Any such weak limit μ assigns probability 1 to curve configurations in which all curves are Hölder continuous with the same exponent. The limiting set C has the same distribution as g(F ) := γ ∈F Image(γ ), where F is a random set of curves distributed as μ. In other words, C is distributed as the union of the images of the curves in a sample from a weak limit of the (μ n ).
Remark Note that, although Theorem 1.4 only claims the existence of subsequential weak limits for μ n as n → ∞, Theorem 1.4 combined with the existence of a unique a.s. limit for C n implies that g • μ n (·) = μ n (g −1 (·)) has a unique weak limit.
We now briefly discuss this result. Since a single point is of course a Hölder continuous curve, the bare statement that a set is the union of Hölder continuous curves is in itself close to being an empty statement. However, the curves in C mentioned in Theorem 1.4 cannot be exclusively curves whose image is one point. One way to see this is to rephrase the notion of weak convergence as follows (see also [1]). A sequence of probability measures (μ n ) on Σ converges weakly to a probability μ measure on Σ if and only if there exists a family of probability measures ρ n on Σ × Σ such that the first marginal of ρ n is μ n , the second marginal of ρ n is μ (for all n), and Σ×Σ Dist(F n , F )dρ n (F n , F ) → 0 as n → ∞. It is now also clear what happens to the points in the "dust set" C d : these are accounted for as well in the theorem, since any point x ∈ C d can be approximated by curves in F n whose diameter and distance to x converge to 0.
It is also possible to specialize to certain particular curves. As an example, we discuss the lowest crossing in C which we will first properly define. Condition on the existence in C n of a left-right crossing of the unit square for all n, and consider the lowest interface segment σ n in F n connecting the left and right sides of the unit square. The closure of the region in the unit square above σ n is a compact set (in the Euclidean topology) which decreases in n and which therefore converges as n → ∞. The lowest crossing in C is defined as the boundary of this limiting set. Theorem 1.5 If C contains a left-right crossing of the unit square, then the lowest crossing in C is a Hölder continuous curve.
The machinery of Aizenman and Burchard also allows for a quick proof, given in Sect. 4, of the following result, first proved in [7]. Proof of Theorem 1. 1 We start with the second equality of (5). Let Z n be the number of cubes of side length N −n that are retained in C n . First observe that It is well known from the theory of branching processes (see e.g. [2,9]) that Z 1/n n → pN d a.s. on the event C = ∅. Therefore, for a.e. ω such that C(ω) = ∅, (3) and (4) then imply that dim For the first equality of (5), let {B i } M δ i=1 be a cover of C c using the minimal number M δ of closed cubes of side length δ.
, D n k is retained). However, because of the scale-invariant construction of C and the fact that, for p ≥ p c (N, d), a.s. C is either empty or contains connected components larger than one point (see [5]), C ∩ D n k must contain connected components larger than one point. This contradicts the fact that {B i } M δ i=1 is a cover of C c and shows that such an x cannot exist. Furthermore, since the union Therefore, M δ must be the minimal number of closed cubes of side length δ that covers C. This concludes the proof of (5).
Since C = C c ∪ C d , (7) follows from (6) and the fact that (see [11]) We proceed therefore by proving (6), inspired by an argument suggested by Lincoln Chayes to the second author. Recall that C c, is the union of the connected components of diameter at least . For p ≥ p c (N, d), we have that which is an easy consequence of the definition of Hausdorff dimension (see [11]). Therefore, it suffices to find an upper bound of dim H (C c, ) which is uniform in and strictly smaller than dim H (C).
We will now assume that N ≥ 5 is odd. This assumption will make certain definitions easier to write down: the reader can check that the squares D n k below would not be uniquely defined for even N . We leave it to the reader to adapt the proof for all cases N ≥ 2.
For D 1 be the two cubes concentric to D 1 k with side lengths 1 and 3N −1 , respectively. Let ϕ N,d (p) be the probability that there exists a connected component of C that crosses the "shell" Assuming that C c = ∅, fix > 0 such that C c contains at least one component of diameter larger than and let l be such that N −l+1 ≤ /d. We will now construct a specific cover of C c, which we will use in our estimate for its Hausdorff dimension. Let W n denote the set of cubes D n k with the following two properties: • The intersection of all retained cubes of level n and higher contains a crossing of the shell B(D n In other words, if we would make all cubes black until level n − 1 (inclusive), then there would be a connected component in C crossing the shell B(D n k ; N −n+1 ) \ B(D n k ; 3N −n ). • D n k is retained, that is, ω(D n k ) = 1. By scale invariance and independence between the two conditions, we have that P p (D n k ∈ W n ) ≤ pϕ N,d (p). The inequality is due to a boundary effect since, as mentioned earlier, B(D n k ; 3N −n ) and/or B(D n k ; N −n+1 ) need not be completely con- For a given cube D n k , let B m denote the level-m cube which contains D n k , where m ≤ n (with B n = D n k ). We make two observations: Fig. 2 The cube D n k is in V n and D n+1 k , drawn with broken lines, belongs to V n+1 . Note that the corresponding shells are disjoint 1. If D n k has a non-empty intersection with C c, , then we have that B m ∈ W m , for all m = l, l + 1, . . . , n. This motivates us to define V n as the collection of cubes D n k for which the corresponding cubes B m are in W m , for all m = l, l + 1, . . . , n. From observation 1, we have that the collection V n forms a cover of C c, . We can now write, using observation 2, Using Fatou's lemma and the fact that the collection of cubes in V n covers C c, , we obtain (writing |V n | for the number of cubes in V n ): The limit in (12) is finite if and only if It follows from (11) that and since ϕ N,d (p) < 1, the result follows from this and (3).
Proof of Theorem 1.2 If P p (C c = ∅) = 1 then there is nothing to prove, so we assume that P p (C c = ∅) > 0. Let Z n be the number of retained cubes after n steps of the fractal construction procedure and let B 1 , . . . , B Z n denote the retained cubes. If the event {dim H (C c ) ≥ α} occurs, then {dim H (C c ∩ B k ) ≥ α} for at least one k = 1, . . . , Z n (see, e.g., [11]). Therefore, However, because of scale invariance, dim H (C c ∩ B k ), conditioned on the event that B k ⊂ C n , must have the same distribution as dim H (C c ) and so in fact We can now write This last quantity is bounded below by As mentioned above, a.s. Z 1/n n → pN d > 1 as n → ∞ if C = ∅. Therefore, if P p (dim H (C c ) ≥ α) > 0, by taking the limit of (13) as n → ∞, we conclude that P p (dim H (C c ) ≥ α) ≥ P p (C = ∅). If α > 0, it follows that in fact P p (dim H (C c ) ≥ α) = P p (C = ∅). Letting φ(α) = P p (dim H (C c ) ≥ α), we have that φ(0) = 1 and either φ(α) = 0 or φ(α) = P p (C = ∅) when α > 0.
Now observe that C c = ∅ implies dim H (C c ) ≥ 1 (see, e.g., Proposition 4.1 of [11]). Since the inverse implication is obvious, we conclude that φ(1) = P p (C c = ∅) > 0 (where the last inequality follows from the assumption made at the beginning of the proof) and that P p (C c = ∅) = P p (C = ∅). Hence, since {C c = ∅} ⊂ {C = ∅}, we obtain that up to a set of probability 0. Moreover, since φ(α) = P p (C = ∅) for at least α ≤ 1, and {dim H (C c ) ≥ α} ⊂ {C = ∅} for α > 0, we also obtain that {dim H (C c ) ≥ α} = {C = ∅}, up to a set of probability 0, for every α > 0 such that P p (dim H (C c ) ≥ α) > 0. Writing we conclude from the above observations that, up to a set of probability 0, if C c = ∅ then dim H (C c ) = β, with β ≥ 1 as a consequence of the assumption that P p (dim H (C c ) = ∅) > 0 and the fact that dim H (C c ) ≥ 1 as soon as C c = ∅.  (N, d). Moreover, it follows from [5] that ϕ N,d (p c (N, d)) > 0. Combining these observations with the last line of the proof of Theorem 1.1, we obtain that, for p ≥ p c (N, d), Remark For Theorem 1.1 we use the result from [5] that for p = p c (N, d), P p (C c = ∅) > 0. It is possible to prove the result without this prior knowledge, as follows. We can start with the observation from [5] that p c = p b . We can then prove Theorem 1.1 in the case of p > p c and from the last line of that proof we get that ϕ N,d (p) ≥ 1 N d−1 , using Corollary 2.1 and the fact that the Hausdorff-dimension of a connected set consisting of more than one point is at least 1 (see, e.g., Proposition 4.1 of [11]). Using this uniform bound and a right-continuity argument similar to the ones in [5], we conclude that in fact ϕ N,d (p c ) ≥ 1 N d−1 . Hence we can conclude that for p = p c (N, d), P p (C c = ∅) > 0, and go through the proof once more to obtain the same result as above.
Proof of Proposition 1. 3 We again use the fact that C c, is contained in the union of the cubes in V n , defined in the proof of Theorem 1.1, and therefore, By Fatou's lemma and Jensen's inequality we get along the same lines as in the last part of the proof of Theorem 1.1 (using the same l as in that proof) that Since ϕ N,d (p) < 1 it follows that d + log(pϕ N,d (p))/ log N < d + log p/ log N .

Proof of Theorems 1.4 and 1.5
In this section and the next one we work in two dimensions, that is, d = 2. We will be using the machinery in [1] concerning scaling limits of systems of random curves. One part of the argument is to apply some of the machinery developed in [1] in order to show that the sequence of measures μ n defined in the introduction has subsequential weak limits, and we first deal with this issue. After that, we combine the existence of weak limits with the a.s. limit behavior of the fractal process in order to draw the final conclusions.
Let B(x, r) denote a closed square centred at x with side length r and B • (x; r) its interior. For R > r, let A(x; r, R) := B(x, R) \ B • (x, r) be an annulus. The basic estimate is the following, from which everything else will follow. p ≥ p c (N, 2). There exists a sequence λ(1), λ(2), . . . with lim k→∞ λ(k) = ∞ and finite constants K k such that the following bound holds uniformly for all r ≤ R ≤ 1 with r small enough, and all x:

Lemma 3.1 Let
. (15) Fig. 3 The annulus A n 1 with 3 level-n 1 components, drawn in dark grey Proof We are looking for a collection of mutually disjoint annuli (all contained in B(x, R) and "surrounding" B(x, r)) of the form A(y; 2N −n , 4N −n ), where y is a corner point of some square D n k of the fractal construction. It is not hard to see that for any x ∈ [0, 1] 2 , we can find such a collection with at least M := c log(R/r) elements, for a suitable positive constant c. For small enough r, M is at least 1. For a given x, we denote these annuli by A n 1 , A n 2 , . . . , A n M , where the indices n 1 < n 2 < · · · < n M refer to the n associated with the annuli. The idea is that if there are k disjoint crossings of A(x; r, R), then each annulus A n i must also be crossed by k disjoint crossings in F n . This is exponentially unlikely in the number of annuli, as we will show now.
We first consider the annulus A n 1 . Let n > n 1 , and perform the fractal process until level n 1 (inclusive). The annulus A n 1 consists of 12 level-n 1 squares (Fig. 3), some of which are in C n 1 and some of which are not. Now observe that the collection of black (retained) squares of level n 1 in A n 1 is partitioned into at most 6 "leveln 1 components", where two neighboring retained level-n 1 squares are in the same component if they share an edge: see Fig. 3 for an illustration of the event that the annulus contains 3 such level-n 1 components. Now let k be large enough (exactly how large will become clear soon). If A n 1 is, after n iterations, crossed by k disjoint interface segments, then at least one of the level-n 1 components must be crossed by at least k/6 such segments, since there are at most 6 components to accommodate these crossings (we should write k/6 but we ignore these details for the sake of notational convenience). Between the interface crossings, one has alternating black (retained) and white (discarded) crossings of the annulus. This implies that the component with at least k/6 interface crossings is, after n iterations, also crossed by at least k/12 − 1 white crossings which are "between" the "first" and "last" of the k/6 interface crossings of said component. The point of considering the level-n 1 components introduced above is that they are disjoint and separated by vacant squares, so that the fractal constructions inside them from level n 1 on are independent of each other, and none of the interface segments crossing A n 1 can intersect more than one of them. Therefore, adding extra retained level-n 1 squares in A n 1 does not affect the k/12 − 1 white crossings in the component with at least k/6 interface crossings. This implies that the probability of having at least k interface crossings in A n 1 after n iterations is bounded above by the probability of having at least k/12 − 1 white crossings after n iterations, conditioned on having full retention in A n 1 up to level n 1 .
However, scaling tells us that, if we condition on retention until level n 1 , the probability in question is the same as the probability of having at least k/12 − 1 disjoint white components crossingĀ : = A((0, 0); 2, 4) when we perform n − n 1 iterations of the fractal process in [−2, 2] 2 rather than in [0, 1] 2 , seen as the union of 16 independent fractal processes on the 16 unit squares making up [−2, 2] 2 . For these white crossing components we can use the BK inequality (see [13] -a similar BK inequality for black crossing is not available) and deduce that the probability of having k/12 − 1 of such white crossing components is bounded above by the probability of having at least one, raised to the power k/12 − 1. This then finally leads to the estimate that is bounded above by P p Ā is crossed by a white component after n − n 1 steps k/12−1 .
If there is a white component crossingĀ, then there is no black circuit surrounding the origin inĀ. The probability of having such a black circuit after n − n 1 iterations is at least as large as the probability to have such a circuit in the limit, and by the weak RSW theorem for fractal percolation in [10] and the FKG inequality, we have that for p ≥ p c (N, 2) this probability is strictly positive. It follows that there exists α < 1 such that (16) is bounded above by α k/12−2 , uniformly in n > n 1 .
Next we consider A n 1 and A n 2 simultaneously. Take n > n 2 . The probability to have k interface crossings in A n 1 and also in A n 2 is the probability that this happens in A n 1 multiplied by the probability that this happens in A n 2 conditioned on the fact that it happens in A n 1 . We can treat this conditional probability exactly as above: we can change the conditioning into one involving complete retention inside A n 2 until level n 2 , to get an upper bound. It follows that the probability that both A n 1 and A n 2 have k interface crossings is bounded above by the square of the individual bounds, that is, by (α k/12−1 ) 2 .
We continue in the obvious way now, leading to the conclusion that for n > n M , the probability that all annuli A n 1 , . . . , A n M are crossed by k interface crossings, is bounded above by α k/12−1 c log(R/r) .
A little algebra shows that this is equal to r R c log(α 1−k/12 ) , and this is a bound of the required form, with λ(k) = c log(α 1−k/12 ).
We now describe how the existence of subsequential weak limits of the sequence μ n follows from this lemma. (This is well known but perhaps not immediately obvious from the literature, hence our summary for the convenience of the reader.) For > 0 and positive integers k, n define r n ,k := inf 0 < r ≤ 1 : It follows exactly as in [1] or [14] that, as a consequence of Lemma 3.1, for any > 0, for large enough k the random variables r n ,k are stochastically bounded away from zero as n → ∞, that is Note that in Lemma 3.1 we have the result (15) only for r small enough, while the corresponding hypothesis H1 in [1] is stated without that restriction. Our Lemma 3.1 however is sufficient to prove (17), since the latter concerns the behavior of P p (r n ,k ≤ u) as u → 0.
Note also that Hypothesis H1 is used in (3.4) in [1] only for annuli whose inner radius equals 3r 1+ n , with r n = 2 −n ≤ u for u > 0. By taking u sufficiently small in the proof of Lemma 3.1 in [1], also the inner radius 3r 1+ n becomes sufficiently small and we can apply our Lemma 3.1. Hence, (17) follows from our Lemma 3.1 by the same arguments used in [1] or [14].
As is shown in [1] (see in particular their proof of Theorem 1.
where the random variables k n are stochastically bounded as n → ∞, that is, Once we have this result, we use Theorem 5.7 in [14] and Theorem 1.1 in [1] to conclude that the sequence of measures {μ n } n≥1 is tight. Since Σ is separable, it then follows from Prohorov's theorem that for every sequence n k → ∞ there exists a subsequence n k l → ∞ such that μ n k l converges weakly to a probability measure on Σ .
Finally, from the fact that the k n are stochastically bounded and the fact that the collection of curves with a given Hölder exponent is compact, we have (see also [14] and [1]) that if we sample from any such weak limit, all curves γ in the sample can be parameterized in such a way that where M is a random number common to all curves in the same sample, and α is a (non-random) constant. Next we combine the above weak convergence with the a.s. convergence of the retained squares (as compact sets) in the fractal process. Let (S, H ) denote the metric space of compact subsets of [0, 1] d with the Hausdorff distance H and let (Σ, Dist) be as defined after (9). Furthermore, let the function g : Σ → S be defined by g(F ) = γ ∈F Image(γ ) and define F n = g(F n ). Our next result concerns weak convergence of (F n , F n ) where we use the product topology on Σ × S.

Lemma 3.3
The distribution of (F n , F n ) converges weakly along a subsequence. Furthermore, any pair (F , F ) of random variables sampled from any such weak limit a.s. satisfies F = g(F ).
Proof We already know that the distribution μ n of F n converges weakly along a subsequence. Using (8) and (9), if Dist(F , F ) ≤ δ, this immediately implies that H (F, F ) ≤ δ since the images of any two curves γ 1 , γ 2 such that D(γ 1 , γ 2 ) ≤ δ are within Hausdorff distance δ. This proves that g is continuous.
The convergence in distribution of F n along some subsequence n k to a limit F implies the existence of coupled versions X k and X of F n k and F respectively, such that X k converges to X in probability as k → ∞ (see, e.g., Corollary 1 in [3]). Moreover, since g is continuous, g(X k ) dist.
= F n k converges in probability to g(X) dist.
= g(F ) as k → ∞. This implies convergence in probability of the vector (X k , g(X k )) to (X, g(X)), which yields the joint convergence in distribution of (F n k , F n k ) to some limit (F , F ) with F = g(F ) a.s.
Proof of Theorem 1.4 According to Lemma 3.3 there exists a subsequence {n k } k≥1 such that (F n k , F n k ) converges weakly to some limit (F , F ) where F is a.s. the union of the images of F . Furthermore, we claim that a.s.
where F n = g(F n ). To see this, let F n denote the -neighborhood of F n and note that C ⊂ F n implies that there exists an x ∈ C such that B(x, ) ∩ F n = ∅ and so B(x, ) ⊂ C n ; otherwise an interface curve would be closer to x than . It is however easy to prove that the probability that there exists a ball of radius in C n goes to 0. For the other direction, let D = D(C, ) be the complement of the open -neighborhood of C. Obviously D ∩ C n is a compact set (if non-empty) and furthermore D ∩ C n+1 ⊂ D ∩ C n for every n. Therefore, by compactness, if D ∩ C n = ∅ for every n then ∞ n=1 D ∩ C n = ∅ and so there are points in C that are also in D, which is a contradiction. Therefore, the open -neighborhood of C will eventually contain C n and hence also F n .
Since F n k converges weakly to F and a.s. to C (because of (19)), we conclude that F and C have the same distribution, and hence C has the same distribution as g(F ). The fact that (as noted above), a.s., a realization from F only contains Hölder continuous curves satisfying (18) finishes the proof.
Proof of Theorem 1.5. Let ν n be the distribution of σ n . We repeat the proof of Theorem 1.4, with the distance (9) replaced by (8). This shows that conditioned on the existence of a left-right crossing for all n, ν n has subsequential weak limits as n → ∞ and in addition that any such limit assigns probability 1 to Hölder continuous curves.

Proof of Theorem 1.6
We will start by showing that the fractal percolation process satisfies Hypothesis H2 in [1], from which Theorem 1.6 follows. The hypothesis concerns probabilistic bounds on crossings in the long direction of certain rectangles.
A collection of sets {A i } is called well-separated if for all i the distance of each set A i to the other sets {A j } j =i is at least as large as the diameter of A i . Hypothesis H2 in [1] reads as follows.

Hypothesis 4.1
There exist σ > 0 and some ρ < 1 such that for every collection of k well-separated rectangles A 1 , . . . , A k of width l 1 , . . . , l k and length σ l 1 , . . . , σ l k , the following inequality holds: lim sup n→∞ P p F n contains a long crossing in each of A 1 , . . . , A k ≤ ρ k .

Lemma 4.2 Hypothesis 4.1 holds for interface curves in the fractal process.
Proof We assume without loss of generality that l 1 ≥ l 2 ≥ · · · ≥ l k . Let n i be the smallest integer n for which all rectangles of dimensions l i and σ l i contain an n-level square of the fractal construction, and define A i as the event of complete retention until iteration step n i . Let CR I n (A i ) denote the event that the closed rectangle A i is crossed in the long direction by an interface segment after n iterations of the fractal process, and define CR B n (A i ) similarly for a black crossing. Note that by the fact that A 1 , . . . , A k are well-separated and by the choice of n 1 , given A 1 , the event CR B n (A 1 ) is, when n > n 1 , conditionally independent of the events CR B n (A 2 ), . . . , CR B n (A k ), since no level-n square intersects more than one rectangle. Note also that, if a rectangle is crossed in the long direction by an interface segment, then it also contains a black crossing in the long direction. Using these two facts and the FKG inequality gives, for n > n 1 , Since l 1 ≥ l 2 ≥ · · · ≥ l k , we have n 1 ≤ n 2 ≤ · · · ≤ n k and hence A 1 ⊃ A 1 ⊃ · · · ⊃ A k . It follows as before that for n > n 2  We repeat this procedure k − 2 more times, finally obtaining, for n > n k , that It remains to show that P p (CR B n (A i )|A i ) is uniformly bounded above by some ρ < 1. This can be seen as follows. Let, for each i, W i be a smallest collection of level-(n i + 1) squares in the fractal process with the property that if each of the squares in W i is white, then A i cannot be crossed by a black path in the long direction. It is easy to see from the choice of n i that the cardinality of W i is uniformly bounded above and hence that the probability that all squares in W i are white is uniformly bounded below by some positive number. It follows that the probability of a long black crossing in A i is uniformly bounded above by some number strictly smaller than 1.
Proof of Theorem 1.6 The result follows from Lemma 4.2 and Theorem 1.3 in [1].