File size: 9,920 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 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 | import Mathlib
import OAI.MathematicalPhysics.PEPSFilters.LocalOperators
namespace OAI
/-! Finite submodular covers and tile entropy summation. -/
noncomputable section
open scoped BigOperators ComplexOrder
open scoped BigOperators ComplexOrder Matrix.Norms.L2Operator
open scoped BigOperators
open scoped Topology
open Filter
open scoped MatrixOrder
open scoped BigOperators Matrix.Norms.L2Operator
open scoped ComplexOrder BigOperators Matrix.Norms.L2Operator
open Matrix
open Filter Topology
open Set Filter Complex Complex.HadamardThreeLines
open scoped BigOperators Matrix.Norms.L2Operator MatrixOrder ComplexOrder
open PolynomialPEPS.PinnedEntropy
open scoped BigOperators
namespace PolynomialPEPS.SubvolumeTiling
variable {Ξ± ΞΉ : Type*} [DecidableEq Ξ±] [DecidableEq ΞΉ]
def unionTiles (C : ΞΉ β Finset Ξ±) (s : Finset ΞΉ) : Finset Ξ± := s.biUnion C
omit [DecidableEq ΞΉ] in
@[simp] theorem unionTiles_empty (C : ΞΉ β Finset Ξ±) : unionTiles C β
=β
:= by simp [unionTiles]
@[simp] theorem unionTiles_insert (C : ΞΉ β Finset Ξ±) (i : ΞΉ) (s : Finset ΞΉ) :
unionTiles C (insert i s)=C i βͺ unionTiles C s := by simp [unionTiles]
omit [DecidableEq ΞΉ] in
theorem subset_unionTiles (C : ΞΉ β Finset Ξ±) (s : Finset ΞΉ) (i : ΞΉ) (hi : iβs) :
C i β unionTiles C s := Finset.subset_biUnion_of_mem C hi
omit [DecidableEq ΞΉ] in
theorem unionTiles_mono (C : ΞΉ β Finset Ξ±) {s t : Finset ΞΉ} (hst : s β t) :
unionTiles C s β unionTiles C t := by
intro x hx
obtain β¨i,hi,hxβ© := Finset.mem_biUnion.mp hx
exact Finset.mem_biUnion.mpr β¨i,hst hi,hxβ©
omit [DecidableEq ΞΉ] in
theorem disjoint_unionTiles (C : ΞΉ β Finset Ξ±) (s : Finset ΞΉ) (i : ΞΉ)
(hd : β jβs, Disjoint (C i) (C j)) : Disjoint (C i) (unionTiles C s) := by
simp only [unionTiles,Finset.disjoint_biUnion_right]
exact hd
theorem condition_on_past (S : Finset Ξ± β β)
(hssa : β C X Y, C β X β X β Y β S Y-S (Y\C) β€ S X-S (X\C))
(C Y B : Finset Ξ±) (hCY : C β Y) (hY : Y\C β B) (hCB : Disjoint C B) :
S (BβͺC)-S B β€ S Y-S (Y\C) := by
have hsub : Y β BβͺC := by
intro x hx
by_cases hc : xβC
Β· exact Finset.mem_union_right B hc
Β· exact Finset.mem_union_left C (hY (Finset.mem_sdiff.mpr β¨hx,hcβ©))
have hdiff : (BβͺC)\C=B := by
ext x
simp only [Finset.mem_sdiff,Finset.mem_union]
constructor
Β· tauto
Β· intro hx
exact β¨Or.inl hx,fun hc => Finset.disjoint_left.mp hCB hc hxβ©
simpa only [hdiff] using hssa C Y (BβͺC) hCY hsub
theorem selected_tiles (S : Finset Ξ± β β)
(hssa : β C X Y, C β X β X β Y β S Y-S (Y\C) β€ S X-S (X\C))
(C Y : ΞΉ β Finset Ξ±) (B : Finset Ξ±) (s : Finset ΞΉ)
(hCY : β iβs, C i β Y i) (hY : β iβs, Y i\C i β B)
(hB : β iβs, Disjoint (C i) B)
(hdis : (s : Set ΞΉ).Pairwise (fun i j => Disjoint (C i) (C j))) :
S (BβͺunionTiles C s) β€ S B + β iβs, (S (Y i)-S (Y i\C i)) := by
induction s using Finset.induction_on with
| empty => simp
| @insert i s hi ih =>
have hs : s β insert i s := Finset.subset_insert _ _
have hd : Disjoint (C i) (unionTiles C s) := disjoint_unionTiles C s i
(fun j hj => hdis (by simp) (Finset.mem_insert_of_mem hj) (by intro h; subst j; exact hi hj))
have hstep := condition_on_past S hssa (C i) (Y i) (BβͺunionTiles C s)
(hCY i (by simp))
((hY i (by simp)).trans Finset.subset_union_left)
(Finset.disjoint_union_right.mpr β¨hB i (by simp),hdβ©)
have hind := ih (fun j hj => hCY j (hs hj)) (fun j hj => hY j (hs hj))
(fun j hj => hB j (hs hj)) (hdis.mono hs)
rw [unionTiles_insert,Finset.sum_insert hi]
have he : Bβͺ(C iβͺunionTiles C s)=(BβͺunionTiles C s)βͺC i := by
ext x; simp only [Finset.mem_union]; tauto
rw [he]
linarith only [hstep,hind]
theorem tiles_subadditive (S : Finset Ξ± β β) (hzero : S β
=0)
(hssa : β C X Y, C β X β X β Y β S Y-S (Y\C) β€ S X-S (X\C))
(C : ΞΉ β Finset Ξ±) (s : Finset ΞΉ)
(hdis : (s : Set ΞΉ).Pairwise (fun i j => Disjoint (C i) (C j))) :
S (unionTiles C s) β€ β iβs, S (C i) := by
have h := selected_tiles S hssa C C β
s (fun _ _ => Finset.Subset.refl _)
(by intro i hi; simp) (by intro i hi; simp) hdis
simpa only [Finset.empty_union,Finset.sdiff_self,hzero,sub_zero,zero_add] using h
end PolynomialPEPS.SubvolumeTiling
namespace PolynomialPEPS.SubvolumeTiling
open scoped BigOperators
variable {Ξ± ΞΉ ΞΊ : Type*} [DecidableEq Ξ±] [DecidableEq ΞΉ] [Fintype ΞΊ] [DecidableEq ΞΊ]
theorem selected_color (S : Finset Ξ± β β) (hzero : S β
=0)
(hssa : β C X Y, C β X β X β Y β S Y-S (Y\C) β€ S X-S (X\C))
(C Y : ΞΉ β Finset Ξ±) (s g : Finset ΞΉ) (hg : g β s)
(hdis : (s : Set ΞΉ).Pairwise (fun i j => Disjoint (C i) (C j)))
(hCY : β iβg, C i β Y i)
(hY : β iβg, Y i\C i β unionTiles C (s\g))
(b : β) (hc : β iβg, S (Y i)-S (Y i\C i) β€ S (C i)/4+b) :
S (unionTiles C s) β€ (β iβs, S (C i))-(3/4)*(β iβg, S (C i))+(g.card:β)*b := by
have hB : β iβg, Disjoint (C i) (unionTiles C (s\g)) := by
intro i hi
apply disjoint_unionTiles
intro j hj
exact hdis (hg hi) (Finset.mem_sdiff.mp hj).1 (by
intro he; subst j; exact (Finset.mem_sdiff.mp hj).2 hi)
have hs := selected_tiles S hssa C Y (unionTiles C (s\g)) g hCY hY hB (hdis.mono hg)
have he : unionTiles C (s\g)βͺunionTiles C g=unionTiles C s := by
simp only [unionTiles,β Finset.union_biUnion,Finset.sdiff_union_of_subset hg]
rw [he] at hs
have hb := tiles_subadditive S hzero hssa C (s\g) (hdis.mono Finset.sdiff_subset)
have hsum := Finset.sum_le_sum (fun i hi => hc i hi)
simp only [Finset.sum_add_distrib,β Finset.sum_div,Finset.sum_const,nsmul_eq_mul] at hsum
have hsplit : (β iβs\g,S (C i))+(β iβg,S (C i))=β iβs,S (C i) :=
Finset.sum_sdiff hg
linarith only [hs,hb,hsum,hsplit]
theorem color_average (S : Finset Ξ± β β) (hzero : S β
=0)
(hssa : β C X Y, C β X β X β Y β S Y-S (Y\C) β€ S X-S (X\C))
(C Y : ΞΉ β Finset Ξ±) (s interior : Finset ΞΉ) (hi : interior β s)
(color : ΞΉ β ΞΊ)
(hdis : (s : Set ΞΉ).Pairwise (fun i j => Disjoint (C i) (C j)))
(hCY : β iβinterior, C i β Y i)
(hY : β k : ΞΊ, β iβinterior, color i=k β
Y i\C i β unionTiles C (s\interior.filter (fun j => color j=k)))
(b : β) (hc : β iβinterior, S (Y i)-S (Y i\C i) β€ S (C i)/4+b) :
(Fintype.card ΞΊ:β)*S (unionTiles C s) β€
(Fintype.card ΞΊ:β)*(β iβs,S (C i))-(3/4)*(β iβinterior,S (C i))+
(interior.card:β)*b := by
have h (k : ΞΊ) := selected_color S hzero hssa C Y s (interior.filter (fun j => color j=k))
(Finset.filter_subset _ _ |>.trans hi) hdis
(fun i hi' => hCY i (Finset.mem_filter.mp hi').1)
(fun i hi' => hY k i (Finset.mem_filter.mp hi').1 (Finset.mem_filter.mp hi').2)
b (fun i hi' => hc i (Finset.mem_filter.mp hi').1)
have hf (f : ΞΉ β β) : (β k : ΞΊ, β iβinterior.filter (fun j => color j=k),f i)=
β iβinterior,f i := by
simp_rw [Finset.sum_filter]
rw [Finset.sum_comm]
simp
have hcard : (β k : ΞΊ, ((interior.filter (fun j => color j=k)).card:β))=(interior.card:β) := by
simpa only [Finset.sum_const,one_mul,nsmul_eq_mul,mul_one] using hf (fun _ => 1)
have hh := Finset.sum_le_sum (fun k (_ :kβ(Finset.univ : Finset ΞΊ)) => h k)
simp only [Finset.sum_add_distrib,Finset.sum_sub_distrib,β Finset.mul_sum,
β Finset.sum_mul,Finset.sum_const,Finset.card_univ,nsmul_eq_mul,hf,hcard] at hh
exact hh
theorem color_recurrence [Nonempty ΞΊ] (S : Finset Ξ± β β) (hzero : S β
=0)
(hssa : β C X Y, C β X β X β Y β S Y-S (Y\C) β€ S X-S (X\C))
(C Y : ΞΉ β Finset Ξ±) (s interior : Finset ΞΉ) (hi : interior β s)
(color : ΞΉ β ΞΊ)
(hdis : (s : Set ΞΉ).Pairwise (fun i j => Disjoint (C i) (C j)))
(hCY : β iβinterior, C i β Y i)
(hY : β k : ΞΊ, β iβinterior, color i=k β
Y i\C i β unionTiles C (s\interior.filter (fun j => color j=k)))
(b F : β) (hc : β iβinterior, S (Y i)-S (Y i\C i) β€ S (C i)/4+b)
(hF : β iβs, S (C i) β€ F) :
S (unionTiles C s) β€
((s.card:β)-3/(4*(Fintype.card ΞΊ:β))*(interior.card:β))*F+
(interior.card:β)*b/(Fintype.card ΞΊ:β) := by
let K : β := Fintype.card ΞΊ
have hK : 1β€K := by
have hh : 1β€Fintype.card ΞΊ := Fintype.card_pos
change (1:β)β€(Fintype.card ΞΊ:β)
exact_mod_cast hh
have hK0 : 0<K := lt_of_lt_of_le zero_lt_one hK
have hh := color_average S hzero hssa C Y s interior hi color hdis hCY hY b hc
have hsplit : (β iβs\interior,S (C i))+(β iβinterior,S (C i))=β iβs,S (C i) :=
Finset.sum_sdiff hi
have hcard : ((s\interior).card:β)+(interior.card:β)=(s.card:β) := by
exact_mod_cast Finset.card_sdiff_add_card_eq_card hi
have hbd : (β iβs\interior,S (C i)) β€ ((s\interior).card:β)*F := by
simpa only [Finset.sum_const,nsmul_eq_mul] using
Finset.sum_le_sum (fun i hi' => hF i (Finset.mem_sdiff.mp hi').1)
have hin : (β iβinterior,S (C i)) β€ (interior.card:β)*F := by
simpa only [Finset.sum_const,nsmul_eq_mul] using
Finset.sum_le_sum (fun i hi' => hF i (hi hi'))
have h1 := mul_le_mul_of_nonneg_left hbd (le_of_lt hK0)
have h2 := mul_le_mul_of_nonneg_left hin (show 0β€K-3/4 by linarith)
change K*_ β€ K*_-(3/4)*_+_ at hh
apply (mul_le_mul_iff_rightβ hK0).mp ?_
have he : K*(((s.card:β)-3/(4*K)*(interior.card:β))*F+
(interior.card:β)*b/K) =
K*((s.card:β)*F)-(3/4)*((interior.card:β)*F)+(interior.card:β)*b := by
field_simp
rw [he]
rw [β hsplit] at hh
rw [β hcard]
linarith only [hh,h1,h2]
end PolynomialPEPS.SubvolumeTiling
end
end OAI
|