Translation invariance and ergodicity of the plus state
DefinitionShifted plus-boundary box measure#✓fully proved
The plus-boundary box measure on Λ_n pushed forward by the shift g.
noncomputable def pst_plusShiftedFinite (β h : ℝ) (g : Multiplicative (Site d)) (n : ℕ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
(plusMeasure d n β h).map (shift g)
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 plusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (plusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:232
def shift (g : G) (ω : ConfigSpace E) : ConfigSpace E := fun e => ω (g⁻¹ • e)
MathlibExt/Probability/Configuration/Ergodicity.lean:54
DefinitionShifted minus-boundary box measure#✓fully proved
The minus-boundary box measure on Λ_n pushed forward by the shift g.
noncomputable def pst_minusShiftedFinite (β h : ℝ) (g : Multiplicative (Site d)) (n : ℕ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
(minusMeasure d n β h).map (shift g)
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 minusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (minusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:237
def shift (g : G) (ω : ConfigSpace E) : ConfigSpace E := fun e => ω (g⁻¹ • e)
MathlibExt/Probability/Configuration/Ergodicity.lean:54
DefinitionDecay of shifted integrals for plus box measures#✓fully proved
Along φ, integrals of bounded continuous functions against the plus box measures and their
shifts by g become equal.
def pst_PlusIntegralShiftDecay (β h : ℝ) (g : Multiplicative (Site d)) (φ : ℕ → ℕ) : Prop :=
∀ f : ConfigSpace (Site d) →ᵇ ℝ,
Tendsto (fun n =>
(∫ x, f x ∂((plusMeasure d (φ n) β h : ProbabilityMeasure _) : Measure _))
- (∫ x, f (shift g x)
∂((plusMeasure d (φ n) β h : ProbabilityMeasure _) : Measure _)))
atTop (𝓝 0)
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 plusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (plusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:232
def shift (g : G) (ω : ConfigSpace E) : ConfigSpace E := fun e => ω (g⁻¹ • e)
MathlibExt/Probability/Configuration/Ergodicity.lean:54
DefinitionDecay of shifted integrals for minus box measures#✓fully proved
Along φ, integrals of bounded continuous functions against the minus box measures and their
shifts by g become equal.
def pst_MinusIntegralShiftDecay (β h : ℝ) (g : Multiplicative (Site d)) (φ : ℕ → ℕ) : Prop :=
∀ f : ConfigSpace (Site d) →ᵇ ℝ,
Tendsto (fun n =>
(∫ x, f x ∂((minusMeasure d (φ n) β h : ProbabilityMeasure _) : Measure _))
- (∫ x, f (shift g x)
∂((minusMeasure d (φ n) β h : ProbabilityMeasure _) : Measure _)))
atTop (𝓝 0)
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 minusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (minusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:237
def shift (g : G) (ω : ConfigSpace E) : ConfigSpace E := fun e => ω (g⁻¹ • e)
MathlibExt/Probability/Configuration/Ergodicity.lean:54
DefinitionDifference between an integral and its shifted version#✓fully proved
The difference ∫ f dμ_n - ∫ f ∘ shift_g dμ_n.
noncomputable def pstc_decayFun (μ : ℕ → ProbabilityMeasure (ConfigSpace (Site d)))
(g : Multiplicative (Site d)) (f : (ConfigSpace (Site d)) →ᵇ ℝ) (n : ℕ) : ℝ :=
(∫ x, f x ∂(μ n : Measure _)) - (∫ x, f (shift g x) ∂(μ n : Measure _))
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 shift (g : G) (ω : ConfigSpace E) : ConfigSpace E := fun e => ω (g⁻¹ • e)
MathlibExt/Probability/Configuration/Ergodicity.lean:54
Uses 3 · Used by 6
DefinitionPlus-spin indicator at a site as a continuous function#✓fully proved
The coordinate ω ↦ 1_{ω_x = +} as a continuous function.
noncomputable def pstc_coordCM (x : Site d) : C(ConfigSpace (Site d), ℝ) :=
⟨fun ω => if ω x then (1 : ℝ) else 0,
(continuous_of_discreteTopology (f := fun b : Bool => if b then (1 : ℝ) else 0)).comp
(continuous_apply x)⟩
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
Uses 2 · Used by 4
DefinitionPlus-spin indicator at a site as a bounded continuous function#✓fully proved
The coordinate ω ↦ 1_{ω_x = +} as a bounded continuous function.
noncomputable def pstc_coordBcf (x : Site d) : ConfigSpace (Site d) →ᵇ ℝ :=
BoundedContinuousFunction.mkOfCompact (pstc_coordCM x)
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 pstc_coordCM (x : Site d) : C(ConfigSpace (Site d), ℝ) :=
⟨fun ω => if ω x then (1 : ℝ) else 0,
(continuous_of_discreteTopology (f := fun b : Bool => if b then (1 : ℝ) else 0)).comp
(continuous_apply x)⟩
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:141
Uses 3 · Used by 4
DefinitionSubalgebra of cylinder functions#✓fully proved
The subalgebra generated by the spin coordinates (cylinder functions).
noncomputable def pstc_cylinderAlg (d : ℕ) : Subalgebra ℝ C(ConfigSpace (Site d), ℝ) :=
Algebra.adjoin ℝ (Set.range (pstc_coordCM (d := 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 pstc_coordCM (x : Site d) : C(ConfigSpace (Site d), ℝ) :=
⟨fun ω => if ω x then (1 : ℝ) else 0,
(continuous_of_discreteTopology (f := fun b : Bool => if b then (1 : ℝ) else 0)).comp
(continuous_apply x)⟩
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:141
DefinitionCylinder functions as bounded continuous functions#✓fully proved
The cylinder functions as bounded continuous functions.
noncomputable def pstc_cylinderBcfSet (d : ℕ) : Set (ConfigSpace (Site d) →ᵇ ℝ) :=
BoundedContinuousFunction.mkOfCompact ''
(pstc_cylinderAlg d : Set C(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 pstc_cylinderAlg (d : ℕ) : Subalgebra ℝ C(ConfigSpace (Site d), ℝ) :=
Algebra.adjoin ℝ (Set.range (pstc_coordCM (d := d)))
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:157
Uses 3 · Used by 5
DefinitionDecay of shifted cylinder integrals for plus box measures#✓fully proved
Shifted integrals of cylinder functions against the plus box measures decay along φ.
def pstc_PlusCylinderDecay (β h : ℝ) (g : Multiplicative (Site d)) (φ : ℕ → ℕ) : Prop :=
∀ f ∈ pstc_cylinderBcfSet d,
Tendsto (pstc_decayFun (fun n => plusMeasure d (φ n) β h) g f) atTop (𝓝 0)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def pstc_cylinderBcfSet (d : ℕ) : Set (ConfigSpace (Site d) →ᵇ ℝ) :=
BoundedContinuousFunction.mkOfCompact ''
(pstc_cylinderAlg d : Set C(ConfigSpace (Site d), ℝ))
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:174
noncomputable def pstc_decayFun (μ : ℕ → ProbabilityMeasure (ConfigSpace (Site d)))
(g : Multiplicative (Site d)) (f : (ConfigSpace (Site d)) →ᵇ ℝ) (n : ℕ) : ℝ :=
(∫ x, f x ∂(μ n : Measure _)) - (∫ x, f (shift g x) ∂(μ n : Measure _))
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:61
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
DefinitionDecay of shifted cylinder integrals for minus box measures#✓fully proved
Shifted integrals of cylinder functions against the minus box measures decay along φ.
def pstc_MinusCylinderDecay (β h : ℝ) (g : Multiplicative (Site d)) (φ : ℕ → ℕ) : Prop :=
∀ f ∈ pstc_cylinderBcfSet d,
Tendsto (pstc_decayFun (fun n => minusMeasure d (φ n) β h) g f) atTop (𝓝 0)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def pstc_cylinderBcfSet (d : ℕ) : Set (ConfigSpace (Site d) →ᵇ ℝ) :=
BoundedContinuousFunction.mkOfCompact ''
(pstc_cylinderAlg d : Set C(ConfigSpace (Site d), ℝ))
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:174
noncomputable def pstc_decayFun (μ : ℕ → ProbabilityMeasure (ConfigSpace (Site d)))
(g : Multiplicative (Site d)) (f : (ConfigSpace (Site d)) →ᵇ ℝ) (n : ℕ) : ℝ :=
(∫ x, f x ∂(μ n : Measure _)) - (∫ x, f (shift g x) ∂(μ n : Measure _))
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:61
noncomputable def minusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (minusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:237
DefinitionBoundary bond fraction of a box#✓fully proved
The number of bonds touching but not inside Λ_n, divided by the number of sites of Λ_n.
noncomputable def ibs_boundaryFraction (d n : ℕ) : ℝ :=
((bondFinsetTouch d n \ bondFinsetInternal d n).card : ℝ) / ((boxFinset d n).card : ℝ)
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 bondFinsetInternal (d n : ℕ) : Finset (Sym2 (Site d)) :=
(bondPairsInternal d n).image (fun p => s(p.1, p.2))
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:118
noncomputable def boxFinset (d n : ℕ) : Finset (Site d) :=
(box_finite d n).toFinset
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:88
DefinitionBoundary influence bound for the plus box measures#✓fully proved
Shift differences of cylinder-function integrals against the plus box measures are
O(boundary fraction).
def ibs_PlusBoundaryInfluence (β h : ℝ) (g : Multiplicative (Site d)) (φ : ℕ → ℕ) : Prop :=
∀ f ∈ pstc_cylinderBcfSet d, ∃ C : ℝ, ∀ n,
|pstc_decayFun (fun n => plusMeasure d (φ n) β h) g f n|
≤ C * ibs_boundaryFraction d (φ n)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def pstc_cylinderBcfSet (d : ℕ) : Set (ConfigSpace (Site d) →ᵇ ℝ) :=
BoundedContinuousFunction.mkOfCompact ''
(pstc_cylinderAlg d : Set C(ConfigSpace (Site d), ℝ))
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:174
noncomputable def pstc_decayFun (μ : ℕ → ProbabilityMeasure (ConfigSpace (Site d)))
(g : Multiplicative (Site d)) (f : (ConfigSpace (Site d)) →ᵇ ℝ) (n : ℕ) : ℝ :=
(∫ x, f x ∂(μ n : Measure _)) - (∫ x, f (shift g x) ∂(μ n : Measure _))
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:61
noncomputable def plusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (plusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:232
noncomputable def ibs_boundaryFraction (d n : ℕ) : ℝ :=
((bondFinsetTouch d n \ bondFinsetInternal d n).card : ℝ) / ((boxFinset d n).card : ℝ)
PhyslibExt/CondensedMatter/IsingModel/IsingBoxSqueeze.lean:154
DefinitionBoundary influence bound for the minus box measures#✓fully proved
Shift differences of cylinder-function integrals against the minus box measures are
O(boundary fraction).
def ibs_MinusBoundaryInfluence (β h : ℝ) (g : Multiplicative (Site d)) (φ : ℕ → ℕ) : Prop :=
∀ f ∈ pstc_cylinderBcfSet d, ∃ C : ℝ, ∀ n,
|pstc_decayFun (fun n => minusMeasure d (φ n) β h) g f n|
≤ C * ibs_boundaryFraction d (φ n)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def pstc_cylinderBcfSet (d : ℕ) : Set (ConfigSpace (Site d) →ᵇ ℝ) :=
BoundedContinuousFunction.mkOfCompact ''
(pstc_cylinderAlg d : Set C(ConfigSpace (Site d), ℝ))
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:174
noncomputable def pstc_decayFun (μ : ℕ → ProbabilityMeasure (ConfigSpace (Site d)))
(g : Multiplicative (Site d)) (f : (ConfigSpace (Site d)) →ᵇ ℝ) (n : ℕ) : ℝ :=
(∫ x, f x ∂(μ n : Measure _)) - (∫ x, f (shift g x) ∂(μ n : Measure _))
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:61
noncomputable def minusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (minusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:237
noncomputable def ibs_boundaryFraction (d n : ℕ) : ℝ :=
((bondFinsetTouch d n \ bondFinsetInternal d n).card : ℝ) / ((boxFinset d n).card : ℝ)
PhyslibExt/CondensedMatter/IsingModel/IsingBoxSqueeze.lean:154
DefinitionAll-plus monomial as a continuous function#✓fully proved
The monomial ω ↦ ∏_{x ∈ T} 1_{ω_x = +} as a continuous function.
noncomputable def iti_monomialCM (T : Finset (Site d)) : C(ConfigSpace (Site d), ℝ) :=
∏ x ∈ T, pstc_coordCM x
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 pstc_coordCM (x : Site d) : C(ConfigSpace (Site d), ℝ) :=
⟨fun ω => if ω x then (1 : ℝ) else 0,
(continuous_of_discreteTopology (f := fun b : Bool => if b then (1 : ℝ) else 0)).comp
(continuous_apply x)⟩
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:141
DefinitionAll-plus monomial as a bounded continuous function#✓fully proved
The monomial ω ↦ ∏_{x ∈ T} 1_{ω_x = +} as a bounded continuous function.
noncomputable def iti_monomialBcf (T : Finset (Site d)) : ConfigSpace (Site d) →ᵇ ℝ :=
BoundedContinuousFunction.mkOfCompact (iti_monomialCM T)
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 iti_monomialCM (T : Finset (Site d)) : C(ConfigSpace (Site d), ℝ) :=
∏ x ∈ T, pstc_coordCM x
PhyslibExt/CondensedMatter/IsingModel/PlusStateTIOfHomogeneous.lean:125
Uses 3 · Used by 1
DefinitionShift homogeneity of all-plus events in the plus state#✓fully proved
The plus state gives the all-plus events on T and on g⁻¹ T the same probability, for
every finite T.
def iti_PlusMultiHomogeneous (β h : ℝ) (g : Multiplicative (Site d)) : Prop :=
∀ T : Finset (Site d),
(plusState d β h : Measure (ConfigSpace (Site d))).real (fmu_multiOpen (E := Site d) T)
= (plusState d β h : Measure (ConfigSpace (Site d))).real
(fmu_multiOpen (E := Site d) (T.image (fun x => g⁻¹ • x)))
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
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
def fmu_multiOpen (T : Finset E) : Set (ConfigSpace E) := {ω | ∀ e ∈ T, ω e = true}
PhyslibExt/StatisticalMechanics/RandomCluster/ErgodicOfUpperDecay.lean:70
DefinitionContinuous functions with decaying shifted integrals#✓fully proved
The continuous functions whose shifted integrals against the plus box measures decay along
φ.
StatMech.Ising.iti_decaySet · 23 lines
noncomputable def iti_decaySet (β h : ℝ) (g : Multiplicative (Site d)) (φ : ℕ → ℕ) :
Submodule ℝ C(ConfigSpace (Site d), ℝ) where
carrier := {hh | Tendsto (pstc_decayFun (fun n => plusMeasure d (φ n) β h) g
(BoundedContinuousFunction.mkOfCompact hh)) atTop (𝓝 0)}
add_mem' {hh hh'} h1 h2 := by
simp only [Set.mem_ofPred_eq] at h1 h2 ⊢
have hsum := h1.add h2; rw [add_zero] at hsum
refine hsum.congr (fun n => ?_)
rw [BoundedContinuousFunction.mkOfCompact_add, iti_decayFun_add]
zero_mem' := by
simp only [Set.mem_ofPred_eq]
have hz : pstc_decayFun (fun n => plusMeasure d (φ n) β h) g
(BoundedContinuousFunction.mkOfCompact (0 : C(ConfigSpace (Site d), ℝ)))
= fun _ => (0:ℝ) := by
funext n; rw [BoundedContinuousFunction.mkOfCompact_zero, iti_decayFun_zero]
rw [hz]; exact tendsto_const_nhds
smul_mem' c hh h1 := by
simp only [Set.mem_ofPred_eq] at h1 ⊢
have hsmul := h1.const_mul c; rw [mul_zero] at hsmul
refine hsmul.congr (fun n => ?_)
have hms : BoundedContinuousFunction.mkOfCompact (c • hh)
= c • BoundedContinuousFunction.mkOfCompact hh := rfl
rw [hms, iti_decayFun_smul]
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 pstc_decayFun (μ : ℕ → ProbabilityMeasure (ConfigSpace (Site d)))
(g : Multiplicative (Site d)) (f : (ConfigSpace (Site d)) →ᵇ ℝ) (n : ℕ) : ℝ :=
(∫ x, f x ∂(μ n : Measure _)) - (∫ x, f (shift g x) ∂(μ n : Measure _))
PhyslibExt/CondensedMatter/IsingModel/PlusStateTICylinder.lean:61
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
DefinitionAsymptotic shift homogeneity of all-plus events in plus boxes#✓fully proved
Along φ, the plus box measures give the all-plus events on T and on g⁻¹ T
asymptotically equal probabilities.
def itb_PlusMultiBoundaryDecay (β h : ℝ) (g : Multiplicative (Site d)) (φ : ℕ → ℕ) : Prop :=
∀ T : Finset (Site d),
Tendsto (fun n =>
((plusMeasure d (φ n) β h : Measure (ConfigSpace (Site d))).real
(fmu_multiOpen (E := Site d) T))
- ((plusMeasure d (φ n) β h : Measure (ConfigSpace (Site d))).real
(fmu_multiOpen (E := Site d) (T.image (fun x => g⁻¹ • x)))))
atTop (𝓝 0)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def plusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (plusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:232
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def fmu_multiOpen (T : Finset E) : Set (ConfigSpace E) := {ω | ∀ e ∈ T, ω e = true}
PhyslibExt/StatisticalMechanics/RandomCluster/ErgodicOfUpperDecay.lean:70
DefinitionOff-centre domination of all-plus events#✓fully proved
For every finite T there is c such that plus measures on boxes of sizes m + c and m
compare the all-plus events on T and g⁻¹ T in both directions.
def itb_OffCentreDomination (β h : ℝ) (g : Multiplicative (Site d)) : Prop :=
∀ T : Finset (Site d), ∃ c : ℕ, ∀ m : ℕ,
(plusMeasure d (m + c) β h : Measure (ConfigSpace (Site d))).real
(fmu_multiOpen (E := Site d) T)
≤ (plusMeasure d m β h : Measure (ConfigSpace (Site d))).real
(fmu_multiOpen (E := Site d) (T.image (fun x => g⁻¹ • x)))
∧ (plusMeasure d m β h : Measure (ConfigSpace (Site d))).real
(fmu_multiOpen (E := Site d) (T.image (fun x => g⁻¹ • x)))
≤ (plusMeasure d (m - c) β h : Measure (ConfigSpace (Site d))).real
(fmu_multiOpen (E := Site d) T)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def plusMeasure (d n : ℕ) (β h : ℝ) :
ProbabilityMeasure (ConfigSpace (Site d)) :=
fvProbabilityMeasure (plusField d) n (bondFinsetTouch d n) β h
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:232
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def fmu_multiOpen (T : Finset E) : Set (ConfigSpace E) := {ω | ∀ e ∈ T, ω e = true}
PhyslibExt/StatisticalMechanics/RandomCluster/ErgodicOfUpperDecay.lean:70
DefinitionShift vector \(R e_{i_0}\)#✓fully proved
The vector R e_{i₀} of ℤ^d.
noncomputable def icb_shiftVec {d : ℕ} (i₀ : Fin d) (R : ℤ) : Site d :=
fun i => if i = i₀ then R else 0
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 1 · Used by 2
DefinitionUnit vector of \(\mathbb{Z}^d\)#✓fully proved
The unit vector e_i of ℤ^d.
def gvUnit (d : ℕ) (i : Fin d) : Site d := fun j => if j = i then 1 else 0
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 1 · Used by 6
DefinitionSite with its nearest neighbours#✓fully proved
The site x and its nearest neighbours.
noncomputable def gvBall (x : Site d) : Finset (Site d) :=
insert x ((Finset.univ : Finset (Fin d)).biUnion
(fun i => {x + gvUnit d i, x - gvUnit d i}))
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def gvUnit (d : ℕ) (i : Fin d) : Site d := fun j => if j = i then 1 else 0
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:79
Uses 2 · Used by 6
DefinitionSet with its nearest neighbours#✓fully proved
The sites of S together with their nearest neighbours.
noncomputable def gvCand (S : Finset (Site d)) : Finset (Site d) := S.biUnion gvBall
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def gvBall (x : Site d) : Finset (Site d) :=
insert x ((Finset.univ : Finset (Fin d)).biUnion
(fun i => {x + gvUnit d i, x - gvUnit d i}))
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:82
Uses 2 · Used by 6
DefinitionBonds touching a set#✓fully proved
The bonds with at least one endpoint in S.
noncomputable def gvBondTouch (S : Finset (Site d)) : Finset (Sym2 (Site d)) :=
(((gvCand S) ×ˢ (gvCand S)).filter
(fun p => (hypercubicLattice d).Adj p.1 p.2 ∧ (p.1 ∈ S ∨ p.2 ∈ S))).image (fun p => s(p.1, p.2))
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def gvCand (S : Finset (Site d)) : Finset (Site d) := S.biUnion gvBall
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:87
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 4 · Used by 7
DefinitionConfiguration glued from a set and a boundary condition#✓fully proved
The configuration equal to τ on S and to η off S.
noncomputable def gvGlue (η : ConfigSpace (Site d)) (S : Finset (Site d))
(τ : {x // x ∈ S} → Bool) : ConfigSpace (Site d) :=
fun x => if h : x ∈ S 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
Uses 2 · Used by 7
DefinitionEnergy on a set with a boundary condition#✓fully proved
The energy -∑_{e touching S} σ_e - h ∑_{x ∈ S} σ_x of gvGlue η S τ.
noncomputable def gvEnergy (η : ConfigSpace (Site d)) (S : Finset (Site d)) (h : ℝ)
(τ : {x // x ∈ S} → Bool) : ℝ :=
- (∑ e ∈ gvBondTouch S, bond (gvGlue η S τ) e) - h * ∑ x ∈ S, spin (gvGlue η S τ) 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
noncomputable def gvBondTouch (S : Finset (Site d)) : Finset (Sym2 (Site d)) :=
(((gvCand S) ×ˢ (gvCand S)).filter
(fun p => (hypercubicLattice d).Adj p.1 p.2 ∧ (p.1 ∈ S ∨ p.2 ∈ S))).image (fun p => s(p.1, p.2))
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:90
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 gvGlue (η : ConfigSpace (Site d)) (S : Finset (Site d))
(τ : {x // x ∈ S} → Bool) : ConfigSpace (Site d) :=
fun x => if h : x ∈ S then τ ⟨x, h⟩ else η x
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:179
def spin (s : ConfigSpace V) (x : V) : ℝ := if s x then 1 else -1
PhyslibExt/CondensedMatter/IsingModel/Gibbs.lean:70
Uses 6 · Used by 6
DefinitionBoltzmann weight on a set with a boundary condition#✓fully proved
The Boltzmann weight of the configuration τ on S with boundary condition η.
noncomputable def gvWeight (η : ConfigSpace (Site d)) (S : Finset (Site d)) (β h : ℝ)
(τ : {x // x ∈ S} → Bool) : ℝ :=
Real.exp (-β * gvEnergy η S 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 gvEnergy (η : ConfigSpace (Site d)) (S : Finset (Site d)) (h : ℝ)
(τ : {x // x ∈ S} → Bool) : ℝ :=
- (∑ e ∈ gvBondTouch S, bond (gvGlue η S τ) e) - h * ∑ x ∈ S, spin (gvGlue η S τ) x
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:192
Uses 3 · Used by 7
DefinitionPartition function on a set with a boundary condition#✓fully proved
The partition function on S with boundary condition η.
noncomputable def gvZ (η : ConfigSpace (Site d)) (S : Finset (Site d)) (β h : ℝ) : ℝ :=
∑ τ : {x // x ∈ S} → Bool, gvWeight η S β 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 gvWeight (η : ConfigSpace (Site d)) (S : Finset (Site d)) (β h : ℝ)
(τ : {x // x ∈ S} → Bool) : ℝ :=
Real.exp (-β * gvEnergy η S h τ)
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:197
Uses 3 · Used by 6
DefinitionGibbs probability on a set with a boundary condition#✓fully proved
The Gibbs probability of τ on S with boundary condition η.
noncomputable def gvProb (η : ConfigSpace (Site d)) (S : Finset (Site d)) (β h : ℝ)
(τ : {x // x ∈ S} → Bool) : ℝ :=
gvWeight η S β h τ / gvZ η S β 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 gvWeight (η : ConfigSpace (Site d)) (S : Finset (Site d)) (β h : ℝ)
(τ : {x // x ∈ S} → Bool) : ℝ :=
Real.exp (-β * gvEnergy η S h τ)
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:197
noncomputable def gvZ (η : ConfigSpace (Site d)) (S : Finset (Site d)) (β h : ℝ) : ℝ :=
∑ τ : {x // x ∈ S} → Bool, gvWeight η S β h τ
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:205
Uses 4 · Used by 6
DefinitionFinite-volume Gibbs measure on a finite set#✓fully proved
The finite-volume Gibbs measure on the finite set S with boundary condition η.
noncomputable def gvMeasure (η : ConfigSpace (Site d)) (S : Finset (Site d)) (β h : ℝ) :
Measure (ConfigSpace (Site d)) :=
∑ τ : {x // x ∈ S} → Bool,
ENNReal.ofReal (gvProb η S β h τ) • Measure.dirac (gvGlue η S τ)
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 gvProb (η : ConfigSpace (Site d)) (S : Finset (Site d)) (β h : ℝ)
(τ : {x // x ∈ S} → Bool) : ℝ :=
gvWeight η S β h τ / gvZ η S β h
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:217
noncomputable def gvGlue (η : ConfigSpace (Site d)) (S : Finset (Site d))
(τ : {x // x ∈ S} → Bool) : ConfigSpace (Site d) :=
fun x => if h : x ∈ S then τ ⟨x, h⟩ else η x
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:179
Uses 4 · Used by 6
DefinitionFinite-volume Gibbs measure with plus boundary condition#✓fully proved
The finite-volume Gibbs measure on S with plus boundary condition.
noncomputable def gvPlusMeasure (S : Finset (Site d)) (β h : ℝ) : Measure (ConfigSpace (Site d)) :=
gvMeasure (plusField d) S β 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 gvMeasure (η : ConfigSpace (Site d)) (S : Finset (Site d)) (β h : ℝ) :
Measure (ConfigSpace (Site d)) :=
∑ τ : {x // x ∈ S} → Bool,
ENNReal.ofReal (gvProb η S β h τ) • Measure.dirac (gvGlue η S τ)
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:231
def plusField (d : ℕ) : ConfigSpace (Site d) := fun _ => true
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:226
Uses 4 · Used by 5
DefinitionOverwriting a configuration on an inner set#✓fully proved
The configuration on Sout obtained by overwriting its spins in Sin with τ.
noncomputable def gvOvr {Sin Sout : Finset (Site d)} (_hsub : Sin ⊆ Sout)
(σ : {x // x ∈ Sout} → Bool) (τ : {x // x ∈ Sin} → Bool) : {x // x ∈ Sout} → Bool :=
fun x => if hn : (x : Site d) ∈ Sin then τ ⟨x, hn⟩ else σ x
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 1 · Used by 2
DefinitionRestriction of a configuration to an inner set#✓fully proved
The restriction of a configuration on Sout to Sin.
noncomputable def gvRes {Sin Sout : Finset (Site d)} (hsub : Sin ⊆ Sout)
(σ : {x // x ∈ Sout} → Bool) : {x // x ∈ Sin} → Bool :=
fun x => σ ⟨x, hsub x.2⟩
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 1 · Used by 2
DefinitionInvolution swapping inner-set parts of configuration pairs#✓fully proved
The involution exchanging the Sin parts of a configuration on Sout and a configuration on
Sin.
noncomputable def gvSwapPair {Sin Sout : Finset (Site d)} (hsub : Sin ⊆ Sout) :
(({x // x ∈ Sout} → Bool) × ({x // x ∈ Sin} → Bool))
→ (({x // x ∈ Sout} → Bool) × ({x // x ∈ Sin} → Bool)) :=
fun p => (gvOvr hsub p.1 p.2, gvRes hsub p.1)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
noncomputable def gvOvr {Sin Sout : Finset (Site d)} (_hsub : Sin ⊆ Sout)
(σ : {x // x ∈ Sout} → Bool) (τ : {x // x ∈ Sin} → Bool) : {x // x ∈ Sout} → Bool :=
fun x => if hn : (x : Site d) ∈ Sin then τ ⟨x, hn⟩ else σ x
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:426
noncomputable def gvRes {Sin Sout : Finset (Site d)} (hsub : Sin ⊆ Sout)
(σ : {x // x ∈ Sout} → Bool) : {x // x ∈ Sin} → Bool :=
fun x => σ ⟨x, hsub x.2⟩
PhyslibExt/CondensedMatter/IsingModel/PlusStateErgodic.lean:431
Uses 3 · Used by 1
DefinitionBox sites as a set and as a finite set#✓fully proved
The sites of the box Λ_n as a set and as a finset.
noncomputable def iptp_boxEquiv (d n : ℕ) :
{x : Site d // x ∈ box d n} ≃ {x : Site d // x ∈ boxFinset d n} :=
Equiv.subtypeEquivProp (by ext x; rw [mem_boxFinset])
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 boxFinset (d n : ℕ) : Finset (Site d) :=
(box_finite d n).toFinset
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:88
Uses 3 · Used by 5
DefinitionTranslation as an equivalence onto a translate#✓fully proved
Translation by g as an equivalence between S and its translate.
noncomputable def iptp_transInteriorEquiv (g : Multiplicative (Site d)) (S : Finset (Site d)) :
{x : Site d // x ∈ S} ≃ {x : Site d // x ∈ S.image (fun x => g • x)} where
toFun x := ⟨g • (x : Site d), Finset.mem_image_of_mem _ x.2⟩
invFun y := ⟨g⁻¹ • (y : Site d), by
obtain ⟨z, hz, hzeq⟩ := Finset.mem_image.mp y.2
rw [← hzeq, inv_smul_smul]; exact hz⟩
left_inv x := by ext; simp [inv_smul_smul]
right_inv y := by ext; simp [smul_inv_smul]
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 1 · Used by 1
TheoremTranslation invariance of the plus state#✓fully proved
For β, h ≥ 0, the plus state of the Ising
model on ℤ^d is invariant under all lattice translations.
S. Friedli and Y. Velenik, Statistical Mechanics of Lattice Systems, Cambridge University Press (2017), Chapter 3.
theorem iptp_plusState_isTranslationInvariant {β : ℝ} (hβ : 0 ≤ β) {h : ℝ} (hh : 0 ≤ h) :
ConfigSpace.IsTranslationInvariant (G := Multiplicative (Site d))
(plusState d β h : Measure (ConfigSpace (Site d)))
def IsTranslationInvariant (μ : Measure (ConfigSpace E)) : Prop :=
∀ g : G, MeasureTheory.MeasurePreserving (shift g : ConfigSpace E → ConfigSpace E) μ μ
MathlibExt/Probability/Configuration/Ergodicity.lean:89
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
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
Uses 64 · Used by 5
TheoremExtremality of the plus state#✓fully proved
For d ≥ 1 and β, h ≥ 0, the plus state is an extreme
point of the translation-invariant probability measures.
H.-O. Georgii, Gibbs Measures and Phase Transitions, de Gruyter (1988), Chapter 14.
theorem ising_plus_extreme (hd : 1 ≤ d) {β : ℝ} (hβ : 0 ≤ β) {h : ℝ} (hh : 0 ≤ h) :
StatMech.FK.IsInvariantExtremePoint (G := Multiplicative (Site d))
(plusState d β h : Measure (ConfigSpace (Site d)))
def IsInvariantExtremePoint (μ : Measure (ConfigSpace E)) : Prop :=
IsTranslationInvariant (G := G) μ ∧ IsProbabilityMeasure μ ∧
∀ (ν₁ ν₂ : Measure (ConfigSpace E)) (a b : ℝ≥0∞),
IsTranslationInvariant (G := G) ν₁ → IsTranslationInvariant (G := G) ν₂ →
IsProbabilityMeasure ν₁ → IsProbabilityMeasure ν₂ →
0 < a → 0 < b → a + b = 1 → μ = a • ν₁ + b • ν₂ → ν₁ = ν₂
PhyslibExt/StatisticalMechanics/RandomCluster/ExtremeIsErgodic.lean:99
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
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
Uses 48
TheoremErgodicity of the plus state#✓fully proved
For d ≥ 1 and β, h ≥ 0, the plus state is ergodic under
lattice translations.
H.-O. Georgii, Gibbs Measures and Phase Transitions, de Gruyter (1988), Chapter 14.
theorem iptp_plusState_isErgodic (hd : 1 ≤ d) {β : ℝ} (hβ : 0 ≤ β) {h : ℝ} (hh : 0 ≤ h) :
IsErgodic (G := Multiplicative (Site d))
(plusState d β h : Measure (ConfigSpace (Site d)))
def IsErgodic (μ : Measure (ConfigSpace E)) : Prop :=
IsTranslationInvariant (G := G) μ ∧
∀ s : Set (ConfigSpace E), MeasurableSet s →
(∀ g : G, (shift g : ConfigSpace E → ConfigSpace E) ⁻¹' s = s) →
μ s = 0 ∨ μ s = μ Set.univ
MathlibExt/Probability/Configuration/Ergodicity.lean:95
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
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
Uses 46
DefinitionExtreme point of the DLR states#✓fully proved
μ is an extreme point of the DLR states: a proper convex decomposition into DLR probability
measures is trivial.
def IsDLRExtremePoint (β h : ℝ) (μ : Measure (ConfigSpace (Site d))) : Prop :=
∀ (ν₁ ν₂ : Measure (ConfigSpace (Site d))) [IsProbabilityMeasure ν₁] [IsProbabilityMeasure ν₂],
IsDLRState d β h ν₁ → IsDLRState d β h ν₂ →
∀ (a b : ℝ≥0∞), 0 < a → 0 < b → a + b = 1 → a ≠ ⊤ → b ≠ ⊤ →
μ = 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
LemmaAll-plus Dirac mass gives the all-plus event probability one#✓fully proved
A nonvacuity check: the Dirac mass at the all-plus configuration gives the all-plus event probability one.
lemma atip2_ergodic_zeroOne_nonvacuous :
(Measure.dirac (fun _ => true) : Measure (ConfigSpace (Site 1)))
{ω : ConfigSpace (Site 1) | ∀ e, ω e = true} = 1
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
DefinitionTail event for lattice spin configurations#✓fully proved
A tail event: measurable with respect to the spins outside Λ_n, for every n.
def IsTailEvent (s : Set (ConfigSpace (Site d))) : Prop :=
∀ n : ℕ, @MeasurableSet _ (outsideSigma (box d n)) s
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
@[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
Definitionσ-algebra generated by the spins in a finite set#✓fully proved
The σ-algebra generated by the spins in the finite set F.
@[reducible] noncomputable def aetc_finSig (F : Finset (Site d)) :
MeasurableSpace (ConfigSpace (Site d)) :=
⨆ e ∈ F, MeasurableSpace.comap (ConfigSpace.eval e) inferInstance
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
def eval (e : E) (ω : ConfigSpace E) : Bool := ω e
MathlibExt/Probability/Configuration/ConfigSpace.lean:47
DefinitionCylinder events of the Ising configuration space#✓fully proved
The cylinder events: events depending on the spins in some box.
def aetc_Cring (d : ℕ) : Set (Set (ConfigSpace (Site d))) :=
{A | ∃ F : Finset (Site d), MeasurableSet[aetc_finSig F] A}
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
@[reducible] noncomputable def aetc_finSig (F : Finset (Site d)) :
MeasurableSpace (ConfigSpace (Site d)) :=
⨆ e ∈ F, MeasurableSpace.comap (ConfigSpace.eval e) inferInstance
PhyslibExt/CondensedMatter/IsingModel/InvariantEventsTail.lean:66
DefinitionApproximation in measure by events measurable outside every box#✓fully proved
For every box Λ_k and ε > 0, s is ε-approximated in μ-measure by an event
measurable outside Λ_k.
def AeApproxFarOut (μ : Measure (ConfigSpace (Site d))) (s : Set (ConfigSpace (Site d))) : Prop :=
∀ (k : ℕ) (ε : ℝ≥0∞), 0 < ε →
∃ A : Set (ConfigSpace (Site d)), @MeasurableSet _ (outsideSigma (box d k)) A ∧ μ (s ∆ A) < ε
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
@[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
LemmaNonvacuity of the a.s.-tail theorem via the all-plus Dirac mass#✓fully proved
The hypotheses of aetc_haeTail are satisfiable: the Dirac mass at the all-plus
configuration.
lemma aetc_haeTail_nonvacuous :
∃ s' : Set (ConfigSpace (Site 1)), IsTailEvent (d := 1) s'
∧ (Set.univ : Set (ConfigSpace (Site 1)))
=ᵐ[(Measure.dirac (fun _ => true) : Measure (ConfigSpace (Site 1)))] s'
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 IsTailEvent (s : Set (ConfigSpace (Site d))) : Prop :=
∀ n : ℕ, @MeasurableSet _ (outsideSigma (box d n)) s
PhyslibExt/CondensedMatter/IsingModel/TailEventsErgodic.lean:111
Uses 13
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.