File size: 2,838 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 | 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
|