Outer contours on the square lattice
A. The doubled Peierls series
DefinitionTwice the Peierls series#✓fully proved
Twice the Peierls series.
noncomputable def twoPeierlsBound (d : ℕ) (β : ℝ) : ℝ := 2 * peierlsBound d β
noncomputable def peierlsBound (d : ℕ) (β : ℝ) : ℝ :=
∑' ℓ : ℕ, (ℓ : ℝ) * (2 * d : ℝ) ^ ℓ * Real.exp (-(2 * β) * ℓ)
PhyslibExt/CondensedMatter/IsingModel/PeierlsCriterion.lean:71
Uses 1 · Used by 3
B. Outer circuits
DefinitionAssignment of interiors to closed walks of \(\mathbb{Z}^2\)#✓fully proved
An assignment of a set of sites (its interior) to every closed walk of ℤ².
def InteriorAssignment : Type :=
(u : Site 2) → (hypercubicLattice 2).Walk u u → Finset (Site 2)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
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 2 · Used by 2
DefinitionOuter contour map: clusters as interiors of boundary circuits#✓fully proved
Every cluster through the origin is the interior of one of its closed boundary circuits, for some interior assignment.
def OuterContourMap (n : ℕ) : Prop :=
∃ interiorOf : InteriorAssignment,
(∀ (ℓ : ℕ) (u : Site 2) (γ : (hypercubicLattice 2).Walk u u),
u ∈ anchorFinset ℓ → γ.length = ℓ → γ.IsCycle →
(↑(interiorOf u γ) : Set (Site 2)) ⊆ box 2 n ∧
contourLen (↑(interiorOf u γ)) (bondFinsetTouch 2 n) = ℓ) ∧
(∀ τ : {x // x ∈ box 2 n} → Bool, glue (plusField 2) τ (origin 2) = false →
∃ (ℓ : ℕ) (u : Site 2) (γ : (hypercubicLattice 2).Walk u u),
u ∈ anchorFinset ℓ ∧ γ.length = ℓ ∧ γ.IsCycle ∧
ContourEvent (↑(interiorOf u γ)) (bondFinsetTouch 2 n) (glue (plusField 2) τ))
def InteriorAssignment : Type :=
(u : Site 2) → (hypercubicLattice 2).Walk u u → Finset (Site 2)
PhyslibExt/CondensedMatter/IsingModel/PeierlsOuterContour.lean:122
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
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
noncomputable def anchorFinset (ℓ : ℕ) : Finset (Site 2) :=
((Finset.range ℓ).image (fun j : ℕ => (![ (j : ℤ), 0] : Site 2))) ∪
((Finset.range ℓ).image (fun j : ℕ => (![ (j : ℤ), -1] : Site 2)))
MathlibExt/Probability/Percolation/PcUpperEnclosure.lean:171
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
noncomputable def contourLen (K : Set (Site d)) (B : Finset (Sym2 (Site d))) : ℕ :=
(crossEdges K B).card
PhyslibExt/CondensedMatter/IsingModel/PeierlsContours.lean:116
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 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
def plusField (d : ℕ) : ConfigSpace (Site d) := fun _ => true
PhyslibExt/CondensedMatter/IsingModel/InfiniteVolume.lean:226
def origin (d : ℕ) : Site d := fun _ => 0
PhyslibExt/CondensedMatter/IsingModel/Peierls.lean:195
def ContourEvent (K : Set (Site d)) (B : Finset (Sym2 (Site d))) (σ : ConfigSpace (Site d)) :
Prop :=
∀ e ∈ crossEdges K B, bond σ e = -1
PhyslibExt/CondensedMatter/IsingModel/PeierlsContours.lean:176
Uses 11
DefinitionCycles of length less than \(M\) based near the origin#✓fully proved
The closed walks of ℤ² of length at most M based near the origin.
noncomputable def poc_circuitFamily (M : ℕ) :
Finset (Σ _ℓ : ℕ, Σ u : Site 2, (hypercubicLattice 2).Walk u u) :=
(Finset.range M).sigma (fun ℓ => Percolation.cyclesAtLen ℓ)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
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
noncomputable def cyclesAtLen (ℓ : ℕ) :
Finset (Σ u : Site 2, (hypercubicLattice 2).Walk u u) :=
(anchorFinset ℓ).sigma
(fun u => ((hypercubicLattice 2).finsetWalkLength ℓ u u).filter (·.IsCycle))
MathlibExt/Probability/Percolation/PcUpperEnclosure.lean:187
Uses 3
DefinitionBoltzmann weight of a closed walk in the circuit sum#✓fully proved
The Boltzmann weight attached to a closed walk in the circuit sum.
noncomputable def poc_circuitSummand (n : ℕ) (β : ℝ) (interiorOf : InteriorAssignment)
(σ : Σ _ℓ : ℕ, Σ u : Site 2, (hypercubicLattice 2).Walk u u) : ℝ :=
probContour (↑(interiorOf σ.2.1 σ.2.2)) (plusField 2) n (bondFinsetTouch 2 n) β
def InteriorAssignment : Type :=
(u : Site 2) → (hypercubicLattice 2).Walk u u → Finset (Site 2)
PhyslibExt/CondensedMatter/IsingModel/PeierlsOuterContour.lean:122
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
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
noncomputable def probContour (K : Set (Site d)) (η : ConfigSpace (Site d)) (n : ℕ)
(B : Finset (Sym2 (Site d))) (β : ℝ) : ℝ :=
∑ τ : {x // x ∈ box d n} → Bool,
(if ContourEvent K B (glue η τ) then fvProb η n B β 0 τ else 0)
PhyslibExt/CondensedMatter/IsingModel/PeierlsContours.lean:256
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
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.