Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Power tempering bounds interactions between separated cubes

Statement

Let d be a positive integer and let ϕ be power-tempered as in Stable power-tempered pair-potential model, with constants C,R,ϵ>0. Define Sd,ϵ:=∑m=1∞((2m+1)d−(2m−1)d)m−d−ϵ,∥k∥∞:=max⁡1≤r≤d∣kr∣(k∈Zd). This nonnegative series, defined by Series in the nonnegative extended real line, groups the lattice terms by shells ∥k∥∞=m. Then Sd,ϵ<∞. Let ℓ>0, g≥R, and let J⊂Zd be finite with M=∣J∣. Let n be a nonnegative integer. For each j∈J, choose an integer nj with 0≤nj≤n and positions qj,s∈Cj:=(ℓ+g)j+[0,ℓ]d for 1≤s≤nj; positions are counted with their labels, even if some coincide. The total absolute inter-cube energy, defined by the following finite sum (empty sums are zero), satisfies ∑j,j′∈Jj<j′  ∑s=1nj∑t=1nj′∣ϕ(qj,s−qj′,t)∣≤C2Mn2Sd,ϵg−d−ϵ. Here j<j′ means any fixed total ordering of the finite set J; each unordered pair of cubes is counted once.

Facts & Assumptions

Given: d a positive integer, power-tempering constants C,R,ϵ>0, ℓ>0, g≥R, a finite index set J⊂Zd, a nonnegative integer n, and the labelled finite position families specified in the Statement.

[F1]

Stable power-tempered pair-potential model: for ∥x∥2≥R, ϕ(x)∈R and its real absolute value satisfies ∣ϕ(x)∣≤C∥x∥2−d−ϵ.

[F2]

Series in the nonnegative extended real line defines a nonnegative series as the supremum of its partial sums; The p-series for a real exponent p converges exactly when p is greater than one proves ∑m≥1m−p<∞ for every real p>1.

[F3]

The integers as equivalence classes of pairs of naturals supplies the integer lattice. For an integer m≥1, the lattice box {k:∥k∥∞≤m} has (2m+1)d points because each of the d coordinates has 2m+1 independent choices. Subtracting the box of radius m−1 gives shell count (2m+1)d−(2m−1)d.

Proof

1.1givenalgebra

Let m=∥j−j′∥∞≥1 for two distinct cube indices. In a coordinate where the index difference is m, the nearest points of the two intervals are separated by m(ℓ+g)−ℓ=(m−1)ℓ+mg≥mg. Hence every pair of points in Cj,Cj′ has Euclidean distance at least mg.

1.2F2F3algebra

For m≥1, [F3] gives the shell count. Use xd−yd=(x−y)∑r=0d−1xd−1−ryr with x=2m+1, y=2m−1. Since 2m+1≤3m, it yields (2m+1)d−(2m−1)d≤2d(3m)d−1=2d3d−1md−1. Therefore Sd,ϵ≤2d3d−1∑m≥1m−1−ϵ<∞ by [F2], since 1+ϵ>1.

2.1F1step 1.1algebra

By [F1] and step 1.1, each such pair contributes at most C(mg)−d−ϵ in absolute value, because mg≥g≥R and the Euclidean norm dominates the absolute value of any coordinate.

3.1F2F3step 1.2step 2.1algebra∎

Fix j∈J. For each j′≠j, there are at most njnj′≤n2 labelled pairs of positions from Cj and Cj′. Summing the bound from step 2.1 over those pairs and enlarging the finite set of index differences to all nonzero lattice vectors gives at most Cn2Sd,ϵg−d−ϵ, since [F3] groups those vectors into the shells whose counts define Sd,ϵ, and [F2] defines its nonnegative sum. Summing this bound over all M cubes counts each unordered cube pair twice, so dividing by 2 gives the claimed inequality.

Depends on

Dependency tree · 2 levels

Sources