How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Weighted interaction commutator bound
Statement
Let be either , , or , , as in the weighted-interaction definition. Let be a norm-continuous family of finite interactions on , indexed by , with . For finite , define and let solve
Set , extended by the identity outside . If , for disjoint finite nonempty , then
The same estimate holds for the inverse path. In particular, for a constant interaction evolved in physical time by , take and the constant path to obtain
In physical units, are times, and have energy units, and has energy-times-time units; the weights and convolution constants are dimensionless, so the exponential arguments are dimensionless.
Statement references
Facts & Assumptions
Given: , a finite volume , finite nonempty disjoint supports , a norm-continuous finite-interaction path , and the bounds in the Statement.
Weighted interactions and gapped finite-volume paths: is a finite self-adjoint matrix, is the supremum of the pair-weighted interaction sums, and the finite-volume dynamics are matrix conjugations.
Summability and convolution control for lattice weights: is summable and , with .
Local spin matrix algebras and their factor inclusions: finite local algebras are matrix algebras; operators in disjoint tensor factors commute, and their factor inclusions preserve the operator norm.
Proof
Given: [F1]–[F3], , and in the constant-interaction statement.
For a finite nonempty , define . Let solve , , where . Put and . Product differentiation and the Jacobi identity give where is self-adjoint. Indeed, the local propagator cancels the terms contained in , and terms disjoint from commute with by [F3]. The homogeneous equation preserves norm because its propagator is unitary; existence follows from the uniformly convergent finite-dimensional Picard series. Variation of constants, , and enlargement of the crossing-support sum to all terms meeting therefore give The same inequality applies to the inverse path, which is generated over a reversed parameter interval by the interaction and has the same norm bound.
At , disjointness gives when , while for all supports and times by the commutator inequality and isometry of the dynamics. Iteration of step 1.1 produces time-ordered integrals over and chains with , and , with product . All support sums are finite. For the iteration remainder, put , which is finite by norm continuity and compactness. Its absolute size after iterations is at most , so it tends to zero. This volume-dependent number is used only to discard the remainder. For the chain terms, define the time-dependent kernel . At each fixed time tuple, summing over all endpoint and overlap sites overcounts each nonnegative interaction-chain term at least once. Thus the order- contribution for is at most Kernel products here sum only over sites of the finite volume. No supremum over time has been moved inside an interaction sum for this bound.
By [F1], for each separately, . Induction using [F2] gives the intermediate-site convolution over the finite volume is bounded by the full nonnegative lattice convolution. This bound is uniform in every time tuple. Its integral over the time-ordered simplex is times that bound. Substituting into step 2.1 and summing the convergent exponential series gives . The finite-volume remainder justifies the iteration limit; alternatively the displayed factorial majorant dominates every partial chain sum. Multiplication by proves the path estimate, including . Applying the same time-ordered argument to the reversed interaction path, whose norm at every time is bounded by , proves the inverse estimate. For a constant interaction take ; reversal changes its sign but not its norm. All constants in the resulting estimates depend only on , not on the volume-dependent remainder bound.