Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Lattice Gibbs kernels and DLR states

Definition

Assume Countable Choice for the product-measure extension framework of The Axiom of Countable Choice (ACω) and Finite-alphabet product and probability compactness. Work in the finite-alphabet configuration space X=AZd with its cylinder-generated Borel sigma-algebra. Let the finite-range interaction and its conditional energy be as in Finite-range lattice interaction and conditional energy, and fix β>0. For a finite Λ⊂Zd and exterior configuration η∈AΛc, put ZΛη=∑τ∈AΛe−βEΛ(τ∣η),γΛ(f∣η)=∑τ∈AΛf(τη)e−βEΛ(τ∣η)ZΛη for bounded measurable f:X→R. Here γΛf denotes the function η↦γΛ(f∣η), composition is operator composition, and μγΛ(f)=∫γΛ(f∣η) dμ(η). A proper kernel leaves every exterior-measurable event fixed. A specification is a family (γΛ)Λ finite of proper probability kernels satisfying γΛγΔ=γΛ whenever Δ⊆Λ. A DLR state is a probability measure μ on X satisfying μγΛ=μ for every finite Λ.

For the existence and uniqueness results below, a specification has finite range when for every finite Δ and every cylinder event C the function η↦γΔ(1C∣η) depends on only finitely many coordinates of η. The displayed finite-range Gibbs formula has this property because only finitely many interaction terms meet Δ, and a cylinder indicator depends on only finitely many additional coordinates.

The formula is the candidate Gibbs specification; Conditional Gibbs kernel consistency ↗ establishes its positive finite normalization, measurability, properness and consistency under the stated hypotheses. The Countable Choice assumption is used for the product-measure construction, not for any finite conditional sum.

Depends on

Dependency tree · 2 levels

Sources