Clustering bound for truncated correlations in unbounded spin systems

From papers

Let ψ\psi^{\sharp} denote either spin field, let \lambdaup>0\lambdaup>0 be sufficiently small, and let \LambdaupZd\Lambdaup\subset\mathbb{Z}^d be a finite volume. For even n2n\geq 2, write ψ1(0),ψ2(x2),,ψn(xn)\Lambdaup,\lambdaupT\langle\psi^{\sharp_1}(\mathbf{0}),\psi^{\sharp_2}(\mathbf{x}_2),\ldots,\psi^{\sharp_n}(\mathbf{x}_n)\rangle_{\Lambdaup,\lambdaup}^{\mathrm{T}} for the truncated nn-point correlation, with each i\sharp_i an arbitrary assignment of the available sharp symbols. Clustering bound conjecture. There exists a constant c(J)>0c(J)>0 such that, for \lambdaup>0\lambdaup>0 small enough, every even integer n2n\geq 2, every finite volume \LambdaupZd\Lambdaup\subset\mathbb{Z}^d, and every assignment of the \sharp symbols satisfy

x2,,xn\Lambdaupψ1(0),ψ2(x2),,ψn(xn)\Lambdaup,\lambdaupTc(J)n\lambdaupn21n!.\sum_{\mathbf{x}_2,\ldots,\mathbf{x}_n\in\Lambdaup}\left|\langle\psi^{\sharp_1}(\mathbf{0}),\psi^{\sharp_2}(\mathbf{x}_2),\ldots,\psi^{\sharp_n}(\mathbf{x}_n)\rangle_{\Lambdaup,\lambdaup}^{\mathrm{T}}\right|\leq c(J)^n\lambdaup^{\frac{n}{2}-1}n!.

This conjecture would provide a uniform l1l^1-clustering estimate with factorial growth in the number of fields, extending the tree-level bound to the full truncated correlations. The supplied text does not state whether the conjecture has been proved or disproved.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Abdelmalek Abdesselam, Aldo Procacci and Benedetto Scoppola, “Clustering Bounds on N-Point Correlations for Unbounded Spin Systems”, arXiv:0901.4756 (2009).

Solutions 0

No solutions have been posted yet.