Skip to content

A connected correlation function removes every contribution that factorizes into lower-order expectation values. At second order and in a fixed operator order,

⟨AB⟩c=⟨AB⟩−⟨A⟩⟨B⟩.\left\langle AB \right\rangle_c = \left\langle AB \right\rangle - \left\langle A\right\rangle \left\langle B\right\rangle.

Equivalently, with centered operators

δA=A−⟨A⟩I,δB=B−⟨B⟩I,\delta A = A-\langle A\rangle I, \qquad \delta B = B-\langle B\rangle I,

one has

⟨AB⟩c=⟨δA δB⟩.\left\langle AB \right\rangle_c = \left\langle \delta A\,\delta B \right\rangle.

The subtraction isolates joint fluctuations not explained by the one-point profiles. Spatially, it is the object that clusters in a pure short-range-correlated phase. Combinatorially, its higher-order generalizations are cumulants. Diagrammatically, connected pieces are selected by the logarithm of a generating functional.

Connected does not mean symmetrized, entangled, interacting, irreducible, amputated, or causal. Each of those words performs a different operation.

Helpful background. Equal-Time Correlations introduces spin, density, and coherence channels; Correlations and Covariance explains why ordered and symmetrized products differ.

We use ⟨X⟩=Tr⁡(ρX)\langle X\rangle=\operatorname{Tr}(\rho X) and assume the moments exist. The first formulas below use ordinary cumulants of commuting variables or ordered bosonic observables. Bare fermionic fields instead require graded cumulants with the corresponding permutation signs. A finite lattice has LL sites and linear size ℓ\ell; separation means distance between operator supports.

Subtracting lower moments does not permit reordering operators. In particular, ⟨AB⟩c\langle AB\rangle_c and ⟨BA⟩c\langle BA\rangle_c can differ.

For insertions labeled by position, time, component, or mode,

GABc(1,2)=⟨A(1)B(2)⟩c=⟨A(1)B(2)⟩−⟨A(1)⟩⟨B(2)⟩.\begin{aligned} G_{AB}^c(1,2) &= \left\langle A(1)B(2) \right\rangle_c \\ &= \left\langle A(1)B(2) \right\rangle - \left\langle A(1) \right\rangle \left\langle B(2) \right\rangle. \end{aligned}

The disconnected product is what this particular second moment would contain if the two insertions factorized:

GABdisc(1,2)=⟨A(1)⟩⟨B(2)⟩.G_{AB}^{\mathrm{disc}}(1,2) = \left\langle A(1)\right\rangle \left\langle B(2)\right\rangle.

Thus

GAB=GABdisc+GABc.G_{AB} = G_{AB}^{\mathrm{disc}} + G_{AB}^c.

This is an algebraic identity, not an approximation.

For Hermitian AA and BB,

⟨AB⟩c∗=⟨BA⟩c.\left\langle AB \right\rangle_c^* = \left\langle BA \right\rangle_c.

An ordered connected correlator may be complex. Its symmetrized real part is

Cov⁡(A,B)=12⟨δA δB+δB δA⟩.\operatorname{Cov}(A,B) = \frac{1}{2} \left\langle \delta A\,\delta B + \delta B\,\delta A \right\rangle.

Connected subtraction changes means; symmetrization changes order. Correlations and Covariance explains the latter as a measurement statistic.

For the ordinary cumulant convention, at third order,

⟨ABC⟩c=⟨ABC⟩−⟨A⟩⟨BC⟩−⟨B⟩⟨AC⟩−⟨C⟩⟨AB⟩+2⟨A⟩⟨B⟩⟨C⟩.\langle ABC\rangle_c ={} \langle ABC\rangle - \langle A\rangle\langle BC\rangle - \langle B\rangle\langle AC\rangle - \langle C\rangle\langle AB\rangle + 2 \langle A\rangle \langle B\rangle \langle C\rangle.

The operator order inside each moment is inherited from the declared prescription. For example, ⟨AC⟩\langle AC\rangle retains AA before CC.

If every one-point function vanishes, the fourth connected function is

⟨ABCD⟩c=⟨ABCD⟩−⟨AB⟩⟨CD⟩−⟨AC⟩⟨BD⟩−⟨AD⟩⟨BC⟩.\langle ABCD\rangle_c ={} \langle ABCD\rangle - \langle AB\rangle \langle CD\rangle - \langle AC\rangle \langle BD\rangle - \langle AD\rangle \langle BC\rangle.

For nonzero means, additional partitions containing singleton blocks must be included.

Let Πn\Pi_n be the set of partitions of {1,…,n}\{1,\ldots,n\}. For a specified source and ordering convention,

⟨X1⋯Xn⟩c=∑π∈Πn(∣π∣−1)!(−1)∣π∣−1×∏B∈π⟨∏i∈BordXi⟩.\left\langle X_1\cdots X_n \right\rangle_c ={} \sum_{\pi\in\Pi_n} \left( \lvert\pi\rvert-1 \right)! (-1)^{\lvert\pi\rvert-1} \times \prod_{B\in\pi} \left\langle \prod_{i\in B}^{\mathrm{ord}} X_i \right\rangle.

The inner product follows the inherited order within the block. The outer factors are ordinary complex numbers and commute. For fermionic fields, contour-ordered objects, or generalized operator exponentials, signs and source types must follow the chosen generating convention rather than being guessed from the classical formula.

For commuting scalar sources JaJ_a and a declared ordered exponential, define

Z[J]=⟨Oexp⁡ ⁣(∑aJaXa)⟩,Z[J] = \left\langle \mathcal O \exp\!\left( \sum_a J_a X_a \right) \right\rangle,

where O\mathcal O denotes the ordering prescription. Normalize so that

Z[0]=1.Z[0] = 1.

The cumulant-generating functional is

W[J]=log⁡Z[J].W[J] = \log Z[J].

Then

∂nW∂Ja1⋯∂Jan∣J=0=⟨Xa1⋯Xan⟩c\left. \frac{\partial^n W}{ \partial J_{a_1}\cdots\partial J_{a_n} } \right|_{J=0} = \left\langle X_{a_1}\cdots X_{a_n} \right\rangle_c

with the ordering and any convention-dependent factors fixed by the definition of ZZ.

The logarithm removes products of independent pieces because

ZA∪B=ZAZBZ_{A\cup B} = Z_A Z_B

for factorized sectors, while

log⁡ZA∪B=log⁡ZA+log⁡ZB.\log Z_{A\cup B} = \log Z_A + \log Z_B.

Mixed derivatives between independent sectors therefore vanish.

Connected is not the same as one-particle irreducible. A connected function may still separate after cutting one internal line. Legendre transformation, amputation, and one-particle irreducibility are later operations.

For observables linear in the canonical fields of a Gaussian state, with a specified ordering prescription, all connected cumulants above second order vanish:

⟨X1⋯Xn⟩c=0,n>2.\left\langle X_1\cdots X_n \right\rangle_c = 0, \qquad n>2.

At fourth order with zero means,

⟨ABCD⟩=⟨AB⟩⟨CD⟩+⟨AC⟩⟨BD⟩+⟨AD⟩⟨BC⟩\langle ABCD\rangle ={} \langle AB\rangle \langle CD\rangle + \langle AC\rangle \langle BD\rangle + \langle AD\rangle \langle BC\rangle

for commuting Gaussian variables or bosonic fields in a compatible ordering. Fermionic Wick contractions carry permutation signs. Substituting the Wick sum into the fourth-cumulant formula gives zero.

The restriction to linear fields matters: nonlinear observables such as a squared Gaussian field generally have nonzero higher cumulants. Conversely, vanishing of one measured fourth cumulant does not prove that a state is Gaussian. When the generating function exists near zero, a quadratic logarithm characterizes Gaussianity; one selected moment does not establish that property.

Interactions often generate non-Gaussian connected cumulants, but “interacting” and “non-Gaussian” are not synonyms. Quadratic effective theories can describe interacting systems approximately, while a noninteracting Hamiltonian with a non-Gaussian initial state can have nonzero higher cumulants.

If two regions are in a product state,

ρXY=ρX⊗ρY,\rho_{XY} = \rho_X\otimes\rho_Y,

then for every local pair AXA_X and BYB_Y,

⟨AXBY⟩c=0.\left\langle A_XB_Y \right\rangle_c = 0.

The converse is false for one selected pair. A state can be correlated in operators not tested by AXA_X and BYB_Y.

Even a nonzero connected correlator does not prove entanglement. Consider

ρcc=12(∣00⟩⟨00∣+∣11⟩⟨11∣).\rho_{\mathrm{cc}} = \frac{1}{2} \left( \lvert 00\rangle\langle00\rvert + \lvert 11\rangle\langle11\rvert \right).

This state is separable, yet

⟨Z1⟩=⟨Z2⟩=0,⟨Z1Z2⟩c=1.\langle Z_1\rangle = \langle Z_2\rangle = 0, \qquad \langle Z_1Z_2\rangle_c = 1.

The connected correlation is classical uncertainty about which aligned product state was prepared.

If factorization holds for complete operator bases on both regions,

