Renormalization of crossing probabilities in the dilute Potts model
Abstract
A recent paper due to Duminil-Copin and Tassion from introduces a novel argument for obtaining estimates on horizontal crossing probabilities of the random cluster model, in which a range of four possible behaviors is established. To apply the novel renormalization of crossing probabilities that the authors propose can be studied in other models of interest that are not self-dual, we collect results to formulate vertical and horizontal strip, and renormalization, inequalities for the dilute Potts model, whose measure is obtained from the high temperature expansion of the loop measure supported over the hexagonal lattice in the presence of two external fields . The dilute Potts model was originally introduced in by Nienhuis and is another model that enjoys the RSW box crossing property in the Continous Critical phase, which is one of the four possible behaviors that the model is shown to enjoy. Through a combination of the Spatial Markov Property (SMP) and Comparison between Boundary Conditions (CBC) of the high-temperature spin measure, four phases of the dilute Potts model can be analyzed, exhibiting a class of boundary conditions upon which the probability of obtaining a horizontal crossing is significantly dependent. The exponential factor that is inserted into the Loop model to quantify properties of the high-temperature phase is proportional to the summation over all spins, and the number of monochromatically colored triangles over a finite volume, which is in exact correspondence with the parameter of a Boltzmann weight introduced in Nienhuis’ 1991 paper detailing extensions of the -state Potts model. Asymptotically, in the infinite volume limit we obtain strip and renormalization inequalities that provide conditions on the constants and that are known from RSW results that have been clasically obtained for Voronoi and Bernoulli percolation. Applications of two phases of the dilute Potts model are provided following arguments for strip and renormalization inequalities. 111Keywords: Statistical mechanics, Russo-Seymour-Welsh, crossing probabilities, self-duality, random cluster model, loop model, symmetric domains, six-vertex model, crossing estimates, high-temperature phase. 222MSC Class: 60K35; 82B02
1 Introduction
1.1 Overview
Russo-Seymour-Welsh (RSW) theory provides estimates regarding the crossing probabilities across rectangles of specified aspect ratios, and was studied by Russo, and then by Seymour and Welsch on the square lattice, with results specifying the finite mean size of percolation clusters [23], in addition to a relationship that critical probabilities satisfy through a formalization of the sponge problem [24]. With such results, other models in statistical physics have been examined, particularly ones exhibiting sharp threshold phenomena [1,7] and continuous phase transitions [13], with RSW type estimates obtained for Voronoi percolation [27], critical site percolation on the square lattice [28], the Kostlan ensemble [2], and the FK Ising model [9], to name a few.
RSW arguments classically rely on model self-duality, which is enjoyed by neither the random cluster nor dilute Potts models. With an adaptation of the 2019 renormalization of crossing probabilities argument due to Duminil-Copin and Tassion [14], crucial modifications for renormalizing crossing probabilities in the dilute Potts model arise not only from spin analogues of random cluster SMP and CBC properties that intrinscially capture the model’s dependence with the hexagonal lattice (introduced in 3.2), but also in arguments for proving that PushPrimal, PushDual, PushPrimal Strip and PushDual Strip conditions hold. The constants provided in the lower bounds of PushPrimal and PushDual conditions additionally impact arguments throughout Sections 7 and 8 surrounding strip and renormalization inequalities, allowing for a classification of four phases of behavior of the dilute Potts model (introduced in 3.3). Although classical RSW arguments are successful for analyzing self-dual models, previous arguments to obtain RSW estimates are not applicable to the dilute Potts model (in correspondence with the high-temperature loop model in presence of two external fields), that has been studied extensively by Nienhuis [15,19,20] who not only conjectured that the critical point of the model should be for , but also has provided results for the model on the honeycomb lattice [22] which has connective constant [12]. It is also known that the loop model, a model for random collections of loop configurations on the hexagonal lattice, exhibits a phase transition with critical parameter , in which subcritically the probability of obtaining a macroscopic loop configuration of length decays exponentially fast in , while at criticality the probability of obtaining infinitely many macroscopic loop configurations, also of length , and centered about the origin is bound below by and above by for irrespective of boundary conditions [8]. The existence of macroscopic loops in the loop model has also been proved in [3] with the XOR trick.
In [14], Duminil-Copin & Tassion proposed alternative arguments to obtain RSW estimates for models that are no self-dual at criticality. The novel quantities of interest in the argument involve renormalization inequalities, which in the case of Bernoulli percolation can be viewed as a coarse graining argument, as well as the introduction of strip densities which are quantities defined as a limit supremum over a real parameter . Ultimately, the paper proves RSW estimates for measures with free or wired boundary conditions in subcritical, supercritical, critical discontinuous critical continuous cases, with applications of the two theorems relating to the mixing times of the random cluster measure, for systems undergoing discontinuous phase transitions [14,18]. Near the end of the introduction, the authors mention that potential generaliations of their novel renormalization argument can be realized in the dilute Potts model studied by Nienhuis which is equivalent to the loop model, a model conjectured to exist in the same universality class as the spin model.
With regards to the loop model, previous arguments have demonstrated that the model undergoes a phase transition by making use of Smirnov’s parafermionic observable, originally introduced to study conformal invariance of different models in several celebrated works [11,25,26]. As a holomorphic function, the discrete contour integral of the observable vanishes for specific choice of a multiplicative parameter to the winding term in the power of the exponential. Under such assumptions on , Duminil-Copin coauthors prove exponential decay in the loop model from arguments relating to the relative weights of paths and a discrete form of the Cauchy Riemann equations [8]. Historically, disorder operators share connections with the parafermionic observable and have been studied to prove the existence of phase transitions through examination of the behavior of expectations of random variables below, and above, a critical point [11,16], while other novel uses of the parafermionic observable have been introduced in [10]. It is of interest to formulate RSW arguments for the six-vertex model which is in preparation for next year in another paper.
1.2 Organization of results
We define the models of interest to introduce Spin and Loop configurations, from which modifications to the SMP and CBC conditions (defined in future sections) yields bounds for crossings across symmetric domains. To introduce such arguments in Sections 4 5 with the proof of Theorem and Lemma , in Section 3 we define the Loop O(n) measure, from which the dilute Potts measure in the presence of two external fields and . In Section 6, we apply the homomorphism to lower bound vertical crossings with horizontal crossings, from which PushPrimal PushDual conditions are introduced in Section 7 to prove horizontal and vertical strip density formulas. In Sections 8 9, we characterize two behaviors of the quadrichotomy, finalizing our characterization of the discontinuous-continuous phases of the quadrichotomy behavior by making use of the parafermionic observable which has already been manipulated to characterize properties of the phase transition for the random cluster model [5,6,13]. In Section 9, we obtain classical results for the dilute Potts measure in each of the four regimes of behavior.
2 Background
To execute steps of the renormalization argument in the hexagonal case, we introduce quantities to avoid making use of self duality arguments. For , and the strip , let , for , respectively denote the measures with free, wired and Dobrushin boundary conditions in which all vertices at the bottom of the strip are wired. From such measures on the square lattice, several planar crossing events are defined in order to obtain RSW estimates for all four parameter regimes (subcritical, supercritical, discontinuous continuous critical), including analyses of the intersection of crossing probabilities across a family of non disjoint rectangles , each of aspect ratio for , to obtain crossings across long rectangles á la FKG inequality, three arm events which establish lower bounds of the crossing probabilities across under translation and reflection invariance of , in addition to horizontal rectangular crossings which are used to prove renormalization inequalities through use of PushPrimal PushDual relations. To begin, we define the horizontal and vertical crossing strip densities.
Definition 1 ([14], Theorem 2, Corollary 3): The strip density corresponding to the measure across a rectangle of aspect ratio with free boundary conditions is of the form,
where denotes the event that is crossed horizontally, whereas for the measure supported over with wired boundary conditions, the crossing density is of the form,
where denotes the complement of a vertical crossing across .
The strip and renormalization inequalities provided in this section are dependent on different quantities for spin configurations rather than the corresponding inequalities for the random cluster model which only depend on the cluster weight . Besides the definition of the strip densities and , another key step in the argument involves inequalities relating and . The statement of the Lemma below holds under the assumption that the planar random cluster model is neither in the subcritical nor supercritical phase.
Lemma 1 ([14], Lemma 12) There exists a constant such that for every integer , and for every ,
while a similar inequality holds between horizontal and the complement of vertical crossing probabilities of the complement across , which takes the form,
Finally, we introduce the renormalization inequalities.
Lemma 2 ([14], Lemma 15) There exists such that for every integer and for every ,
To readily generalize the renormalization argument to the dilute Potts model, we proceed in the spirit of [14] by introducing hexagonal analogues of the crossing events discussed at the beginning of the section.
3 Towards hexagonal analogues of crossing events from the random cluster renormalization argument
3.1 Loop measure, hexagonal lattice crossing events
The Gibbs measure on a random configuration in the loop model is of the form,
(Loop measure) |
where denotes the number of edges, the number of loops, , and is the partition function which normalizes so that it is a probability measure. In particular, we restrict the parameter regime of to that of [8], in which the loop model satisfies the strong FKG lattice condition and monotonicity through a spin representation measure albeit not being monotonic. By construction, is invariant under rotations. Through a particular extension for of the spin representation of , the measure on spin configurations is of the form,
(Spin Measure) |
where , is the set of spin configurations coinciding with outside of , is the summation of spins inside , is the difference between the spins of monochromatic triangles, and is the partition function which makes a probability measure. The extension enjoys translation invariance, a weaker form of the spatial/domain Markov property that will be mentioned in Section , comparison between boundary conditions that is mentioned in Section , FKG for and . The dual measure of is . Simply put, the superscripts above indicate whether the pushforward of a horizontal or vertical crossing event under the measure is under free, wired, or mixed boundary conditions.
Additionally, the model can be placed into correspondence with the dilute Potts model, originally characterized by occupied, and vacant, faces of H. The exponential factor introduced to characterize high temperature behavior of the Loop model in the Spin Measure equality is in direct correspondence with the dilute Potts model, whose Boltzmann weight is, from [30],
where the quantities in the nearest-neighbor product above include the occupation number , which is either equal to or , and the spins and indicated in the nearest neighbor product of and can take values between corresponding to -state Potts model spins. In the power of the exponential term, we consider occupancy numbers across sites, edges, and faces of triangles, respectively, with real constants.
To obtain boundary dependent RSW results on H in all cases, we identify crossing events in the planar renormalization argument in addition to difficulties associated with applying the planar argument to the push forward of similarly defined horizontal and vertical crossing events under on . In what follows, we describe all planar crossing events in the argument.
First, planar crossing events across translates of horizontal crossings across short rectangles of equal aspect ratio are combined to obtain horizontal crossings across long rectangles, through the introduction of a lower bound to the probability of the intersection that all short rectangles are simultaneously crossed horizontally with FKG. On H, the probability of the intersection of horizontal crossing events of first type can be readily generalized to produce longer horizontal crossings from the intersection of shorter ones, through an adaptation of [14, Lemma 9].
Second, three arm events which determine whether two horizontal crossings to the top of a rectangle of aspect ratio intersect. Planar crossings of second type create symmetric domains over which the conditional probability of horizontal crossings in the symmetric domain can be determined, which for the renormalization argument rely on comparison between random cluster measures with free and wired boundary conditions. For random cluster configurations, comparison between boundary conditions is established in how the number of clusters in a configuration is counted. Comparison between boundary conditions applies to from [8], with hexagonal symmetric domains enjoying symmetry.
Crossing events with wired boundary conditions, of third type induce wired boundary conditions within close proximity of vertical crossings in planar strips. Long horizontal crossings are guaranteed through applications of FKG across dyadic translates of horizontal crossings across shorter rectangles. For hexagonal domains, modifications to planar crossings of first type permit ready generalizations of third type planar crossings.
Fourth, planar horizontal crossing events of fourth type across rectangles establish relations between the strip densities (Lemma 1). Finally, planar crossing events satisfying PushPrimal PushDual conditions prove Lemma 2.
3.2 Comparison of boundary conditions relaxed spatial markovianity for the extension of the loop measure
For suitable comparison of boundary conditions in the presence of external fields , the influence of boundary conditions from the fields on the spin representation amount to enumerating configurations differently for wired and free boundary conditions than for the random cluster model in [14]. In particular, modifications to comparison between boundary conditions and the spatial Markov property.
The modifications entail that an admissible symmetric domain inherit boundary conditions from partitions on the outermost layer of hexagons along loop configurations (see Figures 1-3 in later section for a visualization of crossing events from the argument). Through distinct partitions of the assignment on hexagons on the outermost layer to the boundary, appearing in arguments for symmetric domains appearing in 5.1 - 5.4.
Corollary ([8], Corollary 10), comparison between boundary conditions for the Spin measure): Consider finite and fix such that and . For any increasing event and any ,
() |
Altogether, modifications to comparison of boundary conditions and the spatial Markov property between measurable spin configurations for is also achieved. We recall the (CBC) inequality for the random cluster model, and for the loop model make use of an ”analogy” discussed in [8], in which we associate wired boundary conditions to the spin, and free boundary conditions to the spin over T. Specifically, for boundary conditions distributed under the random cluster measure , the measure supported over satisfies
A special case of property above takes the form,
() |
Another property that the dilute Potts measure satisfies, for finite volumes ,
() |
where the exponential factor in front of the pushforward in the upper bound results from the difference between the number of monochromatically colored triangles in the configuration distributed under the Spin Measure, the edge weight associated with , and the number of connected components , respectively with boundary conditions and . The multiplicative factor arises from comparisons between the Spin Measure and the Random Cluster model measure, particularly by associating the summation over all spins in Spin Measure configurations with the ratio of the number of open edges to the number of closed edges in an FK percolation configuration, the number of connected components in a spin configuration under the loop O(n) model with the number of clusters in the Random cluster model, and also, the edge weights of of spin configurations under the loop O(n) model with the cluster weights of in the Random Cluster Model.
A special case of the inequality above will be implemented several times throughout the renormalization argument, stating,
which will be introduced when applying , in 5.4.3 and later in 7.1 and 7.2.1. The special case of the multiplicative factor above represents the difference in the number of clusters that are counted under boundary conditions , in addition to the corresponding edge weights under each boundary condition. We denote the modified properties for spin representations with and . Besides such modifications, (MON) from [14] directly applies, and will be used repeatedly. To probabilistically capture the dependence of the high-temperature measure on the first external field, another special case of is,
where is a hexagon. Finally, positive association for increasing events and is an inequality of the form,
() |
We refer to free boundary conditions under the Spin measure which represents boundary conditions, and wired boundary conditions for boundary conditions. The analogue from the random cluster model for the high-temperature Spin measure will enter into the novel renormalization argument at several points, stating,
-
Lemma , in which will be repeatedly used to compare boundary conditions between crossings across the second or third edge of a hexagon, and boundary conditions for crossings across symmetric regions ,
-
Corollary , in which will be used to bound the pushfoward of horizontal crossings under wired boundary conditions, which in light of the homeomorphism in 4.1, yields a corresponding bound for the pushforward of a vertical crossing under free boundary conditions,
-
Lemma , in which an application of and (MON) yield a lower bound for the probability of a horizontal crossing under free boundary conditions with a probability of a horizontal crossing under wired boundary conditions,
-
Lemma , in which a modification to the lower bound obtained in the proof of Lemma is applied to obtain a lower bound for the probability of a horizontal crossing under wired boundary conditions with the probability of a vertical crossing under free boundary conditions,
-
Quadrichotomy proof, in which the crossing events from previous results are compared to obtain the standard box crossing estimate that the Gibbs measure on loop configurations satisfies, per conditions of the Continuous Critical phase of the dilute Potts model provided in Theorem 1. [8].
3.3 Description of results
The result presented for the loop model mirrors the dichotomy of possible behaviors, in which the standard box crossing estimate reflects the influence of boundary conditions on the nature of the phase transition, namely that the transition is discontinuous, from the discontinuous critical case. To prove the subcritical supercritical cases, the generalization to the dilute Potts model will make use of planar crossing events of first and second type, while crossing events of third and fourth type proves the remaining continuous discontinuous critical cases. We denote the vertical strip domain with hexagons, the finite domain of of length , and any regular hexagon with side [12]. The strip densities and are defined in 7.
Theorem ( homeomorphism): For , there exits an increasing homeomorphism so that for every , where and denote the horizontal and vertical crossings across a regular hexagon , .
Theorem (hexagonal crossing probabilities): For , aspect ratio of a regular hexagon , , and horizontal crossing across , estimates on crossing probabilities with free, wired or mixed boundary conditions satisfy the following criterion in the following 4 possible behaviors.
-
Subcritical: For every , under wired boundary conditions, ,
-
Supercritical: For every , under free boundary conditions, ,
-
Continuous Critical (Russo-Seymour-Welsh property): For every , independent of boundary conditions , ,
-
Discontinuous Critical: For every , for free boundary conditions, while for wired boundary conditions.
As in the proofs for each set of inequalities located in Section 7 and Section 9.1, we set and for simplicity. Each one of the estimates below before letting is achieved by concluding the argument with the ”analogy” mentioned on the previous page. The leads to similar estimates for the Spin measure. In the statements below, the factor Stretch appearing in the strip density and renormalization inequalities denotes some nonzero factor that a regular hexagon is “stretched” by along in the vertical degree of freedom.
Lemma (7, hexagonal strip density inequalities): In the Non(Subcritical) and Non(Supcritical) regimes, for every integer , and every , there exists a positive constant satisfying,
while a similar upper bound for vertical crossings is of the form,
With the strip densities for horizontal and vertical crossings, we state closely related renormalization inequalities.
Lemma (9, hexagonal renormalization inequalities): In the Non(Subcritical) and Non(Supcritical) regimes, for every integer , and every , there exists a positive constant satisfying,
4 Proof of Theorem Lemma preparation
To prove Theorem , we introduce -arm crossing events, from which symmetric domains will be crossed with good probability. The arguments hold for the extension measure with free, wired or mixed boundary conditions. Previous use of such domains has been implemented to avoid using self duality throughout the renormalization argument [1,13]. Although more algebraica characterizations of fundamental domains on the hexagonal, and other, lattices exist [4], we focus on defining crossing events, from which we compute the probability conditioned on a path crossing the symmetric region.
4.1 Existence of the homomorphism
The increasing homeomorphism is shown to exist with the following.
Proposition (homeomorphism existence): For any , there exists so that for , .
Proof of Theorem . With the statement of , for on , is a measure supported on dual loop configurations, from which a correspondence between horizontal and vertical hexagonal crossings is well known. Trivially, by making use of , rearrangements across the following inequality demonstrate the existence of that is stated in Theorem 1, as
where the final inequality is equivalent to,
because by complementarity, . The existence of a homeomorphism satisfying is equivalent to , implying from the upper bound,
The homeomorphism can be read off from the inequality, hence establishing its existence.
4.2 Crossing events for Lemma
For a fixed ordering of all edges that enclose any , , crossing events to obtain hexagonal symmetric domains with rotational and reflection symmetry will be defined. To obtain generalized regions from their symmetric counterparts in the plane from [14], we make use of comparison between boundary condition with the extension measure. For , we are capable of readily proving a generalization of the union bound with the following prescription.
First, we define -armed crossing events across the box , from which families of crossing probabilities across a countable number of domains are introduced.
Definition (crossings events across the hexagonal box) Fix . From a partition of into equal subintervals, each of length , we define a countable family of crossing events from the partition of to the corresponding topmost edge of , as well as crossing events from to all remaining edges of . We consider crossing events across finite volumes arranged as follows,
-
From our choice of , we horizontally position the line for arbitrary . We denote the horizontal translate of along by where .
-
From crossing events across a series of any hexagons , we additionally introduce crossing events across translates by stipulating that the crossing starting from the partition of into subintervals to any of the remaining edges of occur in other regions, namely and (such a series of finite volumes is provided in Figure 2.
With the properties of the crossings provided above, we conclude by sending , generalizing the crossing events on in the weak limit along the infinite hexagonal strip.
Differences emerge in the proofs for the dilute Potts model in comparison to those of the random cluster model, not only in the encoding of boundary conditions for but also in the construction of the family of crossing probabilities, and the cases that must be considered to prove the union bound. We gather these notions below; denote the quantities corresponding to the partition with the following events,
as well as the following crossing events across the left and right translates of ,
Along with the right and left translates of , we can easily Before proceeding to make use of the -arm events to create symmetric domains for Lemma (presented below), we prove below.
Proof of Proposition . Let .
Uniformly in boundary conditions, for horizontal (vertical) crossings () across can be pushed forwards under to obtain a standard lower bound for the probability of obtaining a longer vertical (horizontal) crossing () through one application of (FKG) to the finite intersection of shorter vertical (horizontal) crossings (),
where the product is taken over admissible j &, with . We denote the sequence of inequalities with because the same argument will be applied several times for collections of horizontal and vertical crossings. From a standard lower bound from vertical crossings, the claim follows by setting equal to the aspect ratio of .
The lower bound of above is raised to the cardinality of . We apply the same sequence of terms from this inequality to several arguments in Corollary , Lemma , Lemma , Lemma , & Lemma . We now turn to a statement of .
Lemma (-arm events, existence of ): For every there exists a constant such that for every ,
5 Lemma arguments
Proof of Lemma . For the -arm lower bound, the argument involves manipulation of symmetric domains. In particular, we must examine the crossing event that is the most probable from the union bound, in cases that are determined by the rotational invariance of . Under this symmetry, in the union bound it is necessary that we only examine the structure of the crossing events in the following cases. We include the index associated with crossing events , executing the argument for arbitrary (in contrast to in [14]), readily holding for any triplet which translates horizontally. Besides exhibiting the relevant symmetric domain in each case, the existence of will also be justified. Depending on the construction of , we either partition the outermost layer to , called the incident layer to , as well as sides of with , , and . Finally, we finish the section with bounds in 5.4.3 to conclude the argument.
5.1
In the first case, crossings across can be analyzed with the events and . To quantify the conditional probability of obtaining a crossing beginning from , let and be the set of respective paths from and to and , and also realizations of the paths as , .
To accommodate properties of the dilute Potts model, we also condition that the number of connected components of equal the number of connected components of of in the spin configuration sampled under (see Figure 3 for one example, in which the illustration roughly gives one half of the top part of which is above the point of intersection of the red and purple connected components, while the remaining purple connected components until constitute one half of the lower half of ). We denote restrictions of the connected components for and to the magnified region in Figure 3, and with some abuse of notation we still denote and for simplicity.
Finally, assign as the points to the left of and to the right of , and the symmetric domain as . To obtain a crossing across , we conditionally pushforward the event
which quantifies the probability of obtaining a connected component across . We condition through and because if there exits a spin configuration passing through whose boundaries are determined by and , then necessarily the configuration would have a connected component from to hence confirming that occurs. To establish a comparison between this conditional probability and the conditional probability of obtaining a horizontal crossing across , consider
subject to wired boundary conditions on and and free boundary conditions elsewhere. Conditionally this probability is an upper bound for another probability supported over , as
(-) |
with the conditioning on the connected components applying to spin configurations as shown in Figure 3, is a region inside the symmetric domain (see Figure 5), and the superscript indicates boundary conditions wired along and . We denote this inequality as -, which is short for vertical crossings across the symmetric domain that we introduce and further analyze in 5.2.2. Similarly, conditional on , occurs.
To quantify the probability of , conditionally that the connect components of the event not intersect those of , we introduce modifications through , which impact the boundary conditions of the symmetric domains that will be constructed, while modifications through impact the number of paths that can be averaged over in and given the occurrence of .
5.1.1 Incident layer of hexagons to the symmetric domain boundary
Under (), we push boundary conditions away from nonempty boundary with the edge of intersection towards , to construct by reflecting one half of the region enclosed by the realizations . Because the event necessarily induces the existence of a loop configuration from to , under Dobrushin/mixed boundary conditions which stipulate the existence of a wired arc of length along , the distribution over spin configurations satisfying implies that the probability of a crossing across supported on 333The boundary conditions are provided in two separate constructions of below..
Formally, boundary conditions are pushed away from the boundary of onto boundaries of the symmetric domain as follows.
Definition (pushing boundary conditions onto symmetric domains from boundary conditions on ) From boundary conditions along , before reflecting connected components induced by the crossings event about , boundary conditions along symmetric domains are obtained with the following procedure:
-
To partition vertices in for constructing boundary conditions on vertices along the boundaries of symmetric domains, we assign boundary conditions to a partition of the first layer of hexagons outside of the crossing induced by , conditioned under realizations of paths .
-
To apply , given the crossing , the length of the boundary of the symmetric domain is determined by the number of connected components of the spin configuration, which corresponds to the the edges present in the configuration. From the total number of vertices on the boundary, we introduce boundary conditions with . Outside of , the paths and (see Figure 3 for spin configurations in red and purple yield boundaries of ).
-
After having identified the boundaries of the symmetric domain, reflection of one half of is constructed by taking the union , where the paths in the union denote the restriction of the connected components of and after and have occurred (see Figure 5 for the connected components of the paths constituting the boundaries of the symmetric domain surrounded about the centered blue hexagon). The remaining top half of is obtained by reflection through that was crossed by and , as with the remaining half of the lower part (in the illustration of Figure 4, the connected components of constitute one half of the lower region of ).
-
The reflections and described in previous steps provide the remaining half of after performing each reflection.
5.2 property
We progress towards making use of another modification for the dilute Potts model through the symmetric domain construction previously described to ensure that such domains are conditionally bridged with good probability.
5.2.1 Upper bound for conditional crossing events across symmetric domains
To proceed, we make use of , in addition to the modification of boundary conditions as follows. From an application of , the conditional probability introduced at the beginning of the proof, under spin configurations supported on satisfies, under the conditional measure , for measurable events depending on finitely many edges in ,
after examining the pushforward of the conditional probability above under spin configurations supported in , where the superscript denotes free boundary conditions along and and wired elsewhere, the complement of given in the lower bound of - (provided in 5.1). The stochastic domination above of the conditional probability under no boundary conditions on any side of will be studied for paths . The event under demands that the connected components of be disjoint for those of and for the entirety of the path.
Particularly, we remove the conditioning from the pushforward in the upper bound because the definition of implies that connectivity holds in between and . Pointwise, the connected components of do not intersect those of and . Recalling - in 5.1, we present additional modifications to the renormalization argument through the lower bound of the inequality to exhaust the case for . Lower bounds for the pushforward under can only be obtained for mixed boundary conditions along precisely under partitions of the incident hexagonal layer given in 5.1.1 5.1.2.
Under the conditions of , crossings in with boundary conditions , the lowermost bound for - can only be established when boundary conditions are distributed under 5.1.1 or 5.1.2. For completeness, we first establish the lower bound for 5.1.1, in which the boundary conditions for a crossing distributed under can be compared to a closely related crossing distributed under .
To establish the comparison, the edges in , we divide the proof into separate cases depending on whether the boundary conditions for vertcies along or are connected together under wired or free boundary conditions. One instance of pushing boundary conditions occurs for , while another instance of pushing boundary conditions occurs when in Section 5.4. 444In contrast to the planar case of [14], considerations through the condition impact the construction of and the rotational symmetry the region enjoys.
5.2.2 Pushing wired boundary conditions away from towards
One situation occurs as follows. It is possible that configurations distributed under can be compared to configurations distributed under by pushing boundary conditions away from the first partition of towards ; applying between deterministic and random circuits yields
by virtue of monotonicity in the domain be cause , where is taken under boundary conditions wired along and . Additionally, the comparison
holds by virtue of for the Spin measure, in which we suitably restricted our analysis of for , from which it follows that the event depends on more edges than the conditional event under does and is an increasing event. Finally, the simplest comparison, namely the equality
holds by virtue of dual boundary conditions of , in which the pushforward of the event under boundary conditions is equal to the pushfoward of the event under boundary conditions . Hence complementarity implies that the rotation of boundary conditions of gives the following upper bound,
which holds by , as wired boundary conditions for in between and can be pushed away to obtain wired boundary conditions along and for , in turn transitively yielding,
Under rotational invariance of , the argument for this case can be directly applied with . Examining the pushforward of this crossing event, in addition to which guarantees the existence of a connected component that necessarily crosses through , leads to the same conclusion with wired boundary conditions from to along . Under duality, the identification between measures under nonempty boundary conditions over readily applies. Hence a combination of , followed by , implies that occurs with substantial probability for and .
5.3
In the second case, one can apply similar arguments with the following modifications. To identify other possible symmetric regions corresponding to and , fix path realizations and (see Figure 2 for the connected components in the construction). From and , we construct by reflecting half of the domain across instead of . Under rotational invariance of , constructed in this case correspond to symmetric domains induced by the paths in and . Explicitly, the conditional probability is of the familiar form,
which by the same argument applied to is bounded above by
for . Applying the same argument to push bondary conditions away from wired boundary conditions on (), to () establishes the same sequence of inequalities, through contributions of . for corresponds to rotating the crossings of loop configurations, and hence the symmetric region to from the symmetric domain corresponding to in Figure 3.
5.4
In the third case, we denote the events and as bottom to top crossings, respectively across and , with respective path realizations and as in the previous two cases. However, the final case for top to bottom crossings stipulates that the construction of independently of . We present modifications to the square symmetric region of [14], and partition the region over which connectivity events are quantified through points to the left and right of and , respectively. In particular, we denote as the collection of all points in the hexagonal box , along with the partition . In the partition, each set respectively denotes the points to the left of , the points in between the left of and the right of , and the points to the right of . With some abuse of notation we restrict the paths in , and to coincide with crossings in between the top most edge of and , in which , , and (see Figure 5 above for the partition). We provide such an enumeration to apply and then , when comparing the spin representation measures supported over and .
Besides the partition, to apply we examine and which denote the collection of points to the left of and to the right of in the region above that is contained in (see Figure 5 for embedded within the hexagonal symmetric domain). To apply , it is necessary that we isolate and so that can be applied to the outermost layer of hexagons incident to through a partition of the incident layer.
Again, we provide an upper bound for the pushforward of the following conditional probability, for
for the class of hexagonal box symmetric domains , with .
5.4.1 Pushing boundary conditions away from towards
Next, we push boundary conditions away from . Under the assumption that the upper half of is endowed with wired boundary conditions while the lower half is endowed with free boundary conditions. We denote these boundary conditions with , and will consider the measures supported over , respectively. From observations in previous cases, to analyze the conditional probability of given and , we introduce the following lower bound for a connectivity event between and in , with,
holds from arguments applied when . By construction, implies
due to montoniticity in the domain, as the occurrence of conditionally on disjoint connected components of with those of and . In comparison to the conditioning applied through for and , the sides of are formed independently of the connected components of and ; a combination of montonicity of , in addition to through an equal partition of the incident layer outside of equally into two sets along which spin is constant.
After pushing boundary conditions towards , we make use of rotational symmetry of . In particular, the distribution of boundary conditions from the incident layer partition of 5.4.1 satisfies the following inequality,
where denotes wired boundary conditions along the top half of hexagonal . Within the sequence of inequalities, the leftmost lower bound for holds because , with denoting wired boundary conditions along and . 555In contrast to square symmetric domains of [14] for the random cluster model, hexagonal have two left sides and two right sides, and in turn require that boundary conditions along be rotated by a different angle than . The next lower bound for holds because the event depends on finitely many more edges in H than does. Finally, the last inequality holds due to complementarity as in the argument for . denotes a rotation of the boundary conditions supported over .
More specifically, rotating the boundary conditions by to obtain the boundary conditions amounts to four rotations of . With each rotation, the boundary conditions are obtained by rotating the partition of the incident layer along to its leftmost neighboring edge, in addition to modifications of the connectivity in .
Finally, the arguments imply the same result as in other cases, in which
We conclude the argument for , not only having shown that the same inequality holds for a different classes of symmetric domains in the case, but also that rotation of boundary conditions wired along the top half of for top to bottom crossings can be used to obtain boundary conditions for left to right crossings.
5.4.2 lower bound for the conditional crossing event
We complete the argument by providing the following inequalities for each case. We make use of the special case of from Section 3.2, in which for , conditionally on top to bottom crossings and from 5.2.2, the pushforward below satisfies,
((-SMP) - ()) |
where the normalization to the crossing probability in the lower bound is dependent on the edge weight . One obtains the same bound for crossings . The bound above corresponds to the partition of boundary conditions. Finally, the existence of such that the inequality in the statement of Lemma holds is of the form. We obtain several factors in the constant for the lower bound, the first of which is proportional to the reciprocal of the number of connected components and positions at which the connected components are located on the lattice,
in addition to the reciprocal of the following factor dependent on the magnitude of the two external fields , ,
Denoting the product of all the factors above as , the desired lower bound is of the form,
because the superposition of crossing probabilities,
where the first crossing probability is magnified with respect to the product of edges, loops, and the exponential of the difference between the external fields that are scaled with respect to the summation of spins, in addition to the number of monochromatically colored hexagons. We denote the spin configurations and supported over crossings over and , respectively. To provide a lower bound for this superposition of crossing probabilities, we bound each term below with,
where the crossing events are disjoint and can be chosen from the crossing events defined in 4.2. The lower bound holds because the crossing probability event depends on more edges than the event does, with the same observation holding between the crossing events and . Moreover, the superposition provided in the lower bound itself can be bounded below by the pushforward of the single crossing event,
from which the form of the constant defined above follows, due to a previous application of in the lower bound for the conditional crossing event provided in () - (). The ultimate inequality follows from the fact that each crossing event in the intersection is independently bounded below by the product of three crossing probabilities. As a result, the union bound,
holds, which is equivalent to the maximum of the crossing events taken over , and ,
which holds given that the maximum of each one of the crossing probabilities across or , across events, in addition to the fact that the lower bound for the intersection of crossing events below takes the form,
where in the upper bound can be any one of the crossings to a rightmost edge of , or , while can be any one of the crossings to a leftmost edge of , or . Observe that this particular choice of constant is dependent on the magnitude of the
Remark The above constant for which Lemma is proved, unlike the accompanying constant for the constant provided in the random cluster model case, is dependent on the product of the number of loops, the number of edges, and the difference in the number of monochromatically colored hexagons, as defined with the quantities and in (-SMP), instead of solely on .
6 Volume of connected components from wired boundary conditions
6.1 Proof of with the homomorphism of Proposition
To study behavior of the dilute Potts model in the Continuous Critical and Discontinuous Critical cases, we turn to studying vertical crossings under under wired boundary conditions. To denote vertical translates of hexagons containing , we introduce as the hexagonal box whose center coincides with that of , and is of side length . We state the following Lemma and Corollary.
Lemma (volume of connected components): For and , there exists such that, given for some , in there exits a positive satisfying,
for every , taken under wired boundary conditions.
Proof of Lemma . The arguments require use of hexagonal annuli which for simplicity we denote with , in which one hexagonal box is embedded within another (the same arrangement given in Figure 5 for top to bottom crossings in ), and set . The existence of the quantity , where is a finite constant and is the number of connected components of length is standard from [29]. To prove the statement, we measure the connected components of length from the center of in .
From the connected components of in , we can restrict the connected components to the nonempty intersection given by . The argument directly transfers from the planar case to the hexagonal one with little modification, as the restriction of the connected components of length to the annulus implies the existence of a connected set of in H, denoted with of vertex cardinality from which a subset of the connected components can be obtained. We conclude the proof by analyzing the pushforward of under wired boundary conditions supported on , in which the union bound below over satisfies,
where the union is taken over the collection of connected components under the criteria that admissible vertices from are taken to be of distance from one another in , and events denote measurable events under indexed by the number of admissible vertices from . We also apply and in the inequality above to push boundary conditions away, with arbitrary and small enough.
Next, we turn to the statement of the Corollary below which requires modification to vertical crossings across , which can be accommodated with families of boxes with varying height dependent on the usual RSW aspect ratio factor . We also make use of .
Corollary (dilute Potts behavior outside of the supercritical and subcritical regimes): For every , , there exists a positive constant satisfying the following, in which
-
for the Non(Subcritical) regime, the crossing probability under wired boundary conditions of a horizontal crossing across supported over the strip, ,
-
for the Non(Supercritical) regime, the crossing probability under free boundary conditions of a vertical crossing across , , also supported over the strip.
Proof of Corollary . We present the argument for the first statement in Non(Subcritical) from which the second statement in Non(Supercritical) follows. For , in the Non(Subcritical) phase horizontal crossing probabilities across are bound uniformly away from , which for can be demonstrated through examination of crossing events first introduced in Proof of Proposition . For , the result under which the pushforward with wired boundary conditions takes the form, for any ,
from an application of to a connected component with unit volume in type annuli.
Also, in the following arrangement, we introduce a factor for the aspect length of a regular hexagon in which mirrors the role of in RSW theory for crossings across rectangles. About the origin, we pushforward vertical crossing events on each side of , respectively given by and for such that and are of equal distance to the left and right of the origin. By construction, in any with the aspect length dependent on , intermediate regular hexagons can be embedded within corresponding to the partition of the aspect length . Longer horizontal or vertical crossings can be constructed through applications of which are exhibited below.
From the lower bound on the volume of a unit connected component, a vertical crossing across a hexagon of aspect height , from reasoning as given in can be bound below by the product of crossing probabilities of translates of vertical crossings across hexagons of aspect height .
The measure under wired boundary conditions, for a vertical crossing across , is
where the measure for the vertical crossing event given above is supported over .
From the upper bound of , longer vertical horizontal crossings occur across vertical translates of shorter vertical crossings. The next ingredient includes making use of previous arrangements of horizontal translates of , namely the left translate and the right translate . Under the occurrence of vertical crossings across and . From this event, to show that some box in between and is crossed vertically, under wired boundary conditions supported over we directly apply previous arguments from , with the exception that is applied to a countable intersection of vertical, instead of horizontal, crossing events .
Conditionally, if vertical crossings in and occur about arbitrary with , then the probability below satisfies, under wired boundary conditions,
() |
where denotes the vertical crossing across hexagons of aspect length which is the same as that of , but with and aspect height where . The union over indicates a partition of the aspect height of into intervals. Finally,
() |
The lower bound for the inequality above is obtained from an application of to the volume of a connected component from vertical crossings in and . Between the second and third terms in , monotonicity in the domain allows for a comparison between the measure under wired boundary conditions respectively supported over and .
From the partition of , to apply we consider the region between vertical crossings across and . From the previous upper bound, given some the vertical event about occurs for some . Under wired boundary conditions, the conditional vertical crossing
is bounded from below by the lower bound of . With conditioning on , the probability of simultaneous vertical crossings in and and , the pushforward under wired boundary conditions of vertical crossings across two hexagons which entirely overlap with one another gives the upper bound
where the vertical crossing occurs when the indicator is satisfied. As , the finite volume measure over under the weak limit of measures yields a similar inequality
with the exception that under wired boundary conditions is supported along the strip , and denotes the crossing event in which hexagons to the right and left of are crossed vertically. The exponential bound itself can be bounded below with the desired constant,
establishing the inequality for the Spin measure under wired boundary conditions. From the union of vertical crossings , applying the homeomorphism under the conditions on in Theorem ,
for to the inequality for vertical crossings bounded below by implies that the upper bound of on can be translated into a corresponding upper bound dependent on for horizontal crossings, obtaining a similar upper bound under free boundary conditions,
concluding the argument after having taken the infinite aspect length as for a second time. From rotational symmetries in the proof, there are six possible rotations from which can occur, in which , or . Each upper bound under wired and free boundary conditions has been shown.
7 Vertical and horizontal strip densities
7.1 Towards proving horizontal and vertical crossing densities in Definition
In this section, we make use of strip densities similar to those provided for the random cluster model in [14] (defined in 3.3) from which strip density and renormalization inequalities will be presented, in the infinite length aspect ratio limit. In the arguments below, we present boxes and across which horizontal and vertical crossings are quantified. For the lower bound of the conditional probability of obtaining no vertical crossings across each , we introduce a slightly larger hexagonal box which has an aspect height ratio insert times that of .
Definition (dilute Potts horizontal and vertical strip densities): For , , , and , with external fields , the strip density for horizontal crossings across under the Spin measure with free boundary conditions is,
while for vertical crossings across , under the Spin measure with wired boundary conditions, is,
We denote and . With these quantities, we prove the strip density formulas which describe how boundary conditions induced by vertical crossings under wired boundary conditions across relate to horizontal crossings under free boundary conditions.
In the proof below, we make use of arguments from to study vertical crossings across hexagons, and through applications of and . To prove , we define additional crossing events as follows. First, the crossing event that three hexagons, with aspect width of and aspect length placed on top of each other, is pushed forwards to apply FKG type arguments, with , over a countable intersection of horizontal crossings across hexagons with the same aspect height and smaller aspect length than that of . We denote this event with . Second, we also need the event of obtaining a horizontal crossing across and , conditioned on which we denote as . We study the conditions under which wired boundary conditions distributed from a prescribed distance of and induce vertical crossings. Third, crossing events across a larger domain than those considered in are formulated by making use of the monotonicity in the domain assumption, denoted as which is independent of .
Fourth, the intersection of the previous three events is pushed forwards, and by virtue of and , yields a strip inequality relating to , and to . In infinite aspect length as , inequalities corresponding to the horizontal and vertical strip densities are presented.
Proof of Lemma . The argument consists of six parts; we fix , . As a matter of notation, below we denote each of the three boxes below as the Cartesian product of the aspect length and height ratios, and let in the last step. In the boxes , and below, is taken smaller relative to . Under the definitions of , and , we first define all hexagonal boxes across which horizontal crossings occur, which are defined as,
for every . As indicated above, the notation , for some nonempty subset of H, denotes that the finite volume over the hexagonal lattice of length and height , for and strictly positive. In the construction, the aspect length is the same as that of , while the aspect height of each box is partitioned in relative to the scaling of the factor. Also, a final box with the scaling itself will be defined,
which is supported over which the spin measure with wired bound conditions for a lower bound of , and is an integer parameter. Second, to apply previously used, if denotes a horizontal crossing across a finite domain of , we make use of with smaller aspect lengths across which horizontal crossings occur. The lower bound for applying across a countable family of horizontal crossings is,
with the existence of the lower bound guaranteed by Corollary , and is the minimum amongst all . Before letting , pushing forwards the horizontal crossing event across under wired boundary conditions for vertical crossings across gives,
which is bounded below by the product of independent events through repeated applications of across crossing events,
for , fromo applications of , monotonicity in the domain, and applying to vertical crossing events, instead of horizontal crossing events.
By construction of , the following lower bound for the conditional event ,
where the edge weight in the lower bound is representative of additional weights in the configuration supported under the wired Spin measure over , which we denote as . In the exponential of the first external field, . In the exponent of the edge weight , by definition the number of connected components in the configuration sampled under is,
where the summation is taken over all connected components so that occurs, and all neighboring vertices and with the same spin, clearly impacting the number of connected components counted under .
Before completing the next step, we combine the estimates on and to obtain the strip inequality between horizontal and vertical crossings. The following comparison amounts to making use of and (MON) to establish the following. First, we know that the measure can be bound above with,
because the event in the upper bound is more likely to occur than the event in the lower bound, in addition to an application of for horizontal crossings, each event of which has equal probability, across , and . Also, the upper bound to the conditional probability above is established by making the comparison between measures with free boundary conditions. In comparison to the planar case, modifications to the argument with , while other properties of the random cluster measure directly apply.
In light of the lower bound in dependent on the edge weight and , we consider the horizontal pushforward from the previous upper bound with free boundary conditions,
which can be bound below by establishing comparisons between the measure under wired boundary conditions supported over a smaller hexagonal domain,
as a consequence yielding one estimate for the vertical strip density,
due to the fact that,
as , and cancellations of crossings in the inequality gives,
resulting from , as in the region below the connected component of the path associated with the crossing the induced boundary conditions dominate the measure supported over a smaller domain under wired boundary conditions.
The strip inequality for horizontal and vertical crossings is finally achieved by taking each side of the inequality to the power , which preserves the direction of the inequality as a monotonic decreasing transformation. As , we recover the peculiar definition of the horizontal strip density, while the other inequality corresponding to the vertical crossing density can be easily achieved by following the same argument, with the exception of the inequalities leading to the final estimate for vertical crossing events instead of horizontal ones.
7.2 Pushing lemma
We turn to the following estimates. In Lemmas and below, denotes the box with aspect length , and variable aspect height defined for each box in the proof. To prove (see below), we make use of the following property for the Spin measure. With the Pushing Lemma, we provide arguments for the renormalization inequalities in the next section. Under this Lemma, we proceed to obtain results for the PushPrimal and PushDual conditions (listed below), from which are the combined with the accompanying PushPrimal Strip, and PushDual Strip, to probabilistically quantify crossing probabilities across hexagons , , and (introduced in Section to obtain the vertical and horizontal strip density formulas).
Property (Finite energy for the Spin measure, [8]): For any and , , for any depending only on .
7.2.1 Statement of the two Lemmas for strip and planar domains
Lemma (Pushing Lemma): There exists positive , such that for every , with aspect length , one of the following two inequalities is satisfied,
(PushPrimal) |
or,
(PushDual) |
for every , and the superscript denotes wired boundary conditions along the left, top and right sides of , and free boundary conditions elsewhere. is the same hexagonal box used in previous arguments for Lemma . Under the PushDual condition, the analogous statement holds for the complement of vertical crossings across , under dual boundary conditions to .
Lemma (Pushforward of horizontal and vertical crossings under mixed boundary conditions): There exists positive such that for every , with aspect length , one of the following two inequalities is satisfied,
(PushPrimal Strip) |
or,
(PushDual Strip) |
for every . denote the same boundary conditions from , which manifests in the following.
7.2.2 Proof of Lemma for PushPrimal Strip PushDual Strip conditions
Proof of Lemma . With some abuse of notation, we denote the hexagonal boxes for this proof as,
for . Furthermore, we introduce the vertical segments along the bottom of each , and hexagons with same aspect length as those of each , in addition to hexagon of the prescribed aspect height below, respectively,
each of which are also indexed by , with the exception that also runs over . Before presenting more arguments for the connectivity between and , suppose that either , or for some . In the first case for the pushforward of vertical crossings in , another application of the homeomorphism from arguments to prove Corollary implies that PushPrimal Strip holds, while in the second case for the pushforward of horizontal crossings in , an application of the same homeomorphism implies that PushDual Strip holds. By complementarity, under , the pushforward of the following events respectively satisfy the lower bounds, as , and . The same argument that follows applies to lower bounds for crossing probabilities by other constants than or which are provided in [14], modifications to obtaining identical lower bounds in place of different constants are provided with the following.
With such estimates, under the same boundary conditions listed in PushPrimal Strip PushDual Strip, the Spin measure satisfies
where the upper bound for the probability of the intersection of the three events above only holds under boundary conditions in which the incident layer to the configuration (as given in arguments for the proof of Lemma ), the boundary conditions for the measure dominating boundary conditions holds because every vertex that is wired in the boundary conditions is also wired in the boundary conditions for the pushforward in the upper bound. Moreover, the partition of boundary vertices in the boundary conditions for the upper bound is composed of the arc that is wired in the boundary conditions for , in addition to a singleton
Under boundary conditions introduced for the high-temperature spin measure above, the conditional probability
can be bound below by conditioning on a horizontal crossing across . In particular, conditionally on , the connectivity event
can be bounded below as shown above through applications of and . Each property is applied as follows; for , we make use of previous partitions of the incident layer of hexagons to a configuration, in which can only be applied when the outermost layer of a configuration can be partitioned into two equal sets over which the spin is constant.
Concluding, we apply standard arguments for the crossing event below through a lower bound dependent on a conditional probability,
from which an application of , given suitable , for the countable intersection, dependent on , of horizontal crossings across hexagons of sufficiently small aspect length . The inverse proportionality in the lower bound is dependent on the product , defined in the proof for Lemma on page 21, with running over two configurations with respective number of connected components and . The lower bound dependent on the edge weight arises from multiple applications of and (MON), in which the modification to (SMP) from the random cluster model argument with for the Spin Measure results in comparisons between configurations and partitions of the incident layer as described in 5.2.
Instead, if we suppose that the lower bounds for for real , the lower bound on the second line above takes the form,
due to the fact that the boundary conditions from the special case of the inequality, where the power to which the product of the edge weight and difference in monochromatically colored triangles is raised to the aspect ratio of , and the number of connected components in the exponent of is the difference between the number of connected components of a configuration respectively sampled under and .
Furthermore, the lower bound dependence on the edge weight , and , emerges from an application of (FKG) to the pushforward below of the connectivity event between and , bounded below above,
which can be further bounded below by the product of crossing probabilities,
Observe that the horizontal crossing pushed forwards in the inequality above yields the desired pushforwards in the PushDual condition, as the previously mentioned application of yields,
for crossings across each of the hexagons , and where the respective powers , and appear in powers of the number of loops, edges, and exponential for the first external field. The form of the constant is provided in the lower bound above, and the same argument can be applied to obtain constant corresponding to the PushDual Strip for vertical hexagonal crossings to obtain the desired constant in the lower bound, concluding the proof.
7.3 Lemma arguments from Strip conditions
Proof of Lemma . We show that either , or that . Without loss of generality, suppose that holds; to show that holds, we introduce the following collection of similarly defined boxes from arguments in on the previous page,
for , with sufficiently large. Under boundary conditions,
the probability of a complement of the vertical crossing across , and can be bounded below by because by assumption holds. Clearly, the probability of obtaining a vertical crossing across the last rectangle over all can be determined by applying the FKG inequality across each of the smaller hexagons, yielding an upper bound of to the probability of obtaining a longer -hexagon crossing.
Next, with similar conditioning on horizontal crossings in previous arguments, the probability of a horizontal crossing across , given the occurrence of a horizontal crossing across , satisfies for every ,
with the exception that the pushforward , taken under boundary conditions, in comparison to previous arguments for the wired pushforward
below by for Corollary , can also be applied to bound the intersection of conditional events, for the event , for all ,
implying that the identical lower bound from the holds, across the countable intersection of horizontal crossings,
We conclude the argument, having made use of the previous application of FKG across , uniformly in boundary conditions .
8 Renormalization inequality
We now turn to arguments for the Renormalization inequality. We make use of notation already given in the proof for the vertical and horizontal strip inequalities of Lemma , namely that we make use of a similar partition of the hexagons to the left and right of some . To restrict the crossings to occur across hexagons of smaller aspect length, we change the assumptions on our choice of , and follow the same steps in the argument of Lemma to obtain a lower bound for the pushforward , where denotes the event that each of the three boxes which are defined in arguments below. The partition of the aspect length of is dependent on . Also, the smaller scale over which we force the horizontal crossings to occur in is reflected in the partition of the aspect length, which not surprisingly permits for applications of with domains that are indexed by an auxiliary parameter for . The partition of into the three boxes determines corresponding powers, dependent on to which the horizontal or vertical strip densities are raised before taking . As previously mentioned, differences in emerge in one step of the following argument. We discuss the arguments for the proof when holds, and in the remaining case when holds, a modification to the argument is provided.
8.1 Arguments for obtaining renormalization inequalities in the thermodynamic limit
Proof of Lemma . Suppose that holds; the case will be discussed at the end. In light of the brief remark of the argument at the beginning of the section, we introduce the three boxes to partition the middle of from the proof,
for every , and will apply steps of the argument from the proof of Lemma , in which we modify all pushforwards under the prescribed boundary conditions for . By construction, the boxes , , and , each have the same aspect ratio, yet differ in the increment of the factors , given sufficiently large, is given by,
Briefly, we recall the steps with the sequence of inequalities below. Under one simple modification through the lower bound, we analyze the intersection of crossing probabilities as given in , implying,
from which the conditional probability dependent on can be bound from below as follows,
Further arguments result in the following lower bound for the probability of ,
which is the same lower bound provided in . The exponents of the number of edges and the exponential of the first external field are respectively parametrized with respect to the number of edges , and the number of hexagons that are not monochromatically colored. On the other hand, under the condition, the conditional pushforward under wired boundary conditions supported over satisfies,
which will be used to complete the remaining steps from the proof. In particular, the intersection can be bounded above by the product of horizontal crossings below, from ,
through the same application of and (MON), and where denotes the crossing event that neither of the three hexagonal boxes defined at the beginning of the proof are vertically crossed. As a result, the last application of yields, for horizontal crossings across thinner hexagons,
under free boundary conditions.
Finally, comparing the pushforward under free boundary conditions to the pushforward under wired boundary conditions yields, after taking the same infinite aspect length limit as in Section 7. From previous applications of and (MON) are used, in order to suitably compare boundary conditions, as a consequence imply a similar estimate as in Section 7,
which, as in previous arguments for Lemma , is bounded below by the following infinite aspect ratio limit,
with the exception that the support of the measure with free (-) boundary conditions is over a hexagon with thinner aspect length. The result corresponds to the renormalization inequality for the horizontal crossing probability, concluding the argument under the assumption. Below, we briefly describe how the same sequence of inequalities applies for the remaining possibility.
Suppose that holds. Under this assumption, denote as the crossing event that none of the boxes are vertically crossed. From this event, the assumption implies from the definition of the horizontal and vertical strip densities for the Spin Measure that the arguments to bound the conditional probability can be achieved by the same line of argument, possibly with larger .
9 Quadrichotomy proof
In the final section we classify all possible behaviors of the model. Briefly, we remark that for the continuous critical case, the first part of the argument does not require use of (SMP) and (CBC) for original results in the random cluster model, implying that the entirety of the argument immediately applies. Briefly, we summarize the steps of the argument. We consider horizontal crossing events across a regular hexagon, pushed forwards under free boundary conditions for the Spin measure supported over a slightly larger hexagon. From knowledge of the longest edge in the path of the horizontal crossing, removing the largest edge from the configuration easily yields a connectivity event along the common set of edges over a subgraph of the triangular lattice that excludes the length of the maximal edge along two points and . These steps demonstrate the ingredients for the Discontinuous Critical case, before obtaining the horizontal strip densities in the infinite aspect length limit as . For the discontinuous critical case, the second part of the argument requires use of and (MON). Before proceeding, we cite the following theorem which classifies the probability of obtaining loop configurations of fixed length in the model. In the following application of the inequalities, we choose an aspect ratio of hexagons dependent on , from which horizontal and vertical crossings will be studied.
Theorem (Continuous & Discontinuous critical cases, behaviors of the dilute Potts model quadrichotomy, [8] ): For configurations distributed under the , for and , one of the two possible behaviors occurs,
(Exponential decay of + paths) |
where is the diameter of the largest loop surrounding the origin, demonstrating that paths are exponentially unlikely for any , or,
(RSW box-crossing property) |
demonstrating that the RSW box-crossing property is satisfied. Each possibility holds for boundary conditions and .
Observe that we have slightly rephrased the first condition provided in [8] which is stated instead for the loop measure P, of Section 3.1. The equivalent condition of obtaining a loop configuration whose largest diameter about the origin is is equivalent to obtaining a path of spins about the origin. From the statement of Theorem , we now study .
9.1 Subcritical Supercritical behaviors
Proof of Theorem (Discontinuous Critical phase from non Subpercritical phase). As mentioned at the beginning of the section, first suppose that the first possibility holds. To show that this condition implies that the phase transition is discontinuous, consider the following. Define a horizontal crossing across . From the existence of such an event, the longest edge in the crossing of arbitrary length then excluding the length of this longest edge from the crossing implies that another closely related crossing event occurs across a subgraph of the triangular lattice which excludes the maximal edge with length . Hence there exists vertices in a subgraph of the triangular lattice, such that the vertices and are connected by a path in a hexagon of smaller aspect length that is not regular. Collecting these observations implies the following, where the upper and lower bounds of the inequality are taken under boundary conditions, by the union bound,
where and are the vertices, with an arbitrary positive constant. For the next step, we introduce horizontal translates of with . Across all horizontal translates of , yields the following lower bound for the connectivity event between and each , by (MON) and (FKG),
From previous remarks, the first upper bound given in the proof dependent on yields the inequality, as applied in several times previously in the argument,
from which taking the infinite limit as in previous arguments implies, for ,
so that the pushforward of the spin measure under free boundary conditions satisfies the strip density estimate from the original definition provided in the beginning of Section 7, from the connected components of paths from the occurrence of . Finally, we observe that the upper bound for the horizontal strip density decays exponentially fast, implying that the pushforward in the lower bound taken under free boundary conditions does as well. As expected, to analyze the other possibility for infinitely long vertical crossings, repeating the same steps of the argument, with the exception that the horizontal crossing event is instead a vertical crossing event, simply yields a similar bound, from an application of for some integer satisfying the conditions of the Lemma, that the probability of obtaining an infinitely long vertical crossings is an upper bound of the following inequality,
which nevertheless still exponential decays for the same reason as . This conclude the argument for the model, demonstrating that the horizontal and vertical strip densities hold for infinite aspect ratios.
In the following, we analyze the Continuous critical case to obtain RSW results.
Proof of Theorem (Continuous Critical phase from non Subcritical phase). To prove RSW results, consider the following four finite volumes, with , and ,
We bound the crossing probability of a the horizontal crossing event below with the product of vertical and horizontal strip densities (from Definition ). To ensure that the appropriate cancellation of crossing events occurs, we bound the probability of a horizontal crossing event with the horizontal strip density , in which,
for every and boundary conditions (all vertices along the edges of the hexagon on the left and right are wired), due to the fact that,
for , and , raising the inequality to as . On the other hand, below we bound the probability of the following intersection of crossing events, conditionally on ,
which can similarly be lower bounded with the vertical crossing strip density, as,
for sufficiently large, and as the inequality is raised to as . The two inequalities can be bounded below by the product of horizontal and vertical strip densities,
Finally, the ultimate term in the inequality above can be bounded above with the horizontal crossing event of interest, as the conditioning on the other two horizontal crossing events is removed,
Altogether, by duality and rotational invariance of , one obtains,
where is a rotation of , implying that the RSW inequality for horizontal crossing events is, with respective constants and provided in the lower and upper bounds,
independently of boundary conditions , hence concluding the proof because the Continuous Critical phase occurs.
9.2 Applications of different phases of the quadrichotomy
9.2.1 Subcritical regime
Proposition A (coexistence of wired and free high-temperature measures). The probability of connectivity to distance under the wired high-temperature Loop measure is exponentially upper bounded, as
also implying that .
Proof of Proposition A . To show that in Subcritical, we lower bound the horizontal crossing probability in terms of crossings of loops to the left and right sides, respectively and of , in which,
As a consequence, by the probability of connectivity to distance decays exponentially fast. The fact that the high-temperature measure under wired and free boundary conditions coincides follows from classical arguments.
9.2.2 Supercritical regime
Proposition B (exponential unlikelilihood of obtaining finite connected components). In Supercritical, the probability of an infinite connected component under free boundary conditions of being absent is exponentially unlikely, as
Proof of Proposition B. By duality, if an infinite connected component does not exist in the primal configuration, then an infinite connected component exists in the dual configuration that is measurable over T. With the dual configuration, there does exist a loop whose maximum diameter is , implying that the standard connectivity event at distance does occur. The inequality follows.
10 Acknowledgments
The author would like to thank Philippe Sosoe for comments on the Introduction.
11 References
[1] Beffara, V. & Duminil-Copin, H. The self-dual point of the two-dimensional random-cluster model is critical for . Probability Theory and Related Fields 153 511-542 (2012).
[2] Beliaev, D., Muirhead, S. & Wigman, I. Russo-Seymour-Welsh estimates for the Kostlan ensemble of random polynomials. Arxiv (2017).
[3] Crawford, N., Glazman, A., Harel, M. & Peled, R. Macroscopic loops in the loop model via the XOR trick. Arxiv (2020).
[4] Clarence, J., Damasco, G., Frettloh, D.,. Loquias, M. Highly Symmetric Fundamental Domains for Lattices in and . Arxiv (2018).
[5] Duminil-Copin, H. Parafermionic observables and their applications to planar statistical physics models. Ensaois Matematicos 25 1-371 (2013).
[6] Duminil-Copin, H. Parafermionic observables and their applications. AMP Bulletin (2015).
[7] Duminil-Copin, H. Sharp threshold phenomena in statistical physics. Japanese Journal of Mathematics 14 1-25 (2019).
[8] Duminil-Copin, H., Glazman, A., Peled, R. & Spinka, Y. Macroscopic Loops in the Loop model at Nienhuis’ Critical Point. Arxiv.
[9] Duminil-Copin, H., Hongler, C. & Nolin, P. Connection probabilities and RSW-type bounds for the FK Ising Model. Communications on Pure and Applied Mathematics 64(9) (2011).
[10] Duminil-Copin, H., Manolescu, I. & Tassion, V. Planar random-cluster model: fractal properties of the critical phase. Arxiv (2020).
[11] Duminil-Copin, H. & Smirnov, S. Conformal invariance of lattice models. Arxiv (2012).
[12] Duminil-Copin, H. & Smirnov, S. The convective constant of the honeycomb lattice equals . Annals of Mathematics 175(3) 1653-1665 (2012).
[13] Duminil-Copin, H., Sidoravicius, V. & Tassion, V. Continuity of the phase transition for planar random-cluster and Potts models for . Communications in Mathematical Physics 349 47-107 (2017).
[14] Duminil-Copin, H. & Tassion, V. Renormalization of crossing probabilities in the planar random-cluster model. Arxiv.
[15] Feher, G. & Nienhuis, B. Currents in the dilute model. Arxiv 1510.02721v2 (2018).
[16] Fradkin, E. Disorder Operators and their Descendants. Lecture Notes.
[17] Glazman, A. & Manolescu, I. Uniform Lipschitz functions on the triangular lattice have logarithmic variations. Arxiv (2019).
[18] Gheissari, R. & Lubetzky, E. Quasi-polynomial Mixing of Critical two-dimensional Random Cluster Models. Random Structures & Algorithms 56(2) (2019).
[19] Guo, W., Blote, H. & Nienhuis, B. First and Second Order Transitions in the Dilute models International Journal of Modern Physics 10(1) 291-300 (1999).
[20] Guo, W., Blote, H. & Nienhuis, B. Phase Diagram of a Loop on the Square Lattice. International Journal of Modern Physics 10(1) 301-308 (1999).
[21] Hongler, C. Percolation on the triangular lattice. Arxiv (2007).
[22] Nienhuis, B. & Guo, W. Tricritical models in two dimensions. American Physical Society 78, 061104 (2008).
[23] Russo, L. A note on percolation. Zeitschrift fur Wahrscheinlichkeitstheorie und Verwandte Gebiete 43 39-48 (1978).
[24] Seymour, P. & Welsh, D. Percolation probabilities on the square lattice. Annals Discrete Math, 3 227–245 (1978).
[25] Smirnov, S. Discrete Complex Analysis and Probability. Proceedings of the International Congress of Mathematicians (2010).
[26] Smirnov, S. Conformal invariance in random cluster models. I. Holomorphic fermions in the Ising model. Annals of Mathematics 172 1435-1467 (2010).
[27] Tassion, V. Crossing probabilities for Voronoi percolation. The Annals of Probabilitiy 44(5) 3385-3398 (2016).
[28] Zeng, X. A Russo Seymour Welsh Theorem for critical site percolation on . Arxiv (2013).
[29] Grimmett, G. Percolation, Volume 321 of Fundamental Principles of Mathematical Sciences. Springer-Verlag, second edition (1999).
[30] Nienhuis, B. Locus of the tricritical transition in a two-dimensional -state Potts model. Physics A 177: 109-113 (1991).