Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Stationary lattice entropy and energy densities

Statement

Assume Countable Choice and let A be finite nonempty. A consistent translation-stationary family means probability measures νF on AF for every finite F⊂Zd, with νE=(πEF)∗νF whenever E⊆F and νF+j=(τj)∗νF for every j∈Zd, where (πEFx)=x∣E and (τjx)i+j=xi. This family extends to a unique translation-stationary probability μ on the cylinder sigma-algebra. Set Bn=[−n,n]d∩Zd for each integer n≥1. For any such stationary μ and any bounded translation-invariant finite-range interaction (R,(Sr,Φr)r∈R) as in Finite-range lattice interaction and conditional energy, define Hn=−∑σ∈ABnμBn(σ)log⁡μBn(σ) with 0log⁡0=0, and u(μ)=∑r∈R∑a∈ASrμ(σ∣Sr=a)Φr(a). Then h(μ)=lim⁡n→∞Hn∣Bn∣=inf⁡ℓ≥1Hℓ∣Bℓ∣ exists in [0,log⁡∣A∣], and the free-boundary interaction-energy density satisfies lim⁡n→∞Eμ[HBnfree]∣Bn∣=u(μ).

Facts & Assumptions

Given: A finite alphabet lattice, a bounded translation-invariant finite-range interaction, Countable Choice, and a consistent stationary family of finite-dimensional probabilities.

[A1]

Countable Choice and cylinder extension give a unique probability measure from a consistent family of finite-dimensional probabilities (Finite-alphabet product and probability compactness).

[F1]

The finite Gibbs variational identity implies nonnegative relative entropy on each finite state set (Finite Gibbs relative entropy and free-energy minimum).

Proof

1.1givenA1

Apply [A1] to the consistent stationary cylinder probabilities. The extension is unique; translating it leaves the same cylinder values, so uniqueness makes the resulting measure μ stationary.

1.2F1algebra

For finite random vectors X,Y, nonnegative relative entropy of their joint law relative to the product of its marginals gives H(X,Y)≤H(X)+H(Y). If the product law has zeros, restrict to its support; the joint law is supported there, and [F1] applies on that finite support. For any single-site law q on A, applying [F1] with zero energy and the uniform Gibbs law gives D(q∥unifA)=log⁡∣A∣−H(q)≥0, so H(q)≤log⁡∣A∣.

2.1givenstep 1.2algebra

Tile a large cube Bn by disjoint translates of Bℓ and leftover sites. By stationarity, each full block has entropy Hℓ; each leftover site contributes at most log⁡∣A∣. Repeated subadditivity from step 1.2 gives Hn≤mnHℓ+∣Rn∣log⁡∣A∣, with mn∣Bℓ∣/∣Bn∣→1 and ∣Rn∣/∣Bn∣→0 for fixed ℓ. Thus lim sup⁡Hn/∣Bn∣≤Hℓ/∣Bℓ∣ for every ℓ. Since the infimum is no larger than any ratio, the liminf is at least the infimum, proving the stated limit formula.

3.1A1givenalgebra∎

For each interaction type r, the number of anchors with x+Sr⊆Bn, divided by ∣Bn∣, tends to 1 because Sr is finite. Stationarity gives expectation EμΦr for each included translate, so summing the finite interaction list and taking the limit yields u(μ). Nonnegativity and the bound Hn≤∣Bn∣log⁡∣A∣ give 0≤h(μ)≤log⁡∣A∣.

Depends on

Dependency tree · 2 levels

Sources