⟨AμBν⟩=⟨Aμ⟩⟨Bν⟩\left\langle A_\mu B_\nu \right\rangle = \left\langle A_\mu\right\rangle \left\langle B_\nu\right\rangle

for all μ,ν\mu,\nu, then the joint state is a product. That is a complete tomography statement, much stronger than checking one correlator. Marginals and Correlations derives the reconstruction statement.

Connected correlations can arise without dynamical interactions:

  • exchange statistics produces density antibunching or bunching;
  • a fixed total charge produces compensating anticorrelation;
  • a classically correlated mixture has nonzero connected moments;
  • an initially entangled state can evolve under a noninteracting Hamiltonian;
  • common external randomness can correlate otherwise uncoupled sectors.

Conversely, an interacting Hamiltonian does not guarantee a nonzero selected correlator. Symmetry can force it to vanish, a product mean-field approximation can set it to zero by construction, or the chosen operators can miss the correlated channel.

Connected correlation diagnoses failure of moment factorization for specified operators and a specified state. Distinguishing these origins requires more information about the state and preparation.

Let AXA_X and BYB_Y be bounded local operators supported in regions XX and YY. A state clusters for this operator class if

⟨AXBY⟩c⟶0\left\langle A_XB_Y \right\rangle_c \longrightarrow 0

as

dist⁡(X,Y)⟶∞.\operatorname{dist}(X,Y) \longrightarrow \infty.

Cluster decomposition says that sufficiently distant bounded experiments become independent at the level of local moments. It is a property of the state, the operator class, and the limiting procedure. It is not guaranteed by writing down a local Hamiltonian.

Comparison of a symmetric phase mixture with persistent connected order and a selected pure phase whose full correlator plateaus while the connected part decays.

Phase selection changes what the subtraction removes. In a symmetric mixture, ⟨O⟩=0\langle O\rangle=0, so the connected correlator equals the full correlator and can retain the order plateau. In a selected pure phase, the full correlator approaches m2m^2 while subtraction leaves a connected fluctuation that clusters to zero.

Here a pure phase means an extremal thermodynamic equilibrium phase, not necessarily a pure density operator: a finite-temperature pure phase is usually mixed quantum mechanically. Suppose a broken-symmetry pure phase has

⟨Oi⟩=m.\langle O_i\rangle = m.

Cluster decomposition gives

⟨OiOj⟩⟶m2,\langle O_iO_j\rangle \longrightarrow m^2,

while

⟨OiOj⟩c⟶0.\langle O_iO_j\rangle_c \longrightarrow 0.

Now form an equal mixture of two phases with order parameters ±m\pm m. The mixture has

⟨Oi⟩mix=0\langle O_i\rangle_{\mathrm{mix}} = 0

but can retain

⟨OiOj⟩mix⟶m2.\langle O_iO_j\rangle_{\mathrm{mix}} \longrightarrow m^2.

Therefore

⟨OiOj⟩c,mix⟶m2.\langle O_iO_j\rangle_{c,\mathrm{mix}} \longrightarrow m^2.

The mixture fails cluster decomposition because a global classical label, the selected phase, remains correlated across arbitrary distance.

A finite symmetry-preserving ground state can behave similarly over distances below the system size. It is incorrect to infer absence of order from a zero one-point function or to infer absence of a pure clustering phase from the finite-volume connected plateau. Spontaneous Symmetry Breaking explains cat states, symmetry-breaking sources, and thermodynamic phase selection.

A short-range-correlated phase often satisfies

∣⟨AXBY⟩c∣≤CA,Be−dist⁡(X,Y)/ξ\left| \langle A_XB_Y\rangle_c \right| \leq C_{A,B} e^{-\operatorname{dist}(X,Y)/\xi}

at large separation, possibly with an algebraic prefactor.

For finite-range quantum spin systems with bounded local terms, a unique ground state and a uniform gap above it imply exponential clustering of bounded local observables. A gap that closes as the volume grows is insufficient. The theorem’s correlation-length bound is controlled parametrically by a locality velocity divided by the gap, but it is not generally an equality for the physical correlation length. Area Laws separates this clustering theorem from the stronger entropy statement and records where the converse is rigorous.

Important qualifications include:

  • ground-state degeneracy and phase-sector selection;
  • operators that connect different ground sectors;
  • long-range interactions;
  • unbounded local degrees of freedom;
  • gauge constraints and nonlocal observables;
  • finite temperature and thermal phase transitions;
  • topological sectors and boundary modes.

A spectral gap is a powerful sufficient ingredient in the local setting, not a universal one-line equivalence between “gapped” and “exponential” for every operator and geometry.

