Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Two-dimensional Ising Gibbs coexistence at low temperature

Statement

Assume Countable Choice. For the nearest-neighbor ferromagnetic Ising model on Z2 with coupling J>0, zero field, and βJ≥2, there exist two distinct translation-stationary DLR states μ+ and μ− such that for every site i, μ+(si)≥m∗>0,μ−(si)≤−m∗. One may take m∗=1−2δ(βJ), where δ(K)=43 r4(5−4r)(1−r)2,r=3e−2K. This is a sufficient low-temperature bound; the states are not asserted to be extremal and K=2 is not claimed to be critical.

Facts & Assumptions

Given: A two-dimensional nearest-neighbor Ising model with J>0, h=0, β>0, plus boundary conditions on finite squares, and Countable Choice.

[A1]

Countable Choice is retained exactly for the probability extension and DLR existence steps (The Axiom of Countable Choice (ACω)).

[F1]

If the origin has spin −1 under plus boundary, at least one simple disagreement cycle has the origin in its parity-inside (Square-lattice even graphs and parity contour separation).

[F2]

For each such cycle γ, the event that all its crossed bonds disagree has Gibbs probability at most e−2βJ∣γ∣ (Peierls contour probability bound).

[F3]

Subsequential limits of finite-volume Gibbs laws are DLR, and translation averaging yields a stationary DLR law (Finite-range lattice DLR existence and closed convex state set, Translation-averaged stationary Gibbs state).

[F4]

The exponential is defined by its positive power series, so for x>0, ex=∑n=0∞xn/n! (The real exponential function and the number e by a power series).

[F7]

The nearest-neighbor model is the finite-range interaction with onsite term Φ0(s0)=0 on {0} and pair terms Φk(s0,sek)=−Js0sek on {0,ek} for k=1,2. Its finite conditional kernels are proper and consistent by Conditional Gibbs kernel consistency.

Proof

1.1givenF1construct

Write K=βJ and r=3e−2K. A cycle with the origin in its parity-inside has an odd number of crossings of the positive horizontal ray. Along the full horizontal line, each crossing changes the sign of a dual vertex's y-coordinate; after one closed traversal that sign returns to its starting value, so the total number of crossings is even. Therefore the negative ray also has a crossing. Dual vertices have half-integer coordinates, so positive-ray crossings occur on vertical dual edges at x=j+12 for integers j≥0. If such a cycle has length ℓ, its horizontal coordinate range includes a negative coordinate and this x>0; a closed lattice walk traverses that range in both directions, so it uses at least 2x horizontal edges and x≤ℓ/2. Thus there are at most ℓ+1 possible positive-ray crossing edges. Choose the lower endpoint of each such edge; from it there are at most 4⋅3ℓ−1 nonbacktracking walks of length ℓ, which overcounts the simple cycles using that crossing. Hence there are at most 4(ℓ+1)3ℓ−1 candidate simple cycles of length ℓ.

2.1F1F2F5step 1.1algebra

By [F2] and the union bound, γBn+(s0=−1)≤43∑ℓ≥4(ℓ+1)rℓ=43 r4(5−4r)/(1−r)2=δ(K), using [F5] for 0<r<1.

3.1givenF4F6step 2.1algebra

The first seven nonnegative terms of [F4] give exp⁡(4)>∑n=064n/n!=437/9>48. Since K≥2, monotonicity and reciprocal positivity in [F6] imply r=3exp⁡(−2K)≤3exp⁡(−4)<1/16. Thus δ(K)<43(1/16)4⋅5/(15/16)2<1/2. The same translated contour count applies to every site in the box, so the plus-boundary magnetization there is at least m∗=1−2δ(K)>0.

4.1A1F3F7step 3.1∎

The onsite and nearest-neighbor list in [F7] realizes the stated Hamiltonian, and its specification is proper and consistent. Take a subsequential limit of plus-boundary laws; by [F3] it is DLR and retains μ(si)≥m∗ for each fixed site. The zero-field nearest-neighbor Hamiltonian is invariant under simultaneous spin reversal, so the spin-reversed law is also DLR and has one-site expectations at most −m∗. Translation averaging as in [F3] preserves each bound and yields stationary μ+,μ−. They are distinct because their one-site expectations have opposite signs.

Depends on

Dependency tree · 2 levels

Sources