Compatible colorings in the Edwards–Sokal coupling
A. Compatible colorings
DefinitionCompatibility of a coloring with a bond configuration#✓fully proved
A coloring σ is compatible with the bond configuration ω if every open edge of G joins
vertices of the same color. See also FK.ConstOnOpen (compatible_iff_constOnOpen).
def Compatible {q : ℕ} (σ : V → Fin q) (ω : ConfigSpace (Sym2 V)) : Prop :=
∀ x y, G.Adj x y → ω s(x, y) = true → σ x = σ y
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
Uses 1 · Used by 1
DefinitionMonochromatic edge indicator#✓fully proved
Whether an edge is monochromatic under the coloring σ.
def monoBool {q : ℕ} (σ : V → Fin q) : Sym2 V → Bool :=
Sym2.lift ⟨fun x y => decide (σ x = σ y), by
intro a b
simp only [decide_eq_decide]
exact ⟨Eq.symm, Eq.symm⟩⟩
Used by 1
DefinitionEdges with differently colored endpoints#✓fully proved
The edges of G whose endpoints have different colors.
def disagreeEdges {q : ℕ} (σ : V → Fin q) : Finset (Sym2 V) :=
G.edgeFinset.filter (fun e => ¬ monoBool σ e)
def monoBool {q : ℕ} (σ : V → Fin q) : Sym2 V → Bool :=
Sym2.lift ⟨fun x y => decide (σ x = σ y), by
intro a b
simp only [decide_eq_decide]
exact ⟨Eq.symm, Eq.symm⟩⟩
PhyslibExt/CondensedMatter/IsingModel/FKRepresentation/Coloring.lean:85
Uses 1
B. Colorings of the open clusters
DefinitionVertex coloring induced by a coloring of open clusters#✓fully proved
The coloring of the vertices obtained from a coloring τ of the open clusters of ω.
def coloring {q : ℕ} (ω : ConfigSpace (Sym2 V))
(τ : (openSub G ω).ConnectedComponent → Fin q) : V → Fin q :=
fun v => τ ((openSub G ω).connectedComponentMk v)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def openSub (ω : ConfigSpace (Sym2 V)) : SimpleGraph V where
Adj x y := G.Adj x y ∧ ω s(x, y) = true
symm := by
refine ⟨fun x y h => ?_⟩
refine ⟨h.1.symm, ?_⟩
rw [Sym2.eq_swap]; exact h.2
loopless := ⟨fun x h => h.1.ne rfl⟩
PhyslibExt/StatisticalMechanics/RandomCluster/RandomCluster.lean:82
Uses 2
C. The joint Edwards–Sokal probability
DefinitionEdwards–Sokal joint probability#✓fully proved
The joint Edwards–Sokal probability of the coloring σ and the bond configuration ω.
noncomputable def esJointProb (q : ℕ) (p : ℝ) (σ : V → Fin q) (ω : ConfigSpace (Sym2 V)) : ℝ :=
esWeight G p σ ω / esZ G q p
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def esWeight {q : ℕ} (p : ℝ) (σ : V → Fin q) (ω : ConfigSpace (Sym2 V)) : ℝ :=
∏ e ∈ G.edgeFinset, esEdgeFactor p σ ω e
PhyslibExt/StatisticalMechanics/RandomCluster/EdwardsSokal.lean:71
noncomputable def esZ (q : ℕ) (p : ℝ) : ℝ :=
∑ ω : ConfigSpace (Sym2 V), ∑ σ : V → Fin q, esWeight G p σ ω
PhyslibExt/StatisticalMechanics/RandomCluster/EdwardsSokal.lean:313
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.