There are several useful but inequivalent correlation lengths.

For

Cc(r)∼Ae−r/ξrpcos⁡(Qr+φ),C^c(r) \sim A \frac{ e^{-r/\xi} }{ r^p } \cos(Qr+\varphi),

ξ\xi is the exponential decay length. The amplitude, power pp, oscillation wavevector QQ, and phase φ\varphi must be handled before fitting.

Several transfer-matrix eigenvalues or excitation channels can produce several lengths:

Cc(r)=∑aAae−r/ξacos⁡(Qar+φa)+⋯ .C^c(r) = \sum_a A_a e^{-r/\xi_a} \cos(Q_ar+\varphi_a) +\cdots.

The largest ξa\xi_a dominates only if its amplitude is nonzero in the chosen operator channel and the asymptotic regime is reached.

For a positive, nonoscillatory pure exponential sampled with spacing aa,

ξeff(r)=alog⁡ ⁣[Cc(r)/Cc(r+a)].\xi_{\mathrm{eff}}(r) = \frac{a}{ \log\!\left[ C^c(r)/C^c(r+a) \right] }.

A plateau of ξeff(r)\xi_{\mathrm{eff}}(r) can identify an asymptotic window. Sign changes, noise near zero, algebraic prefactors, multiple exponentials, and boundaries can make this estimator unstable or biased.

For a periodic lattice and an ordering wavevector Q\mathbf Q, a common finite-size estimator is

ξ2=12sin⁡(∣qmin⁡∣/2)Sc(Q)Sc(Q+qmin⁡)−1,\xi_2 = \frac{1}{ 2\sin(\lvert\mathbf q_{\min}\rvert/2) } \sqrt{ \frac{ S_c(\mathbf Q) }{ S_c(\mathbf Q+\mathbf q_{\min}) } -1 },

in lattice-spacing units. Here ScS_c is the Fourier transform of the connected correlator and qmin⁡\mathbf q_{\min} is the smallest compatible momentum increment.

This formula assumes a suitable Ornstein–Zernike-like small-momentum shape and geometry. Landau–Ginzburg Theory Preview derives the Gaussian kernel r+ck2r+c k^2 and its pole length; the estimator here remains an operational definition rather than an assumption that the full system is Gaussian. Other boundary conditions, anisotropic systems, conserved constraints, and tensor channels require modified estimators. The second-moment length need not equal the asymptotic exponential length away from a scaling regime.

Structure Factors develops the Fourier normalization; the formula appears here only to distinguish common definitions of ξ\xi.

At a scale-invariant point or in a stable critical phase,

COc(r)∼cos⁡(Q⋅r+φ)r2ΔO,C_O^c(r) \sim \frac{ \cos(\mathbf Q\cdot\mathbf r+\varphi) }{ r^{2\Delta_O} },

where ΔO\Delta_O is the scaling dimension of the operator channel.

There is no finite exponential correlation length at the critical point. Away from it, a scaling form is

COc(r;δ)=1r2ΔOF±(rξ),C_O^c(r;\delta) = \frac{1}{ r^{2\Delta_O} } \mathcal F_\pm \left( \frac{r}{\xi} \right),

with

ξ∼∣δ∣−ν.\xi \sim \lvert\delta\rvert^{-\nu}.

Here δ\delta measures distance from criticality and the branches F±\mathcal F_\pm can differ on the two sides.

Critical behavior requires several cautions:

  • different operators have different scaling dimensions;
  • symmetry can suppress the leading channel;
  • dangerously irrelevant variables can modify naive finite-size scaling;
  • logarithmic corrections can imitate drifting powers;
  • anisotropic systems can have direction-dependent lengths;
  • a quantum critical point includes temporal scaling and a dynamical exponent;
  • a finite range of sizes can fit both a large finite ξ\xi and a power law.

Gaplessness does not force every correlator to decay algebraically, and one algebraic correlator does not determine the entire universality class.

Critical Exponents and Scaling explains the anomalous dimension, Fisher relation, finite-size corrections, and dynamic scaling.

Order and fluctuations ask different questions

Section titled “Order and fluctuations ask different questions”

Use the full long-distance correlator or a squared order parameter to test whether a phase has order. Use the connected function to study fluctuations around a selected phase. In a symmetric finite state or mixture, the means can vanish, leaving the order plateau inside the connected function. Long-Range Order develops the corresponding finite-size tests.

A fixed-number example: small tails with a finite sum

Section titled “A fixed-number example: small tails with a finite sum”

Consider a uniform classical mixture of all binary occupation strings with exactly NN occupied sites among LL. Write p=N/Lp=N/L. Counting configurations gives

