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.

Conditional Gibbs kernel consistency

Statement

Assume the finite-alphabet product-measure convention and conditional Gibbs formula of Lattice Gibbs kernels and DLR states, a finite-range interaction, and β>0. For every finite Λ and exterior η, the displayed partition ZΛη is finite and strictly positive, the formula γΛ(⋅∣η) defines a measurable proper probability kernel, and the family satisfies γΛγΔ=γΛ whenever finite Δ⊆Λ.

Facts & Assumptions

Given: The finite-range interaction, β>0, and the conditional Gibbs formula and operator convention of Lattice Gibbs kernels and DLR states.

[F1]

The finite Gibbs variational identity defines the strictly positive normalized finite-volume law whenever the finite state set is nonempty and the energies are real (Finite Gibbs relative entropy and free-energy minimum).

[F2]

The candidate kernel, specification terminology, and finite-range locality condition are defined in Lattice Gibbs kernels and DLR states.

Proof

1.1givenF1algebra

For fixed finite Λ, only finitely many translated interaction supports meet it, so every EΛ(τ∣η) is a finite real number and AΛ is finite nonempty. Thus ZΛη is a positive finite sum and [F1] supplies its normalized probability weights.

2.1F2step 1.1algebra

For Δ⊆Λ, split the terms meeting Λ into those meeting Δ and those disjoint from Δ. The second sum is independent of τΔ, so EΛ(τΛ∣η)=EΔ(τΔ∣τΛ∖Δη)+C(τΛ∖Δ,η). Consequently ZΛη=∑ξ∈AΛ∖Δe−βC(ξ,η)ZΔξη. In (γΛγΔf)(η), first sum over the γΛ spin assignment on Δ while holding ξ=τΛ∖Δ fixed. Its weights sum to ZΔξη, which cancels the denominator in γΔ(f∣ξη). The remaining sum is ZΛ−1∑ξ∈AΛ∖Δe−βC(ξ,η)∑ζ∈AΔf(ζξη)e−βEΔ(ζ∣ξη), which is exactly γΛf(η) by reindexing (ζ,ξ) as a configuration on Λ. The factor e−βC remains; it does not cancel by itself.

2.2F2step 1.1algebra

Each replacement map η↦τΛη is continuous in the product topology, and each weight depends on finitely many boundary coordinates; finite sums therefore make γΛ(f∣η) measurable for bounded measurable f. When f=1C for a cylinder event C, its value additionally depends only on the finitely many coordinates specified by C, so the resulting function of η depends on finitely many coordinates. For an exterior event D⊆AΛc measurable in the exterior cylinder sigma-algebra, let B={σ∈X:σ∣Λc∈D}. Then 1B(τΛη)=1D(η) for every local assignment, so γΛ(1B∣η)=1D(η); this is properness. Whenever a kernel is integrated against a probability on X or composed with another kernel, its exterior argument is the restriction of that global configuration to the relevant complement.

3.1step 1.1step 2.2step 2.1∎

Steps 1.1, 2.2 and 2.1 prove normalization, measurability, properness and consistency, so the candidate family is a specification.

Depends on

Dependency tree · 2 levels

Sources