Ising model on a finite graph
DefinitionConfiguration equivalence induced by a vertex relabeling#✓fully proved
StatMech.Ising.isingCfgEquiv
The equivalence of configuration spaces induced by a vertex equivalence σ : V ≃ W: ω ↦ ω ∘
σ.
def isingCfgEquiv (σ : V ≃ W) : ConfigSpace W ≃ ConfigSpace V where
toFun ω := fun x => ω (σ x)
invFun ω := fun y => ω (σ.symm y)
left_inv ω := by funext y; simp
right_inv ω := by funext x; simp
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
DefinitionConfigurations on a disjoint union as pairs of configurations#✓fully proved
StatMech.Ising.isingSumConfigEquiv
The equivalence between configurations on V ⊕ W and pairs of configurations on V and W.
def isingSumConfigEquiv : ConfigSpace (V ⊕ W) ≃ ConfigSpace V × ConfigSpace W :=
Equiv.sumPiEquivProdPi (fun _ : V ⊕ W => Bool)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
2 fully proved
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.