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 be finite nonempty. A consistent translation-stationary family means probability measures on for every finite , with whenever and for every , where and . This family extends to a unique translation-stationary probability on the cylinder sigma-algebra. Set for each integer . For any such stationary and any bounded translation-invariant finite-range interaction as in Finite-range lattice interaction and conditional energy, define with , and . Then exists in , and the free-boundary interaction-energy density satisfies
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.
Countable Choice and cylinder extension give a unique probability measure from a consistent family of finite-dimensional probabilities (Finite-alphabet product and probability compactness).
The finite Gibbs variational identity implies nonnegative relative entropy on each finite state set (Finite Gibbs relative entropy and free-energy minimum).
Proof
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.
For finite random vectors , nonnegative relative entropy of their joint law relative to the product of its marginals gives . 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 on , applying [F1] with zero energy and the uniform Gibbs law gives , so .
Tile a large cube by disjoint translates of and leftover sites. By stationarity, each full block has entropy ; each leftover site contributes at most . Repeated subadditivity from step 1.2 gives , with and for fixed . Thus for every . Since the infimum is no larger than any ratio, the liminf is at least the infimum, proving the stated limit formula.
For each interaction type , the number of anchors with , divided by , tends to because is finite. Stationarity gives expectation for each included translate, so summing the finite interaction list and taking the limit yields . Nonnegativity and the bound give .