author | wenzelm |
Thu, 19 Jun 2008 20:48:01 +0200 | |
changeset 27277 | 7b7ce2d7fafe |
parent 27268 | 1d8c6703c7b1 |
child 27288 | 274b80691259 |
permissions | -rw-r--r-- |
25904 | 1 |
(* Title: HOLCF/CompactBasis.thy |
2 |
ID: $Id$ |
|
3 |
Author: Brian Huffman |
|
4 |
*) |
|
5 |
||
6 |
header {* Compact bases of domains *} |
|
7 |
||
8 |
theory CompactBasis |
|
9 |
imports Bifinite SetPcpo |
|
10 |
begin |
|
11 |
||
12 |
subsection {* Ideals over a preorder *} |
|
13 |
||
27268 | 14 |
locale preorder = |
15 |
fixes r :: "'a::type \<Rightarrow> 'a \<Rightarrow> bool" (infix "\<preceq>" 50) |
|
16 |
assumes r_refl: "x \<preceq> x" |
|
17 |
assumes r_trans: "\<lbrakk>x \<preceq> y; y \<preceq> z\<rbrakk> \<Longrightarrow> x \<preceq> z" |
|
25904 | 18 |
begin |
19 |
||
20 |
definition |
|
21 |
ideal :: "'a set \<Rightarrow> bool" where |
|
27268 | 22 |
"ideal A = ((\<exists>x. x \<in> A) \<and> (\<forall>x\<in>A. \<forall>y\<in>A. \<exists>z\<in>A. x \<preceq> z \<and> y \<preceq> z) \<and> |
23 |
(\<forall>x y. x \<preceq> y \<longrightarrow> y \<in> A \<longrightarrow> x \<in> A))" |
|
25904 | 24 |
|
25 |
lemma idealI: |
|
26 |
assumes "\<exists>x. x \<in> A" |
|
27268 | 27 |
assumes "\<And>x y. \<lbrakk>x \<in> A; y \<in> A\<rbrakk> \<Longrightarrow> \<exists>z\<in>A. x \<preceq> z \<and> y \<preceq> z" |
28 |
assumes "\<And>x y. \<lbrakk>x \<preceq> y; y \<in> A\<rbrakk> \<Longrightarrow> x \<in> A" |
|
25904 | 29 |
shows "ideal A" |
30 |
unfolding ideal_def using prems by fast |
|
31 |
||
32 |
lemma idealD1: |
|
33 |
"ideal A \<Longrightarrow> \<exists>x. x \<in> A" |
|
34 |
unfolding ideal_def by fast |
|
35 |
||
36 |
lemma idealD2: |
|
27268 | 37 |
"\<lbrakk>ideal A; x \<in> A; y \<in> A\<rbrakk> \<Longrightarrow> \<exists>z\<in>A. x \<preceq> z \<and> y \<preceq> z" |
25904 | 38 |
unfolding ideal_def by fast |
39 |
||
40 |
lemma idealD3: |
|
27268 | 41 |
"\<lbrakk>ideal A; x \<preceq> y; y \<in> A\<rbrakk> \<Longrightarrow> x \<in> A" |
25904 | 42 |
unfolding ideal_def by fast |
43 |
||
44 |
lemma ideal_directed_finite: |
|
45 |
assumes A: "ideal A" |
|
27268 | 46 |
shows "\<lbrakk>finite U; U \<subseteq> A\<rbrakk> \<Longrightarrow> \<exists>z\<in>A. \<forall>x\<in>U. x \<preceq> z" |
25904 | 47 |
apply (induct U set: finite) |
48 |
apply (simp add: idealD1 [OF A]) |
|
49 |
apply (simp, clarify, rename_tac y) |
|
50 |
apply (drule (1) idealD2 [OF A]) |
|
51 |
apply (clarify, erule_tac x=z in rev_bexI) |
|
27268 | 52 |
apply (fast intro: r_trans) |
25904 | 53 |
done |
54 |
||
27268 | 55 |
lemma ideal_principal: "ideal {x. x \<preceq> z}" |
25904 | 56 |
apply (rule idealI) |
57 |
apply (rule_tac x=z in exI) |
|
27268 | 58 |
apply (fast intro: r_refl) |
25904 | 59 |
apply (rule_tac x=z in bexI, fast) |
27268 | 60 |
apply (fast intro: r_refl) |
61 |
apply (fast intro: r_trans) |
|
25904 | 62 |
done |
63 |
||
27268 | 64 |
lemma ex_ideal: "\<exists>A. ideal A" |
65 |
by (rule exI, rule ideal_principal) |
|
66 |
||
25904 | 67 |
lemma directed_image_ideal: |
68 |
assumes A: "ideal A" |
|
27268 | 69 |
assumes f: "\<And>x y. x \<preceq> y \<Longrightarrow> f x \<sqsubseteq> f y" |
25904 | 70 |
shows "directed (f ` A)" |
71 |
apply (rule directedI) |
|
72 |
apply (cut_tac idealD1 [OF A], fast) |
|
73 |
apply (clarify, rename_tac a b) |
|
74 |
apply (drule (1) idealD2 [OF A]) |
|
75 |
apply (clarify, rename_tac c) |
|
76 |
apply (rule_tac x="f c" in rev_bexI) |
|
77 |
apply (erule imageI) |
|
78 |
apply (simp add: f) |
|
79 |
done |
|
80 |
||
81 |
lemma adm_ideal: "adm (\<lambda>A. ideal A)" |
|
82 |
unfolding ideal_def by (intro adm_lemmas adm_set_lemmas) |
|
83 |
||
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
84 |
lemma lub_image_principal: |
27268 | 85 |
assumes f: "\<And>x y. x \<preceq> y \<Longrightarrow> f x \<sqsubseteq> f y" |
86 |
shows "(\<Squnion>x\<in>{x. x \<preceq> y}. f x) = f y" |
|
25904 | 87 |
apply (rule thelubI) |
88 |
apply (rule is_lub_maximal) |
|
89 |
apply (rule ub_imageI) |
|
90 |
apply (simp add: f) |
|
91 |
apply (rule imageI) |
|
27268 | 92 |
apply (simp add: r_refl) |
25904 | 93 |
done |
94 |
||
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
95 |
end |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
96 |
|
27268 | 97 |
interpretation sq_le: preorder ["sq_le :: 'a::po \<Rightarrow> 'a \<Rightarrow> bool"] |
98 |
apply unfold_locales |
|
99 |
apply (rule refl_less) |
|
100 |
apply (erule (1) trans_less) |
|
101 |
done |
|
102 |
||
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
103 |
subsection {* Defining functions in terms of basis elements *} |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
104 |
|
26034 | 105 |
lemma finite_directed_contains_lub: |
106 |
"\<lbrakk>finite S; directed S\<rbrakk> \<Longrightarrow> \<exists>u\<in>S. S <<| u" |
|
25904 | 107 |
apply (drule (1) directed_finiteD, rule subset_refl) |
108 |
apply (erule bexE) |
|
26034 | 109 |
apply (rule rev_bexI, assumption) |
25904 | 110 |
apply (erule (1) is_lub_maximal) |
111 |
done |
|
112 |
||
26034 | 113 |
lemma lub_finite_directed_in_self: |
114 |
"\<lbrakk>finite S; directed S\<rbrakk> \<Longrightarrow> lub S \<in> S" |
|
115 |
apply (drule (1) finite_directed_contains_lub, clarify) |
|
116 |
apply (drule thelubI, simp) |
|
117 |
done |
|
118 |
||
119 |
lemma finite_directed_has_lub: "\<lbrakk>finite S; directed S\<rbrakk> \<Longrightarrow> \<exists>u. S <<| u" |
|
120 |
by (drule (1) finite_directed_contains_lub, fast) |
|
121 |
||
25904 | 122 |
lemma is_ub_thelub0: "\<lbrakk>\<exists>u. S <<| u; x \<in> S\<rbrakk> \<Longrightarrow> x \<sqsubseteq> lub S" |
123 |
apply (erule exE, drule lubI) |
|
124 |
apply (drule is_lubD1) |
|
125 |
apply (erule (1) is_ubD) |
|
126 |
done |
|
127 |
||
128 |
lemma is_lub_thelub0: "\<lbrakk>\<exists>u. S <<| u; S <| x\<rbrakk> \<Longrightarrow> lub S \<sqsubseteq> x" |
|
129 |
by (erule exE, drule lubI, erule is_lub_lub) |
|
130 |
||
27268 | 131 |
locale basis_take = preorder + |
25904 | 132 |
fixes take :: "nat \<Rightarrow> 'a::type \<Rightarrow> 'a" |
27268 | 133 |
assumes take_less: "take n a \<preceq> a" |
25904 | 134 |
assumes take_take: "take n (take n a) = take n a" |
27268 | 135 |
assumes take_mono: "a \<preceq> b \<Longrightarrow> take n a \<preceq> take n b" |
136 |
assumes take_chain: "take n a \<preceq> take (Suc n) a" |
|
25904 | 137 |
assumes finite_range_take: "finite (range (take n))" |
138 |
assumes take_covers: "\<exists>n. take n a = a" |
|
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
139 |
|
27268 | 140 |
locale ideal_completion = basis_take + |
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
141 |
fixes principal :: "'a::type \<Rightarrow> 'b::cpo" |
26927 | 142 |
fixes rep :: "'b::cpo \<Rightarrow> 'a::type set" |
143 |
assumes ideal_rep: "\<And>x. preorder.ideal r (rep x)" |
|
144 |
assumes cont_rep: "cont rep" |
|
27268 | 145 |
assumes rep_principal: "\<And>a. rep (principal a) = {b. b \<preceq> a}" |
26927 | 146 |
assumes subset_repD: "\<And>x y. rep x \<subseteq> rep y \<Longrightarrow> x \<sqsubseteq> y" |
25904 | 147 |
begin |
148 |
||
26927 | 149 |
lemma finite_take_rep: "finite (take n ` rep x)" |
25904 | 150 |
by (rule finite_subset [OF image_mono [OF subset_UNIV] finite_range_take]) |
151 |
||
152 |
lemma basis_fun_lemma0: |
|
153 |
fixes f :: "'a::type \<Rightarrow> 'c::cpo" |
|
27268 | 154 |
assumes f_mono: "\<And>a b. a \<preceq> b \<Longrightarrow> f a \<sqsubseteq> f b" |
26927 | 155 |
shows "\<exists>u. f ` take i ` rep x <<| u" |
25904 | 156 |
apply (rule finite_directed_has_lub) |
157 |
apply (rule finite_imageI) |
|
26927 | 158 |
apply (rule finite_take_rep) |
25904 | 159 |
apply (subst image_image) |
160 |
apply (rule directed_image_ideal) |
|
26927 | 161 |
apply (rule ideal_rep) |
25904 | 162 |
apply (rule f_mono) |
163 |
apply (erule take_mono) |
|
164 |
done |
|
165 |
||
166 |
lemma basis_fun_lemma1: |
|
167 |
fixes f :: "'a::type \<Rightarrow> 'c::cpo" |
|
27268 | 168 |
assumes f_mono: "\<And>a b. a \<preceq> b \<Longrightarrow> f a \<sqsubseteq> f b" |
26927 | 169 |
shows "chain (\<lambda>i. lub (f ` take i ` rep x))" |
25904 | 170 |
apply (rule chainI) |
171 |
apply (rule is_lub_thelub0) |
|
172 |
apply (rule basis_fun_lemma0, erule f_mono) |
|
173 |
apply (rule is_ubI, clarsimp, rename_tac a) |
|
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
174 |
apply (rule sq_le.trans_less [OF f_mono [OF take_chain]]) |
25904 | 175 |
apply (rule is_ub_thelub0) |
176 |
apply (rule basis_fun_lemma0, erule f_mono) |
|
177 |
apply simp |
|
178 |
done |
|
179 |
||
180 |
lemma basis_fun_lemma2: |
|
181 |
fixes f :: "'a::type \<Rightarrow> 'c::cpo" |
|
27268 | 182 |
assumes f_mono: "\<And>a b. a \<preceq> b \<Longrightarrow> f a \<sqsubseteq> f b" |
26927 | 183 |
shows "f ` rep x <<| (\<Squnion>i. lub (f ` take i ` rep x))" |
25904 | 184 |
apply (rule is_lubI) |
185 |
apply (rule ub_imageI, rename_tac a) |
|
186 |
apply (cut_tac a=a in take_covers, erule exE, rename_tac i) |
|
187 |
apply (erule subst) |
|
188 |
apply (rule rev_trans_less) |
|
189 |
apply (rule_tac x=i in is_ub_thelub) |
|
190 |
apply (rule basis_fun_lemma1, erule f_mono) |
|
191 |
apply (rule is_ub_thelub0) |
|
192 |
apply (rule basis_fun_lemma0, erule f_mono) |
|
193 |
apply simp |
|
194 |
apply (rule is_lub_thelub [OF _ ub_rangeI]) |
|
195 |
apply (rule basis_fun_lemma1, erule f_mono) |
|
196 |
apply (rule is_lub_thelub0) |
|
197 |
apply (rule basis_fun_lemma0, erule f_mono) |
|
198 |
apply (rule is_ubI, clarsimp, rename_tac a) |
|
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
199 |
apply (rule sq_le.trans_less [OF f_mono [OF take_less]]) |
25904 | 200 |
apply (erule (1) ub_imageD) |
201 |
done |
|
202 |
||
203 |
lemma basis_fun_lemma: |
|
204 |
fixes f :: "'a::type \<Rightarrow> 'c::cpo" |
|
27268 | 205 |
assumes f_mono: "\<And>a b. a \<preceq> b \<Longrightarrow> f a \<sqsubseteq> f b" |
26927 | 206 |
shows "\<exists>u. f ` rep x <<| u" |
25904 | 207 |
by (rule exI, rule basis_fun_lemma2, erule f_mono) |
208 |
||
26927 | 209 |
lemma rep_mono: "x \<sqsubseteq> y \<Longrightarrow> rep x \<subseteq> rep y" |
210 |
apply (drule cont_rep [THEN cont2mono, THEN monofunE]) |
|
25904 | 211 |
apply (simp add: set_cpo_simps) |
212 |
done |
|
213 |
||
26927 | 214 |
lemma rep_contlub: |
215 |
"chain Y \<Longrightarrow> rep (\<Squnion>i. Y i) = (\<Union>i. rep (Y i))" |
|
216 |
by (simp add: cont2contlubE [OF cont_rep] set_cpo_simps) |
|
25904 | 217 |
|
26927 | 218 |
lemma less_def: "x \<sqsubseteq> y \<longleftrightarrow> rep x \<subseteq> rep y" |
219 |
by (rule iffI [OF rep_mono subset_repD]) |
|
25904 | 220 |
|
26927 | 221 |
lemma rep_eq: "rep x = {a. principal a \<sqsubseteq> x}" |
222 |
unfolding less_def rep_principal |
|
25904 | 223 |
apply safe |
26927 | 224 |
apply (erule (1) idealD3 [OF ideal_rep]) |
27268 | 225 |
apply (erule subsetD, simp add: r_refl) |
25904 | 226 |
done |
227 |
||
26927 | 228 |
lemma mem_rep_iff_principal_less: "a \<in> rep x \<longleftrightarrow> principal a \<sqsubseteq> x" |
229 |
by (simp add: rep_eq) |
|
230 |
||
231 |
lemma principal_less_iff_mem_rep: "principal a \<sqsubseteq> x \<longleftrightarrow> a \<in> rep x" |
|
232 |
by (simp add: rep_eq) |
|
25904 | 233 |
|
27268 | 234 |
lemma principal_less_iff: "principal a \<sqsubseteq> principal b \<longleftrightarrow> a \<preceq> b" |
26927 | 235 |
by (simp add: principal_less_iff_mem_rep rep_principal) |
25904 | 236 |
|
27268 | 237 |
lemma principal_eq_iff: "principal a = principal b \<longleftrightarrow> a \<preceq> b \<and> b \<preceq> a" |
26927 | 238 |
unfolding po_eq_conv [where 'a='b] principal_less_iff .. |
239 |
||
240 |
lemma repD: "a \<in> rep x \<Longrightarrow> principal a \<sqsubseteq> x" |
|
241 |
by (simp add: rep_eq) |
|
25904 | 242 |
|
27268 | 243 |
lemma principal_mono: "a \<preceq> b \<Longrightarrow> principal a \<sqsubseteq> principal b" |
26927 | 244 |
by (simp add: principal_less_iff) |
25904 | 245 |
|
246 |
lemma lessI: "(\<And>a. principal a \<sqsubseteq> x \<Longrightarrow> principal a \<sqsubseteq> u) \<Longrightarrow> x \<sqsubseteq> u" |
|
26927 | 247 |
unfolding principal_less_iff_mem_rep |
26806 | 248 |
by (simp add: less_def subset_eq) |
25904 | 249 |
|
26927 | 250 |
lemma lub_principal_rep: "principal ` rep x <<| x" |
25904 | 251 |
apply (rule is_lubI) |
252 |
apply (rule ub_imageI) |
|
26927 | 253 |
apply (erule repD) |
25904 | 254 |
apply (subst less_def) |
255 |
apply (rule subsetI) |
|
256 |
apply (drule (1) ub_imageD) |
|
26927 | 257 |
apply (simp add: rep_eq) |
25904 | 258 |
done |
259 |
||
260 |
definition |
|
261 |
basis_fun :: "('a::type \<Rightarrow> 'c::cpo) \<Rightarrow> 'b \<rightarrow> 'c" where |
|
26927 | 262 |
"basis_fun = (\<lambda>f. (\<Lambda> x. lub (f ` rep x)))" |
25904 | 263 |
|
264 |
lemma basis_fun_beta: |
|
265 |
fixes f :: "'a::type \<Rightarrow> 'c::cpo" |
|
27268 | 266 |
assumes f_mono: "\<And>a b. a \<preceq> b \<Longrightarrow> f a \<sqsubseteq> f b" |
26927 | 267 |
shows "basis_fun f\<cdot>x = lub (f ` rep x)" |
25904 | 268 |
unfolding basis_fun_def |
269 |
proof (rule beta_cfun) |
|
26927 | 270 |
have lub: "\<And>x. \<exists>u. f ` rep x <<| u" |
25904 | 271 |
using f_mono by (rule basis_fun_lemma) |
26927 | 272 |
show cont: "cont (\<lambda>x. lub (f ` rep x))" |
25904 | 273 |
apply (rule contI2) |
274 |
apply (rule monofunI) |
|
275 |
apply (rule is_lub_thelub0 [OF lub ub_imageI]) |
|
276 |
apply (rule is_ub_thelub0 [OF lub imageI]) |
|
26927 | 277 |
apply (erule (1) subsetD [OF rep_mono]) |
25904 | 278 |
apply (rule is_lub_thelub0 [OF lub ub_imageI]) |
26927 | 279 |
apply (simp add: rep_contlub, clarify) |
25904 | 280 |
apply (erule rev_trans_less [OF is_ub_thelub]) |
281 |
apply (erule is_ub_thelub0 [OF lub imageI]) |
|
282 |
done |
|
283 |
qed |
|
284 |
||
285 |
lemma basis_fun_principal: |
|
286 |
fixes f :: "'a::type \<Rightarrow> 'c::cpo" |
|
27268 | 287 |
assumes f_mono: "\<And>a b. a \<preceq> b \<Longrightarrow> f a \<sqsubseteq> f b" |
25904 | 288 |
shows "basis_fun f\<cdot>(principal a) = f a" |
289 |
apply (subst basis_fun_beta, erule f_mono) |
|
26927 | 290 |
apply (subst rep_principal) |
25904 | 291 |
apply (rule lub_image_principal, erule f_mono) |
292 |
done |
|
293 |
||
294 |
lemma basis_fun_mono: |
|
27268 | 295 |
assumes f_mono: "\<And>a b. a \<preceq> b \<Longrightarrow> f a \<sqsubseteq> f b" |
296 |
assumes g_mono: "\<And>a b. a \<preceq> b \<Longrightarrow> g a \<sqsubseteq> g b" |
|
25904 | 297 |
assumes less: "\<And>a. f a \<sqsubseteq> g a" |
298 |
shows "basis_fun f \<sqsubseteq> basis_fun g" |
|
299 |
apply (rule less_cfun_ext) |
|
300 |
apply (simp only: basis_fun_beta f_mono g_mono) |
|
301 |
apply (rule is_lub_thelub0) |
|
302 |
apply (rule basis_fun_lemma, erule f_mono) |
|
303 |
apply (rule ub_imageI, rename_tac a) |
|
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
304 |
apply (rule sq_le.trans_less [OF less]) |
25904 | 305 |
apply (rule is_ub_thelub0) |
306 |
apply (rule basis_fun_lemma, erule g_mono) |
|
307 |
apply (erule imageI) |
|
308 |
done |
|
309 |
||
310 |
lemma compact_principal: "compact (principal a)" |
|
26927 | 311 |
by (rule compactI2, simp add: principal_less_iff_mem_rep rep_contlub) |
312 |
||
313 |
definition |
|
314 |
completion_approx :: "nat \<Rightarrow> 'b \<rightarrow> 'b" where |
|
315 |
"completion_approx = (\<lambda>i. basis_fun (\<lambda>a. principal (take i a)))" |
|
25904 | 316 |
|
26927 | 317 |
lemma completion_approx_beta: |
318 |
"completion_approx i\<cdot>x = (\<Squnion>a\<in>rep x. principal (take i a))" |
|
319 |
unfolding completion_approx_def |
|
320 |
by (simp add: basis_fun_beta principal_mono take_mono) |
|
321 |
||
322 |
lemma completion_approx_principal: |
|
323 |
"completion_approx i\<cdot>(principal a) = principal (take i a)" |
|
324 |
unfolding completion_approx_def |
|
325 |
by (simp add: basis_fun_principal principal_mono take_mono) |
|
326 |
||
327 |
lemma chain_completion_approx: "chain completion_approx" |
|
328 |
unfolding completion_approx_def |
|
25904 | 329 |
apply (rule chainI) |
330 |
apply (rule basis_fun_mono) |
|
331 |
apply (erule principal_mono [OF take_mono]) |
|
332 |
apply (erule principal_mono [OF take_mono]) |
|
333 |
apply (rule principal_mono [OF take_chain]) |
|
334 |
done |
|
335 |
||
26927 | 336 |
lemma lub_completion_approx: "(\<Squnion>i. completion_approx i\<cdot>x) = x" |
337 |
unfolding completion_approx_beta |
|
25904 | 338 |
apply (subst image_image [where f=principal, symmetric]) |
26927 | 339 |
apply (rule unique_lub [OF _ lub_principal_rep]) |
25904 | 340 |
apply (rule basis_fun_lemma2, erule principal_mono) |
341 |
done |
|
342 |
||
26927 | 343 |
lemma completion_approx_eq_principal: |
344 |
"\<exists>a\<in>rep x. completion_approx i\<cdot>x = principal (take i a)" |
|
345 |
unfolding completion_approx_beta |
|
25904 | 346 |
apply (subst image_image [where f=principal, symmetric]) |
26927 | 347 |
apply (subgoal_tac "finite (principal ` take i ` rep x)") |
348 |
apply (subgoal_tac "directed (principal ` take i ` rep x)") |
|
25904 | 349 |
apply (drule (1) lub_finite_directed_in_self, fast) |
350 |
apply (subst image_image) |
|
351 |
apply (rule directed_image_ideal) |
|
26927 | 352 |
apply (rule ideal_rep) |
25904 | 353 |
apply (erule principal_mono [OF take_mono]) |
354 |
apply (rule finite_imageI) |
|
26927 | 355 |
apply (rule finite_take_rep) |
356 |
done |
|
357 |
||
358 |
lemma completion_approx_idem: |
|
359 |
"completion_approx i\<cdot>(completion_approx i\<cdot>x) = completion_approx i\<cdot>x" |
|
360 |
using completion_approx_eq_principal [where i=i and x=x] |
|
361 |
by (auto simp add: completion_approx_principal take_take) |
|
362 |
||
363 |
lemma finite_fixes_completion_approx: |
|
364 |
"finite {x. completion_approx i\<cdot>x = x}" (is "finite ?S") |
|
365 |
apply (subgoal_tac "?S \<subseteq> principal ` range (take i)") |
|
366 |
apply (erule finite_subset) |
|
367 |
apply (rule finite_imageI) |
|
368 |
apply (rule finite_range_take) |
|
369 |
apply (clarify, erule subst) |
|
370 |
apply (cut_tac x=x and i=i in completion_approx_eq_principal) |
|
371 |
apply fast |
|
25904 | 372 |
done |
373 |
||
374 |
lemma principal_induct: |
|
375 |
assumes adm: "adm P" |
|
376 |
assumes P: "\<And>a. P (principal a)" |
|
377 |
shows "P x" |
|
26927 | 378 |
apply (subgoal_tac "P (\<Squnion>i. completion_approx i\<cdot>x)") |
379 |
apply (simp add: lub_completion_approx) |
|
25925 | 380 |
apply (rule admD [OF adm]) |
26927 | 381 |
apply (simp add: chain_completion_approx) |
382 |
apply (cut_tac x=x and i=i in completion_approx_eq_principal) |
|
25904 | 383 |
apply (clarify, simp add: P) |
384 |
done |
|
385 |
||
27267
5ebfb7f25ebb
add lemma compact_imp_principal to locale ideal_completion
huffman
parents:
26927
diff
changeset
|
386 |
lemma compact_imp_principal: "compact x \<Longrightarrow> \<exists>a. x = principal a" |
5ebfb7f25ebb
add lemma compact_imp_principal to locale ideal_completion
huffman
parents:
26927
diff
changeset
|
387 |
apply (drule adm_compact_neq [OF _ cont_id]) |
5ebfb7f25ebb
add lemma compact_imp_principal to locale ideal_completion
huffman
parents:
26927
diff
changeset
|
388 |
apply (drule admD2 [where Y="\<lambda>n. completion_approx n\<cdot>x"]) |
5ebfb7f25ebb
add lemma compact_imp_principal to locale ideal_completion
huffman
parents:
26927
diff
changeset
|
389 |
apply (simp add: chain_completion_approx) |
5ebfb7f25ebb
add lemma compact_imp_principal to locale ideal_completion
huffman
parents:
26927
diff
changeset
|
390 |
apply (simp add: lub_completion_approx) |
5ebfb7f25ebb
add lemma compact_imp_principal to locale ideal_completion
huffman
parents:
26927
diff
changeset
|
391 |
apply (erule exE, erule ssubst) |
5ebfb7f25ebb
add lemma compact_imp_principal to locale ideal_completion
huffman
parents:
26927
diff
changeset
|
392 |
apply (cut_tac i=i and x=x in completion_approx_eq_principal) |
5ebfb7f25ebb
add lemma compact_imp_principal to locale ideal_completion
huffman
parents:
26927
diff
changeset
|
393 |
apply (clarify, erule exI) |
5ebfb7f25ebb
add lemma compact_imp_principal to locale ideal_completion
huffman
parents:
26927
diff
changeset
|
394 |
done |
5ebfb7f25ebb
add lemma compact_imp_principal to locale ideal_completion
huffman
parents:
26927
diff
changeset
|
395 |
|
25904 | 396 |
end |
397 |
||
398 |
||
399 |
subsection {* Compact bases of bifinite domains *} |
|
400 |
||
26407
562a1d615336
rename class bifinite_cpo to profinite; generalize powerdomains from bifinite to profinite
huffman
parents:
26041
diff
changeset
|
401 |
defaultsort profinite |
25904 | 402 |
|
26407
562a1d615336
rename class bifinite_cpo to profinite; generalize powerdomains from bifinite to profinite
huffman
parents:
26041
diff
changeset
|
403 |
typedef (open) 'a compact_basis = "{x::'a::profinite. compact x}" |
25904 | 404 |
by (fast intro: compact_approx) |
405 |
||
406 |
lemma compact_Rep_compact_basis [simp]: "compact (Rep_compact_basis a)" |
|
26927 | 407 |
by (rule Rep_compact_basis [unfolded mem_Collect_eq]) |
25904 | 408 |
|
409 |
lemma Rep_Abs_compact_basis_approx [simp]: |
|
410 |
"Rep_compact_basis (Abs_compact_basis (approx n\<cdot>x)) = approx n\<cdot>x" |
|
411 |
by (rule Abs_compact_basis_inverse, simp) |
|
412 |
||
413 |
lemma compact_imp_Rep_compact_basis: |
|
414 |
"compact x \<Longrightarrow> \<exists>y. x = Rep_compact_basis y" |
|
415 |
by (rule exI, rule Abs_compact_basis_inverse [symmetric], simp) |
|
416 |
||
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
417 |
instantiation compact_basis :: (profinite) sq_ord |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
418 |
begin |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
419 |
|
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
420 |
definition |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
421 |
compact_le_def: |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
422 |
"(op \<sqsubseteq>) \<equiv> (\<lambda>x y. Rep_compact_basis x \<sqsubseteq> Rep_compact_basis y)" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
423 |
|
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
424 |
instance .. |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
425 |
|
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
426 |
end |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
427 |
|
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
428 |
instance compact_basis :: (profinite) po |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
429 |
by (rule typedef_po |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
430 |
[OF type_definition_compact_basis compact_le_def]) |
25904 | 431 |
|
432 |
text {* minimal compact element *} |
|
433 |
||
434 |
definition |
|
26407
562a1d615336
rename class bifinite_cpo to profinite; generalize powerdomains from bifinite to profinite
huffman
parents:
26041
diff
changeset
|
435 |
compact_bot :: "'a::bifinite compact_basis" where |
25904 | 436 |
"compact_bot = Abs_compact_basis \<bottom>" |
437 |
||
438 |
lemma Rep_compact_bot: "Rep_compact_basis compact_bot = \<bottom>" |
|
439 |
unfolding compact_bot_def by (simp add: Abs_compact_basis_inverse) |
|
440 |
||
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
441 |
lemma compact_minimal [simp]: "compact_bot \<sqsubseteq> a" |
25904 | 442 |
unfolding compact_le_def Rep_compact_bot by simp |
443 |
||
444 |
text {* compacts *} |
|
445 |
||
446 |
definition |
|
447 |
compacts :: "'a \<Rightarrow> 'a compact_basis set" where |
|
448 |
"compacts = (\<lambda>x. {a. Rep_compact_basis a \<sqsubseteq> x})" |
|
449 |
||
27268 | 450 |
lemma ideal_compacts: "sq_le.ideal (compacts w)" |
25904 | 451 |
unfolding compacts_def |
27268 | 452 |
apply (rule sq_le.idealI) |
25904 | 453 |
apply (rule_tac x="Abs_compact_basis (approx 0\<cdot>w)" in exI) |
454 |
apply (simp add: approx_less) |
|
455 |
apply simp |
|
456 |
apply (cut_tac a=x in compact_Rep_compact_basis) |
|
457 |
apply (cut_tac a=y in compact_Rep_compact_basis) |
|
458 |
apply (drule bifinite_compact_eq_approx) |
|
459 |
apply (drule bifinite_compact_eq_approx) |
|
460 |
apply (clarify, rename_tac i j) |
|
461 |
apply (rule_tac x="Abs_compact_basis (approx (max i j)\<cdot>w)" in exI) |
|
462 |
apply (simp add: approx_less compact_le_def) |
|
463 |
apply (erule subst, erule subst) |
|
25922
cb04d05e95fb
rename lemma chain_mono3 -> chain_mono, chain_mono -> chain_mono_less
huffman
parents:
25904
diff
changeset
|
464 |
apply (simp add: monofun_cfun chain_mono [OF chain_approx]) |
25904 | 465 |
apply (simp add: compact_le_def) |
466 |
apply (erule (1) trans_less) |
|
467 |
done |
|
468 |
||
469 |
lemma compacts_Rep_compact_basis: |
|
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
470 |
"compacts (Rep_compact_basis b) = {a. a \<sqsubseteq> b}" |
25904 | 471 |
unfolding compacts_def compact_le_def .. |
472 |
||
473 |
lemma cont_compacts: "cont compacts" |
|
474 |
unfolding compacts_def |
|
475 |
apply (rule contI2) |
|
476 |
apply (rule monofunI) |
|
477 |
apply (simp add: set_cpo_simps) |
|
478 |
apply (fast intro: trans_less) |
|
479 |
apply (simp add: set_cpo_simps) |
|
480 |
apply clarify |
|
481 |
apply simp |
|
482 |
apply (erule (1) compactD2 [OF compact_Rep_compact_basis]) |
|
483 |
done |
|
484 |
||
485 |
lemma compacts_lessD: "compacts x \<subseteq> compacts y \<Longrightarrow> x \<sqsubseteq> y" |
|
486 |
apply (subgoal_tac "(\<Squnion>i. approx i\<cdot>x) \<sqsubseteq> y", simp) |
|
25925 | 487 |
apply (rule admD, simp, simp) |
25904 | 488 |
apply (drule_tac c="Abs_compact_basis (approx i\<cdot>x)" in subsetD) |
489 |
apply (simp add: compacts_def Abs_compact_basis_inverse approx_less) |
|
490 |
apply (simp add: compacts_def Abs_compact_basis_inverse) |
|
491 |
done |
|
492 |
||
493 |
lemma compacts_mono: "x \<sqsubseteq> y \<Longrightarrow> compacts x \<subseteq> compacts y" |
|
494 |
unfolding compacts_def by (fast intro: trans_less) |
|
495 |
||
496 |
lemma less_compact_basis_iff: "(x \<sqsubseteq> y) = (compacts x \<subseteq> compacts y)" |
|
497 |
by (rule iffI [OF compacts_mono compacts_lessD]) |
|
498 |
||
499 |
lemma compact_basis_induct: |
|
500 |
"\<lbrakk>adm P; \<And>a. P (Rep_compact_basis a)\<rbrakk> \<Longrightarrow> P x" |
|
501 |
apply (erule approx_induct) |
|
502 |
apply (drule_tac x="Abs_compact_basis (approx n\<cdot>x)" in meta_spec) |
|
503 |
apply (simp add: Abs_compact_basis_inverse) |
|
504 |
done |
|
505 |
||
506 |
text {* approximation on compact bases *} |
|
507 |
||
508 |
definition |
|
509 |
compact_approx :: "nat \<Rightarrow> 'a compact_basis \<Rightarrow> 'a compact_basis" where |
|
510 |
"compact_approx = (\<lambda>n a. Abs_compact_basis (approx n\<cdot>(Rep_compact_basis a)))" |
|
511 |
||
512 |
lemma Rep_compact_approx: |
|
513 |
"Rep_compact_basis (compact_approx n a) = approx n\<cdot>(Rep_compact_basis a)" |
|
514 |
unfolding compact_approx_def |
|
515 |
by (simp add: Abs_compact_basis_inverse) |
|
516 |
||
517 |
lemmas approx_Rep_compact_basis = Rep_compact_approx [symmetric] |
|
518 |
||
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
519 |
lemma compact_approx_le: "compact_approx n a \<sqsubseteq> a" |
25904 | 520 |
unfolding compact_le_def |
521 |
by (simp add: Rep_compact_approx approx_less) |
|
522 |
||
523 |
lemma compact_approx_mono1: |
|
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
524 |
"i \<le> j \<Longrightarrow> compact_approx i a \<sqsubseteq> compact_approx j a" |
25904 | 525 |
unfolding compact_le_def |
526 |
apply (simp add: Rep_compact_approx) |
|
25922
cb04d05e95fb
rename lemma chain_mono3 -> chain_mono, chain_mono -> chain_mono_less
huffman
parents:
25904
diff
changeset
|
527 |
apply (rule chain_mono, simp, assumption) |
25904 | 528 |
done |
529 |
||
530 |
lemma compact_approx_mono: |
|
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
531 |
"a \<sqsubseteq> b \<Longrightarrow> compact_approx n a \<sqsubseteq> compact_approx n b" |
25904 | 532 |
unfolding compact_le_def |
533 |
apply (simp add: Rep_compact_approx) |
|
534 |
apply (erule monofun_cfun_arg) |
|
535 |
done |
|
536 |
||
537 |
lemma ex_compact_approx_eq: "\<exists>n. compact_approx n a = a" |
|
538 |
apply (simp add: Rep_compact_basis_inject [symmetric]) |
|
539 |
apply (simp add: Rep_compact_approx) |
|
540 |
apply (rule bifinite_compact_eq_approx) |
|
541 |
apply (rule compact_Rep_compact_basis) |
|
542 |
done |
|
543 |
||
544 |
lemma compact_approx_idem: |
|
545 |
"compact_approx n (compact_approx n a) = compact_approx n a" |
|
546 |
apply (rule Rep_compact_basis_inject [THEN iffD1]) |
|
547 |
apply (simp add: Rep_compact_approx) |
|
548 |
done |
|
549 |
||
550 |
lemma finite_fixes_compact_approx: "finite {a. compact_approx n a = a}" |
|
551 |
apply (subgoal_tac "finite (Rep_compact_basis ` {a. compact_approx n a = a})") |
|
552 |
apply (erule finite_imageD) |
|
553 |
apply (rule inj_onI, simp add: Rep_compact_basis_inject) |
|
554 |
apply (rule finite_subset [OF _ finite_fixes_approx [where i=n]]) |
|
555 |
apply (rule subsetI, clarify, rename_tac a) |
|
556 |
apply (simp add: Rep_compact_basis_inject [symmetric]) |
|
557 |
apply (simp add: Rep_compact_approx) |
|
558 |
done |
|
559 |
||
560 |
lemma finite_range_compact_approx: "finite (range (compact_approx n))" |
|
561 |
apply (cut_tac n=n in finite_fixes_compact_approx) |
|
562 |
apply (simp add: idem_fixes_eq_range compact_approx_idem) |
|
563 |
apply (simp add: image_def) |
|
564 |
done |
|
565 |
||
566 |
interpretation compact_basis: |
|
26927 | 567 |
ideal_completion [sq_le compact_approx Rep_compact_basis compacts] |
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
568 |
proof (unfold_locales) |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
569 |
fix n :: nat and a b :: "'a compact_basis" and x :: "'a" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
570 |
show "compact_approx n a \<sqsubseteq> a" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
571 |
by (rule compact_approx_le) |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
572 |
show "compact_approx n (compact_approx n a) = compact_approx n a" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
573 |
by (rule compact_approx_idem) |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
574 |
show "compact_approx n a \<sqsubseteq> compact_approx (Suc n) a" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
575 |
by (rule compact_approx_mono1, simp) |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
576 |
show "finite (range (compact_approx n))" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
577 |
by (rule finite_range_compact_approx) |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
578 |
show "\<exists>n\<Colon>nat. compact_approx n a = a" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
579 |
by (rule ex_compact_approx_eq) |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
580 |
show "preorder.ideal sq_le (compacts x)" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
581 |
by (rule ideal_compacts) |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
582 |
show "cont compacts" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
583 |
by (rule cont_compacts) |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
584 |
show "compacts (Rep_compact_basis a) = {b. b \<sqsubseteq> a}" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
585 |
by (rule compacts_Rep_compact_basis) |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
586 |
next |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
587 |
fix n :: nat and a b :: "'a compact_basis" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
588 |
assume "a \<sqsubseteq> b" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
589 |
thus "compact_approx n a \<sqsubseteq> compact_approx n b" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
590 |
by (rule compact_approx_mono) |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
591 |
next |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
592 |
fix x y :: "'a" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
593 |
assume "compacts x \<subseteq> compacts y" thus "x \<sqsubseteq> y" |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
594 |
by (rule compacts_lessD) |
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
595 |
qed |
25904 | 596 |
|
597 |
||
598 |
subsection {* A compact basis for powerdomains *} |
|
599 |
||
600 |
typedef 'a pd_basis = |
|
26407
562a1d615336
rename class bifinite_cpo to profinite; generalize powerdomains from bifinite to profinite
huffman
parents:
26041
diff
changeset
|
601 |
"{S::'a::profinite compact_basis set. finite S \<and> S \<noteq> {}}" |
25904 | 602 |
by (rule_tac x="{arbitrary}" in exI, simp) |
603 |
||
604 |
lemma finite_Rep_pd_basis [simp]: "finite (Rep_pd_basis u)" |
|
605 |
by (insert Rep_pd_basis [of u, unfolded pd_basis_def]) simp |
|
606 |
||
607 |
lemma Rep_pd_basis_nonempty [simp]: "Rep_pd_basis u \<noteq> {}" |
|
608 |
by (insert Rep_pd_basis [of u, unfolded pd_basis_def]) simp |
|
609 |
||
610 |
text {* unit and plus *} |
|
611 |
||
612 |
definition |
|
613 |
PDUnit :: "'a compact_basis \<Rightarrow> 'a pd_basis" where |
|
614 |
"PDUnit = (\<lambda>x. Abs_pd_basis {x})" |
|
615 |
||
616 |
definition |
|
617 |
PDPlus :: "'a pd_basis \<Rightarrow> 'a pd_basis \<Rightarrow> 'a pd_basis" where |
|
618 |
"PDPlus t u = Abs_pd_basis (Rep_pd_basis t \<union> Rep_pd_basis u)" |
|
619 |
||
620 |
lemma Rep_PDUnit: |
|
621 |
"Rep_pd_basis (PDUnit x) = {x}" |
|
622 |
unfolding PDUnit_def by (rule Abs_pd_basis_inverse) (simp add: pd_basis_def) |
|
623 |
||
624 |
lemma Rep_PDPlus: |
|
625 |
"Rep_pd_basis (PDPlus u v) = Rep_pd_basis u \<union> Rep_pd_basis v" |
|
626 |
unfolding PDPlus_def by (rule Abs_pd_basis_inverse) (simp add: pd_basis_def) |
|
627 |
||
628 |
lemma PDUnit_inject [simp]: "(PDUnit a = PDUnit b) = (a = b)" |
|
629 |
unfolding Rep_pd_basis_inject [symmetric] Rep_PDUnit by simp |
|
630 |
||
631 |
lemma PDPlus_assoc: "PDPlus (PDPlus t u) v = PDPlus t (PDPlus u v)" |
|
632 |
unfolding Rep_pd_basis_inject [symmetric] Rep_PDPlus by (rule Un_assoc) |
|
633 |
||
634 |
lemma PDPlus_commute: "PDPlus t u = PDPlus u t" |
|
635 |
unfolding Rep_pd_basis_inject [symmetric] Rep_PDPlus by (rule Un_commute) |
|
636 |
||
637 |
lemma PDPlus_absorb: "PDPlus t t = t" |
|
638 |
unfolding Rep_pd_basis_inject [symmetric] Rep_PDPlus by (rule Un_absorb) |
|
639 |
||
640 |
lemma pd_basis_induct1: |
|
641 |
assumes PDUnit: "\<And>a. P (PDUnit a)" |
|
642 |
assumes PDPlus: "\<And>a t. P t \<Longrightarrow> P (PDPlus (PDUnit a) t)" |
|
643 |
shows "P x" |
|
644 |
apply (induct x, unfold pd_basis_def, clarify) |
|
645 |
apply (erule (1) finite_ne_induct) |
|
646 |
apply (cut_tac a=x in PDUnit) |
|
647 |
apply (simp add: PDUnit_def) |
|
648 |
apply (drule_tac a=x in PDPlus) |
|
649 |
apply (simp add: PDUnit_def PDPlus_def Abs_pd_basis_inverse [unfolded pd_basis_def]) |
|
650 |
done |
|
651 |
||
652 |
lemma pd_basis_induct: |
|
653 |
assumes PDUnit: "\<And>a. P (PDUnit a)" |
|
654 |
assumes PDPlus: "\<And>t u. \<lbrakk>P t; P u\<rbrakk> \<Longrightarrow> P (PDPlus t u)" |
|
655 |
shows "P x" |
|
656 |
apply (induct x rule: pd_basis_induct1) |
|
657 |
apply (rule PDUnit, erule PDPlus [OF PDUnit]) |
|
658 |
done |
|
659 |
||
660 |
text {* fold-pd *} |
|
661 |
||
662 |
definition |
|
663 |
fold_pd :: |
|
664 |
"('a compact_basis \<Rightarrow> 'b::type) \<Rightarrow> ('b \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a pd_basis \<Rightarrow> 'b" |
|
665 |
where "fold_pd g f t = fold1 f (g ` Rep_pd_basis t)" |
|
666 |
||
26927 | 667 |
lemma fold_pd_PDUnit: |
668 |
includes ab_semigroup_idem_mult f |
|
669 |
shows "fold_pd g f (PDUnit x) = g x" |
|
25904 | 670 |
unfolding fold_pd_def Rep_PDUnit by simp |
671 |
||
26927 | 672 |
lemma fold_pd_PDPlus: |
673 |
includes ab_semigroup_idem_mult f |
|
674 |
shows "fold_pd g f (PDPlus t u) = f (fold_pd g f t) (fold_pd g f u)" |
|
25904 | 675 |
unfolding fold_pd_def Rep_PDPlus by (simp add: image_Un fold1_Un2) |
676 |
||
677 |
text {* approx-pd *} |
|
678 |
||
679 |
definition |
|
680 |
approx_pd :: "nat \<Rightarrow> 'a pd_basis \<Rightarrow> 'a pd_basis" where |
|
681 |
"approx_pd n = (\<lambda>t. Abs_pd_basis (compact_approx n ` Rep_pd_basis t))" |
|
682 |
||
683 |
lemma Rep_approx_pd: |
|
684 |
"Rep_pd_basis (approx_pd n t) = compact_approx n ` Rep_pd_basis t" |
|
685 |
unfolding approx_pd_def |
|
686 |
apply (rule Abs_pd_basis_inverse) |
|
687 |
apply (simp add: pd_basis_def) |
|
688 |
done |
|
689 |
||
690 |
lemma approx_pd_simps [simp]: |
|
691 |
"approx_pd n (PDUnit a) = PDUnit (compact_approx n a)" |
|
692 |
"approx_pd n (PDPlus t u) = PDPlus (approx_pd n t) (approx_pd n u)" |
|
693 |
apply (simp_all add: Rep_pd_basis_inject [symmetric]) |
|
694 |
apply (simp_all add: Rep_approx_pd Rep_PDUnit Rep_PDPlus image_Un) |
|
695 |
done |
|
696 |
||
697 |
lemma approx_pd_idem: "approx_pd n (approx_pd n t) = approx_pd n t" |
|
698 |
apply (induct t rule: pd_basis_induct) |
|
699 |
apply (simp add: compact_approx_idem) |
|
700 |
apply simp |
|
701 |
done |
|
702 |
||
703 |
lemma range_image_f: "range (image f) = Pow (range f)" |
|
704 |
apply (safe, fast) |
|
705 |
apply (rule_tac x="f -` x" in range_eqI) |
|
706 |
apply (simp, fast) |
|
707 |
done |
|
708 |
||
709 |
lemma finite_range_approx_pd: "finite (range (approx_pd n))" |
|
710 |
apply (subgoal_tac "finite (Rep_pd_basis ` range (approx_pd n))") |
|
711 |
apply (erule finite_imageD) |
|
712 |
apply (rule inj_onI, simp add: Rep_pd_basis_inject) |
|
713 |
apply (subst image_image) |
|
714 |
apply (subst Rep_approx_pd) |
|
715 |
apply (simp only: range_composition) |
|
716 |
apply (rule finite_subset [OF image_mono [OF subset_UNIV]]) |
|
717 |
apply (simp add: range_image_f) |
|
718 |
apply (rule finite_range_compact_approx) |
|
719 |
done |
|
720 |
||
721 |
lemma ex_approx_pd_eq: "\<exists>n. approx_pd n t = t" |
|
722 |
apply (subgoal_tac "\<exists>n. \<forall>m\<ge>n. approx_pd m t = t", fast) |
|
723 |
apply (induct t rule: pd_basis_induct) |
|
724 |
apply (cut_tac a=a in ex_compact_approx_eq) |
|
725 |
apply (clarify, rule_tac x=n in exI) |
|
726 |
apply (clarify, simp) |
|
26420
57a626f64875
make preorder locale into a superclass of class po
huffman
parents:
26407
diff
changeset
|
727 |
apply (rule antisym_less) |
25904 | 728 |
apply (rule compact_approx_le) |
729 |
apply (drule_tac a=a in compact_approx_mono1) |
|
730 |
apply simp |
|
731 |
apply (clarify, rename_tac i j) |
|
732 |
apply (rule_tac x="max i j" in exI, simp) |
|
733 |
done |
|
734 |
||
735 |
end |