⟨ni⟩=p,⟨ninj⟩=N(N−1)L(L−1)(i≠j).\langle n_i\rangle=p,\qquad \langle n_i n_j\rangle=\frac{N(N-1)}{L(L-1)}\quad(i\ne j).

Therefore

Cnc(i,i)=p(1−p),Cnc(i,j)=−p(1−p)L−1(i≠j).C_n^c(i,i)=p(1-p),\qquad C_n^c(i,j)=-\frac{p(1-p)}{L-1}\quad(i\ne j).

Each offsite value tends to zero at fixed filling as L→∞L\to\infty, but their sum stays −p(1−p)-p(1-p) and exactly cancels the onsite variance. For L=4L=4, N=2N=2, the diagonal entries are 1/41/4 and the twelve off-diagonal entries are −1/12-1/12. Every row sums to zero, as required by ∑jδnj=0\sum_j\delta n_j=0.

This example concerns the constraint-induced tail. In an interacting state, short-distance connected correlations generally remain nonzero as L→∞L\to\infty; only the additional 1/L1/L background vanishes pointwise. Local ensemble equivalence therefore need not imply identical integrated zero-momentum fluctuations.

Extensive Observables and Cumulant Scaling

Section titled “Extensive Observables and Cumulant Scaling”

For an extensive observable

X=∑ixi,X = \sum_i x_i,

its variance is the sum of connected two-point functions:

Var⁡(X)=∑i,j⟨xixj⟩c.\operatorname{Var}(X) = \sum_{i,j} \langle x_i x_j\rangle_c.

More generally,

κn(X)=∑i1,…,in⟨xi1⋯xin⟩c.\kappa_n(X) = \sum_{i_1,\ldots,i_n} \left\langle x_{i_1}\cdots x_{i_n} \right\rangle_c.

If the connected nn-point function is absolutely summable in all relative coordinates, only tuples within a finite correlation volume contribute appreciably to each anchor point. Then

κn(X)=O(L)\kappa_n(X) =O(L)

for a sequence with a uniform summability bound. Proportionality with a nonzero coefficient needs an additional assumption: a fixed total charge, for example, can have exactly zero variance.

Near criticality or with long-range order, the correlation volume grows and cumulants can scale superextensively. Ratios such as Binder cumulants exploit this scaling, but their normalization and universal limits depend on geometry, boundary conditions, order-parameter symmetry, and ensemble.

The fluctuation and susceptibility consequences are developed in Fluctuations and Susceptibilities.

Inhomogeneous Profiles and Averaging Order

Section titled “Inhomogeneous Profiles and Averaging Order”

For an open, trapped, or disordered system, define the displacement-averaged connected correlator by subtracting local means before averaging:

C‾ABc(r)=1Nr∑i: i+r∈Λ[⟨AiBi+r⟩−⟨Ai⟩⟨Bi+r⟩].\overline C_{AB}^c(r) ={} \frac{1}{N_r} \sum_{i:\,i+r\in\Lambda} \big[ \langle A_iB_{i+r}\rangle - \langle A_i\rangle \langle B_{i+r}\rangle \big].

This generally differs from

1Nr∑i⟨AiBi+r⟩−⟨A⟩‾ ⟨B⟩‾.\frac{1}{N_r} \sum_i \langle A_iB_{i+r}\rangle - \overline{\langle A\rangle} \, \overline{\langle B\rangle}.

The difference is the spatial covariance of the one-point profiles. Subtracting global means can mistake a trap shape, domain wall, density gradient, or disorder pattern for correlated fluctuations.

If disorder averaging is also performed, distinguish:

⟨AB⟩−⟨A⟩⟨B⟩‾\overline{ \langle AB\rangle - \langle A\rangle\langle B\rangle }

from

⟨AB⟩‾−⟨A⟩‾ ⟨B⟩‾.\overline{\langle AB\rangle} - \overline{\langle A\rangle} \, \overline{\langle B\rangle}.

The second includes sample-to-sample covariance of the means. Both can be useful, but they answer different questions.

For a stationary state,

CABc(t)=⟨A(t)B(0)⟩−⟨A⟩⟨B⟩.C_{AB}^c(t) = \langle A(t)B(0)\rangle - \langle A\rangle\langle B\rangle.

The disconnected term contributes

2π⟨A⟩⟨B⟩δ(ω)2\pi \langle A\rangle \langle B\rangle \delta(\omega)

to the ordinary spectrum. Subtracting it removes that particular elastic line.

