DLR states of the Ising model
DefinitionMeasurable increasing events of the configuration space#✓fully proved
The measurable increasing events of the configuration space.
def upMeasSystem (E : Type*) : Set (Set (ConfigSpace E)) :=
{A | MeasurableSet A ∧ IsUpperSet A}
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1
DefinitionWeighted mixture of two measures#✓fully proved
The mixture a μ⁻ + b μ⁺ of two measures.
noncomputable def gibbsMix (a b : ℝ≥0∞) (μm μp : Measure (ConfigSpace E)) :
Measure (ConfigSpace E) :=
a • μm + b • μp
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1
DefinitionBox \((-n, n)^d\) as a finite set of sites#✓fully proved
The box Λ_n = [-n, n]^d as a finite set of sites.
noncomputable def boxFinset (d n : ℕ) : Finset (Site d) :=
(box_finite d n).toFinset
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
theorem box_finite (d n : ℕ) : (box d n).Finite
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:91
Uses 2 · Used by 27
DefinitionOrdered nearest-neighbour pairs touching the box#✓fully proved
Ordered nearest-neighbour pairs with at least one endpoint in Λ_n.
noncomputable def bondPairsTouch (d n : ℕ) : Finset (Site d × Site d) :=
((boxFinset d (n + 1)) ×ˢ (boxFinset d (n + 1))).filter
(fun p => (hypercubicLattice d).Adj p.1 p.2 ∧ (p.1 ∈ box d n ∨ p.2 ∈ box d n))
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def boxFinset (d n : ℕ) : Finset (Site d) :=
(box_finite d n).toFinset
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:88
def hypercubicLattice (d : ℕ) : SimpleGraph (Site d) where
Adj := NearestNeighbour d
symm := ⟨fun _ _ h => nearestNeighbour_symm d h⟩
loopless := nearestNeighbour_irrefl d
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:76
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
Uses 4 · Used by 18
DefinitionOrdered nearest-neighbour pairs inside the box#✓fully proved
Ordered nearest-neighbour pairs with both endpoints in Λ_n.
noncomputable def bondPairsInternal (d n : ℕ) : Finset (Site d × Site d) :=
((boxFinset d n) ×ˢ (boxFinset d n)).filter
(fun p => (hypercubicLattice d).Adj p.1 p.2)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def boxFinset (d n : ℕ) : Finset (Site d) :=
(box_finite d n).toFinset
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:88
def hypercubicLattice (d : ℕ) : SimpleGraph (Site d) where
Adj := NearestNeighbour d
symm := ⟨fun _ _ h => nearestNeighbour_symm d h⟩
loopless := nearestNeighbour_irrefl d
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:76
Uses 3 · Used by 2
DefinitionBonds touching the box#✓fully proved
The bonds with at least one endpoint in Λ_n (used for plus and minus boundary conditions).
noncomputable def bondFinsetTouch (d n : ℕ) : Finset (Sym2 (Site d)) :=
(bondPairsTouch d n).image (fun p => s(p.1, p.2))
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def bondPairsTouch (d n : ℕ) : Finset (Site d × Site d) :=
((boxFinset d (n + 1)) ×ˢ (boxFinset d (n + 1))).filter
(fun p => (hypercubicLattice d).Adj p.1 p.2 ∧ (p.1 ∈ box d n ∨ p.2 ∈ box d n))
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:104
Uses 2 · Used by 41
DefinitionBonds inside the box#✓fully proved
The bonds with both endpoints in Λ_n (used for the free boundary condition).
noncomputable def bondFinsetInternal (d n : ℕ) : Finset (Sym2 (Site d)) :=
(bondPairsInternal d n).image (fun p => s(p.1, p.2))
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def bondPairsInternal (d n : ℕ) : Finset (Site d × Site d) :=
((boxFinset d n) ×ˢ (boxFinset d n)).filter
(fun p => (hypercubicLattice d).Adj p.1 p.2)
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:109
Uses 2 · Used by 3
DefinitionConfiguration glued from inside spins and a boundary condition#✓fully proved
The configuration equal to τ inside the box Λ_n and to the boundary condition η
outside.
noncomputable def glue (η : ConfigSpace (Site d)) {n : ℕ}
(τ : {x // x ∈ box d n} → Bool) : ConfigSpace (Site d) :=
fun x => if h : x ∈ box d n then τ ⟨x, h⟩ else η x
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
Uses 3 · Used by 33
DefinitionBox energy with a boundary condition#✓fully proved
The box energy -∑_{e ∈ B} σ_e - h ∑_{x ∈ Λ_n} σ_x of the configuration glue η τ.
noncomputable def fvEnergy (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (h : ℝ) (τ : {x // x ∈ box d n} → Bool) : ℝ :=
- (∑ e ∈ B, bond (glue η τ) e) - h * ∑ x ∈ boxFinset d n, spin (glue η τ) x
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
def bond (s : ConfigSpace V) (e : Sym2 V) : ℝ :=
Sym2.lift ⟨fun x y => spin s x * spin s y, fun _ _ => mul_comm _ _⟩ e
PhyslibExt/CondensedMatter/IsingModel/Gibbs.lean:85
noncomputable def glue (η : ConfigSpace (Site d)) {n : ℕ}
(τ : {x // x ∈ box d n} → Bool) : ConfigSpace (Site d) :=
fun x => if h : x ∈ box d n then τ ⟨x, h⟩ else η x
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:125
noncomputable def boxFinset (d n : ℕ) : Finset (Site d) :=
(box_finite d n).toFinset
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:88
def spin (s : ConfigSpace V) (x : V) : ℝ := if s x then 1 else -1
PhyslibExt/CondensedMatter/IsingModel/Gibbs.lean:70
Uses 7 · Used by 23
DefinitionFinite-volume Boltzmann weight with a boundary condition#✓fully proved
The Boltzmann weight exp (-β H) of an inside configuration τ with boundary condition η.
noncomputable def fvWeight (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) (τ : {x // x ∈ box d n} → Bool) : ℝ :=
Real.exp (-β * fvEnergy η n B h τ)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
noncomputable def fvEnergy (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (h : ℝ) (τ : {x // x ∈ box d n} → Bool) : ℝ :=
- (∑ e ∈ B, bond (glue η τ) e) - h * ∑ x ∈ boxFinset d n, spin (glue η τ) x
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:142
Uses 4 · Used by 24
DefinitionFinite-volume partition function with a boundary condition#✓fully proved
The finite-volume partition function with boundary condition η.
noncomputable def fvZ (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) : ℝ :=
∑ τ : {x // x ∈ box d n} → Bool, fvWeight η n B β h τ
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
noncomputable def fvWeight (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) (τ : {x // x ∈ box d n} → Bool) : ℝ :=
Real.exp (-β * fvEnergy η n B h τ)
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:147
Uses 4 · Used by 23
DefinitionFinite-volume Gibbs probability with a boundary condition#✓fully proved
The finite-volume Gibbs probability of an inside configuration τ with boundary condition
η.
noncomputable def fvProb (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) (τ : {x // x ∈ box d n} → Bool) : ℝ :=
fvWeight η n B β h τ / fvZ η n B β h
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
noncomputable def fvWeight (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) (τ : {x // x ∈ box d n} → Bool) : ℝ :=
Real.exp (-β * fvEnergy η n B h τ)
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:147
noncomputable def fvZ (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) : ℝ :=
∑ τ : {x // x ∈ box d n} → Bool, fvWeight η n B β h τ
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:160
Uses 5 · Used by 26
DefinitionFinite-volume Gibbs measure on configurations of \(\mathbb{Z}^d\)#✓fully proved
The finite-volume Gibbs measure in Λ_n with boundary condition η and bond set B, as a
measure on configurations of ℤ^d.
noncomputable def fvMeasure (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) :
Measure (ConfigSpace (Site d)) :=
∑ τ : {x // x ∈ box d n} → Bool,
ENNReal.ofReal (fvProb η n B β h τ) • Measure.dirac (glue η τ)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
noncomputable def fvProb (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) (τ : {x // x ∈ box d n} → Bool) : ℝ :=
fvWeight η n B β h τ / fvZ η n B β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:177
noncomputable def glue (η : ConfigSpace (Site d)) {n : ℕ}
(τ : {x // x ∈ box d n} → Bool) : ConfigSpace (Site d) :=
fun x => if h : x ∈ box d n then τ ⟨x, h⟩ else η x
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:125
Uses 5 · Used by 23
DefinitionFinite-volume Gibbs measure as a probability measure#✓fully proved
The finite-volume Gibbs measure as a ProbabilityMeasure.
noncomputable def fvProbabilityMeasure (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
⟨fvMeasure η n B β h, fvMeasure_isProbabilityMeasure η n B β h⟩
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def fvMeasure (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) :
Measure (ConfigSpace (Site d)) :=
∑ τ : {x // x ∈ box d n} → Bool,
ENNReal.ofReal (fvProb η n B β h τ) • Measure.dirac (glue η τ)
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:195
instance fvMeasure_isProbabilityMeasure (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) :
IsProbabilityMeasure (fvMeasure η n B β h) :=
⟨fvMeasure_univ η n B β h⟩
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:212
Uses 9 · Used by 8
DefinitionAll-plus configuration#✓fully proved
The all-plus configuration.
def plusField (d : ℕ) : ConfigSpace (Site d) := fun _ => true
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 2 · Used by 27
DefinitionAll-minus configuration#✓fully proved
The all-minus configuration.
def minusField (d : ℕ) : ConfigSpace (Site d) := fun _ => false
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 2 · Used by 5
DefinitionPlus-boundary Ising measure in a box#✓fully proved
The Ising measure in Λ_n with plus boundary condition.
noncomputable def plusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (plusField d) n (bondFinsetTouch d n) β h
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def fvProbabilityMeasure (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
⟨fvMeasure η n B β h, fvMeasure_isProbabilityMeasure η n B β h⟩
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:218
def plusField (d : ℕ) : ConfigSpace (Site d) := fun _ => true
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:226
noncomputable def bondFinsetTouch (d n : ℕ) : Finset (Sym2 (Site d)) :=
(bondPairsTouch d n).image (fun p => s(p.1, p.2))
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:114
Uses 5 · Used by 26
DefinitionMinus-boundary Ising measure in a box#✓fully proved
The Ising measure in Λ_n with minus boundary condition.
noncomputable def minusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (minusField d) n (bondFinsetTouch d n) β h
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def fvProbabilityMeasure (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
⟨fvMeasure η n B β h, fvMeasure_isProbabilityMeasure η n B β h⟩
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:218
def minusField (d : ℕ) : ConfigSpace (Site d) := fun _ => false
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:229
noncomputable def bondFinsetTouch (d n : ℕ) : Finset (Sym2 (Site d)) :=
(bondPairsTouch d n).image (fun p => s(p.1, p.2))
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:114
Uses 5 · Used by 7
DefinitionFree-boundary Ising measure in a box#✓fully proved
The Ising measure in Λ_n with free boundary condition (internal bonds only).
noncomputable def freeMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (minusField d) n (bondFinsetInternal d n) β h
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def fvProbabilityMeasure (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
⟨fvMeasure η n B β h, fvMeasure_isProbabilityMeasure η n B β h⟩
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:218
def minusField (d : ℕ) : ConfigSpace (Site d) := fun _ => false
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:229
noncomputable def bondFinsetInternal (d n : ℕ) : Finset (Sym2 (Site d)) :=
(bondPairsInternal d n).image (fun p => s(p.1, p.2))
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:118
Uses 5 · Used by 2
DefinitionInfinite-volume state of a sequence of measures#✓fully proved
μ is an infinite-volume state of the sequence ρ: some subsequence of ρ converges weakly to
μ.
def InfiniteVolumeState (ρ : ℕ → ProbabilityMeasure (ConfigSpace (Site d)))
(μ : ProbabilityMeasure (ConfigSpace (Site d))) : Prop :=
∃ φ : ℕ → ℕ, StrictMono φ ∧ WeakConvergesTo (ρ ∘ φ) μ
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
Uses 3 · Used by 17
LemmaExistence of infinite-volume states#✓fully proved
Every sequence of probability measures on configurations has an infinite-volume state, by Prokhorov compactness.
lemma exists_infiniteVolumeState
(ρ : ℕ → ProbabilityMeasure (ConfigSpace (Site d))) :
∃ μ : ProbabilityMeasure (ConfigSpace (Site d)), InfiniteVolumeState ρ μ
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def InfiniteVolumeState (ρ : ℕ → ProbabilityMeasure (ConfigSpace (Site d)))
(μ : ProbabilityMeasure (ConfigSpace (Site d))) : Prop :=
∃ φ : ℕ → ℕ, StrictMono φ ∧ WeakConvergesTo (ρ ∘ φ) μ
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:250
Uses 4 · Used by 16
DefinitionChosen subsequential weak limit of a sequence of measures#✓fully proved
A subsequential weak limit of ρ, chosen by exists_infiniteVolumeState.
noncomputable def limitState (ρ : ℕ → ProbabilityMeasure (ConfigSpace (Site d))) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
(exists_infiniteVolumeState ρ).choose
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
lemma exists_infiniteVolumeState
(ρ : ℕ → ProbabilityMeasure (ConfigSpace (Site d))) :
∃ μ : ProbabilityMeasure (ConfigSpace (Site d)), InfiniteVolumeState ρ μ
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:256
Uses 4 · Used by 18
DefinitionInfinite-volume plus state as a subsequential weak limit#✓fully proved
The plus state: a weak subsequential limit of the plus-boundary box measures.
Full-sequence convergence is not claimed here: the library only provides this state as a
chosen subsequential limit (see plusState_isInfiniteVolumeState).
noncomputable def plusState (d : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
limitState (fun n => plusMeasure d n β h)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def limitState (ρ : ℕ → ProbabilityMeasure (ConfigSpace (Site d))) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
(exists_infiniteVolumeState ρ).choose
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:263
noncomputable def plusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (plusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:232
Uses 4 · Used by 18
DefinitionInfinite-volume minus state as a subsequential weak limit#✓fully proved
The minus state: a weak subsequential limit of the minus-boundary box measures.
noncomputable def minusState (d : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
limitState (fun n => minusMeasure d n β h)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def limitState (ρ : ℕ → ProbabilityMeasure (ConfigSpace (Site d))) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
(exists_infiniteVolumeState ρ).choose
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:263
noncomputable def minusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (minusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:237
DefinitionInfinite-volume free state as a subsequential weak limit#✓fully proved
The free state: a weak subsequential limit of the free-boundary box measures.
noncomputable def freeState (d : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
limitState (fun n => freeMeasure d n β h)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def limitState (ρ : ℕ → ProbabilityMeasure (ConfigSpace (Site d))) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
(exists_infiniteVolumeState ρ).choose
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:263
noncomputable def freeMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (minusField d) n (bondFinsetInternal d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:242
DefinitionDLR state of the Ising model on \(\mathbb{Z}^d\)#✓fully proved
The DLR condition: for every n, the conditional distribution of μ given the spins outside
the box Λ_n equals, for μ-almost every η, the finite-volume Gibbs measure fvMeasure η n
(bondFinsetTouch d n) β h with boundary condition η.
def IsDLRState (d : ℕ) (β h : ℝ) (μ : Measure (ConfigSpace (Site d)))
[IsFiniteMeasure μ] : Prop :=
∀ n : ℕ, ∀ᵐ η ∂μ,
(gibbsConditional μ (box d n)) η = fvMeasure η n (bondFinsetTouch d n) β h
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def gibbsConditional (μ : Measure (ConfigSpace E)) [IsFiniteMeasure μ]
(Λ : Set E) : @Kernel (ConfigSpace E) (ConfigSpace E) (outsideSigma Λ) _ :=
condExpKernel μ (outsideSigma Λ)
MathlibExt/Probability/Configuration/CondDistribution.lean:66
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
noncomputable def fvMeasure (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) :
Measure (ConfigSpace (Site d)) :=
∑ τ : {x // x ∈ box d n} → Bool,
ENNReal.ofReal (fvProb η n B β h τ) • Measure.dirac (glue η τ)
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:195
noncomputable def bondFinsetTouch (d n : ℕ) : Finset (Sym2 (Site d)) :=
(bondPairsTouch d n).image (fun p => s(p.1, p.2))
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:114
Uses 7 · Used by 4
DefinitionFinite intersections of a family of sets#✓fully proved
The finite intersections of sets from S (together with univ), a π-system generating the
same σ-algebra.
noncomputable def finInterSystem {Ω : Type*} (S : Set (Set Ω)) : Set (Set Ω) :=
Set.range (fun F : Finset S => ⋂₀ (Subtype.val '' (F : Set S)))
Used by 1
DefinitionIsing specification in a box#✓fully proved
The Ising specification in Λ_n: the kernel η ↦ fvMeasure η n B β h, measurable with
respect to the spins outside Λ_n.
noncomputable def isingSpec (n : ℕ) (B : Finset (Sym2 (Site d))) (β h : ℝ) :
@Kernel (ConfigSpace (Site d)) (ConfigSpace (Site d)) (outsideSigma (box d n)) _ :=
@Kernel.mk (ConfigSpace (Site d)) (ConfigSpace (Site d)) (outsideSigma (box d n)) _
(fun η => fvMeasure η n B β h)
(@Measure.measurable_of_measurable_coe (ConfigSpace (Site d)) (ConfigSpace (Site d))
_ (outsideSigma (box d n)) (fun η => fvMeasure η n B β h)
(fun _ hs => meas_fvMeasure_coe n B β h hs))
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
@[reducible] noncomputable def outsideSigma (Λ : Set E) : MeasurableSpace (ConfigSpace E) :=
⨆ e ∈ Λᶜ, MeasurableSpace.comap (ConfigSpace.eval e) inferInstance
MathlibExt/Probability/Configuration/CondDistribution.lean:53
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
noncomputable def fvMeasure (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) :
Measure (ConfigSpace (Site d)) :=
∑ τ : {x // x ∈ box d n} → Bool,
ENNReal.ofReal (fvProb η n B β h τ) • Measure.dirac (glue η τ)
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:195
lemma meas_fvMeasure_coe (n : ℕ) (B : Finset (Sym2 (Site d))) (β h : ℝ)
{s : Set (ConfigSpace (Site d))} (hs : MeasurableSet s) :
Measurable[outsideSigma (box d n)]
(fun η : ConfigSpace (Site d) => (fvMeasure η n B β h) s)
PhyslibExt/CondensedMatter/IsingModel/GibbsSimplex.lean:198
Uses 14 · Used by 2
LemmaConvexity of the set of DLR states#✓fully proved
The DLR states form a convex set: a μ₁ + b μ₂ with a + b = 1 is a DLR state if μ₁, μ₂
are.
lemma convex_isDLRState (β h : ℝ) {a b : ℝ≥0∞} (hab : a + b = 1)
(μ₁ μ₂ : Measure (ConfigSpace (Site d))) [IsFiniteMeasure μ₁] [IsFiniteMeasure μ₂]
[IsFiniteMeasure (a • μ₁ + b • μ₂)]
(h₁ : IsDLRState d β h μ₁) (h₂ : IsDLRState d β h μ₂) :
IsDLRState d β h (a • μ₁ + b • μ₂)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def IsDLRState (d : ℕ) (β h : ℝ) (μ : Measure (ConfigSpace (Site d)))
[IsFiniteMeasure μ] : Prop :=
∀ n : ℕ, ∀ᵐ η ∂μ,
(gibbsConditional μ (box d n)) η = fvMeasure η n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/DLR.lean:64
Uses 17
DefinitionStochastic domination on increasing clopen events#✓fully proved
μ ≼c ν: μ(A) ≤ ν(A) for every increasing clopen event A.
def StochasticallyDominatedClopen {E : Type*}
(μ ν : Measure (ConfigSpace E)) : Prop :=
∀ A : Set (ConfigSpace E), IsClopen A → IsUpperSet A → μ.real A ≤ ν.real A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1 · Used by 2
LemmaStochastic domination implies clopen domination, upper measure finite#✓fully proved
ENNReal stochastic domination gives real-mass clopen domination when the upper measure is finite.
lemma StochasticallyDominated.toClopen {E : Type*} [Countable E]
{μ ν : Measure (ConfigSpace E)} [IsFiniteMeasure ν] (h : μ ≼ ν) : μ ≼c ν
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
DefinitionIncreasing clopen events#✓fully proved
The increasing clopen events, a π-system generating the Borel σ-algebra.
def clopenUpSystem (E : Type*) : Set (Set (ConfigSpace E)) :=
{A | IsClopen A ∧ IsUpperSet A}
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1 · Used by 1
TheoremUniqueness of the Gibbs state#✓fully proved
For β, h ≥ 0, if the plus and minus states agree then
every DLR state that is a probability measure equals the plus state.
S. Friedli and Y. Velenik, Statistical Mechanics of Lattice Systems, Cambridge University Press (2017), Chapter 3.
theorem gsi_gibbs_unique_of_phases_eq (β h : ℝ) (hβ : 0 ≤ β) (hh : 0 ≤ h)
(μ : Measure (ConfigSpace (Site d))) [IsProbabilityMeasure μ]
(hμ : IsDLRState d β h μ)
(hphase : (plusState d β h : Measure (ConfigSpace (Site d)))
= (minusState d β h : Measure (ConfigSpace (Site d)))) :
μ = (minusState d β h : Measure (ConfigSpace (Site d)))
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def IsDLRState (d : ℕ) (β h : ℝ) (μ : Measure (ConfigSpace (Site d)))
[IsFiniteMeasure μ] : Prop :=
∀ n : ℕ, ∀ᵐ η ∂μ,
(gibbsConditional μ (box d n)) η = fvMeasure η n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/DLR.lean:64
noncomputable def plusState (d : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
limitState (fun n => plusMeasure d n β h)
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:275
noncomputable def minusState (d : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
limitState (fun n => minusMeasure d n β h)
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:280
Uses 36
DefinitionSpecification applied to a function#✓fully proved
The specification applied to f: η ↦ ∫ f d(fvMeasure η n B β h).
noncomputable def specApply (n : ℕ) (B : Finset (Sym2 (Site d))) (β h : ℝ)
(f : ConfigSpace (Site d) → ℝ) (ω : ConfigSpace (Site d)) : ℝ :=
∫ y, f y ∂(fvMeasure ω n B β h)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def fvMeasure (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) :
Measure (ConfigSpace (Site d)) :=
∑ τ : {x // x ∈ box d n} → Bool,
ENNReal.ofReal (fvProb η n B β h τ) • Measure.dirac (glue η τ)
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:195
Uses 3 · Used by 3
DefinitionSpecification applied to a bounded continuous function#✓fully proved
The specification applied to a bounded continuous function, as a bounded continuous function.
noncomputable def specApply_bcf (n : ℕ) (B : Finset (Sym2 (Site d))) (β h : ℝ)
(f : ConfigSpace (Site d) →ᵇ ℝ) : ConfigSpace (Site d) →ᵇ ℝ :=
BoundedContinuousFunction.mkOfCompact
⟨specApply n B β h (f : ConfigSpace (Site d) → ℝ), specApply_continuous n B β h f.continuous⟩
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def specApply (n : ℕ) (B : Finset (Sym2 (Site d))) (β h : ℝ)
(f : ConfigSpace (Site d) → ℝ) (ω : ConfigSpace (Site d)) : ℝ :=
∫ y, f y ∂(fvMeasure ω n B β h)
PhyslibExt/CondensedMatter/IsingModel/PlusStateDLR.lean:64
lemma specApply_continuous (n : ℕ) (B : Finset (Sym2 (Site d))) (β h : ℝ)
{f : ConfigSpace (Site d) → ℝ} (hf : Continuous f) :
Continuous (specApply n B β h f)
PhyslibExt/CondensedMatter/IsingModel/PlusStateDLR.lean:125
Uses 13 · Used by 1
DefinitionConsistency of the plus measures under the specification#✓fully proved
The plus measures in Λ_m are invariant under the specification in every Λ_n ⊆ Λ_m.
def FVConsistency (d : ℕ) (β h : ℝ) : Prop :=
∀ (n m : ℕ), n ≤ m → ∀ f : ConfigSpace (Site d) →ᵇ ℝ,
∫ ω, specApply n (bondFinsetTouch d n) β h (f : ConfigSpace (Site d) → ℝ) ω
∂(plusMeasure d m β h : Measure (ConfigSpace (Site d)))
= ∫ ω, f ω ∂(plusMeasure d m β h : Measure (ConfigSpace (Site d)))
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def specApply (n : ℕ) (B : Finset (Sym2 (Site d))) (β h : ℝ)
(f : ConfigSpace (Site d) → ℝ) (ω : ConfigSpace (Site d)) : ℝ :=
∫ y, f y ∂(fvMeasure ω n B β h)
PhyslibExt/CondensedMatter/IsingModel/PlusStateDLR.lean:64
noncomputable def bondFinsetTouch (d n : ℕ) : Finset (Sym2 (Site d)) :=
(bondPairsTouch d n).image (fun p => s(p.1, p.2))
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:114
noncomputable def plusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (plusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:232
Uses 5 · Used by 1
DefinitionIsing specification as a Markov kernel#✓fully proved
The Ising specification in Λ_n as a Markov kernel on the full σ-algebra.
noncomputable def isingSpecFull (n : ℕ) (B : Finset (Sym2 (Site d))) (β h : ℝ) :
Kernel (ConfigSpace (Site d)) (ConfigSpace (Site d)) :=
Kernel.mk (fun η => fvMeasure η n B β h)
(Measure.measurable_of_measurable_coe _
(fun _ hs => (meas_fvMeasure_coe n B β h hs).mono (outsideSigma_le (box d n)) le_rfl))
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def fvMeasure (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β h : ℝ) :
Measure (ConfigSpace (Site d)) :=
∑ τ : {x // x ∈ box d n} → Bool,
ENNReal.ofReal (fvProb η n B β h τ) • Measure.dirac (glue η τ)
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:195
lemma meas_fvMeasure_coe (n : ℕ) (B : Finset (Sym2 (Site d))) (β h : ℝ)
{s : Set (ConfigSpace (Site d))} (hs : MeasurableSet s) :
Measurable[outsideSigma (box d n)]
(fun η : ConfigSpace (Site d) => (fvMeasure η n B β h) s)
PhyslibExt/CondensedMatter/IsingModel/GibbsSimplex.lean:198
theorem outsideSigma_le (Λ : Set E) :
outsideSigma Λ ≤ (inferInstance : MeasurableSpace (ConfigSpace E))
MathlibExt/Probability/Configuration/CondDistribution.lean:58
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
Uses 15 · Used by 1
Definition\(\sigma\)-algebra of events determined outside a region#✓fully proved
The σ-algebra of events determined by the spins outside Λ.
@[reducible] def outsideInvariantMS {E : Type*} (Λ : Set E) : MeasurableSpace (ConfigSpace E) where
MeasurableSet' s := ∀ ω ω' : ConfigSpace E, (∀ x ∉ Λ, ω x = ω' x) → (ω ∈ s ↔ ω' ∈ s)
measurableSet_empty := by simp
measurableSet_compl s hs ω ω' h := by simp only [Set.mem_compl_iff]; rw [hs ω ω' h]
measurableSet_iUnion f hf ω ω' h := by
simp only [Set.mem_iUnion]; exact exists_congr (fun i => hf i ω ω' h)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1 · Used by 1
DefinitionOverwriting a configuration on an inner box#✓fully proved
The configuration on Λ_m obtained from σ by overwriting its spins in Λ_n with τ.
noncomputable def ovrBox {n m : ℕ} (_hnm : n ≤ m)
(σ : {x // x ∈ box d m} → Bool) (τ : {x // x ∈ box d n} → Bool) :
{x // x ∈ box d m} → Bool :=
fun x => if hn : (x : Site d) ∈ box d n then τ ⟨x, hn⟩ else σ x
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 2 · Used by 6
DefinitionRestriction of a configuration to an inner box#✓fully proved
The restriction of a configuration on Λ_m to Λ_n.
noncomputable def resBox {n m : ℕ} (hnm : n ≤ m)
(σ : {x // x ∈ box d m} → Bool) : {x // x ∈ box d n} → Bool :=
fun x => σ ⟨x, box_mono d hnm x.2⟩
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
theorem box_mono (d : ℕ) : Monotone (box d)
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:128
Uses 2 · Used by 6
DefinitionInvolution swapping inner-box parts of configuration pairs#✓fully proved
The involution of pairs exchanging the Λ_n parts of a configuration on Λ_m and a
configuration on Λ_n.
noncomputable def swapPair {n m : ℕ} (hnm : n ≤ m) :
(({x // x ∈ box d m} → Bool) × ({x // x ∈ box d n} → Bool))
→ (({x // x ∈ box d m} → Bool) × ({x // x ∈ box d n} → Bool)) :=
fun p => (ovrBox hnm p.1 p.2, resBox hnm p.1)
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
noncomputable def ovrBox {n m : ℕ} (_hnm : n ≤ m)
(σ : {x // x ∈ box d m} → Bool) (τ : {x // x ∈ box d n} → Bool) :
{x // x ∈ box d m} → Bool :=
fun x => if hn : (x : Site d) ∈ box d n then τ ⟨x, hn⟩ else σ x
PhyslibExt/CondensedMatter/IsingModel/PlusStateDLRConsistency.lean:64
noncomputable def resBox {n m : ℕ} (hnm : n ≤ m)
(σ : {x // x ∈ box d m} → Bool) : {x // x ∈ box d n} → Bool :=
fun x => σ ⟨x, box_mono d hnm x.2⟩
PhyslibExt/CondensedMatter/IsingModel/PlusStateDLRConsistency.lean:70
Uses 4 · Used by 5
TheoremThe plus state is a Gibbs (DLR) state#✓fully proved
For all β, h, the plus state of the Ising model
on ℤ^d satisfies the DLR condition.
H.-O. Georgii, Gibbs Measures and Phase Transitions, de Gruyter (1988), Chapter 4.
theorem plusState_isDLR (β h : ℝ) :
IsDLRState d β h (plusState d β h : Measure (ConfigSpace (Site d)))
def IsDLRState (d : ℕ) (β h : ℝ) (μ : Measure (ConfigSpace (Site d)))
[IsFiniteMeasure μ] : Prop :=
∀ n : ℕ, ∀ᵐ η ∂μ,
(gibbsConditional μ (box d n)) η = fvMeasure η n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/DLR.lean:64
noncomputable def plusState (d : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
limitState (fun n => plusMeasure d n β h)
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:275
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 38
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.