10751
|
1 |
(* Title : Series.thy
|
|
2 |
Author : Jacques D. Fleuriot
|
|
3 |
Copyright : 1998 University of Cambridge
|
14416
|
4 |
|
|
5 |
Converted to Isar and polished by lcp
|
10751
|
6 |
*)
|
|
7 |
|
14416
|
8 |
header{*Finite Summation and Infinite Series*}
|
10751
|
9 |
|
14416
|
10 |
theory Series = SEQ + Lim:
|
10751
|
11 |
|
15047
|
12 |
syntax sumr :: "[nat,nat,(nat=>real)] => real"
|
|
13 |
translations
|
|
14 |
"sumr m n f" => "setsum (f::nat=>real) (atLeastLessThan m n)"
|
10751
|
15 |
|
|
16 |
constdefs
|
14416
|
17 |
sums :: "[nat=>real,real] => bool" (infixr "sums" 80)
|
10751
|
18 |
"f sums s == (%n. sumr 0 n f) ----> s"
|
|
19 |
|
14416
|
20 |
summable :: "(nat=>real) => bool"
|
|
21 |
"summable f == (\<exists>s. f sums s)"
|
|
22 |
|
|
23 |
suminf :: "(nat=>real) => real"
|
|
24 |
"suminf f == (@s. f sums s)"
|
|
25 |
|
|
26 |
|
15047
|
27 |
text{*This simprule replaces @{text "sumr 0 n"} by a term involving
|
|
28 |
@{term lessThan}, making other simprules inapplicable.*}
|
|
29 |
declare atLeast0LessThan [simp del]
|
14416
|
30 |
|
15047
|
31 |
lemma sumr_Suc [simp]:
|
|
32 |
"sumr m (Suc n) f = (if n < m then 0 else sumr m n f + f(n))"
|
|
33 |
by (simp add: atLeastLessThanSuc)
|
14416
|
34 |
|
|
35 |
lemma sumr_add: "sumr m n f + sumr m n g = sumr m n (%n. f n + g n)"
|
15047
|
36 |
by (simp add: setsum_addf)
|
14416
|
37 |
|
15047
|
38 |
lemma sumr_mult: "r * sumr m n (f::nat=>real) = sumr m n (%n. r * f n)"
|
|
39 |
by (simp add: setsum_mult)
|
14416
|
40 |
|
|
41 |
lemma sumr_split_add [rule_format]:
|
15047
|
42 |
"n < p --> sumr 0 n f + sumr n p f = sumr 0 p (f::nat=>real)"
|
14416
|
43 |
apply (induct_tac "p", auto)
|
|
44 |
apply (rename_tac k)
|
|
45 |
apply (subgoal_tac "n=k", auto)
|
|
46 |
done
|
|
47 |
|
15047
|
48 |
lemma sumr_split_add_minus:
|
|
49 |
"n < p ==> sumr 0 p f + - sumr 0 n f = sumr n p (f::nat=>real)"
|
14416
|
50 |
apply (drule_tac f1 = f in sumr_split_add [symmetric])
|
|
51 |
apply (simp add: add_ac)
|
|
52 |
done
|
|
53 |
|
15047
|
54 |
lemma sumr_rabs: "abs(sumr m n (f::nat=>real)) \<le> sumr m n (%i. abs(f i))"
|
|
55 |
by (simp add: setsum_abs)
|
14416
|
56 |
|
15047
|
57 |
lemma sumr_rabs_ge_zero [iff]: "0 \<le> sumr m n (%n. abs (f n))"
|
|
58 |
by (simp add: setsum_abs_ge_zero)
|
14416
|
59 |
|
15047
|
60 |
text{*Just a congruence rule*}
|
|
61 |
lemma sumr_fun_eq:
|
|
62 |
"(\<forall>r. m \<le> r & r < n --> f r = g r) ==> sumr m n f = sumr m n g"
|
|
63 |
by (auto intro: setsum_cong)
|
14416
|
64 |
|
|
65 |
lemma sumr_diff_mult_const: "sumr 0 n f - (real n*r) = sumr 0 n (%i. f i - r)"
|
15047
|
66 |
by (simp add: diff_minus setsum_addf real_of_nat_def)
|
14416
|
67 |
|
15047
|
68 |
lemma sumr_less_bounds_zero [simp]: "n < m ==> sumr m n f = 0"
|
|
69 |
by (simp add: atLeastLessThan_empty)
|
14416
|
70 |
|
|
71 |
lemma sumr_minus: "sumr m n (%i. - f i) = - sumr m n f"
|
15047
|
72 |
by (simp add: Finite_Set.setsum_negf)
|
14416
|
73 |
|
|
74 |
lemma sumr_shift_bounds: "sumr (m+k) (n+k) f = sumr m n (%i. f(i + k))"
|
|
75 |
by (induct_tac "n", auto)
|
|
76 |
|
|
77 |
lemma sumr_minus_one_realpow_zero [simp]: "sumr 0 (2*n) (%i. (-1) ^ Suc i) = 0"
|
|
78 |
by (induct_tac "n", auto)
|
|
79 |
|
|
80 |
lemma sumr_interval_const [rule_format (no_asm)]:
|
|
81 |
"(\<forall>n. m \<le> Suc n --> f n = r) --> m \<le> k --> sumr m k f = (real(k-m) * r)"
|
|
82 |
apply (induct_tac "k", auto)
|
|
83 |
apply (drule_tac x = n in spec)
|
|
84 |
apply (auto dest!: le_imp_less_or_eq)
|
15047
|
85 |
apply (simp add: left_distrib real_of_nat_Suc split: nat_diff_split)
|
14416
|
86 |
done
|
|
87 |
|
|
88 |
lemma sumr_interval_const2 [rule_format (no_asm)]:
|
|
89 |
"(\<forall>n. m \<le> n --> f n = r) --> m \<le> k
|
|
90 |
--> sumr m k f = (real (k - m) * r)"
|
|
91 |
apply (induct_tac "k", auto)
|
|
92 |
apply (drule_tac x = n in spec)
|
|
93 |
apply (auto dest!: le_imp_less_or_eq)
|
15047
|
94 |
apply (simp add: left_distrib real_of_nat_Suc split: nat_diff_split)
|
14416
|
95 |
done
|
|
96 |
|
15047
|
97 |
|
14416
|
98 |
lemma sumr_le [rule_format (no_asm)]:
|
|
99 |
"(\<forall>n. m \<le> n --> 0 \<le> f n) --> m < k --> sumr 0 m f \<le> sumr 0 k f"
|
|
100 |
apply (induct_tac "k")
|
|
101 |
apply (auto simp add: less_Suc_eq_le)
|
|
102 |
apply (drule_tac [!] x = n in spec, safe)
|
|
103 |
apply (drule le_imp_less_or_eq, safe)
|
15047
|
104 |
apply (arith)
|
14416
|
105 |
apply (drule_tac a = "sumr 0 m f" in order_refl [THEN add_mono], auto)
|
|
106 |
done
|
|
107 |
|
|
108 |
lemma sumr_le2 [rule_format (no_asm)]:
|
|
109 |
"(\<forall>r. m \<le> r & r < n --> f r \<le> g r) --> sumr m n f \<le> sumr m n g"
|
|
110 |
apply (induct_tac "n")
|
|
111 |
apply (auto intro: add_mono simp add: le_def)
|
|
112 |
done
|
|
113 |
|
|
114 |
lemma sumr_ge_zero [rule_format (no_asm)]: "(\<forall>n. 0 \<le> f n) --> 0 \<le> sumr m n f"
|
|
115 |
apply (induct_tac "n", auto)
|
|
116 |
apply (drule_tac x = n in spec, arith)
|
|
117 |
done
|
|
118 |
|
|
119 |
lemma sumr_ge_zero2 [rule_format (no_asm)]:
|
|
120 |
"(\<forall>n. m \<le> n --> 0 \<le> f n) --> 0 \<le> sumr m n f"
|
|
121 |
apply (induct_tac "n", auto)
|
|
122 |
apply (drule_tac x = n in spec, arith)
|
|
123 |
done
|
|
124 |
|
|
125 |
lemma rabs_sumr_rabs_cancel [simp]:
|
|
126 |
"abs (sumr m n (%n. abs (f n))) = (sumr m n (%n. abs (f n)))"
|
|
127 |
apply (induct_tac "n")
|
|
128 |
apply (auto, arith)
|
|
129 |
done
|
|
130 |
|
|
131 |
lemma sumr_zero [rule_format]:
|
|
132 |
"\<forall>n. N \<le> n --> f n = 0 ==> N \<le> m --> sumr m n f = 0"
|
|
133 |
by (induct_tac "n", auto)
|
|
134 |
|
|
135 |
lemma Suc_le_imp_diff_ge2:
|
|
136 |
"[|\<forall>n. N \<le> n --> f (Suc n) = 0; Suc N \<le> m|] ==> sumr m n f = 0"
|
|
137 |
apply (rule sumr_zero)
|
|
138 |
apply (case_tac "n", auto)
|
|
139 |
done
|
|
140 |
|
|
141 |
lemma sumr_one_lb_realpow_zero [simp]: "sumr (Suc 0) n (%n. f(n) * 0 ^ n) = 0"
|
|
142 |
apply (induct_tac "n")
|
|
143 |
apply (case_tac [2] "n", auto)
|
|
144 |
done
|
|
145 |
|
|
146 |
lemma sumr_diff: "sumr m n f - sumr m n g = sumr m n (%n. f n - g n)"
|
|
147 |
by (simp add: diff_minus sumr_add [symmetric] sumr_minus)
|
|
148 |
|
|
149 |
lemma sumr_subst [rule_format (no_asm)]:
|
|
150 |
"(\<forall>p. m \<le> p & p < m+n --> (f p = g p)) --> sumr m n f = sumr m n g"
|
|
151 |
by (induct_tac "n", auto)
|
|
152 |
|
|
153 |
lemma sumr_bound [rule_format (no_asm)]:
|
|
154 |
"(\<forall>p. m \<le> p & p < m + n --> (f(p) \<le> K))
|
|
155 |
--> (sumr m (m + n) f \<le> (real n * K))"
|
|
156 |
apply (induct_tac "n")
|
|
157 |
apply (auto intro: add_mono simp add: left_distrib real_of_nat_Suc)
|
|
158 |
done
|
|
159 |
|
|
160 |
lemma sumr_bound2 [rule_format (no_asm)]:
|
|
161 |
"(\<forall>p. 0 \<le> p & p < n --> (f(p) \<le> K))
|
|
162 |
--> (sumr 0 n f \<le> (real n * K))"
|
|
163 |
apply (induct_tac "n")
|
15047
|
164 |
apply (auto intro: add_mono simp add: left_distrib real_of_nat_Suc add_commute)
|
14416
|
165 |
done
|
|
166 |
|
|
167 |
lemma sumr_group [simp]:
|
|
168 |
"sumr 0 n (%m. sumr (m * k) (m*k + k) f) = sumr 0 (n * k) f"
|
|
169 |
apply (subgoal_tac "k = 0 | 0 < k", auto)
|
|
170 |
apply (induct_tac "n")
|
|
171 |
apply (simp_all add: sumr_split_add add_commute)
|
|
172 |
done
|
|
173 |
|
|
174 |
subsection{* Infinite Sums, by the Properties of Limits*}
|
|
175 |
|
|
176 |
(*----------------------
|
|
177 |
suminf is the sum
|
|
178 |
---------------------*)
|
|
179 |
lemma sums_summable: "f sums l ==> summable f"
|
|
180 |
by (simp add: sums_def summable_def, blast)
|
|
181 |
|
|
182 |
lemma summable_sums: "summable f ==> f sums (suminf f)"
|
|
183 |
apply (simp add: summable_def suminf_def)
|
|
184 |
apply (blast intro: someI2)
|
|
185 |
done
|
|
186 |
|
|
187 |
lemma summable_sumr_LIMSEQ_suminf:
|
|
188 |
"summable f ==> (%n. sumr 0 n f) ----> (suminf f)"
|
|
189 |
apply (simp add: summable_def suminf_def sums_def)
|
|
190 |
apply (blast intro: someI2)
|
|
191 |
done
|
|
192 |
|
|
193 |
(*-------------------
|
|
194 |
sum is unique
|
|
195 |
------------------*)
|
|
196 |
lemma sums_unique: "f sums s ==> (s = suminf f)"
|
|
197 |
apply (frule sums_summable [THEN summable_sums])
|
|
198 |
apply (auto intro!: LIMSEQ_unique simp add: sums_def)
|
|
199 |
done
|
|
200 |
|
|
201 |
(*
|
|
202 |
Goalw [sums_def,LIMSEQ_def]
|
|
203 |
"(\<forall>m. n \<le> Suc m --> f(m) = 0) ==> f sums (sumr 0 n f)"
|
|
204 |
by safe
|
|
205 |
by (res_inst_tac [("x","n")] exI 1);
|
|
206 |
by (safe THEN ftac le_imp_less_or_eq 1)
|
|
207 |
by safe
|
|
208 |
by (dres_inst_tac [("f","f")] sumr_split_add_minus 1);
|
|
209 |
by (ALLGOALS (Asm_simp_tac));
|
|
210 |
by (dtac (conjI RS sumr_interval_const) 1);
|
|
211 |
by Auto_tac
|
|
212 |
qed "series_zero";
|
|
213 |
next one was called series_zero2
|
|
214 |
**********************)
|
|
215 |
|
|
216 |
lemma series_zero:
|
|
217 |
"(\<forall>m. n \<le> m --> f(m) = 0) ==> f sums (sumr 0 n f)"
|
|
218 |
apply (simp add: sums_def LIMSEQ_def, safe)
|
|
219 |
apply (rule_tac x = n in exI)
|
|
220 |
apply (safe, frule le_imp_less_or_eq, safe)
|
|
221 |
apply (drule_tac f = f in sumr_split_add_minus, simp_all)
|
|
222 |
apply (drule sumr_interval_const2, auto)
|
|
223 |
done
|
|
224 |
|
|
225 |
lemma sums_mult: "x sums x0 ==> (%n. c * x(n)) sums (c * x0)"
|
|
226 |
by (auto simp add: sums_def sumr_mult [symmetric]
|
|
227 |
intro!: LIMSEQ_mult intro: LIMSEQ_const)
|
|
228 |
|
|
229 |
lemma sums_divide: "x sums x' ==> (%n. x(n)/c) sums (x'/c)"
|
|
230 |
by (simp add: real_divide_def sums_mult mult_commute [of _ "inverse c"])
|
|
231 |
|
|
232 |
lemma sums_diff: "[| x sums x0; y sums y0 |] ==> (%n. x n - y n) sums (x0-y0)"
|
|
233 |
by (auto simp add: sums_def sumr_diff [symmetric] intro: LIMSEQ_diff)
|
|
234 |
|
|
235 |
lemma suminf_mult: "summable f ==> suminf f * c = suminf(%n. f n * c)"
|
|
236 |
by (auto intro!: sums_unique sums_mult summable_sums simp add: mult_commute)
|
|
237 |
|
|
238 |
lemma suminf_mult2: "summable f ==> c * suminf f = suminf(%n. c * f n)"
|
|
239 |
by (auto intro!: sums_unique sums_mult summable_sums)
|
|
240 |
|
|
241 |
lemma suminf_diff:
|
|
242 |
"[| summable f; summable g |]
|
|
243 |
==> suminf f - suminf g = suminf(%n. f n - g n)"
|
|
244 |
by (auto intro!: sums_diff sums_unique summable_sums)
|
|
245 |
|
|
246 |
lemma sums_minus: "x sums x0 ==> (%n. - x n) sums - x0"
|
|
247 |
by (auto simp add: sums_def intro!: LIMSEQ_minus simp add: sumr_minus)
|
|
248 |
|
|
249 |
lemma sums_group:
|
|
250 |
"[|summable f; 0 < k |] ==> (%n. sumr (n*k) (n*k + k) f) sums (suminf f)"
|
|
251 |
apply (drule summable_sums)
|
|
252 |
apply (auto simp add: sums_def LIMSEQ_def)
|
|
253 |
apply (drule_tac x = r in spec, safe)
|
|
254 |
apply (rule_tac x = no in exI, safe)
|
|
255 |
apply (drule_tac x = "n*k" in spec)
|
|
256 |
apply (auto dest!: not_leE)
|
|
257 |
apply (drule_tac j = no in less_le_trans, auto)
|
|
258 |
done
|
|
259 |
|
|
260 |
lemma sumr_pos_lt_pair_lemma:
|
|
261 |
"[|\<forall>d. - f (n + (d + d)) < f (Suc (n + (d + d)))|]
|
|
262 |
==> sumr 0 (n + Suc (Suc 0)) f \<le> sumr 0 (Suc (Suc 0) * Suc no + n) f"
|
|
263 |
apply (induct_tac "no", simp)
|
|
264 |
apply (rule_tac y = "sumr 0 (Suc (Suc 0) * (Suc na) +n) f" in order_trans)
|
|
265 |
apply assumption
|
|
266 |
apply (drule_tac x = "Suc na" in spec)
|
|
267 |
apply (simp add: add_ac)
|
|
268 |
done
|
10751
|
269 |
|
|
270 |
|
14416
|
271 |
lemma sumr_pos_lt_pair:
|
|
272 |
"[|summable f; \<forall>d. 0 < (f(n + (Suc(Suc 0) * d))) + f(n + ((Suc(Suc 0) * d) + 1))|]
|
|
273 |
==> sumr 0 n f < suminf f"
|
|
274 |
apply (drule summable_sums)
|
|
275 |
apply (auto simp add: sums_def LIMSEQ_def)
|
|
276 |
apply (drule_tac x = "f (n) + f (n + 1) " in spec)
|
|
277 |
apply auto
|
|
278 |
apply (rule_tac [2] ccontr, drule_tac [2] linorder_not_less [THEN iffD1])
|
|
279 |
apply (frule_tac [2] no=no in sumr_pos_lt_pair_lemma)
|
|
280 |
apply (drule_tac x = 0 in spec, simp)
|
|
281 |
apply (rotate_tac 1, drule_tac x = "Suc (Suc 0) * (Suc no) + n" in spec)
|
|
282 |
apply (safe, simp)
|
|
283 |
apply (subgoal_tac "suminf f + (f (n) + f (n + 1)) \<le> sumr 0 (Suc (Suc 0) * (Suc no) + n) f")
|
|
284 |
apply (rule_tac [2] y = "sumr 0 (n+ Suc (Suc 0)) f" in order_trans)
|
|
285 |
prefer 3 apply assumption
|
|
286 |
apply (rule_tac [2] y = "sumr 0 n f + (f (n) + f (n + 1))" in order_trans)
|
|
287 |
apply simp_all
|
|
288 |
apply (subgoal_tac "suminf f \<le> sumr 0 (Suc (Suc 0) * (Suc no) + n) f")
|
|
289 |
apply (rule_tac [2] y = "suminf f + (f (n) + f (n + 1))" in order_trans)
|
|
290 |
prefer 3 apply simp
|
|
291 |
apply (drule_tac [2] x = 0 in spec)
|
|
292 |
prefer 2 apply simp
|
|
293 |
apply (subgoal_tac "0 \<le> sumr 0 (Suc (Suc 0) * Suc no + n) f + - suminf f")
|
|
294 |
apply (simp add: abs_if)
|
|
295 |
apply (auto simp add: linorder_not_less [symmetric])
|
|
296 |
done
|
|
297 |
|
|
298 |
|
|
299 |
|
|
300 |
(*-----------------------------------------------------------------
|
|
301 |
Summable series of positive terms has limit >= any partial sum
|
|
302 |
----------------------------------------------------------------*)
|
|
303 |
lemma series_pos_le:
|
|
304 |
"[| summable f; \<forall>m. n \<le> m --> 0 \<le> f(m) |] ==> sumr 0 n f \<le> suminf f"
|
|
305 |
apply (drule summable_sums)
|
|
306 |
apply (simp add: sums_def)
|
|
307 |
apply (cut_tac k = "sumr 0 n f" in LIMSEQ_const)
|
|
308 |
apply (erule LIMSEQ_le, blast)
|
|
309 |
apply (rule_tac x = n in exI, clarify)
|
|
310 |
apply (drule le_imp_less_or_eq)
|
|
311 |
apply (auto intro: sumr_le)
|
|
312 |
done
|
|
313 |
|
|
314 |
lemma series_pos_less:
|
|
315 |
"[| summable f; \<forall>m. n \<le> m --> 0 < f(m) |] ==> sumr 0 n f < suminf f"
|
|
316 |
apply (rule_tac y = "sumr 0 (Suc n) f" in order_less_le_trans)
|
|
317 |
apply (rule_tac [2] series_pos_le, auto)
|
|
318 |
apply (drule_tac x = m in spec, auto)
|
|
319 |
done
|
|
320 |
|
|
321 |
(*-------------------------------------------------------------------
|
|
322 |
sum of geometric progression
|
|
323 |
-------------------------------------------------------------------*)
|
|
324 |
|
|
325 |
lemma sumr_geometric: "x ~= 1 ==> sumr 0 n (%n. x ^ n) = (x ^ n - 1) / (x - 1)"
|
|
326 |
apply (induct_tac "n", auto)
|
|
327 |
apply (rule_tac c1 = "x - 1" in real_mult_right_cancel [THEN iffD1])
|
|
328 |
apply (auto simp add: real_mult_assoc left_distrib)
|
|
329 |
apply (simp add: right_distrib real_diff_def real_mult_commute)
|
|
330 |
done
|
|
331 |
|
|
332 |
lemma geometric_sums: "abs(x) < 1 ==> (%n. x ^ n) sums (1/(1 - x))"
|
|
333 |
apply (case_tac "x = 1")
|
|
334 |
apply (auto dest!: LIMSEQ_rabs_realpow_zero2 simp add: sumr_geometric sums_def real_diff_def add_divide_distrib)
|
|
335 |
apply (subgoal_tac "1 / (1 + -x) = 0/ (x - 1) + - 1/ (x - 1) ")
|
|
336 |
apply (erule ssubst)
|
|
337 |
apply (rule LIMSEQ_add, rule LIMSEQ_divide)
|
|
338 |
apply (auto intro: LIMSEQ_const simp add: real_diff_def minus_divide_right LIMSEQ_rabs_realpow_zero2)
|
|
339 |
done
|
|
340 |
|
|
341 |
(*-------------------------------------------------------------------
|
|
342 |
Cauchy-type criterion for convergence of series (c.f. Harrison)
|
|
343 |
-------------------------------------------------------------------*)
|
|
344 |
lemma summable_convergent_sumr_iff: "summable f = convergent (%n. sumr 0 n f)"
|
|
345 |
by (simp add: summable_def sums_def convergent_def)
|
|
346 |
|
|
347 |
lemma summable_Cauchy:
|
|
348 |
"summable f =
|
|
349 |
(\<forall>e. 0 < e --> (\<exists>N. \<forall>m n. N \<le> m --> abs(sumr m n f) < e))"
|
|
350 |
apply (auto simp add: summable_convergent_sumr_iff Cauchy_convergent_iff [symmetric] Cauchy_def)
|
|
351 |
apply (drule_tac [!] spec, auto)
|
|
352 |
apply (rule_tac x = M in exI)
|
|
353 |
apply (rule_tac [2] x = N in exI, auto)
|
|
354 |
apply (cut_tac [!] m = m and n = n in less_linear, auto)
|
|
355 |
apply (frule le_less_trans [THEN less_imp_le], assumption)
|
|
356 |
apply (drule_tac x = n in spec)
|
|
357 |
apply (drule_tac x = m in spec)
|
|
358 |
apply (auto intro: abs_minus_add_cancel [THEN subst]
|
|
359 |
simp add: sumr_split_add_minus abs_minus_add_cancel)
|
|
360 |
done
|
|
361 |
|
|
362 |
(*-------------------------------------------------------------------
|
|
363 |
Terms of a convergent series tend to zero
|
|
364 |
> Goalw [LIMSEQ_def] "summable f ==> f ----> 0"
|
|
365 |
Proved easily in HSeries after proving nonstandard case.
|
|
366 |
-------------------------------------------------------------------*)
|
|
367 |
(*-------------------------------------------------------------------
|
|
368 |
Comparison test
|
|
369 |
-------------------------------------------------------------------*)
|
|
370 |
lemma summable_comparison_test:
|
|
371 |
"[| \<exists>N. \<forall>n. N \<le> n --> abs(f n) \<le> g n; summable g |] ==> summable f"
|
|
372 |
apply (auto simp add: summable_Cauchy)
|
|
373 |
apply (drule spec, auto)
|
|
374 |
apply (rule_tac x = "N + Na" in exI, auto)
|
|
375 |
apply (rotate_tac 2)
|
|
376 |
apply (drule_tac x = m in spec)
|
|
377 |
apply (auto, rotate_tac 2, drule_tac x = n in spec)
|
|
378 |
apply (rule_tac y = "sumr m n (%k. abs (f k))" in order_le_less_trans)
|
|
379 |
apply (rule sumr_rabs)
|
|
380 |
apply (rule_tac y = "sumr m n g" in order_le_less_trans)
|
|
381 |
apply (auto intro: sumr_le2 simp add: abs_interval_iff)
|
|
382 |
done
|
|
383 |
|
|
384 |
lemma summable_rabs_comparison_test:
|
|
385 |
"[| \<exists>N. \<forall>n. N \<le> n --> abs(f n) \<le> g n; summable g |]
|
|
386 |
==> summable (%k. abs (f k))"
|
|
387 |
apply (rule summable_comparison_test)
|
|
388 |
apply (auto simp add: abs_idempotent)
|
|
389 |
done
|
|
390 |
|
|
391 |
(*------------------------------------------------------------------*)
|
|
392 |
(* Limit comparison property for series (c.f. jrh) *)
|
|
393 |
(*------------------------------------------------------------------*)
|
|
394 |
lemma summable_le:
|
|
395 |
"[|\<forall>n. f n \<le> g n; summable f; summable g |] ==> suminf f \<le> suminf g"
|
|
396 |
apply (drule summable_sums)+
|
|
397 |
apply (auto intro!: LIMSEQ_le simp add: sums_def)
|
|
398 |
apply (rule exI)
|
|
399 |
apply (auto intro!: sumr_le2)
|
|
400 |
done
|
|
401 |
|
|
402 |
lemma summable_le2:
|
|
403 |
"[|\<forall>n. abs(f n) \<le> g n; summable g |]
|
|
404 |
==> summable f & suminf f \<le> suminf g"
|
|
405 |
apply (auto intro: summable_comparison_test intro!: summable_le)
|
|
406 |
apply (simp add: abs_le_interval_iff)
|
|
407 |
done
|
|
408 |
|
|
409 |
(*-------------------------------------------------------------------
|
|
410 |
Absolute convergence imples normal convergence
|
|
411 |
-------------------------------------------------------------------*)
|
|
412 |
lemma summable_rabs_cancel: "summable (%n. abs (f n)) ==> summable f"
|
|
413 |
apply (auto simp add: sumr_rabs summable_Cauchy)
|
|
414 |
apply (drule spec, auto)
|
|
415 |
apply (rule_tac x = N in exI, auto)
|
|
416 |
apply (drule spec, auto)
|
|
417 |
apply (rule_tac y = "sumr m n (%n. abs (f n))" in order_le_less_trans)
|
|
418 |
apply (auto intro: sumr_rabs)
|
|
419 |
done
|
|
420 |
|
|
421 |
(*-------------------------------------------------------------------
|
|
422 |
Absolute convergence of series
|
|
423 |
-------------------------------------------------------------------*)
|
|
424 |
lemma summable_rabs:
|
|
425 |
"summable (%n. abs (f n)) ==> abs(suminf f) \<le> suminf (%n. abs(f n))"
|
|
426 |
by (auto intro: LIMSEQ_le LIMSEQ_imp_rabs summable_rabs_cancel summable_sumr_LIMSEQ_suminf sumr_rabs)
|
|
427 |
|
|
428 |
|
|
429 |
subsection{* The Ratio Test*}
|
|
430 |
|
|
431 |
lemma rabs_ratiotest_lemma: "[| c \<le> 0; abs x \<le> c * abs y |] ==> x = (0::real)"
|
|
432 |
apply (drule order_le_imp_less_or_eq, auto)
|
|
433 |
apply (subgoal_tac "0 \<le> c * abs y")
|
|
434 |
apply (simp add: zero_le_mult_iff, arith)
|
|
435 |
done
|
|
436 |
|
|
437 |
lemma le_Suc_ex: "(k::nat) \<le> l ==> (\<exists>n. l = k + n)"
|
|
438 |
apply (drule le_imp_less_or_eq)
|
|
439 |
apply (auto dest: less_imp_Suc_add)
|
|
440 |
done
|
|
441 |
|
|
442 |
lemma le_Suc_ex_iff: "((k::nat) \<le> l) = (\<exists>n. l = k + n)"
|
|
443 |
by (auto simp add: le_Suc_ex)
|
|
444 |
|
|
445 |
(*All this trouble just to get 0<c *)
|
|
446 |
lemma ratio_test_lemma2:
|
|
447 |
"[| \<forall>n. N \<le> n --> abs(f(Suc n)) \<le> c*abs(f n) |]
|
|
448 |
==> 0 < c | summable f"
|
|
449 |
apply (simp (no_asm) add: linorder_not_le [symmetric])
|
|
450 |
apply (simp add: summable_Cauchy)
|
|
451 |
apply (safe, subgoal_tac "\<forall>n. N \<le> n --> f (Suc n) = 0")
|
|
452 |
prefer 2 apply (blast intro: rabs_ratiotest_lemma)
|
|
453 |
apply (rule_tac x = "Suc N" in exI, clarify)
|
|
454 |
apply (drule_tac n=n in Suc_le_imp_diff_ge2, auto)
|
|
455 |
done
|
|
456 |
|
|
457 |
lemma ratio_test:
|
|
458 |
"[| c < 1; \<forall>n. N \<le> n --> abs(f(Suc n)) \<le> c*abs(f n) |]
|
|
459 |
==> summable f"
|
|
460 |
apply (frule ratio_test_lemma2, auto)
|
|
461 |
apply (rule_tac g = "%n. (abs (f N) / (c ^ N))*c ^ n" in summable_comparison_test)
|
|
462 |
apply (rule_tac x = N in exI, safe)
|
|
463 |
apply (drule le_Suc_ex_iff [THEN iffD1])
|
|
464 |
apply (auto simp add: power_add realpow_not_zero)
|
|
465 |
apply (induct_tac "na", auto)
|
|
466 |
apply (rule_tac y = "c*abs (f (N + n))" in order_trans)
|
|
467 |
apply (auto intro: mult_right_mono simp add: summable_def)
|
|
468 |
apply (simp add: mult_ac)
|
|
469 |
apply (rule_tac x = "abs (f N) * (1/ (1 - c)) / (c ^ N) " in exI)
|
|
470 |
apply (rule sums_divide)
|
|
471 |
apply (rule sums_mult)
|
15003
|
472 |
apply (auto intro!: sums_mult geometric_sums simp add: abs_if)
|
14416
|
473 |
done
|
|
474 |
|
|
475 |
|
|
476 |
(*--------------------------------------------------------------------------*)
|
|
477 |
(* Differentiation of finite sum *)
|
|
478 |
(*--------------------------------------------------------------------------*)
|
|
479 |
|
|
480 |
lemma DERIV_sumr [rule_format (no_asm)]:
|
|
481 |
"(\<forall>r. m \<le> r & r < (m + n) --> DERIV (%x. f r x) x :> (f' r x))
|
|
482 |
--> DERIV (%x. sumr m n (%n. f n x)) x :> sumr m n (%r. f' r x)"
|
|
483 |
apply (induct_tac "n")
|
|
484 |
apply (auto intro: DERIV_add)
|
|
485 |
done
|
|
486 |
|
|
487 |
ML
|
|
488 |
{*
|
|
489 |
val sumr_Suc = thm"sumr_Suc";
|
|
490 |
val sums_def = thm"sums_def";
|
|
491 |
val summable_def = thm"summable_def";
|
|
492 |
val suminf_def = thm"suminf_def";
|
|
493 |
|
|
494 |
val sumr_add = thm "sumr_add";
|
|
495 |
val sumr_mult = thm "sumr_mult";
|
|
496 |
val sumr_split_add = thm "sumr_split_add";
|
|
497 |
val sumr_rabs = thm "sumr_rabs";
|
|
498 |
val sumr_fun_eq = thm "sumr_fun_eq";
|
|
499 |
val sumr_diff_mult_const = thm "sumr_diff_mult_const";
|
|
500 |
val sumr_minus_one_realpow_zero = thm "sumr_minus_one_realpow_zero";
|
|
501 |
val sumr_le2 = thm "sumr_le2";
|
|
502 |
val sumr_ge_zero = thm "sumr_ge_zero";
|
|
503 |
val sumr_ge_zero2 = thm "sumr_ge_zero2";
|
|
504 |
val sumr_rabs_ge_zero = thm "sumr_rabs_ge_zero";
|
|
505 |
val rabs_sumr_rabs_cancel = thm "rabs_sumr_rabs_cancel";
|
|
506 |
val sumr_zero = thm "sumr_zero";
|
|
507 |
val Suc_le_imp_diff_ge2 = thm "Suc_le_imp_diff_ge2";
|
|
508 |
val sumr_one_lb_realpow_zero = thm "sumr_one_lb_realpow_zero";
|
|
509 |
val sumr_diff = thm "sumr_diff";
|
|
510 |
val sumr_subst = thm "sumr_subst";
|
|
511 |
val sumr_bound = thm "sumr_bound";
|
|
512 |
val sumr_bound2 = thm "sumr_bound2";
|
|
513 |
val sumr_group = thm "sumr_group";
|
|
514 |
val sums_summable = thm "sums_summable";
|
|
515 |
val summable_sums = thm "summable_sums";
|
|
516 |
val summable_sumr_LIMSEQ_suminf = thm "summable_sumr_LIMSEQ_suminf";
|
|
517 |
val sums_unique = thm "sums_unique";
|
|
518 |
val series_zero = thm "series_zero";
|
|
519 |
val sums_mult = thm "sums_mult";
|
|
520 |
val sums_divide = thm "sums_divide";
|
|
521 |
val sums_diff = thm "sums_diff";
|
|
522 |
val suminf_mult = thm "suminf_mult";
|
|
523 |
val suminf_mult2 = thm "suminf_mult2";
|
|
524 |
val suminf_diff = thm "suminf_diff";
|
|
525 |
val sums_minus = thm "sums_minus";
|
|
526 |
val sums_group = thm "sums_group";
|
|
527 |
val sumr_pos_lt_pair_lemma = thm "sumr_pos_lt_pair_lemma";
|
|
528 |
val sumr_pos_lt_pair = thm "sumr_pos_lt_pair";
|
|
529 |
val series_pos_le = thm "series_pos_le";
|
|
530 |
val series_pos_less = thm "series_pos_less";
|
|
531 |
val sumr_geometric = thm "sumr_geometric";
|
|
532 |
val geometric_sums = thm "geometric_sums";
|
|
533 |
val summable_convergent_sumr_iff = thm "summable_convergent_sumr_iff";
|
|
534 |
val summable_Cauchy = thm "summable_Cauchy";
|
|
535 |
val summable_comparison_test = thm "summable_comparison_test";
|
|
536 |
val summable_rabs_comparison_test = thm "summable_rabs_comparison_test";
|
|
537 |
val summable_le = thm "summable_le";
|
|
538 |
val summable_le2 = thm "summable_le2";
|
|
539 |
val summable_rabs_cancel = thm "summable_rabs_cancel";
|
|
540 |
val summable_rabs = thm "summable_rabs";
|
|
541 |
val rabs_ratiotest_lemma = thm "rabs_ratiotest_lemma";
|
|
542 |
val le_Suc_ex = thm "le_Suc_ex";
|
|
543 |
val le_Suc_ex_iff = thm "le_Suc_ex_iff";
|
|
544 |
val ratio_test_lemma2 = thm "ratio_test_lemma2";
|
|
545 |
val ratio_test = thm "ratio_test";
|
|
546 |
val DERIV_sumr = thm "DERIV_sumr";
|
|
547 |
*}
|
|
548 |
|
|
549 |
end
|