src/HOL/Transcendental.thy
 author huffman Tue Feb 24 11:12:58 2009 -0800 (2009-02-24) changeset 30082 43c5b7bfc791 parent 29803 c56a5571f60a child 30273 ecd6f0ca62ea permissions -rw-r--r--
make more proofs work whether or not One_nat_def is a simp rule
 paulson@12196 ` 1` ```(* Title : Transcendental.thy ``` paulson@12196 ` 2` ``` Author : Jacques D. Fleuriot ``` paulson@12196 ` 3` ``` Copyright : 1998,1999 University of Cambridge ``` paulson@13958 ` 4` ``` 1999,2001 University of Edinburgh ``` paulson@15077 ` 5` ``` Conversion to Isar and new proofs by Lawrence C Paulson, 2004 ``` paulson@12196 ` 6` ```*) ``` paulson@12196 ` 7` paulson@15077 ` 8` ```header{*Power Series, Transcendental Functions etc.*} ``` paulson@15077 ` 9` nipkow@15131 ` 10` ```theory Transcendental ``` haftmann@25600 ` 11` ```imports Fact Series Deriv NthRoot ``` nipkow@15131 ` 12` ```begin ``` paulson@15077 ` 13` huffman@29164 ` 14` ```subsection {* Properties of Power Series *} ``` paulson@15077 ` 15` huffman@23082 ` 16` ```lemma lemma_realpow_diff: ``` huffman@23082 ` 17` ``` fixes y :: "'a::recpower" ``` huffman@23082 ` 18` ``` shows "p \ n \ y ^ (Suc n - p) = (y ^ (n - p)) * y" ``` huffman@23082 ` 19` ```proof - ``` huffman@23082 ` 20` ``` assume "p \ n" ``` huffman@23082 ` 21` ``` hence "Suc n - p = Suc (n - p)" by (rule Suc_diff_le) ``` huffman@23082 ` 22` ``` thus ?thesis by (simp add: power_Suc power_commutes) ``` huffman@23082 ` 23` ```qed ``` paulson@15077 ` 24` paulson@15077 ` 25` ```lemma lemma_realpow_diff_sumr: ``` huffman@23082 ` 26` ``` fixes y :: "'a::{recpower,comm_semiring_0}" shows ``` huffman@23082 ` 27` ``` "(\p=0..p=0..p=0..p=0..p=0..z\ < \x\"}.*} ``` paulson@15077 ` 57` paulson@15077 ` 58` ```lemma powser_insidea: ``` huffman@23082 ` 59` ``` fixes x z :: "'a::{real_normed_field,banach,recpower}" ``` huffman@20849 ` 60` ``` assumes 1: "summable (\n. f n * x ^ n)" ``` huffman@23082 ` 61` ``` assumes 2: "norm z < norm x" ``` huffman@23082 ` 62` ``` shows "summable (\n. norm (f n * z ^ n))" ``` huffman@20849 ` 63` ```proof - ``` huffman@20849 ` 64` ``` from 2 have x_neq_0: "x \ 0" by clarsimp ``` huffman@20849 ` 65` ``` from 1 have "(\n. f n * x ^ n) ----> 0" ``` huffman@20849 ` 66` ``` by (rule summable_LIMSEQ_zero) ``` huffman@20849 ` 67` ``` hence "convergent (\n. f n * x ^ n)" ``` huffman@20849 ` 68` ``` by (rule convergentI) ``` huffman@20849 ` 69` ``` hence "Cauchy (\n. f n * x ^ n)" ``` huffman@20849 ` 70` ``` by (simp add: Cauchy_convergent_iff) ``` huffman@20849 ` 71` ``` hence "Bseq (\n. f n * x ^ n)" ``` huffman@20849 ` 72` ``` by (rule Cauchy_Bseq) ``` huffman@23082 ` 73` ``` then obtain K where 3: "0 < K" and 4: "\n. norm (f n * x ^ n) \ K" ``` huffman@20849 ` 74` ``` by (simp add: Bseq_def, safe) ``` huffman@23082 ` 75` ``` have "\N. \n\N. norm (norm (f n * z ^ n)) \ ``` huffman@23082 ` 76` ``` K * norm (z ^ n) * inverse (norm (x ^ n))" ``` huffman@20849 ` 77` ``` proof (intro exI allI impI) ``` huffman@20849 ` 78` ``` fix n::nat assume "0 \ n" ``` huffman@23082 ` 79` ``` have "norm (norm (f n * z ^ n)) * norm (x ^ n) = ``` huffman@23082 ` 80` ``` norm (f n * x ^ n) * norm (z ^ n)" ``` huffman@23082 ` 81` ``` by (simp add: norm_mult abs_mult) ``` huffman@23082 ` 82` ``` also have "\ \ K * norm (z ^ n)" ``` huffman@23082 ` 83` ``` by (simp only: mult_right_mono 4 norm_ge_zero) ``` huffman@23082 ` 84` ``` also have "\ = K * norm (z ^ n) * (inverse (norm (x ^ n)) * norm (x ^ n))" ``` huffman@20849 ` 85` ``` by (simp add: x_neq_0) ``` huffman@23082 ` 86` ``` also have "\ = K * norm (z ^ n) * inverse (norm (x ^ n)) * norm (x ^ n)" ``` huffman@20849 ` 87` ``` by (simp only: mult_assoc) ``` huffman@23082 ` 88` ``` finally show "norm (norm (f n * z ^ n)) \ ``` huffman@23082 ` 89` ``` K * norm (z ^ n) * inverse (norm (x ^ n))" ``` huffman@20849 ` 90` ``` by (simp add: mult_le_cancel_right x_neq_0) ``` huffman@20849 ` 91` ``` qed ``` huffman@23082 ` 92` ``` moreover have "summable (\n. K * norm (z ^ n) * inverse (norm (x ^ n)))" ``` huffman@20849 ` 93` ``` proof - ``` huffman@23082 ` 94` ``` from 2 have "norm (norm (z * inverse x)) < 1" ``` huffman@23082 ` 95` ``` using x_neq_0 ``` huffman@23082 ` 96` ``` by (simp add: nonzero_norm_divide divide_inverse [symmetric]) ``` huffman@23082 ` 97` ``` hence "summable (\n. norm (z * inverse x) ^ n)" ``` huffman@20849 ` 98` ``` by (rule summable_geometric) ``` huffman@23082 ` 99` ``` hence "summable (\n. K * norm (z * inverse x) ^ n)" ``` huffman@20849 ` 100` ``` by (rule summable_mult) ``` huffman@23082 ` 101` ``` thus "summable (\n. K * norm (z ^ n) * inverse (norm (x ^ n)))" ``` huffman@23082 ` 102` ``` using x_neq_0 ``` huffman@23082 ` 103` ``` by (simp add: norm_mult nonzero_norm_inverse power_mult_distrib ``` huffman@23082 ` 104` ``` power_inverse norm_power mult_assoc) ``` huffman@20849 ` 105` ``` qed ``` huffman@23082 ` 106` ``` ultimately show "summable (\n. norm (f n * z ^ n))" ``` huffman@20849 ` 107` ``` by (rule summable_comparison_test) ``` huffman@20849 ` 108` ```qed ``` paulson@15077 ` 109` paulson@15229 ` 110` ```lemma powser_inside: ``` huffman@23082 ` 111` ``` fixes f :: "nat \ 'a::{real_normed_field,banach,recpower}" shows ``` huffman@23082 ` 112` ``` "[| summable (%n. f(n) * (x ^ n)); norm z < norm x |] ``` paulson@15077 ` 113` ``` ==> summable (%n. f(n) * (z ^ n))" ``` huffman@23082 ` 114` ```by (rule powser_insidea [THEN summable_norm_cancel]) ``` paulson@15077 ` 115` hoelzl@29803 ` 116` ```lemma sum_split_even_odd: fixes f :: "nat \ real" shows ``` hoelzl@29803 ` 117` ``` "(\ i = 0 ..< 2 * n. if even i then f i else g i) = ``` hoelzl@29803 ` 118` ``` (\ i = 0 ..< n. f (2 * i)) + (\ i = 0 ..< n. g (2 * i + 1))" ``` hoelzl@29803 ` 119` ```proof (induct n) ``` hoelzl@29803 ` 120` ``` case (Suc n) ``` hoelzl@29803 ` 121` ``` have "(\ i = 0 ..< 2 * Suc n. if even i then f i else g i) = ``` hoelzl@29803 ` 122` ``` (\ i = 0 ..< n. f (2 * i)) + (\ i = 0 ..< n. g (2 * i + 1)) + (f (2 * n) + g (2 * n + 1))" ``` huffman@30082 ` 123` ``` using Suc.hyps unfolding One_nat_def by auto ``` hoelzl@29803 ` 124` ``` also have "\ = (\ i = 0 ..< Suc n. f (2 * i)) + (\ i = 0 ..< Suc n. g (2 * i + 1))" by auto ``` hoelzl@29803 ` 125` ``` finally show ?case . ``` hoelzl@29803 ` 126` ```qed auto ``` hoelzl@29803 ` 127` hoelzl@29803 ` 128` ```lemma sums_if': fixes g :: "nat \ real" assumes "g sums x" ``` hoelzl@29803 ` 129` ``` shows "(\ n. if even n then 0 else g ((n - 1) div 2)) sums x" ``` hoelzl@29803 ` 130` ``` unfolding sums_def ``` hoelzl@29803 ` 131` ```proof (rule LIMSEQ_I) ``` hoelzl@29803 ` 132` ``` fix r :: real assume "0 < r" ``` hoelzl@29803 ` 133` ``` from `g sums x`[unfolded sums_def, THEN LIMSEQ_D, OF this] ``` hoelzl@29803 ` 134` ``` obtain no where no_eq: "\ n. n \ no \ (norm (setsum g { 0.. 2 * no" hence "m div 2 \ no" by auto ``` hoelzl@29803 ` 138` ``` have sum_eq: "?SUM (2 * (m div 2)) = setsum g { 0 ..< m div 2 }" ``` hoelzl@29803 ` 139` ``` using sum_split_even_odd by auto ``` hoelzl@29803 ` 140` ``` hence "(norm (?SUM (2 * (m div 2)) - x) < r)" using no_eq unfolding sum_eq using `m div 2 \ no` by auto ``` hoelzl@29803 ` 141` ``` moreover ``` hoelzl@29803 ` 142` ``` have "?SUM (2 * (m div 2)) = ?SUM m" ``` hoelzl@29803 ` 143` ``` proof (cases "even m") ``` hoelzl@29803 ` 144` ``` case True show ?thesis unfolding even_nat_div_two_times_two[OF True, unfolded numeral_2_eq_2[symmetric]] .. ``` hoelzl@29803 ` 145` ``` next ``` hoelzl@29803 ` 146` ``` case False hence "even (Suc m)" by auto ``` hoelzl@29803 ` 147` ``` from even_nat_div_two_times_two[OF this, unfolded numeral_2_eq_2[symmetric]] odd_nat_plus_one_div_two[OF False, unfolded numeral_2_eq_2[symmetric]] ``` hoelzl@29803 ` 148` ``` have eq: "Suc (2 * (m div 2)) = m" by auto ``` hoelzl@29803 ` 149` ``` hence "even (2 * (m div 2))" using `odd m` by auto ``` hoelzl@29803 ` 150` ``` have "?SUM m = ?SUM (Suc (2 * (m div 2)))" unfolding eq .. ``` hoelzl@29803 ` 151` ``` also have "\ = ?SUM (2 * (m div 2))" using `even (2 * (m div 2))` by auto ``` hoelzl@29803 ` 152` ``` finally show ?thesis by auto ``` hoelzl@29803 ` 153` ``` qed ``` hoelzl@29803 ` 154` ``` ultimately have "(norm (?SUM m - x) < r)" by auto ``` hoelzl@29803 ` 155` ``` } ``` hoelzl@29803 ` 156` ``` thus "\ no. \ m \ no. norm (?SUM m - x) < r" by blast ``` hoelzl@29803 ` 157` ```qed ``` hoelzl@29803 ` 158` hoelzl@29803 ` 159` ```lemma sums_if: fixes g :: "nat \ real" assumes "g sums x" and "f sums y" ``` hoelzl@29803 ` 160` ``` shows "(\ n. if even n then f (n div 2) else g ((n - 1) div 2)) sums (x + y)" ``` hoelzl@29803 ` 161` ```proof - ``` hoelzl@29803 ` 162` ``` let ?s = "\ n. if even n then 0 else f ((n - 1) div 2)" ``` hoelzl@29803 ` 163` ``` { fix B T E have "(if B then (0 :: real) else E) + (if B then T else 0) = (if B then T else E)" ``` hoelzl@29803 ` 164` ``` by (cases B) auto } note if_sum = this ``` hoelzl@29803 ` 165` ``` have g_sums: "(\ n. if even n then 0 else g ((n - 1) div 2)) sums x" using sums_if'[OF `g sums x`] . ``` hoelzl@29803 ` 166` ``` { ``` hoelzl@29803 ` 167` ``` have "?s 0 = 0" by auto ``` hoelzl@29803 ` 168` ``` have Suc_m1: "\ n. Suc n - 1 = n" by auto ``` hoelzl@29803 ` 169` ``` { fix B T E have "(if \ B then T else E) = (if B then E else T)" by auto } note if_eq = this ``` hoelzl@29803 ` 170` hoelzl@29803 ` 171` ``` have "?s sums y" using sums_if'[OF `f sums y`] . ``` hoelzl@29803 ` 172` ``` from this[unfolded sums_def, THEN LIMSEQ_Suc] ``` hoelzl@29803 ` 173` ``` have "(\ n. if even n then f (n div 2) else 0) sums y" ``` hoelzl@29803 ` 174` ``` unfolding sums_def setsum_shift_lb_Suc0_0_upt[where f="?s", OF `?s 0 = 0`, symmetric] ``` hoelzl@29803 ` 175` ``` image_Suc_atLeastLessThan[symmetric] setsum_reindex[OF inj_Suc, unfolded comp_def] ``` hoelzl@29803 ` 176` ``` even_nat_Suc Suc_m1 if_eq . ``` hoelzl@29803 ` 177` ``` } from sums_add[OF g_sums this] ``` hoelzl@29803 ` 178` ``` show ?thesis unfolding if_sum . ``` hoelzl@29803 ` 179` ```qed ``` hoelzl@29803 ` 180` hoelzl@29803 ` 181` ```subsection {* Alternating series test / Leibniz formula *} ``` hoelzl@29803 ` 182` hoelzl@29803 ` 183` ```lemma sums_alternating_upper_lower: ``` hoelzl@29803 ` 184` ``` fixes a :: "nat \ real" ``` hoelzl@29803 ` 185` ``` assumes mono: "\n. a (Suc n) \ a n" and a_pos: "\n. 0 \ a n" and "a ----> 0" ``` hoelzl@29803 ` 186` ``` shows "\l. ((\n. (\i=0..<2*n. -1^i*a i) \ l) \ (\ n. \i=0..<2*n. -1^i*a i) ----> l) \ ``` hoelzl@29803 ` 187` ``` ((\n. l \ (\i=0..<2*n + 1. -1^i*a i)) \ (\ n. \i=0..<2*n + 1. -1^i*a i) ----> l)" ``` hoelzl@29803 ` 188` ``` (is "\l. ((\n. ?f n \ l) \ _) \ ((\n. l \ ?g n) \ _)") ``` hoelzl@29803 ` 189` ```proof - ``` huffman@30082 ` 190` ``` have fg_diff: "\n. ?f n - ?g n = - a (2 * n)" unfolding One_nat_def by auto ``` hoelzl@29803 ` 191` hoelzl@29803 ` 192` ``` have "\ n. ?f n \ ?f (Suc n)" ``` hoelzl@29803 ` 193` ``` proof fix n show "?f n \ ?f (Suc n)" using mono[of "2*n"] by auto qed ``` hoelzl@29803 ` 194` ``` moreover ``` hoelzl@29803 ` 195` ``` have "\ n. ?g (Suc n) \ ?g n" ``` huffman@30082 ` 196` ``` proof fix n show "?g (Suc n) \ ?g n" using mono[of "Suc (2*n)"] ``` huffman@30082 ` 197` ``` unfolding One_nat_def by auto qed ``` hoelzl@29803 ` 198` ``` moreover ``` hoelzl@29803 ` 199` ``` have "\ n. ?f n \ ?g n" ``` huffman@30082 ` 200` ``` proof fix n show "?f n \ ?g n" using fg_diff a_pos ``` huffman@30082 ` 201` ``` unfolding One_nat_def by auto qed ``` hoelzl@29803 ` 202` ``` moreover ``` hoelzl@29803 ` 203` ``` have "(\ n. ?f n - ?g n) ----> 0" unfolding fg_diff ``` hoelzl@29803 ` 204` ``` proof (rule LIMSEQ_I) ``` hoelzl@29803 ` 205` ``` fix r :: real assume "0 < r" ``` hoelzl@29803 ` 206` ``` with `a ----> 0`[THEN LIMSEQ_D] ``` hoelzl@29803 ` 207` ``` obtain N where "\ n. n \ N \ norm (a n - 0) < r" by auto ``` hoelzl@29803 ` 208` ``` hence "\ n \ N. norm (- a (2 * n) - 0) < r" by auto ``` hoelzl@29803 ` 209` ``` thus "\ N. \ n \ N. norm (- a (2 * n) - 0) < r" by auto ``` hoelzl@29803 ` 210` ``` qed ``` hoelzl@29803 ` 211` ``` ultimately ``` hoelzl@29803 ` 212` ``` show ?thesis by (rule lemma_nest_unique) ``` hoelzl@29803 ` 213` ```qed ``` hoelzl@29803 ` 214` hoelzl@29803 ` 215` ```lemma summable_Leibniz': fixes a :: "nat \ real" ``` hoelzl@29803 ` 216` ``` assumes a_zero: "a ----> 0" and a_pos: "\ n. 0 \ a n" ``` hoelzl@29803 ` 217` ``` and a_monotone: "\ n. a (Suc n) \ a n" ``` hoelzl@29803 ` 218` ``` shows summable: "summable (\ n. (-1)^n * a n)" ``` hoelzl@29803 ` 219` ``` and "\n. (\i=0..<2*n. (-1)^i*a i) \ (\i. (-1)^i*a i)" ``` hoelzl@29803 ` 220` ``` and "(\n. \i=0..<2*n. (-1)^i*a i) ----> (\i. (-1)^i*a i)" ``` hoelzl@29803 ` 221` ``` and "\n. (\i. (-1)^i*a i) \ (\i=0..<2*n+1. (-1)^i*a i)" ``` hoelzl@29803 ` 222` ``` and "(\n. \i=0..<2*n+1. (-1)^i*a i) ----> (\i. (-1)^i*a i)" ``` hoelzl@29803 ` 223` ```proof - ``` hoelzl@29803 ` 224` ``` let "?S n" = "(-1)^n * a n" ``` hoelzl@29803 ` 225` ``` let "?P n" = "\i=0.. n. ?f n \ l" and "?f ----> l" and above_l: "\ n. l \ ?g n" and "?g ----> l" ``` hoelzl@29803 ` 229` ``` using sums_alternating_upper_lower[OF a_monotone a_pos a_zero] by blast ``` hoelzl@29803 ` 230` ``` ``` hoelzl@29803 ` 231` ``` let ?Sa = "\ m. \ n = 0.. l" ``` hoelzl@29803 ` 233` ``` proof (rule LIMSEQ_I) ``` hoelzl@29803 ` 234` ``` fix r :: real assume "0 < r" ``` hoelzl@29803 ` 235` hoelzl@29803 ` 236` ``` with `?f ----> l`[THEN LIMSEQ_D] ``` hoelzl@29803 ` 237` ``` obtain f_no where f: "\ n. n \ f_no \ norm (?f n - l) < r" by auto ``` hoelzl@29803 ` 238` hoelzl@29803 ` 239` ``` from `0 < r` `?g ----> l`[THEN LIMSEQ_D] ``` hoelzl@29803 ` 240` ``` obtain g_no where g: "\ n. n \ g_no \ norm (?g n - l) < r" by auto ``` hoelzl@29803 ` 241` hoelzl@29803 ` 242` ``` { fix n :: nat ``` hoelzl@29803 ` 243` ``` assume "n \ (max (2 * f_no) (2 * g_no))" hence "n \ 2 * f_no" and "n \ 2 * g_no" by auto ``` hoelzl@29803 ` 244` ``` have "norm (?Sa n - l) < r" ``` hoelzl@29803 ` 245` ``` proof (cases "even n") ``` hoelzl@29803 ` 246` ``` case True from even_nat_div_two_times_two[OF this] ``` hoelzl@29803 ` 247` ``` have n_eq: "2 * (n div 2) = n" unfolding numeral_2_eq_2[symmetric] by auto ``` hoelzl@29803 ` 248` ``` with `n \ 2 * f_no` have "n div 2 \ f_no" by auto ``` hoelzl@29803 ` 249` ``` from f[OF this] ``` hoelzl@29803 ` 250` ``` show ?thesis unfolding n_eq atLeastLessThanSuc_atLeastAtMost . ``` hoelzl@29803 ` 251` ``` next ``` hoelzl@29803 ` 252` ``` case False hence "even (n - 1)" using even_num_iff odd_pos by auto ``` hoelzl@29803 ` 253` ``` from even_nat_div_two_times_two[OF this] ``` hoelzl@29803 ` 254` ``` have n_eq: "2 * ((n - 1) div 2) = n - 1" unfolding numeral_2_eq_2[symmetric] by auto ``` hoelzl@29803 ` 255` ``` hence range_eq: "n - 1 + 1 = n" using odd_pos[OF False] by auto ``` hoelzl@29803 ` 256` hoelzl@29803 ` 257` ``` from n_eq `n \ 2 * g_no` have "(n - 1) div 2 \ g_no" by auto ``` hoelzl@29803 ` 258` ``` from g[OF this] ``` hoelzl@29803 ` 259` ``` show ?thesis unfolding n_eq atLeastLessThanSuc_atLeastAtMost range_eq . ``` hoelzl@29803 ` 260` ``` qed ``` hoelzl@29803 ` 261` ``` } ``` hoelzl@29803 ` 262` ``` thus "\ no. \ n \ no. norm (?Sa n - l) < r" by blast ``` hoelzl@29803 ` 263` ``` qed ``` hoelzl@29803 ` 264` ``` hence sums_l: "(\i. (-1)^i * a i) sums l" unfolding sums_def atLeastLessThanSuc_atLeastAtMost[symmetric] . ``` hoelzl@29803 ` 265` ``` thus "summable ?S" using summable_def by auto ``` hoelzl@29803 ` 266` hoelzl@29803 ` 267` ``` have "l = suminf ?S" using sums_unique[OF sums_l] . ``` hoelzl@29803 ` 268` hoelzl@29803 ` 269` ``` { fix n show "suminf ?S \ ?g n" unfolding sums_unique[OF sums_l, symmetric] using above_l by auto } ``` hoelzl@29803 ` 270` ``` { fix n show "?f n \ suminf ?S" unfolding sums_unique[OF sums_l, symmetric] using below_l by auto } ``` hoelzl@29803 ` 271` ``` show "?g ----> suminf ?S" using `?g ----> l` `l = suminf ?S` by auto ``` hoelzl@29803 ` 272` ``` show "?f ----> suminf ?S" using `?f ----> l` `l = suminf ?S` by auto ``` hoelzl@29803 ` 273` ```qed ``` hoelzl@29803 ` 274` hoelzl@29803 ` 275` ```theorem summable_Leibniz: fixes a :: "nat \ real" ``` hoelzl@29803 ` 276` ``` assumes a_zero: "a ----> 0" and "monoseq a" ``` hoelzl@29803 ` 277` ``` shows "summable (\ n. (-1)^n * a n)" (is "?summable") ``` hoelzl@29803 ` 278` ``` and "0 < a 0 \ (\n. (\i. -1^i*a i) \ { \i=0..<2*n. -1^i * a i .. \i=0..<2*n+1. -1^i * a i})" (is "?pos") ``` hoelzl@29803 ` 279` ``` and "a 0 < 0 \ (\n. (\i. -1^i*a i) \ { \i=0..<2*n+1. -1^i * a i .. \i=0..<2*n. -1^i * a i})" (is "?neg") ``` hoelzl@29803 ` 280` ``` and "(\n. \i=0..<2*n. -1^i*a i) ----> (\i. -1^i*a i)" (is "?f") ``` hoelzl@29803 ` 281` ``` and "(\n. \i=0..<2*n+1. -1^i*a i) ----> (\i. -1^i*a i)" (is "?g") ``` hoelzl@29803 ` 282` ```proof - ``` hoelzl@29803 ` 283` ``` have "?summable \ ?pos \ ?neg \ ?f \ ?g" ``` hoelzl@29803 ` 284` ``` proof (cases "(\ n. 0 \ a n) \ (\m. \n\m. a n \ a m)") ``` hoelzl@29803 ` 285` ``` case True ``` hoelzl@29803 ` 286` ``` hence ord: "\n m. m \ n \ a n \ a m" and ge0: "\ n. 0 \ a n" by auto ``` hoelzl@29803 ` 287` ``` { fix n have "a (Suc n) \ a n" using ord[where n="Suc n" and m=n] by auto } ``` hoelzl@29803 ` 288` ``` note leibniz = summable_Leibniz'[OF `a ----> 0` ge0] and mono = this ``` hoelzl@29803 ` 289` ``` from leibniz[OF mono] ``` hoelzl@29803 ` 290` ``` show ?thesis using `0 \ a 0` by auto ``` hoelzl@29803 ` 291` ``` next ``` hoelzl@29803 ` 292` ``` let ?a = "\ n. - a n" ``` hoelzl@29803 ` 293` ``` case False ``` hoelzl@29803 ` 294` ``` with monoseq_le[OF `monoseq a` `a ----> 0`] ``` hoelzl@29803 ` 295` ``` have "(\ n. a n \ 0) \ (\m. \n\m. a m \ a n)" by auto ``` hoelzl@29803 ` 296` ``` hence ord: "\n m. m \ n \ ?a n \ ?a m" and ge0: "\ n. 0 \ ?a n" by auto ``` hoelzl@29803 ` 297` ``` { fix n have "?a (Suc n) \ ?a n" using ord[where n="Suc n" and m=n] by auto } ``` hoelzl@29803 ` 298` ``` note monotone = this ``` hoelzl@29803 ` 299` ``` note leibniz = summable_Leibniz'[OF _ ge0, of "\x. x", OF LIMSEQ_minus[OF `a ----> 0`, unfolded minus_zero] monotone] ``` hoelzl@29803 ` 300` ``` have "summable (\ n. (-1)^n * ?a n)" using leibniz(1) by auto ``` hoelzl@29803 ` 301` ``` then obtain l where "(\ n. (-1)^n * ?a n) sums l" unfolding summable_def by auto ``` hoelzl@29803 ` 302` ``` from this[THEN sums_minus] ``` hoelzl@29803 ` 303` ``` have "(\ n. (-1)^n * a n) sums -l" by auto ``` hoelzl@29803 ` 304` ``` hence ?summable unfolding summable_def by auto ``` hoelzl@29803 ` 305` ``` moreover ``` hoelzl@29803 ` 306` ``` have "\ a b :: real. \ - a - - b \ = \a - b\" unfolding minus_diff_minus by auto ``` hoelzl@29803 ` 307` ``` ``` hoelzl@29803 ` 308` ``` from suminf_minus[OF leibniz(1), unfolded mult_minus_right minus_minus] ``` hoelzl@29803 ` 309` ``` have move_minus: "(\n. - (-1 ^ n * a n)) = - (\n. -1 ^ n * a n)" by auto ``` hoelzl@29803 ` 310` hoelzl@29803 ` 311` ``` have ?pos using `0 \ ?a 0` by auto ``` hoelzl@29803 ` 312` ``` moreover have ?neg using leibniz(2,4) unfolding mult_minus_right setsum_negf move_minus neg_le_iff_le by auto ``` hoelzl@29803 ` 313` ``` moreover have ?f and ?g using leibniz(3,5)[unfolded mult_minus_right setsum_negf move_minus, THEN LIMSEQ_minus_cancel] by auto ``` hoelzl@29803 ` 314` ``` ultimately show ?thesis by auto ``` hoelzl@29803 ` 315` ``` qed ``` hoelzl@29803 ` 316` ``` from this[THEN conjunct1] this[THEN conjunct2, THEN conjunct1] this[THEN conjunct2, THEN conjunct2, THEN conjunct1] this[THEN conjunct2, THEN conjunct2, THEN conjunct2, THEN conjunct1] ``` hoelzl@29803 ` 317` ``` this[THEN conjunct2, THEN conjunct2, THEN conjunct2, THEN conjunct2] ``` hoelzl@29803 ` 318` ``` show ?summable and ?pos and ?neg and ?f and ?g . ``` hoelzl@29803 ` 319` ```qed ``` paulson@15077 ` 320` huffman@29164 ` 321` ```subsection {* Term-by-Term Differentiability of Power Series *} ``` huffman@23043 ` 322` huffman@23043 ` 323` ```definition ``` huffman@23082 ` 324` ``` diffs :: "(nat => 'a::ring_1) => nat => 'a" where ``` huffman@23082 ` 325` ``` "diffs c = (%n. of_nat (Suc n) * c(Suc n))" ``` paulson@15077 ` 326` paulson@15077 ` 327` ```text{*Lemma about distributing negation over it*} ``` paulson@15077 ` 328` ```lemma diffs_minus: "diffs (%n. - c n) = (%n. - diffs c n)" ``` paulson@15077 ` 329` ```by (simp add: diffs_def) ``` paulson@15077 ` 330` huffman@29163 ` 331` ```lemma sums_Suc_imp: ``` huffman@29163 ` 332` ``` assumes f: "f 0 = 0" ``` huffman@29163 ` 333` ``` shows "(\n. f (Suc n)) sums s \ (\n. f n) sums s" ``` huffman@29163 ` 334` ```unfolding sums_def ``` huffman@29163 ` 335` ```apply (rule LIMSEQ_imp_Suc) ``` huffman@29163 ` 336` ```apply (subst setsum_shift_lb_Suc0_0_upt [where f=f, OF f, symmetric]) ``` huffman@29163 ` 337` ```apply (simp only: setsum_shift_bounds_Suc_ivl) ``` paulson@15077 ` 338` ```done ``` paulson@15077 ` 339` paulson@15229 ` 340` ```lemma diffs_equiv: ``` paulson@15229 ` 341` ``` "summable (%n. (diffs c)(n) * (x ^ n)) ==> ``` huffman@23082 ` 342` ``` (%n. of_nat n * c(n) * (x ^ (n - Suc 0))) sums ``` nipkow@15546 ` 343` ``` (\n. (diffs c)(n) * (x ^ n))" ``` huffman@29163 ` 344` ```unfolding diffs_def ``` huffman@29163 ` 345` ```apply (drule summable_sums) ``` huffman@29163 ` 346` ```apply (rule sums_Suc_imp, simp_all) ``` paulson@15077 ` 347` ```done ``` paulson@15077 ` 348` paulson@15077 ` 349` ```lemma lemma_termdiff1: ``` huffman@23082 ` 350` ``` fixes z :: "'a :: {recpower,comm_ring}" shows ``` nipkow@15539 ` 351` ``` "(\p=0..p=0..i = 0.. 0" shows ``` huffman@23082 ` 362` ``` "((z + h) ^ n - z ^ n) / h - of_nat n * z ^ (n - Suc 0) = ``` huffman@20860 ` 363` ``` h * (\p=0..< n - Suc 0. \q=0..< n - Suc 0 - p. ``` huffman@23082 ` 364` ``` (z + h) ^ q * z ^ (n - 2 - q))" (is "?lhs = ?rhs") ``` huffman@23082 ` 365` ```apply (subgoal_tac "h * ?lhs = h * ?rhs", simp add: h) ``` huffman@20860 ` 366` ```apply (simp add: right_diff_distrib diff_divide_distrib h) ``` paulson@15077 ` 367` ```apply (simp add: mult_assoc [symmetric]) ``` huffman@20860 ` 368` ```apply (cases "n", simp) ``` huffman@20860 ` 369` ```apply (simp add: lemma_realpow_diff_sumr2 h ``` huffman@20860 ` 370` ``` right_diff_distrib [symmetric] mult_assoc ``` huffman@23082 ` 371` ``` del: realpow_Suc setsum_op_ivl_Suc of_nat_Suc) ``` huffman@20860 ` 372` ```apply (subst lemma_realpow_rev_sumr) ``` huffman@23082 ` 373` ```apply (subst sumr_diff_mult_const2) ``` huffman@20860 ` 374` ```apply simp ``` huffman@20860 ` 375` ```apply (simp only: lemma_termdiff1 setsum_right_distrib) ``` huffman@20860 ` 376` ```apply (rule setsum_cong [OF refl]) ``` nipkow@15539 ` 377` ```apply (simp add: diff_minus [symmetric] less_iff_Suc_add) ``` huffman@20860 ` 378` ```apply (clarify) ``` huffman@20860 ` 379` ```apply (simp add: setsum_right_distrib lemma_realpow_diff_sumr2 mult_ac ``` huffman@20860 ` 380` ``` del: setsum_op_ivl_Suc realpow_Suc) ``` huffman@20860 ` 381` ```apply (subst mult_assoc [symmetric], subst power_add [symmetric]) ``` huffman@20860 ` 382` ```apply (simp add: mult_ac) ``` huffman@20860 ` 383` ```done ``` huffman@20860 ` 384` huffman@20860 ` 385` ```lemma real_setsum_nat_ivl_bounded2: ``` huffman@23082 ` 386` ``` fixes K :: "'a::ordered_semidom" ``` huffman@23082 ` 387` ``` assumes f: "\p::nat. p < n \ f p \ K" ``` huffman@23082 ` 388` ``` assumes K: "0 \ K" ``` huffman@23082 ` 389` ``` shows "setsum f {0.. of_nat n * K" ``` huffman@23082 ` 390` ```apply (rule order_trans [OF setsum_mono]) ``` huffman@23082 ` 391` ```apply (rule f, simp) ``` huffman@23082 ` 392` ```apply (simp add: mult_right_mono K) ``` paulson@15077 ` 393` ```done ``` paulson@15077 ` 394` paulson@15229 ` 395` ```lemma lemma_termdiff3: ``` huffman@23112 ` 396` ``` fixes h z :: "'a::{real_normed_field,recpower}" ``` huffman@20860 ` 397` ``` assumes 1: "h \ 0" ``` huffman@23082 ` 398` ``` assumes 2: "norm z \ K" ``` huffman@23082 ` 399` ``` assumes 3: "norm (z + h) \ K" ``` huffman@23082 ` 400` ``` shows "norm (((z + h) ^ n - z ^ n) / h - of_nat n * z ^ (n - Suc 0)) ``` huffman@23082 ` 401` ``` \ of_nat n * of_nat (n - Suc 0) * K ^ (n - 2) * norm h" ``` huffman@20860 ` 402` ```proof - ``` huffman@23082 ` 403` ``` have "norm (((z + h) ^ n - z ^ n) / h - of_nat n * z ^ (n - Suc 0)) = ``` huffman@23082 ` 404` ``` norm (\p = 0..q = 0.. \ of_nat n * (of_nat (n - Suc 0) * K ^ (n - 2)) * norm h" ``` huffman@23082 ` 411` ``` proof (rule mult_right_mono [OF _ norm_ge_zero]) ``` huffman@23082 ` 412` ``` from norm_ge_zero 2 have K: "0 \ K" by (rule order_trans) ``` huffman@23082 ` 413` ``` have le_Kn: "\i j n. i + j = n \ norm ((z + h) ^ i * z ^ j) \ K ^ n" ``` huffman@20860 ` 414` ``` apply (erule subst) ``` huffman@23082 ` 415` ``` apply (simp only: norm_mult norm_power power_add) ``` huffman@23082 ` 416` ``` apply (intro mult_mono power_mono 2 3 norm_ge_zero zero_le_power K) ``` huffman@20860 ` 417` ``` done ``` huffman@23082 ` 418` ``` show "norm (\p = 0..q = 0.. of_nat n * (of_nat (n - Suc 0) * K ^ (n - 2))" ``` huffman@20860 ` 421` ``` apply (intro ``` huffman@23082 ` 422` ``` order_trans [OF norm_setsum] ``` huffman@20860 ` 423` ``` real_setsum_nat_ivl_bounded2 ``` huffman@20860 ` 424` ``` mult_nonneg_nonneg ``` huffman@23082 ` 425` ``` zero_le_imp_of_nat ``` huffman@20860 ` 426` ``` zero_le_power K) ``` huffman@20860 ` 427` ``` apply (rule le_Kn, simp) ``` huffman@20860 ` 428` ``` done ``` huffman@20860 ` 429` ``` qed ``` huffman@23082 ` 430` ``` also have "\ = of_nat n * of_nat (n - Suc 0) * K ^ (n - 2) * norm h" ``` huffman@20860 ` 431` ``` by (simp only: mult_assoc) ``` huffman@20860 ` 432` ``` finally show ?thesis . ``` huffman@20860 ` 433` ```qed ``` paulson@15077 ` 434` huffman@20860 ` 435` ```lemma lemma_termdiff4: ``` huffman@23112 ` 436` ``` fixes f :: "'a::{real_normed_field,recpower} \ ``` huffman@23082 ` 437` ``` 'b::real_normed_vector" ``` huffman@20860 ` 438` ``` assumes k: "0 < (k::real)" ``` huffman@23082 ` 439` ``` assumes le: "\h. \h \ 0; norm h < k\ \ norm (f h) \ K * norm h" ``` huffman@20860 ` 440` ``` shows "f -- 0 --> 0" ``` huffman@29163 ` 441` ```unfolding LIM_def diff_0_right ``` huffman@29163 ` 442` ```proof (safe) ``` huffman@29163 ` 443` ``` let ?h = "of_real (k / 2)::'a" ``` huffman@29163 ` 444` ``` have "?h \ 0" and "norm ?h < k" using k by simp_all ``` huffman@29163 ` 445` ``` hence "norm (f ?h) \ K * norm ?h" by (rule le) ``` huffman@29163 ` 446` ``` hence "0 \ K * norm ?h" by (rule order_trans [OF norm_ge_zero]) ``` huffman@29163 ` 447` ``` hence zero_le_K: "0 \ K" using k by (simp add: zero_le_mult_iff) ``` huffman@29163 ` 448` huffman@20860 ` 449` ``` fix r::real assume r: "0 < r" ``` huffman@23082 ` 450` ``` show "\s. 0 < s \ (\x. x \ 0 \ norm x < s \ norm (f x) < r)" ``` huffman@20860 ` 451` ``` proof (cases) ``` huffman@20860 ` 452` ``` assume "K = 0" ``` huffman@23082 ` 453` ``` with k r le have "0 < k \ (\x. x \ 0 \ norm x < k \ norm (f x) < r)" ``` huffman@20860 ` 454` ``` by simp ``` huffman@23082 ` 455` ``` thus "\s. 0 < s \ (\x. x \ 0 \ norm x < s \ norm (f x) < r)" .. ``` huffman@20860 ` 456` ``` next ``` huffman@20860 ` 457` ``` assume K_neq_zero: "K \ 0" ``` huffman@20860 ` 458` ``` with zero_le_K have K: "0 < K" by simp ``` huffman@23082 ` 459` ``` show "\s. 0 < s \ (\x. x \ 0 \ norm x < s \ norm (f x) < r)" ``` huffman@20860 ` 460` ``` proof (rule exI, safe) ``` huffman@20860 ` 461` ``` from k r K show "0 < min k (r * inverse K / 2)" ``` huffman@20860 ` 462` ``` by (simp add: mult_pos_pos positive_imp_inverse_positive) ``` huffman@20860 ` 463` ``` next ``` huffman@23082 ` 464` ``` fix x::'a ``` huffman@23082 ` 465` ``` assume x1: "x \ 0" and x2: "norm x < min k (r * inverse K / 2)" ``` huffman@23082 ` 466` ``` from x2 have x3: "norm x < k" and x4: "norm x < r * inverse K / 2" ``` huffman@20860 ` 467` ``` by simp_all ``` huffman@23082 ` 468` ``` from x1 x3 le have "norm (f x) \ K * norm x" by simp ``` huffman@23082 ` 469` ``` also from x4 K have "K * norm x < K * (r * inverse K / 2)" ``` huffman@20860 ` 470` ``` by (rule mult_strict_left_mono) ``` huffman@20860 ` 471` ``` also have "\ = r / 2" ``` huffman@20860 ` 472` ``` using K_neq_zero by simp ``` huffman@20860 ` 473` ``` also have "r / 2 < r" ``` huffman@20860 ` 474` ``` using r by simp ``` huffman@23082 ` 475` ``` finally show "norm (f x) < r" . ``` huffman@20860 ` 476` ``` qed ``` huffman@20860 ` 477` ``` qed ``` huffman@20860 ` 478` ```qed ``` paulson@15077 ` 479` paulson@15229 ` 480` ```lemma lemma_termdiff5: ``` huffman@23112 ` 481` ``` fixes g :: "'a::{recpower,real_normed_field} \ ``` huffman@23082 ` 482` ``` nat \ 'b::banach" ``` huffman@20860 ` 483` ``` assumes k: "0 < (k::real)" ``` huffman@20860 ` 484` ``` assumes f: "summable f" ``` huffman@23082 ` 485` ``` assumes le: "\h n. \h \ 0; norm h < k\ \ norm (g h n) \ f n * norm h" ``` huffman@20860 ` 486` ``` shows "(\h. suminf (g h)) -- 0 --> 0" ``` huffman@20860 ` 487` ```proof (rule lemma_termdiff4 [OF k]) ``` huffman@23082 ` 488` ``` fix h::'a assume "h \ 0" and "norm h < k" ``` huffman@23082 ` 489` ``` hence A: "\n. norm (g h n) \ f n * norm h" ``` huffman@20860 ` 490` ``` by (simp add: le) ``` huffman@23082 ` 491` ``` hence "\N. \n\N. norm (norm (g h n)) \ f n * norm h" ``` huffman@20860 ` 492` ``` by simp ``` huffman@23082 ` 493` ``` moreover from f have B: "summable (\n. f n * norm h)" ``` huffman@20860 ` 494` ``` by (rule summable_mult2) ``` huffman@23082 ` 495` ``` ultimately have C: "summable (\n. norm (g h n))" ``` huffman@20860 ` 496` ``` by (rule summable_comparison_test) ``` huffman@23082 ` 497` ``` hence "norm (suminf (g h)) \ (\n. norm (g h n))" ``` huffman@23082 ` 498` ``` by (rule summable_norm) ``` huffman@23082 ` 499` ``` also from A C B have "(\n. norm (g h n)) \ (\n. f n * norm h)" ``` huffman@20860 ` 500` ``` by (rule summable_le) ``` huffman@23082 ` 501` ``` also from f have "(\n. f n * norm h) = suminf f * norm h" ``` huffman@20860 ` 502` ``` by (rule suminf_mult2 [symmetric]) ``` huffman@23082 ` 503` ``` finally show "norm (suminf (g h)) \ suminf f * norm h" . ``` huffman@20860 ` 504` ```qed ``` paulson@15077 ` 505` paulson@15077 ` 506` paulson@15077 ` 507` ```text{* FIXME: Long proofs*} ``` paulson@15077 ` 508` paulson@15077 ` 509` ```lemma termdiffs_aux: ``` huffman@23112 ` 510` ``` fixes x :: "'a::{recpower,real_normed_field,banach}" ``` huffman@20849 ` 511` ``` assumes 1: "summable (\n. diffs (diffs c) n * K ^ n)" ``` huffman@23082 ` 512` ``` assumes 2: "norm x < norm K" ``` huffman@20860 ` 513` ``` shows "(\h. \n. c n * (((x + h) ^ n - x ^ n) / h ``` huffman@23082 ` 514` ``` - of_nat n * x ^ (n - Suc 0))) -- 0 --> 0" ``` huffman@20849 ` 515` ```proof - ``` huffman@20860 ` 516` ``` from dense [OF 2] ``` huffman@23082 ` 517` ``` obtain r where r1: "norm x < r" and r2: "r < norm K" by fast ``` huffman@23082 ` 518` ``` from norm_ge_zero r1 have r: "0 < r" ``` huffman@20860 ` 519` ``` by (rule order_le_less_trans) ``` huffman@20860 ` 520` ``` hence r_neq_0: "r \ 0" by simp ``` huffman@20860 ` 521` ``` show ?thesis ``` huffman@20849 ` 522` ``` proof (rule lemma_termdiff5) ``` huffman@23082 ` 523` ``` show "0 < r - norm x" using r1 by simp ``` huffman@20849 ` 524` ``` next ``` huffman@23082 ` 525` ``` from r r2 have "norm (of_real r::'a) < norm K" ``` huffman@23082 ` 526` ``` by simp ``` huffman@23082 ` 527` ``` with 1 have "summable (\n. norm (diffs (diffs c) n * (of_real r ^ n)))" ``` huffman@20860 ` 528` ``` by (rule powser_insidea) ``` huffman@23082 ` 529` ``` hence "summable (\n. diffs (diffs (\n. norm (c n))) n * r ^ n)" ``` huffman@23082 ` 530` ``` using r ``` huffman@23082 ` 531` ``` by (simp add: diffs_def norm_mult norm_power del: of_nat_Suc) ``` huffman@23082 ` 532` ``` hence "summable (\n. of_nat n * diffs (\n. norm (c n)) n * r ^ (n - Suc 0))" ``` huffman@20860 ` 533` ``` by (rule diffs_equiv [THEN sums_summable]) ``` huffman@23082 ` 534` ``` also have "(\n. of_nat n * diffs (\n. norm (c n)) n * r ^ (n - Suc 0)) ``` huffman@23082 ` 535` ``` = (\n. diffs (%m. of_nat (m - Suc 0) * norm (c m) * inverse r) n * (r ^ n))" ``` huffman@20849 ` 536` ``` apply (rule ext) ``` huffman@20849 ` 537` ``` apply (simp add: diffs_def) ``` huffman@20849 ` 538` ``` apply (case_tac n, simp_all add: r_neq_0) ``` huffman@20849 ` 539` ``` done ``` huffman@20860 ` 540` ``` finally have "summable ``` huffman@23082 ` 541` ``` (\n. of_nat n * (of_nat (n - Suc 0) * norm (c n) * inverse r) * r ^ (n - Suc 0))" ``` huffman@20860 ` 542` ``` by (rule diffs_equiv [THEN sums_summable]) ``` huffman@20860 ` 543` ``` also have ``` huffman@23082 ` 544` ``` "(\n. of_nat n * (of_nat (n - Suc 0) * norm (c n) * inverse r) * ``` huffman@20860 ` 545` ``` r ^ (n - Suc 0)) = ``` huffman@23082 ` 546` ``` (\n. norm (c n) * of_nat n * of_nat (n - Suc 0) * r ^ (n - 2))" ``` huffman@20849 ` 547` ``` apply (rule ext) ``` huffman@20849 ` 548` ``` apply (case_tac "n", simp) ``` huffman@20849 ` 549` ``` apply (case_tac "nat", simp) ``` huffman@20849 ` 550` ``` apply (simp add: r_neq_0) ``` huffman@20849 ` 551` ``` done ``` huffman@20860 ` 552` ``` finally show ``` huffman@23082 ` 553` ``` "summable (\n. norm (c n) * of_nat n * of_nat (n - Suc 0) * r ^ (n - 2))" . ``` huffman@20849 ` 554` ``` next ``` huffman@23082 ` 555` ``` fix h::'a and n::nat ``` huffman@20860 ` 556` ``` assume h: "h \ 0" ``` huffman@23082 ` 557` ``` assume "norm h < r - norm x" ``` huffman@23082 ` 558` ``` hence "norm x + norm h < r" by simp ``` huffman@23082 ` 559` ``` with norm_triangle_ineq have xh: "norm (x + h) < r" ``` huffman@20860 ` 560` ``` by (rule order_le_less_trans) ``` huffman@23082 ` 561` ``` show "norm (c n * (((x + h) ^ n - x ^ n) / h - of_nat n * x ^ (n - Suc 0))) ``` huffman@23082 ` 562` ``` \ norm (c n) * of_nat n * of_nat (n - Suc 0) * r ^ (n - 2) * norm h" ``` huffman@23082 ` 563` ``` apply (simp only: norm_mult mult_assoc) ``` huffman@23082 ` 564` ``` apply (rule mult_left_mono [OF _ norm_ge_zero]) ``` huffman@20860 ` 565` ``` apply (simp (no_asm) add: mult_assoc [symmetric]) ``` huffman@20860 ` 566` ``` apply (rule lemma_termdiff3) ``` huffman@20860 ` 567` ``` apply (rule h) ``` huffman@20860 ` 568` ``` apply (rule r1 [THEN order_less_imp_le]) ``` huffman@20860 ` 569` ``` apply (rule xh [THEN order_less_imp_le]) ``` huffman@20860 ` 570` ``` done ``` huffman@20849 ` 571` ``` qed ``` huffman@20849 ` 572` ```qed ``` webertj@20217 ` 573` huffman@20860 ` 574` ```lemma termdiffs: ``` huffman@23112 ` 575` ``` fixes K x :: "'a::{recpower,real_normed_field,banach}" ``` huffman@20860 ` 576` ``` assumes 1: "summable (\n. c n * K ^ n)" ``` huffman@20860 ` 577` ``` assumes 2: "summable (\n. (diffs c) n * K ^ n)" ``` huffman@20860 ` 578` ``` assumes 3: "summable (\n. (diffs (diffs c)) n * K ^ n)" ``` huffman@23082 ` 579` ``` assumes 4: "norm x < norm K" ``` huffman@20860 ` 580` ``` shows "DERIV (\x. \n. c n * x ^ n) x :> (\n. (diffs c) n * x ^ n)" ``` huffman@29163 ` 581` ```unfolding deriv_def ``` huffman@29163 ` 582` ```proof (rule LIM_zero_cancel) ``` huffman@20860 ` 583` ``` show "(\h. (suminf (\n. c n * (x + h) ^ n) - suminf (\n. c n * x ^ n)) / h ``` huffman@20860 ` 584` ``` - suminf (\n. diffs c n * x ^ n)) -- 0 --> 0" ``` huffman@20860 ` 585` ``` proof (rule LIM_equal2) ``` huffman@29163 ` 586` ``` show "0 < norm K - norm x" using 4 by (simp add: less_diff_eq) ``` huffman@20860 ` 587` ``` next ``` huffman@23082 ` 588` ``` fix h :: 'a ``` huffman@20860 ` 589` ``` assume "h \ 0" ``` huffman@23082 ` 590` ``` assume "norm (h - 0) < norm K - norm x" ``` huffman@23082 ` 591` ``` hence "norm x + norm h < norm K" by simp ``` huffman@23082 ` 592` ``` hence 5: "norm (x + h) < norm K" ``` huffman@23082 ` 593` ``` by (rule norm_triangle_ineq [THEN order_le_less_trans]) ``` huffman@20860 ` 594` ``` have A: "summable (\n. c n * x ^ n)" ``` huffman@20860 ` 595` ``` by (rule powser_inside [OF 1 4]) ``` huffman@20860 ` 596` ``` have B: "summable (\n. c n * (x + h) ^ n)" ``` huffman@20860 ` 597` ``` by (rule powser_inside [OF 1 5]) ``` huffman@20860 ` 598` ``` have C: "summable (\n. diffs c n * x ^ n)" ``` huffman@20860 ` 599` ``` by (rule powser_inside [OF 2 4]) ``` huffman@20860 ` 600` ``` show "((\n. c n * (x + h) ^ n) - (\n. c n * x ^ n)) / h ``` huffman@20860 ` 601` ``` - (\n. diffs c n * x ^ n) = ``` huffman@23082 ` 602` ``` (\n. c n * (((x + h) ^ n - x ^ n) / h - of_nat n * x ^ (n - Suc 0)))" ``` huffman@20860 ` 603` ``` apply (subst sums_unique [OF diffs_equiv [OF C]]) ``` huffman@20860 ` 604` ``` apply (subst suminf_diff [OF B A]) ``` huffman@20860 ` 605` ``` apply (subst suminf_divide [symmetric]) ``` huffman@20860 ` 606` ``` apply (rule summable_diff [OF B A]) ``` huffman@20860 ` 607` ``` apply (subst suminf_diff) ``` huffman@20860 ` 608` ``` apply (rule summable_divide) ``` huffman@20860 ` 609` ``` apply (rule summable_diff [OF B A]) ``` huffman@20860 ` 610` ``` apply (rule sums_summable [OF diffs_equiv [OF C]]) ``` huffman@29163 ` 611` ``` apply (rule arg_cong [where f="suminf"], rule ext) ``` nipkow@29667 ` 612` ``` apply (simp add: algebra_simps) ``` huffman@20860 ` 613` ``` done ``` huffman@20860 ` 614` ``` next ``` huffman@20860 ` 615` ``` show "(\h. \n. c n * (((x + h) ^ n - x ^ n) / h - ``` huffman@23082 ` 616` ``` of_nat n * x ^ (n - Suc 0))) -- 0 --> 0" ``` huffman@20860 ` 617` ``` by (rule termdiffs_aux [OF 3 4]) ``` huffman@20860 ` 618` ``` qed ``` huffman@20860 ` 619` ```qed ``` huffman@20860 ` 620` paulson@15077 ` 621` chaieb@29695 ` 622` ```subsection{* Some properties of factorials *} ``` chaieb@29695 ` 623` chaieb@29695 ` 624` ```lemma real_of_nat_fact_not_zero [simp]: "real (fact n) \ 0" ``` chaieb@29695 ` 625` ```by auto ``` chaieb@29695 ` 626` chaieb@29695 ` 627` ```lemma real_of_nat_fact_gt_zero [simp]: "0 < real(fact n)" ``` chaieb@29695 ` 628` ```by auto ``` chaieb@29695 ` 629` chaieb@29695 ` 630` ```lemma real_of_nat_fact_ge_zero [simp]: "0 \ real(fact n)" ``` chaieb@29695 ` 631` ```by simp ``` chaieb@29695 ` 632` chaieb@29695 ` 633` ```lemma inv_real_of_nat_fact_gt_zero [simp]: "0 < inverse (real (fact n))" ``` chaieb@29695 ` 634` ```by (auto simp add: positive_imp_inverse_positive) ``` chaieb@29695 ` 635` chaieb@29695 ` 636` ```lemma inv_real_of_nat_fact_ge_zero [simp]: "0 \ inverse (real (fact n))" ``` chaieb@29695 ` 637` ```by (auto intro: order_less_imp_le) ``` chaieb@29695 ` 638` hoelzl@29803 ` 639` ```subsection {* Derivability of power series *} ``` hoelzl@29803 ` 640` hoelzl@29803 ` 641` ```lemma DERIV_series': fixes f :: "real \ nat \ real" ``` hoelzl@29803 ` 642` ``` assumes DERIV_f: "\ n. DERIV (\ x. f x n) x0 :> (f' x0 n)" ``` hoelzl@29803 ` 643` ``` and allf_summable: "\ x. x \ {a <..< b} \ summable (f x)" and x0_in_I: "x0 \ {a <..< b}" ``` hoelzl@29803 ` 644` ``` and "summable (f' x0)" ``` hoelzl@29803 ` 645` ``` and "summable L" and L_def: "\ n x y. \ x \ { a <..< b} ; y \ { a <..< b} \ \ \ f x n - f y n \ \ L n * \ x - y \" ``` hoelzl@29803 ` 646` ``` shows "DERIV (\ x. suminf (f x)) x0 :> (suminf (f' x0))" ``` hoelzl@29803 ` 647` ``` unfolding deriv_def ``` hoelzl@29803 ` 648` ```proof (rule LIM_I) ``` hoelzl@29803 ` 649` ``` fix r :: real assume "0 < r" hence "0 < r/3" by auto ``` hoelzl@29803 ` 650` hoelzl@29803 ` 651` ``` obtain N_L where N_L: "\ n. N_L \ n \ \ \ i. L (i + n) \ < r/3" ``` hoelzl@29803 ` 652` ``` using suminf_exist_split[OF `0 < r/3` `summable L`] by auto ``` hoelzl@29803 ` 653` hoelzl@29803 ` 654` ``` obtain N_f' where N_f': "\ n. N_f' \ n \ \ \ i. f' x0 (i + n) \ < r/3" ``` hoelzl@29803 ` 655` ``` using suminf_exist_split[OF `0 < r/3` `summable (f' x0)`] by auto ``` hoelzl@29803 ` 656` hoelzl@29803 ` 657` ``` let ?N = "Suc (max N_L N_f')" ``` hoelzl@29803 ` 658` ``` have "\ \ i. f' x0 (i + ?N) \ < r/3" (is "?f'_part < r/3") and ``` hoelzl@29803 ` 659` ``` L_estimate: "\ \ i. L (i + ?N) \ < r/3" using N_L[of "?N"] and N_f' [of "?N"] by auto ``` hoelzl@29803 ` 660` hoelzl@29803 ` 661` ``` let "?diff i x" = "(f (x0 + x) i - f x0 i) / x" ``` hoelzl@29803 ` 662` hoelzl@29803 ` 663` ``` let ?r = "r / (3 * real ?N)" ``` hoelzl@29803 ` 664` ``` have "0 < 3 * real ?N" by auto ``` hoelzl@29803 ` 665` ``` from divide_pos_pos[OF `0 < r` this] ``` hoelzl@29803 ` 666` ``` have "0 < ?r" . ``` hoelzl@29803 ` 667` hoelzl@29803 ` 668` ``` let "?s n" = "SOME s. 0 < s \ (\ x. x \ 0 \ \ x \ < s \ \ ?diff n x - f' x0 n \ < ?r)" ``` hoelzl@29803 ` 669` ``` def S' \ "Min (?s ` { 0 ..< ?N })" ``` hoelzl@29803 ` 670` hoelzl@29803 ` 671` ``` have "0 < S'" unfolding S'_def ``` hoelzl@29803 ` 672` ``` proof (rule iffD2[OF Min_gr_iff]) ``` hoelzl@29803 ` 673` ``` show "\ x \ (?s ` { 0 ..< ?N }). 0 < x" ``` hoelzl@29803 ` 674` ``` proof (rule ballI) ``` hoelzl@29803 ` 675` ``` fix x assume "x \ ?s ` {0.. {0.. (\x. x \ 0 \ \x\ < s \ \?diff n x - f' x0 n\ < ?r)" by auto ``` hoelzl@29803 ` 679` ``` have "0 < ?s n" by (rule someI2[where a=s], auto simp add: s_bound) ``` hoelzl@29803 ` 680` ``` thus "0 < x" unfolding `x = ?s n` . ``` hoelzl@29803 ` 681` ``` qed ``` hoelzl@29803 ` 682` ``` qed auto ``` hoelzl@29803 ` 683` hoelzl@29803 ` 684` ``` def S \ "min (min (x0 - a) (b - x0)) S'" ``` hoelzl@29803 ` 685` ``` hence "0 < S" and S_a: "S \ x0 - a" and S_b: "S \ b - x0" and "S \ S'" using x0_in_I and `0 < S'` ``` hoelzl@29803 ` 686` ``` by auto ``` hoelzl@29803 ` 687` hoelzl@29803 ` 688` ``` { fix x assume "x \ 0" and "\ x \ < S" ``` hoelzl@29803 ` 689` ``` hence x_in_I: "x0 + x \ { a <..< b }" using S_a S_b by auto ``` hoelzl@29803 ` 690` ``` ``` hoelzl@29803 ` 691` ``` note diff_smbl = summable_diff[OF allf_summable[OF x_in_I] allf_summable[OF x0_in_I]] ``` hoelzl@29803 ` 692` ``` note div_smbl = summable_divide[OF diff_smbl] ``` hoelzl@29803 ` 693` ``` note all_smbl = summable_diff[OF div_smbl `summable (f' x0)`] ``` hoelzl@29803 ` 694` ``` note ign = summable_ignore_initial_segment[where k="?N"] ``` hoelzl@29803 ` 695` ``` note diff_shft_smbl = summable_diff[OF ign[OF allf_summable[OF x_in_I]] ign[OF allf_summable[OF x0_in_I]]] ``` hoelzl@29803 ` 696` ``` note div_shft_smbl = summable_divide[OF diff_shft_smbl] ``` hoelzl@29803 ` 697` ``` note all_shft_smbl = summable_diff[OF div_smbl ign[OF `summable (f' x0)`]] ``` hoelzl@29803 ` 698` hoelzl@29803 ` 699` ``` { fix n ``` hoelzl@29803 ` 700` ``` have "\ ?diff (n + ?N) x \ \ L (n + ?N) * \ (x0 + x) - x0 \ / \ x \" ``` hoelzl@29803 ` 701` ``` using divide_right_mono[OF L_def[OF x_in_I x0_in_I] abs_ge_zero] unfolding abs_divide . ``` hoelzl@29803 ` 702` ``` hence "\ ( \ ?diff (n + ?N) x \) \ \ L (n + ?N)" using `x \ 0` by auto ``` hoelzl@29803 ` 703` ``` } note L_ge = summable_le2[OF allI[OF this] ign[OF `summable L`]] ``` hoelzl@29803 ` 704` ``` from order_trans[OF summable_rabs[OF conjunct1[OF L_ge]] L_ge[THEN conjunct2]] ``` hoelzl@29803 ` 705` ``` have "\ \ i. ?diff (i + ?N) x \ \ (\ i. L (i + ?N))" . ``` hoelzl@29803 ` 706` ``` hence "\ \ i. ?diff (i + ?N) x \ \ r / 3" (is "?L_part \ r/3") using L_estimate by auto ``` hoelzl@29803 ` 707` hoelzl@29803 ` 708` ``` have "\\n \ { 0 ..< ?N}. ?diff n x - f' x0 n \ \ (\n \ { 0 ..< ?N}. \?diff n x - f' x0 n \)" .. ``` hoelzl@29803 ` 709` ``` also have "\ < (\n \ { 0 ..< ?N}. ?r)" ``` hoelzl@29803 ` 710` ``` proof (rule setsum_strict_mono) ``` hoelzl@29803 ` 711` ``` fix n assume "n \ { 0 ..< ?N}" ``` hoelzl@29803 ` 712` ``` have "\ x \ < S" using `\ x \ < S` . ``` hoelzl@29803 ` 713` ``` also have "S \ S'" using `S \ S'` . ``` hoelzl@29803 ` 714` ``` also have "S' \ ?s n" unfolding S'_def ``` hoelzl@29803 ` 715` ``` proof (rule Min_le_iff[THEN iffD2]) ``` hoelzl@29803 ` 716` ``` have "?s n \ (?s ` {0.. ?s n \ ?s n" using `n \ { 0 ..< ?N}` by auto ``` hoelzl@29803 ` 717` ``` thus "\ a \ (?s ` {0.. ?s n" by blast ``` hoelzl@29803 ` 718` ``` qed auto ``` hoelzl@29803 ` 719` ``` finally have "\ x \ < ?s n" . ``` hoelzl@29803 ` 720` hoelzl@29803 ` 721` ``` from DERIV_D[OF DERIV_f[where n=n], THEN LIM_D, OF `0 < ?r`, unfolded real_norm_def diff_0_right, unfolded some_eq_ex[symmetric], THEN conjunct2] ``` hoelzl@29803 ` 722` ``` have "\x. x \ 0 \ \x\ < ?s n \ \?diff n x - f' x0 n\ < ?r" . ``` hoelzl@29803 ` 723` ``` with `x \ 0` and `\x\ < ?s n` ``` hoelzl@29803 ` 724` ``` show "\?diff n x - f' x0 n\ < ?r" by blast ``` hoelzl@29803 ` 725` ``` qed auto ``` hoelzl@29803 ` 726` ``` also have "\ = of_nat (card {0 ..< ?N}) * ?r" by (rule setsum_constant) ``` hoelzl@29803 ` 727` ``` also have "\ = real ?N * ?r" unfolding real_eq_of_nat by auto ``` hoelzl@29803 ` 728` ``` also have "\ = r/3" by auto ``` hoelzl@29803 ` 729` ``` finally have "\\n \ { 0 ..< ?N}. ?diff n x - f' x0 n \ < r / 3" (is "?diff_part < r / 3") . ``` hoelzl@29803 ` 730` hoelzl@29803 ` 731` ``` from suminf_diff[OF allf_summable[OF x_in_I] allf_summable[OF x0_in_I]] ``` hoelzl@29803 ` 732` ``` have "\ (suminf (f (x0 + x)) - (suminf (f x0))) / x - suminf (f' x0) \ = ``` hoelzl@29803 ` 733` ``` \ \n. ?diff n x - f' x0 n \" unfolding suminf_diff[OF div_smbl `summable (f' x0)`, symmetric] using suminf_divide[OF diff_smbl, symmetric] by auto ``` hoelzl@29803 ` 734` ``` also have "\ \ ?diff_part + \ (\n. ?diff (n + ?N) x) - (\ n. f' x0 (n + ?N)) \" unfolding suminf_split_initial_segment[OF all_smbl, where k="?N"] unfolding suminf_diff[OF div_shft_smbl ign[OF `summable (f' x0)`]] by (rule abs_triangle_ineq) ``` hoelzl@29803 ` 735` ``` also have "\ \ ?diff_part + ?L_part + ?f'_part" using abs_triangle_ineq4 by auto ``` hoelzl@29803 ` 736` ``` also have "\ < r /3 + r/3 + r/3" ``` hoelzl@29803 ` 737` ``` using `?diff_part < r/3` `?L_part \ r/3` and `?f'_part < r/3` by auto ``` hoelzl@29803 ` 738` ``` finally have "\ (suminf (f (x0 + x)) - (suminf (f x0))) / x - suminf (f' x0) \ < r" ``` hoelzl@29803 ` 739` ``` by auto ``` hoelzl@29803 ` 740` ``` } thus "\ s > 0. \ x. x \ 0 \ norm (x - 0) < s \ ``` hoelzl@29803 ` 741` ``` norm (((\n. f (x0 + x) n) - (\n. f x0 n)) / x - (\n. f' x0 n)) < r" using `0 < S` ``` hoelzl@29803 ` 742` ``` unfolding real_norm_def diff_0_right by blast ``` hoelzl@29803 ` 743` ```qed ``` hoelzl@29803 ` 744` hoelzl@29803 ` 745` ```lemma DERIV_power_series': fixes f :: "nat \ real" ``` hoelzl@29803 ` 746` ``` assumes converges: "\ x. x \ {-R <..< R} \ summable (\ n. f n * real (Suc n) * x^n)" ``` hoelzl@29803 ` 747` ``` and x0_in_I: "x0 \ {-R <..< R}" and "0 < R" ``` hoelzl@29803 ` 748` ``` shows "DERIV (\ x. (\ n. f n * x^(Suc n))) x0 :> (\ n. f n * real (Suc n) * x0^n)" ``` hoelzl@29803 ` 749` ``` (is "DERIV (\ x. (suminf (?f x))) x0 :> (suminf (?f' x0))") ``` hoelzl@29803 ` 750` ```proof - ``` hoelzl@29803 ` 751` ``` { fix R' assume "0 < R'" and "R' < R" and "-R' < x0" and "x0 < R'" ``` hoelzl@29803 ` 752` ``` hence "x0 \ {-R' <..< R'}" and "R' \ {-R <..< R}" and "x0 \ {-R <..< R}" by auto ``` hoelzl@29803 ` 753` ``` have "DERIV (\ x. (suminf (?f x))) x0 :> (suminf (?f' x0))" ``` hoelzl@29803 ` 754` ``` proof (rule DERIV_series') ``` hoelzl@29803 ` 755` ``` show "summable (\ n. \f n * real (Suc n) * R'^n\)" ``` hoelzl@29803 ` 756` ``` proof - ``` hoelzl@29803 ` 757` ``` have "(R' + R) / 2 < R" and "0 < (R' + R) / 2" using `0 < R'` `0 < R` `R' < R` by auto ``` hoelzl@29803 ` 758` ``` hence in_Rball: "(R' + R) / 2 \ {-R <..< R}" using `R' < R` by auto ``` hoelzl@29803 ` 759` ``` have "norm R' < norm ((R' + R) / 2)" using `0 < R'` `0 < R` `R' < R` by auto ``` hoelzl@29803 ` 760` ``` from powser_insidea[OF converges[OF in_Rball] this] show ?thesis by auto ``` hoelzl@29803 ` 761` ``` qed ``` hoelzl@29803 ` 762` ``` { fix n x y assume "x \ {-R' <..< R'}" and "y \ {-R' <..< R'}" ``` hoelzl@29803 ` 763` ``` show "\?f x n - ?f y n\ \ \f n * real (Suc n) * R'^n\ * \x-y\" ``` hoelzl@29803 ` 764` ``` proof - ``` hoelzl@29803 ` 765` ``` have "\f n * x ^ (Suc n) - f n * y ^ (Suc n)\ = (\f n\ * \x-y\) * \\p = 0.." ``` hoelzl@29803 ` 766` ``` unfolding right_diff_distrib[symmetric] lemma_realpow_diff_sumr2 abs_mult by auto ``` hoelzl@29803 ` 767` ``` also have "\ \ (\f n\ * \x-y\) * (\real (Suc n)\ * \R' ^ n\)" ``` hoelzl@29803 ` 768` ``` proof (rule mult_left_mono) ``` hoelzl@29803 ` 769` ``` have "\\p = 0.. \ (\p = 0..x ^ p * y ^ (n - p)\)" by (rule setsum_abs) ``` hoelzl@29803 ` 770` ``` also have "\ \ (\p = 0.. {0.. n" by auto ``` hoelzl@29803 ` 773` ``` { fix n fix x :: real assume "x \ {-R'<..x\ \ R'" by auto ``` hoelzl@29803 ` 775` ``` hence "\x^n\ \ R'^n" unfolding power_abs by (rule power_mono, auto) ``` hoelzl@29803 ` 776` ``` } from mult_mono[OF this[OF `x \ {-R'<.. {-R'<..x^p * y^(n-p)\ \ R'^p * R'^(n-p)" unfolding abs_mult by auto ``` hoelzl@29803 ` 778` ``` thus "\x^p * y^(n-p)\ \ R'^n" unfolding power_add[symmetric] using `p \ n` by auto ``` hoelzl@29803 ` 779` ``` qed ``` hoelzl@29803 ` 780` ``` also have "\ = real (Suc n) * R' ^ n" unfolding setsum_constant card_atLeastLessThan real_of_nat_def by auto ``` hoelzl@29803 ` 781` ``` finally show "\\p = 0.. \ \real (Suc n)\ * \R' ^ n\" unfolding abs_real_of_nat_cancel abs_of_nonneg[OF zero_le_power[OF less_imp_le[OF `0 < R'`]]] . ``` hoelzl@29803 ` 782` ``` show "0 \ \f n\ * \x - y\" unfolding abs_mult[symmetric] by auto ``` hoelzl@29803 ` 783` ``` qed ``` hoelzl@29803 ` 784` ``` also have "\ = \f n * real (Suc n) * R' ^ n\ * \x - y\" unfolding abs_mult real_mult_assoc[symmetric] by algebra ``` hoelzl@29803 ` 785` ``` finally show ?thesis . ``` hoelzl@29803 ` 786` ``` qed } ``` hoelzl@29803 ` 787` ``` { fix n ``` hoelzl@29803 ` 788` ``` from DERIV_pow[of "Suc n" x0, THEN DERIV_cmult[where c="f n"]] ``` hoelzl@29803 ` 789` ``` show "DERIV (\ x. ?f x n) x0 :> (?f' x0 n)" unfolding real_mult_assoc by auto } ``` hoelzl@29803 ` 790` ``` { fix x assume "x \ {-R' <..< R'}" hence "R' \ {-R <..< R}" and "norm x < norm R'" using assms `R' < R` by auto ``` hoelzl@29803 ` 791` ``` have "summable (\ n. f n * x^n)" ``` hoelzl@29803 ` 792` ``` proof (rule summable_le2[THEN conjunct1, OF _ powser_insidea[OF converges[OF `R' \ {-R <..< R}`] `norm x < norm R'`]], rule allI) ``` hoelzl@29803 ` 793` ``` fix n ``` hoelzl@29803 ` 794` ``` have le: "\f n\ * 1 \ \f n\ * real (Suc n)" by (rule mult_left_mono, auto) ``` hoelzl@29803 ` 795` ``` show "\f n * x ^ n\ \ norm (f n * real (Suc n) * x ^ n)" unfolding real_norm_def abs_mult ``` hoelzl@29803 ` 796` ``` by (rule mult_right_mono, auto simp add: le[unfolded mult_1_right]) ``` hoelzl@29803 ` 797` ``` qed ``` hoelzl@29803 ` 798` ``` from this[THEN summable_mult2[where c=x], unfolded real_mult_assoc, unfolded real_mult_commute] ``` hoelzl@29803 ` 799` ``` show "summable (?f x)" by auto } ``` hoelzl@29803 ` 800` ``` show "summable (?f' x0)" using converges[OF `x0 \ {-R <..< R}`] . ``` hoelzl@29803 ` 801` ``` show "x0 \ {-R' <..< R'}" using `x0 \ {-R' <..< R'}` . ``` hoelzl@29803 ` 802` ``` qed ``` hoelzl@29803 ` 803` ``` } note for_subinterval = this ``` hoelzl@29803 ` 804` ``` let ?R = "(R + \x0\) / 2" ``` hoelzl@29803 ` 805` ``` have "\x0\ < ?R" using assms by auto ``` hoelzl@29803 ` 806` ``` hence "- ?R < x0" ``` hoelzl@29803 ` 807` ``` proof (cases "x0 < 0") ``` hoelzl@29803 ` 808` ``` case True ``` hoelzl@29803 ` 809` ``` hence "- x0 < ?R" using `\x0\ < ?R` by auto ``` hoelzl@29803 ` 810` ``` thus ?thesis unfolding neg_less_iff_less[symmetric, of "- x0"] by auto ``` hoelzl@29803 ` 811` ``` next ``` hoelzl@29803 ` 812` ``` case False ``` hoelzl@29803 ` 813` ``` have "- ?R < 0" using assms by auto ``` hoelzl@29803 ` 814` ``` also have "\ \ x0" using False by auto ``` hoelzl@29803 ` 815` ``` finally show ?thesis . ``` hoelzl@29803 ` 816` ``` qed ``` hoelzl@29803 ` 817` ``` hence "0 < ?R" "?R < R" "- ?R < x0" and "x0 < ?R" using assms by auto ``` hoelzl@29803 ` 818` ``` from for_subinterval[OF this] ``` hoelzl@29803 ` 819` ``` show ?thesis . ``` hoelzl@29803 ` 820` ```qed ``` chaieb@29695 ` 821` huffman@29164 ` 822` ```subsection {* Exponential Function *} ``` huffman@23043 ` 823` huffman@23043 ` 824` ```definition ``` huffman@23115 ` 825` ``` exp :: "'a \ 'a::{recpower,real_normed_field,banach}" where ``` haftmann@25062 ` 826` ``` "exp x = (\n. x ^ n /\<^sub>R real (fact n))" ``` huffman@23043 ` 827` huffman@23115 ` 828` ```lemma summable_exp_generic: ``` huffman@23115 ` 829` ``` fixes x :: "'a::{real_normed_algebra_1,recpower,banach}" ``` haftmann@25062 ` 830` ``` defines S_def: "S \ \n. x ^ n /\<^sub>R real (fact n)" ``` huffman@23115 ` 831` ``` shows "summable S" ``` huffman@23115 ` 832` ```proof - ``` haftmann@25062 ` 833` ``` have S_Suc: "\n. S (Suc n) = (x * S n) /\<^sub>R real (Suc n)" ``` huffman@23115 ` 834` ``` unfolding S_def by (simp add: power_Suc del: mult_Suc) ``` huffman@23115 ` 835` ``` obtain r :: real where r0: "0 < r" and r1: "r < 1" ``` huffman@23115 ` 836` ``` using dense [OF zero_less_one] by fast ``` huffman@23115 ` 837` ``` obtain N :: nat where N: "norm x < real N * r" ``` huffman@23115 ` 838` ``` using reals_Archimedean3 [OF r0] by fast ``` huffman@23115 ` 839` ``` from r1 show ?thesis ``` huffman@23115 ` 840` ``` proof (rule ratio_test [rule_format]) ``` huffman@23115 ` 841` ``` fix n :: nat ``` huffman@23115 ` 842` ``` assume n: "N \ n" ``` huffman@23115 ` 843` ``` have "norm x \ real N * r" ``` huffman@23115 ` 844` ``` using N by (rule order_less_imp_le) ``` huffman@23115 ` 845` ``` also have "real N * r \ real (Suc n) * r" ``` huffman@23115 ` 846` ``` using r0 n by (simp add: mult_right_mono) ``` huffman@23115 ` 847` ``` finally have "norm x * norm (S n) \ real (Suc n) * r * norm (S n)" ``` huffman@23115 ` 848` ``` using norm_ge_zero by (rule mult_right_mono) ``` huffman@23115 ` 849` ``` hence "norm (x * S n) \ real (Suc n) * r * norm (S n)" ``` huffman@23115 ` 850` ``` by (rule order_trans [OF norm_mult_ineq]) ``` huffman@23115 ` 851` ``` hence "norm (x * S n) / real (Suc n) \ r * norm (S n)" ``` huffman@23115 ` 852` ``` by (simp add: pos_divide_le_eq mult_ac) ``` huffman@23115 ` 853` ``` thus "norm (S (Suc n)) \ r * norm (S n)" ``` huffman@23115 ` 854` ``` by (simp add: S_Suc norm_scaleR inverse_eq_divide) ``` huffman@23115 ` 855` ``` qed ``` huffman@23115 ` 856` ```qed ``` huffman@23115 ` 857` huffman@23115 ` 858` ```lemma summable_norm_exp: ``` huffman@23115 ` 859` ``` fixes x :: "'a::{real_normed_algebra_1,recpower,banach}" ``` haftmann@25062 ` 860` ``` shows "summable (\n. norm (x ^ n /\<^sub>R real (fact n)))" ``` huffman@23115 ` 861` ```proof (rule summable_norm_comparison_test [OF exI, rule_format]) ``` haftmann@25062 ` 862` ``` show "summable (\n. norm x ^ n /\<^sub>R real (fact n))" ``` huffman@23115 ` 863` ``` by (rule summable_exp_generic) ``` huffman@23115 ` 864` ```next ``` haftmann@25062 ` 865` ``` fix n show "norm (x ^ n /\<^sub>R real (fact n)) \ norm x ^ n /\<^sub>R real (fact n)" ``` huffman@23115 ` 866` ``` by (simp add: norm_scaleR norm_power_ineq) ``` huffman@23115 ` 867` ```qed ``` huffman@23115 ` 868` huffman@23043 ` 869` ```lemma summable_exp: "summable (%n. inverse (real (fact n)) * x ^ n)" ``` huffman@23115 ` 870` ```by (insert summable_exp_generic [where x=x], simp) ``` huffman@23043 ` 871` haftmann@25062 ` 872` ```lemma exp_converges: "(\n. x ^ n /\<^sub>R real (fact n)) sums exp x" ``` huffman@23115 ` 873` ```unfolding exp_def by (rule summable_exp_generic [THEN summable_sums]) ``` huffman@23043 ` 874` huffman@23043 ` 875` paulson@15077 ` 876` ```lemma exp_fdiffs: ``` paulson@15077 ` 877` ``` "diffs (%n. inverse(real (fact n))) = (%n. inverse(real (fact n)))" ``` huffman@23431 ` 878` ```by (simp add: diffs_def mult_assoc [symmetric] real_of_nat_def of_nat_mult ``` huffman@23082 ` 879` ``` del: mult_Suc of_nat_Suc) ``` paulson@15077 ` 880` huffman@23115 ` 881` ```lemma diffs_of_real: "diffs (\n. of_real (f n)) = (\n. of_real (diffs f n))" ``` huffman@23115 ` 882` ```by (simp add: diffs_def) ``` huffman@23115 ` 883` haftmann@25062 ` 884` ```lemma lemma_exp_ext: "exp = (\x. \n. x ^ n /\<^sub>R real (fact n))" ``` paulson@15077 ` 885` ```by (auto intro!: ext simp add: exp_def) ``` paulson@15077 ` 886` paulson@15077 ` 887` ```lemma DERIV_exp [simp]: "DERIV exp x :> exp(x)" ``` paulson@15229 ` 888` ```apply (simp add: exp_def) ``` paulson@15077 ` 889` ```apply (subst lemma_exp_ext) ``` huffman@23115 ` 890` ```apply (subgoal_tac "DERIV (\u. \n. of_real (inverse (real (fact n))) * u ^ n) x :> (\n. diffs (\n. of_real (inverse (real (fact n)))) n * x ^ n)") ``` huffman@23115 ` 891` ```apply (rule_tac [2] K = "of_real (1 + norm x)" in termdiffs) ``` huffman@23115 ` 892` ```apply (simp_all only: diffs_of_real scaleR_conv_of_real exp_fdiffs) ``` huffman@23115 ` 893` ```apply (rule exp_converges [THEN sums_summable, unfolded scaleR_conv_of_real])+ ``` huffman@23115 ` 894` ```apply (simp del: of_real_add) ``` paulson@15077 ` 895` ```done ``` paulson@15077 ` 896` huffman@23045 ` 897` ```lemma isCont_exp [simp]: "isCont exp x" ``` huffman@23045 ` 898` ```by (rule DERIV_exp [THEN DERIV_isCont]) ``` huffman@23045 ` 899` huffman@23045 ` 900` huffman@29167 ` 901` ```subsubsection {* Properties of the Exponential Function *} ``` paulson@15077 ` 902` huffman@23278 ` 903` ```lemma powser_zero: ``` huffman@23278 ` 904` ``` fixes f :: "nat \ 'a::{real_normed_algebra_1,recpower}" ``` huffman@23278 ` 905` ``` shows "(\n. f n * 0 ^ n) = f 0" ``` paulson@15077 ` 906` ```proof - ``` huffman@23278 ` 907` ``` have "(\n = 0..<1. f n * 0 ^ n) = (\n. f n * 0 ^ n)" ``` huffman@23115 ` 908` ``` by (rule sums_unique [OF series_zero], simp add: power_0_left) ``` huffman@30082 ` 909` ``` thus ?thesis unfolding One_nat_def by simp ``` paulson@15077 ` 910` ```qed ``` paulson@15077 ` 911` huffman@23278 ` 912` ```lemma exp_zero [simp]: "exp 0 = 1" ``` huffman@23278 ` 913` ```unfolding exp_def by (simp add: scaleR_conv_of_real powser_zero) ``` huffman@23278 ` 914` huffman@23115 ` 915` ```lemma setsum_cl_ivl_Suc2: ``` huffman@23115 ` 916` ``` "(\i=m..Suc n. f i) = (if Suc n < m then 0 else f m + (\i=m..n. f (Suc i)))" ``` nipkow@28069 ` 917` ```by (simp add: setsum_head_Suc setsum_shift_bounds_cl_Suc_ivl ``` huffman@23115 ` 918` ``` del: setsum_cl_ivl_Suc) ``` huffman@23115 ` 919` huffman@23115 ` 920` ```lemma exp_series_add: ``` huffman@23115 ` 921` ``` fixes x y :: "'a::{real_field,recpower}" ``` haftmann@25062 ` 922` ``` defines S_def: "S \ \x n. x ^ n /\<^sub>R real (fact n)" ``` huffman@23115 ` 923` ``` shows "S (x + y) n = (\i=0..n. S x i * S y (n - i))" ``` huffman@23115 ` 924` ```proof (induct n) ``` huffman@23115 ` 925` ``` case 0 ``` huffman@23115 ` 926` ``` show ?case ``` huffman@23115 ` 927` ``` unfolding S_def by simp ``` huffman@23115 ` 928` ```next ``` huffman@23115 ` 929` ``` case (Suc n) ``` haftmann@25062 ` 930` ``` have S_Suc: "\x n. S x (Suc n) = (x * S x n) /\<^sub>R real (Suc n)" ``` huffman@23115 ` 931` ``` unfolding S_def by (simp add: power_Suc del: mult_Suc) ``` haftmann@25062 ` 932` ``` hence times_S: "\x n. x * S x n = real (Suc n) *\<^sub>R S x (Suc n)" ``` huffman@23115 ` 933` ``` by simp ``` huffman@23115 ` 934` haftmann@25062 ` 935` ``` have "real (Suc n) *\<^sub>R S (x + y) (Suc n) = (x + y) * S (x + y) n" ``` huffman@23115 ` 936` ``` by (simp only: times_S) ``` huffman@23115 ` 937` ``` also have "\ = (x + y) * (\i=0..n. S x i * S y (n-i))" ``` huffman@23115 ` 938` ``` by (simp only: Suc) ``` huffman@23115 ` 939` ``` also have "\ = x * (\i=0..n. S x i * S y (n-i)) ``` huffman@23115 ` 940` ``` + y * (\i=0..n. S x i * S y (n-i))" ``` huffman@23115 ` 941` ``` by (rule left_distrib) ``` huffman@23115 ` 942` ``` also have "\ = (\i=0..n. (x * S x i) * S y (n-i)) ``` huffman@23115 ` 943` ``` + (\i=0..n. S x i * (y * S y (n-i)))" ``` huffman@23115 ` 944` ``` by (simp only: setsum_right_distrib mult_ac) ``` haftmann@25062 ` 945` ``` also have "\ = (\i=0..n. real (Suc i) *\<^sub>R (S x (Suc i) * S y (n-i))) ``` haftmann@25062 ` 946` ``` + (\i=0..n. real (Suc n-i) *\<^sub>R (S x i * S y (Suc n-i)))" ``` huffman@23115 ` 947` ``` by (simp add: times_S Suc_diff_le) ``` haftmann@25062 ` 948` ``` also have "(\i=0..n. real (Suc i) *\<^sub>R (S x (Suc i) * S y (n-i))) = ``` haftmann@25062 ` 949` ``` (\i=0..Suc n. real i *\<^sub>R (S x i * S y (Suc n-i)))" ``` huffman@23115 ` 950` ``` by (subst setsum_cl_ivl_Suc2, simp) ``` haftmann@25062 ` 951` ``` also have "(\i=0..n. real (Suc n-i) *\<^sub>R (S x i * S y (Suc n-i))) = ``` haftmann@25062 ` 952` ``` (\i=0..Suc n. real (Suc n-i) *\<^sub>R (S x i * S y (Suc n-i)))" ``` huffman@23115 ` 953` ``` by (subst setsum_cl_ivl_Suc, simp) ``` haftmann@25062 ` 954` ``` also have "(\i=0..Suc n. real i *\<^sub>R (S x i * S y (Suc n-i))) + ``` haftmann@25062 ` 955` ``` (\i=0..Suc n. real (Suc n-i) *\<^sub>R (S x i * S y (Suc n-i))) = ``` haftmann@25062 ` 956` ``` (\i=0..Suc n. real (Suc n) *\<^sub>R (S x i * S y (Suc n-i)))" ``` huffman@23115 ` 957` ``` by (simp only: setsum_addf [symmetric] scaleR_left_distrib [symmetric] ``` huffman@23115 ` 958` ``` real_of_nat_add [symmetric], simp) ``` haftmann@25062 ` 959` ``` also have "\ = real (Suc n) *\<^sub>R (\i=0..Suc n. S x i * S y (Suc n-i))" ``` huffman@23127 ` 960` ``` by (simp only: scaleR_right.setsum) ``` huffman@23115 ` 961` ``` finally show ``` huffman@23115 ` 962` ``` "S (x + y) (Suc n) = (\i=0..Suc n. S x i * S y (Suc n - i))" ``` huffman@23115 ` 963` ``` by (simp add: scaleR_cancel_left del: setsum_cl_ivl_Suc) ``` huffman@23115 ` 964` ```qed ``` huffman@23115 ` 965` huffman@23115 ` 966` ```lemma exp_add: "exp (x + y) = exp x * exp y" ``` huffman@23115 ` 967` ```unfolding exp_def ``` huffman@23115 ` 968` ```by (simp only: Cauchy_product summable_norm_exp exp_series_add) ``` huffman@23115 ` 969` huffman@29170 ` 970` ```lemma mult_exp_exp: "exp x * exp y = exp (x + y)" ``` huffman@29170 ` 971` ```by (rule exp_add [symmetric]) ``` huffman@29170 ` 972` huffman@23241 ` 973` ```lemma exp_of_real: "exp (of_real x) = of_real (exp x)" ``` huffman@23241 ` 974` ```unfolding exp_def ``` huffman@23241 ` 975` ```apply (subst of_real.suminf) ``` huffman@23241 ` 976` ```apply (rule summable_exp_generic) ``` huffman@23241 ` 977` ```apply (simp add: scaleR_conv_of_real) ``` huffman@23241 ` 978` ```done ``` huffman@23241 ` 979` huffman@29170 ` 980` ```lemma exp_not_eq_zero [simp]: "exp x \ 0" ``` huffman@29170 ` 981` ```proof ``` huffman@29170 ` 982` ``` have "exp x * exp (- x) = 1" by (simp add: mult_exp_exp) ``` huffman@29170 ` 983` ``` also assume "exp x = 0" ``` huffman@29170 ` 984` ``` finally show "False" by simp ``` paulson@15077 ` 985` ```qed ``` paulson@15077 ` 986` huffman@29170 ` 987` ```lemma exp_minus: "exp (- x) = inverse (exp x)" ``` huffman@29170 ` 988` ```by (rule inverse_unique [symmetric], simp add: mult_exp_exp) ``` paulson@15077 ` 989` huffman@29170 ` 990` ```lemma exp_diff: "exp (x - y) = exp x / exp y" ``` huffman@29170 ` 991` ``` unfolding diff_minus divide_inverse ``` huffman@29170 ` 992` ``` by (simp add: exp_add exp_minus) ``` paulson@15077 ` 993` huffman@29167 ` 994` huffman@29167 ` 995` ```subsubsection {* Properties of the Exponential Function on Reals *} ``` huffman@29167 ` 996` huffman@29170 ` 997` ```text {* Comparisons of @{term "exp x"} with zero. *} ``` huffman@29167 ` 998` huffman@29167 ` 999` ```text{*Proof: because every exponential can be seen as a square.*} ``` huffman@29167 ` 1000` ```lemma exp_ge_zero [simp]: "0 \ exp (x::real)" ``` huffman@29167 ` 1001` ```proof - ``` huffman@29167 ` 1002` ``` have "0 \ exp (x/2) * exp (x/2)" by simp ``` huffman@29167 ` 1003` ``` thus ?thesis by (simp add: exp_add [symmetric]) ``` huffman@29167 ` 1004` ```qed ``` huffman@29167 ` 1005` huffman@23115 ` 1006` ```lemma exp_gt_zero [simp]: "0 < exp (x::real)" ``` paulson@15077 ` 1007` ```by (simp add: order_less_le) ``` paulson@15077 ` 1008` huffman@29170 ` 1009` ```lemma not_exp_less_zero [simp]: "\ exp (x::real) < 0" ``` huffman@29170 ` 1010` ```by (simp add: not_less) ``` huffman@29170 ` 1011` huffman@29170 ` 1012` ```lemma not_exp_le_zero [simp]: "\ exp (x::real) \ 0" ``` huffman@29170 ` 1013` ```by (simp add: not_le) ``` paulson@15077 ` 1014` huffman@23115 ` 1015` ```lemma abs_exp_cancel [simp]: "\exp x::real\ = exp x" ``` huffman@29165 ` 1016` ```by simp ``` paulson@15077 ` 1017` paulson@15077 ` 1018` ```lemma exp_real_of_nat_mult: "exp(real n * x) = exp(x) ^ n" ``` paulson@15251 ` 1019` ```apply (induct "n") ``` paulson@15077 ` 1020` ```apply (auto simp add: real_of_nat_Suc right_distrib exp_add mult_commute) ``` paulson@15077 ` 1021` ```done ``` paulson@15077 ` 1022` huffman@29170 ` 1023` ```text {* Strict monotonicity of exponential. *} ``` huffman@29170 ` 1024` huffman@29170 ` 1025` ```lemma exp_ge_add_one_self_aux: "0 \ (x::real) ==> (1 + x) \ exp(x)" ``` huffman@29170 ` 1026` ```apply (drule order_le_imp_less_or_eq, auto) ``` huffman@29170 ` 1027` ```apply (simp add: exp_def) ``` huffman@29170 ` 1028` ```apply (rule real_le_trans) ``` huffman@29170 ` 1029` ```apply (rule_tac [2] n = 2 and f = "(%n. inverse (real (fact n)) * x ^ n)" in series_pos_le) ``` huffman@29170 ` 1030` ```apply (auto intro: summable_exp simp add: numeral_2_eq_2 zero_le_mult_iff) ``` huffman@29170 ` 1031` ```done ``` huffman@29170 ` 1032` huffman@29170 ` 1033` ```lemma exp_gt_one: "0 < (x::real) \ 1 < exp x" ``` huffman@29170 ` 1034` ```proof - ``` huffman@29170 ` 1035` ``` assume x: "0 < x" ``` huffman@29170 ` 1036` ``` hence "1 < 1 + x" by simp ``` huffman@29170 ` 1037` ``` also from x have "1 + x \ exp x" ``` huffman@29170 ` 1038` ``` by (simp add: exp_ge_add_one_self_aux) ``` huffman@29170 ` 1039` ``` finally show ?thesis . ``` huffman@29170 ` 1040` ```qed ``` huffman@29170 ` 1041` paulson@15077 ` 1042` ```lemma exp_less_mono: ``` huffman@23115 ` 1043` ``` fixes x y :: real ``` huffman@29165 ` 1044` ``` assumes "x < y" shows "exp x < exp y" ``` paulson@15077 ` 1045` ```proof - ``` huffman@29165 ` 1046` ``` from `x < y` have "0 < y - x" by simp ``` huffman@29165 ` 1047` ``` hence "1 < exp (y - x)" by (rule exp_gt_one) ``` huffman@29165 ` 1048` ``` hence "1 < exp y / exp x" by (simp only: exp_diff) ``` huffman@29165 ` 1049` ``` thus "exp x < exp y" by simp ``` paulson@15077 ` 1050` ```qed ``` paulson@15077 ` 1051` huffman@23115 ` 1052` ```lemma exp_less_cancel: "exp (x::real) < exp y ==> x < y" ``` huffman@29170 ` 1053` ```apply (simp add: linorder_not_le [symmetric]) ``` huffman@29170 ` 1054` ```apply (auto simp add: order_le_less exp_less_mono) ``` paulson@15077 ` 1055` ```done ``` paulson@15077 ` 1056` huffman@29170 ` 1057` ```lemma exp_less_cancel_iff [iff]: "exp (x::real) < exp y \ x < y" ``` paulson@15077 ` 1058` ```by (auto intro: exp_less_mono exp_less_cancel) ``` paulson@15077 ` 1059` huffman@29170 ` 1060` ```lemma exp_le_cancel_iff [iff]: "exp (x::real) \ exp y \ x \ y" ``` paulson@15077 ` 1061` ```by (auto simp add: linorder_not_less [symmetric]) ``` paulson@15077 ` 1062` huffman@29170 ` 1063` ```lemma exp_inj_iff [iff]: "exp (x::real) = exp y \ x = y" ``` paulson@15077 ` 1064` ```by (simp add: order_eq_iff) ``` paulson@15077 ` 1065` huffman@29170 ` 1066` ```text {* Comparisons of @{term "exp x"} with one. *} ``` huffman@29170 ` 1067` huffman@29170 ` 1068` ```lemma one_less_exp_iff [simp]: "1 < exp (x::real) \ 0 < x" ``` huffman@29170 ` 1069` ``` using exp_less_cancel_iff [where x=0 and y=x] by simp ``` huffman@29170 ` 1070` huffman@29170 ` 1071` ```lemma exp_less_one_iff [simp]: "exp (x::real) < 1 \ x < 0" ``` huffman@29170 ` 1072` ``` using exp_less_cancel_iff [where x=x and y=0] by simp ``` huffman@29170 ` 1073` huffman@29170 ` 1074` ```lemma one_le_exp_iff [simp]: "1 \ exp (x::real) \ 0 \ x" ``` huffman@29170 ` 1075` ``` using exp_le_cancel_iff [where x=0 and y=x] by simp ``` huffman@29170 ` 1076` huffman@29170 ` 1077` ```lemma exp_le_one_iff [simp]: "exp (x::real) \ 1 \ x \ 0" ``` huffman@29170 ` 1078` ``` using exp_le_cancel_iff [where x=x and y=0] by simp ``` huffman@29170 ` 1079` huffman@29170 ` 1080` ```lemma exp_eq_one_iff [simp]: "exp (x::real) = 1 \ x = 0" ``` huffman@29170 ` 1081` ``` using exp_inj_iff [where x=x and y=0] by simp ``` huffman@29170 ` 1082` huffman@23115 ` 1083` ```lemma lemma_exp_total: "1 \ y ==> \x. 0 \ x & x \ y - 1 & exp(x::real) = y" ``` paulson@15077 ` 1084` ```apply (rule IVT) ``` huffman@23045 ` 1085` ```apply (auto intro: isCont_exp simp add: le_diff_eq) ``` paulson@15077 ` 1086` ```apply (subgoal_tac "1 + (y - 1) \ exp (y - 1)") ``` huffman@29165 ` 1087` ```apply simp ``` avigad@17014 ` 1088` ```apply (rule exp_ge_add_one_self_aux, simp) ``` paulson@15077 ` 1089` ```done ``` paulson@15077 ` 1090` huffman@23115 ` 1091` ```lemma exp_total: "0 < (y::real) ==> \x. exp x = y" ``` paulson@15077 ` 1092` ```apply (rule_tac x = 1 and y = y in linorder_cases) ``` paulson@15077 ` 1093` ```apply (drule order_less_imp_le [THEN lemma_exp_total]) ``` paulson@15077 ` 1094` ```apply (rule_tac [2] x = 0 in exI) ``` paulson@15077 ` 1095` ```apply (frule_tac [3] real_inverse_gt_one) ``` paulson@15077 ` 1096` ```apply (drule_tac [4] order_less_imp_le [THEN lemma_exp_total], auto) ``` paulson@15077 ` 1097` ```apply (rule_tac x = "-x" in exI) ``` paulson@15077 ` 1098` ```apply (simp add: exp_minus) ``` paulson@15077 ` 1099` ```done ``` paulson@15077 ` 1100` paulson@15077 ` 1101` huffman@29164 ` 1102` ```subsection {* Natural Logarithm *} ``` paulson@15077 ` 1103` huffman@23043 ` 1104` ```definition ``` huffman@23043 ` 1105` ``` ln :: "real => real" where ``` huffman@23043 ` 1106` ``` "ln x = (THE u. exp u = x)" ``` huffman@23043 ` 1107` huffman@23043 ` 1108` ```lemma ln_exp [simp]: "ln (exp x) = x" ``` paulson@15077 ` 1109` ```by (simp add: ln_def) ``` paulson@15077 ` 1110` huffman@22654 ` 1111` ```lemma exp_ln [simp]: "0 < x \ exp (ln x) = x" ``` huffman@22654 ` 1112` ```by (auto dest: exp_total) ``` huffman@22654 ` 1113` huffman@29171 ` 1114` ```lemma exp_ln_iff [simp]: "exp (ln x) = x \ 0 < x" ``` huffman@29171 ` 1115` ```apply (rule iffI) ``` huffman@29171 ` 1116` ```apply (erule subst, rule exp_gt_zero) ``` huffman@29171 ` 1117` ```apply (erule exp_ln) ``` paulson@15077 ` 1118` ```done ``` paulson@15077 ` 1119` huffman@29171 ` 1120` ```lemma ln_unique: "exp y = x \ ln x = y" ``` huffman@29171 ` 1121` ```by (erule subst, rule ln_exp) ``` huffman@29171 ` 1122` huffman@29171 ` 1123` ```lemma ln_one [simp]: "ln 1 = 0" ``` huffman@29171 ` 1124` ```by (rule ln_unique, simp) ``` huffman@29171 ` 1125` huffman@29171 ` 1126` ```lemma ln_mult: "\0 < x; 0 < y\ \ ln (x * y) = ln x + ln y" ``` huffman@29171 ` 1127` ```by (rule ln_unique, simp add: exp_add) ``` huffman@29171 ` 1128` huffman@29171 ` 1129` ```lemma ln_inverse: "0 < x \ ln (inverse x) = - ln x" ``` huffman@29171 ` 1130` ```by (rule ln_unique, simp add: exp_minus) ``` huffman@29171 ` 1131` huffman@29171 ` 1132` ```lemma ln_div: "\0 < x; 0 < y\ \ ln (x / y) = ln x - ln y" ``` huffman@29171 ` 1133` ```by (rule ln_unique, simp add: exp_diff) ``` paulson@15077 ` 1134` huffman@29171 ` 1135` ```lemma ln_realpow: "0 < x \ ln (x ^ n) = real n * ln x" ``` huffman@29171 ` 1136` ```by (rule ln_unique, simp add: exp_real_of_nat_mult) ``` huffman@29171 ` 1137` huffman@29171 ` 1138` ```lemma ln_less_cancel_iff [simp]: "\0 < x; 0 < y\ \ ln x < ln y \ x < y" ``` huffman@29171 ` 1139` ```by (subst exp_less_cancel_iff [symmetric], simp) ``` huffman@29171 ` 1140` huffman@29171 ` 1141` ```lemma ln_le_cancel_iff [simp]: "\0 < x; 0 < y\ \ ln x \ ln y \ x \ y" ``` huffman@29171 ` 1142` ```by (simp add: linorder_not_less [symmetric]) ``` huffman@29171 ` 1143` huffman@29171 ` 1144` ```lemma ln_inj_iff [simp]: "\0 < x; 0 < y\ \ ln x = ln y \ x = y" ``` huffman@29171 ` 1145` ```by (simp add: order_eq_iff) ``` huffman@29171 ` 1146` huffman@29171 ` 1147` ```lemma ln_add_one_self_le_self [simp]: "0 \ x \ ln (1 + x) \ x" ``` huffman@29171 ` 1148` ```apply (rule exp_le_cancel_iff [THEN iffD1]) ``` huffman@29171 ` 1149` ```apply (simp add: exp_ge_add_one_self_aux) ``` paulson@15077 ` 1150` ```done ``` paulson@15077 ` 1151` huffman@29171 ` 1152` ```lemma ln_less_self [simp]: "0 < x \ ln x < x" ``` huffman@29171 ` 1153` ```by (rule order_less_le_trans [where y="ln (1 + x)"]) simp_all ``` paulson@15077 ` 1154` paulson@15234 ` 1155` ```lemma ln_ge_zero [simp]: ``` paulson@15077 ` 1156` ``` assumes x: "1 \ x" shows "0 \ ln x" ``` paulson@15077 ` 1157` ```proof - ``` paulson@15077 ` 1158` ``` have "0 < x" using x by arith ``` paulson@15077 ` 1159` ``` hence "exp 0 \ exp (ln x)" ``` huffman@22915 ` 1160` ``` by (simp add: x) ``` paulson@15077 ` 1161` ``` thus ?thesis by (simp only: exp_le_cancel_iff) ``` paulson@15077 ` 1162` ```qed ``` paulson@15077 ` 1163` paulson@15077 ` 1164` ```lemma ln_ge_zero_imp_ge_one: ``` paulson@15077 ` 1165` ``` assumes ln: "0 \ ln x" ``` paulson@15077 ` 1166` ``` and x: "0 < x" ``` paulson@15077 ` 1167` ``` shows "1 \ x" ``` paulson@15077 ` 1168` ```proof - ``` paulson@15077 ` 1169` ``` from ln have "ln 1 \ ln x" by simp ``` paulson@15077 ` 1170` ``` thus ?thesis by (simp add: x del: ln_one) ``` paulson@15077 ` 1171` ```qed ``` paulson@15077 ` 1172` paulson@15077 ` 1173` ```lemma ln_ge_zero_iff [simp]: "0 < x ==> (0 \ ln x) = (1 \ x)" ``` paulson@15077 ` 1174` ```by (blast intro: ln_ge_zero ln_ge_zero_imp_ge_one) ``` paulson@15077 ` 1175` paulson@15234 ` 1176` ```lemma ln_less_zero_iff [simp]: "0 < x ==> (ln x < 0) = (x < 1)" ``` paulson@15234 ` 1177` ```by (insert ln_ge_zero_iff [of x], arith) ``` paulson@15234 ` 1178` paulson@15077 ` 1179` ```lemma ln_gt_zero: ``` paulson@15077 ` 1180` ``` assumes x: "1 < x" shows "0 < ln x" ``` paulson@15077 ` 1181` ```proof - ``` paulson@15077 ` 1182` ``` have "0 < x" using x by arith ``` huffman@22915 ` 1183` ``` hence "exp 0 < exp (ln x)" by (simp add: x) ``` paulson@15077 ` 1184` ``` thus ?thesis by (simp only: exp_less_cancel_iff) ``` paulson@15077 ` 1185` ```qed ``` paulson@15077 ` 1186` paulson@15077 ` 1187` ```lemma ln_gt_zero_imp_gt_one: ``` paulson@15077 ` 1188` ``` assumes ln: "0 < ln x" ``` paulson@15077 ` 1189` ``` and x: "0 < x" ``` paulson@15077 ` 1190` ``` shows "1 < x" ``` paulson@15077 ` 1191` ```proof - ``` paulson@15077 ` 1192` ``` from ln have "ln 1 < ln x" by simp ``` paulson@15077 ` 1193` ``` thus ?thesis by (simp add: x del: ln_one) ``` paulson@15077 ` 1194` ```qed ``` paulson@15077 ` 1195` paulson@15077 ` 1196` ```lemma ln_gt_zero_iff [simp]: "0 < x ==> (0 < ln x) = (1 < x)" ``` paulson@15077 ` 1197` ```by (blast intro: ln_gt_zero ln_gt_zero_imp_gt_one) ``` paulson@15077 ` 1198` paulson@15234 ` 1199` ```lemma ln_eq_zero_iff [simp]: "0 < x ==> (ln x = 0) = (x = 1)" ``` paulson@15234 ` 1200` ```by (insert ln_less_zero_iff [of x] ln_gt_zero_iff [of x], arith) ``` paulson@15077 ` 1201` paulson@15077 ` 1202` ```lemma ln_less_zero: "[| 0 < x; x < 1 |] ==> ln x < 0" ``` paulson@15234 ` 1203` ```by simp ``` paulson@15077 ` 1204` paulson@15077 ` 1205` ```lemma exp_ln_eq: "exp u = x ==> ln x = u" ``` paulson@15077 ` 1206` ```by auto ``` paulson@15077 ` 1207` huffman@23045 ` 1208` ```lemma isCont_ln: "0 < x \ isCont ln x" ``` huffman@23045 ` 1209` ```apply (subgoal_tac "isCont ln (exp (ln x))", simp) ``` huffman@23045 ` 1210` ```apply (rule isCont_inverse_function [where f=exp], simp_all) ``` huffman@23045 ` 1211` ```done ``` huffman@23045 ` 1212` huffman@23045 ` 1213` ```lemma DERIV_ln: "0 < x \ DERIV ln x :> inverse x" ``` huffman@23045 ` 1214` ```apply (rule DERIV_inverse_function [where f=exp and a=0 and b="x+1"]) ``` huffman@23045 ` 1215` ```apply (erule lemma_DERIV_subst [OF DERIV_exp exp_ln]) ``` huffman@23045 ` 1216` ```apply (simp_all add: abs_if isCont_ln) ``` huffman@23045 ` 1217` ```done ``` huffman@23045 ` 1218` hoelzl@29803 ` 1219` ```lemma ln_series: assumes "0 < x" and "x < 2" ``` hoelzl@29803 ` 1220` ``` shows "ln x = (\ n. (-1)^n * (1 / real (n + 1)) * (x - 1)^(Suc n))" (is "ln x = suminf (?f (x - 1))") ``` hoelzl@29803 ` 1221` ```proof - ``` hoelzl@29803 ` 1222` ``` let "?f' x n" = "(-1)^n * (x - 1)^n" ``` hoelzl@29803 ` 1223` hoelzl@29803 ` 1224` ``` have "ln x - suminf (?f (x - 1)) = ln 1 - suminf (?f (1 - 1))" ``` hoelzl@29803 ` 1225` ``` proof (rule DERIV_isconst3[where x=x]) ``` hoelzl@29803 ` 1226` ``` fix x :: real assume "x \ {0 <..< 2}" hence "0 < x" and "x < 2" by auto ``` hoelzl@29803 ` 1227` ``` have "norm (1 - x) < 1" using `0 < x` and `x < 2` by auto ``` hoelzl@29803 ` 1228` ``` have "1 / x = 1 / (1 - (1 - x))" by auto ``` hoelzl@29803 ` 1229` ``` also have "\ = (\ n. (1 - x)^n)" using geometric_sums[OF `norm (1 - x) < 1`] by (rule sums_unique) ``` hoelzl@29803 ` 1230` ``` also have "\ = suminf (?f' x)" unfolding power_mult_distrib[symmetric] by (rule arg_cong[where f=suminf], rule arg_cong[where f="op ^"], auto) ``` hoelzl@29803 ` 1231` ``` finally have "DERIV ln x :> suminf (?f' x)" using DERIV_ln[OF `0 < x`] unfolding real_divide_def by auto ``` hoelzl@29803 ` 1232` ``` moreover ``` hoelzl@29803 ` 1233` ``` have repos: "\ h x :: real. h - 1 + x = h + x - 1" by auto ``` hoelzl@29803 ` 1234` ``` have "DERIV (\x. suminf (?f x)) (x - 1) :> (\n. (-1)^n * (1 / real (n + 1)) * real (Suc n) * (x - 1) ^ n)" ``` hoelzl@29803 ` 1235` ``` proof (rule DERIV_power_series') ``` hoelzl@29803 ` 1236` ``` show "x - 1 \ {- 1<..<1}" and "(0 :: real) < 1" using `0 < x` `x < 2` by auto ``` hoelzl@29803 ` 1237` ``` { fix x :: real assume "x \ {- 1<..<1}" hence "norm (-x) < 1" by auto ``` hoelzl@29803 ` 1238` ``` show "summable (\n. -1 ^ n * (1 / real (n + 1)) * real (Suc n) * x ^ n)" ``` huffman@30082 ` 1239` ``` unfolding One_nat_def ``` hoelzl@29803 ` 1240` ``` by (auto simp del: power_mult_distrib simp add: power_mult_distrib[symmetric] summable_geometric[OF `norm (-x) < 1`]) ``` hoelzl@29803 ` 1241` ``` } ``` hoelzl@29803 ` 1242` ``` qed ``` huffman@30082 ` 1243` ``` hence "DERIV (\x. suminf (?f x)) (x - 1) :> suminf (?f' x)" unfolding One_nat_def by auto ``` hoelzl@29803 ` 1244` ``` hence "DERIV (\x. suminf (?f (x - 1))) x :> suminf (?f' x)" unfolding DERIV_iff repos . ``` hoelzl@29803 ` 1245` ``` ultimately have "DERIV (\x. ln x - suminf (?f (x - 1))) x :> (suminf (?f' x) - suminf (?f' x))" ``` hoelzl@29803 ` 1246` ``` by (rule DERIV_diff) ``` hoelzl@29803 ` 1247` ``` thus "DERIV (\x. ln x - suminf (?f (x - 1))) x :> 0" by auto ``` hoelzl@29803 ` 1248` ``` qed (auto simp add: assms) ``` hoelzl@29803 ` 1249` ``` thus ?thesis by (auto simp add: suminf_zero) ``` hoelzl@29803 ` 1250` ```qed ``` paulson@15077 ` 1251` huffman@29164 ` 1252` ```subsection {* Sine and Cosine *} ``` huffman@29164 ` 1253` huffman@29164 ` 1254` ```definition ``` huffman@29164 ` 1255` ``` sin :: "real => real" where ``` huffman@29164 ` 1256` ``` "sin x = (\n. (if even(n) then 0 else ``` huffman@29164 ` 1257` ``` (-1 ^ ((n - Suc 0) div 2))/(real (fact n))) * x ^ n)" ``` huffman@29164 ` 1258` ``` ``` huffman@29164 ` 1259` ```definition ``` huffman@29164 ` 1260` ``` cos :: "real => real" where ``` huffman@29164 ` 1261` ``` "cos x = (\n. (if even(n) then (-1 ^ (n div 2))/(real (fact n)) ``` huffman@29164 ` 1262` ``` else 0) * x ^ n)" ``` huffman@29164 ` 1263` huffman@29164 ` 1264` ```lemma summable_sin: ``` huffman@29164 ` 1265` ``` "summable (%n. ``` huffman@29164 ` 1266` ``` (if even n then 0 ``` huffman@29164 ` 1267` ``` else -1 ^ ((n - Suc 0) div 2)/(real (fact n))) * ``` huffman@29164 ` 1268` ``` x ^ n)" ``` huffman@29164 ` 1269` ```apply (rule_tac g = "(%n. inverse (real (fact n)) * \x\ ^ n)" in summable_comparison_test) ``` huffman@29164 ` 1270` ```apply (rule_tac [2] summable_exp) ``` huffman@29164 ` 1271` ```apply (rule_tac x = 0 in exI) ``` huffman@29164 ` 1272` ```apply (auto simp add: divide_inverse abs_mult power_abs [symmetric] zero_le_mult_iff) ``` huffman@29164 ` 1273` ```done ``` huffman@29164 ` 1274` huffman@29164 ` 1275` ```lemma summable_cos: ``` huffman@29164 ` 1276` ``` "summable (%n. ``` huffman@29164 ` 1277` ``` (if even n then ``` huffman@29164 ` 1278` ``` -1 ^ (n div 2)/(real (fact n)) else 0) * x ^ n)" ``` huffman@29164 ` 1279` ```apply (rule_tac g = "(%n. inverse (real (fact n)) * \x\ ^ n)" in summable_comparison_test) ``` huffman@29164 ` 1280` ```apply (rule_tac [2] summable_exp) ``` huffman@29164 ` 1281` ```apply (rule_tac x = 0 in exI) ``` huffman@29164 ` 1282` ```apply (auto simp add: divide_inverse abs_mult power_abs [symmetric] zero_le_mult_iff) ``` huffman@29164 ` 1283` ```done ``` huffman@29164 ` 1284` huffman@29164 ` 1285` ```lemma lemma_STAR_sin: ``` huffman@29164 ` 1286` ``` "(if even n then 0 ``` huffman@29164 ` 1287` ``` else -1 ^ ((n - Suc 0) div 2)/(real (fact n))) * 0 ^ n = 0" ``` huffman@29164 ` 1288` ```by (induct "n", auto) ``` huffman@29164 ` 1289` huffman@29164 ` 1290` ```lemma lemma_STAR_cos: ``` huffman@29164 ` 1291` ``` "0 < n --> ``` huffman@29164 ` 1292` ``` -1 ^ (n div 2)/(real (fact n)) * 0 ^ n = 0" ``` huffman@29164 ` 1293` ```by (induct "n", auto) ``` huffman@29164 ` 1294` huffman@29164 ` 1295` ```lemma lemma_STAR_cos1: ``` huffman@29164 ` 1296` ``` "0 < n --> ``` huffman@29164 ` 1297` ``` (-1) ^ (n div 2)/(real (fact n)) * 0 ^ n = 0" ``` huffman@29164 ` 1298` ```by (induct "n", auto) ``` huffman@29164 ` 1299` huffman@29164 ` 1300` ```lemma lemma_STAR_cos2: ``` huffman@29164 ` 1301` ``` "(\n=1..n. - ((if even n then 0 ``` huffman@29164 ` 1358` ``` else -1 ^ ((n - Suc 0) div 2)/(real (fact n))) * x ^ n))" ``` huffman@29164 ` 1359` ```by (auto intro!: sums_unique sums_minus sin_converges) ``` huffman@29164 ` 1360` huffman@29164 ` 1361` ```lemma lemma_sin_ext: ``` huffman@29164 ` 1362` ``` "sin = (%x. \n. ``` huffman@29164 ` 1363` ``` (if even n then 0 ``` huffman@29164 ` 1364` ``` else -1 ^ ((n - Suc 0) div 2)/(real (fact n))) * ``` huffman@29164 ` 1365` ``` x ^ n)" ``` huffman@29164 ` 1366` ```by (auto intro!: ext simp add: sin_def) ``` huffman@29164 ` 1367` huffman@29164 ` 1368` ```lemma lemma_cos_ext: ``` huffman@29164 ` 1369` ``` "cos = (%x. \n. ``` huffman@29164 ` 1370` ``` (if even n then -1 ^ (n div 2)/(real (fact n)) else 0) * ``` huffman@29164 ` 1371` ``` x ^ n)" ``` huffman@29164 ` 1372` ```by (auto intro!: ext simp add: cos_def) ``` huffman@29164 ` 1373` huffman@29164 ` 1374` ```lemma DERIV_sin [simp]: "DERIV sin x :> cos(x)" ``` huffman@29164 ` 1375` ```apply (simp add: cos_def) ``` huffman@29164 ` 1376` ```apply (subst lemma_sin_ext) ``` huffman@29164 ` 1377` ```apply (auto simp add: sin_fdiffs2 [symmetric]) ``` huffman@29164 ` 1378` ```apply (rule_tac K = "1 + \x\" in termdiffs) ``` huffman@29164 ` 1379` ```apply (auto intro: sin_converges cos_converges sums_summable intro!: sums_minus [THEN sums_summable] simp add: cos_fdiffs sin_fdiffs) ``` huffman@29164 ` 1380` ```done ``` huffman@29164 ` 1381` huffman@29164 ` 1382` ```lemma DERIV_cos [simp]: "DERIV cos x :> -sin(x)" ``` huffman@29164 ` 1383` ```apply (subst lemma_cos_ext) ``` huffman@29164 ` 1384` ```apply (auto simp add: lemma_sin_minus cos_fdiffs2 [symmetric] minus_mult_left) ``` huffman@29164 ` 1385` ```apply (rule_tac K = "1 + \x\" in termdiffs) ``` huffman@29164 ` 1386` ```apply (auto intro: sin_converges cos_converges sums_summable intro!: sums_minus [THEN sums_summable] simp add: cos_fdiffs sin_fdiffs diffs_minus) ``` huffman@29164 ` 1387` ```done ``` huffman@29164 ` 1388` huffman@29164 ` 1389` ```lemma isCont_sin [simp]: "isCont sin x" ``` huffman@29164 ` 1390` ```by (rule DERIV_sin [THEN DERIV_isCont]) ``` huffman@29164 ` 1391` huffman@29164 ` 1392` ```lemma isCont_cos [simp]: "isCont cos x" ``` huffman@29164 ` 1393` ```by (rule DERIV_cos [THEN DERIV_isCont]) ``` huffman@29164 ` 1394` huffman@29164 ` 1395` huffman@29164 ` 1396` ```subsection {* Properties of Sine and Cosine *} ``` paulson@15077 ` 1397` paulson@15077 ` 1398` ```lemma sin_zero [simp]: "sin 0 = 0" ``` huffman@23278 ` 1399` ```unfolding sin_def by (simp add: powser_zero) ``` paulson@15077 ` 1400` paulson@15077 ` 1401` ```lemma cos_zero [simp]: "cos 0 = 1" ``` huffman@23278 ` 1402` ```unfolding cos_def by (simp add: powser_zero) ``` paulson@15077 ` 1403` paulson@15077 ` 1404` ```lemma DERIV_sin_sin_mult [simp]: ``` paulson@15077 ` 1405` ``` "DERIV (%x. sin(x)*sin(x)) x :> cos(x) * sin(x) + cos(x) * sin(x)" ``` paulson@15077 ` 1406` ```by (rule DERIV_mult, auto) ``` paulson@15077 ` 1407` paulson@15077 ` 1408` ```lemma DERIV_sin_sin_mult2 [simp]: ``` paulson@15077 ` 1409` ``` "DERIV (%x. sin(x)*sin(x)) x :> 2 * cos(x) * sin(x)" ``` paulson@15077 ` 1410` ```apply (cut_tac x = x in DERIV_sin_sin_mult) ``` paulson@15077 ` 1411` ```apply (auto simp add: mult_assoc) ``` paulson@15077 ` 1412` ```done ``` paulson@15077 ` 1413` paulson@15077 ` 1414` ```lemma DERIV_sin_realpow2 [simp]: ``` paulson@15077 ` 1415` ``` "DERIV (%x. (sin x)\) x :> cos(x) * sin(x) + cos(x) * sin(x)" ``` paulson@15077 ` 1416` ```by (auto simp add: numeral_2_eq_2 real_mult_assoc [symmetric]) ``` paulson@15077 ` 1417` paulson@15077 ` 1418` ```lemma DERIV_sin_realpow2a [simp]: ``` paulson@15077 ` 1419` ``` "DERIV (%x. (sin x)\) x :> 2 * cos(x) * sin(x)" ``` paulson@15077 ` 1420` ```by (auto simp add: numeral_2_eq_2) ``` paulson@15077 ` 1421` paulson@15077 ` 1422` ```lemma DERIV_cos_cos_mult [simp]: ``` paulson@15077 ` 1423` ``` "DERIV (%x. cos(x)*cos(x)) x :> -sin(x) * cos(x) + -sin(x) * cos(x)" ``` paulson@15077 ` 1424` ```by (rule DERIV_mult, auto) ``` paulson@15077 ` 1425` paulson@15077 ` 1426` ```lemma DERIV_cos_cos_mult2 [simp]: ``` paulson@15077 ` 1427` ``` "DERIV (%x. cos(x)*cos(x)) x :> -2 * cos(x) * sin(x)" ``` paulson@15077 ` 1428` ```apply (cut_tac x = x in DERIV_cos_cos_mult) ``` paulson@15077 ` 1429` ```apply (auto simp add: mult_ac) ``` paulson@15077 ` 1430` ```done ``` paulson@15077 ` 1431` paulson@15077 ` 1432` ```lemma DERIV_cos_realpow2 [simp]: ``` paulson@15077 ` 1433` ``` "DERIV (%x. (cos x)\) x :> -sin(x) * cos(x) + -sin(x) * cos(x)" ``` paulson@15077 ` 1434` ```by (auto simp add: numeral_2_eq_2 real_mult_assoc [symmetric]) ``` paulson@15077 ` 1435` paulson@15077 ` 1436` ```lemma DERIV_cos_realpow2a [simp]: ``` paulson@15077 ` 1437` ``` "DERIV (%x. (cos x)\) x :> -2 * cos(x) * sin(x)" ``` paulson@15077 ` 1438` ```by (auto simp add: numeral_2_eq_2) ``` paulson@15077 ` 1439` paulson@15077 ` 1440` ```lemma lemma_DERIV_subst: "[| DERIV f x :> D; D = E |] ==> DERIV f x :> E" ``` paulson@15077 ` 1441` ```by auto ``` paulson@15077 ` 1442` paulson@15077 ` 1443` ```lemma DERIV_cos_realpow2b: "DERIV (%x. (cos x)\) x :> -(2 * cos(x) * sin(x))" ``` paulson@15077 ` 1444` ```apply (rule lemma_DERIV_subst) ``` paulson@15077 ` 1445` ```apply (rule DERIV_cos_realpow2a, auto) ``` paulson@15077 ` 1446` ```done ``` paulson@15077 ` 1447` paulson@15077 ` 1448` ```(* most useful *) ``` paulson@15229 ` 1449` ```lemma DERIV_cos_cos_mult3 [simp]: ``` paulson@15229 ` 1450` ``` "DERIV (%x. cos(x)*cos(x)) x :> -(2 * cos(x) * sin(x))" ``` paulson@15077 ` 1451` ```apply (rule lemma_DERIV_subst) ``` paulson@15077 ` 1452` ```apply (rule DERIV_cos_cos_mult2, auto) ``` paulson@15077 ` 1453` ```done ``` paulson@15077 ` 1454` paulson@15077 ` 1455` ```lemma DERIV_sin_circle_all: ``` paulson@15077 ` 1456` ``` "\x. DERIV (%x. (sin x)\ + (cos x)\) x :> ``` paulson@15077 ` 1457` ``` (2*cos(x)*sin(x) - 2*cos(x)*sin(x))" ``` paulson@15229 ` 1458` ```apply (simp only: diff_minus, safe) ``` paulson@15229 ` 1459` ```apply (rule DERIV_add) ``` paulson@15077 ` 1460` ```apply (auto simp add: numeral_2_eq_2) ``` paulson@15077 ` 1461` ```done ``` paulson@15077 ` 1462` paulson@15229 ` 1463` ```lemma DERIV_sin_circle_all_zero [simp]: ``` paulson@15229 ` 1464` ``` "\x. DERIV (%x. (sin x)\ + (cos x)\) x :> 0" ``` paulson@15077 ` 1465` ```by (cut_tac DERIV_sin_circle_all, auto) ``` paulson@15077 ` 1466` paulson@15077 ` 1467` ```lemma sin_cos_squared_add [simp]: "((sin x)\) + ((cos x)\) = 1" ``` paulson@15077 ` 1468` ```apply (cut_tac x = x and y = 0 in DERIV_sin_circle_all_zero [THEN DERIV_isconst_all]) ``` paulson@15077 ` 1469` ```apply (auto simp add: numeral_2_eq_2) ``` paulson@15077 ` 1470` ```done ``` paulson@15077 ` 1471` paulson@15077 ` 1472` ```lemma sin_cos_squared_add2 [simp]: "((cos x)\) + ((sin x)\) = 1" ``` huffman@23286 ` 1473` ```apply (subst add_commute) ``` paulson@15077 ` 1474` ```apply (simp (no_asm) del: realpow_Suc) ``` paulson@15077 ` 1475` ```done ``` paulson@15077 ` 1476` paulson@15077 ` 1477` ```lemma sin_cos_squared_add3 [simp]: "cos x * cos x + sin x * sin x = 1" ``` paulson@15077 ` 1478` ```apply (cut_tac x = x in sin_cos_squared_add2) ``` paulson@15077 ` 1479` ```apply (auto simp add: numeral_2_eq_2) ``` paulson@15077 ` 1480` ```done ``` paulson@15077 ` 1481` paulson@15077 ` 1482` ```lemma sin_squared_eq: "(sin x)\ = 1 - (cos x)\" ``` paulson@15229 ` 1483` ```apply (rule_tac a1 = "(cos x)\" in add_right_cancel [THEN iffD1]) ``` paulson@15077 ` 1484` ```apply (simp del: realpow_Suc) ``` paulson@15077 ` 1485` ```done ``` paulson@15077 ` 1486` paulson@15077 ` 1487` ```lemma cos_squared_eq: "(cos x)\ = 1 - (sin x)\" ``` paulson@15077 ` 1488` ```apply (rule_tac a1 = "(sin x)\" in add_right_cancel [THEN iffD1]) ``` paulson@15077 ` 1489` ```apply (simp del: realpow_Suc) ``` paulson@15077 ` 1490` ```done ``` paulson@15077 ` 1491` paulson@15081 ` 1492` ```lemma abs_sin_le_one [simp]: "\sin x\ \ 1" ``` huffman@23097 ` 1493` ```by (rule power2_le_imp_le, simp_all add: sin_squared_eq) ``` paulson@15077 ` 1494` paulson@15077 ` 1495` ```lemma sin_ge_minus_one [simp]: "-1 \ sin x" ``` paulson@15077 ` 1496` ```apply (insert abs_sin_le_one [of x]) ``` huffman@22998 ` 1497` ```apply (simp add: abs_le_iff del: abs_sin_le_one) ``` paulson@15077 ` 1498` ```done ``` paulson@15077 ` 1499` paulson@15077 ` 1500` ```lemma sin_le_one [simp]: "sin x \ 1" ``` paulson@15077 ` 1501` ```apply (insert abs_sin_le_one [of x]) ``` huffman@22998 ` 1502` ```apply (simp add: abs_le_iff del: abs_sin_le_one) ``` paulson@15077 ` 1503` ```done ``` paulson@15077 ` 1504` paulson@15081 ` 1505` ```lemma abs_cos_le_one [simp]: "\cos x\ \ 1" ``` huffman@23097 ` 1506` ```by (rule power2_le_imp_le, simp_all add: cos_squared_eq) ``` paulson@15077 ` 1507` paulson@15077 ` 1508` ```lemma cos_ge_minus_one [simp]: "-1 \ cos x" ``` paulson@15077 ` 1509` ```apply (insert abs_cos_le_one [of x]) ``` huffman@22998 ` 1510` ```apply (simp add: abs_le_iff del: abs_cos_le_one) ``` paulson@15077 ` 1511` ```done ``` paulson@15077 ` 1512` paulson@15077 ` 1513` ```lemma cos_le_one [simp]: "cos x \ 1" ``` paulson@15077 ` 1514` ```apply (insert abs_cos_le_one [of x]) ``` huffman@22998 ` 1515` ```apply (simp add: abs_le_iff del: abs_cos_le_one) ``` paulson@15077 ` 1516` ```done ``` paulson@15077 ` 1517` paulson@15077 ` 1518` ```lemma DERIV_fun_pow: "DERIV g x :> m ==> ``` paulson@15077 ` 1519` ``` DERIV (%x. (g x) ^ n) x :> real n * (g x) ^ (n - 1) * m" ``` huffman@30082 ` 1520` ```unfolding One_nat_def ``` paulson@15077 ` 1521` ```apply (rule lemma_DERIV_subst) ``` paulson@15229 ` 1522` ```apply (rule_tac f = "(%x. x ^ n)" in DERIV_chain2) ``` paulson@15077 ` 1523` ```apply (rule DERIV_pow, auto) ``` paulson@15077 ` 1524` ```done ``` paulson@15077 ` 1525` paulson@15229 ` 1526` ```lemma DERIV_fun_exp: ``` paulson@15229 ` 1527` ``` "DERIV g x :> m ==> DERIV (%x. exp(g x)) x :> exp(g x) * m" ``` paulson@15077 ` 1528` ```apply (rule lemma_DERIV_subst) ``` paulson@15077 ` 1529` ```apply (rule_tac f = exp in DERIV_chain2) ``` paulson@15077 ` 1530` ```apply (rule DERIV_exp, auto) ``` paulson@15077 ` 1531` ```done ``` paulson@15077 ` 1532` paulson@15229 ` 1533` ```lemma DERIV_fun_sin: ``` paulson@15229 ` 1534` ``` "DERIV g x :> m ==> DERIV (%x. sin(g x)) x :> cos(g x) * m" ``` paulson@15077 ` 1535` ```apply (rule lemma_DERIV_subst) ``` paulson@15077 ` 1536` ```apply (rule_tac f = sin in DERIV_chain2) ``` paulson@15077 ` 1537` ```apply (rule DERIV_sin, auto) ``` paulson@15077 ` 1538` ```done ``` paulson@15077 ` 1539` paulson@15229 ` 1540` ```lemma DERIV_fun_cos: ``` paulson@15229 ` 1541` ``` "DERIV g x :> m ==> DERIV (%x. cos(g x)) x :> -sin(g x) * m" ``` paulson@15077 ` 1542` ```apply (rule lemma_DERIV_subst) ``` paulson@15077 ` 1543` ```apply (rule_tac f = cos in DERIV_chain2) ``` paulson@15077 ` 1544` ```apply (rule DERIV_cos, auto) ``` paulson@15077 ` 1545` ```done ``` paulson@15077 ` 1546` huffman@23069 ` 1547` ```lemmas DERIV_intros = DERIV_ident DERIV_const DERIV_cos DERIV_cmult ``` paulson@15077 ` 1548` ``` DERIV_sin DERIV_exp DERIV_inverse DERIV_pow ``` paulson@15077 ` 1549` ``` DERIV_add DERIV_diff DERIV_mult DERIV_minus ``` paulson@15077 ` 1550` ``` DERIV_inverse_fun DERIV_quotient DERIV_fun_pow ``` paulson@15077 ` 1551` ``` DERIV_fun_exp DERIV_fun_sin DERIV_fun_cos ``` paulson@15077 ` 1552` paulson@15077 ` 1553` ```(* lemma *) ``` paulson@15229 ` 1554` ```lemma lemma_DERIV_sin_cos_add: ``` paulson@15229 ` 1555` ``` "\x. ``` paulson@15077 ` 1556` ``` DERIV (%x. (sin (x + y) - (sin x * cos y + cos x * sin y)) ^ 2 + ``` paulson@15077 ` 1557` ``` (cos (x + y) - (cos x * cos y - sin x * sin y)) ^ 2) x :> 0" ``` paulson@15077 ` 1558` ```apply (safe, rule lemma_DERIV_subst) ``` paulson@15077 ` 1559` ```apply (best intro!: DERIV_intros intro: DERIV_chain2) ``` paulson@15077 ` 1560` ``` --{*replaces the old @{text DERIV_tac}*} ``` nipkow@29667 ` 1561` ```apply (auto simp add: algebra_simps) ``` paulson@15077 ` 1562` ```done ``` paulson@15077 ` 1563` paulson@15077 ` 1564` ```lemma sin_cos_add [simp]: ``` paulson@15077 ` 1565` ``` "(sin (x + y) - (sin x * cos y + cos x * sin y)) ^ 2 + ``` paulson@15077 ` 1566` ``` (cos (x + y) - (cos x * cos y - sin x * sin y)) ^ 2 = 0" ``` paulson@15077 ` 1567` ```apply (cut_tac y = 0 and x = x and y7 = y ``` paulson@15077 ` 1568` ``` in lemma_DERIV_sin_cos_add [THEN DERIV_isconst_all]) ``` paulson@15077 ` 1569` ```apply (auto simp add: numeral_2_eq_2) ``` paulson@15077 ` 1570` ```done ``` paulson@15077 ` 1571` paulson@15077 ` 1572` ```lemma sin_add: "sin (x + y) = sin x * cos y + cos x * sin y" ``` paulson@15077 ` 1573` ```apply (cut_tac x = x and y = y in sin_cos_add) ``` huffman@22969 ` 1574` ```apply (simp del: sin_cos_add) ``` paulson@15077 ` 1575` ```done ``` paulson@15077 ` 1576` paulson@15077 ` 1577` ```lemma cos_add: "cos (x + y) = cos x * cos y - sin x * sin y" ``` paulson@15077 ` 1578` ```apply (cut_tac x = x and y = y in sin_cos_add) ``` huffman@22969 ` 1579` ```apply (simp del: sin_cos_add) ``` paulson@15077 ` 1580` ```done ``` paulson@15077 ` 1581` paulson@15085 ` 1582` ```lemma lemma_DERIV_sin_cos_minus: ``` paulson@15085 ` 1583` ``` "\x. DERIV (%x. (sin(-x) + (sin x)) ^ 2 + (cos(-x) - (cos x)) ^ 2) x :> 0" ``` paulson@15077 ` 1584` ```apply (safe, rule lemma_DERIV_subst) ``` nipkow@29667 ` 1585` ```apply (best intro!: DERIV_intros intro: DERIV_chain2) ``` nipkow@29667 ` 1586` ```apply (simp add: algebra_simps) ``` paulson@15077 ` 1587` ```done ``` paulson@15077 ` 1588` huffman@29165 ` 1589` ```lemma sin_cos_minus: ``` paulson@15085 ` 1590` ``` "(sin(-x) + (sin x)) ^ 2 + (cos(-x) - (cos x)) ^ 2 = 0" ``` paulson@15085 ` 1591` ```apply (cut_tac y = 0 and x = x ``` paulson@15085 ` 1592` ``` in lemma_DERIV_sin_cos_minus [THEN DERIV_isconst_all]) ``` huffman@22969 ` 1593` ```apply simp ``` paulson@15077 ` 1594` ```done ``` paulson@15077 ` 1595` paulson@15077 ` 1596` ```lemma sin_minus [simp]: "sin (-x) = -sin(x)" ``` huffman@29165 ` 1597` ``` using sin_cos_minus [where x=x] by simp ``` paulson@15077 ` 1598` paulson@15077 ` 1599` ```lemma cos_minus [simp]: "cos (-x) = cos(x)" ``` huffman@29165 ` 1600` ``` using sin_cos_minus [where x=x] by simp ``` paulson@15077 ` 1601` paulson@15077 ` 1602` ```lemma sin_diff: "sin (x - y) = sin x * cos y - cos x * sin y" ``` huffman@22969 ` 1603` ```by (simp add: diff_minus sin_add) ``` paulson@15077 ` 1604` paulson@15077 ` 1605` ```lemma sin_diff2: "sin (x - y) = cos y * sin x - sin y * cos x" ``` paulson@15077 ` 1606` ```by (simp add: sin_diff mult_commute) ``` paulson@15077 ` 1607` paulson@15077 ` 1608` ```lemma cos_diff: "cos (x - y) = cos x * cos y + sin x * sin y" ``` huffman@22969 ` 1609` ```by (simp add: diff_minus cos_add) ``` paulson@15077 ` 1610` paulson@15077 ` 1611` ```lemma cos_diff2: "cos (x - y) = cos y * cos x + sin y * sin x" ``` paulson@15077 ` 1612` ```by (simp add: cos_diff mult_commute) ``` paulson@15077 ` 1613` paulson@15077 ` 1614` ```lemma sin_double [simp]: "sin(2 * x) = 2* sin x * cos x" ``` huffman@29165 ` 1615` ``` using sin_add [where x=x and y=x] by simp ``` paulson@15077 ` 1616` paulson@15077 ` 1617` ```lemma cos_double: "cos(2* x) = ((cos x)\) - ((sin x)\)" ``` huffman@29165 ` 1618` ``` using cos_add [where x=x and y=x] ``` huffman@29165 ` 1619` ``` by (simp add: power2_eq_square) ``` paulson@15077 ` 1620` paulson@15077 ` 1621` huffman@29164 ` 1622` ```subsection {* The Constant Pi *} ``` paulson@15077 ` 1623` huffman@23043 ` 1624` ```definition ``` huffman@23043 ` 1625` ``` pi :: "real" where ``` huffman@23053 ` 1626` ``` "pi = 2 * (THE x. 0 \ (x::real) & x \ 2 & cos x = 0)" ``` huffman@23043 ` 1627` paulson@15077 ` 1628` ```text{*Show that there's a least positive @{term x} with @{term "cos(x) = 0"}; ``` paulson@15077 ` 1629` ``` hence define pi.*} ``` paulson@15077 ` 1630` paulson@15077 ` 1631` ```lemma sin_paired: ``` huffman@23177 ` 1632` ``` "(%n. -1 ^ n /(real (fact (2 * n + 1))) * x ^ (2 * n + 1)) ``` paulson@15077 ` 1633` ``` sums sin x" ``` paulson@15077 ` 1634` ```proof - ``` paulson@15077 ` 1635` ``` have "(\n. \k = n * 2.. 0 < sin x" ``` paulson@15077 ` 1646` ```apply (subgoal_tac ``` paulson@15077 ` 1647` ``` "(\n. \k = n * 2..n. -1 ^ n / real (fact (2 * n + 1)) * x ^ (2 * n + 1))") ``` paulson@15077 ` 1650` ``` prefer 2 ``` paulson@15077 ` 1651` ``` apply (rule sin_paired [THEN sums_summable, THEN sums_group], simp) ``` paulson@15077 ` 1652` ```apply (rotate_tac 2) ``` paulson@15077 ` 1653` ```apply (drule sin_paired [THEN sums_unique, THEN ssubst]) ``` huffman@30082 ` 1654` ```unfolding One_nat_def ``` paulson@15077 ` 1655` ```apply (auto simp del: fact_Suc realpow_Suc) ``` paulson@15077 ` 1656` ```apply (frule sums_unique) ``` paulson@15077 ` 1657` ```apply (auto simp del: fact_Suc realpow_Suc) ``` paulson@15077 ` 1658` ```apply (rule_tac n1 = 0 in series_pos_less [THEN [2] order_le_less_trans]) ``` paulson@15077 ` 1659` ```apply (auto simp del: fact_Suc realpow_Suc) ``` paulson@15077 ` 1660` ```apply (erule sums_summable) ``` paulson@15077 ` 1661` ```apply (case_tac "m=0") ``` paulson@15077 ` 1662` ```apply (simp (no_asm_simp)) ``` paulson@15234 ` 1663` ```apply (subgoal_tac "6 * (x * (x * x) / real (Suc (Suc (Suc (Suc (Suc (Suc 0))))))) < 6 * x") ``` nipkow@15539 ` 1664` ```apply (simp only: mult_less_cancel_left, simp) ``` nipkow@15539 ` 1665` ```apply (simp (no_asm_simp) add: numeral_2_eq_2 [symmetric] mult_assoc [symmetric]) ``` paulson@15077 ` 1666` ```apply (subgoal_tac "x*x < 2*3", simp) ``` paulson@15077 ` 1667` ```apply (rule mult_strict_mono) ``` paulson@15085 ` 1668` ```apply (auto simp add: real_0_less_add_iff real_of_nat_Suc simp del: fact_Suc) ``` paulson@15077 ` 1669` ```apply (subst fact_Suc) ``` paulson@15077 ` 1670` ```apply (subst fact_Suc) ``` paulson@15077 ` 1671` ```apply (subst fact_Suc) ``` paulson@15077 ` 1672` ```apply (subst fact_Suc) ``` paulson@15077 ` 1673` ```apply (subst real_of_nat_mult) ``` paulson@15077 ` 1674` ```apply (subst real_of_nat_mult) ``` paulson@15077 ` 1675` ```apply (subst real_of_nat_mult) ``` paulson@15077 ` 1676` ```apply (subst real_of_nat_mult) ``` nipkow@15539 ` 1677` ```apply (simp (no_asm) add: divide_inverse del: fact_Suc) ``` paulson@15077 ` 1678` ```apply (auto simp add: mult_assoc [symmetric] simp del: fact_Suc) ``` paulson@15077 ` 1679` ```apply (rule_tac c="real (Suc (Suc (4*m)))" in mult_less_imp_less_right) ``` paulson@15077 ` 1680` ```apply (auto simp add: mult_assoc simp del: fact_Suc) ``` paulson@15077 ` 1681` ```apply (rule_tac c="real (Suc (Suc (Suc (4*m))))" in mult_less_imp_less_right) ``` paulson@15077 ` 1682` ```apply (auto simp add: mult_assoc mult_less_cancel_left simp del: fact_Suc) ``` paulson@15077 ` 1683` ```apply (subgoal_tac "x * (x * x ^ (4*m)) = (x ^ (4*m)) * (x * x)") ``` paulson@15077 ` 1684` ```apply (erule ssubst)+ ``` paulson@15077 ` 1685` ```apply (auto simp del: fact_Suc) ``` paulson@15077 ` 1686` ```apply (subgoal_tac "0 < x ^ (4 * m) ") ``` paulson@15077 ` 1687` ``` prefer 2 apply (simp only: zero_less_power) ``` paulson@15077 ` 1688` ```apply (simp (no_asm_simp) add: mult_less_cancel_left) ``` paulson@15077 ` 1689` ```apply (rule mult_strict_mono) ``` paulson@15077 ` 1690` ```apply (simp_all (no_asm_simp)) ``` paulson@15077 ` 1691` ```done ``` paulson@15077 ` 1692` paulson@15077 ` 1693` ```lemma sin_gt_zero1: "[|0 < x; x < 2 |] ==> 0 < sin x" ``` paulson@15077 ` 1694` ```by (auto intro: sin_gt_zero) ``` paulson@15077 ` 1695` paulson@15077 ` 1696` ```lemma cos_double_less_one: "[| 0 < x; x < 2 |] ==> cos (2 * x) < 1" ``` paulson@15077 ` 1697` ```apply (cut_tac x = x in sin_gt_zero1) ``` paulson@15077 ` 1698` ```apply (auto simp add: cos_squared_eq cos_double) ``` paulson@15077 ` 1699` ```done ``` paulson@15077 ` 1700` paulson@15077 ` 1701` ```lemma cos_paired: ``` huffman@23177 ` 1702` ``` "(%n. -1 ^ n /(real (fact (2 * n))) * x ^ (2 * n)) sums cos x" ``` paulson@15077 ` 1703` ```proof - ``` paulson@15077 ` 1704` ``` have "(\n. \k = n * 2..n=0..< Suc(Suc(Suc 0)). - (-1 ^ n / (real(fact (2*n))) * 2 ^ (2*n))" ``` paulson@15481 ` 1723` ``` in order_less_trans) ``` paulson@15077 ` 1724` ```apply (simp (no_asm) add: fact_num_eq_if realpow_num_eq_if del: fact_Suc realpow_Suc) ``` nipkow@15561 ` 1725` ```apply (simp (no_asm) add: mult_assoc del: setsum_op_ivl_Suc) ``` paulson@15077 ` 1726` ```apply (rule sumr_pos_lt_pair) ``` paulson@15077 ` 1727` ```apply (erule sums_summable, safe) ``` huffman@30082 ` 1728` ```unfolding One_nat_def ``` paulson@15085 ` 1729` ```apply (simp (no_asm) add: divide_inverse real_0_less_add_iff mult_assoc [symmetric] ``` paulson@15085 ` 1730` ``` del: fact_Suc) ``` paulson@15077 ` 1731` ```apply (rule real_mult_inverse_cancel2) ``` paulson@15077 ` 1732` ```apply (rule real_of_nat_fact_gt_zero)+ ``` paulson@15077 ` 1733` ```apply (simp (no_asm) add: mult_assoc [symmetric] del: fact_Suc) ``` paulson@15077 ` 1734` ```apply (subst fact_lemma) ``` paulson@15481 ` 1735` ```apply (subst fact_Suc [of "Suc (Suc (Suc (Suc (Suc (Suc (Suc (4 * d)))))))"]) ``` paulson@15481 ` 1736` ```apply (simp only: real_of_nat_mult) ``` huffman@23007 ` 1737` ```apply (rule mult_strict_mono, force) ``` huffman@27483 ` 1738` ``` apply (rule_tac [3] real_of_nat_ge_zero) ``` paulson@15481 ` 1739` ``` prefer 2 apply force ``` paulson@15077 ` 1740` ```apply (rule real_of_nat_less_iff [THEN iffD2]) ``` paulson@15077 ` 1741` ```apply (rule fact_less_mono, auto) ``` paulson@15077 ` 1742` ```done ``` huffman@23053 ` 1743` huffman@23053 ` 1744` ```lemmas cos_two_neq_zero [simp] = cos_two_less_zero [THEN less_imp_neq] ``` huffman@23053 ` 1745` ```lemmas cos_two_le_zero [simp] = cos_two_less_zero [THEN order_less_imp_le] ``` paulson@15077 ` 1746` paulson@15077 ` 1747` ```lemma cos_is_zero: "EX! x. 0 \ x & x \ 2 & cos x = 0" ``` paulson@15077 ` 1748` ```apply (subgoal_tac "\x. 0 \ x & x \ 2 & cos x = 0") ``` paulson@15077 ` 1749` ```apply (rule_tac [2] IVT2) ``` paulson@15077 ` 1750` ```apply (auto intro: DERIV_isCont DERIV_cos) ``` paulson@15077 ` 1751` ```apply (cut_tac x = xa and y = y in linorder_less_linear) ``` paulson@15077 ` 1752` ```apply (rule ccontr) ``` paulson@15077 ` 1753` ```apply (subgoal_tac " (\x. cos differentiable x) & (\x. isCont cos x) ") ``` paulson@15077 ` 1754` ```apply (auto intro: DERIV_cos DERIV_isCont simp add: differentiable_def) ``` paulson@15077 ` 1755` ```apply (drule_tac f = cos in Rolle) ``` paulson@15077 ` 1756` ```apply (drule_tac [5] f = cos in Rolle) ``` paulson@15077 ` 1757` ```apply (auto dest!: DERIV_cos [THEN DERIV_unique] simp add: differentiable_def) ``` paulson@15077 ` 1758` ```apply (drule_tac y1 = xa in order_le_less_trans [THEN sin_gt_zero]) ``` paulson@15077 ` 1759` ```apply (assumption, rule_tac y=y in order_less_le_trans, simp_all) ``` paulson@15077 ` 1760` ```apply (drule_tac y1 = y in order_le_less_trans [THEN sin_gt_zero], assumption, simp_all) ``` paulson@15077 ` 1761` ```done ``` paulson@15077 ` 1762` ``` ``` huffman@23053 ` 1763` ```lemma pi_half: "pi/2 = (THE x. 0 \ x & x \ 2 & cos x = 0)" ``` paulson@15077 ` 1764` ```by (simp add: pi_def) ``` paulson@15077 ` 1765` paulson@15077 ` 1766` ```lemma cos_pi_half [simp]: "cos (pi / 2) = 0" ``` huffman@23053 ` 1767` ```by (simp add: pi_half cos_is_zero [THEN theI']) ``` huffman@23053 ` 1768` huffman@23053 ` 1769` ```lemma pi_half_gt_zero [simp]: "0 < pi / 2" ``` huffman@23053 ` 1770` ```apply (rule order_le_neq_trans) ``` huffman@23053 ` 1771` ```apply (simp add: pi_half cos_is_zero [THEN theI']) ``` huffman@23053 ` 1772` ```apply (rule notI, drule arg_cong [where f=cos], simp) ``` paulson@15077 ` 1773` ```done ``` paulson@15077 ` 1774` huffman@23053 ` 1775` ```lemmas pi_half_neq_zero [simp] = pi_half_gt_zero [THEN less_imp_neq, symmetric] ``` huffman@23053 ` 1776` ```lemmas pi_half_ge_zero [simp] = pi_half_gt_zero [THEN order_less_imp_le] ``` paulson@15077 ` 1777` huffman@23053 ` 1778` ```lemma pi_half_less_two [simp]: "pi / 2 < 2" ``` huffman@23053 ` 1779` ```apply (rule order_le_neq_trans) ``` huffman@23053 ` 1780` ```apply (simp add: pi_half cos_is_zero [THEN theI']) ``` huffman@23053 ` 1781` ```apply (rule notI, drule arg_cong [where f=cos], simp) ``` paulson@15077 ` 1782` ```done ``` huffman@23053 ` 1783` huffman@23053 ` 1784` ```lemmas pi_half_neq_two [simp] = pi_half_less_two [THEN less_imp_neq] ``` huffman@23053 ` 1785` ```lemmas pi_half_le_two [simp] = pi_half_less_two [THEN order_less_imp_le] ``` paulson@15077 ` 1786` paulson@15077 ` 1787` ```lemma pi_gt_zero [simp]: "0 < pi" ``` huffman@23053 ` 1788` ```by (insert pi_half_gt_zero, simp) ``` huffman@23053 ` 1789` huffman@23053 ` 1790` ```lemma pi_ge_zero [simp]: "0 \ pi" ``` huffman@23053 ` 1791` ```by (rule pi_gt_zero [THEN order_less_imp_le]) ``` paulson@15077 ` 1792` paulson@15077 ` 1793` ```lemma pi_neq_zero [simp]: "pi \ 0" ``` huffman@22998 ` 1794` ```by (rule pi_gt_zero [THEN less_imp_neq, THEN not_sym]) ``` paulson@15077 ` 1795` huffman@23053 ` 1796` ```lemma pi_not_less_zero [simp]: "\ pi < 0" ``` huffman@23053 ` 1797` ```by (simp add: linorder_not_less) ``` paulson@15077 ` 1798` huffman@29165 ` 1799` ```lemma minus_pi_half_less_zero: "-(pi/2) < 0" ``` huffman@29165 ` 1800` ```by simp ``` paulson@15077 ` 1801` hoelzl@29803 ` 1802` ```lemma m2pi_less_pi: "- (2 * pi) < pi" ``` hoelzl@29803 ` 1803` ```proof - ``` hoelzl@29803 ` 1804` ``` have "- (2 * pi) < 0" and "0 < pi" by auto ``` hoelzl@29803 ` 1805` ``` from order_less_trans[OF this] show ?thesis . ``` hoelzl@29803 ` 1806` ```qed ``` hoelzl@29803 ` 1807` paulson@15077 ` 1808` ```lemma sin_pi_half [simp]: "sin(pi/2) = 1" ``` paulson@15077 ` 1809` ```apply (cut_tac x = "pi/2" in sin_cos_squared_add2) ``` paulson@15077 ` 1810` ```apply (cut_tac sin_gt_zero [OF pi_half_gt_zero pi_half_less_two]) ``` huffman@23053 ` 1811` ```apply (simp add: power2_eq_square) ``` paulson@15077 ` 1812` ```done ``` paulson@15077 ` 1813` paulson@15077 ` 1814` ```lemma cos_pi [simp]: "cos pi = -1" ``` nipkow@15539 ` 1815` ```by (cut_tac x = "pi/2" and y = "pi/2" in cos_add, simp) ``` paulson@15077 ` 1816` paulson@15077 ` 1817` ```lemma sin_pi [simp]: "sin pi = 0" ``` nipkow@15539 ` 1818` ```by (cut_tac x = "pi/2" and y = "pi/2" in sin_add, simp) ``` paulson@15077 ` 1819` paulson@15077 ` 1820` ```lemma sin_cos_eq: "sin x = cos (pi/2 - x)" ``` paulson@15229 ` 1821` ```by (simp add: diff_minus cos_add) ``` huffman@23053 ` 1822` ```declare sin_cos_eq [symmetric, simp] ``` paulson@15077 ` 1823` paulson@15077 ` 1824` ```lemma minus_sin_cos_eq: "-sin x = cos (x + pi/2)" ``` paulson@15229 ` 1825` ```by (simp add: cos_add) ``` paulson@15077 ` 1826` ```declare minus_sin_cos_eq [symmetric, simp] ``` paulson@15077 ` 1827` paulson@15077 ` 1828` ```lemma cos_sin_eq: "cos x = sin (pi/2 - x)" ``` paulson@15229 ` 1829` ```by (simp add: diff_minus sin_add) ``` huffman@23053 ` 1830` ```declare cos_sin_eq [symmetric, simp] ``` paulson@15077 ` 1831` paulson@15077 ` 1832` ```lemma sin_periodic_pi [simp]: "sin (x + pi) = - sin x" ``` paulson@15229 ` 1833` ```by (simp add: sin_add) ``` paulson@15077 ` 1834` paulson@15077 ` 1835` ```lemma sin_periodic_pi2 [simp]: "sin (pi + x) = - sin x" ``` paulson@15229 ` 1836` ```by (simp add: sin_add) ``` paulson@15077 ` 1837` paulson@15077 ` 1838` ```lemma cos_periodic_pi [simp]: "cos (x + pi) = - cos x" ``` paulson@15229 ` 1839` ```by (simp add: cos_add) ``` paulson@15077 ` 1840` paulson@15077 ` 1841` ```lemma sin_periodic [simp]: "sin (x + 2*pi) = sin x" ``` paulson@15077 ` 1842` ```by (simp add: sin_add cos_double) ``` paulson@15077 ` 1843` paulson@15077 ` 1844` ```lemma cos_periodic [simp]: "cos (x + 2*pi) = cos x" ``` paulson@15077 ` 1845` ```by (simp add: cos_add cos_double) ``` paulson@15077 ` 1846` paulson@15077 ` 1847` ```lemma cos_npi [simp]: "cos (real n * pi) = -1 ^ n" ``` paulson@15251 ` 1848` ```apply (induct "n") ``` paulson@15077 ` 1849` ```apply (auto simp add: real_of_nat_Suc left_distrib) ``` paulson@15077 ` 1850` ```done ``` paulson@15077 ` 1851` paulson@15383 ` 1852` ```lemma cos_npi2 [simp]: "cos (pi * real n) = -1 ^ n" ``` paulson@15383 ` 1853` ```proof - ``` paulson@15383 ` 1854` ``` have "cos (pi * real n) = cos (real n * pi)" by (simp only: mult_commute) ``` paulson@15383 ` 1855` ``` also have "... = -1 ^ n" by (rule cos_npi) ``` paulson@15383 ` 1856` ``` finally show ?thesis . ``` paulson@15383 ` 1857` ```qed ``` paulson@15383 ` 1858` paulson@15077 ` 1859` ```lemma sin_npi [simp]: "sin (real (n::nat) * pi) = 0" ``` paulson@15251 ` 1860` ```apply (induct "n") ``` paulson@15077 ` 1861` ```apply (auto simp add: real_of_nat_Suc left_distrib) ``` paulson@15077 ` 1862` ```done ``` paulson@15077 ` 1863` paulson@15077 ` 1864` ```lemma sin_npi2 [simp]: "sin (pi * real (n::nat)) = 0" ``` paulson@15383 ` 1865` ```by (simp add: mult_commute [of pi]) ``` paulson@15077 ` 1866` paulson@15077 ` 1867` ```lemma cos_two_pi [simp]: "cos (2 * pi) = 1" ``` paulson@15077 ` 1868` ```by (simp add: cos_double) ``` paulson@15077 ` 1869` paulson@15077 ` 1870` ```lemma sin_two_pi [simp]: "sin (2 * pi) = 0" ``` paulson@15229 ` 1871` ```by simp ``` paulson@15077 ` 1872` paulson@15077 ` 1873` ```lemma sin_gt_zero2: "[| 0 < x; x < pi/2 |] ==> 0 < sin x" ``` paulson@15077 ` 1874` ```apply (rule sin_gt_zero, assumption) ``` paulson@15077 ` 1875` ```apply (rule order_less_trans, assumption) ``` paulson@15077 ` 1876` ```apply (rule pi_half_less_two) ``` paulson@15077 ` 1877` ```done ``` paulson@15077 ` 1878` paulson@15077 ` 1879` ```lemma sin_less_zero: ``` paulson@15077 ` 1880` ``` assumes lb: "- pi/2 < x" and "x < 0" shows "sin x < 0" ``` paulson@15077 ` 1881` ```proof - ``` paulson@15077 ` 1882` ``` have "0 < sin (- x)" using prems by (simp only: sin_gt_zero2) ``` paulson@15077 ` 1883` ``` thus ?thesis by simp ``` paulson@15077 ` 1884` ```qed ``` paulson@15077 ` 1885` paulson@15077 ` 1886` ```lemma pi_less_4: "pi < 4" ``` paulson@15077 ` 1887` ```by (cut_tac pi_half_less_two, auto) ``` paulson@15077 ` 1888` paulson@15077 ` 1889` ```lemma cos_gt_zero: "[| 0 < x; x < pi/2 |] ==> 0 < cos x" ``` paulson@15077 ` 1890` ```apply (cut_tac pi_less_4) ``` paulson@15077 ` 1891` ```apply (cut_tac f = cos and a = 0 and b = x and y = 0 in IVT2_objl, safe, simp_all) ``` paulson@15077 ` 1892` ```apply (cut_tac cos_is_zero, safe) ``` paulson@15077 ` 1893` ```apply (rename_tac y z) ``` paulson@15077 ` 1894` ```apply (drule_tac x = y in spec) ``` paulson@15077 ` 1895` ```apply (drule_tac x = "pi/2" in spec, simp) ``` paulson@15077 ` 1896` ```done ``` paulson@15077 ` 1897` paulson@15077 ` 1898` ```lemma cos_gt_zero_pi: "[| -(pi/2) < x; x < pi/2 |] ==> 0 < cos x" ``` paulson@15077 ` 1899` ```apply (rule_tac x = x and y = 0 in linorder_cases) ``` paulson@15077 ` 1900` ```apply (rule cos_minus [THEN subst]) ``` paulson@15077 ` 1901` ```apply (rule cos_gt_zero) ``` paulson@15077 ` 1902` ```apply (auto intro: cos_gt_zero) ``` paulson@15077 ` 1903` ```done ``` paulson@15077 ` 1904` ``` ``` paulson@15077 ` 1905` ```lemma cos_ge_zero: "[| -(pi/2) \ x; x \ pi/2 |] ==> 0 \ cos x" ``` paulson@15077 ` 1906` ```apply (auto simp add: order_le_less cos_gt_zero_pi) ``` paulson@15077 ` 1907` ```apply (subgoal_tac "x = pi/2", auto) ``` paulson@15077 ` 1908` ```done ``` paulson@15077 ` 1909` paulson@15077 ` 1910` ```lemma sin_gt_zero_pi: "[| 0 < x; x < pi |] ==> 0 < sin x" ``` paulson@15077 ` 1911` ```apply (subst sin_cos_eq) ``` paulson@15077 ` 1912` ```apply (rotate_tac 1) ``` paulson@15077 ` 1913` ```apply (drule real_sum_of_halves [THEN ssubst]) ``` paulson@15077 ` 1914` ```apply (auto intro!: cos_gt_zero_pi simp del: sin_cos_eq [symmetric]) ``` paulson@15077 ` 1915` ```done ``` paulson@15077 ` 1916` hoelzl@29803 ` 1917` hoelzl@29803 ` 1918` ```lemma pi_ge_two: "2 \ pi" ``` hoelzl@29803 ` 1919` ```proof (rule ccontr) ``` hoelzl@29803 ` 1920` ``` assume "\ 2 \ pi" hence "pi < 2" by auto ``` hoelzl@29803 ` 1921` ``` have "\y > pi. y < 2 \ y < 2 * pi" ``` hoelzl@29803 ` 1922` ``` proof (cases "2 < 2 * pi") ``` hoelzl@29803 ` 1923` ``` case True with dense[OF `pi < 2`] show ?thesis by auto ``` hoelzl@29803 ` 1924` ``` next ``` hoelzl@29803 ` 1925` ``` case False have "pi < 2 * pi" by auto ``` hoelzl@29803 ` 1926` ``` from dense[OF this] and False show ?thesis by auto ``` hoelzl@29803 ` 1927` ``` qed ``` hoelzl@29803 ` 1928` ``` then obtain y where "pi < y" and "y < 2" and "y < 2 * pi" by blast ``` hoelzl@29803 ` 1929` ``` hence "0 < sin y" using sin_gt_zero by auto ``` hoelzl@29803 ` 1930` ``` moreover ``` hoelzl@29803 ` 1931` ``` have "sin y < 0" using sin_gt_zero_pi[of "y - pi"] `pi < y` and `y < 2 * pi` sin_periodic_pi[of "y - pi"] by auto ``` hoelzl@29803 ` 1932` ``` ultimately show False by auto ``` hoelzl@29803 ` 1933` ```qed ``` hoelzl@29803 ` 1934` paulson@15077 ` 1935` ```lemma sin_ge_zero: "[| 0 \ x; x \ pi |] ==> 0 \ sin x" ``` paulson@15077 ` 1936` ```by (auto simp add: order_le_less sin_gt_zero_pi) ``` paulson@15077 ` 1937` paulson@15077 ` 1938` ```lemma cos_total: "[| -1 \ y; y \ 1 |] ==> EX! x. 0 \ x & x \ pi & (cos x = y)" ``` paulson@15077 ` 1939` ```apply (subgoal_tac "\x. 0 \ x & x \ pi & cos x = y") ``` paulson@15077 ` 1940` ```apply (rule_tac [2] IVT2) ``` paulson@15077 ` 1941` ```apply (auto intro: order_less_imp_le DERIV_isCont DERIV_cos) ``` paulson@15077 ` 1942` ```apply (cut_tac x = xa and y = y in linorder_less_linear) ``` paulson@15077 ` 1943` ```apply (rule ccontr, auto) ``` paulson@15077 ` 1944` ```apply (drule_tac f = cos in Rolle) ``` paulson@15077 ` 1945` ```apply (drule_tac [5] f = cos in Rolle) ``` paulson@15077 ` 1946` ```apply (auto intro: order_less_imp_le DERIV_isCont DERIV_cos ``` paulson@15077 ` 1947` ``` dest!: DERIV_cos [THEN DERIV_unique] ``` paulson@15077 ` 1948` ``` simp add: differentiable_def) ``` paulson@15077 ` 1949` ```apply (auto dest: sin_gt_zero_pi [OF order_le_less_trans order_less_le_trans]) ``` paulson@15077 ` 1950` ```done ``` paulson@15077 ` 1951` paulson@15077 ` 1952` ```lemma sin_total: ``` paulson@15077 ` 1953` ``` "[| -1 \ y; y \ 1 |] ==> EX! x. -(pi/2) \ x & x \ pi/2 & (sin x = y)" ``` paulson@15077 ` 1954` ```apply (rule ccontr) ``` paulson@15077 ` 1955` ```apply (subgoal_tac "\x. (- (pi/2) \ x & x \ pi/2 & (sin x = y)) = (0 \ (x + pi/2) & (x + pi/2) \ pi & (cos (x + pi/2) = -y))") ``` wenzelm@18585 ` 1956` ```apply (erule contrapos_np) ``` paulson@15077 ` 1957` ```apply (simp del: minus_sin_cos_eq [symmetric]) ``` paulson@15077 ` 1958` ```apply (cut_tac y="-y" in cos_total, simp) apply simp ``` paulson@15077 ` 1959` ```apply (erule ex1E) ``` paulson@15229 ` 1960` ```apply (rule_tac a = "x - (pi/2)" in ex1I) ``` huffman@23286 ` 1961` ```apply (simp (no_asm) add: add_assoc) ``` paulson@15077 ` 1962` ```apply (rotate_tac 3) ``` paulson@15077 ` 1963` ```apply (drule_tac x = "xa + pi/2" in spec, safe, simp_all) ``` paulson@15077 ` 1964` ```done ``` paulson@15077 ` 1965` paulson@15077 ` 1966` ```lemma reals_Archimedean4: ``` paulson@15077 ` 1967` ``` "[| 0 < y; 0 \ x |] ==> \n. real n * y \ x & x < real (Suc n) * y" ``` paulson@15077 ` 1968` ```apply (auto dest!: reals_Archimedean3) ``` paulson@15077 ` 1969` ```apply (drule_tac x = x in spec, clarify) ``` paulson@15077 ` 1970` ```apply (subgoal_tac "x < real(LEAST m::nat. x < real m * y) * y") ``` paulson@15077 ` 1971` ``` prefer 2 apply (erule LeastI) ``` paulson@15077 ` 1972` ```apply (case_tac "LEAST m::nat. x < real m * y", simp) ``` paulson@15077 ` 1973` ```apply (subgoal_tac "~ x < real nat * y") ``` paulson@15077 ` 1974` ``` prefer 2 apply (rule not_less_Least, simp, force) ``` paulson@15077 ` 1975` ```done ``` paulson@15077 ` 1976` paulson@15077 ` 1977` ```(* Pre Isabelle99-2 proof was simpler- numerals arithmetic ``` paulson@15077 ` 1978` ``` now causes some unwanted re-arrangements of literals! *) ``` paulson@15229 ` 1979` ```lemma cos_zero_lemma: ``` paulson@15229 ` 1980` ``` "[| 0 \ x; cos x = 0 |] ==> ``` paulson@15077 ` 1981` ``` \n::nat. ~even n & x = real n * (pi/2)" ``` paulson@15077 ` 1982` ```apply (drule pi_gt_zero [THEN reals_Archimedean4], safe) ``` paulson@15086 ` 1983` ```apply (subgoal_tac "0 \ x - real n * pi & ``` paulson@15086 ` 1984` ``` (x - real n * pi) \ pi & (cos (x - real n * pi) = 0) ") ``` nipkow@29667 ` 1985` ```apply (auto simp add: algebra_simps real_of_nat_Suc) ``` nipkow@29667 ` 1986` ``` prefer 2 apply (simp add: cos_diff) ``` paulson@15077 ` 1987` ```apply (simp add: cos_diff) ``` paulson@15077 ` 1988` ```apply (subgoal_tac "EX! x. 0 \ x & x \ pi & cos x = 0") ``` paulson@15077 ` 1989` ```apply (rule_tac [2] cos_total, safe) ``` paulson@15077 ` 1990` ```apply (drule_tac x = "x - real n * pi" in spec) ``` paulson@15077 ` 1991` ```apply (drule_tac x = "pi/2" in spec) ``` paulson@15077 ` 1992` ```apply (simp add: cos_diff) ``` paulson@15229 ` 1993` ```apply (rule_tac x = "Suc (2 * n)" in exI) ``` nipkow@29667 ` 1994` ```apply (simp add: real_of_nat_Suc algebra_simps, auto) ``` paulson@15077 ` 1995` ```done ``` paulson@15077 ` 1996` paulson@15229 ` 1997` ```lemma sin_zero_lemma: ``` paulson@15229 ` 1998` ``` "[| 0 \ x; sin x = 0 |] ==> ``` paulson@15077 ` 1999` ``` \n::nat. even n & x = real n * (pi/2)" ``` paulson@15077 ` 2000` ```apply (subgoal_tac "\n::nat. ~ even n & x + pi/2 = real n * (pi/2) ") ``` paulson@15077 ` 2001` ``` apply (clarify, rule_tac x = "n - 1" in exI) ``` paulson@15077 ` 2002` ``` apply (force simp add: odd_Suc_mult_two_ex real_of_nat_Suc left_distrib) ``` paulson@15085 ` 2003` ```apply (rule cos_zero_lemma) ``` paulson@15085 ` 2004` ```apply (simp_all add: add_increasing) ``` paulson@15077 ` 2005` ```done ``` paulson@15077 ` 2006` paulson@15077 ` 2007` paulson@15229 ` 2008` ```lemma cos_zero_iff: ``` paulson@15229 ` 2009` ``` "(cos x = 0) = ``` paulson@15077 ` 2010` ``` ((\n::nat. ~even n & (x = real n * (pi/2))) | ``` paulson@15077 ` 2011` ``` (\n::nat. ~even n & (x = -(real n * (pi/2)))))" ``` paulson@15077 ` 2012` ```apply (rule iffI) ``` paulson@15077 ` 2013` ```apply (cut_tac linorder_linear [of 0 x], safe) ``` paulson@15077 ` 2014` ```apply (drule cos_zero_lemma, assumption+) ``` paulson@15077 ` 2015` ```apply (cut_tac x="-x" in cos_zero_lemma, simp, simp) ``` paulson@15077 ` 2016` ```apply (force simp add: minus_equation_iff [of x]) ``` paulson@15077 ` 2017` ```apply (auto simp only: odd_Suc_mult_two_ex real_of_nat_Suc left_distrib) ``` nipkow@15539 ` 2018` ```apply (auto simp add: cos_add) ``` paulson@15077 ` 2019` ```done ``` paulson@15077 ` 2020` paulson@15077 ` 2021` ```(* ditto: but to a lesser extent *) ``` paulson@15229 ` 2022` ```lemma sin_zero_iff: ``` paulson@15229 ` 2023` ``` "(sin x = 0) = ``` paulson@15077 ` 2024` ``` ((\n::nat. even n & (x = real n * (pi/2))) | ``` paulson@15077 ` 2025` ``` (\n::nat. even n & (x = -(real n * (pi/2)))))" ``` paulson@15077 ` 2026` ```apply (rule iffI) ``` paulson@15077 ` 2027` ```apply (cut_tac linorder_linear [of 0 x], safe) ``` paulson@15077 ` 2028` ```apply (drule sin_zero_lemma, assumption+) ``` paulson@15077 ` 2029` ```apply (cut_tac x="-x" in sin_zero_lemma, simp, simp, safe) ``` paulson@15077 ` 2030` ```apply (force simp add: minus_equation_iff [of x]) ``` nipkow@15539 ` 2031` ```apply (auto simp add: even_mult_two_ex) ``` paulson@15077 ` 2032` ```done ``` paulson@15077 ` 2033` hoelzl@29803 ` 2034` ```lemma cos_monotone_0_pi: assumes "0 \ y" and "y < x" and "x \ pi" ``` hoelzl@29803 ` 2035` ``` shows "cos x < cos y" ``` hoelzl@29803 ` 2036` ```proof - ``` hoelzl@29803 ` 2037` ``` have "- (x - y) < 0" by (auto!) ``` hoelzl@29803 ` 2038` hoelzl@29803 ` 2039` ``` from MVT2[OF `y < x` DERIV_cos[THEN impI, THEN allI]] ``` hoelzl@29803 ` 2040` ``` obtain z where "y < z" and "z < x" and cos_diff: "cos x - cos y = (x - y) * - sin z" by auto ``` hoelzl@29803 ` 2041` ``` hence "0 < z" and "z < pi" by (auto!) ``` hoelzl@29803 ` 2042` ``` hence "0 < sin z" using sin_gt_zero_pi by auto ``` hoelzl@29803 ` 2043` ``` hence "cos x - cos y < 0" unfolding cos_diff minus_mult_commute[symmetric] using `- (x - y) < 0` by (rule mult_pos_neg2) ``` hoelzl@29803 ` 2044` ``` thus ?thesis by auto ``` hoelzl@29803 ` 2045` ```qed ``` hoelzl@29803 ` 2046` hoelzl@29803 ` 2047` ```lemma cos_monotone_0_pi': assumes "0 \ y" and "y \ x" and "x \ pi" shows "cos x \ cos y" ``` hoelzl@29803 ` 2048` ```proof (cases "y < x") ``` hoelzl@29803 ` 2049` ``` case True show ?thesis using cos_monotone_0_pi[OF `0 \ y` True `x \ pi`] by auto ``` hoelzl@29803 ` 2050` ```next ``` hoelzl@29803 ` 2051` ``` case False hence "y = x" using `y \ x` by auto ``` hoelzl@29803 ` 2052` ``` thus ?thesis by auto ``` hoelzl@29803 ` 2053` ```qed ``` hoelzl@29803 ` 2054` hoelzl@29803 ` 2055` ```lemma cos_monotone_minus_pi_0: assumes "-pi \ y" and "y < x" and "x \ 0" ``` hoelzl@29803 ` 2056` ``` shows "cos y < cos x" ``` hoelzl@29803 ` 2057` ```proof - ``` hoelzl@29803 ` 2058` ``` have "0 \ -x" and "-x < -y" and "-y \ pi" by (auto!) ``` hoelzl@29803 ` 2059` ``` from cos_monotone_0_pi[OF this] ``` hoelzl@29803 ` 2060` ``` show ?thesis unfolding cos_minus . ``` hoelzl@29803 ` 2061` ```qed ``` hoelzl@29803 ` 2062` hoelzl@29803 ` 2063` ```lemma cos_monotone_minus_pi_0': assumes "-pi \ y" and "y \ x" and "x \ 0" shows "cos y \ cos x" ``` hoelzl@29803 ` 2064` ```proof (cases "y < x") ``` hoelzl@29803 ` 2065` ``` case True show ?thesis using cos_monotone_minus_pi_0[OF `-pi \ y` True `x \ 0`] by auto ``` hoelzl@29803 ` 2066` ```next ``` hoelzl@29803 ` 2067` ``` case False hence "y = x" using `y \ x` by auto ``` hoelzl@29803 ` 2068` ``` thus ?thesis by auto ``` hoelzl@29803 ` 2069` ```qed ``` hoelzl@29803 ` 2070` hoelzl@29803 ` 2071` ```lemma sin_monotone_2pi': assumes "- (pi / 2) \ y" and "y \ x" and "x \ pi / 2" shows "sin y \ sin x" ``` hoelzl@29803 ` 2072` ```proof - ``` hoelzl@29803 ` 2073` ``` have "0 \ y + pi / 2" and "y + pi / 2 \ x + pi / 2" and "x + pi /2 \ pi" using pi_ge_two by (auto!) ``` hoelzl@29803 ` 2074` ``` from cos_monotone_0_pi'[OF this] show ?thesis unfolding minus_sin_cos_eq[symmetric] by auto ``` hoelzl@29803 ` 2075` ```qed ``` paulson@15077 ` 2076` huffman@29164 ` 2077` ```subsection {* Tangent *} ``` paulson@15077 ` 2078` huffman@23043 ` 2079` ```definition ``` huffman@23043 ` 2080` ``` tan :: "real => real" where ``` huffman@23043 ` 2081` ``` "tan x = (sin x)/(cos x)" ``` huffman@23043 ` 2082` paulson@15077 ` 2083` ```lemma tan_zero [simp]: "tan 0 = 0" ``` paulson@15077 ` 2084` ```by (simp add: tan_def) ``` paulson@15077 ` 2085` paulson@15077 ` 2086` ```lemma tan_pi [simp]: "tan pi = 0" ``` paulson@15077 ` 2087` ```by (simp add: tan_def) ``` paulson@15077 ` 2088` paulson@15077 ` 2089` ```lemma tan_npi [simp]: "tan (real (n::nat) * pi) = 0" ``` paulson@15077 ` 2090` ```by (simp add: tan_def) ``` paulson@15077 ` 2091` paulson@15077 ` 2092` ```lemma tan_minus [simp]: "tan (-x) = - tan x" ``` paulson@15077 ` 2093` ```by (simp add: tan_def minus_mult_left) ``` paulson@15077 ` 2094` paulson@15077 ` 2095` ```lemma tan_periodic [simp]: "tan (x + 2*pi) = tan x" ``` paulson@15077 ` 2096` ```by (simp add: tan_def) ``` paulson@15077 ` 2097` paulson@15077 ` 2098` ```lemma lemma_tan_add1: ``` paulson@15077 ` 2099` ``` "[| cos x \ 0; cos y \ 0 |] ``` paulson@15077 ` 2100` ``` ==> 1 - tan(x)*tan(y) = cos (x + y)/(cos x * cos y)" ``` paulson@15229 ` 2101` ```apply (simp add: tan_def divide_inverse) ``` paulson@15229 ` 2102` ```apply (auto simp del: inverse_mult_distrib ``` paulson@15229 ` 2103` ``` simp add: inverse_mult_distrib [symmetric] mult_ac) ``` paulson@15077 ` 2104` ```apply (rule_tac c1 = "cos x * cos y" in real_mult_right_cancel [THEN subst]) ``` paulson@15229 ` 2105` ```apply (auto simp del: inverse_mult_distrib ``` paulson@15229 ` 2106` ``` simp add: mult_assoc left_diff_distrib cos_add) ``` nipkow@29667 ` 2107` ```done ``` paulson@15077 ` 2108` paulson@15077 ` 2109` ```lemma add_tan_eq: ``` paulson@15077 ` 2110` ``` "[| cos x \ 0; cos y \ 0 |] ``` paulson@15077 ` 2111` ``` ==> tan x + tan y = sin(x + y)/(cos x * cos y)" ``` paulson@15229 ` 2112` ```apply (simp add: tan_def) ``` paulson@15077 ` 2113` ```apply (rule_tac c1 = "cos x * cos y" in real_mult_right_cancel [THEN subst]) ``` paulson@15077 ` 2114` ```apply (auto simp add: mult_assoc left_distrib) ``` nipkow@15539 ` 2115` ```apply (simp add: sin_add) ``` paulson@15077 ` 2116` ```done ``` paulson@15077 ` 2117` paulson@15229 ` 2118` ```lemma tan_add: ``` paulson@15229 ` 2119` ``` "[| cos x \ 0; cos y \ 0; cos (x + y) \ 0 |] ``` paulson@15077 ` 2120` ``` ==> tan(x + y) = (tan(x) + tan(y))/(1 - tan(x) * tan(y))" ``` paulson@15077 ` 2121` ```apply (simp (no_asm_simp) add: add_tan_eq lemma_tan_add1) ``` paulson@15077 ` 2122` ```apply (simp add: tan_def) ``` paulson@15077 ` 2123` ```done ``` paulson@15077 ` 2124` paulson@15229 ` 2125` ```lemma tan_double: ``` paulson@15229 ` 2126` ``` "[| cos x \ 0; cos (2 * x) \ 0 |] ``` paulson@15077 ` 2127` ``` ==> tan (2 * x) = (2 * tan x)/(1 - (tan(x) ^ 2))" ``` paulson@15077 ` 2128` ```apply (insert tan_add [of x x]) ``` paulson@15077 ` 2129` ```apply (simp add: mult_2 [symmetric]) ``` paulson@15077 ` 2130` ```apply (auto simp add: numeral_2_eq_2) ``` paulson@15077 ` 2131` ```done ``` paulson@15077 ` 2132` paulson@15077 ` 2133` ```lemma tan_gt_zero: "[| 0 < x; x < pi/2 |] ==> 0 < tan x" ``` paulson@15229 ` 2134` ```by (simp add: tan_def zero_less_divide_iff sin_gt_zero2 cos_gt_zero_pi) ``` paulson@15077 ` 2135` paulson@15077 ` 2136` ```lemma tan_less_zero: ``` paulson@15077 ` 2137` ``` assumes lb: "- pi/2 < x" and "x < 0" shows "tan x < 0" ``` paulson@15077 ` 2138` ```proof - ``` paulson@15077 ` 2139` ``` have "0 < tan (- x)" using prems by (simp only: tan_gt_zero) ``` paulson@15077 ` 2140` ``` thus ?thesis by simp ``` paulson@15077 ` 2141` ```qed ``` paulson@15077 ` 2142` hoelzl@29803 ` 2143` ```lemma tan_half: fixes x :: real assumes "- (pi / 2) < x" and "x < pi / 2" ``` hoelzl@29803 ` 2144` ``` shows "tan x = sin (2 * x) / (cos (2 * x) + 1)" ``` hoelzl@29803 ` 2145` ```proof - ``` hoelzl@29803 ` 2146` ``` from cos_gt_zero_pi[OF `- (pi / 2) < x` `x < pi / 2`] ``` hoelzl@29803 ` 2147` ``` have "cos x \ 0" by auto ``` hoelzl@29803 ` 2148` hoelzl@29803 ` 2149` ``` have minus_cos_2x: "\X. X - cos (2*x) = X - (cos x) ^ 2 + (sin x) ^ 2" unfolding cos_double by algebra ``` hoelzl@29803 ` 2150` hoelzl@29803 ` 2151` ``` have "tan x = (tan x + tan x) / 2" by auto ``` hoelzl@29803 ` 2152` ``` also have "\ = sin (x + x) / (cos x * cos x) / 2" unfolding add_tan_eq[OF `cos x \ 0` `cos x \ 0`] .. ``` hoelzl@29803 ` 2153` ``` also have "\ = sin (2 * x) / ((cos x) ^ 2 + (cos x) ^ 2 + cos (2*x) - cos (2*x))" unfolding divide_divide_eq_left numeral_2_eq_2 by auto ``` hoelzl@29803 ` 2154` ``` also have "\ = sin (2 * x) / ((cos x) ^ 2 + cos (2*x) + (sin x)^2)" unfolding minus_cos_2x by auto ``` hoelzl@29803 ` 2155` ``` also have "\ = sin (2 * x) / (cos (2*x) + 1)" by auto ``` hoelzl@29803 ` 2156` ``` finally show ?thesis . ``` hoelzl@29803 ` 2157` ```qed ``` hoelzl@29803 ` 2158` paulson@15077 ` 2159` ```lemma lemma_DERIV_tan: ``` paulson@15077 ` 2160` ``` "cos x \ 0 ==> DERIV (%x. sin(x)/cos(x)) x :> inverse((cos x)\)" ``` paulson@15077 ` 2161` ```apply (rule lemma_DERIV_subst) ``` paulson@15077 ` 2162` ```apply (best intro!: DERIV_intros intro: DERIV_chain2) ``` paulson@15079 ` 2163` ```apply (auto simp add: divide_inverse numeral_2_eq_2) ``` paulson@15077 ` 2164` ```done ``` paulson@15077 ` 2165` paulson@15077 ` 2166` ```lemma DERIV_tan [simp]: "cos x \ 0 ==> DERIV tan x :> inverse((cos x)\)" ``` paulson@15077 ` 2167` ```by (auto dest: lemma_DERIV_tan simp add: tan_def [symmetric]) ``` paulson@15077 ` 2168` huffman@23045 ` 2169` ```lemma isCont_tan [simp]: "cos x \ 0 ==> isCont tan x" ``` huffman@23045 ` 2170` ```by (rule DERIV_tan [THEN DERIV_isCont]) ``` huffman@23045 ` 2171` paulson@15077 ` 2172` ```lemma LIM_cos_div_sin [simp]: "(%x. cos(x)/sin(x)) -- pi/2 --> 0" ``` paulson@15077 ` 2173` ```apply (subgoal_tac "(\x. cos x * inverse (sin x)) -- pi * inverse 2 --> 0*1") ``` paulson@15229 ` 2174` ```apply (simp add: divide_inverse [symmetric]) ``` huffman@22613 ` 2175` ```apply (rule LIM_mult) ``` paulson@15077 ` 2176` ```apply (rule_tac [2] inverse_1 [THEN subst]) ``` paulson@15077 ` 2177` ```apply (rule_tac [2] LIM_inverse) ``` paulson@15077 ` 2178` ```apply (simp_all add: divide_inverse [symmetric]) ``` paulson@15077 ` 2179` ```apply (simp_all only: isCont_def [symmetric] cos_pi_half [symmetric] sin_pi_half [symmetric]) ``` paulson@15077 ` 2180` ```apply (blast intro!: DERIV_isCont DERIV_sin DERIV_cos)+ ``` paulson@15077 ` 2181` ```done ``` paulson@15077 ` 2182` paulson@15077 ` 2183` ```lemma lemma_tan_total: "0 < y ==> \x. 0 < x & x < pi/2 & y < tan x" ``` paulson@15077 ` 2184` ```apply (cut_tac LIM_cos_div_sin) ``` paulson@15077 ` 2185` ```apply (simp only: LIM_def) ``` paulson@15077 ` 2186` ```apply (drule_tac x = "inverse y" in spec, safe, force) ``` paulson@15077 ` 2187` ```apply (drule_tac ?d1.0 = s in pi_half_gt_zero [THEN [2] real_lbound_gt_zero], safe) ``` paulson@15229 ` 2188` ```apply (rule_tac x = "(pi/2) - e" in exI) ``` paulson@15077 ` 2189` ```apply (simp (no_asm_simp)) ``` paulson@15229 ` 2190` ```apply (drule_tac x = "(pi/2) - e" in spec) ``` paulson@15229 ` 2191` ```apply (auto simp add: tan_def) ``` paulson@15077 ` 2192` ```apply (rule inverse_less_iff_less [THEN iffD1]) ``` paulson@15079 ` 2193` ```apply (auto simp add: divide_inverse) ``` paulson@15229 ` 2194` ```apply (rule real_mult_order) ``` paulson@15229 ` 2195` ```apply (subgoal_tac [3] "0 < sin e & 0 < cos e") ``` paulson@15229 ` 2196` ```apply (auto intro: cos_gt_zero sin_gt_zero2 simp add: mult_commute) ``` paulson@15077 ` 2197` ```done ``` paulson@15077 ` 2198` paulson@15077 ` 2199` ```lemma tan_total_pos: "0 \ y ==> \x. 0 \ x & x < pi/2 & tan x = y" ``` huffman@22998 ` 2200` ```apply (frule order_le_imp_less_or_eq, safe) ``` paulson@15077 ` 2201` ``` prefer 2 apply force ``` paulson@15077 ` 2202` ```apply (drule lemma_tan_total, safe) ``` paulson@15077 ` 2203` ```apply (cut_tac f = tan and a = 0 and b = x and y = y in IVT_objl) ``` paulson@15077 ` 2204` ```apply (auto intro!: DERIV_tan [THEN DERIV_isCont]) ``` paulson@15077 ` 2205` ```apply (drule_tac y = xa in order_le_imp_less_or_eq) ``` paulson@15077 ` 2206` ```apply (auto dest: cos_gt_zero) ``` paulson@15077 ` 2207` ```done ``` paulson@15077 ` 2208` paulson@15077 ` 2209` ```lemma lemma_tan_total1: "\x. -(pi/2) < x & x < (pi/2) & tan x = y" ``` paulson@15077 ` 2210` ```apply (cut_tac linorder_linear [of 0 y], safe) ``` paulson@15077 ` 2211` ```apply (drule tan_total_pos) ``` paulson@15077 ` 2212` ```apply (cut_tac [2] y="-y" in tan_total_pos, safe) ``` paulson@15077 ` 2213` ```apply (rule_tac [3] x = "-x" in exI) ``` paulson@15077 ` 2214` ```apply (auto intro!: exI) ``` paulson@15077 ` 2215` ```done ``` paulson@15077 ` 2216` paulson@15077 ` 2217` ```lemma tan_total: "EX! x. -(pi/2) < x & x < (pi/2) & tan x = y" ``` paulson@15077 ` 2218` ```apply (cut_tac y = y in lemma_tan_total1, auto) ``` paulson@15077 ` 2219` ```apply (cut_tac x = xa and y = y in linorder_less_linear, auto) ``` paulson@15077 ` 2220` ```apply (subgoal_tac [2] "\z. y < z & z < xa & DERIV tan z :> 0") ``` paulson@15077 ` 2221` ```apply (subgoal_tac "\z. xa < z & z < y & DERIV tan z :> 0") ``` paulson@15077 ` 2222` ```apply (rule_tac [4] Rolle) ``` paulson@15077 ` 2223` ```apply (rule_tac [2] Rolle) ``` paulson@15077 ` 2224` ```apply (auto intro!: DERIV_tan DERIV_isCont exI ``` paulson@15077 ` 2225` ``` simp add: differentiable_def) ``` paulson@15077 ` 2226` ```txt{*Now, simulate TRYALL*} ``` paulson@15077 ` 2227` ```apply (rule_tac [!] DERIV_tan asm_rl) ``` paulson@15077 ` 2228` ```apply (auto dest!: DERIV_unique [OF _ DERIV_tan] ``` huffman@22998 ` 2229` ``` simp add: cos_gt_zero_pi [THEN less_imp_neq, THEN not_sym]) ``` paulson@15077 ` 2230` ```done ``` paulson@15077 ` 2231` hoelzl@29803 ` 2232` ```lemma tan_monotone: assumes "- (pi / 2) < y" and "y < x" and "x < pi / 2" ``` hoelzl@29803 ` 2233` ``` shows "tan y < tan x" ``` hoelzl@29803 ` 2234` ```proof - ``` hoelzl@29803 ` 2235` ``` have "\ x'. y \ x' \ x' \ x \ DERIV tan x' :> inverse (cos x'^2)" ``` hoelzl@29803 ` 2236` ``` proof (rule allI, rule impI) ``` hoelzl@29803 ` 2237` ``` fix x' :: real assume "y \ x' \ x' \ x" ``` hoelzl@29803 ` 2238` ``` hence "-(pi/2) < x'" and "x' < pi/2" by (auto!) ``` hoelzl@29803 ` 2239` ``` from cos_gt_zero_pi[OF this] ``` hoelzl@29803 ` 2240` ``` have "cos x' \ 0" by auto ``` hoelzl@29803 ` 2241` ``` thus "DERIV tan x' :> inverse (cos x'^2)" by (rule DERIV_tan) ``` hoelzl@29803 ` 2242` ``` qed ``` hoelzl@29803 ` 2243` ``` from MVT2[OF `y < x` this] ``` hoelzl@29803 ` 2244` ``` obtain z where "y < z" and "z < x" and tan_diff: "tan x - tan y = (x - y) * inverse ((cos z)\)" by auto ``` hoelzl@29803 ` 2245` ``` hence "- (pi / 2) < z" and "z < pi / 2" by (auto!) ``` hoelzl@29803 ` 2246` ``` hence "0 < cos z" using cos_gt_zero_pi by auto ``` hoelzl@29803 ` 2247` ``` hence inv_pos: "0 < inverse ((cos z)\)" by auto ``` hoelzl@29803 ` 2248` ``` have "0 < x - y" using `y < x` by auto ``` hoelzl@29803 ` 2249` ``` from real_mult_order[OF this inv_pos] ``` hoelzl@29803 ` 2250` ``` have "0 < tan x - tan y" unfolding tan_diff by auto ``` hoelzl@29803 ` 2251` ``` thus ?thesis by auto ``` hoelzl@29803 ` 2252` ```qed ``` hoelzl@29803 ` 2253` hoelzl@29803 ` 2254` ```lemma tan_monotone': assumes "- (pi / 2) < y" and "y < pi / 2" and "- (pi / 2) < x" and "x < pi / 2" ``` hoelzl@29803 ` 2255` ``` shows "(y < x) = (tan y < tan x)" ``` hoelzl@29803 ` 2256` ```proof ``` hoelzl@29803 ` 2257` ``` assume "y < x" thus "tan y < tan x" using tan_monotone and `- (pi / 2) < y` and `x < pi / 2` by auto ``` hoelzl@29803 ` 2258` ```next ``` hoelzl@29803 ` 2259` ``` assume "tan y < tan x" ``` hoelzl@29803 ` 2260` ``` show "y < x" ``` hoelzl@29803 ` 2261` ``` proof (rule ccontr) ``` hoelzl@29803 ` 2262` ``` assume "\ y < x" hence "x \ y" by auto ``` hoelzl@29803 ` 2263` ``` hence "tan x \ tan y" ``` hoelzl@29803 ` 2264` ``` proof (cases "x = y") ``` hoelzl@29803 ` 2265` ``` case True thus ?thesis by auto ``` hoelzl@29803 ` 2266` ``` next ``` hoelzl@29803 ` 2267` ``` case False hence "x < y" using `x \ y` by auto ``` hoelzl@29803 ` 2268` ``` from tan_monotone[OF `- (pi/2) < x` this `y < pi / 2`] show ?thesis by auto ``` hoelzl@29803 ` 2269` ``` qed ``` hoelzl@29803 ` 2270` ``` thus False using `tan y < tan x` by auto ``` hoelzl@29803 ` 2271` ``` qed ``` hoelzl@29803 ` 2272` ```qed ``` hoelzl@29803 ` 2273` hoelzl@29803 ` 2274` ```lemma tan_inverse: "1 / (tan y) = tan (pi / 2 - y)" unfolding tan_def sin_cos_eq[of y] cos_sin_eq[of y] by auto ``` hoelzl@29803 ` 2275` hoelzl@29803 ` 2276` ```lemma tan_periodic_pi[simp]: "tan (x + pi) = tan x" ``` hoelzl@29803 ` 2277` ``` by (simp add: tan_def) ``` hoelzl@29803 ` 2278` hoelzl@29803 ` 2279` ```lemma tan_periodic_nat[simp]: fixes n :: nat shows "tan (x + real n * pi) = tan x" ``` hoelzl@29803 ` 2280` ```proof (induct n arbitrary: x) ``` hoelzl@29803 ` 2281` ``` case (Suc n) ``` hoelzl@29803 ` 2282` ``` have split_pi_off: "x + real (Suc n) * pi = (x + real n * pi) + pi" unfolding Suc_plus1 real_of_nat_add real_of_one real_add_mult_distrib by auto ``` hoelzl@29803 ` 2283` ``` show ?case unfolding split_pi_off using Suc by auto ``` hoelzl@29803 ` 2284` ```qed auto ``` hoelzl@29803 ` 2285` hoelzl@29803 ` 2286` ```lemma tan_periodic_int[simp]: fixes i :: int shows "tan (x + real i * pi) = tan x" ``` hoelzl@29803 ` 2287` ```proof (cases "0 \ i") ``` hoelzl@29803 ` 2288` ``` case True hence i_nat: "real i = real (nat i)" by auto ``` hoelzl@29803 ` 2289` ``` show ?thesis unfolding i_nat by auto ``` hoelzl@29803 ` 2290` ```next ``` hoelzl@29803 ` 2291` ``` case False hence i_nat: "real i = - real (nat (-i))" by auto ``` hoelzl@29803 ` 2292` ``` have "tan x = tan (x + real i * pi - real i * pi)" by auto ``` hoelzl@29803 ` 2293` ``` also have "\ = tan (x + real i * pi)" unfolding i_nat mult_minus_left diff_minus_eq_add by (rule tan_periodic_nat) ``` hoelzl@29803 ` 2294` ``` finally show ?thesis by auto ``` hoelzl@29803 ` 2295` ```qed ``` hoelzl@29803 ` 2296` hoelzl@29803 ` 2297` ```lemma tan_periodic_n[simp]: "tan (x + number_of n * pi) = tan x" ``` hoelzl@29803 ` 2298` ``` using tan_periodic_int[of _ "number_of n" ] unfolding real_number_of . ``` huffman@23043 ` 2299` huffman@23043 ` 2300` ```subsection {* Inverse Trigonometric Functions *} ``` huffman@23043 ` 2301` huffman@23043 ` 2302` ```definition ``` huffman@23043 ` 2303` ``` arcsin :: "real => real" where ``` huffman@23043 ` 2304` ``` "arcsin y = (THE x. -(pi/2) \ x & x \ pi/2 & sin x = y)" ``` huffman@23043 ` 2305` huffman@23043 ` 2306` ```definition ``` huffman@23043 ` 2307` ``` arccos :: "real => real" where ``` huffman@23043 ` 2308` ``` "arccos y = (THE x. 0 \ x & x \ pi & cos x = y)" ``` huffman@23043 ` 2309` huffman@23043 ` 2310` ```definition ``` huffman@23043 ` 2311` ``` arctan :: "real => real" where ``` huffman@23043 ` 2312` ``` "arctan y = (THE x. -(pi/2) < x & x < pi/2 & tan x = y)" ``` huffman@23043 ` 2313` paulson@15229 ` 2314` ```lemma arcsin: ``` paulson@15229 ` 2315` ``` "[| -1 \ y; y \ 1 |] ``` paulson@15077 ` 2316` ``` ==> -(pi/2) \ arcsin y & ``` paulson@15077 ` 2317` ``` arcsin y \ pi/2 & sin(arcsin y) = y" ``` huffman@23011 ` 2318` ```unfolding arcsin_def by (rule theI' [OF sin_total]) ``` huffman@23011 ` 2319` huffman@23011 ` 2320` ```lemma arcsin_pi: ``` huffman@23011 ` 2321` ``` "[| -1 \ y; y \ 1 |] ``` huffman@23011 ` 2322` ``` ==> -(pi/2) \ arcsin y & arcsin y \ pi & sin(arcsin y) = y" ``` huffman@23011 ` 2323` ```apply (drule (1) arcsin) ``` huffman@23011 ` 2324` ```apply (force intro: order_trans) ``` paulson@15077 ` 2325` ```done ``` paulson@15077 ` 2326` paulson@15077 ` 2327` ```lemma sin_arcsin [simp]: "[| -1 \ y; y \ 1 |] ==> sin(arcsin y) = y" ``` paulson@15077 ` 2328` ```by (blast dest: arcsin) ``` paulson@15077 ` 2329` ``` ``` paulson@15077 ` 2330` ```lemma arcsin_bounded: ``` paulson@15077 ` 2331` ``` "[| -1 \ y; y \ 1 |] ==> -(pi/2) \ arcsin y & arcsin y \ pi/2" ``` paulson@15077 ` 2332` ```by (blast dest: arcsin) ``` paulson@15077 ` 2333` paulson@15077 ` 2334` ```lemma arcsin_lbound: "[| -1 \ y; y \ 1 |] ==> -(pi/2) \ arcsin y" ``` paulson@15077 ` 2335` ```by (blast dest: arcsin) ``` paulson@15077 ` 2336` paulson@15077 ` 2337` ```lemma arcsin_ubound: "[| -1 \ y; y \ 1 |] ==> arcsin y \ pi/2" ``` paulson@15077 ` 2338` ```by (blast dest: arcsin) ``` paulson@15077 ` 2339` paulson@15077 ` 2340` ```lemma arcsin_lt_bounded: ``` paulson@15077 ` 2341` ``` "[| -1 < y; y < 1 |] ==> -(pi/2) < arcsin y & arcsin y < pi/2" ``` paulson@15077 ` 2342` ```apply (frule order_less_imp_le) ``` paulson@15077 ` 2343` ```apply (frule_tac y = y in order_less_imp_le) ``` paulson@15077 ` 2344` ```apply (frule arcsin_bounded) ``` paulson@15077 ` 2345` ```apply (safe, simp) ``` paulson@15077 ` 2346` ```apply (drule_tac y = "arcsin y" in order_le_imp_less_or_eq) ``` paulson@15077 ` 2347` ```apply (drule_tac [2] y = "pi/2" in order_le_imp_less_or_eq, safe) ``` paulson@15077 ` 2348` ```apply (drule_tac [!] f = sin in arg_cong, auto) ``` paulson@15077 ` 2349` ```done ``` paulson@15077 ` 2350` paulson@15077 ` 2351` ```lemma arcsin_sin: "[|-(pi/2) \ x; x \ pi/2 |] ==> arcsin(sin x) = x" ``` paulson@15077 ` 2352` ```apply (unfold arcsin_def) ``` huffman@23011 ` 2353` ```apply (rule the1_equality) ``` paulson@15077 ` 2354` ```apply (rule sin_total, auto) ``` paulson@15077 ` 2355` ```done ``` paulson@15077 ` 2356` huffman@22975 ` 2357` ```lemma arccos: ``` paulson@15229 ` 2358` ``` "[| -1 \ y; y \ 1 |] ``` huffman@22975 ` 2359` ``` ==> 0 \ arccos y & arccos y \ pi & cos(arccos y) = y" ``` huffman@23011 ` 2360` ```unfolding arccos_def by (rule theI' [OF cos_total]) ``` paulson@15077 ` 2361` huffman@22975 ` 2362` ```lemma cos_arccos [simp]: "[| -1 \ y; y \ 1 |] ==> cos(arccos y) = y" ``` huffman@22975 ` 2363` ```by (blast dest: arccos) ``` paulson@15077 ` 2364` ``` ``` huffman@22975 ` 2365` ```lemma arccos_bounded: "[| -1 \ y; y \ 1 |] ==> 0 \ arccos y & arccos y \ pi" ``` huffman@22975 ` 2366` ```by (blast dest: arccos) ``` paulson@15077 ` 2367` huffman@22975 ` 2368` ```lemma arccos_lbound: "[| -1 \ y; y \ 1 |] ==> 0 \ arccos y" ``` huffman@22975 ` 2369` ```by (blast dest: arccos) ``` paulson@15077 ` 2370` huffman@22975 ` 2371` ```lemma arccos_ubound: "[| -1 \ y; y \ 1 |] ==> arccos y \ pi" ``` huffman@22975 ` 2372` ```by (blast dest: arccos) ``` paulson@15077 ` 2373` huffman@22975 ` 2374` ```lemma arccos_lt_bounded: ``` paulson@15229 ` 2375` ``` "[| -1 < y; y < 1 |] ``` huffman@22975 ` 2376` ``` ==> 0 < arccos y & arccos y < pi" ``` paulson@15077 ` 2377` ```apply (frule order_less_imp_le) ``` paulson@15077 ` 2378` ```apply (frule_tac y = y in order_less_imp_le) ``` huffman@22975 ` 2379` ```apply (frule arccos_bounded, auto) ``` huffman@22975 ` 2380` ```apply (drule_tac y = "arccos y" in order_le_imp_less_or_eq) ``` paulson@15077 ` 2381` ```apply (drule_tac [2] y = pi in order_le_imp_less_or_eq, auto) ``` paulson@15077 ` 2382` ```apply (drule_tac [!] f = cos in arg_cong, auto) ``` paulson@15077 ` 2383` ```done ``` paulson@15077 ` 2384`