Abstract
We prove multi-point correlation bounds in \(\mathbb {Z}^d\) for arbitrary \(d\ge 1\) with symmetrized distances, answering open questions proposed by Sims–Warzel (Commun Math Phys 347(3):903–931, 2016) and Aza–Bru–Siqueira Pedra (Commun Math Phys 360(2):715–726, 2018). As applications, we prove multi-point correlation bounds for the Ising model on \(\mathbb {Z}^d\), and multi-point dynamical localization in expectation for uniformly localized disordered systems, which provides the first examples of this conjectured phenomenon by Bravyi–König (Commun Math Phys 316(3):641–692, 2012) .
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Correlation functions arise from, among others, the study of quantum field theory and statistical mechanics, and are important measurements of the order of a system. More specifically, correlation functions quantify how microscopic variables co-vary with one another on average across space and time. For various systems, there have been intensive studies on the decay of the two-point correlation functions. The goal of this paper is to use the two-point decay as input to study the decay of multi-point correlation functions for systems in arbitrary dimension. For quasi-free states of a one-particle Hamiltonian, the time-dependent multi-point correlation function is the determinant of two-point functions. For generalized Gaussian fields, the multi-point function can be written in terms of two-point functions via Wick rule. One of our motivations comes from the Ising model on \(\mathbb Z^d\). Another motivation arises from the study of multi-point dynamical localization, which was proposed as a conjectured phenomenon in [14], and was used as an assumption to study the growth of quantum memory.
We first present the focus of the paper in its simplest form. Let \(X=\{x_1,x_2,...,x_n\}\subset \mathbb Z^{d}\) and \(Y=\{y_1,y_2,...,y_n\}\subset \mathbb Z^{d}\) be two sets of point configurations. Throughout this paper, we will assume both X and Y consist of distinct points. For two points \(x,y\in \mathbb Z^d\), let \(|x-y|\) denote the Euclidean distance between them. Let H be a self-adjoint operator on \(\ell ^2(\mathbb Z^d)\). One of the questions we consider, of its simplest form, can be formulated as: suppose we have the decay of the two point function of the following form:
for some constants \(C, \eta >0\), some bounded function \(\rho \) on \(\mathbb R\) and any \(1\le j,k\le n\). What can be said about the decay of the multi-point correlation function, expressed through the determinant of the following matrix M?
Such multi-point correlation functions have been studied in many papers, see e.g. [1, 11, 14, 42]. One of our goals of this paper is to study the decay of multi-point determinant in \(\mathbb Z^d\), and in particular provide answers to open questions proposed in [11, 42].
In the rest of this section we present our main results. The main applications to the Ising model and dynamical localization are presented in Sections 2 and 3. Before stating our results and related literature, we first introduce various distances between two sets of point configurations in \(\mathbb Z^d\).
Our first result, Theorem 1.1, concerns the following symmetrized maximal distance:
where \(S_n\) is the symmetric group.
Our second result, Theorem 1.2, concerns the symmetrized sum distance \(D_s(X,Y)\) defined as:
Another distance that we do not use in the present paper, but was used in the literature, is the Hausdorff distance:
where \(\textrm{dist}(w, V):=\min _{v\in V} |w-v|\) is the distance between a point w and a set V. This distance was used in [10, 11]. In particular [11] extends some results of [42] to higher dimensions, in the \(D_H\) distance setting.
It is clear that
Hence the two distances \(D_m\) and \(D_s\) that we consider in this paper are stronger than \(D_H\), see also some comments in [10].
For \(d=1\), Sims and Warzel [42] proved that \(|\det M|\), for M as in (1.1), decays with respect to the \(D_m\) distance in both the deterministic case (when each entry of M is a fixed scalar) and the disordered case (when each entry is a function and the result is in expectation). These results were further extended to arbitrary dimension, but with the weaker Hausdorff distance in [11]. The \(D_m\) and \(D_s\) distances remained a challenge in higher dimensions. Sims and Warzel’s proof [42], and also a recent proof of dynamical localization for multi-particle systems in \(d=1\) with respect to the \(D_s\) distance [15], both rely heavily on the fact that the points in \(\mathbb Z^1\) are ordered, which can not be generalized to higher dimensions. In higher dimensions, an additional difficulty lies in the complicated geometry involved. It was proposed as an open question in [11, 42] that whether there is a decay in arbitrary dimension with respect to the \(D_m\) distance and even the stronger \(D_s\) distance.
One of our main achievements in this paper is to give a positive answer to this question by developing new approaches in higher dimensions. Our first main result proves a higher dimensional version of Theorems 1.1 and 1.2 of [42] with respect to the \(D_m\) distance, in both deterministic and disordered cases, hence providing a direct answer to the open question mentioned above. We formulate Theorem 1.1 in the disordered case, but it clearly also holds in the deterministic case (when taking the \(m^{\omega }_{jk}(t)\) below to be constant in \(\omega \) and t). For a matrix \(M\in \mathbb C^{\ell \times m}\), the matrix norm \(\Vert M\Vert \) is defined as its operator norm from \(\ell ^2(\mathbb C^m)\) to \(\ell ^2(\mathbb C^{\ell })\).
Theorem 1.1
Let \((\Omega , \nu )\) be a probability measure space and \(\mathbb E\) be its expectation. Let \(K: [0,\infty )\rightarrow [0,\infty )\) be a non-negative valued function, and \(X=\{x_1,...,x_n\},Y=\{y_1,...,y_n\}\subset \mathbb Z^d\) be two sets of configurations.Suppose a matrix \(M^{\omega }(t)=(m_{jk}^{\omega }(t))_{1\le j,k\le n}\), with parameters \(\omega \in \Omega \) and \(t\in \mathbb R\),Footnote 1 is such that for each \(1\le j,k\le n\),
holds for some constants \(C,\mu >0\) that are independent of j, k, and furthermore its matrix norm satisfies \(\Vert M^{\omega }(t)\Vert \le 1\) for any \(\omega , t\). Then we have the following determinant bound:
Remark 1.1
An alternate and stronger estimate that involves the additional definition of cluster is presented in Theorem 4.1.
Our second main result concerns the \(D_s\) distance.
Theorem 1.2
Let \(X=\{x_1,...,x_n\}\subset \mathbb Z^d\) and \(Y=\{y_1,...,y_n\}\subset \mathbb Z^d\). Let \(M=(m_{jk})_{1\le j,k\le n}\) be a matrix such that for each \(1\le j,k\le n\),
holds for some constants \(C,\mu >0\) that are independent of j, k. Then we have
The estimate (1.4) of Theorem 1.2 clearly implies the bounds for both the determinant and the permanent \(\textrm{perm}(M)\) of the matrix M defined as
It would be interesting to see whether the result of Theorem 1.1 also holds for permanents, where a Hadamard type inequality for permanent was proved [16].
Although Theorem 1.2 is of deterministic nature, it can be applied to disordered systems as well, see Theorems 3.1 and 3.2. This deterministic result can also be directly applied to show multi-point exponential decay of correlations for thermal states of single-particle systems, where the exponential decay of the two-point function (1.3) follows from the analyticity of the thermal state in the positive temperature regime, and was proved for the zero temperature case by Aizenman and Graf in [7], see a detailed discussion of this application in Remark 2 after Theorem 1.1 in [42].
For Gaussian fields, the multi-point correlation function can be written in terms of two-point functions through the (bosonic) Wick rule. Our third main result aims at providing an exponential decay bound for multi-point correlation function for systems satisfying the Wick rule, which in particular applies to the Ising model on \(\mathbb Z^d\) with high temperatures, see Theorem 2.2.
For a set \(X=\{x_1,...,x_{2n}\}\) of 2n points configuration in \(\mathbb Z^d\), \(d\ge 1\), let \(\widehat{D}_s(X)\) be defined as follows:
One can also define similarly \(\widehat{D}_m(X)\) with \(\sum _{j=1}^n\) replaced with \(\max _{j=1}^n\).
Theorem 1.3
Let \(X=\{x_1,...,x_{2n}\}\subset \mathbb Z^d\) be a set of 2n points configuration in \(\mathbb Z^d\) with \(d\ge 1\). Let \(\{m_{jk}\}_{1\le j,k\le 2n}\) be such that for each \(1\le j,k\le 2n\),
for some constants \(C,\mu >0\) that are independent of j, k. Then we have
Remark 1.2
This theorem also applies to bound Pfaffians of matrices, see definition in (2.8), hence also applies to systems that obey the fermionic Wick rule. Besides the applications to the Ising model discussed in Sect. 2, this theorem in particular formulates a higher dimensional version of Theorem 1.3 of [42] by Sims and Warzel, and moreover it replaces the \(D_m\) distance in [42] with the stronger \(D_s\) distance defined in (1.5).
Next we comment on the proofs of Theorems 1.1, 1.2 and 1.3. In [42], using crucially the ordering of points in \(\mathbb Z^1\), the authors were able to rearrange the matrix M into a bordered matrix form, and prove a technical core theorem that concerns the smallness of determinants (with respect to the \(D_m\) distance) of such bordered matrices. In [11], for arbitrary dimension, the smallness of determinants (with respect to the Hausdorff distance \(D_H\)) is obtained from the smallness of an entire row or column, which is not true in general when replacing \(D_H\) with the stronger \(D_m\) or \(D_s\).
The major difficulty in proving Theorem 1.1 is the lack of effective ordering of points in higher dimensions. We overcome this difficulty by developing a new approach in Lemma 4.2, which proves the separation of a constructed cluster of X points from the Y points outside. Another difficulty is to develop a different technical lemma concerning the smallness of determinant that fits our construction. Our Theorems 1.2 and 1.3 concern the symmetrized distance \(D_s\), and are built on a completely new combinatorics argument that essentially counts the number of paths that contribute distance between \(2^k D_s\) and \(2^{k+1}D_s\) for any \(k\ge 0\).
The rest of the paper is organized as follows. In Sects. 2 and 3 we discuss the applications of our main results to the Ising model and the multi-point dynamical localization. We then prove Theorem 1.1 in Sect. 4, Theorem 1.2 in Sect. 5, and Theorem 1.3 in Sect. 6. Sections 7 and 8 are devoted to the proofs of Theorem 2.2 and Theorems 3.1, 3.2.
In the following, a constant is allowed to change its value from line to line. We will only keep track of its dependence on the parameters.
2 Application: Multi-point Correlation Bound for the Ising Model
One of the applications of our main theorems concerns the equilibrium states of the Ising model with ferromagnetic pair interactions. The ferromagnetic Ising model on a graph \(\Lambda \) is defined as
where \(\{\sigma _x=\pm 1\}_{x\in \Lambda }\) are the spin variables, h is the magnetic field and \(J_{x,y}\ge 0\).
States of the system are given by probability measures on the space of configurations at the inverse temperature \(\beta =1/T\ge 0\), being described by the Gibbs states. For a finite graph \(\Lambda \) the corresponding expectation value of functions of the spins are:
where \(\textrm{tr}_{\Lambda }\) denotes \(\prod _{x\in \Lambda } \frac{1}{2}\sum _{\sigma _x=\pm 1}\) and \(Z_{\Lambda }(\beta )=\textrm{tr}_{\Lambda } e^{-\beta H(\sigma )}\) is the partition function. For infinite systems, the Gibbs states are defined by the limits of finite approximations. For \(\Lambda =\mathbb Z^d\), we shall write \(\left\langle f\right\rangle _{\mathbb Z^d,\beta }\) as \(\left\langle f\right\rangle _{\beta }\) for simplicity.
The graphs that we consider in this paper are \(\mathbb Z^d\), \(d\ge 2\), and their finite approximants. We focus on the nearest neighbor Ising model, meaning \(J_{x,y}=\delta _1(|x-y|)\). For \(d\ge 2\), this model exhibits a line of first-order phase transitions for \(h=0\) and \(\beta \in (\beta _c,\infty )\), where \(\beta _c>0\) is referred as the inverse of the critical temperature. Since the phase transition occurs at zero magnetic field, we restrict the discussion to \(h=0\) and will omit h from the notation.
The correlation functions are defined through the following expectation values: for \(A\subset \Lambda \), let
It is known that the correlation functions \(\left\langle \sigma _A\right\rangle _{\Lambda ,\beta }\) are increasing as \(\Lambda \uparrow \mathbb Z^d\). The critical \(\beta _c\) is such that
The truncated two-point correlation function is defined by
Note that in the regime \(0\le \beta <\beta _c\), the truncated two-point function coincides with the (standard) two-point function defined in (2.6).
Exponential decay for the truncated two-point correlation function
for some constants \(C,\mu >0\), for the Ising model on \(\mathbb Z^d\) has been proved by Aizenman-Barsky-Fernández in [5] for \(\beta <\beta _c\), and Duminil-Copin, Goswami and Raoufi in [25] for \(\beta >\beta _c\). Our goal is to use the exponential decay of the two-point functions as inputs to bound the multi-point functions, which is made possible due to the following remarkable results.
In 1981, in his seminal work [2, 3] Aizenman proved that above the critical dimension \(d=4\), the scaling limit of the multi-point correlation function follows the Wick rule. The long standing problem about the critical dimension \(d=4\) was recently tacked by Aizenman and Duminil-Copin in 2020 [6]. More precisely, the above mentioned results are:
Theorem 2.1
[3, 6] For the nearest neighbor Ising model on \(\mathbb Z^d\) with \(d\ge 4\), let \(\delta >0\) be the scaling factor. If for some \(\kappa (\delta )\rightarrow \infty \) the scaled correlation function converges (pointwise for \(x_1,..,x_{2n}\in \mathbb R^d\)),
then the limiting function satisfies
In this paper, we study the multi-point correlation decay in the \(\beta <\beta _c\) case for \(d\ge 2\). The following bound is obtained as a corollary of Theorem 1.3, and relies crucially on the arguments in [3], see Sect. 7. Note that at \(\beta =\beta _c\), two-point functions follows a power-law decay [41], hence Theorem 1.3 does not apply.
Theorem 2.2
For the nearest neighbor ferromagnetic Ising model on \(\mathbb Z^d\) with \(d\ge 2\), for \(0\le \beta <\beta _c\), we have
where \(\mu \) is the constant in the two-point exponential decay (2.7), \(C_{d,\mu }>0\) is a constant and \(A\subset \mathbb Z^d\) is an arbitrary subset with \(|A|=2n\).
Our second application is the multi-point correlation bound for points along a boundary for planar graphs. In contrast to the Gaussian field structure of correlation function for points in the bulk of the lattice, the boundary correlation for 2D Ising model has a Pfaffian structure. This was proved for graphs with a regular transfer matrix by Schultz-Mattis-Lieb [40], and for any planar model by Groeneveld-Boel-Kasteleyn [30].
Theorem 2.3
[30] Fix a planar graph G, arbitrary nearest-neighbor couplings J, and \(\beta \ge 0\). Then, for any cyclically ordered 2n-tuple \((x_1,x_2,...,x_{2n})\) of sites located along the boundary of a fixed face of G, we have
Above, a planar graph is a graph embedded in the plane \(\mathbb R^2\) in such a way that its edges, depicted by bounded simple arcs, intersect only at their endpoints. The faces of the graph are the connected components of the plane minus the edges. And the Pfaffian of a skew-symmetric matrix M is defined by
As application of our Theorem 1.3, we obtain the following decay bound directly from the two-point decay (2.7).
Theorem 2.4
Let \(\Lambda \subset \mathbb Z^2\). Let \(X=(x_1,...,x_{2n})\) be a cyclically ordered 2n-tuple located along the boundary of a fixed face of \(\Lambda \). For \(0\le \beta <\beta _c\), let \(\mu >0\) be the constant in the exponential decay of the two-point correlation function in (2.7), we have that for some constant \(C_{d,\mu }>0\), the following holds
3 Application: Multi-point Dynamical Localization
Another main motivation of studying the decay of multi-point correlation function is to study the multi-point dynamical localization that was introduced by Bravyi and König in [14]. First, we introduce the notion of ergodic Schrödinger operators on \(\mathbb Z^d\).
Definition 1
Let \((\Omega , \nu )\) be a probability measure space and \(\mathbb E\) be its expectation. Let \(T_j\), \(j=1,...,d\), be a family of commuting ergodic maps on \(\Omega \) with respect to \(\nu \). Let \(\omega \rightarrow H_{\omega }\) be a strongly measurable map from \(\Omega \) to self-adjoint operators on \(\ell ^2(\mathbb Z^d)\). A family of self-adjoint operators \(H_{\omega }\) on \(\ell ^2(\mathbb Z^d)\) is called ergodic if for each \(x\in \mathbb Z^d\),
with \(U_x\phi (y)=\phi (y-x)\), where \(T^x:=T_1^{x_1}\cdots T_d^{x_d}\).
Next, we introduce the definitions of two-point and multi-point dynamical localization.
Definition 2
A one-particle Hamiltonian \(H_{\omega }\) on \(\ell ^2(\mathbb Z^d)\) is dubbed as (two-point) exponential dynamical localized in expectation (DLE) if there are constants \(C,\mu >0\) such that for all \(x,y\in \mathbb Z^d\), the following holds
DLE has been proved for a large class of operators, including the Anderson model with i.i.d. random potentials with absolutly continuous distributions in \(\mathbb Z^1\) [24, 38] and in \(\mathbb Z^d\) for \(d\ge 2\) [4, 8, 9], the unitary Anderson model [31], the almost Mathieu operator on \(\mathbb Z^1\) [34], random block operators [18, 26], an almost Mathieu type operator on \(\mathbb Z^d\) [27], and random word models [39]. If one replaces the exponential decay on the right-hand side of (3.9) with a power-law decay \(|x-y|^{-\mu }\) with \(\mu >0\), then the (power-law) DLE was proved for a larger class of operators including one dimensional Anderson model with singular supports [17, 22] and a one-dimensional long range almost Mathieu type operator [13].
If one takes
then clearly DLE in (3.9) verifies exactly the assumption (1.2) in Theorem 1.1. Thus, as our first application, Theorem 1.1 yields a multi-point dynamical localization type result in the following sense for all the (two-point) dynamical localized systems, with \(D_s\) distance replaced with the \(D_m\) distance.
Definition 3
A one-particle Hamiltonian \(H_{\omega }\) on \(\ell ^2(\{1,...,N\})\) is dubbed as multi-point dynamical localized (MPDL) in expectation, see [14], if there are constants \(C,\mu >0\) such that for all \(n\le N\) sufficiently large, the following holds
for all configurations X, Y with \(D_s(X,Y)\ge N/8\).
In [14], MPDL in expectation (MPDLE) was used as an assumption to study the growth of storage time of quantum memory. It was conjectured [14] that MPDLE holds in the regime of strong disorder, but there has been no rigorous proof for any model so far, see also [18]. It was also proposed as an open question in [42] that whether MPDLE always follows from DLE.
Another achievement of this paper is to prove the existence of MPDLE models as an application of our Theorem 1.2. We prove MPDLE (actually a stronger uniform localization result) for systems with uniformly localized eigenfunctions (see definition below) in Theorem 3.1. Hence we provide the first examples of such feature, and in particular verifies the assumptions made in [14] for these models.
Regarding the question whether MPDLE always follows from DLE: due to the nature of the sum distance involved in \(D_s\) (rather than the maximal distance in \(D_m\)), MPDLE seems to require the control of the expectation of each term in the determinant expansion, which will unlikely follow from the general DLE. But we are still able to prove an almost sure version of MPDL in Theorem 3.2, rather than MPDLE, for general DLE systems.
At last, we comment that under a much stronger condition than DLE, when assuming the expectation of each term in the determinant expansion is controlled as follows
for all \(\pi \in S_n\), MPDLE was proved (conditionally) in the \(d=1\) case in [14], see Lemma 3 therein. We can strengthen this conditional result to arbitrary dimension (the proof is the same as that for Theorem 1.2, so we omit it in this paper). However it is unclear if (3.10) is true for any model other than the ULE systems introduced below.
Next, we explain the applications of Theorem 1.2 mentioned above in details. We introduce the definition of operators with uniformly localized eigenfunctions.
Definition 4
We say a self-adjoint operator H on \(\ell ^2(\mathbb Z^d)\) has uniformly localized eigenfunctions (ULE) if H has a complete set \(\{\phi _k\}_{k=1}^{\infty }\) of orthonormal eigenfunctions, and there exists \(C, \mu >0\) and \(m_k\in \mathbb Z^d\) such that
holds for any \(k\in \mathbb N\) and \(m\in \mathbb Z^d\).
For ULE systems, we have
Theorem 3.1
If \(H_{\omega }\) is a family of ergodic operators with ULE for a positive measure set of \(\omega \), Namely, for positive measure set of \(\omega \), \(H_{\omega }\) has a complete set \(\{\phi _k^{\omega }\}_{k=1}^{\infty }\) of orthonormal eigenfunctions, and there exist \(C_{\omega }, \mu _{\omega }>0\) and \(m_k^{\omega }\in \mathbb Z^d\) such that
Then multi-point dynamical localization holds uniformly for \(H_{\omega }\) for any \(\omega \in \textrm{supp}(\nu )\). Namely, for some constants \(C,\mu >0\),
holds for any \(\omega \in \textrm{supp}(\nu )\) and arbitrary n-point configurations \(X,Y\subset \mathbb Z^d\).
Remark 3.1
Although it was pointed out in [23, 33] that ULE does not hold for the Anderson model or the almost Mathieu operator, as it leads to a violation of generic continuous spectrum. ULE has been proved for some limit-periodic operators [20, 21] and some quasi-periodic operators [12, 19, 29, 35, 36].
For general dynamical localized disordered systems, we have:
Theorem 3.2
Let \(H_{\omega }\) be a family of ergodic operators. Let \(I\subset \mathbb C\) and consider a family of operators \(\rho (s,t,H_{\omega })\) on \(\ell ^2(\mathbb Z^d)\) for \(s,t\in I\) that exhibit localization in the sense that for some constants \(C,\mu \in (0,\infty )\) and for all \(x,y\in \mathbb Z^d\), we have
Then for a.e. \(\omega \), any \(n\in \mathbb N\), and any pair of configurations \(X=\{x_1,...,x_n\}\subset \mathbb Z^d\), \(Y=\{y_1,...,y_n\}\subset \mathbb Z^{d}\), we have that
where without loss of generality we have assumed \(\prod _{j=1}^n (1+|x_j|)\le \prod _{j=1}^n (1+|y_j|)\).
The factor involving \(|x_j|\)’s emerges when we convert the averaged assumption (3.11) into a deterministic assumption of the form (1.3). Assuming \(|x_j|\le N\) for all j, we have
which is effective when \(D_s\gtrsim _{\omega ,d,\mu } n\log N\).
When \(\rho (s,t,H_{\omega })=e^{-itH_{\omega }}\), (3.11) is the same as DLE.
4 Proof of Theorem 1.1
Throughout this section we shall denote \(D_m(X,Y)\) by D for simplicity. The idea to overcome the lack of effective ordering in higher dimensions is to prove that there is a cluster of points that is gapped from the points outside. We prove this by utilizing a notation of minimal permutation (see Definition 5 below) and a novel construction that violates such minimality if the cluster is not gapped from its complement.
For a permutation \(\pi \), let \(D_{\pi }:=\max _{j=1}^n |x_j-y_{\pi (j)}|\). For a given minimal \(\pi \) in the sense that \(D_{\pi }=D\), let \(\mathcal {N}(\pi )\) be the number of j’s such that \(|x_j-y_{\pi (j)}|=D\). Namely \(\mathcal {N}(\pi )\) counts the number of times when the maximal value D is attained in a permutation \(\pi \).
Definition 5
We say \(\pi _0\) is a minimal permutation if \(D_{\pi _0}=D_m(X,Y)\) and \(\pi _0\) also minimizes \(\mathcal {N}(\pi )\). Namely, for any arbitrary \(\pi \) such that \(D_{\pi }=D_m(X,Y)\), we always have \(\mathcal {N}(\pi _0)\le \mathcal {N}(\pi )\).
For such a \(\pi _0\), let \(j_0\in \{1,...,N\}\) be such that
Note that there may be multiple choices for \(\pi _0\) (and \(j_0\)), in which case we simply choose one of them.
We define a cluster \(\mathcal {C}\) of points, which is a subset of \(\{(x_j, y_{\pi _0(j)})\}_{j=1}^n\), as follows:
Definition 6
We say \((x_z,y_{\pi _0(z)})\in \mathcal {C}\) if and only if \(|x_{j_0}-y_{\pi _0(z)}|<D\) or there exists a chain of distinct points \(\{(x_{a_k},y_{\pi _0(a_k)})\}_{k=1}^m\) (with \(m\ge 1\)) such that \(j_0, z\notin \{a_1,...,a_k\}\) and \(|x_{j_0}-y_{\pi _0(a_1)}|<D\), \(|x_{a_m}-y_{\pi _0(z)}|<D\) and \(|x_{a_k}-y_{\pi (a_{k+1})}|<D\) for any \(1\le k\le m-1\).
Remark 4.1
Note that \(\mathcal {C}\) could be empty, in which case \(\mathcal {R}_A=\mathcal {R}_C=\emptyset \) as defined in (4.19), and \(M^{\omega }(t)\) will be rearranged (see (4.20)) into the form of
The following proof also applies to this special case, in particular Lemma 4.3 applies to the above matrix with \(p=n\), \(\ell =1\) and \(m=0\).
As mentioned in the introduction, the following is a stronger version of Theorem 1.1.
Theorem 4.1
Under the same conditions as Theorem 1.1, we have
where \(\mathcal {C}\) is a cluster of points defined as in Definition 6, and \(\pi _0\) is a minimal permutation as in Definition 5 and \(j_0\) is defined in (4.12).
In the following, we prove this stronger formulation and obtain Theorem 1.1 as a corollary at the end of this section.
The following lemma is the key.
Lemma 4.2
We have \((x_{j_0}, y_{\pi _0(j_0)})\notin \mathcal {C}\). Also for any \((x_w, y_{\pi _0(w)})\notin \mathcal {C}\) and any \((x_z, y_{\pi _0(z)})\in \mathcal {C}\) (if \(\mathcal {C}\) is non-empty), we have
Proof
The claim (4.13) is a direct consequence of the definition of \(\mathcal {C}\). We now prove that \((x_{j_0}, y_{\pi _0(j_0)})\notin \mathcal {C}\). Suppose otherwise, by the definition of \(\mathcal {C}\), there exists a chain of points \(\{(x_{a_k},y_{\pi _0(a_k)})\}_{k=1}^m\) such that:
In this case, we can define a permutation \(\pi _1\) such that
Clearly by (4.14), we have
and when \(D_{\pi _1}=D\), we must have \(\mathcal {N}_{\pi _1}<\mathcal {N}_{\pi _0}\). This violates the minimality of \(\pi _0\), hence leads to a contradiction. This proves the claimed result. \(\square \)
We also need the following, which plays the same role as the technical core Theorem 3.1 in [42].
Lemma 4.3
Let \(M\in \mathbb C^{p\times p}\) be a block matrix, satisfying \(\Vert M\Vert \le 1\), and is of the following form:
where \(A\in \mathbb C^{\ell \times m}\) with \(m<\ell \). Then
Proof
Since \(m<\ell \), there exists a normalized vector \(\psi _1\in \mathbb C^{\ell }\) such that
Picking another \(m-1\) normalized vectors \(\{\psi _2,...,\psi _{\ell }\}\subset \mathbb C^{\ell }\) such that \(\{\psi _1,...,\psi _{\ell }\}\) forms an orthonormal set. Let \(U=(\psi _1, \psi _2,..., \psi _{\ell })\in \mathbb C^{\ell \times \ell }\), then U is a unitary matrix.
Let R be a block matrix defined as
We have
and
By Hadamard’s inequality, we have
where \(\{v_1,...,v_p\}\) are the rows of \(\tilde{M}\) and we used that \(\Vert v_j\Vert \le \Vert \tilde{M}\Vert \le 1\) for \(2\le j\le p\). Note that the first row of \(U^T A=\psi _1^T A=0\) by (4.16). Hence
Combining (4.17) with (4.18), we have proved Lemma 4.3. \(\square \)
Now we are ready to combine Lemmas 4.2 and 4.3 to complete the proof of Theorem 1.1. Let
By switching rows and columns we arrange the elements of \(M^{\omega }(t)=(m_{j\, \pi _0(k)}^{\omega }(t))\) into the form in (4.15), where
Clearly \(A\in \mathbb C^{(m+1)\times m}\), where \(m=|\mathcal {C}|\). Hence by Lemma 4.3, we have
For a matrix B, let \(\Vert B\Vert _F\) be the Frobenius norm. Using the two-point assumption (1.2) and convexity, we have
This proves Theorem 4.1 by revoking the definition of \(\mathcal {R}_B\).
Noting that for each \(|x_j-y_{\pi _0(k)}|\) on the right-hand side of (4.21), we have by Lemma 4.2 that
5 Proof of Theorem 1.2
It suffices to prove the following lemma.
Lemma 5.1
For some constant \(C_{d,\mu }>0\), there holds
Throughout this section, we denote \(D_s(X,Y)\) by D for simplicity. In this section, for arbitrary two points \(x,y\in \mathbb Z^d\), we denote \(|x-y|_{\infty }:=\max _{j=1}^d |x_j-y_j|\). We introduce \(\tilde{D}_s(X,Y)\) similar to \(D_s(X,Y)\) but with the Euclidean norms replaced with the sup norms:
Throughout this section we shall denote \(\tilde{D}_s(X,Y)\) by \(\tilde{D}\) for simplicity. Clearly, we have
The reason we introduce \(\tilde{D}\) is that it only takes integer value for \(X,Y\subset \mathbb Z^d\), which plays a crucial role in our counting argument in Lemma 5.2.
Let \(B_{d,\mu }\ge 1\) be the smallest number such that
Let \(\pi _0\) be a permutation such that
In case of there are multiple \(\pi _0\) that attains the minimum value \(\tilde{D}\), we will simply choose one of them. The following counting lemma is the key to the proof of the determinant bound.
Lemma 5.2
For any integer \(\ell \ge \tilde{D}\), let \(\mathcal {M}_{\ell }\) be
Then we have the following estimate on the cardinality of \(M_{\ell }\).
Proof
For \(\ell \in \mathbb N\), let
We have, by Stirling’s formula
For each \(r\in \mathcal {S}_{\ell }\), let
Note that there exists at most \(2d\cdot (2r_j+1)^{d-1}\) many integer point z’s in \(\mathbb Z^d\) such that
Hence there are at most \(2d\cdot (2r_j+1)^{d-1}\) many possible values for \(\pi (j)\) such that
Thus for each \(r\in \mathcal {S}_{\ell }\), we bound the geometric mean of \(2r_j+1\) by the arithmetic mean and obtain that
Combining (5.24) with (5.25), we have
This proves the lemma. \(\square \)
Now we are in the position to prove Theorem 1.2. We have by Lemma 5.2,
Let \(B_{d,\mu }\) be defined as in (5.23). Next we distinguish two cases:
Case 1. If \(\tilde{D}<B_{d,\mu }n\). We split the sum in (5.26) into
and
To estimate \(\sum _1\), we bound \(\ell \) by \(B_{d,\mu }n\), which yields
Next, we estimate \(\sum _2\). Since \(\ell \ge B_{d,\mu }n\ge n\), we have by (5.23),
Hence
Case 2. If \(\tilde{D}\ge B_{d,\mu }n\). Since \(\ell \ge \tilde{D}\ge B_{d,\mu }n\ge n\), we can argue as in (5.28) to bound the sum in (5.26) as follows
Combining (5.26) with (5.27), (5.29), (5.30) and (5.22), we have proved Theorem 1.2. \(\square \)
6 Proof of Theorem 1.3
Throughout this section, we denote \(\{1,2,...,2n\}=:[2n]\). It is easy to see that \(\widehat{D}_s(X)\) has the following alternate representation in terms of the \(D_s\) distance that we introduced earlier:
Let
This set can be decomposed as a disjoint union as follows:
where
Let \(Y_B\subset X\) be such that
Next we estimate
By Lemma 5.1 and (6.31), we have
Hence combining (6.33) with (6.34), and using the Stirling’s formula, we have
which proves Theorem 1.3. \(\square \)
7 Proof of Theorem 2.2: Multi-point Correlation Bound for the Ising Model
For simplicity, in this section we shall write \(\left\langle \cdot \right\rangle _{\beta }\) as \(\left\langle \cdot \right\rangle \). The truncated (four-point) correlation function \(U_4\) is the following:
Proposition 5.3 in [3] provides a tree diagram bound for \(U_4\) as follows.
Proposition 7.1
[3] In a ferromagnetic system, for any four points, we have
As an easy corollary we have
For any 2n points, let
where \(\mathcal {A}_{2n}\) is defined in (6.32). Proposition 12.1 in [3] provides an error estimateFootnote 2 as follows.
Proposition 7.2
[3] In a ferromagnetic Ising system,
where \(\check{}\) indicates an omitted site.
By our Theorem 1.3, with \(m_{jk}:=\left\langle \sigma _{x_j} \sigma _{x_k} \right\rangle \), we have
and
Combining (7.37) with (7.35) we have
Theorem 2.2 then follows from combining (7.36) with (7.38). \(\square \)
8 Proof of Multi-point Dynamical Localization
8.1 Proof of Theorem 3.1
The following notion of homegeneous ULE was introduced in [32].
Definition 7
\(H_{\omega }\) has homogeneous ULE in a set S means that \(H_{\omega }\) has ULE for any \(\omega \in S\) and
for some constants \(C,\mu >0\) independent of \(\omega \).
The following theorem was proved in [32]:
Theorem 8.1
If \(H_{\omega }\) has ULE for \(\omega \) in a positive measure set, then \(H_{\omega }\) has homogeneous ULE in \(\textrm{supp}(\nu )\). Also if T is minimal, and \(U_{\omega }\) has ULE at a single \(\omega \), then \(H_{\omega }\) has homogeneous ULE in \(\Omega \).
For homogeneous ULE \(H_{\omega }\), a direct computation as in [23] shows that
holds for some \(\omega \) independent parameter \(0<\mu '<\mu \) and any \(\omega \in \textrm{supp}(\nu )\). This provides the point-wise assumption (1.3) that is required in Theorem 1.2. Therefore, we have
for any \(\omega \in \textrm{supp}(\nu )\), and some \(\omega \)-independent \(C_{\mu ',d}, \mu '>0\) and any configurations \(X,Y\subset \mathbb Z^d\).
8.2 Proof of Theorem 3.2
First, in order to apply our Theorem 1.2, we need to convert the two-point dynamical localization in expectation assumption (3.11) into a pointwise condition (see (8.39) below). This reduction goes back to Theorem 7.6 of [23]. We include it here for completeness. Let
By (3.11), we have
which implies \(Q(\omega )<\infty \) for a.e. \(\omega \). Hence for a.e. \(\omega \), there exists \(C_{\omega }>0\) such that
which implies for any \(x,y\in \mathbb Z^d\),
Theorem 1.2 yields that
as claimed. \(\square \)
Notes
In applications t will be the time variable.
[3] provides both upper and lower bounds, but we only need the upper bound here.
References
Abdul-Rahman, H., Nachtergaele, B., Sims, R., Stolz, G.: Localization properties of the disordered XY spin chain: a review of mathematical results with an eye toward many-body localization. Annalen der Physik 529(7), 1600280 (2017)
Aizenman, M.: Proof of the triviality of \(\phi _d^4\) field theory and some mean-field features of Ising models for \(d >4\). Phys. Rev. Lett. 47(1), 1 (1981)
Aizenman, M.: Geometric analysis of \(\phi ^4\) fields and Ising models. Parts I and II. Commun. Math. Phys. 86(1), 1–48 (1982)
Aizenman, M.: Localization at weak disorder: some elementary bounds. In: The State of Matter: A Volume Dedicated to EH Lieb, pp. 367–395 (1994)
Aizenman, M., Barsky, D.J., Fernández, R.: The phase transition in a general class of Ising-type models is sharp. J. Stat. Phys. 47(3), 343–374 (1987)
Aizenman, M., Duminil-Copin, H.: Marginal triviality of the scaling limits of critical 4D Ising and \(\phi _4^4\) models. Ann. Math. 194(1), 163–235 (2021)
Aizenman, M., Graf, G.M.: Localization bounds for an electron gas. J. Phys. A Math. Gen. 31(32), 6783 (1998)
Aizenman, M., Molchanov, S.: Localization at large disorder and at extreme energies: an elementary derivations. Commun. Math. Phys. 157(2), 245–278 (1993)
Aizenman, M., Schenker, J.H., Friedrich, R.M., Hundertmark, D.: Finite-volume fractional-moment criteria for Anderson localization. Commun. Math. Phys. 224(1), 219–253 (2001)
Aizenman, M., Warzel, S.: Localization bounds for multiparticle systems. Commun. Math. Phys. 290(3), 903–934 (2009)
Aza, N.J.B., Bru, J.B., de Siqueira Pedra, W.: Decay of complex-time determinantal and Pfaffian correlation functionals in lattices. Commun. Math. Phys. 360(2), 715–726 (2018)
Bellissard, J., Lima, R., Scoppola, E.: Localization inv-dimensional incommensurate structures. Commun. Math. Phys. 88(4), 465–477 (1983)
Bourgain, J., Jitomirskaya, S.: Absolutely continuous spectrum for 1D quasiperiodic operators. Invent. Math. 148(3), 453–463 (2002)
Bravyi, S., König, R.: Disorder-assisted error correction in Majorana chains. Commun. Math. Phys. 316(3), 641–692 (2012)
Bringmann, B., Mendelson, D.: An eigensystem approach to Anderson localization for multi-particle systems. In: Annales Henri Poincaré, vol. 22, No. 10, pp. 3255–3290. Springer (2021)
Carlen, E., Lieb, E.H., Loss, M.: An inequality of Hadamard type for permanents. Methods Appl. Anal. 13(1), 1–18 (2006)
Carmona, R., Klein, A., Martinelli, F.: Anderson localization for Bernoulli and other singular potentials. Commun. Math. Phys. 108(1), 41–66 (1987)
Chapman, J., Stolz, G.: Localization for random block operators related to the XY spin chain. In: Annales Henri Poincaré, vol. 16, No. 2, pp. 405–435. Springer, Basel (2015)
Chulaevsky, V.: Uniform Anderson localization, unimodal eigenstates and simple spectra in a class of Haarsh deterministic potentials. J. Funct. Anal. 267(11), 4280–4320 (2014)
Damanik, D., Gan, Z.: Limit-periodic Schrödinger operators with uniformly localized eigenfunctions. Journal d’Analyse Mathématique 115(1), 33–49 (2011)
Damanik, D., Gan, Z.: Limit-periodic Schrödinger operators on Zd: uniform localization. J. Funct. Anal. 265(3), 435–448 (2013)
Damanik, D., Stollmann, P.: Multi-scale analysis implies strong dynamical localization. Geom. Funct. Anal. GAFA 11(1), 11–29 (2001)
del Rio, R., Jitomirskaya, S., Last, Y., Simon, B.: Operators with singular continuous spectrum, IV. Hausdorff dimensions, rank one perturbations, and localization. J. Anal. Math. 69(1), 153–200 (1996)
Delyon, F., Kunz, H., Souillard, B.: One-dimensional wave equations in disordered media. J. Phys. A Math. Gen. 16(1), 25 (1983)
Duminil-Copin, H., Goswami, S., Raoufi, A.: Exponential decay of truncated correlations for the Ising model in any dimension for all but the critical temperature. Commun. Math. Phys. 374(2), 891–921 (2020)
Elgart, A., Shamis, M., Sodin, S.: Localisation for non-monotone Schrödinger operators. J. Eur. Math. Soc. 16(5), 909–924 (2014)
Ge, L., You, J., Zhou, Q.: Exponential dynamical localization: criterion and applications (2019). arXiv preprint. arXiv:1901.04258
Germinet, F., Klein, A.: Bootstrap multiscale analysis and localization in random media. Commun. Math. Phys. 222(2), 415–448 (2001)
Grempel, D.R., Fishman, S., Prange, R.E.: Localization in an incommensurate potential: an exactly solvable model. Phys. Rev. Lett. 49(11), 833 (1982)
Groeneveld, J., Boel, R.J., Kasteleyn, P.W.: Correlation-function identities for general planar Ising systems. Physica A 93(1–2), 138–154 (1978)
Hamza, E., Joye, A., Stolz, G.: Dynamical localization for unitary Anderson models. Math. Phys. Anal. Geom. 12(4), 381–444 (2009)
Han, R.: Uniform localization is always uniform. Proc. Am. Math. Soc. 144(2), 609–612 (2016)
Jitomirskaya, S.Y.: Continuous spectrum and uniform localization for ergodic Schrödinger operators. J. Funct. Anal. 145(2), 312–322 (1997)
Jitomirskaya, S., Krüger, H.: Exponential dynamical localization for the almost Mathieu operator. Commun. Math. Phys. 322(3), 877–882 (2013)
Jitomirskaya, S., Kachkovskiy, I.: All couplings localization for quasiperiodic operators with monotone potentials. J. Eur. Math. Soc. 21(3), 777–795 (2018)
Kachkovskiy, I.: Localization for quasiperiodic operators with unbounded monotone potentials. J. Funct. Anal. 277(10), 3467–3490 (2019)
Klein, A., Germinet, F.: A comprehensive proof of localization for continuous Anderson models with singular random potentials. J. Eur. Math. Soc. 15(1), 53–143 (2012)
Kunz, H., Souillard, B.: Sur le spectre des opérateurs aux différences finies aléatoires. Commun. Math. Phys. 78(2), 201–246 (1980)
Rangamani, N.: Exponential dynamical localization for random word models. In: Annales Henri Poincaré, pp. 1–23. Springer (2022)
Schultz, T.D., Mattis, D.C., Lieb, E.H.: Two-dimensional Ising model as a soluble problem of many fermions. Rev. Mod. Phys. 36(3), 856 (1964)
Simon, B.: Correlation inequalities and the decay of correlations in ferromagnets. Commun. Math. Phys. 77(2), 111–126 (1980)
Sims, R., Warzel, S.: Decay of determinantal and Pfaffian correlation functionals in one-dimensional lattices. Commun. Math. Phys. 347(3), 903–931 (2016)
Acknowledgements
R. H. is partially supported by NSF-DMS-2053285 and NSF-DMS-2143369. F. Y. is partially supported by an AMS-Simons Travel Grant. We would like to thank Michael Loss, Robert Sims and Simone Warzel and the anonymous referees for helpful comments, and Michael Loss for pointing out that an earlier version of our Theorem 1.2 also holds for permanents of matrices.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by R. Seiringer.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Han, R., Yang, F. Decay of Multi-point Correlation Functions in \(\mathbb {Z}^d\). Commun. Math. Phys. 405, 45 (2024). https://doi.org/10.1007/s00220-023-04884-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00220-023-04884-6