Exponential decay of correlations in the 2D random field Ising model
Michael Aizenman, Matan Harel, Ron Peled

TL;DR
This paper extends the analysis of correlation decay in the 2D random field Ising model to positive temperatures with weak disorder, using a novel continuous function representation and disagreement percolation.
Contribution
It introduces an exact continuous function representation of the order parameter, enabling new decay of correlation results at positive temperatures for weak disorder.
Findings
Proves exponential decay of correlations in the 2D RFIM at positive temperatures
Extends previous zero-temperature results to positive temperatures
Uses disagreement percolation for analysis
Abstract
An extension of the Ising spin configurations to continuous functions is used for an exact representation of the Random Field Ising Model's order parameter in terms of disagreement percolation. This facilitates an extension of the recent analyses of the decay of correlations to positive temperatures, at homogeneous but arbitrarily weak disorder.
Peer 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.
Exponential decay of correlations
in the random field Ising model
Michael Aizenman
Michael Aizenman Departments of Mathematics and Physics, Princeton University, Princeton, NJ 08544, USA. 111Weston Visiting Professor, Weizmann Institute of Science, Rehovot Israel.
,
Matan Harel
Matan Harel School of Mathematical Sciences, Tel Aviv University, Israel.
and
Ron Peled
Ron Peled School of Mathematical Sciences, Tel Aviv University, Israel.
(Date: Version of )
Abstract.
An extension of the Ising spin configurations to continuous functions is used for an exact representation of the Random Field Ising Model’s order parameter in terms of disagreement percolation. This facilitates an extension of the recent analyses of the decay of correlations to positive temperatures, at homogeneous but arbitrarily weak disorder.
1. Introduction
1.1. The Imry-Ma phenomenon and the question discussed here
In the Imry-Ma phenomenon, first-order phase transitions of two-dimensional statistical mechanics systems are turned continuous under the incorporation of quenched disorder in the suitably conjugate field variable [19]. This is exemplified by the rounding of the Ising model’s famed discontinuity of magnetization as a function of the external field , through the addition of a random field of arbitrarily weak strength .
The Random-Field Ising Model (RFIM) is a spin system on a finite graph with the Hamiltonian
[TABLE]
where are the Ising -valued variables, are positive coupling constants, are independent, identically distributed, non-constant external fields, is the graph’s edge set, and is the disorder strength parameter.
For a fixed realization of the random field, , the Gibbs equilibrium state is described by the probability measure
[TABLE]
where is the inverse temperature and is the normalizing factor, which is referred to as the partition function. In finite volumes the Gibbs measure depends also on the boundary conditions, e.g. the imposition of specific values on the spins along the boundary. Given , and a function , we denote by the Gibbs measure on restricted to configurations such that on ; its normalizing factor is
[TABLE]
If is a subset of , is its internal vertex boundary (denoted ), and is identically , we will abbreviate by ; the negative case is defined analogously. The associated expectation operators will be denoted by and .
For the RFIM, the and boundary conditions are of particular interest, since, for any , the Gibbs states corresponding to all other values of are bracketed by these two (through the FKG inequality). In this case, the formal expression of the rounding effect is the statement that, in two dimensions and for arbitrarily weak disorder strength , there is no residual symmetry breaking, in the sense that
[TABLE]
as probability measures (or, equivalently, as expectation value functionals) describing the system in the infinite volume limit.
For the Ising model, equality of the limiting states is equivalent to the uniqueness of the infinite volume Gibbs state. To place this in a broader context, let us add that, for systems which are not endowed with an FKG-type monotonicity property, one has only the weaker statement that the free energy function is differentiable in , or, equivalently, that all Gibbs states assign a common value to the volume-averaged magnetization [4, 5]. However, the robustness of the thermodynamic version of the statement has enabled its extension to quantum systems [2].
For spin models with rotational symmetry, such as the models, the rounding effect (at any ) extends to three and four dimensions, provided the probability distribution of is rotationally invariant [4, 5]. Furthermore, all the statements also hold in the limit , in which case they refer to the model’s infinite-volume ground state(s).
An intuitive explanation of the effect’s dependence on dimension can be found by comparing the contribution of two possibly conflicting terms to the difference of free energies between two ordered states in a box of linear size . One term is the coupling with the random field throughout the volume of the box, and the other is the coupling with the neighboring regions. The first produces a local magnetization bias, while the second tends to keep the local magnetizations aligned. It seems natural to guess that the effect of the local field is a Gaussian variable of scale , while the boundary pull is of the order of , or, in the presence of rotational symmetry, . At the critical dimension, which is in case of the RFIM [17, 8, 10], the two scale similarly. However, for any given site , fluctuations will cause the random field in a box centered at to eventually exceed the boundary pull. This suggests that, even at weak disorder (), the Gibbs state resembles a patchwork of locally ordered states.
Since the early works on the subject, questions have been raised concerning the decay rate of the resulting state’s correlation functions. These relate to the decay of correlations among the local spin magnetizations, which are quasi-local functions of the quenched random field, as well as to the typical decay of spin correlations within the quenched state. As presented in [3], both are dominated by the function
[TABLE]
where
[TABLE]
with the graph distance on and .
It has been early recognized, and since then proven in a variety of ways, that at high disorder and/or high temperatures, decays exponentially fast [18, 7, 11]. The more interesting question is the nature of the decay at weak disorder, and in particular, whether there is a qualitative difference between weak and very weak disorder, with transition from exponential decay at weak disorder to power-law decay at very weak disorder [16, 14, 9]. It is convenient and natural to focus on the case of Gaussian disorder. This special case is fully expected to be indicative of more general distributions.
Recent results on the subject include: i) an initial bound [12], ii) power-law bounds for all and , including also all finite-range ferromagnetic interactions [3], and, more recently, iii) exponentially-decaying upper bounds for all [15], limited to the nearest-neighbor case and . The latter result answers (in the negative) the question of possible transition in for the RFIM’s ground state, but stops short of addressing the additional effect of thermal fluctuations.
The main result of this paper, which is being produced in parallel to an ongoing extension of [15] by its authors to positive temperatures, is the proof of the following statement.
Theorem 1.1**.**
In the random-field Ising model on with the standard nearest-neighbor interaction of strength and independent standard Gaussian random field , for any temperature , uniform external field , and disorder intensity ,
[TABLE]
with that do not depend on or .
1.2. Key ingredients
Following is an informal summary of the key concepts used in the proof. These are presented more explicitly in the sections which follow.
Continuous extension of the Ising Model. We introduce an extension of the model in which the original binary spin variables are extended to random continuous functions supported on the graph’s edges. The extended functions are restricted to values only at the graph’s vertices, and their measure’s restriction to this collection of variables yields the Ising model’s standard Gibbs state.
Disagreement percolation. The term has already been invoked as offering a clarifying perspective on questions of the type considered here. In this paper, we will invariably refer to a version which is based on the extended formulation of the model. The continuity of the extended spin function allows to identify the order parameter as the suitably averaged probability that, in , the origin is connected to the boundary by a path along edges on which , with the pair sampled independently with the indicated boundary conditions.
Surface tension. We extend the past observations of [3] on the different relations of the surface tension with disagreement percolation. In particular, we present an upper bound on the surface tension between two surfaces in terms of the amount of the disagreement percolation flux through an arbitrary non-anticipatory random set separating the two.
Tortuosity of the disagreement paths. The improvement presented in this paper over [3] is based on the quantification of the observation, which was expressed in [3] at only a heuristic level, that the disagreement percolation is weakened by the fractality of its connected clusters. A path from this suggestion to a proof was pointed out, in a somewhat modified context, in the aforementioned work of Ding-Xia [15]. As there, this part of the argument makes an essential use of the sufficient condition for tortuosity of Aizenman-Burchard [1]. Verifying the condition’s assumptions is a somewhat technical part of the analysis, and the only step for which the arguments employed here are limited to the nearest-neighbor models, i.e. restricted to strictly planar interactions, and not just short-range models.
Through the tortuosity condition, we establish that, for some , the probability that a regular annulus of scale is traversed by a path of disagreement percolation with less than lattice steps vanishes as tends to infinity.
A bootstrap argument. The last step in the proof is a bootstrap argument which extracts an exponential upper bound on the function from the above estimates. Use is made of the fact that, like in the case of other percolation models, fast enough power law decay implies exponential decay (cf. [3]). Anti-concentration bounds play a role in the analysis, as well as concentration bounds which control the contribution of exceptional random field configurations.
The above outline offers also the plan of the paper.
2. A continuous extension of the Ising model
While spins of a general Ising model are naturally associated with the vertices of a graph, which will generically be denoted , we find that, for a faithful disagreement percolation picture, it is convenient to extend their definition to functions supported along the graph’s edges. For ease of notation, this construction is presented for the standard nearest-neighbor interaction. We extend into a metric graph, i.e. substitute metric intervals for the edges. The resulting metric space of lines linked at the vertices of will be denoted . We shall use to denote the midpoint of the edge .
The construction given below extends the notion of spin configurations on to a set of highly-constrained continuous functions on , each being completely determined by its values on the vertices and the edge midpoints of , where the function is allowed to take values only in .
Formally, we let be the set of continuous functions such that
- i)
at the graph’s vertices , 2. ii)
at edge midpoints, , and 3. iii)
along each edge, is given by the linear interpolation between its value at the center and at the nearest of the two edge ends.
Thus, is determined by its restriction to the vertices of and to the midpoints of its edges, which we denote by and , respectively. Let be the graph whose vertex set is the disjoint union of and the midpoints of the edges of . The edge set of is . We refer to it as the extended graph.
On a finite graph , given a realization of the external field, let be the unique probability measure on the set of functions with
[TABLE]
where
[TABLE]
and, for each and ,
[TABLE]
and are related to the inverse temperature by
[TABLE]
One may note that if and , the value of is constrained to be zero; furthermore, implies that , with an analogous statement holding for . We call these conditions the ‘hard’ constraints of the extended Ising model.
Given a subset , we call an allowed configuration if there exists which is equal to on and satisfies the hard constraints described above. For any and allowed configuration , we denote the corresponding restricted probability measure . When , this measure is equivalent to conditioning on the event . The partition function is defined analogously.
Lemma 2.1**.**
For any finite graph and a realization of the external field , at positive temperatures:
- i)
The probability measure has the domain Markov property on the extended graph . 2. ii)
The measure’s restriction to coincides with the Gibbs measure on . 3. iii)
For any and , the marginal distribution of the restricted measure on coincides with the correspondingly restricted measure . 4. iv)
For any , and allowed configuration such that , the marginal distribution of on coincides with the corresponding Gibbs measure on the reduced graph obtained by limiting the edge set to (without changing the vertex set). 5. v)
The extension does not affect the partition function, i.e.
[TABLE]
Proof.
The statement can be readily deduced from the definition, paying attention to the following key observations, listed by the claim number.
i) The domain Markov property follows from the multiplicative structure of .
ii) For each edge of , , the summation over the values of yields
[TABLE]
A consultation with (2.4) implies that
[TABLE]
iii) Since all hard constraints involve at least one mid-edge variable, restricting the value of on cannot violate any of them.
iv) For each edge the factor in (2.1), is spin independent and thus can be omitted.
v) The last claim (and the only one for which the value of in (2.3) is of relevance) follows readily from (2.7). ∎
As a corollary, we note that, in the limit , the probability distribution of concentrates on the ground-state configurations of , and at edge midpoints the values are rigidly constrained to equal the mean of the value of the two endpoints.
Another corollary is that the extended Ising model inherits the standard FKG-type monotonocity properties of the (non-extended) Ising model. For instance, if , the marginal of the measure on is stochastically dominated by .
3. Disagreement percolation
The extension of the Ising model to facilitates the following exact relations in which the mean spin - spin correlation, and related measures of influence propagation, are cast in terms of disagreement percolation.
With that end in mind, let be a finite graph, , and consider and to be sampled independently from and , respectively. The disagreement set of and is
[TABLE]
We say that are connected in , denoted by , if there is a path connecting them which stays in .
For a set , let be the union of the connected components of that intersect .
For pairs of configurations, we denote by , or just if is clear from context, the expectation with respect to the product measure , and by the expectation with respect to the product of two identically distributed copies of . The truncated correlation function denotes .
Proposition 3.1**.**
For any random-field Ising model on a finite graph and any realization of the external field :
- (1)
for all ,
[TABLE] 2. (2)
For any and
[TABLE]
Applying equation (3.3) with and , we obtain the following geometric representation of the order parameter of equation
[TABLE]
The identities of Proposition 3.1 are proven using a general principle of symmetry under the following class of swap operation. For any pairs of sets , let be the mapping which acts as the identity in case , and otherwise swaps the configurations in , in the sense that
[TABLE]
Proposition 3.2**.**
For any , and pair of maps from to , the independent product measure (interpreted as if ) is invariant under the action of .
Proof.
Since is one-to-one (indeed, ), it suffices to verify that it preserves the product of the weights of the two configurations. That is so since, for each pair , the factors in (2.1) corresponding to the two configurations are either left unaffected or exchanged. The essential observation here is that the swap affects entire disagreement clusters, along whose external boundary the two configurations agree. ∎
Remark: The symmetry operation described in Proposition 3.2 is essentially equivalent to the ‘cluster swap’ operation of Sheffield [20, Chapter 8] (with earlier uses by van den Berg in his disagreement percolation [6]) applied to the (non-extended) RFIM (see [13, Section 2] for a review).
Proof of Proposition 3.1.
The first item follows from the observation that
[TABLE]
where the final equality follows from the observation that, whenever and are disconnected in , we may ‘swap’ the connected component of in without affecting the value of by Proposition 3.2. The proof is completed by noting that on the event .
The second item is proved analogously. ∎
4. The surface tension
4.1. Definition and relation with disagreement percolation
A useful role in the analysis is played by the following quantity.
Definition 4.1**.**
Given a finite graph the surface tension between a pair of subset at a given realization , and at temperature (which will often be omitted in our notation) is
[TABLE]
where , at , is the partition function with the spins restricted to the indicated values on and .
Of particular interest will be the situation where are the vertex boundaries of two subgraphs , with (and and are disjoint). In a slight abuse of notation, in such cases we shall refer to also by the symbol .
The surface tension bears a number of relations with the disagreement percolation process , where are independently sampled from . One of these is an identity, which appears in [3], relating the surface tension to the thermal average of the number of disagreements in . We define
[TABLE]
and observe that, by Proposition 3.1,
[TABLE]
where we recall that is the connected component of containing . In these terms, one has:
Theorem 4.2**.**
Let be subgraphs with disjoint internal vertex boundaries. For the RFIM with IID standard Gaussian random fields, the surface tension bears the following relation with disagreement percolation:
[TABLE]
where:
* is defined by adding a uniform field of intensity in *
[TABLE] 2. 2)
the subscript on indicates the average over the variable
[TABLE]
*at fixed values of the other, orthogonal, Gaussian degrees of freedom which determine , * 3. 3)
* is the Gaussian density function .*
The proof given in [3] (in reference to ) extends to the presented statement with only notational modifications.
The second relation used here is an upper bound on . For that, it is instructive to first note the following identity.
Proposition 4.3**.**
Let such that and are disjoint. Then
[TABLE]
Proof.
In this proof, we will denote by the expectation operator induced by the product measure . In this notation
[TABLE]
Observe that
[TABLE]
This is true because the pair must ‘switch’ from being identically on the boundary of to being identically on the boundary of ; in the extended Ising model, this is not compatible with a connection in .
Next, the symmetry argument which was used in the proof of Proposition 3.2 implies also that the product
[TABLE]
(which gives the contribution to the partition function of terms for which the indicated boundary conditions are met) is invariant under the exchange of with . From the resulting equality for the case , we deduce that
[TABLE]
4.2. Bounding the surface tension via non-anticipatory sets
The next upper bound combines a swap similar to that employed for (4.7), while estimating the effects of imperfections that arise when the swap is not an exact symmetry. It is an extension of Theorem 4.1 of [3] to random non-anticipatory sets, a notion which we now define.
Given in and a set , we denote the ‘forward’ set of by
[TABLE]
The complement of in is called , the ‘backward’ set of . We say that is a separating set if and .
Definition 4.4**.**
A random set is called non-anticipatory if, for any set , the event is measurable with respect to the restriction of to .
Proposition 4.5**.**
Let be finite subsets, and fix a realization of the random field . Let be a non-anticipatory separating set such that, almost surely,
[TABLE]
Then
[TABLE]
Proof.
It suffices to prove the theorem for , as both sides of (4.12) are for almost every continuous at .
Set . As was explained in Lemma 2.1 (cf. (2.5)) the partition function of a model can be computed by summing the weights over the configurations of the extended version of the model. The partial sums, corresponding to summing first over the edge variables, reduce the expression to the more standard sum of the Gibbs weights summed over the regular spin configurations . In the following proof we shall mix the two representations.
Given a deterministic separating set and an extended Ising configuration , let and be the restrictions of to and , respectively. Upon summing the weights over the midedge variables in the forward set, we are left with a mixed formula for the partition function in which the remaining summation is over the pair , with suitably mixed weights. If we further assume that satisfies (4.12), the weight takes on a particularly simple form of
[TABLE]
where is the energy of alone (including the contribution of the external field on ), plus the energy terms for pairs of neighboring vertices one of which is in and the other in . (In other words, vertex sites of act as an external boundary condition, and under the condition (4.12) edge vertices of turn the edge into a free boundary condition.)
This prescription extends naturally to any non-anticipatory random set . Decomposing the partition function according to the particular realization of the random set, one gets:
[TABLE]
where the sum is over all separating sets and correspondingly split configurations, as explained above. The first indicator ensures that the set coincides with the value of the random variable ; the next four indicators impose the appropriate boundary conditions on . The functions and represent the product of all weights over edges of and restricted to , respectively. We note that since is non-anticipatory the input to the first indicator can indeed be written as just the pair .
Upon the relabeling the variables in the switched order, (4.15) transforms into:
[TABLE]
with the energy switching cost function
[TABLE]
The energy cost is null if there are no disagreement percolation sites along , and otherwise it is clearly of the order of . For an explicit bound one easily gets:
[TABLE]
The above switch in the notation translates into a change in the boundary conditions, and can be summarized in the following relation
[TABLE]
For the surface tension this gives:
[TABLE]
where the first inequality is (4.18), and the second is by Jensen’s inequality applied to the convex function . ∎
5. Fractality of disagreement percolation
5.1. A sufficient condition for tortuosity
The surface tension upper bound of the previous section will be significantly boosted through the observation that the path along the clusters of disagreement percolation are tortuous, in the following sense.
Lemma 5.1**.**
Set . Let denote the event that the annulus is crossed by a path of disagreement percolation whose length is at most . Then, for some :
[TABLE]
The arguments of this section are close to the zero-temperature tortuosity argument of [15]. The desired statement follows from [1, Theorem 1.3] through an estimate on the probabilities that collections of well-separated rectangles are simultaneously traversed in the long direction.
For an explicit statement of the condition, consider configurations defined in , and the percolation cluster which they define. We shall refer by to collections of rectangles of possibly varying orientations in , with the properties:
- (1)
Each has side lengths with . 2. (2)
Each is contained in the annulus . 3. (3)
The distance between distinct is at least .
We call such a collection well-separated.
We can associate with a polygonal curve in by embedding in in the natural way and including the straight lines between adjacent vertices in . We say that the event occurs if the curve associated to contains a path connecting the short sides of .
By the general sufficient condition of [1, Theorem 1.3], Lemma 5.1 can be deduced from the following statement.
Lemma 5.2**.**
There exists such that for any set of well-separated rectangles ,
[TABLE]
Our goal in this section is to prove this estimate, which we shall do with
[TABLE]
at some absolute constants . This is followed by a quantitative version of Lemma 5.1.
5.2. Disagreement lassoes
The first step is to bound the probability that the disagreement set forms a circuit in an annulus (the lasso event). This would allow to bound away from the crossing probability of a single rectangle, and finally verify (5.2).
For this section we denote by the event that the boundary component of the disagreement set in contains a circuit in the annulus , and refer to it as a lasso event.
Lemma 5.3**.**
There exist absolute constants with which for all integers
[TABLE]
We prove the lemma for ; the zero-temperature case follows by continuity.
A key tool towards the proof of Lemma 5.3 is a self-bounding inequality that we now phrase. Fix an integer . For brevity, denote and shorthand to . Cover the annulus by translates of : for some chosen so that smaller than a suitable absolute constant. Note that for each . Recalling (4.2) and (4.3), we denote the thermal average of the number of disagreements in due to boundary conditions placed at by
[TABLE]
Lemma 5.4**.**
For each realization of the random field,
[TABLE]
Proof.
Important aspects of the inequality include the fact that the same distribution appears on both sides, namely on the left-hand side has the same distribution as each on the right-hand side, and the fact that the vector is independent of . The notation and are defined in Theorem 4.2. The inequality is obtained by contrasting lower and upper bounds for the surface tension , as we now demonstrate.
From the integral representation of Theorem 4.2, we see that
[TABLE]
The right-hand side is further developed using (4.3) by writing, for each realization of the external field,
[TABLE]
The main purpose of introducing the lasso event is to define boundary conditions in the annulus which decouple the disagreement set in from the disagreement set outside . The event entails the existence of a self-avoiding path in which goes around the annulus . The outermost such path is well-defined (in the sense of the associated curves in , and is measurable with respect to the spin configurations on and its exterior. For each realization of the external field, the domain Markov property and monotonicity of the extended Ising model imply that
[TABLE]
A complementary upper bound for the surface tension is obtained by applying Proposition 4.5. The disagreement percolation relevant to this context is the one induced by the product measure with . For a given , consider the set consisting of all where there is a path of disgarrement from a neighbor of to that stays within .
By definition, the number of disagreement vertices on is at most , and is non-anticipatory. Furthermore, any must have . To see this, note that the two values of must agree; since there must be a satisfying and , the two values of must be zero. Therefore, Proposition 4.5 implies that
[TABLE]
Averaging the obtained bound over implies that
[TABLE]
Lastly, recalling that covers , that for each and the notation from (5.5) we may extend the last inequality to
[TABLE]
where monotonicity of the model was again used. Putting the last inequality together with (5.7), (5.8), (5.9) and the fact that finishes the proof of Lemma 5.4. ∎
Next we deduce Lemma 5.3 from the inequality of Lemma 5.4.
Proof of Lemma 5.3.
As the first step we make a judicious choice of a quantile value which will serve as a reference point for estimating both the left- and right-hand sides of inequality (5.6). Define to be the normalized sum of the external field in the annulus ,
[TABLE]
Let be the -quantile value of given . That is,
[TABLE]
The definition remains the same regardless of the choice of as are independent and identically distributed and the variable depends on the external field only at . Lastly, let be the -quantile of , with a small positive number (defined by (5.26) and (5.35) below),
[TABLE]
To unravel the definitions, let
[TABLE]
and note that
[TABLE]
and
[TABLE]
In particular, by the union bound, the event satisfies
[TABLE]
It is further noted that as, at positive temperature, almost surely.
As the second step, we use the reference value and a suitably large positive parameter (defined by (5.35) below) to develop the inequality (5.6) to a form in which the lasso event is separated from the other terms:
[TABLE]
As the inequality holds for all , we may take its conditional expectation on the event and use the independence of and to obtain
[TABLE]
We can use (5.20) to simplify the right-most expectation above to
[TABLE]
Putting together the last inequalities and rearranging (recalling that ) shows that
[TABLE]
As the third step, a lower bound is provided for the expectation in (5.24), making use of the specific choice of . Start with the equality
[TABLE]
applying a translation by an arbitrary . Observe that and are standard Gaussian random variables with correlation coefficient
[TABLE]
which is between two positive absolute constants. The required lower bound for the expression (5.25) will be deduced from (5.19), which shows that for every ,
[TABLE]
where we have written for the conditional density of given , and where the fact that is independent of the external field outside is used. Two simple calculations involving the Gaussian density then show that
[TABLE]
and
[TABLE]
where here and below we use to denote positive absolute constants. The first calculation allows to develop (5.27) to
[TABLE]
The second calculation allows to integrate over in the last expression and obtain
[TABLE]
with standing for Lebesgue measure. Comparing with (5.25) we conclude that
[TABLE]
The final step is to choose the parameters and . Inequalities (5.24) and (5.32) show that
[TABLE]
For any real subset ,
[TABLE]
Thus, the fact that by (5.17) shows that taking
[TABLE]
with large suffices to ensure that
[TABLE]
thereby proving Lemma 5.3. ∎
5.3. Verification of the tortuosity condition
Proof of Lemma 5.2.
Given a rectangle and a vertex , let be the rotation of by radians around . Let be the set (an -image of the annulus ). We say that is a pivot point for if i) is contained in , and ii) crossing all four rectangles (as in the event ) implies the lasso event in the annulus (see Figure 3 for an illustration).
Letting
[TABLE]
rotation invariance, the union bound, and the definition of pivot points imply that
[TABLE]
where is the appropriate lasso event. By Lemma 5.3 and some algebraic manipulation, we deduce that, for some absolute ,
[TABLE]
To complete the proof, let be a well-separated set of rectangles, as in the statement of Lemma 5.2. Let be chosen so that is a pivot point for . By the conditions on and the triangle inequality, the set is made up of disjoint annuli. Therefore, the domain Markov property and monotonicity of the extended Ising model imply that
[TABLE]
as required. ∎
5.4. Quantified fractality bounds
Using a standard argument of percolation with finite-range dependence we next go beyond Lemma 5.1, extracting from it a quantified version of the statement.
Theorem 5.5**.**
Let be the event that the annulus is crossed by a path of disagreement percolation whose length does not exceed . Then there exist , absolute constants , and such that for
[TABLE]
Proof.
For , define . Set to the of Lemma 5.1. Define
[TABLE]
so that as by Lemma 5.1. Below we use the convention that stand for positive absolute constants.
For integer , consider the configuration sampled in the much larger annulus . To get the desired quantitative bound, we will create an auxiliary percolation process on a rescaled version of . This process will contain a crossing of an annulus whenever the original disagreement percolation contains a crossing of whose length is less than . We will then prove an upper bound on the probability of crossing the rescaled annulus.
To that end, let
[TABLE]
By construction, we have that
[TABLE]
We think of as a ‘coarse’ lattice, and endow it with a graph structure by saying that if and intersect along an edge (i.e. their intersection has two or more points). Viewed this way, shares a graph structure with an annulus in of side length and some fixed aspect ratio. In a slight abuse of notation, we will call refer to this annulus by as well. The construction ensures us that, if is a path in which crosses and is the set of vertices whose associated annuli are crossed by , then contains a crossing of the rescaled annulus .
Let be the event that contains a crossing of of length at most . We call the vertex ‘good’ if occurs; otherwise, we call it ‘bad’. Then the event implies that there must exist a crossing of for which at least half the vertices are good. Letting be this event, the union bound gives that
[TABLE]
where is summed over all possible crossing paths of the annulus , and is the set of good vertices in . The properties in (5.44) imply that, given any , there exists such that , and implies that – i.e. . Therefore, the domain Markov property and monotonicity imply that
[TABLE]
Noting that the shortest path crossing the annulus has length , (5.45) implies
[TABLE]
since there are at most paths of length , and at most ways to partition the set into good and bad vertices. If , this sum is bounded above by . Setting and for the minimal for which , the proof is complete. ∎
6. Exponential Decay
In this Section we prove Theorem 1.1. As the main step, we show that the order parameter decays faster than for all .
Proposition 6.1**.**
For all , , and ,
[TABLE]
A quantitative rate of decay for (6.1), which depends only on and is phrased in terms of the quantities resulting from the tortuosity theorem, is given in (6.48) below.
Theorem 1.1 follows from Proposition 6.1 by a standard percolation argument which was detailed in [3, Appendix A] for the zero-temperature case. The disagreement percolation representation allows its natural extension to positive temperatures, stated next. The proof is similar in spirit to the one used to prove Theorem 5.5.
Proposition 6.2**.**
For the RFIM on with the nearest-neighbor interaction, there is a finite constant (depending only on ) with which: if for some
[TABLE]
then for all
[TABLE]
with which do not depend on , , , and .
Proof.
By (3.4),
[TABLE]
Assume (without loss of generality) and let be such that covers , and each intersects at most others, for a suitable depending only on . Let be the event that (equivalently, ). The domain Markov property, monotonicity and a union bound show that if are such that are disjoint then
[TABLE]
with depending only on . Lastly, if then at least a constant times of the events occur, along a geometrically connected set of the . Picking sufficiently small as a function of , the result thus follows by standard arguments of percolation with finite-range dependence. ∎
The rest of the section is devoted to proving Proposition 6.1.
6.1. Concentration and anti-concentration of the number of disagreements
We first develop a priori bounds on the concentration properties of the number of disagreements. The ideas presented are adapted from corresponding ones in [3].
The following inequality is used to convert upper bounds on the surface tension to an anti-concentration bound for the number of disagreements.
Proposition 6.3**.**
For finite subgraphs ,
[TABLE]
where is the Gaussian distribution’s two sided tail (see Theorem 4.2 for the definition of ).
We omit the proof since it is essentially identical to that of [3, Proposition 3.4].
The above anti-concentration bound will be contrasted with a conditional concentration inequality, which holds whenever the fast power-law decay (6.1) of the order parameter is violated. The combination of the bounds results in a contradiction, which provides a proof for the fast decay (6.1).
The concentration inequality requires that the order parameter sequence exhibits stretches with somewhat regular behavior. This is provided by the following abstract lemma.
Lemma 6.4**.**
Let be a monotone non-increasing sequence satisfying . For each and integer there exists a non-negative integer in the range
[TABLE]
such that for all ,
[TABLE]
Proof.
The left inequality in (6.7) follows from the fact that is non-increasing. The right inequality is obtained by selecting to be the index at which is maximized. The lower bound in (6.6) is due to and the assumption that . ∎
The next proposition contains the conditional concentration inequality discussed above.
Proposition 6.5**.**
For each there exists such that the following holds. Let be finite subgraphs satisfying that for some ,
[TABLE]
Assume that for some ,
[TABLE]
Then
[TABLE]
The proposition will be applied once when and are concentric graph balls and once when they are concentric annuli.
Proof of Proposition 6.5.
Let be the indicator function of the event for . Proposition 3.1 shows that
[TABLE]
The first inequality in (6.10) thus follows from the Cauchy-Schwartz inequality and we focus on the second inequality. The assumption (6.8) and monotonicity imply that
[TABLE]
To bound the second moment, write
[TABLE]
and apply the following estimate, based on the domain Markov property and monotonicity, to each term:
[TABLE]
where is chosen so that the thermal expectations for and in (6.14) are taken in disjoint subregions of , and thus involve independent external fields.
Putting the last bounds together we conclude that
[TABLE]
where here and below we use to denote constants which may depend only on . The resulting terms may be estimated via the assumption (6.9) as
[TABLE]
and
[TABLE]
Plugging these bounds in (6.15) and using (6.8) shows that
[TABLE]
The result now follows by comparing with the lower bound (6.12). ∎
6.2. An upper bound on the surface tension
The tortuosity bounds of Theorem 5.5 can be used to construct non-anticipatory sets with relatively few points of disagreement, providing upper bounds on the surface tension via Proposition 4.5. These improve upon the bounds arising from deterministic sets by a power of the length scale (under the assumption 6.19).
Proposition 6.6**.**
Let and be the constants of Theorem 5.5. Let and let be an integer satisfying that
[TABLE]
Set . Then there exists a universal constant such that
[TABLE]
The proof is divided into several lemmas. Recall the notation from Section 4.2.
Lemma 6.7**.**
Let be finite subgraphs. Let be a sequence of non-anticipatory separating sets which is increasing in the sense that
[TABLE]
and with each satisfying the assumption (4.12) almost surely. Then for each ,
[TABLE]
where is the disagreement set (4.3) and is the event that for .
Proof.
Let be the smallest integer satisfying if such an integer exists (i.e., on the event ) and otherwise set . The increasing property of then implies that is also non-anticipatory. The result then follows from Proposition 4.5. ∎
We proceed to adapt the bound of the previous lemma to the setting of Proposition 6.6, which requires several definitions.
We work in the annulus for some . For brevity, we set
[TABLE]
Let be an integer. Set (which does not include but includes the midedges of the edges connecting and ). Define
[TABLE]
Write for the graph distance in the induced subgraph on . Let and define, for ,
[TABLE]
Lastly, let
[TABLE]
Lemma 6.8**.**
With the above definitions, for each ,
[TABLE]
with the event that for .
Proof.
We aim to apply Lemma 6.7 with , . The definitions imply that the are non-anticipatory separating sets satisfying (6.21). Moreover, each satisfies that one endpoint of is in while . The use of an odd distance in the definition of thus necessitates that , so that the satisfy the assumption (4.12) almost surely. Lemma 6.7 then shows that
[TABLE]
with the event that for . The event may be equivalently presented as in the statement of the lemma as our definitions imply that . In addition, the definitions and our choice of imply that . The lemma thus follows by averaging (6.28) over . ∎
We next discuss the ‘bad’ events appearing in Lemma 6.8. Let , and be the constants of Theorem 5.5. Define
[TABLE]
Lemma 6.9**.**
With the above definitions, for each .
Proof.
Fix . The definitions imply that the sets are subsets of the non-extended lattice , which may intersect only at . In particular,
[TABLE]
On the event , this estimate may be continued to
[TABLE]
where in the second inequality the fact that the satisfy (4.12) is used. If the event does not occur then for . Thus . ∎
A combination of the last two lemmas provides the estimate
[TABLE]
To further estimate the right-hand side we take the average over the external magnetic field and apply the Cauchy-Schwartz inequality and the union bound to get
[TABLE]
We apply the following bounds to the terms in the right-hand side above.
Lemma 6.10**.**
Suppose for an integer satisfying (6.19) and suppose that . Then, for absolute constants ,
[TABLE]
Proof.
To see (6.34) note that Proposition 6.5 shows that
[TABLE]
for an absolute constant . The bound (6.34) now follows by monotoncity of the disagreement percolation and the assumption (6.19).
The probability of the event is estimated using Theorem 5.5 and monotonicity. For the event , monotonicity and the assumption (6.19) may again be invoked to yield
[TABLE]
for absolute constants . Thus (6.36) follows from Markov’s inequality. ∎
Combining (6.32), (6.33) and the preceding lemma we arrive at
[TABLE]
Finally choosing finishes the proof of the proposition.
6.3. Proof of Proposition 6.1
Let and take their values from Theorem 5.5. Fix a constant throughout the proof. Suppose is an integer satisfying
[TABLE]
Applying Lemma 6.4 with in the role of , and we obtain the existence of an integer satisfying
[TABLE]
for which
[TABLE]
Set . Assuming that we may Apply Proposition 6.6 to obtain
[TABLE]
where we let stand for absolute constants. This bound is used in conjunction with Proposition 6.3 to deduce that
[TABLE]
Using also the monotonicity of disagreement percolation and (6.42) we find that
[TABLE]
noting that the right-hand side is very close to for large.
In contrast, Proposition 6.5 shows that
[TABLE]
This implies, via the one-sided Chebyshev inequality, that
[TABLE]
The bounds (6.45) and (6.47) are in contradiction for sufficiently large. The contradiction shows that our initial assumption (6.40) is false, thus concluding the proof of the proposition.
Since , we may track the dependence through (6.41) and deduce that
[TABLE]
7. Open Questions
The question discussed here remains open for systems of continuous spin variables, e.g. two-component spin models with rotation-invariant interaction. It is of particular interest with regards to random fields with rotationally-invariant distribution, in dimensions .
A remaining question for the random-field Ising model is the quantitative dependence of the correlation length on the disorder strength. There are actually a number of relevant length scales. One of these, which makes sense even in the absence of exponential decay, is the distance at which the order parameter drops below some fixed threshold. Another, which is finite only in the presence of exponential decay, is the inverse of the rate of that decay. The preceding works [12, 3] provide the upper bound
[TABLE]
at weak disorder. A heuristic upper bound of the same general form may be understood from the analysis of Imry and Ma [19] or from the Mandelbrot percolation picture of [3]. As stated, Theorem 1.1 does not provide quantitative bounds on the correlation length; however, its proof implies such bounds in terms of the quantities arising from the tortuosity result [1] (see Section 6). It is of interest to determine the general rate of growth of . As an alternative to the form appearing in (7.1), the behavior
[TABLE]
was discussed in [9].
Acknowledgements
We gratefully acknowledge the following support. The work of MA was supported in parts by the NSF grant DMS-1613296, and the Weston Visiting Professorship at the Weizmann Institute of Science. The work of MH and RP was supported in part by Israel Science Foundation grant 861/15 and the European Research Council starting grant 678520 (LocalOrder). MH was supported by the Zuckerman Postdoctoral Fellowship. We thank the Faculty of Mathematics and Computer Science and the Faculty of Physics at WIS for the hospitality enjoyed there during work on this project.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Michael Aizenman and Almut Burchard. “Hölder regularity and dimension bounds for random curves.” Duke Math. Journ. 99 , 419-453 (1999).
- 2[2] Michael Aizenman, Rafael L. Greenblatt, Joel L. Lebowitz. “Proof of Rounding by Quenched Disorder of First Order Transitions in Low-Dimensional Quantum Systems.” J. Math. Phys. 53 , 023301 (2012).
- 3[3] Michael Aizenman and Ron Peled. “A power-law upper bound on the correlations in the 2 D 2 𝐷 2D random field Ising model.” Preprint ar Xiv:1808.08351 (2018).
- 4[4] Michael Aizenman and Jan Wehr. “Rounding of first-order phase transitions in systems with quenched disorder.” Phys. Rev. Lett. 62 (1989): 2503.
- 5[5] Michael Aizenman and Jan Wehr. “Rounding effects of quenched randomness on first-order phase transitions.” Comm. Math. Phys. 130 , 489-528 (1990).
- 6[6] Jacob van den Berg. “A uniqueness condition for Gibbs measures, with application to the 2-dimensional Ising antiferromagnet”, Comm. Math. Phys. 152 , 161-166 (1993).
- 7[7] Alberto Berretti. “Some properties of random Ising models”. J. Stat. Phys. 38 , 483-496 (1985).
- 8[8] Jean Bricmont, and Antti Kupiainen . “Lower critical dimension for the random-field Ising model.” Physical review letters, 59(16), 1829–1832 (1987).
