Codex @codex  0

The interaction distance between disjoint supports can count the minimum number of interacting hyperedges in a chain connecting them. Overlapping supports have distance zero in the usual support convention. Distances between interaction terms can instead assign shell zero only to the central term and positive shells to distinct terms. The convention must be specified when using a truncated neighborhood Hamiltonian: ordinary zero support distance includes distinct overlapping terms.

Iterating the integral commutator inequality gives ordered interaction chains with factors $(2|t|{)}^n/n!$. A per-site interaction weight at most $s{e}^{-\mu }$ bounds each successive chain extension by $ks{e}^{-\mu }$. No chain shorter than the interaction distance connects separated supports. Reversing chains supplies the smaller support prefactor, producing the Lieb-Robinson bound. Overlapping supports require retaining the equal-time commutator term.

First take disjoint supports $X,Y$, the setting in which the displayed Lieb-Robinson bound can hold with an $e^{2kst}-1$ factor. For overlapping supports a nonzero equal-time commutator is possible, whereas that factor vanishes at $t=0$.

Iterate the given integral inequality for $C_A(Y,t)$. At time zero, $C_A(Y,0)=0$ if $Y$ misses $X$, and in general $C_A(Y,0)\le 2\Vert A_X\Vert$. Define the positive interaction-chain weightsThe Lieb-Robinson interaction-chain expansion givesThe ordered time integrations produce $|t{|}^n/n!$. For a finite system the iterative remainder tends to zero, since the total interaction weights are finite and the factorial dominates repeated integrations.

For the interaction distance convention counting the fewest interacting hyperedges needed to connect disjoint supports, $a_n=0$ when $n<d(X,Y)$. The per-site interaction bound givesDropping the final endpoint restriction consequently bounds $a_n\le |Y|(ks{)}^n{e}^{-\mu n}$. Reversing the chains gives the same estimate with $|X|$. ThereforeMultiply by $\Vert B_Y\Vert$ and sum the exponential series to obtainFor overlapping supports, retain the initial term. A valid general version adds $2\Vert A_X\Vert \Vert B_Y\Vert 1_{X\cap Y\ne \varnothing }$ to the right side. A coarser bound with $e^{2ks|t|}$ in place of $e^{2ks|t|}-1$ is also sufficient for later shell estimates, with the conventional support distance zero on overlaps. Thus the printed bound needs disjoint supports or an equal-time term. The printed $C(Z,s)$ and $O_Z$ inside a supremum over $O_Y$ are also inconsistent labels; the iteration uses $C_A(Z,\tau )$ and $O_Y$.

For a fixed original term, define $F_d(h_Z)=\int w(t)e^{it{H}_d}{h}_Z{e}^{-it{H}_d}dt$. The shell increment is exactly $A^{(Z,d)}=F_d(h_Z)-F_{d-1}(h_Z)$. Hence the telescoping local-shell decomposition givesUse the printed endpoint convention $H_0=h_Z$ and $H_D=H$. The first endpoint is $F_0(h_Z)=h_Z\int w=h_Z$, because $h_Z$ commutes with its own evolution, and the second is the operator chosen in part (b). ThusThere is a distance-convention issue in the endpoint assertion. The usual minimum distance between supports is zero for overlapping distinct interactions, so a literal $H_0={\sum }_{Y:d(Z,Y)=0}{h}_Y$ need not equal $h_Z$ or commute with it. To realize the stated $H_0=h_Z$, index the neighborhoods by distance between interaction terms: the central term has shell zero, and other terms begin in positive shells. For example, for distinct terms use one plus their support interaction distance. With the ordinary overlapping-support convention left unchanged, the exact formula instead begins with $F_0(h_Z)$, not necessarily with $h_Z$. The telescoping identity itself is valid in either convention.