Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Boundary Duhamel estimate for thermodynamic spin dynamics

Statement

Let Φ be an interaction of Uniformly bounded finite-range quantum spin interaction, fix μ>0, and let X⊆Λ⊆Λ′ be finite regions with X≠∅. An increasing finite exhaustion of Zd means a sequence of finite regions (Λn)n≥1 such that Λn⊆Λn+1 for every n and ⋃n≥1Λn=Zd. For every A∈AX and t∈R,

∥αtΛ′(A)−αtΛ(A)∥≤2κ∣X∣∥A∥∣t∣ℏe(2κMeμR/ℏ)∣t∣+μR∑y∉Λe−μdist⁡∞(X,{y}).

The infinite sum is finite. Along every increasing finite exhaustion (Λn) as defined above, ∑y∉Λne−μdist⁡∞(X,{y})→0, so the estimate gives compact-time norm Cauchy convergence of free-boundary finite-volume dynamics on each local observable.

Facts & Assumptions

Given: d≥1, finite q≥1, ℏ>0, a uniformly bounded finite-range interaction Φ with parameters M,R,κ, finite X⊆Λ⊆Λ′, X≠∅, A∈AX, and μ>0.

[F1]

Uniformly bounded finite-range quantum spin interaction: Φ(Z) is supported on Z, vanishes beyond range R or size M, has per-site norm sum at most κ, and defines HΛ and αtΛ.

[F2]

Volume-independent finite-range commutator path bound: for local A∈AX and B∈AZ, with Z not necessarily contained in the finite volume, the identity-extended finite-volume commutator is bounded by 2∥A∥∥B∥∣X∣e(2κMeμR/ℏ)∣t∣−μdist⁡∞(X,Z).

[F3]

Local spin matrix algebras and their factor inclusions: finite-region observables act in the finite matrix algebra AΛ, and operators on disjoint tensor factors commute.

Proof

technique · finite-volume Duhamel comparison followed by the commutator path bound

Given: The finite nested regions, interaction, local observable, and suppliers in [F1]–[F3].

1.1givenF1F3algebra

For t=0, both sides of the stated estimate vanish. For t≠0, put σ=sign⁡(t)∈{−1,1}, and for s between 0 and t, set G(s)=αsΛ′(αt−sΛ(A)). Differentiating the finite matrix exponentials gives G′(s)=iℏαsΛ′ ⁣([HΛ′−HΛ,αt−sΛ(A)]). Indeed, the derivative of αsΛ′ contributes (i/ℏ)[HΛ′,⋅], while differentiating αt−sΛ contributes −(i/ℏ)[HΛ,⋅]; the outer map αsΛ′ is unitary conjugation and hence isometric. Integrating from 0 to t, reversing the orientation for t<0, and using u=∣t−s∣ gives intermediate evolution time t−s=σu. Expanding HΛ′−HΛ therefore yields ∥αtΛ′(A)−αtΛ(A)∥≤1ℏ∫0∣t∣∑Z⊆Λ′Z⊈Λ∥[Φ(Z),ασuΛ(A)]∥ du. Terms with Z∩Λ=∅ commute with ασuΛ(A)∈AΛ and contribute zero; only interaction sets crossing the boundary of Λ remain.

2.1F1F2step 1.1algebra

For each crossing Z, apply [F2] to A and Φ(Z) at the signed time σu. Its bound depends on ∣σu∣=u, so the same positive integrand estimate holds for either sign of t. For any y∈Z∖Λ, choose z∈Z minimizing the distance from X to Z. Since diam⁡∞Z≤R, the triangle inequality gives dist⁡∞(X,{y})≤dist⁡∞(X,Z)+R, so e−μdist⁡∞(X,Z)≤eμRe−μdist⁡∞(X,{y}). Summing over every exterior y overcounts each crossing interaction and therefore gives an upper bound. By the definition of κ, ∑Z⊆Λ′Z⊈ΛZ∩Λ≠∅∥Φ(Z)∥e−μdist⁡∞(X,Z)≤κeμR∑y∉Λe−μdist⁡∞(X,{y}). The displayed inequality is independent of Λ′; integrating the time factor in [F2] over an interval of length ∣t∣ proves the claimed estimate.

3.1givenF1step 2.1algebra∎

For each r≥1, the max-metric shell around one lattice site has (2r+1)d−(2r−1)d sites. A finite union bound over x∈X shows that ∑y∈Zde−μdist⁡∞(X,{y})<∞, since a polynomial shell count is summable against e−μr. Given ε>0, choose a finite set of sites whose omitted tail is below ε; every sufficiently large exhausting Λ contains that finite set. Thus the exterior tail tends to zero, uniformly for ∣t∣≤T after replacing ∣t∣ by T in the prefactor.

Depends on

Dependency tree · 2 levels

Sources