Alphabeta Math
TheoremStatement: 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.

Finite-range Dobrushin uniqueness and boundary influence

Statement

Assume Countable Choice, d≥1, a finite nonempty alphabet A, and a proper, consistent finite-range specification γ on X=AZd with its cylinder-generated Borel σ-algebra, using Lattice Gibbs kernels and DLR states. Here consistency means γΛγΔ=γΛ for finite Δ⊆Λ, properness means γΛ(rΛ−1(D)∣η)=1D(η) for each exterior-measurable event D⊆AΛc and η∈AΛc, where rΛ:X→AΛc is coordinate restriction; in compositions and integrals against measures on X, every kernel takes the appropriate exterior restriction of the global configuration as its argument, and finite range means each γΔ(1C∣⋅) for finite Δ and cylinder event C depends on only finitely many exterior coordinates. Also assume a uniform finite integer radius R≥0 such that each one-site kernel γ{i} depends only on exterior spins j with ∥i−j∥∞≤R. For each pair of sites define cij as the supremum of the half-total-variation change in the one-site conditional law at i when only exterior spin j is changed, where half-total variation for probability vectors p,q on A is 12∑a∈A∣p(a)−q(a)∣, and set cii=0. If c=sup⁡i∑jcij<1, then the DLR state is unique. Moreover, for a finite region Λ and two exterior conditions ξ,ζ, couple the random-scan finite-volume heat-bath chains by choosing the same uniformly random site and using a maximal coupling of its two single-site conditional laws. A stationary joint law of this pair chain exists. If the distance dist⁡∞(i,Λc):=inf⁡j∉Λ∥i−j∥∞ is at least r(R+1) for a nonnegative integer r, then its disagreement probability at i is at most cr/(1−c). Consequently every local conditional expectation becomes uniformly insensitive to boundary conditions as Λ↑Zd.

Facts & Assumptions

Given: The proper consistent finite-alphabet specification, the uniform single-site locality radius R, the half-total-variation influence matrix (cij), the strict row-sum bound c<1, and Countable Choice.

[A1]

Countable Choice is used for the DLR existence and product-measure extension inputs (The Axiom of Countable Choice (ACω)).

[F1]

For any two probability vectors on a finite alphabet there is a coupling whose disagreement probability equals their half-total-variation distance (Finite maximal coupling and heat-bath stationary law).

[F2]

A DLR state exists under Countable Choice for a proper consistent finite-range finite-alphabet specification (Finite-range lattice DLR existence and closed convex state set).

[F3]

By the stated uniform locality radius, cij=0 whenever ∥i−j∥∞>R.

[F4]

Every bounded real sequence has a convergent subsequence (Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence).

[F5]

For 0≤c<1 and integer r≥0, the geometric tail satisfies ∑k≥rck=cr/(1−c) (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges).

Proof

1.1given

Fix a finite Λ and an exterior condition ξ. On AΛ, define the random-scan heat-bath chain that chooses one site uniformly and resamples it from γ{i}(⋅∣xΛ∖{i}ξ). Properness and consistency imply that the finite-volume law γΛ(⋅∣ξ) is stationary for this chain: applying a one-site kernel to it leaves it unchanged by γΛγ{i}=γΛ.

1.2givenF1F4algebra

Any two stationary laws for the same-boundary chain have a stationary coupling: start with any coupling of them, evolve the pair using a common random site and the maximal coupling [F1], and take a convergent subsequence of Cesàro averages using [F4]. The marginals remain the given stationary laws. If qi is the stationary disagreement probability, then stationarity makes it equal to the mismatch probability on updating i. Telescoping the one-site conditional laws over the finitely many differing internal spins gives qi≤∑j∈Λcijqj. Therefore max⁡iqi≤cmax⁡iqi, so all qi=0. Thus the finite-volume Gibbs law is the unique stationary law; this proof needs no positivity assumption on the one-site conditionals.

2.1F1F4step 1.1

For two boundary conditions ξ,ζ, start the pair chain at the product of the two finite-volume Gibbs laws and use common-site maximal updates. Its marginal laws remain stationary by step 1.1; Cesàro averaging and [F4] therefore give a stationary coupling whose marginals are those Gibbs laws. For a current pair X,Y, telescoping the differing internal and exterior spins one at a time bounds the update mismatch at site i by ∑j∈Λcij1{Xj≠Yj}+bi, where bi=∑j∉Λcij1{ξj≠ζj}. Under the stationary coupling, if qi=Pr⁡(Xi≠Yi), random-scan stationarity gives qi equal to the mismatch probability on updating i, hence qi≤∑j∈Λcijqj+bi. For Λ=∅ there are no coordinates to bound.

3.1givenF3F5step 2.1algebra

Let CΛ=(cij)i,j∈Λ. Iterating the inequality in step 2.1 gives q≤CΛn1+∑k=0n−1CΛkb. Every row sum of CΛ is at most c<1, so ∥CΛn1∥∞≤cn→0. A nonzero term of (CΛkb)i is an influence path of k internal edges followed by one edge to the exterior; each edge changes ℓ∞-distance by at most R by [F3]. For R≥1 and dist⁡∞(i,Λc)≥r(R+1), such a path has at least r+1 edges, hence k≥r. Since 0≤bi≤c<1, its total weight is bounded by ∑k≥rck=cr/(1−c) by [F5]. If R=0, all off-diagonal influences vanish and the boundary term is zero, so the same bound holds.

4.1step 3.1algebra

For a bounded local f, let δi(f) be its maximum change when only spin i changes. Coordinate-by-coordinate coupling gives ∣γΛ(f∣ξ)−γΛ(f∣ζ)∣≤∑i∈supp⁡fδi(f)qi. Step 3.1 makes this bound tend to zero uniformly over the boundary conditions as Λ exhausts the lattice.

5.1A1F2step 4.1∎

Let μ,ν be DLR states, which exist by [F2]. Integrate the uniform boundary difference from step 4.1 against μ(dξ)ν(dζ); using μγΛ=μ and νγΛ=ν gives μ(f)=ν(f) for every bounded local f. Cylinder indicators are local, so the measures agree on a generating family and hence are equal.

Depends on

Dependency tree · 2 levels

Sources