Exponential decay of the plus-state two-point function below β̃_c
B. Distances and the Simon radius
DefinitionSimon radius of a finite set#✓fully proved
One more than the largest ℓ¹ distance from the origin of a point of T or of the outer
endpoint of a boundary edge of T.
noncomputable def isingSimonRadius (d : ℕ) (T : Finset (Site d)) : ℕ :=
max (T.sup (fun x ↦ l1dist d (origin d) x))
((boundaryEdges d T).sup (fun e ↦ l1dist d (origin d) e.2)) + 1
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def l1dist (d : ℕ) (x y : Site d) : ℕ := ∑ i, (x i - y i).natAbs
MathlibExt/Combinatorics/SimpleGraph/Lattice/PlanarTopology.lean:245
def origin (d : ℕ) : Site d := fun _ => 0
MathlibExt/Probability/Percolation/Theta.lean:56
noncomputable def boundaryEdges (d : ℕ) (S : Finset (Site d)) :
Finset (Site d × Site d) := by
classical
exact
((S ×ˢ (Finset.univ : Finset (Fin d)) ×ˢ (Finset.univ : Finset Bool)).filter
(fun t => coordShift t.1 t.2.1 (stepSign t.2.2) ∉ S)).image
(fun t => (t.1, coordShift t.1 t.2.1 (stepSign t.2.2)))
MathlibExt/Probability/Percolation/TildePc.lean:60
C. The tail supremum and its recursion
DefinitionTail set of plus-state correlations#✓fully proved
The set of values ⟨σ_0σ_z⟩^+_β with ‖z‖₁ ≥ n, together with 0.
def plusCorrTailSet (d : ℕ) (beta : ℝ) (n : ℕ) : Set ℝ :=
insert 0 {r | ∃ z : Site d, n ≤ l1dist d (origin d) z ∧
r = plusCorr d beta (origin d) z}
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def l1dist (d : ℕ) (x y : Site d) : ℕ := ∑ i, (x i - y i).natAbs
MathlibExt/Combinatorics/SimpleGraph/Lattice/PlanarTopology.lean:245
def origin (d : ℕ) : Site d := fun _ => 0
MathlibExt/Probability/Percolation/Theta.lean:56
noncomputable def plusCorr (d : ℕ) (β : ℝ) (x y : Site d) : ℝ :=
∫ ω, spin ω x * spin ω y
∂(plusState d β 0 : Measure (ConfigSpace (Site d)))
PhyslibExt/CondensedMatter/IsingModel/Sharpness/SimonPlusLimit.lean:69
Uses 4 · Used by 2
DefinitionTail supremum of plus-state correlations#✓fully proved
The tail supremum sup {⟨σ_0σ_z⟩^+_β | ‖z‖₁ ≥ n} (and 0).
noncomputable def plusCorrTailSup (d : ℕ) (beta : ℝ) (n : ℕ) : ℝ :=
sSup (plusCorrTailSet d beta n)
def plusCorrTailSet (d : ℕ) (beta : ℝ) (n : ℕ) : Set ℝ :=
insert 0 {r | ∃ z : Site d, n ≤ l1dist d (origin d) z ∧
r = plusCorr d beta (origin d) z}
PhyslibExt/CondensedMatter/IsingModel/Sharpness/IsingExponentialPlus.lean:239
Uses 1 · Used by 1
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.