Weak LQG metrics and Liouville first passage percolation
Julien Dub\'edat, Hugo Falconet, Ewain Gwynne, Joshua Pfeffer, and Xin, Sun

TL;DR
This paper defines and analyzes weak Liouville quantum gravity (LQG) metrics, establishing their properties, bounds, and regularity, and demonstrating their relation to Liouville first passage percolation limits, with implications for metric uniqueness.
Contribution
It introduces a framework for weak LQG metrics satisfying natural axioms, proves their properties, and connects them to Liouville first passage percolation subsequential limits, advancing understanding of LQG geometry.
Findings
Weak $eta$-LQG metrics satisfy natural axioms.
Derived moment bounds for diameters and distances.
Established local bi-Hölder continuity and optimal exponents.
Abstract
For , we define a weak -Liouville quantum gravity (LQG) metric to be a function which takes in an instance of the planar Gaussian free field (GFF) and outputs a metric on the plane satisfying a certain list of natural axioms. We show that these axioms are satisfied for any subsequential limits of Liouville first passage percolation. Such subsequential limits were proven to exist by Ding-Dub\'edat-Dunlap-Falconet (2019). It is also known that these axioms are satisfied for the -LQG metric constructed by Miller and Sheffield (2013-2016). For any weak -LQG metric, we obtain moment bounds for diameters of sets as well as point-to-point, set-to-set, and point-to-set distances. We also show that any such metric is locally bi-H\"older continuous with respect to the Euclidean metric and compute the optimal H\"older exponents in both…
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Weak LQG metrics and Liouville first passage percolation
Julien Dubédat, Hugo Falconet, Ewain Gwynne, Joshua Pfeffer, and Xin Sun
Abstract
For , we define a weak -Liouville quantum gravity (LQG) metric to be a function which takes in an instance of the planar Gaussian free field (GFF) and outputs a metric on the plane satisfying a certain list of natural axioms. We show that these axioms are satisfied for any subsequential limits of Liouville first passage percolation. Such subsequential limits were proven to exist by Ding-Dubédat-Dunlap-Falconet (2019). It is also known that these axioms are satisfied for the -LQG metric constructed by Miller and Sheffield (2013-2016).
For any weak -LQG metric, we obtain moment bounds for diameters of sets as well as point-to-point, set-to-set, and point-to-set distances. We also show that any such metric is locally bi-Hölder continuous with respect to the Euclidean metric and compute the optimal Hölder exponents in both directions. Finally, we show that LQG geodesics cannot spend a long time near a straight line or the boundary of a metric ball. These results are used in subsequent work by Gwynne and Miller which proves that the weak -LQG metric is unique for each , which in turn gives the uniqueness of the subsequential limit of Liouville first passage percolation. However, most of our results are new even in the special case when .
Contents
1 Introduction
1.1 Overview
Let , let be open, and let be some variant of the Gaussian free field (GFF) on . The -Liouville quantum gravity (LQG) surface corresponding to is, heuristically speaking, the random two-dimensional Riemannian manifold with metric tensor , where denotes the Euclidean metric tensor. LQG surfaces are the scaling limits of various types of random planar maps: the case when corresponds to uniform random planar maps. Other values of correspond to random planar maps weighted by the partition function of a statistical mechanics model on the map, e.g., the uniform spanning tree for or the critical Ising model for . More generally, convergence to -LQG is expected if the planar map is weighted by the partition function of a critical statistical mechanics model with central charge ; see, e.g., [GHS19b, Section 3.1] and the references therein for further discussion.
The above definition of a -LQG surface does not make rigorous sense since the GFF is a random distribution, not a function. In particular, it does not have well-defined pointwise values and so cannot be exponentiated. Therefore, one needs to use various regularization procedures to make rigorous sense of LQG surfaces. For example, one can construct a random measure on , called the -LQG area measure, as a limit of regularized versions of “”, where denotes Lebesgue measure [Kah85, DS11, RV14]. This measure can be thought of as the volume form associated with the -LQG surface. One way to construct is as follows. Let p_{s}(z,w)=\frac{1}{2\pi s}\exp\mathopen{}\mathclose{{}\left(-\frac{|z-w|^{2}}{2s}}\right) be the heat kernel on . For , we define a mollified version of the GFF by
[TABLE]
where the integral is interpreted in the sense of distributional pairing (see Remark 1.1 for some discussion on the particular choice of mollifier). One can then define the -LQG measure as the a.s. weak limit [RV14, Ber17]
[TABLE]
The LQG measure satisfies a conformal coordinate change formula: if is a conformal map and
[TABLE]
then for each Borel set . We think of two pairs and which are related by a conformal map as in (1.3) as being two different parametrizations of the same LQG surface. Thus the coordinate change formula for says that this measure depends only on the quantum surface, not on the particular choice of parametrization.
Since -LQG surfaces are thought of as random Riemannian manifolds, one expects that such a surface also gives rise to a random metric on . Constructing such a metric is a much harder problem than constructing the measure . Miller and Sheffield [MS20, MS16a, MS16b] constructed such a metric in the special case when by using a process called quantum Loewner evolution [MS16d] to define -LQG metric balls. They also showed that in this case, the metric space for certain special choices of and is isometric to a known Brownian surface — like the Brownian map [Le 13, Mie13] or the Brownian disk [BM17]. Brownian surfaces are random metric spaces which arise as the scaling limits of uniform random planar maps with respect to the Gromov-Hausdorff topology.
This paper is part of a program whose eventual goal is to construct a metric on -LQG for all as a limit of regularized metrics analogous to (1.2). These regularized metrics are called Liouville first passage percolation (LFPP). We recall the precise definition of LFPP just below. It was previously shown by Ding, Dubédat, Dunlap, and Falconet [DDDF19] that LFPP admits non-degenerate subsequential limits in law w.r.t. the local uniform topology (i.e., the topology of uniform convergence on compact sets). The main contributions of this paper are as follows.
- •
Properties of subsequential limits of LFPP. We prove, using a general theorem from [GM19d], that every subsequential limit of LFPP can be realized as a measurable function of the field, so the convergence occurs in probability, not just in distribution. We also check that every subsequential limit of LFPP satisfies a certain natural list of axioms which one would expect any reasonable notion of a metric on -LQG to satisfy (see Section 1.2). We call a metric satisfying these axioms a weak LQG metric. A closely related list of axioms appeared previously in [MQ18].
- •
Properties of weak LQG metrics. We prove several quantitative properties for a general weak LQG metric. We compute the optimal Hölder exponents between the LQG metric and the Euclidean metric in both directions. We also give moment bounds for LQG diameters and for point-to-point, set-to-set, and point-to-set distances; these bounds are analogous to known moment bounds for the -LQG measure (see, e.g., [RV14]). See Section 1.3 for precise statements. Since our list of axioms is satisfied for the Miller-Sheffield -LQG metric, our results apply to this metric as well. Even in this special case, most of our results are new.
The results in this paper are used to prove further properties of weak LQG metrics (including subsequential limits of LFPP) in [GM19c, GM19a, GM19b], eventually culminating in the proof in [GM19c] that there is only one weak -LQG metric for each , which establishes the existence and uniqueness of the -LQG metric for all . However, even after this program is completed, we expect that our results will continue to be a useful tool in the study of the -LQG metric. For example, our estimates for the LQG metric are used in [GP19b] to prove a version of the KPZ formula [DS11, KPZ88] for this metric. Moreover, as explained in Remark 1.1, our results for subsequential limits of LFPP apply to variants of LFPP defined using different continuous approximations for the GFF (other than convolution with the heat kernel) once tightness is established for these variants.
We remark that versions of some of the estimates for weak LQG metrics which are proven in this paper (including tail estimates for the distance across a rectangle, the first moment bound for diameters, and Hölder continuity) were previously proven for subsequential limits of LFPP in [DDDF19]. However, it is important to have these estimates for general weak -LQG metrics: indeed, such estimates will be used in [GM19c] to show the uniqueness of the weak -LQG metric (which is a stronger statement than just the uniqueness of the subsequential limit for the variant of LFPP considered in [DDDF19]). Many of our estimates are also new for subsequential limits of LFPP, e.g., the optimality of the Hölder exponents in Theorem 1.7, the moment bounds in Theorems 1.8, 1.10, and 1.11, and the estimates for geodesics in Section 4.
Due to our axiomatic approach, our proofs do not require any outside input besides the existence of LFPP subsequential limits from [DDDF19] and a general theorem about local metrics from [GM19d] (both of which can be taken as black boxes). To understand the paper, the reader only needs to be familiar with basic properties of the GFF, as reviewed, e.g., in [She07] and the introductory sections of [SS13, MS16c, MS17].
Acknowledgments. We thank an anonymous referee for helpful comments on an earlier version of the manuscript. We thank Jian Ding, Alex Dunlap, Jason Miller, Scott Sheffield, as well as Vincent Tassion, Wendelin Werner, and their research group at ETH Zürich for helpful discussions. Part of the project was carried out during E. Gwynne and X. Sun’s visit to MIT and E. Gwynne and J. Pfeffer’s visit to Columbia University in Fall 2018. We thank the two institutions for their hospitality. J. Dubédat was partially supported by NSF grant DMS-1512853. E. Gwynne was supported by a Herchel Smith fellowship and a Trinity College junior research fellowship. J. Pfeffer was partially supported by the National Science Foundation Graduate Research Fellowship under Grant No. 1122374. X. Sun was supported by the Simons Foundation as a Junior Fellow at Simons Society of Fellows, by NSF grant DMS-1811092, and by the Minerva fund at the Department of Mathematics at Columbia University.
1.2 Weak LQG metrics and subsequential limits of LFPP
Let us now discuss the approximations of LQG metrics which we will be interested in. We first need to introduce an exponent which plays a fundamental role in the study of -LQG distances. It is shown in [DG18] that for each , there is an exponent which arises in various approximations of LQG distances. For example, for certain random planar maps in the -LQG universality class, a graph-distance ball of radius in the map typically has of order vertices. It is shown in [GP19b] that is the Hausdorff dimension of the -LQG metric. The value of is not known explicitly except for , but reasonably tight upper and lower bounds are available; see [DG18]. We define
[TABLE]
For concreteness, we will primarily focus on the whole-plane case. We say that a random distribution on is a whole plane GFF plus a continuous function if there exists a coupling of with a random continuous function such that the law of is that of a whole-plane GFF. If such a coupling exists for which is bounded, then we say that is a whole-plane GFF plus a bounded continuous function.111The reason why we sometimes restrict to bounded continuous functions is that it ensures that the convolution with the whole-plane heat kernel is finite (so is defined) and it makes parts of the proof of Theorem 1.2 simpler. Note that the whole-plane GFF is defined only modulo a global additive constant, but these definitions do not depend on the choice of additive constant.
If is a whole-plane GFF, or more generally a whole-plane GFF plus a bounded continuous function, we define the mollified GFF for and as in (1.1). For and , we define the -LFPP metric by222The intuitive reason why we look at instead of to define the metric is as follows. By (1.2), we can scale LQG areas by a factor of by adding to the field. By (1.5), this results in scaling distances by , which is consistent with the fact that the “dimension” should be the exponent relating the scaling of areas and distances.
[TABLE]
where the infimum is over all piecewise continuously differentiable paths from to . One should think of LFPP as the metric analog of the approximations of the LQG measure in (1.2).
Remark 1.1**.**
The reason why we define LFPP using instead of some other continuous approximation of the GFF is that this is the approximation for which tightness is proven in [DDDF19]. If we had a tightness result similar to those in [DDDF19] for LFPP defined using a different approximation (such as the circle average process of [DS11, Section 3.1] or the convolution of with , where is a continuous non-negative radially symmetric function with total integral one), then similar arguments to those in Section 2 would show that the subsequential limits are also weak LQG metrics. Together with the uniqueness of weak LQG metrics proven in [GM19c], this means that in order to show that such approximations converge to the -LQG metric one only needs to prove tightness.
For , let be the median of the -distance between the left and right boundaries of the unit square along paths which stay in the unit square. It follows from results in [DDDF19] (see Lemma 2.5 below) that the laws of the metrics are tight with respect to the local uniform topology on and every subsequential limit induces the Euclidean topology on .
Building on this, we will prove that in fact the metrics admit subsequential limits in probability and that every subsequential limit satisfies a certain natural list of axioms. To state these axioms, we need some preliminary definitions. Let be a metric space.
For a curve , the -length of is defined by
[TABLE]
where the supremum is over all partitions of . Note that the -length of a curve may be infinite.
For , the internal metric of on is defined by
[TABLE]
where the infimum is over all paths in from to . Then is a metric on , except that it is allowed to take infinite values.
We say that is a length space if for each and each , there exists a curve of -length at most from to .
A continuous metric on a domain is a metric on which induces the Euclidean topology on , i.e., the identity map is a homeomorphism. We equip the space of continuous metrics on with the local uniform topology for functions from to and the associated Borel -algebra. We allow a continuous metric to have if and are in different connected components of . In this case, in order to have w.r.t. the local uniform topology we require that for large enough , if and only if .
Let be the space of distributions (generalized functions) on , equipped with the usual weak topology. For , a weak -LQG metric is a measurable function from to the space of continuous metrics on such that the following is true whenever is a whole-plane GFF plus a continuous function.
- I.
Length space. Almost surely, is a length space, i.e., the -distance between any two points of is the infimum of the -lengths of -continuous paths (equivalently, Euclidean continuous paths) between the two points. 2. II.
Locality. Let be a deterministic open set. The -internal metric is determined a.s. by . 3. III.
Weyl scaling. Let be as in (1.4) and for each continuous function , define
[TABLE]
where the infimum is over all continuous paths from to parametrized by -length. Then a.s. for every continuous function . 4. IV.
Translation invariance. For each deterministic point , a.s. . 5. V.
Tightness across scales. Suppose that is a whole-plane GFF and let be its circle average process. For each , there is a deterministic constant such that the set of laws of the metrics for is tight (w.r.t. the local uniform topology). Furthermore, the closure of this set of laws w.r.t. the Prokhorov topology on continuous functions is contained in the set of laws on continuous metrics on (i.e., every subsequential limit of the laws of the metrics is supported on metrics which induce the Euclidean topology on ). Finally, there exists such that for each ,
[TABLE]
We emphasize that the definition of a weak -LQG metric depends on only via the parameter in Axiom III. We will therefore sometimes say that a metric satisfying the above axioms is a weak LQG metric with parameter .
It is easy to see, at least heuristically, why Axioms I through V should be satisfied for subsequential limits of LFPP, although there is some subtlety involved in checking these axioms rigorously. The first main result of this paper is the following statement, whose proof builds on results from [DDDF19, GM19d].
Theorem 1.2**.**
Let . For every sequence of ’s tending to zero, there is a weak -LQG metric and a subsequence for which the following is true. Let be a whole-plane GFF, or more generally a whole-plane GFF plus a bounded continuous function. Then the re-scaled LFPP metrics from (1.5) converge in probability to .
We will explain why we get convergence in probability, instead of just in law, in Theorem 1.2 just below. Let us first discuss the axioms for a weak LQG metric. Axioms I through IV are natural from the perspective that -LQG is a “random two-dimensional Riemannian manifold” obtained by exponentiating . Axiom V is a substitute for exact scale invariance of the metric. To explain this, it is expected (and will be proven in [GM19c, GM19b]) that the -LQG metric, like the -LQG measure, is invariant under coordinate changes of the form (1.3). In particular, it should be the case that for any , a.s.
[TABLE]
Under Axiom III, the formula (1.9) together with the scale invariance of the law of , modulo an additive constant, implies Axiom V with . We define a strong LQG metric to be a mapping which satisfies Axioms I through IV as well as (1.9).
A similar definition of a strong LQG metric has appeared in earlier literature. Indeed, the paper [MQ18] proved several properties of geodesics for any metric associated with -LQG which satisfies a similar list of axioms to the ones in our definition of a strong LQG metric; however, at that point such a metric had only been constructed for .333Although the axioms in [MQ18] are formulated in a slightly different way from our axioms for a strong LQG metric, it can be proven, with some work, that the two notions are equivalent. The analog of Axiom II in [MQ18], which asserts that metric balls are local sets, is proven to be equivalent to our Axiom II in [GM19d, Lemma 2.2]. The analog of Axiom III in [MQ18] is stated only for constant functions, but it is easy to check that this axiom implies Axiom III. For example, this is explained in [GMS20, Section 2.4] in the special case when , and the same argument works for general . In [MQ18, Assumption 1.1], the authors allow for fields on any open domain in and assume that the metric satisfies a LQG coordinate change formula for general conformal maps, not just complex affine maps. It is shown in [GM19b] that a strong LQG metric in the sense of this paper gives rise to a metric associated with a GFF on any proper sub-domain of which satisfies the LQG coordinate change formula for general conformal maps.
It far from obvious that subsequential limits of LFPP satisfy (1.9). The reason for this is that scaling space results in scaling the value of in (1.5), which in turn changes the subsequence which we are working with. It will eventually be proven in [GM19c] that every weak LQG metric satisfies (1.9), i.e., every weak LQG metric is a strong LQG metric, but the proof requires all of the results of the present paper as well as those of [GM19d, GM19a].
Nevertheless, Axiom V can be used in place of (1.9) in many situations. Basically, this axiom allows us to compare distance quantities at the same Euclidean scale. For example, Axiom V implies that if is open and is compact, then the laws of
[TABLE]
as varies are tight.
Part of the proof of Theorem 1.2 is to show that for any joint subsequential limit of the laws of the pairs , the limiting metric is a measurable function of . This is not obvious since convergence in law does not in general preserve measurability. In our setting, we will prove that is determined by by checking the conditions of [GM19d, Corollary 1.8], which gives a list of conditions under which a random metric coupled with the GFF is determined by the GFF. The reason why we have convergence in probability, instead of convergence in law, in Theorem 1.2 is the following elementary probabilistic lemma (see e.g. [SS13, Lemma 4.5]).444Since the space of continuous metrics is not complete w.r.t. any natural choice of metric which induces the local uniform topology, we apply the lemma with equal to the larger space of continuous functions equipped with the local uniform topology, which is completely metrizable.
Lemma 1.3**.**
Let and be complete separable metric spaces. Let be a random variable taking values in and let and be random variables taking values in , all defined on the same probability space, such that in law. If is a.s. determined by , then in probability.
Theorem 1.2 will be proven in Section 2. Once this is done, throughout the rest of the paper we will only ever work with a weak -LQG metric — we will not need to make explicit reference to LFPP. An important advantage of this approach is that the Miller-Sheffield -LQG metric from [MS20, MS16a, MS16b] is known to satisfy the axioms for a weak -LQG metric. See [GMS20, Section 2.4] for a careful explanation of why this is the case. Note that [GMS20, Section 2.4] checks the coordinate change relation (1.9) for the Miller-Sheffield metric which (as discussed above) implies Axiom V. Hence all of our results for weak -LQG metrics apply to both this -LQG metric and to subsequential limits of LFPP.555 The uniqueness of the weak LQG metric proven in [GM19c] implies that the Miller-Sheffield -LQG metric is the limit of LFPP for .
Remark 1.4** (Liouville graph distance).**
Besides LFPP, there is another natural scheme for approximating LQG metrics called Liouville graph distance (LGD). The -LGD distance between two points in is defined to be the minimum number of Euclidean balls with LQG mass whose union contains a path between the two points. It has been proven in [DD18] that for each , the -LGD metric, appropriately renormalized, admits subsequential limiting metrics as which induce the Euclidean topology. In the contrast to LFPP, for subsequential limits of LGD the coordinate change relation (1.9) is easy to verify but Weyl scaling (Axiom III) appears to be very difficult to verify, so these subsequential limits are not known to be weak LQG metrics in the sense of this paper. It is still an open problem to establish uniqueness of the scaling limit for LGD. Similar considerations apply to variants of LGD defined using embedded planar maps (such as maps constructed from LQG square subdivision [DS11, GHPR19] or mated-CRT maps [GHS19a, GMS17]) instead of Euclidean balls, although for these variants tightness has not been checked.
1.3 Quantitative properties of weak LQG metrics
In what follows, we assume that is a weak -LQG metric and is a whole-plane GFF. Perhaps surprisingly, the axioms for a weak LQG metric imply much sharper bounds on the scaling constants than (1.8).
Theorem 1.5**.**
Let be as in (1.4) and let . Then for , the scaling constants satisfy
[TABLE]
at a rate which is uniform over all .
The definition of a weak LQG metric uses only the parameter . Theorem 1.5 connects this definition to the coordinate change parameter . This will be important for the proof in [GM19c] that any weak LQG metric satisfies the coordinate change formula (1.9). Theorem 1.5 will be proven in Section 3.2 by comparing -distances to LFPP distances and using the fact that the -LFPP distance between two fixed points is typically of order [DG18, Theorem 1.5] (for convenience, for this argument we will work with a variant of LFPP which is defined in a slightly different manner than the version in (1.5)).
Remark 1.6**.**
Theorem 1.5 gives a proof purely in the continuum that the exponent of [DZZ18, DG18] is equal to . Previously, this was proven in [DG18] (building on [GHS17]) using the known ball volume growth exponent for random triangulations [Ang03]. To see why Theorem 1.5 implies that , we observe that the -LQG metric of [MS20, MS16a, MS16b] satisfies the axioms for a weak LQG metric with parameter . Moreover, by the LQG coordinate change formula for the -LQG metric, Axiom V holds for this metric with with . Theorem 1.5 therefore implies that if is chosen so that , then the associated parameter satisfies , i.e., which is equivalent to . Hence when , so .
Our next main result gives the optimal Hölder exponents for with respect to the Euclidean metric.
Theorem 1.7** (Optimal Hölder exponents).**
Let be open and bounded. Almost surely, the identity map from , equipped with the Euclidean metric, to is locally Hölder continuous with any exponent smaller than and is not locally Hölder continuous with any exponent larger than . Furthermore, the inverse of this map is a.s. locally Hölder continuous with any exponent smaller than and is not locally Hölder continuous with any exponent larger than .
For , one has and , so the optimal Hölder exponents are given by
[TABLE]
The intuitive reason why Theorem 1.7 is true is as follows. If is an -thick point for , i.e., the circle average satisfies as , then we can show that the -distance from to behaves like as . Indeed, this is an easy consequence of the estimates in Section 3.4. Almost surely, -thick points exist for but not for [HMP10].
We next state some basic moment estimates for distances which are metric analogues of the well-known fact that the -LQG measure has finite moments of all orders in [RV14, Theorems 2.11 and 2.12].
Theorem 1.8** (Moment bounds for diameters).**
Let be open and let be a compact connected set with more than one point. Then the -internal diameter of satisfies
[TABLE]
For , we get finite moments up to order 6. We also have the following bound for distances between sets. In this case, we get finite moments of all orders.
Theorem 1.9** (Distance between sets).**
Let be an open set (possibly all of ) and let be connected, disjoint compact sets which are not singletons. Then
[TABLE]
The results of [DDDF19] show that if is a subsequential scaling limit of the LFPP metrics (1.5), then one has the following slightly stronger version of Theorem 1.9:
[TABLE]
for constants allowed to depend on . A posteriori, one gets (1.15) for every weak LQG metric since [GM19c] proves that the weak LQG metric is unique for each , so in particular it is the limit of LFPP.
We now turn our attention to point-to-point distances. These estimates also work if we allow the field to have a log singularity. To make sense of the metric in this case, we note that since is continuous away from 0, we can define as a continuous length metric on by , in the notation (1.7). We can then extend to a metric defined on all of which is allowed to take the value by taking the infima of the -lengths of paths. We can similarly define the metric associated with fields with two or more log singularities.
Theorem 1.10** (Distance from a point to a circle).**
Let and let . If , then
[TABLE]
If , then a.s. for every .
For example, if and , we get finite moments up to order 10. If instead and (which corresponds to the case when 0 is a “quantum typical” point, see, e.g., [DS11, Proposition 3.4]) we only get finite moments up to order 2. In the critical case when , our estimates at this point are not sufficiently sharp to determine whether D_{h^{Q}}\mathopen{}\mathclose{{}\left(0,\partial\mathbbm{D}}\right) is finite. However, once we know that every weak LQG metric is a strong LQG metric (which is proven in [GM19c]) it is not hard to check that a.s. D_{h^{Q}}\mathopen{}\mathclose{{}\left(0,z}\right)=\infty for every . Similar comments apply in the case when or in Theorem 1.11 just below.
Theorem 1.11** (Distance between two points).**
Let , let be distinct, and let . If , then
[TABLE]
If either or , then a.s. .
As applications of our main results, in Section 4 we will also prove some estimates which constrain the behavior of -geodesics and which will be important in [GM19c]. To be more precise, the first main estimate of Section 4 is Proposition 4.1, which gives an upper bound for the amount of time that a -geodesic can spend in a small neighborhood of a line segment or a circular arc. Intuitively, one expects that this amount of time is small since LQG geodesics should be fractal and hence should look very different from smooth curves. The particular bound given in Proposition 4.1 is used in [GM19c, Section 3] to prevent a geodesic from spending a long time in an annulus with a small aspect ratio; and in [GM19c, Section 5] in order to force a geodesic to enter a “good” region of the plane in which certain distance bounds hold.
The other main estimate in Section 4 is Proposition 4.3, which is an upper bound for how much time an LQG geodesic can spend near the boundary of an LQG metric ball centered at its starting point. Intuitively, this amount of time should be small since if is a -geodesic, then but is constant on the boundary of a -ball centered at . The bound given in Proposition 4.3 is used in [GM19c, Lemma 4.7].
Remark 1.12** (The case when ).**
Throughout this paper, we focus on the case of weak -LQG metrics. Since is increasing [DG18, Proposition 1.7], weak -LQG metrics have parameter (here, ). It is natural to wonder whether one can say anything about weak LQG metrics which satisfy the same axioms but with a parameter . In the critical case when (i.e., ), we expect that a weak LQG metric still exists and is the scaling limit of LFPP with parameter . This metric should be the -LQG metric with (the metric should also be the limit as of the -LQG metrics, appropriately renormalized). We expect that all of the theorem statements in this section still hold for , except that the metric is not Hölder continuous w.r.t. the Euclidean metric.
For , we do not expect that any weak LQG metrics with parameter exist. However, there should be metrics which satisfy a similar list of properties except that such metrics no longer induce the Euclidean topology. Instead, there should be an uncountable, dense set of points such that for every . More precisely, let be the exponent for the typical LFPP distance between the left and right sides of and let . By [DG18, Theorem 1.5], . By [GP19a, Lemma 4.1] and [DGS20, Theorem 1.1], for . For , the points which lie at infinite -distance from every other point should correspond to so-called thick points of (as defined in [HMP10]) with thickness .
It is shown in [DG20] that LFPP with parameter admits subsequential scaling limits in law w.r.t. the topology on lower semicontinuous functions. We expect that the subsequential limit is unique, satisfies the properties discussed in the preceding paragraph, and is related to LQG with matter central charge (LQG with corresponds to ). In particular, with as above, the central charge should be related to by . See [GHPR19, GP19a, DG20, DGS20, APPS20] for further discussion of this extended phase of LQG and some justification for the above predictions.
1.4 Outline
In Section 2, we prove Theorem 1.2, which says that subsequential limits of LFPP are weak -LQG metrics, taking [DDDF19] as a starting point. Throughout the rest of the paper, we work with an arbitrary weak -LQG metric (not necessarily assumed to arise as a subsequential limit of LFPP). Section 3 contains the proofs of the results stated in Section 1.3. In fact, for most of these results, we will prove more quantitative versions which are required to be uniform over all Euclidean scales. At this point, these statements are not implied by the statements in Section 1.3 since we are working with a weak -LQG metric, which is only known to be “tight across scales” (Axiom V) instead of exactly scale invariant.
The first result that we prove for a weak -LQG metric is the estimate for the distance between two sets from Theorem 1.9; this is the content of Section 3.1. In Section 3.2, we use this estimate to relate -distances to LFPP distances and thereby prove Theorem 1.5. Once Theorem 1.5 is established, we have some ability to compare -distances at different Euclidean scales. This allows us to prove the moment estimate (1.13) of Theorem 1.8 in Section 3.3 as well as the moment estimates of Theorems 1.10 and 1.11 in Section 3.4. Using these moment estimates, we then prove Theorem 1.7 in Section 3.5.
In Section 4, we apply the estimates of Section 1.3 to prove some bounds for -geodesics.
1.5 Basic notation
We write and .
For , we define the discrete interval .
If and , we say that (resp. ) as if remains bounded (resp. tends to zero) as . We similarly define and errors as a parameter goes to infinity.
If , we say that if there is a constant (independent from and possibly from other parameters of interest) such that . We write if and .
Let be a one-parameter family of events. We say that occurs with
- •
polynomially high probability as if there is a (independent from and possibly from other parameters of interest) such that .
- •
superpolynomially high probability as if for every .
We similarly define events which occur with polynomially or superpolynomially high probability as a parameter tends to .
We will often specify any requirements on the dependencies on rates of convergence in and errors, implicit constants in , etc., in the statements of lemmas/propositions/theorems, in which case we implicitly require that errors, implicit constants, etc., appearing in the proof satisfy the same dependencies.
For and , we write for the Euclidean ball of radius centered at . We also define the open annulus
[TABLE]
We write for the open Euclidean unit square.
2 Subsequential limits of LFPP are weak LQG metrics
The goal of this section is to deduce Theorem 1.2 from the tightness result of [DDDF19]. We start in Section 2.1 by introducing a “localized” variant of LFPP, defined using the convolution of with a truncated version of the heat kernel, which (unlike the -LFPP metric defined in (1.5)) depends locally on . We then show that this localized variant of LFPP is a good approximation for (Lemma 2.1). In Section 2.2, we explain why the results of [DDDF19] imply that the re-scaled LFPP metrics as well as the associated internal metrics on certain domains in are tight w.r.t. the local uniform topology and that every subsequential limit is a continuous length metric on . In Sections 2.3, 2.4, and 2.5, respectively, we will prove versions of Weyl scaling, tightness across scales, and locality for the subsequential limits (i.e., Axioms III, V, and II). In Section 2.6, we use a theorem from [GM19d] to show that subsequential limits of LFPP can be realized as measurable functions of . We then conclude the proof of Theorem 1.2.
Throughout this section, we will frequently need to switch between working with a whole-plane GFF and working with a whole-plane GFF plus a continuous function. As such, we will always write for a whole-plane GFF (with some choice of additive constant, specified as needed) and for a whole-plane GFF plus a continuous function (usually, this will be a whole-plane GFF plus a bounded continuous function). Note that this differs from the convention elsewhere in the paper, where is sometimes used to denote a whole-plane GFF plus a continuous function.
2.1 A localized version of LFPP
Let be a whole-plane GFF plus a bounded continuous function. The mollified field of (1.1) does not depend on in a local manner, and hence -distances do not depend on in a local manner. However, as the heat kernel concentrates around the diagonal, so we expect that “almost” depends locally on when is small. To quantify this, we will introduce an approximation of which depends locally on and prove a lemma (Lemma 2.1) to the effect that and are close when are small. This will be useful at several places in this section, especially for the proof of locality (essentially, Axiom II) in Section 2.5.
For , let be a deterministic, smooth, radially symmetric bump function which is identically equal to 1 on and vanishes outside of (in fact, the power could be replaced by any ). We can choose in such a way that is a continuous mapping from to the space of continuous functions on , equipped with the uniform topology. Recalling that denotes the heat kernel, we define
[TABLE]
with the integral interpreted in the sense of distributional pairing. Since vanishes outside of , we have that is a.s. determined by . It is easy to see that a.s. admits a continuous modification (see Lemma 2.1 below). We henceforth assume that is replaced by such a modification.
As in (1.5), we define the localized LFPP metric
[TABLE]
where the infimum is over all piecewise continuously differentiable paths from to . By the definition of ,
[TABLE]
Lemma 2.1**.**
Let be a GFF plus a bounded continuous function. Then a.s. is continuous. Furthermore, for each bounded open set , a.s.
[TABLE]
In particular, a.s.
[TABLE]
To prove Lemma 2.1, we will need the following elementary estimate for the circle average process, whose proof we postpone until after the proof of Lemma 2.1.
Lemma 2.2**.**
Let be a whole-plane GFF (with any choice of additive constant) and let be its circle average process. For each and , a.s.
[TABLE]
Proof of Lemma 2.1.
We first consider the case when is a whole-plane GFF normalized so that . The functions and are each radially symmetric about , i.e., they depend only on . Using the circle average process , we may therefore write in polar coordinates
[TABLE]
From this representation and the continuity of the circle average process, we infer that a.s. admits a continuous modification.
Since on and takes values in ,
[TABLE]
By Lemma 2.2 (applied with , say), there is a random constant such that for each and . Plugging this into (2.8) shows that a.s.
[TABLE]
which tends to zero exponentially fast as . This gives (2.4) in the case of a whole-plane GFF with .
If is a bounded continuous function, we similarly obtain a.s. , using the notation (1.1) and (2.1) with in place of or . This gives (2.4) in the case of a whole-plane GFF plus a bounded continuous function. The relation (2.5) is immediate from (2.2) and the definition of LFPP. ∎
To conclude the proof of Lemma 2.1 we still need to prove Lemma 2.2. To deal with large values of , we will use the following lemma.
Lemma 2.3**.**
Let be a whole-plane GFF. For each and , a.s.
[TABLE]
Proof.
The process is centered Gaussian with variances bounded above by a constant depending only on . Furthermore, this process a.s. admits a continuous modification [DS11, Proposition 3.1], so if we replace it by such a modification then a.s. . By the Borel-TIS inequality [Bor75, SCs74] (see, e.g., [AT07, Theorem 2.1.1]), we have \mathbbm{E}\mathopen{}\mathclose{{}\left[\sup_{z\in B_{R}(0)}\sup_{r\in[1/2,1]}|h_{r}(z)-h_{r}(0)|}\right]<\infty and there are constants depending only on such that for each ,
[TABLE]
Note that we absorbed the -dependent constant \mathbbm{E}\mathopen{}\mathclose{{}\left[\sup_{z\in B_{R}(0)}\sup_{r\in[1/2,1]}|h_{r}(z)-h_{r}(0)|}\right] into .
By the scale invariance of the law of , viewed modulo an additive constant, we infer from (2.11) that for each and ,
[TABLE]
By applying this with equal to a universal constant times , say, then using the Borel-Cantelli lemma, we get that a.s.
[TABLE]
Each is contained in for each and each is contained in for some . Hence, (2.13) implies that a.s.
[TABLE]
Since is a standard two-sided linear Brownian motion [DS11, Section 3], it follows that a.s. as . Combining this with (2.14) yields (2.10). ∎
Proof of Lemma 2.2.
Standard estimates for the maximum of the circle average process (see, e.g., the proof of [HMP10, Lemma 3.1]) show that a.s.
[TABLE]
By the continuity of the circle average process, a.s. for any , . By Lemma 2.3, it is a.s. the case that for each large enough ,
[TABLE]
Combining these estimates gives (2.6). ∎
2.2 Subsequential limits
In this subsection we explain why the results of [DDDF19] imply that the laws of the re-scaled LFPP metrics are tight (this is not entirely immediate since [DDDF19] considers a slightly different class of fields and only looks at metrics on bounded domains). We will in fact obtain a stronger convergence statement which also includes the convergence of internal metrics of on a certain class of sub-domains of .
Definition 2.4** (Dyadic domain).**
A closed square is dyadic if has side length and corners in for some . We say that is a dyadic domain if there exists a finite collection of dyadic squares such that is the interior of . Note that a dyadic domain is a bounded open set.
Lemma 2.5**.**
Let be a whole-plane GFF plus a bounded continuous function.
- A.
The laws of the metrics are tight w.r.t. the local uniform topology on and any subsequential limit of these laws is supported on continuous length metrics on . 2. B.
Let be the (countable) set of all dyadic domains. For any sequence of positive ’s tending to zero, there is a subsequence and a coupling of a continuous length metric on and a length metric on for each which induces the Euclidean topology on such that the following is true. Along , we have the convergence of joint laws
[TABLE]
where the first coordinate is given the local uniform topology on and each element of the collection in the second coordinate is given the uniform topology on . Furthermore, for each we have the a.s. equality of internal metrics .
In the setting of Assertion A, we note that the space of continuous functions , equipped with the local uniform topology, is separable and completely metrizable, which means that we can apply Prokhorov’s theorem in this space. Assertion 2.17 of Lemma 2.5 does not give that in law along for each . The reason why we do not prove this statement is to avoid worrying about possible pathologies near (see Lemma 2.11). We now proceed with the proof of Lemma 2.5. At several places in this section, we will use the following elementary scaling relation for LFPP.
Lemma 2.6**.**
Let be a whole-plane GFF normalized so that . Let and let , so that . The LFPP metrics defined as in (1.5) for and are related by
[TABLE]
Proof.
Using the notation (1.1), we get from a standard change of variables that the convolutions of and with the heat kernel satisfy for each and . Using the definition (1.5) of LFPP, we now compute
[TABLE]
∎
To check that our limiting metrics are length metrics, we will need the following standard fact from metric geometry.
Lemma 2.7**.**
Let be a compact topological space and let be a sequence of length metrics on which converge uniformly to a metric on . Then is a length metric on .
Proof.
This is [BBI01, Exercise 2.4.19], which in turn is an easy consequence of [BBI01, Corollary 2.4.17]. ∎
Let us now record what we get from [DDDF19].
Lemma 2.8**.**
Let be a closed square and let be a whole-plane GFF plus a bounded continuous function. The laws of the internal metrics for are tight w.r.t. the uniform topology on and any subsequential limit of these laws is supported on length metrics which induce the Euclidean topology on .
Proof.
We first consider the case when is the Euclidean unit square and is a whole-plane GFF normalized so that . Let be a zero-boundary GFF on . By the Markov property of the whole-plane GFF, we can couple and in such a way that is a.s. harmonic, hence continuous, on .
Recall the heat kernel . For and , we define the convolution as in (1.1). For , define as in (1.5) with in place of . It is shown in [DDDF19, Theorem 1] (see also [DDDF19, Section 6.1]) that there are constants such that the internal metrics \lambda_{\varepsilon}^{-1}D_{\mathring{h}}^{\varepsilon}\mathopen{}\mathclose{{}\left(\cdot,\cdot;[0,1]^{2}}\right) are tight w.r.t. the uniform topology on and any subsequential limit of these laws is supported on length metrics which induce the Euclidean topology on .
We now want to compare and using the fact that is a continuous function. However, we cannot do this directly since we only have a uniform bound for on compact subsets of and the convolution (1.1) does not depend locally on the field. To this end, we define the localized LFPP metrics and as in (2.2) with and with in place of , respectively. Then Lemma 2.1 remains true with and in place of and and with any open set satisfying , with the same proof (actually, the proof is simpler since one does not need Lemma 2.3). Therefore, a.s. uniformly over all distinct and the conclusion of the preceding paragraph is true with in place of .
Since is a.s. equal to a continuous function on a neighborhood of , we infer from (2.3) that a.s. the metrics and are bi-Lipschitz equivalent with (random) -independent Lipschitz constants. By combining this with the conclusion of the preceding paragraph and Lemma 2.7, we get that the laws of the internal metrics for are tight w.r.t. the uniform topology on and any subsequential limit of these laws is supported on length metrics which induce the Euclidean topology on . In particular, this implies that is bounded above and below by -independent constants times the median -distance between the left and right sides of . By Lemma 2.1 (for ), we now get that is bounded above and below by positive, finite constants and the statement of the lemma holds in the special case when and .
By Lemma 2.6 and the scale and translation invariance of the law of , modulo additive constant, this implies the statement of the lemma for a general choice of , but still with . If is a whole-plane GFF and is a bounded continuous function, then the metrics and are bi-Lipschitz equivalent, with Lipschitz constants . Hence the case of a whole-plane GFF implies the case of a whole-plane GFF plus a continuous function. ∎
We now upgrade from internal metrics on closed squares to internal metrics on closures of dyadic domains.
Lemma 2.9**.**
Let be a dyadic domain. The laws of the internal metrics for are tight w.r.t. the uniform topology on and any subsequential limit of these laws is supported on length metrics which induce the Euclidean topology on .
Proof.
If is a dyadic domain, then has finitely many connected components and these connected components are the closures of dyadic domains which lie at positive Euclidean distance from each other. By considering each connected component separately, we can assume without loss of generality that is connected.
For a connected set , a collection of random metrics on is tight w.r.t. the local uniform topology if and only if for each , there exists such that for each , it holds with probability at least that
[TABLE]
Indeed, this is an easy consequence of the Arzéla-Ascoli theorem, the Prokhorov theorem, and the triangle inequality.
For any closed square , the restriction of to is bounded above by the internal metric of on , which equals . By Lemma 2.8 and the above tightness criterion, the laws of the restrictions of to are tight. Since is a dyadic domain, we can choose a finite collection of closed squares such that .
By the above tightness criterion applied to each square in , for each , there exists such that for each , it holds with probability at least that
[TABLE]
Now assume that (2.20) holds and consider points such that but and do not lie in the same square of . If is sufficiently small (depending only on the collection of squares ), then we can find squares such that , and . Since and are closed squares, geometric considerations show that there is a such that and . By (2.20) and the triangle inequality this implies that . Therefore, it holds with probability at least that
[TABLE]
Since is arbitrary, the above tightness criterion applied on all of now shows that the laws of the metrics for are tight w.r.t. the uniform topology on .
Let be a subsequential limit of in law w.r.t. the local uniform topology. A priori might be a pseudometric, not a metric. We need to show that is in fact a length metric and that it induces the Euclidean topology on . To this end, consider two squares (not necessarily dyadic) such that lies at positive Euclidean distance from . For each , we have and in law. From this and Lemma 2.8, we infer that a.s. . By considering an appropriate countable collection of such square annuli whose inner squares cover , we infer that a.s. whenever with . This implies that is a metric. Since is compact, it follows that induces the Euclidean topology on . By Lemma 2.7, is a length metric. ∎
The following lemma will allow us to extract tightness of from tightness of for squares .
Lemma 2.10**.**
For , let be the closed square of side length centered at zero. Let be a whole-plane GFF plus a bounded continuous function. For each and each , there exists (depending on and the law of ) such that for each fixed ,
[TABLE]
Proof.
We first consider the case when is a whole-plane GFF normalized so that . By Lemma 2.8 applied with , there exists such
[TABLE]
The occurrence of the event in (2.22) is unaffected by re-scaling by a constant factor. By Lemma 2.6 applied with in place of , we see that (2.22) implies that for each fixed ,
[TABLE]
Now suppose that is a whole-plane GFF plus a bounded continuous function. If is a (possibly random) bounded continuous function, then and are a.s. bi-Lipschitz equivalent with Lipschitz constants and . Furthermore, since is a.s. bounded exists a deterministic such that \mathbbm{P}\mathopen{}\mathclose{{}\left[e^{\xi\|f\|_{\infty}}\leq A}\right]\geq p. By (2.23) with in place of , we get (2.21) but with in place of . Since can be made arbitrarily close to 1, this yields (2.21). ∎
The last lemma we need for the proof of Lemma 2.5 is the following deterministic compatibility statement for limits of internal metrics, which is used to get the relationship between internal metrics in assertion 2.17 of Lemma 2.5.
Lemma 2.11**.**
Let be open. Let be a sequence of continuous length metrics on which converges to a continuous length metric (w.r.t. the local uniform topology on ). Suppose also that converges to a continuous length metric w.r.t. the uniform topology on . Then .
In the setting of Lemma 2.11, we do not necessarily have . The reason is that it could be, e.g., that paths of near-minimal -length spend a positive fraction of their time in .
Proof of Lemma 2.11.
Let such that . Since is a length metric, . Furthermore, for large enough we have which implies that . Therefore, converges to both and . Furthermore, we have which implies that . Consequently, for each with . This implies that the -length of any path in which lies at positive Euclidean distance from is the same as its -length. Since and are length metrics, we conclude that . ∎
Proof of Lemma 2.5.
For , let be the closed square of side length centered at zero, as in Lemma 2.10. Let and let be as in Lemma 2.10 with and with , say, in place of . Then for each fixed and each small enough , it holds with probability at least that
[TABLE]
We now apply Lemma 2.8 with and use that can be made arbitrarily close to 1 to get that the laws of are tight w.r.t. the local uniform topology on . Furthermore, any subsequential limit in law of these metrics a.s. induces the Euclidean topology on . Since can be made arbitrarily large, we get that the metrics are tight w.r.t. the local uniform topology on and any subsequential limit in law is a.s. a continuous metric on .
To prove assertion A, it remains to check that if is a subsequential limit in law of the metrics , then a.s. is a length metric. To this end, let and let be as above. By Lemma 2.8, if we are given then by possibly passing to a further subsequence we can arrange that along our subsequence, the joint law of converges to a coupling where is a length metric on . By passing to the (subsequential) limit in (2.2), we get that with probability at least ,
[TABLE]
By Lemma 2.11, a.s. the internal metrics of and on the interior of coincide. Hence (2.2) implies that with probability at least , is equal to the infimum of the -lengths of all continuous paths from to which are contained in the interior of , which (by the first condition in (2.2)) is equal to the infimum of the -lengths of all continuous paths from to . Since can be made arbitrarily close to 1 and can be made arbitrarily large, we get that a.s. is a length metric.
To get the joint convergence (2.17), we first apply Lemma 2.9 and the Prokhorov theorem to get that the joint law of the metrics on the left side of (2.17) is tight. Moreover any subsequential limit of these joint laws is a coupling of a continuous length metric on and a length metric on for each which induces the Euclidean topology on . We then apply Lemma 2.11 to say that for each . ∎
2.3 Weyl scaling
The following lemma will be used to check Axiom III.
Lemma 2.12**.**
Let be a whole-plane GFF plus a bounded continuous function and consider a sequence along which converges in law to some metric w.r.t. the local uniform topology. Suppose we have, using the Skorokhod theorem, coupled so this convergence occurs a.s. Then, a.s., for every sequence of bounded continuous functions such that converges to a bounded continuous function uniformly on compact subsets of , we have the local uniform convergence , where here is defined as in (1.5) with in place of and is defined as in (1.7).
As a consequence of Lemma 2.12, if is a whole-plane GFF plus a bounded continuous function and is a sequence along which in law, then whenever is another whole-plane GFF plus a bounded continuous function, we have in law for some limiting metric . Furthermore, can be coupled together in such a way that is a bounded continuous function and . Consequently, any subsequence along which converges in law gives us a way to define a metric associated with any whole-plane GFF plus a bounded continuous function.
Proof of Lemma 2.12.
Let be defined as in (1.1) with with in place of . Then uniformly on compact subsets of . By the definition (1.5) of LFPP, we have .
We now want to apply an argument as in the proof of [DF18, Lemma 7.1] to say that w.r.t. the local uniform topology. That lemma only applies for metrics defined on squares, so we need to localize. We do this by means of Lemma 2.10. By taking a limit as in the estimate of Lemma 2.10, then sending , we find that a.s. for each and each , there exists (random) such that
[TABLE]
Furthermore, the uniform convergence , we get that (2.26) is a.s. true with in place of for large enough , but with instead of . This implies that each path of near-minimal -length between two points of is contained in , and the same is true with in place of for large enough . If we choose , then from (2.26) we deduce that each path of near-minimal -length between two points of is contained in , and the same is true with in place of for large enough . With these conditions in hand, the lemma now follows from the same proof as in [DF18, Lemma 7.1]. ∎
2.4 Tightness across scales
In this section we check that subsequential limits of LFPP satisfy Axiom V. For the statement, we note that we can take a subsequential limit of the joint laws of due to Lemma 2.5 and the Prokhorov theorem.
Lemma 2.13**.**
Let be a whole-plane GFF normalized so that . Let be any subsequential limit of the laws of the field/metric pairs . There are deterministic constants , depending on the law of , such that the laws of the metrics are tight w.r.t. the local uniform topology. Furthermore, the closure of this set of laws w.r.t. the Prokhorov topology for probability measures on continuous functions is contained in the set of laws on continuous metrics on . Finally, there exists such that for each ,
[TABLE]
We first produce the scaling constants appearing in Axiom V.
Lemma 2.14**.**
Consider a sequence converging to zero along which converges in law to a limiting metric . For each , the limit
[TABLE]
exists and satisfies the relation (2.27) for some choice of depending only on and .
Proof.
Let be as in Lemma 2.6, so that . By our choice of subsequence and Lemma 2.6,
[TABLE]
in law w.r.t. the local uniform topology on . Let be the median distance between the left and right boundaries of w.r.t. the metric on the right side of (2.29). Since ,
[TABLE]
If we consider a subsequence of along which the joint law of and converges, then (2.30) shows that along this subsequence, converges to some number (we know the limit is strictly positive since the limits of and are metrics). By the definitions of and of and Portmanteau’s lemma, the median distance between the left and right boundaries of w.r.t. the metric on the left (resp. right) side of (2.30) is 1 (resp. ). Hence , i.e., the limit does not depend on the choice of subsequence . This shows the convergence of along the subsequence , which in turn implies the existence of the limit (2.28). The bounds (2.27) (in fact, substantially stronger bounds) are immediate from [DDDF19, Theorem 1, Equation (1.3)] and the fact the ratio of our and the scaling factor from [DDDF19] is bounded above and below by deterministic, -independent constants (see the proof of Lemma 2.8). ∎
Proof of Lemma 2.13.
Define for as in Lemma 2.14. Let , as in Lemma 2.6, so that and the metrics and are related as in (2.18). We know from Lemma 2.5 that the laws of the metrics are tight, and every element of the closure of this set of laws is supported on continuous metrics on . It follows that the same is true for the laws of the metrics . By combining this with (2.18), we get that the laws of the metrics
[TABLE]
are tight and every element of the closure of this set of laws w.r.t. the Prokhorov topology is supported on continuous metrics on .
Now consider a subsequence along which in law. By the definition (2.28) of ,
[TABLE]
Therefore, the metrics for are all subsequential limits as of the family of random metrics (2.31). It follows that the laws of the metrics are tight and every element of the closure of this set of laws is supported on continuous metrics on . ∎
2.5 Locality
In this section, we will prove a variant of Axiom II for subsequential limits of LFPP, restricted to the case of a whole-plane GFF (locality for a whole-plane GFF plus a continuous function will be checked in Section 2.6). At this point, we have not yet established that such subsequential limits can be realized as measurable functions of the field, so we will actually check a somewhat different condition. In what follows, if is closed we define the -algebra generated by to be . With this definition it makes sense to condition on . The following definitions first appeared in [GM19d].
Definition 2.15** (Local metric).**
Let be a connected open set and let be a coupling of a GFF on and a random continuous length metric on . We say that is a local metric for if for any open set , the internal metric is conditionally independent from the pair given .
Definition 2.15 is formulated in a slightly different way than [GM19d, Definition 1.2]; the equivalence of the definitions is proven in [GM19d, Lemma 2.3]. The following is [GM19d, Definition 1.5].
Definition 2.16** (Additive local metric).**
Let be a connected open set and let be a coupling of a GFF on and a random continuous length metric on which is local for . For , we say that is -additive for if for each and each such that , the metric is local for .
Lemma 2.17**.**
Let be a whole-plane GFF. Let be any subsequential limit of the laws of the pairs . Then is a -additive local metric for . That is, suppose and and that is normalized so that the circle average is zero. Also let be an open set. Then the internal metric is conditionally independent from the pair \mathopen{}\mathclose{{}\left(h,D_{h}(\cdot,\cdot;\mathbbm{C}\setminus\overline{V})}\right) given .
There are two main difficulties in the proof of Lemma 2.17.
The mollified GFF of (1.1) does not exactly depend locally on (since the heat kernel does not have compact support), so the -lengths of paths are not locally determined by . 2. 2.
Conditional independence does not in general behave nicely under taking limits in law.
Difficulty 1 will be resolved by means of the localization results for LFPP in Section 2.1. To resolve Difficulty 2, we will use the Markov property of the GFF (see Lemma 2.18) and Weyl scaling (Lemma 2.12) in order to reduce to working with metrics which are actually independent, not just conditionally independent. The use of the Markov property is the reason why we restrict to a whole-plane GFF, not a whole-plane GFF plus a bounded continuous function, in Lemma 2.17.
For the proof of Lemma 2.17 we will need the following version of the Markov property of the whole-plane GFF, which is proven in [GMS19, Lemma 2.2]. We note that the statement of this Markov property is slightly more complicated than in the case of the zero-boundary GFF due to the need to fix the additive constant for .
Lemma 2.18** ([GMS19]).**
Let and and let be a whole-plane GFF with the additive constant chosen so that . For each open set which is non-polar (i.e., Brownian motion started in a.s. hits in finite time), we have the decomposition
[TABLE]
where is a random distribution which is harmonic on and is determined by and is independent from and has the law of a zero-boundary GFF on minus its average over . If is disjoint from , then is a zero-boundary GFF and is independent from .
The following lemma will allow us to apply Lemma 2.18 to study .
Lemma 2.19**.**
It suffices to prove Lemma 2.17 in the case when .
Proof.
Assume that we have proven Lemma 2.17 in the case when . Fix and such that and assume that is normalized so that . By assumption, is conditionally independent from the pair \mathopen{}\mathclose{{}\left(h,D_{h}(\cdot,\cdot;\mathbbm{C}\setminus\overline{V})}\right) given .
Now let and and define , so that is a whole-plane GFF normalized so that . Lemma 2.12 implies that in law along the same subsequence for which in law, so is unambiguously defined. We need to show that the conclusion of the first paragraph remains true with in place of .
The key fact which allows us to show this is that . Since , this means that h_{r}(z)\in\sigma\mathopen{}\mathclose{{}\left(\widetilde{h}|_{\overline{V}}}\right). In particular, is determined by . Therefore, our assumption implies that is conditionally independent from the pair \mathopen{}\mathclose{{}\left(h,D_{h}(\cdot,\cdot;\mathbbm{C}\setminus\overline{V})}\right) given (instead of just ).
We have , so is determined by and . Similarly, is determined by and . Obviously, and determine the same information. Therefore, is conditionally independent from the pair \mathopen{}\mathclose{{}\left(\widetilde{h},D_{\widetilde{h}}(\cdot,\cdot;\mathbbm{C}\setminus\overline{V})}\right) given , as required. ∎
Proof of Lemma 2.17.
Step 1: reductions. By Lemma 2.1, for any sequence of ’s tending to zero along which in law, we also have in law. This allows us to work with instead of throughout the proof. The reason why we want to do this is the locality property (2.3) of .
The statement of the lemma is vacuous if , so we can assume without loss of generality that , which implies that is non-polar. By Lemma 2.19, we can also assume without loss of generality that . These assumptions together with Lemma 2.18 applied with in place of allows us to write
[TABLE]
where is a random harmonic function on which is determined by and is a zero-boundary GFF in which is independent from .
Step 2: independence for LFPP. We want to apply the convergence of internal metrics given in Lemma 2.5, so we fix dyadic domains (Definition 2.4) with and (we will eventually let and increase to all of and , respectively). Let be a deterministic, smooth, compactly supported bump function which is identically equal to 1 on a neighborhood of and which vanishes outside of a compact subset of . See Figure 1 for an illustration of these objects.
The restrictions of the fields and to the set are identical. By the locality property (2.3) of , if is small enough that , then the -LFPP metric for satisfies
[TABLE]
Similarly, for small enough the metric is a.s. determined by . Since and are independent, we obtain
[TABLE]
Step 3: passing to the limit. We now want to pass the independence (2.35) through to the (subsequential) scaling limit. To this end, consider a sequence of positive ’s tending to zero along which in law. By possibly passing to a further deterministic subsequence, we can arrange that in fact in law along , where here the second coordinate is given the local uniform topology on . By the analog of Lemma 2.12 with in place of (which is proven in an identical manner), if we set , then along this same subsequence we have the convergence of joint laws
[TABLE]
By assertion 2.17 of Lemma 2.5, applied once to each of and , by possibly replacing with a further deterministic subsequence we can find a coupling of with length metrics on and , respectively, which induce the Euclidean topology and which satisfy
[TABLE]
such that the following is true. Along , we have the convergence of joint laws
[TABLE]
where the last two coordinates are given the uniform topology on and on , respectively. Since independence is preserved under convergence in law, we obtain from (2.35) and (2.5) that and are independent. By (2.37), this means that
[TABLE]
Step 4: adding back in the harmonic part. By (2.39), is conditionally independent from given . We now argue that is a measurable function of and , so that is conditionally independent from given . Indeed, by Lemma 2.12, a.s. . Hence is a measurable function of and . Since , we get that is a measurable function of and . It therefore follows that is conditionally independent from given . Letting increase to and increase to now concludes the proof. ∎
2.6 Measurability
We have not yet established that subsequential limits of LFPP can be realized as measurable functions of the corresponding field. We will accomplish this in this subsection using a result from [GM19d].
Lemma 2.20**.**
Let be a whole-plane GFF normalized so that and let be any subsequential limit of the laws of the pairs . Then is a.s. determined by . In particular, in probability along the given subsequence.
The following theorem is a special case of [GM19d, Corollary 1.8].
Theorem 2.21** ([GM19d]).**
There is a universal constant such that the following is true. Let , let be a whole-plane GFF normalized so that , and let be a coupling of with a random continuous length metric satisfying the following properties.
* is a -additive local metric for (Definition 2.16).* 2. 2.
Condition on and let and be conditionally i.i.d. samples from the conditional law of given . There is a deterministic constant such that
[TABLE]
Then is a.s. determined by .
Proof of Lemma 2.20.
Let be as in Theorem 2.21. Lemma 2.17 implies that is a -additive local metric for . Lemma 2.13 along with the translation invariance of the law of , modulo additive constant, implies that there exists (depending only on the choice of subsequence) such that for each and each ,
[TABLE]
[TABLE]
This implies that (2.40) holds for two conditionally independent samples from the conditional law of given . Hence the criteria of Theorem 2.21 are satisfied, so is a.s. determined by . The last statement follows from Lemma 1.3. ∎
Proof of Theorem 1.2.
Step 1: Defining a for a whole-plane GFF plus a bounded continuous function. Let be a whole-plane GFF normalized so that . Lemma 2.5 implies that for any sequence of ’s tending to zero, there is a subsequence along which in law. By Lemma 2.20, is a.s. determined by and in probability. Hence every deterministic subsequence of the ’s admits a further deterministic subsequence along which a.s. By Lemma 2.12, it is a.s. the case that for every bounded continuous function simultaneously, we have . We define . Then is a.s. determined by and converges in probability to .
This gives us a measurable function from distributions to continuous metrics on which is a.s. defined whenever is a whole-plane GFF plus a bounded continuous function: in particular, is the a.s. limit of . With this definition of , Axiom I holds with constrained to be a whole-plane GFF plus a bounded continuous function since we know that the limiting metric in the setting of Lemma 2.5 is a length metric. By the preceding paragraph, Axiom III holds for this definition of and with constrained to be bounded. It is immediate from the definition of LFPP that also Axiom IV holds. By Lemma 2.13, also Axiom V holds.
Step 2: locality for a whole-plane GFF plus a bounded continuous function. Axiom II in the case of a whole-plane GFF is immediate from Lemma 2.17 now that we know that is a.s. determined by . We now prove Axiom II in the case when is a whole-plane GFF plus a bounded continuous function. Indeed, let be open and let be open and bounded with and . Let be deterministic. We will show that
[TABLE]
Since is a.s. continuous, (2.41) implies that in fact a.s. determines the random function O\ni(u,v)\mapsto D_{\mathsf{h}}(u,v)\mathbbm{1}_{\mathopen{}\mathclose{{}\left\{D_{\mathsf{h}}(u,v)<D_{\mathsf{h}}(u,\partial O^{\prime})}\right\}}. Since is a compact subset of , can be covered by finitely many sets of the form for points . By the definition of the internal metric , this shows that a.s. determines . Letting increase to all of then shows that a.s. determines .
To prove (2.41), note that if we define the localized LFPP metric as in (2.2), then by Lemma 2.1 we have and in probability. Therefore,
[TABLE]
By (2.3) and since , the random variable on the left side of (2.42) is a.s. determined by for large enough . Thus (2.41) holds.
Step 3: extending to unbounded continuous function. We will now extend the definition of to the case of a whole-plane GFF plus an unbounded continuous function and check that the axioms remain true. To this end, let be a whole-plane GFF and let be a possibly random unbounded continuous function. If is open and bounded and is a smooth compactly supported bump function which is identically equal to 1 on , then is bounded so we can define the metric . By Axiom II in the case of a whole-plane GFF plus a bounded continuous function, this metric is a.s. determined by , in a manner which does not depend on . We now define the -length of any continuous path in to be the -length of , where is a bounded open set which contains The definition does not depend on the choice of . We define for to be the infimum of the -lengths of continuous paths from to . Then is a length metric on which is a.s. determined by and which satisfies for each bounded open set .
With the above definition, it is immediate from the case of a whole-plane GFF plus a bounded continuous function that the axioms in the definition of a weak -LQG metric are satisfied to the mapping , which is a.s. defined whenever is a whole-plane GFF plus a continuous function. ∎
3 Proofs of quantitative properties of weak LQG metrics
In this section we will prove the estimates stated in Section 1.3. Actually, in many cases we will prove a priori stronger estimates which are required to be uniform across different Euclidean scales. With what we know now, these estimates are not implied by the estimates stated in Section 1.3 since we are working with a weak -LQG metric so we have tightness across scales instead of exact scale invariance. However, a posteriori, once it is proven that a weak -LQG metric satisfies the coordinate change formula (1.9) (which will be done in [GM19c], building on the results in the present paper), the estimates in this section are equivalent to the estimates in Section 1.3. Throughout this section, denotes a weak LQG metric and denotes a whole-plane GFF normalized so that .
3.1 Estimate for the distance between sets
The goal of this subsection is to prove the following more precise version of Theorem 1.9 which is required to be uniform across scales. For the statement, we recall the scaling constants for from Axiom V.
Proposition 3.1**.**
Let be an open set (possibly all of ) and let be connected, disjoint compact sets which are not singletons. For each , it holds with superpolynomially high probability as , at a rate which is uniform in the choice of , that
[TABLE]
We now explain the idea of the proof of Proposition 3.1; see Figure 2 for an illustration. Using Axiom V and a general “local independence” lemma for the GFF (see Lemma 3.3 below), we can, with extremely high probability, cover by small Euclidean balls such that and the -distance across the annulus is bounded below by a constant times . Any path from to must cross at least one of these annuli. This leads to a lower bound for in terms of
[TABLE]
The first infimum in (3.2) can be bounded below by a positive power of times by (1.8). By being a little more careful about how we choose the balls , the second term in (3.2) can be reduced to an infimum over finitely many values of and , which can then be bounded below by a positive power of times using the Gaussian tail bound and a union bound (see Lemma 3.4). Choosing to be an appropriate power of then concludes the proof.
The upper bound in (3.1) is proven similarly, but in this case we instead cover by balls for which the -diameter of the circle is bounded above by a constant times , then “string together” a collection of such circles to get a path from to whose -length is bounded above. The hypothesis that and are connected and are not singletons allows us to force some of the circles in this path to intersect and .
We now explain how to cover by Euclidean balls with the desired properties. For , , and , let be the event that
[TABLE]
Lemma 3.2**.**
For each and each , there exists such that for each , it holds with probability at least as , at a rate which is uniform in , that the following is true. For each , there exists w\in B_{\mathbbm{r}\varepsilon^{-M}}(0)\cap\mathopen{}\mathclose{{}\left(\frac{\varepsilon^{1+\nu}\mathbbm{r}}{4}\mathbbm{Z}^{2}}\right) and such that occurs and .
We will prove Lemma 3.2 using the following result from [GM19d], which in turn follows from the near-independence of the GFF across disjoint concentric annuli. See in particular [GM19d, Lemma 3.1].
Lemma 3.3**.**
Fix . Let be a decreasing sequence of positive numbers such that for each and let be events such that E_{r_{k}}\in\sigma\mathopen{}\mathclose{{}\left((h-h_{r_{k}}(0))|_{\mathbbm{A}_{s_{1}r_{k},s_{2}r_{k}}(0)}}\right) for each . For , let be the number of for which occurs.
For each and each , there exists and such that if
[TABLE]
then
[TABLE]
Proof of Lemma 3.2.
By Axioms IV and V (also see (1.10)), for each there exists such that for every and , \mathbbm{P}\mathopen{}\mathclose{{}\left[E_{r}(z;C)}\right]\geq p. By the locality of and Axiom III, the event is determined by . We can therefore apply Lemma 3.3 to a logarithmic (in ) number of values of to find that for any choice of and , there is a large enough such that the following is true. For each it holds with probability at least that occurs for at least one value of . We now conclude the proof by choosing to be sufficiently large, in a manner depending only on , and taking a union bound over all z\in B_{\mathbbm{r}\varepsilon^{-M}}(0)\cap\mathopen{}\mathclose{{}\left(\frac{\varepsilon^{1+\nu}\mathbbm{r}}{4}\mathbbm{Z}^{2}}\right). ∎
The occurrence of the event allows us to bound distances in terms of circle averages and the scaling coefficients . The ’s can be bounded using (1.8). To bound the circle averages, we will need the following lemma.
Lemma 3.4**.**
For each , each , each , and each , it holds with probability 1-O_{\varepsilon}\mathopen{}\mathclose{{}\left(\varepsilon^{\frac{q^{2}}{2(1+\sqrt{\nu})^{2}}-2-2\nu}}\right), at a rate depending only on and (not on ) that
[TABLE]
Proof.
Fix to be chosen momentarily. For each , the random variable is a standard linear Brownian motion [DS11, Section 3]. We can therefore apply the Gaussian tail bound to find that
[TABLE]
The random variables for are centered Gaussian with variance . Applying the Gaussian tail bound again therefore gives
[TABLE]
Combining (3.7) and (3.8) applied with shows that for ,
[TABLE]
We now conclude by means of a union bound over values of w\in B_{R\mathbbm{r}}(0)\cap\mathopen{}\mathclose{{}\left(\frac{\varepsilon^{1+\nu}\mathbbm{r}}{4}\mathbbm{Z}^{2}}\right). ∎
Proof of Proposition 3.1.
Throughout the proof, all and errors are required to be uniform in the choice of . We also impose the requirement that is bounded — we will explain at the very end of the proof how to get rid of this requirement.
Set , say, and fix a large , which we will eventually send to . Let be chosen as in Lemma 3.2 and for and , let be the event of Lemma 3.2 for this choice of , so that . We will eventually take for a small constant , so will be a large negative power of (i.e., the power goes to as ) but will be a fixed negative power of (which does not go to when ).
By Lemma 3.4 (applied with and ), it holds with probability that
[TABLE]
Henceforth assume that occurs and (3.10) holds, which happens with probability . We will now prove lower and upper bounds for D_{h}\mathopen{}\mathclose{{}\left(\mathbbm{r}K_{1},\mathbbm{r}K_{2};\mathbbm{r}U}\right) in terms of .
Step 1: lower bound. By the definition of , if is sufficiently small, depending on , then each path from to must cross from to for some w\in B_{\varepsilon\mathbbm{r}}(\mathbbm{r}U)\cap\mathopen{}\mathclose{{}\left(\frac{\varepsilon^{2}\mathbbm{r}}{4}\mathbbm{Z}^{2}}\right) and for which occurs. Therefore,
[TABLE]
Step 2: upper bound. It is easily seen from the definition of (see Lemma 3.5 below) that if is sufficiently small (depending only on and ) then the union of the circles for w\in B_{\varepsilon\mathbbm{r}}(\mathbbm{r}U)\cap\mathopen{}\mathclose{{}\left(\frac{\varepsilon^{2}\mathbbm{r}}{4}\mathbbm{Z}^{2}}\right) and such that occurs contains a path from to which is contained in . The total number of such circles is at most , so by the triangle inequality,
[TABLE]
Step 3: choosing . The bounds (3.1) and (3.1) hold with probability . Given , we now choose , where is a small constant (depending only on ) chosen so that the right side of (3.1) is at least and the right side of (3.1) is at most . Then (3.1) and (3.1) imply that
[TABLE]
If is a possibly unbounded open subset of with , then . Since can be made arbitrarily large, we now obtain (3.1) (with possibly unbounded) from (3.13). ∎
The following lemma was used in the proof of the upper bound of Proposition 3.1.
Lemma 3.5**.**
Assume that we are in the setting of Proposition 3.1, with bounded. Define the event as in the proof of Proposition 3.1. For small enough (depending on ), on , the union of the circles for w\in B_{\varepsilon\mathbbm{r}}(\mathbbm{r}U)\cap\mathopen{}\mathclose{{}\left(\frac{\varepsilon^{2}\mathbbm{r}}{4}\mathbbm{Z}^{2}}\right) and such that occurs contains a path from to which is contained in .
Proof.
Throughout the proof we assume that occurs. By the definition of and since is connected, if is chosen so be sufficiently small then the union of the balls for as in the lemma statement contains a path from to which is contained in . Let be a sub-collection of these balls which is minimal in the sense that contains a path from to in and no proper sub-collection of the balls in has this property. Choose a path from to in .
We first observe that is connected. Indeed, if this set had two proper disjoint open subsets, then each would have to intersect (by minimality) which would contradict the connectedness of . Furthermore, by minimality, no ball in is properly contained in another ball in .
We claim that is connected. Indeed, if this were not the case then we could partition such that and are non-empty and and are disjoint. By the minimality of , it cannot be the case that any ball in is contained in . Furthermore, since and are disjoint, it cannot be the case that any ball in intersects both and (otherwise, such a ball would have to intersect the boundary of some ball in ). Therefore, and are disjoint. Since no element of can be contained in , we get that and are disjoint. This contradicts the connectedness of , and therefore gives our claim.
Since is a path from to and each of and is connected and not a single point, if , then the boundaries of the balls in which contain the starting and endpoint points of must intersect and , respectively. Hence for such an , contains a path from to , as required. ∎
3.2 Asymptotics of the scaling constants
The goal of this section is to prove Theorem 1.5. We will accomplish this by comparing -distances to a variant of the Liouville first passage percolation (LFPP) which we now define.
For and , we view as a graph with adjacency defined by
[TABLE]
Note that this differs from the standard nearest-neighbor graph structure in that we also include the diagonal edges. We define the discretized -LFPP metric with parameter on by
[TABLE]
where the minimum is over all paths from to in (the tilde is to distinguish this from the variant of LFPP defined in (1.5)).
Recall that denotes the open Euclidean unit square. Below, we will show, using Proposition 3.1 and a union bound over a polynomial number of squares contained in , that with high probability,
[TABLE]
The reason why discretized LFPP comes up in this estimate is the circle average term in Proposition 3.1. We know that the distance across the square is of order , uniformly in , by the results of [DG18] (see Lemma 3.6 just below). Hence (3.16) leads to , as required.
For a square , we write and for the set of leftmost (resp. rightmost) vertices of .
Lemma 3.6**.**
Fix . For , it holds with probability tending to 1 as , uniformly in the choice of , that
[TABLE]
Proof.
We first reduce to the case when . Indeed, by the scale and translation invariance of the law of , modulo additive constant, we have . Moreover, from the definition (3.15) it is easily seen that
[TABLE]
Hence e^{-\xi h_{\mathbbm{r}}(0)}\widetilde{D}_{h}^{\delta\mathbbm{r}}\mathopen{}\mathclose{{}\left(\cdot,\cdot;\mathbbm{r}\mathbbm{S}}\right)\overset{d}{=}\widetilde{D}_{h}^{\delta}(\cdot,\cdot;\mathbbm{S}), so we only need to prove the lemma when , i.e., we need to show that with probability tending to 1 as , we have
[TABLE]
This follows from the LFPP distance exponent computation in [DG18]. To be more precise, [DG18, Theorem 1.5] shows that for continuum LFPP defined using the circle average process of the GFF, as in (1.5), the -LFPP distance between the left and right boundaries of is of order with probability tending to 1 as . Combining this with [DG18, Lemma 3.7] shows that the same is true for continuum LFPP defined using the white-noise approximation , as defined in [DG18, Equation (3.1)], in place of the circle average process. The same argument as in the proof of [DG18, Proposition 3.16] then shows that (3.19) holds if we replace the circle average by the white-noise approximation in the definition of (here we note that the definition of discretized LFPP in [DG18, Equation (3.32)] has an extra factor of as compared to (3.15), which is why we get instead of ). The desired formula (3.19) now follows by combining this with the uniform comparison of and from [DG18, Lemma 3.7]. ∎
For the proof of Theorem 1.5 (and at several later places in this section) we will use the following terminology.
Definition 3.7** (Distance around an annulus).**
For a set with the topology of a an annulus, we define the -distance around to be the infimum of the -lengths of the paths in which disconnect the inner and outer boundaries of .
Proof of Theorem 1.5.
Step 1: estimates for . For , we write for the square of side length centered at and for the -neighborhood of this square. Fix . By Proposition 3.1 and a union bound over all , it holds with superpolynomially high probability as that (in the terminology of Definition 3.7)
[TABLE]
Similarly, it holds with superpolynomially high probability as that
[TABLE]
Henceforth assume that (3.20) and (3.21) both hold.
Step 2: lower bound for . Let be a path in (with the graph structure defined by (3.14)) from to for which the sum in (3.15) equals \widetilde{D}_{h}^{\delta\mathbbm{r}}\mathopen{}\mathclose{{}\left(\partial_{\operatorname{L}}^{\delta\mathbbm{r}}(\mathbbm{r}\mathbbm{S}),\partial_{\operatorname{R}}^{\delta\mathbbm{r}}(\mathbbm{r}\mathbbm{S});\mathbbm{r}\mathbbm{S}}\right). For each , let be a path in which disconnects the inner and outer boundaries of and whose -length is at most . Such a path exists by (3.20).
We have for each , so the union of the ’s is connected and contains a path between the left and right boundaries of . Therefore, the triangle inequality implies that
[TABLE]
By Axiom V, the left side of (3.2) is at least with probability tending to 1 as , uniformly in . By Lemma 3.6, the right side of (3.2) is at most with probability tending to 1 as , uniformly in . Combining these relations and sending shows that , as desired.
Step 3: upper bound for . Let be a path between the left and right boundaries of with -length at most 2D_{h}\mathopen{}\mathclose{{}\left(\mathbbm{r}\partial_{\operatorname{L}}\mathbbm{S},\mathbbm{r}\partial_{\operatorname{R}}\mathbbm{S};\mathbbm{r}\mathbbm{S}}\right). We will use to construct a path in from to for which the sum in (3.15) can be bounded above.
To this end, let and let be chosen so that . Inductively, suppose , a time , and a point have been defined in such a way that . Let be the first time after at which exits , if such a time exists, and otherwise set . Let be chosen so that . Let be the smallest for which , and note that .
Successive squares and necessarily share a vertex. Hence and lie at -graph distance 1 from one another, so for is a path from to in .
We will now bound . For each , the path crosses between the inner and outer boundaries of between time and time . By (3.21), for each ,
[TABLE]
Using (3.23) and the definition of , we therefore have
[TABLE]
By Axiom V, the right side of (3.2) is at most with probability tending to 1 as , uniformly in . By Lemma 3.6, the left side of (3.2) is at least with probability tending to 1 as , uniformly in . Combining these relations and sending shows that . ∎
Theorem 1.5 has the following useful corollary.
Lemma 3.8**.**
Let be a whole-plane GFF normalized so that . Almost surely, for every compact set we have . In particular, every closed, -bounded subset of is compact.
Proof.
By tightness across scales (Axiom V), there exists such that for each , \mathbbm{P}\mathopen{}\mathclose{{}\left[D_{h}(B_{r}(0),B_{2r}(0))\geq a\mathfrak{c}_{r}e^{\xi h_{r}(0)}}\right]\geq 1/2. By the locality of (Axiom II) and since \sigma\mathopen{}\mathclose{{}\left(\bigcap_{r>0}h|_{\mathbbm{C}\setminus B_{r}(0)}}\right) is trivial, a.s. there are infinitely many for which . By Theorem 1.5, . Since is a standard linear Brownian motion [DS11, Section 3.1], we get that a.s. . Hence a.s. . Since is a length metric, for any and any compact set , we have . We thus obtain the first assertion of the lemma. The first assertion (applied with equal to a single point, say) implies that any -bounded subset of must be contained in a Euclidean-bounded subset of , which must be compact since induces the Euclidean topology on . ∎
3.3 Moment bound for diameters
In this section we will prove the following more quantitative version of the moment bound from Theorem 1.8, which is required to be uniform across scales.
Proposition 3.9**.**
Let be open and let be a compact connected set with more than one point. For each , there exists which depends on and but not on such that for each ,
[TABLE]
We will deduce Proposition 3.9 from the following variant, which allows us to bound internal -distances all the way up to the boundary of a square. Recall that .
Proposition 3.10**.**
For each , there is a constant such that for each ,
[TABLE]
Proof of Proposition 3.9, assuming Proposition 3.10.
For , the bound (3.25) follows from the lower bound of Proposition 3.1. Now assume . We can cover by finitely many Euclidean squares which are contained in , chosen in a manner depending only on and . For , let be the bottom left corner of and let be its side length. Proposition 3.10 together with Axiom IV shows that there is a constant depending only on such that for each ,
[TABLE]
We apply the Gaussian tail bound to bound each of the Gaussian random variables (which have constant order variance) and Theorem 1.5 to compare to up to a constant-order multiplicative error. This allows us to deduce (3.25) from (3.27). ∎
To prove Proposition 3.10, we first use the upper bound in Proposition 3.1 and a union bound to build paths between the two shorter sides of each or rectangle with corners in which is contained in . We then string together such paths at all scales (in the manner illustrated in Figure 3) to get a bound for the internal -diameter of . The following lemma is needed to control the circle average terms which appear when we apply Proposition 3.1.
Lemma 3.11**.**
Fix and . For and , it holds with probability as , at a rate which is uniform in , that
[TABLE]
When we apply Lemma 3.11, we will take to be a little bit less than . The fact that is the reason why (instead of just ) appears in our moment bounds.
Proof of Lemma 3.11.
To lighten notation, define the event
[TABLE]
We want a lower bound for the probability that occurs for every simultaneously.
Fix (which we will eventually send to [math]) and a partition of with . We will separately bound the probability of for for , for , and for .
By Lemma 3.4 applied with , , and in place of , we find that for each and each with ,
[TABLE]
with the rate of the depending only on . Note that in the last inequality, we have done some trivial algebraic manipulations then used that (which is what produces the ). By a union bound over logarithmically many (in ) values of with , we get
[TABLE]
For with , Lemma 3.4 applied with , , and in place of gives
[TABLE]
Summing this estimate over all such shows that
[TABLE]
Finally, if and , then the Gaussian tail bound and a union bound, applied as in the proof of Lemma 3.4, shows that (in fact, if is of constant order, this probability will decay superpolynomially in due to the Gaussian tail bound). By a union bound over a logarithmic number (in ) of such values of we get
[TABLE]
The quantity is maximized over all when , in which case it equals . Consequently, by combining the estimates (3.31), (3.32), and (3.33), we get that if is chosen sufficiently small relative to , then
[TABLE]
Sending now concludes the proof. ∎
Proof of Proposition 3.10.
For , the bound (3.26) follows from the lower bound of Proposition 3.1. We will bound the positive moments up to order .
Step 1: constructing short paths across rectangles. Fix which we will eventually send to . By Lemma 3.11 it holds with probability that
[TABLE]
Now fix , which we will eventually send to zero. For , let be the set of open or rectangles with corners in . For let be the bottom-left corner of .
Let
[TABLE]
By the upper bound of Proposition 3.1 (applied with in place of and with ), Axiom IV, and a union bound over all and all , we get that except on an event of probability decaying faster than any negative power of (the rate of decay depends on ), the following is true. For each and each , the distance between the two shorter sides of w.r.t. the internal metric is at most .
Combining this with (3.10) shows that with probability , it holds for each and each that there is a path in between the two shorter sides of with -length at most . By applying Theorem 1.5 to bound , we get that in fact
[TABLE]
Henceforth assume that such paths exist. We will establish an upper bound for the -diameter of .
Step 2: stringing together paths in rectangles. For each square with side length and corners in , there are exactly four rectangles in which are contained in . If , let be the -shaped region which is the union of the paths for these four rectangles, as illustrated in Figure 3. If is one of the four dyadic children of , then . Since the four paths which comprise have -length at most , this means that each point of can be joined to by a path in of -length at most .
Since the metric is a continuous function on , if and we let for be the square of side length with corners in which contains , so that , then the -diameter of tends to zero as . Consequently,
[TABLE]
Since this holds for every , we get that with probability at least , for each , each square with corners in has -diameter at most .
Step 3: conclusion. Since , we can use the triangle inequality to get that if the event at the end of the preceding step occurs, then the -diameter of is at most . Setting , then sending , shows that
[TABLE]
By sending and noting that , we get
[TABLE]
For , we can multiply this last estimate by and integrate to get the desired th moment bound (3.26). ∎
3.4 Pointwise distance bounds
In this subsection we will prove the following more quantitative versions of Theorems 1.10 and 1.11, which are required to be uniform across scales. Recall that is a whole-plane GFF normalized so that .
Proposition 3.12** (Distance from a point to a circle).**
Let and let . If , then for each , there exists such that for each ,
[TABLE]
If , then a.s. for every .
Proposition 3.13** (Distance between two points).**
Let , let be distinct, and let . Set . If , then for each p\in\mathopen{}\mathclose{{}\left(-\infty,\frac{2d_{\gamma}}{\gamma}(Q-\max\{\alpha,\beta\})}\right), there exists such that for each choice of as above,
[TABLE]
If either or , then a.s. .
Propositions 3.12 and 3.13 are immediate consequences of the following sharper distance estimates and a calculation for the standard linear Brownian motion .
Proposition 3.14**.**
Assume that we are in the setting of Proposition 3.12. If , then there is a deterministic function which is bounded in every neighborhood of 0 and satisfies , depending only on and the choice of metric ,666At this point we do not know that the weak LQG metric is unique (it will be proven that this metric is unique up to a deterministic multiplicative constant in [GM19c]). When we say that something is allowed to depend on the choice of , we mean that it is allowed to depend on which particular weak LQG metric we are looking at. such that the following is true. For each , it holds with superpolynomially high probability as , at a rate which is uniform in the choice of , that
[TABLE]
and the -distance around the annulus (Definition 3.7) is at most the right side of (3.40). If , then a.s. for every .
Proposition 3.15**.**
Assume that we are in the setting of Proposition 3.13. If , then there is a deterministic function which is bounded in every neighborhood of 0 and satisfies , depending only on and the choice of metric , such that the following is true. With superpolynomially high probability as , at a rate which is uniform in the choice of and ,
[TABLE]
and
[TABLE]
If either or , then a.s. .
Remark 3.16**.**
It will be shown in [GM19c] that every weak LQG metric is a strong LQG metric, so in particular it satisfies Axiom V with . Once this is established, our proof shows that Propositions 3.14 and 3.15 hold with .
Proof of Proposition 3.12, assuming Proposition 3.14.
For , let . Then is a standard linear Brownian motion [DS11, Section 3.1]. By Proposition 3.14, for each , it holds with superpolynomially high probability as , uniformly over the choice of , that
[TABLE]
To prove the proposition, we will use an exact formula for the laws of the integrals appearing in (3.43). To write down such a formula, let . Then is a standard linear Brownian motion and . Making the change of variables gives
[TABLE]
It is shown in [Duf90] (see also [Urb92, Example 3.3] with ) that
[TABLE]
where is a normalizing constant depending only on . Combining the upper bound in (3.43) with (3.44) and the upper tail asymptotics of the density (3.45), then sending , shows that
[TABLE]
uniformly in . Recall that . Multiplying both sides of (3.46) by and integrating gives the desired bound for positive moments from (3.38). We similarly obtain the desired bound for negative moments using the lower bound in (3.43) and the exponential lower tail of the density (3.45). ∎
Proof of Proposition 3.13, assuming Proposition 3.15.
The bound for positive moments in (3.39) is obtained in essentially the same way as the analogous bound in Proposition 3.12. We apply the upper bound in Proposition 3.15 and use the exact formula (3.45) to bound the integral of each of the two summands appearing on the right side of (3.42), then multiply the resulting tail estimate by and integrate. We use that is Gaussian with constant-order variance to get an estimate which depends only on , not . The bound for negative moments in (3.39) can similarly be extracted from the lower bound in Proposition 3.15, or can be deduced from Proposition 3.12 and the fact that a path from to must cross . ∎
It remains only to prove Propositions 3.14 and 3.15. We will prove Proposition 3.14 by applying Proposition 3.1 to bound the distances across and around concentric annuli surrounding 0 with dyadic radii, then summing over all of these annuli (see Figure 4 for an illustration). We will then deduce Proposition 3.15 from Proposition 3.14 by considering two overlapping Euclidean disks centered at and , respectively. For this purpose the statement concerning the -distance around is essential to link up paths in these two disks.
Proof of Proposition 3.14.
See Figure 2 for an illustration. The proof is divided into four steps.
We apply Proposition 3.1 in the annuli for to prove upper and lower bounds for in terms of sums over such annuli. 2. 2.
Using Brownian motion estimates, we convert from sums over annuli to integrals of quantities of the form . 3. 3.
We show that the contribution of the small error terms in our estimates coming from sums/integrals at superpolynomially small scales is negligible. 4. 4.
We put the above pieces together to conclude the proof.
Step 1: applying Proposition 3.1 at exponential scales. We will apply Proposition 3.1 and take a union bound over exponential scales. In this step we allow any value of .
Fix a small parameter , which we will eventually send to zero. By Proposition 3.1 and Axiom III (to deal with the addition of ) and a union bound over all , we find that with superpolynomially high probability as , the following is true for each .
The -distance from to is at least C^{-1}\mathfrak{c}_{\mathbbm{r}e^{-k}}\mathbbm{r}^{-\xi\alpha}\exp\mathopen{}\mathclose{{}\left(\xi h_{\mathbbm{r}e^{-k}}(0)+\xi\alpha k}\right). 2. 2.
There is a path from to which has -length at most
C\mathfrak{c}_{\mathbbm{r}e^{-k}}\mathbbm{r}^{-\xi\alpha}\exp\mathopen{}\mathclose{{}\left(\xi h_{\mathbbm{r}e^{-k}}(0)+\xi\alpha k}\right). Moreover, there is also a path in which disconnects from and which has -length at most
C\mathfrak{c}_{\mathbbm{r}e^{-k}}\mathbbm{r}^{-\xi\alpha}\exp\mathopen{}\mathclose{{}\left(\xi h_{\mathbbm{r}e^{-k}}(0)+\xi\alpha k}\right).
To deal with the scales for which , we apply Proposition 3.1 with in place of and take a union bound over all such values of to find that superpolynomially high probability as , the above two conditions hold for each , and furthermore the following condition holds for each integer .
- 2*′*.
There is a path from to which has -length at most
k^{\zeta}\mathfrak{c}_{\mathbbm{r}e^{-k}}\mathbbm{r}^{-\xi\alpha}\exp\mathopen{}\mathclose{{}\left(\xi h_{\mathbbm{r}e^{-k}}(0)+\xi\alpha k}\right). Moreover, there is also a path in which disconnects from and which has -length at most
k^{\zeta}\mathfrak{c}_{\mathbbm{r}e^{-k}}\mathbbm{r}^{-\xi\alpha}\exp\mathopen{}\mathclose{{}\left(\xi h_{\mathbbm{r}e^{-k}}(0)+\xi\alpha k}\right).
Henceforth assume that conditions 1 and 2 hold for each and condition holds for each integer , which happens with superpolynomially high probability as .
Any path from [math] to must cross each of the annuli for . Furthermore, the union of and the paths from conditions 2 and for all contains a path from [math] to . By Theorem 1.5, there is a deterministic function with , depending only on the choice of metric , such that
[TABLE]
Summing the bounds from conditions 1 and 2 over all and the bounds from condition over all integers and plugging in (3.47) shows that with superpolynomially high probability as ,
[TABLE]
Furthermore, by condition 2 for the -distance around is at most the right side of (3.4).
Step 2: from summation to integration. We now want to convert from sums to integrals in (3.4). Since is a standard linear Brownian motion [DS11, Section 3.1], the Gaussian tail bound and the union bound show that with superpolynomially high probability as ,
[TABLE]
Let , where is as in (3.47). Then and if (3.49) holds, then for each ,
[TABLE]
By summing (3.4) over all , we obtain
[TABLE]
Step 3: bounding the sum of the small scales. To deduce our desired bounds from (3.4) and (3.4), we now need an upper bound for and an upper bound for the second sum on the right side of (3.4). This is the only step where we need to assume that .
Since is a standard linear Brownian motion and for , is concave, hence subadditive, if is chosen small enough that , then
[TABLE]
where here the and the implicit constants in do not depend on or . Therefore, the Chebyshev inequality shows that
[TABLE]
decays faster than any negative power of . On the other hand, it is easily seen from the Gaussian tail bound that
[TABLE]
decays faster than any negative power of . Hence with superpolynomially high probability as ,
[TABLE]
Similarly, we get that with superpolynomially high probability as ,
[TABLE]
Step 4: conclusion. By applying (3.4), (3.54), and (3.55) to bound the left and right sides of (3.4), we get that if , then with superpolynomially high probability, the bounds (3.40) as well as the bound stated just below (3.40) (here we use the sentence just below (3.4)) all hold with , say, in place of . Since we are claiming that these bounds hold with superpolynomially high probability as , this is sufficient.
Finally, we consider the case when . Since evolves as a standard linear Brownian motion, for each it is a.s. the case that the summand in the lower bound in (3.4) is bounded below by for large enough . (How large is random). Since (3.4) holds with superpolynomially high probability as , the Borel-Cantelli lemma combined with the preceding sentence shows that a.s. for large enough (random) , we have D_{h^{\alpha}}\mathopen{}\mathclose{{}\left(0,\partial B_{\mathbbm{r}}(0)}\right)\geq C^{-1}e^{\beta\lfloor C^{1/\zeta}\rfloor}, which tends to as . This shows that a.s. . Since this holds a.s. for each rational , it follows that a.s. for every . ∎
Proof of Proposition 3.15.
We first observe that by Axiom IV, Proposition 3.14 still holds with 0 replaced by any , with the rate of convergence as uniform in and . Applying the lower bound of Proposition 3.14 with each of and in place of [math] immediately gives (3.41) since any path from to must contain disjoint sub-paths from to and from to . Moreover, by comparing the local behavior of near and near to and , respectively, we get that a.s. if either or .
It remains to prove (3.42). Assume . We first apply Proposition 3.14 with in place of to find that with superpolynomially high probability as , there is a path from to and a path in which disconnects from which each have -length at most
[TABLE]
and the same is true with in place of . Since , the union of the paths and contains a path from to in . This gives (3.42) but with instead of [math] in the lower bound of integration for the integral on the right.
To get the estimate with the desired lower bound of integration, we use that is a standard two-sided linear Brownian motion. In particular, two applications of the Gaussian tail bound show that with superpolynomially high probability as ,
[TABLE]
Therefore, with superpolynomially high probability as ,
[TABLE]
Combining this with the analogous estimate with in place of and the aforementioned analog of (3.42) with instead of 0 in the lower bound of integration gives (3.42). ∎
Although it is not needed for the proofs of Propositions 3.14 and 3.15, we record the following generalization of Proposition 3.9 which tells us in particular that induces the Euclidean topology on when and (which is a stronger statement than just that for every ).
Proposition 3.17**.**
Let , , , and be as in Proposition 3.14. If and , then for each , there exists such that for each ,
[TABLE]
In particular, a.s. induces the Euclidean topology on .
We note that the range of moments for the -diameter of appearing in Proposition 3.17 is the same as the range of moments for the -mass of , but scaled by ; see, e.g., [GHS19a, Lemma A.3]. This is natural from the perspective that is the scaling exponent relating -LQG distances and areas.
Proof of Proposition 3.17.
On , we have that is bounded above and below by times constants depending only on . Therefore, the existence of negative moments is immediate from Axiom III and Proposition 3.9 applied with .
To get the desired positive moments, for let be the annulus . The random variable is Gaussian with variance , so for ,
[TABLE]
By Proposition 3.9 (applied with , , and in place of ),
[TABLE]
By (3.57) and (3.58) and since is independent from , we find that for ,
[TABLE]
at a rate depending only on . Note that in the last line we used Theorem 1.5 to bound .
The quantity inside the exponential on the right side of (3.4) is negative provided (recall that ). For , the function is concave, hence subadditive, so summing (3.4) over all gives
[TABLE]
This gives (3.56) in the case when . In the case when , (3.56) follows from a similar calculation with the triangle inequality for the norm used in place of sub-additivity.
Finally, we know that the restriction of to induces the Euclidean topology (see the discussion just above Theorem 1.10), so to check that that induces the Euclidean topology, we need to show that a.s. as . This follows from the bound (3.4) applied with and the Borel-Cantelli lemma. ∎
3.5 Hölder continuity
We will prove the following more quantitative version of Theorem 1.7 which is required to be uniform across scales.
Proposition 3.18**.**
Fix a compact set and exponents and . For each , it holds with polynomially high probability as , at a rate which is uniform in , that
[TABLE]
We will actually prove a slightly stronger version of the upper bound for in Proposition 3.18, which bounds internal distances relative to a small neighborhood of instead of just distances along paths in all of ; see Lemma 3.20 just below. This stronger version is used in [GM19c].
For the proof of Proposition 3.18, we assume that and we fix a compact set . The basic idea of the proof of the upper bound in (3.61) is to apply Proposition 3.9 to Euclidean balls of radius and take a union bound over many such Euclidean balls which cover . The basic idea for the proof of the lower bound in (3.61) is to apply the lower bound in Proposition 3.1 to lower bound the -distance across Euclidean annuli of the form , then take a union bound over many such annuli whose inner balls cover . We first prove an upper bound for -distances in terms of Euclidean distances. For this purpose we will use the following consequence of Propositions 3.9 and 3.10.
Lemma 3.19**.**
For each , each , and each ,
[TABLE]
uniformly over the choices of and . Furthermore, if we let be the square of side length centered at , then for and , the -internal diameter of satisfies
[TABLE]
uniformly over the choices of and .
Proof.
We know that is centered Gaussian of variance and is independent from . By Axioms II and III, is also independent from the internal metric
[TABLE]
Consequently, we can apply Theorem 1.5 and Proposition 3.9 (with in place of ) together with the formula for a Gaussian random variable to get that for ,
[TABLE]
with the uniform over all and .
By (3.5) and the Chebyshev inequality,
[TABLE]
The exponent on the right side is maximized for , which is always at most for (since ) and is positive provided . Making this choice of gives (3.62) but with in place of . The random variables for are Gaussian with variance bounded above by a constant depending only on . Consequently, we can apply the Gaussian tail bound to get (3.62) in general.
The bound (3.63) is proven similarly but with Proposition 3.10 used in place of Proposition 3.9. ∎
We can now prove a slightly sharper version of the upper bound of Proposition 3.18.
Lemma 3.20**.**
For each and each , it holds with polynomially high probability as , at a rate which is uniform in , that
[TABLE]
Furthermore, it also holds with polynomially high probability as , at a rate which is uniform in , that for each and each square with corners in which intersects , we have
[TABLE]
Proof.
The bound (3.66) follows from (3.62), applied with and with for in place of , together with a union bound over all and then over all . The bound (3.67) similarly follows from (3.63). ∎
To prove the Hölder continuity of the Euclidean metric w.r.t. , we first need the following estimate which plays a role analogous to Lemma 3.19.
Lemma 3.21**.**
For each , each , and each ,
[TABLE]
uniformly over the choices of and .
Proof.
The proof is similar to that of Lemma 3.19 but we use Proposition 3.1 instead of Proposition 3.9. Proposition 3.1 implies that \mathfrak{c}_{\varepsilon\mathbbm{r}}^{-1}e^{-\xi h_{\varepsilon\mathbbm{r}}(z)}D_{h}\mathopen{}\mathclose{{}\left(B_{\varepsilon\mathbbm{r}}(z),\partial B_{2\varepsilon\mathbbm{r}}(z)}\right) has finite moments of all negative orders which are bounded above uniformly over all and . By the same calculation as in (3.5), for each we have
[TABLE]
uniformly over all and . Applying the Chebyshev inequality and setting gives (3.68) with in place of . For , we can replace with via exactly the same argument as in the proof of Lemma 3.19. ∎
Lemma 3.22**.**
For each and each , it holds with polynomially high probability as , at a rate which is uniform in , that
[TABLE]
Proof.
This follows from (3.62), applied with and with for in place of , together with a union bound over all and then over all . ∎
Proof of Proposition 3.18.
Combine Lemmas 3.20 and 3.22. ∎
To conclude the proof of Theorem 1.7, we need to check that the Hölder exponents and are optimal.
Lemma 3.23**.**
Let be an open set. Almost surely, the identity map from , equipped with the Euclidean metric, to is not Hölder continuous with any exponent greater than . Furthermore, the inverse of this map is not Hölder continuous with any exponent greater than .
Proof.
The idea of the proof is to use Proposition 3.14 to study -distances as we approach an -thick point of for close to or to . To produce such a thick point, we will sample a point from the -LQG measure induced by the zero-boundary part of . By Axiom III, we can assume without loss of generality that is normalized so that . We can also assume without loss of generality that is bounded with smooth boundary. Let be the zero-boundary part of , so that is harmonic on .
Let which we will eventually send to either or , and let be the -LQG measure induced by . Also let be sampled uniformly from , normalized to be a probability measure. Let be the law of weighted by the total mass , so that under , is sampled from its marginal law weighted by and conditional on , is sampled from , normalized to be a probability measure. By a well-known property of the -LQG measure (see, e.g., [DMS14, Lemma A.10]), a sample from the law can be equivalently be produced by first sampling from the unweighted marginal law of , then independently sampling uniformly from Lebesgue measure on and setting , where is a deterministic continuous function.
By Proposition 3.14 (applied with the field in place of ), the fact that is a.s. bounded in a neighborhood of (by continuity), and the Borel-Cantelli lemma, we find that a.s.
[TABLE]
where here the is deterministic and tends to 0 as (it comes from the error in Proposition 3.14) and the denotes a random variable which tends to 0 a.s. as . The description in the preceding paragraph shows that conditional on , the process evolves as a standard linear Brownian motion. Consequently, the Gaussian tail bound shows that with probability tending to 1 as ,
[TABLE]
By plugging (3.72) into (3.71) and using the fact that (Theorem 1.5), it therefore follows that with probability tending to 1 as ,
[TABLE]
Since can be made arbitrarily close to 2, this shows the desired lack of Hölder continuity for identity map . Since can be made arbitrarily close to , we also get the desired lack of Hölder continuity for the inverse map . ∎
4 Constraints on the behavior of -geodesics
Let be a weak -LQG metric. By Lemma 3.8, for a whole-plane GFF , the metric space is a boundedly compact length space (i.e., closed bounded subsets are compact) so there is a -geodesic — i.e., a path of minimal -length — between any two points of [BBI01, Corollary 2.5.20]. In this section we will apply the main results of this paper to prove two estimates which constrain the behavior of -geodesics. The first of these estimates, Proposition 4.1, tells us that paths which stay in a small Euclidean neighborhood of a straight line or an arc of the boundary of a circle have large -lengths. In particular, -geodesics are unlikely to stay in such a neighborhood. The second estimate, Proposition 4.3, says that a -geodesic cannot spend a long time near the boundary of a -metric ball.
4.1 Lower bound for -distances in a narrow tube
Proposition 4.1**.**
Let be a compact set which is either a line segment, an arc of a circle, or a whole circle and fix . For each and each , it holds with probability at least that
[TABLE]
where the rate of the depends on but not on .
By [Ang19, Theorem 1.9], for each we have and hence . Therefore, the power of on the right side of (4.1) is negative for small enough . Hence, Proposition 4.1 implies that when is small and with , it holds with high probability that D_{h}\mathopen{}\mathclose{{}\left(u,v;B_{\varepsilon\mathbbm{r}}(\mathbbm{r}L)}\right) is much larger than . In particular, a -geodesic from to cannot stay in .
Proof of Proposition 4.1.
Step 1: bounding distances in terms of circle averages. View as a path parametrized by Euclidean unit speed. For , let . Then the balls are disjoint and the balls cover .
Fix , which we will eventually send to zero. By Proposition 3.1 and a union bound, it holds with superpolynomially high probability as that
[TABLE]
Henceforth assume that (4.2) holds. The idea of the proof is that a path in has to cross between the inner and outer boundaries of a large number of the annuli . Thus (4.2) reduces our problem to proving a lower bound for the sum of the quantities for these annuli, which in turn can be proven using Theorem 1.5 and basic estimates for the circle average process.
Step 2: lower-bounding lengths of paths in in terms of circle averages. There is a constant depending only on and such that for small enough (depending only on and ), the following is true. If satisfy , there are integers such that , , and . Each path from to in must enter for each , and hence must cross the annulus for each such . Combining this with (4.2) shows that
[TABLE]
Step 3: proof conditional on a circle average estimate. We claim that for any fixed with and any ,
[TABLE]
where the rate of the depends on but not on or the particular choice of . We will prove (4.4) just below using standard Gaussian estimates.
Let us first conclude the proof assuming (4.4). We can find a constant-order number of pairs with such that for small enough (depending only on and ), each interval with contains one of the intervals .
By applying (4.4) (with in place of ) to each such pair , then taking a union bound, we get that with probability at least , the sum on the right side of (4.3) is bounded below by simultaneously for every possible choice of . By (4.3), with probability at least it holds simultaneously for each satisfying that
[TABLE]
where in the second inequality we use Theorem 1.5. Sending now gives (4.1).
Step 4: proof of the circle average estimate. The rest of the proof is devoted to proving the inequality (4.4). To lighten notation, write . By the calculations in [DS11, Section 3.1] (and the scale invariance of the law of , modulo additive constant), the ’s are jointly centered Gaussian with variances satisfying
[TABLE]
where here denotes a quantity which is bounded above and below by constants depending only on (not on ). Since and is parametrized by Euclidean unit speed, we also have the following covariance formula for :
[TABLE]
Recall the formula for a centered Gaussian random variable . Applying this to the ’s and recalling (4.6) and the fact that gives
[TABLE]
with the implicit constant depending only on . From (4.6) and (4.7) we obtain \operatorname{Var}(X_{j}+X_{k})=\log\mathopen{}\mathclose{{}\left(\varepsilon^{-4}|k-j|^{-2}}\right)+O(1) for . Hence
[TABLE]
with the implicit constants depending only on , where in the last inequality we use that , so .
By (4.8), (4.1), and the Payley-Zygmund inequality, we find that there is a constant such that
[TABLE]
To improve the lower bound for this probability, we will apply the following elementary Gaussian concentration bound (see, e.g., [DZZ18, Lemma 2.1]):
Lemma 4.2**.**
For any , there exists such that the following is true. Let be a centered Gaussian vector taking values in and let . If such that , then for any ,
[TABLE]
where is the norm on .
We now apply Lemma 4.2 with as in (4.10), with (recall (4.6)), with
[TABLE]
and with . This shows that with probability , there exists such that . If this is the case, then
[TABLE]
Since , this implies (4.4). ∎
4.2 -geodesics cannot trace the boundaries of -metric balls
For and , we write for the -metric ball of radius centered at . The following proposition prevents a -geodesic from spending a long time near the boundary of a -metric ball.
Proposition 4.3**.**
For each and each , it holds with superpolynomially high probability as , at a rate which is uniform in the choice of , that the following is true. For each for which and each -geodesic from 0 to a point outside of ,
[TABLE]
where denotes 2-dimensional Lebesgue measure.
For , , and , we say that the Euclidean ball is -good if
[TABLE]
To prove Proposition 4.3, we will consider -good balls which intersect and which are hit by a given -geodesic started from 0. See Figure 5 for an illustration and outline of the proof.
Lemma 4.4**.**
For each and each , there exists such that for each , it holds with probability at least , at a rate which is uniform in , that the Euclidean ball can be covered by -good balls with radii in .
Proof.
This is an immediate consequence of Lemma 3.2 applied with in place of and any choice of . ∎
We will also need the following easy consequence of the distance bounds from Section 3.
Lemma 4.5**.**
For each , there exists such that for each , the following holds with probability as , at a rate which is uniform in . For each with ,
[TABLE]
Proof.
We will prove a lower bound for the left side of (4.16) (see (4.20)) and an upper bound for the right side of (4.16) (see (4.22)), then compare them.
By Proposition 3.1 and a union bound, it holds with superpolynomially high probability as that
[TABLE]
The circle averages for are Gaussian with variance at most . By the Gaussian tail bound and a union bound, if we choose to be sufficiently large, then it holds with probability that
[TABLE]
By Theorem 1.5,
[TABLE]
If with , then any path from to must cross between the inner and outer boundaries of an annulus of the form for some x\in B_{\varepsilon^{-M}\mathbbm{r}}(0)\cap\mathopen{}\mathclose{{}\left(\frac{\varepsilon\mathbbm{r}}{8}\mathbbm{Z}^{2}}\right). Combining this last observation with (4.17) shows that with superpolynomially high probability as , is at least the right side of (4.17) for each such . We then apply (4.18) and (4.19) to lower-bound the right side of (4.17). This shows that with probability ,
[TABLE]
By Proposition 3.9,
[TABLE]
with the implicit constant uniform over all and . By Theorem 1.5, . By the Gaussian tail bound, we can find such that with probability , we have . Combining these estimates with (4.21) and Markov’s inequality shows that with probability ,
[TABLE]
Combining (4.20) and (4.22) gives (4.16) for any choice of . ∎
Proof of Proposition 4.3.
Step 1: defining a regularity event. For , , , and , let be the event that the following is true.
The ball can be covered by -good Euclidean balls with radii in . 2. 2.
For each with ,
[TABLE]
By Lemmas 4.4 and 4.5, for any and we can find for which
[TABLE]
Henceforth assume that occurs for such a choice of and that .
Step 2: reducing to a bound for the number of excursions of a geodesic. Let such that and let be a -geodesic from 0 to a point outside of . Let and inductively for let be the first time after the exit time of from for which , or if no such time exists. Let be the smallest for which .
We claim that there exists a constant depending on such that on . If this is the case, then can be covered by at most Euclidean balls of radius . This means that \operatorname{area}\mathopen{}\mathclose{{}\left(B_{\varepsilon\mathbbm{r}}(P)\cap B_{\varepsilon\mathbbm{r}}(\partial\mathcal{B}_{s}(0;D_{h})}\right)\leq 4\pi\varepsilon^{2-2\zeta+o_{\varepsilon}(1)}\mathbbm{r}^{2}. Choosing and sending then concludes the proof. Hence we only need to prove a logarithmic upper bound for assuming that occurs.
Step 3: bounding excursions using -good balls. For , we can find a -good Euclidean ball with radius in which contains . Write for the Euclidean ball with the same center as and twice the radius of . Let be the first time after at which exits . The time is smaller than the exit time of from . Consequently, the definition of the ’s shows that for each .
Since is a -geodesic and crosses the annulus between times and ,
[TABLE]
We now argue that
[TABLE]
Indeed, since intersects and has radius at least , it follows that intersects . Let and let such that (such a exists by the definition of ). By the definition of a -good ball, the -diameter of is at most . Hence
[TABLE]
which is (4.26).
By (4.25) and (4.26) and the fact that the intervals are disjoint, we get
[TABLE]
This holds for each , from which we infer that
[TABLE]
By the definition of , we have . Moreover, since , , and , we have . By (4.23) in the definition of , it follows that
[TABLE]
Combining this with (4.27) shows that , which means that , as required. ∎
Author’s addresses
J. Dubédat, Columbia University, New York, USA, Email: [email protected]
H. Falconet, Columbia University, New York, USA, Email: [email protected]
E. Gwynne, University of Cambridge, Cambridge, UK, Email: [email protected]
J. Pfeffer, Massachusetts Institute of Technology, Cambridge, USA, Email: [email protected]
X. Sun, Columbia University, New York, USA, Email: [email protected]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Ang 03] O. Angel. Growth and percolation on the uniform infinite planar triangulation. Geom. Funct. Anal. , 13(5):935–974, 2003, 0208123 . MR 2024412
- 2[Ang 19] M. Ang. Comparison of discrete and continuum Liouville first passage percolation. Ar Xiv e-prints , Apr 2019, 1904.09285 .
- 3[APPS 20] M. Ang, M. Park, J. Pfeffer, and S. Sheffield. Brownian loops and the central charge of a Liouville random surface. Ar Xiv e-prints , May 2020, 2005.11845 .
- 4[AT 07] R. J. Adler and J. E. Taylor. Random fields and geometry . Springer Monographs in Mathematics. Springer, New York, 2007. MR 2319516 (2008 m:60090)
- 5[BBI 01] D. Burago, Y. Burago, and S. Ivanov. A course in metric geometry , volume 33 of Graduate Studies in Mathematics . American Mathematical Society, Providence, RI, 2001. MR 1835418
- 6[Ber 17] N. Berestycki. An elementary approach to Gaussian multiplicative chaos. Electron. Commun. Probab. , 22:Paper No. 27, 12, 2017, 1506.09113 . MR 3652040
- 7[BM 17] J. Bettinelli and G. Miermont. Compact Brownian surfaces I: Brownian disks. Probab. Theory Related Fields , 167(3-4):555–614, 2017, 1507.08776 . MR 3627425
- 8[Bor 75] C. Borell. The Brunn-Minkowski inequality in Gauss space. Invent. Math. , 30(2):207–216, 1975. MR 0399402
