author | nipkow |
Mon, 11 Mar 2013 12:27:31 +0100 | |
changeset 51390 | 1dff81cf425b |
parent 51389 | 8a9f0503b1c0 |
child 51711 | df3426139651 |
permissions | -rw-r--r-- |
47613 | 1 |
(* Author: Tobias Nipkow *) |
2 |
||
3 |
theory Abs_Int1 |
|
4 |
imports Abs_State |
|
5 |
begin |
|
6 |
||
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
7 |
lemma le_iff_le_annos_zip: "C1 \<le> C2 \<longleftrightarrow> |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
8 |
(\<forall> (a1,a2) \<in> set(zip (annos C1) (annos C2)). a1 \<le> a2) \<and> strip C1 = strip C2" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
9 |
by(induct C1 C2 rule: less_eq_acom.induct) (auto simp: size_annos_same2) |
47613 | 10 |
|
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
11 |
lemma le_iff_le_annos: "C1 \<le> C2 \<longleftrightarrow> |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
12 |
strip C1 = strip C2 \<and> (\<forall> i<size(annos C1). annos C1 ! i \<le> annos C2 ! i)" |
47613 | 13 |
by(auto simp add: le_iff_le_annos_zip set_zip) (metis size_annos_same2) |
14 |
||
15 |
||
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
16 |
lemma mono_fun_L[simp]: "F \<in> L X \<Longrightarrow> F \<le> G \<Longrightarrow> x : X \<Longrightarrow> fun F x \<le> fun G x" |
49396 | 17 |
by(simp add: mono_fun L_st_def) |
47613 | 18 |
|
49396 | 19 |
lemma bot_in_L[simp]: "bot c \<in> L(vars c)" |
20 |
by(simp add: L_acom_def bot_def) |
|
47613 | 21 |
|
49396 | 22 |
lemma L_acom_simps[simp]: "SKIP {P} \<in> L X \<longleftrightarrow> P \<in> L X" |
23 |
"(x ::= e {P}) \<in> L X \<longleftrightarrow> x : X \<and> vars e \<subseteq> X \<and> P \<in> L X" |
|
24 |
"(C1;C2) \<in> L X \<longleftrightarrow> C1 \<in> L X \<and> C2 \<in> L X" |
|
25 |
"(IF b THEN {P1} C1 ELSE {P2} C2 {Q}) \<in> L X \<longleftrightarrow> |
|
26 |
vars b \<subseteq> X \<and> C1 \<in> L X \<and> C2 \<in> L X \<and> P1 \<in> L X \<and> P2 \<in> L X \<and> Q \<in> L X" |
|
27 |
"({I} WHILE b DO {P} C {Q}) \<in> L X \<longleftrightarrow> |
|
28 |
I \<in> L X \<and> vars b \<subseteq> X \<and> P \<in> L X \<and> C \<in> L X \<and> Q \<in> L X" |
|
29 |
by(auto simp add: L_acom_def) |
|
47613 | 30 |
|
49353 | 31 |
lemma post_in_annos: "post C : set(annos C)" |
32 |
by(induction C) auto |
|
33 |
||
49396 | 34 |
lemma post_in_L[simp]: "C \<in> L X \<Longrightarrow> post C \<in> L X" |
35 |
by(simp add: L_acom_def post_in_annos) |
|
47613 | 36 |
|
37 |
||
38 |
subsection "Computable Abstract Interpretation" |
|
39 |
||
51390 | 40 |
text{* Abstract interpretation over type @{text st} instead of functions. *} |
47613 | 41 |
|
42 |
context Gamma |
|
43 |
begin |
|
44 |
||
45 |
fun aval' :: "aexp \<Rightarrow> 'av st \<Rightarrow> 'av" where |
|
50896 | 46 |
"aval' (N i) S = num' i" | |
47613 | 47 |
"aval' (V x) S = fun S x" | |
48 |
"aval' (Plus a1 a2) S = plus' (aval' a1 S) (aval' a2 S)" |
|
49 |
||
49497 | 50 |
lemma aval'_sound: "s : \<gamma>\<^isub>s S \<Longrightarrow> vars a \<subseteq> dom S \<Longrightarrow> aval a s : \<gamma>(aval' a S)" |
47613 | 51 |
by (induction a) (auto simp: gamma_num' gamma_plus' \<gamma>_st_def) |
52 |
||
51390 | 53 |
lemma gamma_Step_subcomm: fixes C1 C2 :: "'a::semilattice_sup acom" |
54 |
assumes "!!x e S. x : X \<Longrightarrow> vars e \<subseteq> X \<Longrightarrow> S \<in> L X \<Longrightarrow> f1 x e (\<gamma>\<^isub>o S) \<subseteq> \<gamma>\<^isub>o (f2 x e S)" |
|
55 |
"!!b S. S \<in> L X \<Longrightarrow> vars b \<subseteq> X \<Longrightarrow> g1 b (\<gamma>\<^isub>o S) \<subseteq> \<gamma>\<^isub>o (g2 b S)" |
|
56 |
shows "C \<in> L X \<Longrightarrow> S \<in> L X \<Longrightarrow> Step f1 g1 (\<gamma>\<^isub>o S) (\<gamma>\<^isub>c C) \<le> \<gamma>\<^isub>c (Step f2 g2 S C)" |
|
57 |
proof(induction C arbitrary: S) |
|
58 |
qed (auto simp: assms intro!: mono_gamma_o post_in_L sup_ge1 sup_ge2) |
|
59 |
||
60 |
lemma in_gamma_update: "\<lbrakk> s : \<gamma>\<^isub>s S; i : \<gamma> a \<rbrakk> \<Longrightarrow> s(x := i) : \<gamma>\<^isub>s(update S x a)" |
|
61 |
by(simp add: \<gamma>_st_def) |
|
62 |
||
47613 | 63 |
end |
64 |
||
51390 | 65 |
|
66 |
lemma Step_in_L: fixes C :: "'a::semilatticeL acom" |
|
67 |
assumes "!!x e S. \<lbrakk>S \<in> L X; x \<in> X; vars e \<subseteq> X\<rbrakk> \<Longrightarrow> f x e S \<in> L X" |
|
68 |
"!!b S. S \<in> L X \<Longrightarrow> vars b \<subseteq> X \<Longrightarrow> g b S \<in> L X" |
|
69 |
shows"\<lbrakk> C \<in> L X; S \<in> L X \<rbrakk> \<Longrightarrow> Step f g S C \<in> L X" |
|
70 |
proof(induction C arbitrary: S) |
|
71 |
case Assign thus ?case |
|
72 |
by(auto simp: L_st_def assms split: option.splits) |
|
73 |
qed (auto simp: assms) |
|
74 |
||
75 |
||
47613 | 76 |
text{* The for-clause (here and elsewhere) only serves the purpose of fixing |
77 |
the name of the type parameter @{typ 'av} which would otherwise be renamed to |
|
78 |
@{typ 'a}. *} |
|
79 |
||
49396 | 80 |
locale Abs_Int = Gamma where \<gamma>=\<gamma> for \<gamma> :: "'av::semilattice \<Rightarrow> val set" |
47613 | 81 |
begin |
82 |
||
51390 | 83 |
definition "step' = Step |
51389 | 84 |
(\<lambda>x e S. case S of None \<Rightarrow> None | Some S \<Rightarrow> Some(update S x (aval' e S))) |
85 |
(\<lambda>b S. S)" |
|
86 |
||
47613 | 87 |
definition AI :: "com \<Rightarrow> 'av st option acom option" where |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
88 |
"AI c = pfp (step' (Top(vars c))) (bot c)" |
47613 | 89 |
|
90 |
||
91 |
lemma strip_step'[simp]: "strip(step' S C) = strip C" |
|
51390 | 92 |
by(simp add: step'_def) |
47613 | 93 |
|
94 |
||
95 |
text{* Soundness: *} |
|
96 |
||
51390 | 97 |
lemma step_step': "C \<in> L X \<Longrightarrow> S \<in> L X \<Longrightarrow> step (\<gamma>\<^isub>o S) (\<gamma>\<^isub>c C) \<le> \<gamma>\<^isub>c (step' S C)" |
98 |
unfolding step_def step'_def |
|
99 |
by(rule gamma_Step_subcomm) |
|
100 |
(auto simp: L_st_def intro!: aval'_sound in_gamma_update split: option.splits) |
|
47613 | 101 |
|
51390 | 102 |
lemma step'_in_L[simp]: "\<lbrakk> C \<in> L X; S \<in> L X \<rbrakk> \<Longrightarrow> step' S C \<in> L X" |
103 |
unfolding step'_def |
|
104 |
by(rule Step_in_L)(auto simp: L_st_def step'_def split: option.splits) |
|
47613 | 105 |
|
50986 | 106 |
lemma AI_sound: "AI c = Some C \<Longrightarrow> CS c \<le> \<gamma>\<^isub>c C" |
47613 | 107 |
proof(simp add: CS_def AI_def) |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
108 |
assume 1: "pfp (step' (Top(vars c))) (bot c) = Some C" |
49396 | 109 |
have "C \<in> L(vars c)" |
49464 | 110 |
by(rule pfp_inv[where P = "%C. C \<in> L(vars c)", OF 1 _ bot_in_L]) |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
111 |
(erule step'_in_L[OF _ Top_in_L]) |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
112 |
have pfp': "step' (Top(vars c)) C \<le> C" by(rule pfp_pfp[OF 1]) |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
113 |
have 2: "step (\<gamma>\<^isub>o(Top(vars c))) (\<gamma>\<^isub>c C) \<le> \<gamma>\<^isub>c C" |
50986 | 114 |
proof(rule order_trans) |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
115 |
show "step (\<gamma>\<^isub>o (Top(vars c))) (\<gamma>\<^isub>c C) \<le> \<gamma>\<^isub>c (step' (Top(vars c)) C)" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
116 |
by(rule step_step'[OF `C \<in> L(vars c)` Top_in_L]) |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
117 |
show "\<gamma>\<^isub>c (step' (Top(vars c)) C) \<le> \<gamma>\<^isub>c C" |
50986 | 118 |
by(rule mono_gamma_c[OF pfp']) |
47613 | 119 |
qed |
51390 | 120 |
have 3: "strip (\<gamma>\<^isub>c C) = c" by(simp add: strip_pfp[OF _ 1] step'_def) |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
121 |
have "lfp c (step (\<gamma>\<^isub>o(Top(vars c)))) \<le> \<gamma>\<^isub>c C" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
122 |
by(rule lfp_lowerbound[simplified,where f="step (\<gamma>\<^isub>o(Top(vars c)))", OF 3 2]) |
50986 | 123 |
thus "lfp c (step UNIV) \<le> \<gamma>\<^isub>c C" by simp |
47613 | 124 |
qed |
125 |
||
126 |
end |
|
127 |
||
128 |
||
129 |
subsubsection "Monotonicity" |
|
130 |
||
51389 | 131 |
lemma le_sup_disj: "y \<in> L X \<Longrightarrow> (z::_::semilatticeL) \<in> L X \<Longrightarrow> |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
132 |
x \<le> y \<or> x \<le> z \<Longrightarrow> x \<le> y \<squnion> z" |
51389 | 133 |
by (metis sup_ge1 sup_ge2 order_trans) |
47613 | 134 |
|
51390 | 135 |
theorem mono2_Step: fixes C1 :: "'a::semilatticeL acom" |
136 |
assumes "!!x e S1 S2. \<lbrakk>S1 \<in> L X; S2 \<in> L X; x \<in> X; vars e \<subseteq> X; S1 \<le> S2\<rbrakk> \<Longrightarrow> f x e S1 \<le> f x e S2" |
|
137 |
"!!b S1 S2. S1 \<in> L X \<Longrightarrow> S2 \<in> L X \<Longrightarrow> vars b \<subseteq> X \<Longrightarrow> S1 \<le> S2 \<Longrightarrow> g b S1 \<le> g b S2" |
|
138 |
shows "S1 \<in> L X \<Longrightarrow> S2 \<in> L X \<Longrightarrow> C1 \<in> L X \<Longrightarrow> C2 \<in> L X \<Longrightarrow> |
|
139 |
S1 \<le> S2 \<Longrightarrow> C1 \<le> C2 \<Longrightarrow> Step f g S1 C1 \<le> Step f g S2 C2" |
|
140 |
by(induction C1 C2 arbitrary: S1 S2 rule: less_eq_acom.induct) |
|
141 |
(auto simp: mono_post assms le_sup_disj le_sup_disj[OF post_in_L post_in_L]) |
|
142 |
||
143 |
||
47613 | 144 |
locale Abs_Int_mono = Abs_Int + |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
145 |
assumes mono_plus': "a1 \<le> b1 \<Longrightarrow> a2 \<le> b2 \<Longrightarrow> plus' a1 a2 \<le> plus' b1 b2" |
47613 | 146 |
begin |
147 |
||
49396 | 148 |
lemma mono_aval': |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
149 |
"S1 \<le> S2 \<Longrightarrow> S1 \<in> L X \<Longrightarrow> S2 \<in> L X \<Longrightarrow> vars e \<subseteq> X \<Longrightarrow> aval' e S1 \<le> aval' e S2" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
150 |
by(induction e) (auto simp: less_eq_st_def mono_plus' L_st_def) |
47613 | 151 |
|
49396 | 152 |
theorem mono_step': "S1 \<in> L X \<Longrightarrow> S2 \<in> L X \<Longrightarrow> C1 \<in> L X \<Longrightarrow> C2 \<in> L X \<Longrightarrow> |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
153 |
S1 \<le> S2 \<Longrightarrow> C1 \<le> C2 \<Longrightarrow> step' S1 C1 \<le> step' S2 C2" |
51390 | 154 |
unfolding step'_def |
155 |
by(rule mono2_Step) (auto simp: mono_aval' split: option.split) |
|
47613 | 156 |
|
51036 | 157 |
lemma mono_step'_top: "C \<in> L X \<Longrightarrow> C' \<in> L X \<Longrightarrow> |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
158 |
C \<le> C' \<Longrightarrow> step' (Top X) C \<le> step' (Top X) C'" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
159 |
by (metis Top_in_L mono_step' order_refl) |
47613 | 160 |
|
49464 | 161 |
lemma pfp_bot_least: |
162 |
assumes "\<forall>x\<in>L(vars c)\<inter>{C. strip C = c}.\<forall>y\<in>L(vars c)\<inter>{C. strip C = c}. |
|
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
163 |
x \<le> y \<longrightarrow> f x \<le> f y" |
49464 | 164 |
and "\<forall>C. C \<in> L(vars c)\<inter>{C. strip C = c} \<longrightarrow> f C \<in> L(vars c)\<inter>{C. strip C = c}" |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
165 |
and "f C' \<le> C'" "strip C' = c" "C' \<in> L(vars c)" "pfp f (bot c) = Some C" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
166 |
shows "C \<le> C'" |
51390 | 167 |
by(rule while_least[OF assms(1,2) _ _ assms(3) _ assms(6)[unfolded pfp_def]]) |
168 |
(simp_all add: assms(4,5) bot_least) |
|
49464 | 169 |
|
170 |
lemma AI_least_pfp: assumes "AI c = Some C" |
|
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
171 |
and "step' (Top(vars c)) C' \<le> C'" "strip C' = c" "C' \<in> L(vars c)" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
172 |
shows "C \<le> C'" |
51390 | 173 |
by(rule pfp_bot_least[OF _ _ assms(2-4) assms(1)[unfolded AI_def]]) |
174 |
(simp_all add: mono_step'_top) |
|
49464 | 175 |
|
47613 | 176 |
end |
177 |
||
178 |
||
179 |
subsubsection "Termination" |
|
180 |
||
181 |
lemma pfp_termination: |
|
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
182 |
fixes x0 :: "'a::order" and m :: "'a \<Rightarrow> nat" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
183 |
assumes mono: "\<And>x y. I x \<Longrightarrow> I y \<Longrightarrow> x \<le> y \<Longrightarrow> f x \<le> f y" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
184 |
and m: "\<And>x y. I x \<Longrightarrow> I y \<Longrightarrow> x < y \<Longrightarrow> m x > m y" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
185 |
and I: "\<And>x y. I x \<Longrightarrow> I(f x)" and "I x0" and "x0 \<le> f x0" |
49464 | 186 |
shows "\<exists>x. pfp f x0 = Some x" |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
187 |
proof(simp add: pfp_def, rule wf_while_option_Some[where P = "%x. I x & x \<le> f x"]) |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
188 |
show "wf {(y,x). ((I x \<and> x \<le> f x) \<and> \<not> f x \<le> x) \<and> y = f x}" |
47613 | 189 |
by(rule wf_subset[OF wf_measure[of m]]) (auto simp: m I) |
190 |
next |
|
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
191 |
show "I x0 \<and> x0 \<le> f x0" using `I x0` `x0 \<le> f x0` by blast |
47613 | 192 |
next |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
193 |
fix x assume "I x \<and> x \<le> f x" thus "I(f x) \<and> f x \<le> f(f x)" |
47613 | 194 |
by (blast intro: I mono) |
195 |
qed |
|
196 |
||
197 |
||
49547 | 198 |
locale Measure1 = |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
199 |
fixes m :: "'av::order \<Rightarrow> nat" |
47613 | 200 |
fixes h :: "nat" |
201 |
assumes h: "m x \<le> h" |
|
202 |
begin |
|
203 |
||
49547 | 204 |
definition m_s :: "'av st \<Rightarrow> nat" ("m\<^isub>s") where |
205 |
"m_s S = (\<Sum> x \<in> dom S. m(fun S x))" |
|
47613 | 206 |
|
49547 | 207 |
lemma m_s_h: "x \<in> L X \<Longrightarrow> finite X \<Longrightarrow> m_s x \<le> h * card X" |
208 |
by(simp add: L_st_def m_s_def) |
|
49431 | 209 |
(metis nat_mult_commute of_nat_id setsum_bounded[OF h]) |
210 |
||
49432 | 211 |
definition m_o :: "nat \<Rightarrow> 'av st option \<Rightarrow> nat" ("m\<^isub>o") where |
49547 | 212 |
"m_o d opt = (case opt of None \<Rightarrow> h*d+1 | Some S \<Rightarrow> m_s S)" |
47613 | 213 |
|
49431 | 214 |
lemma m_o_h: "ost \<in> L X \<Longrightarrow> finite X \<Longrightarrow> m_o (card X) ost \<le> (h*card X + 1)" |
49547 | 215 |
by(auto simp add: m_o_def m_s_h split: option.split dest!:m_s_h) |
47613 | 216 |
|
49432 | 217 |
definition m_c :: "'av st option acom \<Rightarrow> nat" ("m\<^isub>c") where |
49431 | 218 |
"m_c C = (\<Sum>i<size(annos C). m_o (card(vars(strip C))) (annos C ! i))" |
219 |
||
220 |
lemma m_c_h: assumes "C \<in> L(vars(strip C))" |
|
221 |
shows "m_c C \<le> size(annos C) * (h * card(vars(strip C)) + 1)" |
|
222 |
proof- |
|
223 |
let ?X = "vars(strip C)" let ?n = "card ?X" let ?a = "size(annos C)" |
|
224 |
{ fix i assume "i < ?a" |
|
225 |
hence "annos C ! i \<in> L ?X" using assms by(simp add: L_acom_def) |
|
226 |
note m_o_h[OF this finite_cvars] |
|
227 |
} note 1 = this |
|
228 |
have "m_c C = (\<Sum>i<?a. m_o ?n (annos C ! i))" by(simp add: m_c_def) |
|
229 |
also have "\<dots> \<le> (\<Sum>i<?a. h * ?n + 1)" |
|
230 |
apply(rule setsum_mono) using 1 by simp |
|
231 |
also have "\<dots> = ?a * (h * ?n + 1)" by simp |
|
232 |
finally show ?thesis . |
|
233 |
qed |
|
234 |
||
49547 | 235 |
end |
236 |
||
237 |
locale Measure = Measure1 + |
|
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
238 |
assumes m2: "x < y \<Longrightarrow> m x > m y" |
49547 | 239 |
begin |
240 |
||
51372 | 241 |
lemma m1: "x \<le> y \<Longrightarrow> m x \<ge> m y" |
242 |
by(auto simp: le_less m2) |
|
243 |
||
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
244 |
lemma m_s2: "finite(dom S1) \<Longrightarrow> S1 < S2 \<Longrightarrow> m_s S1 > m_s S2" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
245 |
proof(auto simp add: less_st_def less_eq_st_def m_s_def) |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
246 |
assume "finite(dom S2)" and 0: "\<forall>x\<in>dom S2. fun S1 x \<le> fun S2 x" |
49547 | 247 |
hence 1: "\<forall>x\<in>dom S2. m(fun S1 x) \<ge> m(fun S2 x)" by (metis m1) |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
248 |
fix x assume "x \<in> dom S2" "\<not> fun S2 x \<le> fun S1 x" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
249 |
hence 2: "\<exists>x\<in>dom S2. m(fun S1 x) > m(fun S2 x)" by (metis 0 m2 less_le_not_le) |
49547 | 250 |
from setsum_strict_mono_ex1[OF `finite(dom S2)` 1 2] |
251 |
show "(\<Sum>x\<in>dom S2. m (fun S2 x)) < (\<Sum>x\<in>dom S2. m (fun S1 x))" . |
|
252 |
qed |
|
253 |
||
254 |
lemma m_o2: "finite X \<Longrightarrow> o1 \<in> L X \<Longrightarrow> o2 \<in> L X \<Longrightarrow> |
|
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
255 |
o1 < o2 \<Longrightarrow> m_o (card X) o1 > m_o (card X) o2" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
256 |
proof(induction o1 o2 rule: less_eq_option.induct) |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
257 |
case 1 thus ?case by (auto simp: m_o_def L_st_def m_s2 less_option_def) |
49547 | 258 |
next |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
259 |
case 2 thus ?case by(auto simp: m_o_def less_option_def le_imp_less_Suc m_s_h) |
49547 | 260 |
next |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
261 |
case 3 thus ?case by (auto simp: less_option_def) |
49547 | 262 |
qed |
263 |
||
51372 | 264 |
lemma m_o1: "finite X \<Longrightarrow> o1 \<in> L X \<Longrightarrow> o2 \<in> L X \<Longrightarrow> |
265 |
o1 \<le> o2 \<Longrightarrow> m_o (card X) o1 \<ge> m_o (card X) o2" |
|
266 |
by(auto simp: le_less m_o2) |
|
267 |
||
49396 | 268 |
lemma m_c2: "C1 \<in> L(vars(strip C1)) \<Longrightarrow> C2 \<in> L(vars(strip C2)) \<Longrightarrow> |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
269 |
C1 < C2 \<Longrightarrow> m_c C1 > m_c C2" |
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
270 |
proof(auto simp add: le_iff_le_annos m_c_def size_annos_same[of C1 C2] less_acom_def L_acom_def) |
49396 | 271 |
let ?X = "vars(strip C2)" |
47613 | 272 |
let ?n = "card ?X" |
49396 | 273 |
assume V1: "\<forall>a\<in>set(annos C1). a \<in> L ?X" |
274 |
and V2: "\<forall>a\<in>set(annos C2). a \<in> L ?X" |
|
275 |
and strip_eq: "strip C1 = strip C2" |
|
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
276 |
and 0: "\<forall>i<size(annos C2). annos C1 ! i \<le> annos C2 ! i" |
49396 | 277 |
hence 1: "\<forall>i<size(annos C2). m_o ?n (annos C1 ! i) \<ge> m_o ?n (annos C2 ! i)" |
47613 | 278 |
by (auto simp: all_set_conv_all_nth) |
279 |
(metis finite_cvars m_o1 size_annos_same2) |
|
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
280 |
fix i assume "i < size(annos C2)" "\<not> annos C2 ! i \<le> annos C1 ! i" |
49396 | 281 |
hence "m_o ?n (annos C1 ! i) > m_o ?n (annos C2 ! i)" (is "?P i") |
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
282 |
by(metis m_o2[OF finite_cvars] V1 V2 nth_mem size_annos_same[OF strip_eq] 0 less_option_def) |
49396 | 283 |
hence 2: "\<exists>i < size(annos C2). ?P i" using `i < size(annos C2)` by blast |
284 |
show "(\<Sum>i<size(annos C2). m_o ?n (annos C2 ! i)) |
|
285 |
< (\<Sum>i<size(annos C2). m_o ?n (annos C1 ! i))" |
|
47613 | 286 |
apply(rule setsum_strict_mono_ex1) using 1 2 by (auto) |
287 |
qed |
|
288 |
||
49547 | 289 |
end |
290 |
||
291 |
locale Abs_Int_measure = |
|
292 |
Abs_Int_mono where \<gamma>=\<gamma> + Measure where m=m |
|
293 |
for \<gamma> :: "'av::semilattice \<Rightarrow> val set" and m :: "'av \<Rightarrow> nat" |
|
294 |
begin |
|
295 |
||
47613 | 296 |
lemma AI_Some_measure: "\<exists>C. AI c = Some C" |
297 |
unfolding AI_def |
|
51359
00b45c7e831f
major redesign: order instead of preorder, new definition of intervals as quotients
nipkow
parents:
51036
diff
changeset
|
298 |
apply(rule pfp_termination[where I = "\<lambda>C. strip C = c \<and> C \<in> L(vars c)" and m="m_c"]) |
49464 | 299 |
apply(simp_all add: m_c2 mono_step'_top bot_least) |
47613 | 300 |
done |
301 |
||
302 |
end |
|
303 |
||
304 |
end |