Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Cylinder convergence is weak convergence on a finite-spin product

Statement

Let d≥1, let S be a finite nonempty set with a fixed total order, and fix a bijective enumeration x1,x2,… of Zd. Put Ω=SZd, give it the product topology, and let its cylinder sigma-algebra be generated by finite-coordinate assignments. Then the product topology is induced by ρ(σ,η)=∑k=1∞2−k1{σxk≠ηxk}, Ω is compact, and its Borel sigma-algebra equals the cylinder sigma-algebra. For probability measures μn,μ on this sigma-algebra, convergence of every finite-coordinate marginal is equivalent to weak convergence, where weak convergence means convergence of integrals of every bounded continuous real function on Ω.

Facts & Assumptions

Given: The finite alphabet, site enumeration, product space, cylinder sigma-algebra and local weak convergence convention in the Statement.

[F1]

Finite-spin product and local topologies: local weak convergence means convergence of every finite-coordinate marginal, equivalently every cylinder probability.

[F2]

In the product topology a basic neighborhood fixes the spins on finitely many sites; every cylinder determined by a single finite assignment is both open and closed.

Proof

1.1givenalgebra

If σ≠η, some coordinate differs, so ρ(σ,η)>0; symmetry is immediate, and the coordinatewise triangle inequality gives the triangle inequality after summing. If two configurations agree on x1,…,xN, then ρ≤∑k>N2−k=2−N. Conversely, if ρ(σ,η)<2−N, no coordinate among x1,…,xN differs, because a mismatch at xk contributes at least 2−N. These bounds show that metric balls and finite-coordinate basic neighborhoods generate the same topology.

1.2givenF1F2

If μn→locμ, every cylinder indicator is bounded and continuous by [F2], so its integrals converge. Every bounded function depending on finitely many coordinates is a finite linear combination of cylinder indicators, and its integrals therefore converge as well.

2.1givenF2step 1.1construct

Suppose an open cover of Ω has no finite subcover. Let C0=Ω. Recursively, if CN−1 is the cylinder fixing the first N−1 spins and has no finite subcover, its finitely many children obtained by assigning σxN=s cannot all have finite subcovers; otherwise their finite union would cover CN−1. Choose the least s in the fixed order whose child still has no finite subcover and call that child CN. These nested cylinders determine a configuration σ. A cover member containing σ contains a basic neighborhood fixing finitely many sites; for sufficiently large N, CN lies inside that neighborhood and hence has a one-member subcover, a contradiction. Thus every open cover has a finite subcover and Ω is compact.

2.2givenF2step 1.1

Each cylinder is clopen by [F2], and cylinders form a countable basis: Zd has countably many finite subsets, and each finite coordinate set has finitely many spin assignments. Therefore every open set is a countable union of cylinders and belongs to the cylinder sigma-algebra, while every cylinder is Borel. Hence the two sigma-algebras are equal.

3.1givenF2step 2.1construct

Fix a bounded continuous g:Ω→R and ε>0. For each σ, continuity and the cylinder basis give a cylinder neighborhood Cσ of σ on which ∣g(η)−g(σ)∣<ε/3. Compactness from step 2.1 gives a finite subcover C1,…,Cr. Let F be the union of the finitely many coordinate sets fixed by these cylinders. If η,ζ agree on F, choose a Ci containing η; because Ci depends only on a subset of F, it also contains ζ, so ∣g(η)−g(ζ)∣<2ε/3. Choose N with F⊆{x1,…,xN} and fix one default spin s0∈S. Replace all coordinates after xN by s0 to define a canonical extension σ^ of each first-N prefix, and set gN(σ)=g(σ^). Then gN depends only on the first N coordinates and sup⁡σ∣g(σ)−gN(σ)∣<ε.

4.1givenF1F2step 1.2step 3.1∎

For every n, ∣∫g dμn−∫gN dμn∣≤ε and the same bound holds for μ. Step 1.2 gives ∫gN dμn→∫gN dμ, so the limit superior of ∣∫g dμn−∫g dμ∣ is at most 2ε. Since ε>0 is arbitrary, weak convergence follows. Conversely, if μn converges weakly, indicators of all cylinders are bounded continuous by [F2], so their probabilities converge; finite sums give every finite marginal, hence local weak convergence by [F1].

Depends on

Dependency tree · 2 levels

Sources