Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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 G be either Fa, a>0, or Fρ, ρ>d, as in the weighted-interaction definition. Let Φu be a norm-continuous family of finite interactions on Zd, indexed by u∈[0,T], with MG:=sup⁡u∈[0,T]∥Φu∥G<∞. For finite Λ⊂Zd, define HΛ(u)=∑∅≠Z⊆ΛΦu(Z) and let UΛ(0)=I solve

dduUΛ(u)=−iHΛ(u)UΛ(u)/ℏ.

Set αuΛ(A)=UΛ(u)∗AUΛ(u), extended by the identity outside Λ. If A∈AX, B∈AY for disjoint finite nonempty X,Y⊂Λ, then

∥[αuΛ(A),B]∥≤2∥A∥∥B∥CG(e2CGMGu/ℏ−1)∑x∈X, y∈YG(d∞(x,y)).

The same estimate holds for the inverse path. In particular, for a constant interaction Φ evolved in physical time t by τtΛ,Φ, take u=∣t∣ and the constant path Φu=Φ to obtain

∥[τtΛ,Φ(A),B]∥≤2∥A∥∥B∥CG(e2CG∥Φ∥G∣t∣/ℏ−1)∑x∈X, y∈YG(d∞(x,y)).

In physical units, u,T,t are times, MG and ∥Φ∥G have energy units, and ℏ has energy-times-time units; the weights and convolution constants are dimensionless, so the exponential arguments are dimensionless.

Facts & Assumptions

Given: d≥1, a finite volume Λ, finite nonempty disjoint supports X,Y⊆Λ, a norm-continuous finite-interaction path Φu, and the bounds in the Statement.

[F1]

Weighted interactions and gapped finite-volume paths: HΛ(u) is a finite self-adjoint matrix, ∥Φu∥G is the supremum of the pair-weighted interaction sums, and the finite-volume dynamics are matrix conjugations.

[F2]

Summability and convolution control for lattice weights: G is summable and ∑zG(d∞(x,z))G(d∞(z,y))≤CGG(d∞(x,y)), with CG>0.

[F3]

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

technique · direct

Given: [F1]–[F3], MG<∞, and ℏ>0 in the constant-interaction statement.

1.1givenF1F3algebra

For a finite nonempty S⊆Λ, define CBΛ(S,u)=sup⁡D∈AS,  D≠0∥[αuΛ(D),B]∥/∥D∥. Let US(u) solve US′(u)=−iHS(u)US(u)/ℏ, US(0)=I, where HS(u)=∑∅≠Z⊆SΦu(Z). Put α~uS(D)=US(u)DUS(u)∗ and f(u)=[αuΛ(α~uS(D)),B]. Product differentiation and the Jacobi identity give f′(u)=iℏ[KS(u),f(u)]+iℏ∑Z⊆ΛZ∩S≠∅,Z⊈S[αuΛ(α~uS(D)),[B,αuΛ(Φu(Z))]], where KS(u)=∑Z⊆Λ: Z∩S≠∅,  Z⊈SαuΛ(Φu(Z)) is self-adjoint. Indeed, the local propagator cancels the terms contained in S, and terms disjoint from S commute with D by [F3]. The homogeneous equation g′=(i/ℏ)[KS(u),g] preserves norm because its propagator is unitary; existence follows from the uniformly convergent finite-dimensional Picard series. Variation of constants, ∥[R,Q]∥≤2∥R∥∥Q∥, and enlargement of the crossing-support sum to all terms meeting S therefore give CBΛ(S,u)≤CBΛ(S,0)+2ℏ∑Z⊆ΛZ∩S≠∅∫0u∥Φv(Z)∥CBΛ(Z,v) dv. The same inequality applies to the inverse path, which is generated over a reversed parameter interval by the interaction −Φu−v and has the same norm bound.

2.1givenF1F3step 1.1algebra

At u=0, disjointness gives CBΛ(S,0)=0 when S∩Y=∅, while CBΛ(S,u)≤2∥B∥ for all supports and times by the commutator inequality and isometry of the dynamics. Iteration of step 1.1 produces time-ordered integrals over 0≤vn≤⋯≤v1≤u and chains Z1,…,Zn with Z1∩S≠∅, Zj+1∩Zj≠∅ and Zn∩Y≠∅, with product ∏j=1n∥Φvj(Zj)∥. All support sums are finite. For the iteration remainder, put QΛ=∑∅≠Z⊆Λsup⁡v∈[0,T]∥Φv(Z)∥<∞, which is finite by norm continuity and compactness. Its absolute size after n iterations is at most 2∥B∥(2QΛu/ℏ)n/n!, 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 Kv(x,y)=∑Z⊆Λ: x,y∈Z∥Φv(Z)∥. At each fixed time tuple, summing over all endpoint and overlap sites overcounts each nonnegative interaction-chain term at least once. Thus the order-n contribution for S=X is at most 2∥B∥(2/ℏ)n∫0≤vn≤⋯≤v1≤u∑x∈X,y∈Y(Kv1⋯Kvn)(x,y) dvn⋯dv1. 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.

3.1givenF1F2step 2.1algebra∎

By [F1], for each v∈[0,T] separately, Kv(x,y)≤MGG(d∞(x,y)). Induction using [F2] gives (Kv1⋯Kvn)(x,y)≤MGnCGn−1G(d∞(x,y))(n≥1): 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 un/n! times that bound. Substituting into step 2.1 and summing the convergent exponential series gives CBΛ(X,u)≤2∥B∥CG(e2CGMGu/ℏ−1)∑x∈X,y∈YG(d∞(x,y)). The finite-volume remainder justifies the iteration limit; alternatively the displayed factorial majorant dominates every partial chain sum. Multiplication by ∥A∥ proves the path estimate, including A=0. Applying the same time-ordered argument to the reversed interaction path, whose norm at every time is bounded by MG, proves the inverse estimate. For a constant interaction take u=∣t∣; reversal changes its sign but not its norm. All constants in the resulting estimates depend only on CG,MG, not on the volume-dependent remainder bound.

Depends on

Dependency tree · 2 levels

Sources