math / data /lean /OAI /Probability /FreeIsing /Model.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
2.84 kB
import Mathlib
namespace OAI
noncomputable section
open MeasureTheory
namespace Problem367
abbrev TreeVertex (d : β„•) :=
{word : List (Fin d) // List.IsChain (fun first second : Fin d => first β‰  second) word}
def treeAdj {d : β„•} (u v : TreeVertex d) : Prop :=
(βˆƒ c : Fin d, v.1 = u.1 ++ [c]) ∨
(βˆƒ c : Fin d, u.1 = v.1 ++ [c])
structure TreeAut (d : β„•) where
toEquiv : TreeVertex d ≃ TreeVertex d
map_adj : βˆ€ u v, treeAdj (toEquiv u) (toEquiv v) ↔ treeAdj u v
def relabel {d : β„•} {Ξ± : Type*} (g : TreeAut d)
(x : TreeVertex d β†’ Ξ±) : TreeVertex d β†’ Ξ± :=
fun v => x (g.toEquiv.symm v)
inductive IsingSpin where
| neg
| pos
deriving DecidableEq
protected abbrev IsingSpin.enumList : List IsingSpin := [.neg, .pos]
protected theorem IsingSpin.enumList_getElem?_ctorIdx_eq (x : IsingSpin) :
IsingSpin.enumList[x.ctorIdx]? = some x := by
cases x <;> rfl
protected theorem IsingSpin.enumList_nodup : IsingSpin.enumList.Nodup := by decide
instance : Fintype IsingSpin where
elems := ⟨IsingSpin.enumList, IsingSpin.enumList_nodup⟩
complete x := by cases x <;> decide
instance isingSpinMeasurable : MeasurableSpace IsingSpin := ⊀
def uniform01 : Measure ℝ :=
volume.restrict (Set.Icc (0 : ℝ) 1)
instance uniform01Probability : IsProbabilityMeasure uniform01 where
measure_univ := by simp [uniform01]
def labelMeasure (d : β„•) : Measure (TreeVertex d β†’ ℝ) := by
classical
exact Measure.infinitePi (fun _ : TreeVertex d => uniform01)
def ConnectedFinset {d : β„•} (D : Finset (TreeVertex d)) : Prop :=
D.Nonempty ∧
βˆ€ u ∈ D, βˆ€ v ∈ D,
Relation.ReflTransGen
(fun x y : TreeVertex d => x ∈ D ∧ y ∈ D ∧ treeAdj x y) u v
def inducedEdges {d : β„•} (D : Finset (TreeVertex d)) :
Finset (TreeVertex d Γ— TreeVertex d) := by
classical
exact (D.product D).filter (fun e =>
treeAdj e.1 e.2 ∧ e.1.1.length < e.2.1.length)
def freeCylinderWeight {d : β„•} (theta : ℝ)
(D : Finset (TreeVertex d)) (eta : TreeVertex d β†’ IsingSpin) : ENNReal :=
ENNReal.ofReal
((1 / 2 : ℝ) *
Finset.prod (inducedEdges D) (fun e =>
(1 + (if eta e.1 = eta e.2 then theta else -theta)) / 2))
def HasFreeIsingLaw {d : β„•} (theta : ℝ)
(mu : Measure (TreeVertex d β†’ IsingSpin)) : Prop :=
βˆ€ (D : Finset (TreeVertex d)), ConnectedFinset D β†’
βˆ€ eta : TreeVertex d β†’ IsingSpin,
mu {x | βˆ€ v ∈ D, x v = eta v} = freeCylinderWeight theta D eta
def IsFactorOfIID (d : β„•) (theta : ℝ) : Prop :=
βˆƒ Phi : (TreeVertex d β†’ ℝ) β†’ (TreeVertex d β†’ IsingSpin),
Measurable Phi ∧
HasFreeIsingLaw theta (Measure.map Phi (labelMeasure d)) ∧
βˆ€ g : TreeAut d,
βˆ€α΅ U βˆ‚labelMeasure d, Phi (relabel g U) = relabel g (Phi U)
end Problem367
end
end OAI