Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

Summability and convolution control for lattice weights

Statement

Let d≥1, Γ=Zd, and d∞ be the max-coordinate metric. For F(r)=(1+r)−d−1, Fa(r)=e−arF(r) with a>0, and Fρ(r)=(1+r)−ρ with ρ>d, each weight G∈{F,Fa,Fρ} is summable on Γ. Its convolution constant

CG:=sup⁡x,y∈Γ∑z∈ΓG(d∞(x,z))G(d∞(z,y))G(d∞(x,y)),

where CF uses this same formula with the base weight F=Fd+1. Each such constant is finite and positive. In particular, for all x,y∈Γ,

∑z∈ΓG(d∞(x,z))G(d∞(z,y))≤CG G(d∞(x,y)).

The constant CFa may be taken to be the convolution constant CF of F, independently of a.

Facts & Assumptions

Given: d≥1, Γ=Zd, the metric d∞, and the weights F,Fa,Fρ as stated.

[F1]

Local spin matrix algebras and their factor inclusions: d∞(x,y)=max⁡1≤j≤d∣xj−yj∣, and the site set is Zd.

[F2]

Weighted interactions and gapped finite-volume paths: F(r)=(1+r)−d−1, Fa(r)=e−arF(r), and Fρ(r)=(1+r)−ρ.

Proof

Given: [F1], [F2], a>0, and ρ>d.

1.1givenF1F2algebra

For k≥1, the d∞-shell of radius k has (2k+1)d−(2k−1)d≤cd(k+1)d−1 sites, by factoring the difference of powers; the radius-zero shell has one site. Therefore ∑zFρ(d∞(x,z))≤cd∑k≥0(k+1)d−1−ρ<∞, and ∑zFa(d∞(x,z))≤∑zF(d∞(x,z))<∞. The bounds are independent of x by translation invariance.

2.1givenstep 1.1algebra∎

Write r=d∞(x,y). For G=Fρ, the triangle inequality places every z in at least one of the sets d∞(x,z)≥r/2 or d∞(z,y)≥r/2. On the first set, G(d∞(x,z))≤2ρG(r); summing the other factor over all z is bounded by the finite shell sum in step 1.1. The second set gives the same bound with x,y exchanged. Hence CFρ≤2ρ+1∑zFρ(d∞(0,z))<∞. For Fa, the triangle inequality gives e−a(d(x,z)+d(z,y))≤e−ar; the same splitting argument applied to F=Fd+1, for which d+1>d, yields CF<∞, and then ∑zFa(d(x,z))Fa(d(z,y))≤CFFa(r). Positivity of each weight and the z=x summand show CG>0.

Depends on

Dependency tree · 2 levels

Sources