Alphabeta Math
Pipeline-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.

Quantitative DLR uniqueness, concentration and spatial response — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

None yet.

5 · Examples, experiments and counterexamples

ExampleConstruction: AI-adaptedVerification: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Nearest-neighbor Ising influence bound

Example

Assume Countable Choice: every countable family of nonempty sets has a choice function. Let d≥1, let X={−1,+1}Zd with its cylinder-generated Borel σ-algebra, fix β>0 and J∈R, and let h=(hi)i∈Zd∈RZd be a site field. For i,j∈Zd, put Jij=J if ∥i−j∥1=1 and Jij=0 otherwise. For a finite Λ⊂Zd and exterior configuration η∈{−1,+1}Λc, write σ^i=σi for i∈Λ and σ^i=ηi otherwise, and define

HΛh(σΛ∣η):=−∑{i,j}⊂Zd:∥i−j∥1=1, {i,j}∩Λ≠∅Jσ^iσ^j−∑i∈Λhiσi.

The pair sum is over unordered pairs and is finite because each site has 2d nearest neighbors. For bounded measurable f:X→R, set

ZΛh,η:=∑τ∈{−1,+1}Λe−βHΛh(τ∣η),γΛh(f∣η):=(ZΛh,η)−1∑τ∈{−1,+1}Λf(τη)e−βHΛh(τ∣η).

Here τη denotes the configuration equal to τ on Λ and to η on Λc.

For each field h, these kernels are positive normalized probability kernels. They are proper, meaning that they leave every event determined by the exterior spins fixed; consistent, meaning γΛhγΔh=γΛh whenever finite Δ⊆Λ; and finite range, meaning that for every finite Δ and cylinder event A, η↦γΔh(1A∣η) depends on only finitely many exterior coordinates.

For i≠j, write γih(⋅∣η):=γ{i}h(⋅∣η) for the one-site law and define the influence coefficient

cijh:=sup⁡η,η′: ηk=ηk′ (k≠j)12∑s∈{−1,+1}∣γih(s∣η)−γih(s∣η′)∣,ciih:=0.

Then cijh≤tanh⁡(β∣J∣) when ∥i−j∥1=1 and cijh=0 otherwise. Consequently, if

2dtanh⁡(β∣J∣)<1,

then every influence row sum is strictly below 1. More generally, if 2dtanh⁡(β∣J∣)<1, then for any two site fields h,h~∈RZd with the same d,β,J, the matrix C defined by Cij=tanh⁡(β∣J∣) when ∥i−j∥1=1 and Cij=0 otherwise is a common finite-range influence envelope with row sums below 1. Thus, under this inequality, the finite-volume comparison estimate of the Dobrushin comparison theorem applies to γh and γh~. This is a sufficient criterion; failure of the inequality is not claimed to imply nonuniqueness.

Facts & Assumptions

Given: Countable Choice, the nearest-neighbor Ising couplings, and one or two site fields as specified in the Statement.

[A1]

Countable Choice means that every countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[F1]

For the finite-range Ising conditional energy, changing only boundary spin j changes the one-site law at i by at most tanh⁡(β∣Jij∣) in half-total-variation distance; it gives zero influence when Jij=0 (Ising influence bounded by hyperbolic tangent).

[F2]

Under Countable Choice, proper consistent finite-range specifications on a finite-alphabet lattice with a uniform finite one-site influence radius and a common nonnegative finite-range influence envelope of supremum row sum below 1 satisfy the finite-volume Dobrushin comparison estimate; each also has a unique DLR state and the stated infinite-volume comparison estimate (Finite-spin Dobrushin comparison and boundary response).

Verification

1.1givenalgebra

For finite Λ, the pair sum has at most 2d∣Λ∣ terms meeting Λ, and the field sum is finite, so every energy is real and the finite partition sum is strictly positive. The kernel is normalized by its definition. For every Borel event, each replacement map η↦τη is measurable, so the kernel probability is measurable; replacing spins in Λ leaves every exterior-measurable event fixed. For a cylinder event, its kernel probability depends only on its finite support outside Λ and the finitely many exterior neighbors of Λ, so it has finite range.

1.2givenF1algebra

For each site i, exactly 2d sites j satisfy ∥i−j∥1=1. By [F1], each corresponding influence coefficient is at most tanh⁡(β∣J∣), while every other coefficient vanishes. Therefore ∑jcijh≤2dtanh⁡(β∣J∣) for every i.

2.1givenstep 1.1algebra

If finite Δ⊆Λ, split HΛh(σΛ∣η) into the pair terms whose support meets Δ and field terms on Δ, which equal HΔh(σΔ∣σΛ∖Δη), and the remaining terms K(σΛ∖Δ,η), which do not depend on σΔ. Hence ZΛh,η=∑ξ∈{−1,+1}Λ∖Δe−βK(ξ,η)ZΔh,ξη, and γΛh(γΔhf∣η)=1ZΛh,η∑ξ∈{−1,+1}Λ∖Δe−βK(ξ,η)∑τ∈{−1,+1}Δf(τξη)e−βHΔh(τ∣ξη)=γΛh(f∣η). Thus the kernels form the stated proper, consistent, finite-range specification.

3.1givenA1F1F2step 1.1step 1.2step 2.1algebra∎

If 2dtanh⁡(β∣J∣)<1, the matrix C in the Statement dominates the influence matrices of both γh and γh~, has radius 1 in the ℓ∞ metric, and has row sums below 1. The constructed specifications are proper, consistent, and finite range by steps 1.1–1.2. By Countable Choice and [F2], the hypotheses of the comparison theorem hold and its finite-volume comparison estimate applies. The inequality is only sufficient; failure of the bound is not claimed to imply nonuniqueness.

Sources