Skip to content

The Peierls argument: contour sums and the long-range-order criterion

4 fully proved

A. The Peierls series

DefinitionPeierls series#✓fully proved

The Peierls series ∑_ℓ ℓ (2d)^ℓ e^{-2βℓ}.

noncomputable def peierlsBound (d : ℕ) (β : ℝ) : ℝ :=
  ∑' ℓ : ℕ, (ℓ : ℝ) * (2 * d : ℝ) ^ ℓ * Real.exp (-(2 * β) * ℓ)
Used by 8

DefinitionRatio \(2d e^{-2\beta}\) of the Peierls series#✓fully proved

The ratio 2d e^{-2β} of the Peierls series.

noncomputable def peierlsRatio (d : ℕ) (β : ℝ) : ℝ := (2 * d : ℝ) * Real.exp (-(2 * β))
Used by 3

B. The origin spin

DefinitionProbability that the origin spin is minus#✓fully proved

The probability that the origin spin is minus under the box measure with boundary condition η.

noncomputable def probOriginMinus (η : ConfigSpace (Site d)) (n : ℕ)
    (B : Finset (Sym2 (Site d))) (β h : ℝ) : ℝ :=
  ∑ τ : {x // x ∈ box d n} → Bool,
    (if (glue η τ) (origin d) = false then fvProb η n B β h τ else 0)
Uses 6 · Used by 4

C. Long-range order from a contour bound

DefinitionPeierls bound on the probability that the origin is minus#✓fully proved

Under the plus box measure on Λ_n, the origin is minus with probability at most peierlsBound d β.

def PeierlsContourBound (d n : ℕ) (β : ℝ) : Prop :=
  probOriginMinus (plusField d) n (bondFinsetTouch d n) β 0 ≤ peierlsBound d β
Uses 4

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.