It does not remove zero-frequency weight from conserved projections, degenerate transitions, phase mixtures, or integrability. A dynamical connected plateau must be interpreted with the same state and limit care as a spatial one.

For nonstationary states,

CABc(t,t′)=⟨A(t)B(t′)⟩−⟨A(t)⟩⟨B(t′)⟩.C_{AB}^c(t,t') ={} \langle A(t)B(t')\rangle - \langle A(t)\rangle \langle B(t')\rangle.

Time-Dependent Correlations develops the two-time and spectral analysis.

In a perturbative expansion, disconnected vacuum or insertion clusters can scale with volume and proliferate combinatorially. Normalizing the generating functional removes vacuum-only factors, while taking its logarithm selects connected insertion structures.

This gives the linked-cluster principle:

log⁡Z\log Z

is extensive when connected clusters are local and summable, even though ZZ itself grows exponentially with volume.

Connected diagrams can still contain self-energy insertions, articulation lines, or reducible subgraphs. “Connected,” “one-particle irreducible,” “skeleton,” and “amputated” identify different graph operations. Diagrammatic Methods Preview explains those graph operations.

Suppose independent, identically distributed preparations yield real scalar outcomes ama_m and bmb_m. The unbiased sample covariance is

C^ABc=1M−1∑m=1M(am−a‾)(bm−b‾).\widehat C_{AB}^c = \frac{1}{M-1} \sum_{m=1}^{M} \left( a_m-\overline a \right) \left( b_m-\overline b \right).

Using 1/M1/M after estimating both means from the same finite sample gives the maximum-likelihood estimator for some models but has expectation (M−1)/M(M-1)/M times the covariance for independent identically distributed samples. It is biased toward zero, including when the true covariance is negative.

For quantum observables that do not commute, one experimental record does not provide an ordinary joint sample (am,bm)(a_m,b_m) without a specified sequential, weak, or ancilla-assisted protocol. The estimator must match the ordered, symmetrized, or response object actually measured.

Further cautions:

  • spatial pairs within one image are not statistically independent;
  • Markov-chain samples have an autocorrelation time;
  • estimating and subtracting large means amplifies relative error;
  • detector drift can create common-mode connected signals;
  • postselection induces correlations;
  • uncertainty in local means must be propagated into CcC^c;
  • fitting ξ\xi requires covariance among separations.

Evaluate the full moment and one-point functions in the same state and convention. Exact identities from symmetry, fixed charges, and onsite algebra provide checks. Do not round the separate terms before subtraction.

For matrix-product states, transfer-matrix eigenvalues determine asymptotic connected correlations. For an injective translation-invariant MPS, a unique leading transfer eigenvalue generates the disconnected product; subleading eigenvalues generate decay lengths. Multiple unit-modulus eigenvalues can retain nondecaying correlations, as in cat states. Finite bond dimension can impose an artificial finite correlation length at criticality.

Connected estimators can be formed directly from centered configurations or by subtracting ensemble means. Improved estimators may reduce variance. Near criticality, long autocorrelation times and covariance across distances must enter the error analysis.

Higher cumulants can be obtained from derivatives of log⁡Z[J]\log Z[J], but numerical differentiation amplifies noise. Automatic differentiation, reweighting, or direct cumulant estimators should be checked against low-order moment formulas and exact symmetries.

One zero correlator does not establish a product state. Complete local operator bases are needed for that conclusion; one nonzero correlator, conversely, can be entirely classical.

A symmetric mixture need not cluster. The shared phase label can persist across arbitrary distance. State how a phase is selected before interpreting its connected tail.

One fitted length need not describe every channel. Oscillations, power-law prefactors, finite bond dimension, and boundaries can all distort a two-point ratio. Compare fit windows and sizes before assigning an asymptotic correlation length.

Show that

⟨AB⟩c=⟨δA δB⟩\langle AB\rangle_c = \langle\delta A\,\delta B\rangle

without assuming that AA and BB commute.

Solution

Expand in the written order:

⟨δA δB⟩=⟨(A−⟨A⟩I)(B−⟨B⟩I)⟩=⟨AB⟩−⟨A⟩⟨B⟩−⟨A⟩⟨B⟩+⟨A⟩⟨B⟩.\begin{aligned} \langle\delta A\,\delta B\rangle ={}& \left\langle \left( A-\langle A\rangle I \right) \left( B-\langle B\rangle I \right) \right\rangle \\ ={}& \langle AB\rangle - \langle A\rangle\langle B\rangle - \langle A\rangle\langle B\rangle + \langle A\rangle\langle B\rangle. \end{aligned}

The last three terms combine to one subtraction:

⟨δA δB⟩=⟨AB⟩−⟨A⟩⟨B⟩.\langle\delta A\,\delta B\rangle = \langle AB\rangle - \langle A\rangle\langle B\rangle.

Only scalar means were moved; the operators themselves were never reordered.

Exercise 2: Third cumulant of centered operators

Section titled “Exercise 2: Third cumulant of centered operators”

Prove that

⟨ABC⟩c=⟨δA δB δC⟩\langle ABC\rangle_c = \langle \delta A\,\delta B\,\delta C \rangle

for the fixed order ABCABC.

Solution

Expand

(A−⟨A⟩)(B−⟨B⟩)(C−⟨C⟩)\left( A-\langle A\rangle \right) \left( B-\langle B\rangle \right) \left( C-\langle C\rangle \right)

without changing the order. Taking the expectation gives

⟨δA δB δC⟩=⟨ABC⟩−⟨A⟩⟨BC⟩−⟨B⟩⟨AC⟩−⟨C⟩⟨AB⟩+⟨A⟩⟨B⟩⟨C⟩+⟨A⟩⟨B⟩⟨C⟩+⟨A⟩⟨B⟩⟨C⟩−⟨A⟩⟨B⟩⟨C⟩.\begin{aligned} \langle \delta A\,\delta B\,\delta C \rangle ={}& \langle ABC\rangle - \langle A\rangle\langle BC\rangle - \langle B\rangle\langle AC\rangle \\ &- \langle C\rangle\langle AB\rangle + \langle A\rangle\langle B\rangle\langle C\rangle \\ &+ \langle A\rangle\langle B\rangle\langle C\rangle + \langle A\rangle\langle B\rangle\langle C\rangle \\ &- \langle A\rangle\langle B\rangle\langle C\rangle. \end{aligned}

The final four scalar terms sum to

2⟨A⟩⟨B⟩⟨C⟩,2 \langle A\rangle \langle B\rangle \langle C\rangle,

reproducing the third-cumulant formula.

Exercise 3: Classical correlation without entanglement

Section titled “Exercise 3: Classical correlation without entanglement”

For

ρcc=12(∣00⟩⟨00∣+∣11⟩⟨11∣),\rho_{\mathrm{cc}} = \frac{1}{2} \left( \lvert00\rangle\langle00\rvert + \lvert11\rangle\langle11\rvert \right),

compute ⟨Z1⟩\langle Z_1\rangle, ⟨Z2⟩\langle Z_2\rangle, and ⟨Z1Z2⟩c\langle Z_1Z_2\rangle_c. Explain why the result does not prove entanglement.

Solution

With Z∣0⟩=∣0⟩Z\lvert0\rangle=\lvert0\rangle and Z∣1⟩=−∣1⟩Z\lvert1\rangle=-\lvert1\rangle,

⟨Z1⟩=12(1−1)=0,\langle Z_1\rangle = \frac{1}{2}(1-1) = 0,

and similarly ⟨Z2⟩=0\langle Z_2\rangle=0. Both components have aligned outcomes, so

⟨Z1Z2⟩=12(1+1)=1.\langle Z_1Z_2\rangle = \frac{1}{2}(1+1) = 1.

Therefore

⟨Z1Z2⟩c=1.\langle Z_1Z_2\rangle_c = 1.

The density operator is explicitly a convex mixture of product states. It is separable, and the correlation records the classical shared label 0000 versus 1111.

Let N=∑jnjN=\sum_jn_j be sharp. Prove

∑j⟨δniδnj⟩=0.\sum_j \langle \delta n_i\delta n_j \rangle = 0.

What does this imply if the onsite variance is positive?

Solution

Sharp total number means

δN=∑jδnj=0\delta N = \sum_j\delta n_j = 0

on the support of the state. Thus

∑j⟨δniδnj⟩=⟨δni∑jδnj⟩=⟨δniδN⟩=0.\begin{aligned} \sum_j \langle \delta n_i\delta n_j \rangle &= \left\langle \delta n_i \sum_j\delta n_j \right\rangle \\ &= \langle \delta n_i\delta N \rangle = 0. \end{aligned}

The j=ij=i term is Var⁡(ni)≥0\operatorname{Var}(n_i)\geq0. If it is positive, the sum of offsite connected terms must be negative. This compensation follows from conditioning on total number.

Assume zero one-point functions and Wick factorization

⟨ABCD⟩=⟨AB⟩⟨CD⟩+⟨AC⟩⟨BD⟩+⟨AD⟩⟨BC⟩.\langle ABCD\rangle ={} \langle AB\rangle\langle CD\rangle + \langle AC\rangle\langle BD\rangle + \langle AD\rangle\langle BC\rangle.

Show that ⟨ABCD⟩c=0\langle ABCD\rangle_c=0.

Solution

For zero means,

⟨ABCD⟩c=⟨ABCD⟩−⟨AB⟩⟨CD⟩−⟨AC⟩⟨BD⟩−⟨AD⟩⟨BC⟩.\langle ABCD\rangle_c ={} \langle ABCD\rangle - \langle AB\rangle\langle CD\rangle - \langle AC\rangle\langle BD\rangle - \langle AD\rangle\langle BC\rangle.

Substituting the Wick sum cancels each pairing exactly, leaving zero. For fermionic operators the same conclusion holds when both the Wick expansion and cumulant convention use the same ordering and permutation signs.

Exercise 6: Pure phase versus symmetric mixture

Section titled “Exercise 6: Pure phase versus symmetric mixture”

Suppose two pure phases have

⟨Oi⟩±=±m\langle O_i\rangle_\pm = \pm m

and each clusters:

⟨OiOj⟩±⟶m2.\langle O_iO_j\rangle_\pm \longrightarrow m^2.

Compute the long-distance connected correlator in either pure phase and in their equal mixture.

Solution

In a pure phase,

⟨OiOj⟩c,±=⟨OiOj⟩±−⟨Oi⟩±⟨Oj⟩±⟶m2−(±m)2=0.\begin{aligned} \langle O_iO_j\rangle_{c,\pm} &= \langle O_iO_j\rangle_\pm - \langle O_i\rangle_\pm \langle O_j\rangle_\pm \\ &\longrightarrow m^2-(\pm m)^2 = 0. \end{aligned}

In the equal mixture, the one-point function cancels:

⟨Oi⟩mix=12(m−m)=0.\langle O_i\rangle_{\mathrm{mix}} = \frac{1}{2}(m-m) = 0.

The two-point function does not cancel:

⟨OiOj⟩mix⟶12(m2+m2)=m2.\langle O_iO_j\rangle_{\mathrm{mix}} \longrightarrow \frac{1}{2}(m^2+m^2) = m^2.

Hence

⟨OiOj⟩c,mix⟶m2.\langle O_iO_j\rangle_{c,\mathrm{mix}} \longrightarrow m^2.

The mixture fails clustering because the global phase label remains shared at arbitrary distance.

For

X=∑ixi,X = \sum_i x_i,

show

Var⁡(X)=∑i,j⟨xixj⟩c.\operatorname{Var}(X) = \sum_{i,j} \langle x_i x_j\rangle_c.

Why does rapid clustering usually make this extensive?

Solution

Expand

Var⁡(X)=⟨X2⟩−⟨X⟩2=∑i,j[⟨xixj⟩−⟨xi⟩⟨xj⟩]=∑i,j⟨xixj⟩c.\begin{aligned} \operatorname{Var}(X) &= \langle X^2\rangle - \langle X\rangle^2 \\ &= \sum_{i,j} \left[ \langle x_ix_j\rangle - \langle x_i\rangle \langle x_j\rangle \right] \\ &= \sum_{i,j} \langle x_ix_j\rangle_c. \end{aligned}

If the connected function is summable, then for each anchor ii only a finite correlation volume of jj contributes appreciably. The inner sum approaches a size-independent constant away from boundaries, while the number of anchors is proportional to LL. Thus Var⁡(X)=O(L)\operatorname{Var}(X)=O(L). If the limiting inner sum is nonzero, the variance is proportional to LL; conservation constraints can instead make it vanish.

Suppose

Cc(r)=Ae−r/ξC^c(r) = Ae^{-r/\xi}

is sampled at rr and r+ar+a. Show that

ξ=alog⁡[Cc(r)/Cc(r+a)].\xi = \frac{a}{ \log[C^c(r)/C^c(r+a)] }.

Name two reasons this estimator can fail on real data.

Solution

The ratio is

Cc(r)Cc(r+a)=Ae−r/ξAe−(r+a)/ξ=ea/ξ.\frac{ C^c(r) }{ C^c(r+a) } = \frac{ Ae^{-r/\xi} }{ Ae^{-(r+a)/\xi} } = e^{a/\xi}.

Taking the logarithm gives

log⁡ ⁣[Cc(r)Cc(r+a)]=aξ,\log\!\left[ \frac{ C^c(r) }{ C^c(r+a) } \right] = \frac{a}{\xi},

which yields the stated formula.

The estimator can fail or drift because of oscillatory sign changes, algebraic prefactors, multiple exponentials, statistical noise near zero, boundary effects, or using distances outside the asymptotic regime.