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

Translation-averaged stationary Gibbs state

Statement

Assume Countable Choice, a translation-invariant finite-range interaction on Zd with finite alphabet, and a nonempty DLR state set. Then there exists at least one translation-stationary DLR state. This assertion does not imply uniqueness or ergodicity.

Facts & Assumptions

Given: A translation-invariant specification with at least one DLR probability measure and the Countable Choice measure framework.

[F1]

Under Countable Choice the DLR set is nonempty, convex and closed under cylinder convergence (Finite-range lattice DLR existence and closed convex state set).

[F2]

Every sequence of probabilities on the finite-alphabet product has a cylinder-convergent subsequence whose limit is a probability; two probabilities agreeing on all cylinders are equal (Finite-alphabet product and probability compactness).

[A1]

Set X=AZd and Bn=[−n,n]d∩Zd. For j∈Zd, define the translation θj:X→X by (θjσ)x=σx+j and its action on measures by push-forward, (θjμ)(C)=μ(θj−1C).

Proof

1.1givenF1A1choose

Choose a DLR state μ. The translated interaction list gives (γΛf)∘θj=γΛ+j(f∘θj) for every bounded measurable f, by reindexing each anchor and each local spin in the finite sums. Hence (θjμ)γΛ(f)=μγΛ+j(f∘θj)=μ(f∘θj)=(θjμ)(f), so every translate is DLR; by convexity in [F1], the cube average μˉn=∣Bn∣−1∑j∈Bnθjμ is DLR.

2.1A1step 1.1algebra

For any fixed shift k=(k1,…,kd)∈Zd and bounded local f, cancellation of terms indexed by Bn∩(Bn+k) gives ∣μˉn(f)−(θkμˉn)(f)∣≤2∥f∥∞∣Bn△(Bn+k)∣/∣Bn∣. For all sufficiently large n, ∣Bn∣=(2n+1)d and ∣Bn∩(Bn+k)∣=∏q=1d(2n+1−∣kq∣), so the ratio equals 2(1−∏q=1d(1−∣kq∣/(2n+1)))→0.

3.1F1F2step 1.1step 2.1∎

By [F2], a subsequence of μˉn converges on cylinders to a probability μˉ; since each average is DLR, closedness in [F1] makes its limit DLR. Step 2.1 passes to this limit for every local f and fixed k, so μˉ and θkμˉ agree on all cylinders; uniqueness of measures on cylinders in [F2] gives θkμˉ=μˉ. Thus μˉ is stationary.

Depends on

Dependency tree · 2 levels

Sources