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

Exponential mode sums for the periodic photon box

Statement

Let L,β,ℏ,c>0 be real parameters, set a=2πℏc/L, and for n∈Z3∖{0} define ϵn=a∣n∣,qn=e−βϵn, where ∣⋅∣ is the Euclidean norm. For j≥1, the integer max-norm shell {n∈Z3:∣n∣∞=j} has 24j2+2 points. Consequently sup⁡n≠0qn=e−βa<1,∑n≠0qn<∞,∑n≠0ϵnpqn<∞ for every integer p≥0. In particular, the positive mode-energy sum ∑n≠0ϵneβϵn−1 is finite. Repeating each mode twice for two polarization labels preserves all these conclusions.

Facts & Assumptions

Given: L,β,ℏ,c>0, the periodic wavevector labels n∈Z3∖{0}, and the mode energies and weights in the Statement.

[A1]

All sums are ordinary nonnegative series over the stated countable lattice; no physical interpretation of the positive parameters is required.

Proof

1.1givenA1algebra

The number of integer vectors with ∣n∣∞=j is (2j+1)3−(2j−1)3=24j2+2. On this shell j≤∣n∣≤3j, so qn≤e−βaj and ϵnpqn≤(a3)pjpe−βaj. The shell contributions are bounded by Cpjp+2e−βaj for a finite constant Cp; the ratio of consecutive terms tends to e−βa<1, so their series converges.

2.1givenstep 1.1algebra

Since ∣n∣≥1 on the nonzero lattice and equality occurs, sup⁡qn=e−βa<1; the p=0 case of step 1.1 gives ∑qn<∞, and each p≥0 gives the asserted energy-weighted sum.

3.1step 1.1step 2.1algebra∎

For every n≠0, ϵn/(eβϵn−1)=ϵnqn/(1−qn)≤(1−e−βa)−1ϵnqn. Summing and applying step 1.1 with p=1 proves finiteness; a second polarization multiplies each nonnegative sum by two.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources