src/HOL/Real_Vector_Spaces.thy
 author blanchet Thu Sep 11 18:54:36 2014 +0200 (2014-09-11) changeset 58306 117ba6cbe414 parent 57514 bdc2c6b40bf2 child 58889 5b7a9633cfa8 permissions -rw-r--r--
renamed 'rep_datatype' to 'old_rep_datatype' (HOL)
 hoelzl@51524 ` 1` ```(* Title: HOL/Real_Vector_Spaces.thy ``` haftmann@27552 ` 2` ``` Author: Brian Huffman ``` hoelzl@51531 ` 3` ``` Author: Johannes Hölzl ``` huffman@20504 ` 4` ```*) ``` huffman@20504 ` 5` huffman@20504 ` 6` ```header {* Vector Spaces and Algebras over the Reals *} ``` huffman@20504 ` 7` hoelzl@51524 ` 8` ```theory Real_Vector_Spaces ``` hoelzl@51531 ` 9` ```imports Real Topological_Spaces ``` huffman@20504 ` 10` ```begin ``` huffman@20504 ` 11` huffman@20504 ` 12` ```subsection {* Locale for additive functions *} ``` huffman@20504 ` 13` huffman@20504 ` 14` ```locale additive = ``` huffman@20504 ` 15` ``` fixes f :: "'a::ab_group_add \ 'b::ab_group_add" ``` huffman@20504 ` 16` ``` assumes add: "f (x + y) = f x + f y" ``` huffman@27443 ` 17` ```begin ``` huffman@20504 ` 18` huffman@27443 ` 19` ```lemma zero: "f 0 = 0" ``` huffman@20504 ` 20` ```proof - ``` huffman@20504 ` 21` ``` have "f 0 = f (0 + 0)" by simp ``` huffman@20504 ` 22` ``` also have "\ = f 0 + f 0" by (rule add) ``` huffman@20504 ` 23` ``` finally show "f 0 = 0" by simp ``` huffman@20504 ` 24` ```qed ``` huffman@20504 ` 25` huffman@27443 ` 26` ```lemma minus: "f (- x) = - f x" ``` huffman@20504 ` 27` ```proof - ``` huffman@20504 ` 28` ``` have "f (- x) + f x = f (- x + x)" by (rule add [symmetric]) ``` huffman@20504 ` 29` ``` also have "\ = - f x + f x" by (simp add: zero) ``` huffman@20504 ` 30` ``` finally show "f (- x) = - f x" by (rule add_right_imp_eq) ``` huffman@20504 ` 31` ```qed ``` huffman@20504 ` 32` huffman@27443 ` 33` ```lemma diff: "f (x - y) = f x - f y" ``` haftmann@54230 ` 34` ``` using add [of x "- y"] by (simp add: minus) ``` huffman@20504 ` 35` huffman@27443 ` 36` ```lemma setsum: "f (setsum g A) = (\x\A. f (g x))" ``` huffman@22942 ` 37` ```apply (cases "finite A") ``` huffman@22942 ` 38` ```apply (induct set: finite) ``` huffman@22942 ` 39` ```apply (simp add: zero) ``` huffman@22942 ` 40` ```apply (simp add: add) ``` huffman@22942 ` 41` ```apply (simp add: zero) ``` huffman@22942 ` 42` ```done ``` huffman@22942 ` 43` huffman@27443 ` 44` ```end ``` huffman@20504 ` 45` huffman@28029 ` 46` ```subsection {* Vector spaces *} ``` huffman@28029 ` 47` huffman@28029 ` 48` ```locale vector_space = ``` huffman@28029 ` 49` ``` fixes scale :: "'a::field \ 'b::ab_group_add \ 'b" ``` huffman@30070 ` 50` ``` assumes scale_right_distrib [algebra_simps]: ``` huffman@30070 ` 51` ``` "scale a (x + y) = scale a x + scale a y" ``` huffman@30070 ` 52` ``` and scale_left_distrib [algebra_simps]: ``` huffman@30070 ` 53` ``` "scale (a + b) x = scale a x + scale b x" ``` huffman@28029 ` 54` ``` and scale_scale [simp]: "scale a (scale b x) = scale (a * b) x" ``` huffman@28029 ` 55` ``` and scale_one [simp]: "scale 1 x = x" ``` huffman@28029 ` 56` ```begin ``` huffman@28029 ` 57` huffman@28029 ` 58` ```lemma scale_left_commute: ``` huffman@28029 ` 59` ``` "scale a (scale b x) = scale b (scale a x)" ``` haftmann@57512 ` 60` ```by (simp add: mult.commute) ``` huffman@28029 ` 61` huffman@28029 ` 62` ```lemma scale_zero_left [simp]: "scale 0 x = 0" ``` huffman@28029 ` 63` ``` and scale_minus_left [simp]: "scale (- a) x = - (scale a x)" ``` huffman@30070 ` 64` ``` and scale_left_diff_distrib [algebra_simps]: ``` huffman@30070 ` 65` ``` "scale (a - b) x = scale a x - scale b x" ``` huffman@44282 ` 66` ``` and scale_setsum_left: "scale (setsum f A) x = (\a\A. scale (f a) x)" ``` huffman@28029 ` 67` ```proof - ``` ballarin@29229 ` 68` ``` interpret s: additive "\a. scale a x" ``` haftmann@28823 ` 69` ``` proof qed (rule scale_left_distrib) ``` huffman@28029 ` 70` ``` show "scale 0 x = 0" by (rule s.zero) ``` huffman@28029 ` 71` ``` show "scale (- a) x = - (scale a x)" by (rule s.minus) ``` huffman@28029 ` 72` ``` show "scale (a - b) x = scale a x - scale b x" by (rule s.diff) ``` huffman@44282 ` 73` ``` show "scale (setsum f A) x = (\a\A. scale (f a) x)" by (rule s.setsum) ``` huffman@28029 ` 74` ```qed ``` huffman@28029 ` 75` huffman@28029 ` 76` ```lemma scale_zero_right [simp]: "scale a 0 = 0" ``` huffman@28029 ` 77` ``` and scale_minus_right [simp]: "scale a (- x) = - (scale a x)" ``` huffman@30070 ` 78` ``` and scale_right_diff_distrib [algebra_simps]: ``` huffman@30070 ` 79` ``` "scale a (x - y) = scale a x - scale a y" ``` huffman@44282 ` 80` ``` and scale_setsum_right: "scale a (setsum f A) = (\x\A. scale a (f x))" ``` huffman@28029 ` 81` ```proof - ``` ballarin@29229 ` 82` ``` interpret s: additive "\x. scale a x" ``` haftmann@28823 ` 83` ``` proof qed (rule scale_right_distrib) ``` huffman@28029 ` 84` ``` show "scale a 0 = 0" by (rule s.zero) ``` huffman@28029 ` 85` ``` show "scale a (- x) = - (scale a x)" by (rule s.minus) ``` huffman@28029 ` 86` ``` show "scale a (x - y) = scale a x - scale a y" by (rule s.diff) ``` huffman@44282 ` 87` ``` show "scale a (setsum f A) = (\x\A. scale a (f x))" by (rule s.setsum) ``` huffman@28029 ` 88` ```qed ``` huffman@28029 ` 89` huffman@28029 ` 90` ```lemma scale_eq_0_iff [simp]: ``` huffman@28029 ` 91` ``` "scale a x = 0 \ a = 0 \ x = 0" ``` huffman@28029 ` 92` ```proof cases ``` huffman@28029 ` 93` ``` assume "a = 0" thus ?thesis by simp ``` huffman@28029 ` 94` ```next ``` huffman@28029 ` 95` ``` assume anz [simp]: "a \ 0" ``` huffman@28029 ` 96` ``` { assume "scale a x = 0" ``` huffman@28029 ` 97` ``` hence "scale (inverse a) (scale a x) = 0" by simp ``` huffman@28029 ` 98` ``` hence "x = 0" by simp } ``` huffman@28029 ` 99` ``` thus ?thesis by force ``` huffman@28029 ` 100` ```qed ``` huffman@28029 ` 101` huffman@28029 ` 102` ```lemma scale_left_imp_eq: ``` huffman@28029 ` 103` ``` "\a \ 0; scale a x = scale a y\ \ x = y" ``` huffman@28029 ` 104` ```proof - ``` huffman@28029 ` 105` ``` assume nonzero: "a \ 0" ``` huffman@28029 ` 106` ``` assume "scale a x = scale a y" ``` huffman@28029 ` 107` ``` hence "scale a (x - y) = 0" ``` huffman@28029 ` 108` ``` by (simp add: scale_right_diff_distrib) ``` huffman@28029 ` 109` ``` hence "x - y = 0" by (simp add: nonzero) ``` huffman@28029 ` 110` ``` thus "x = y" by (simp only: right_minus_eq) ``` huffman@28029 ` 111` ```qed ``` huffman@28029 ` 112` huffman@28029 ` 113` ```lemma scale_right_imp_eq: ``` huffman@28029 ` 114` ``` "\x \ 0; scale a x = scale b x\ \ a = b" ``` huffman@28029 ` 115` ```proof - ``` huffman@28029 ` 116` ``` assume nonzero: "x \ 0" ``` huffman@28029 ` 117` ``` assume "scale a x = scale b x" ``` huffman@28029 ` 118` ``` hence "scale (a - b) x = 0" ``` huffman@28029 ` 119` ``` by (simp add: scale_left_diff_distrib) ``` huffman@28029 ` 120` ``` hence "a - b = 0" by (simp add: nonzero) ``` huffman@28029 ` 121` ``` thus "a = b" by (simp only: right_minus_eq) ``` huffman@28029 ` 122` ```qed ``` huffman@28029 ` 123` huffman@31586 ` 124` ```lemma scale_cancel_left [simp]: ``` huffman@28029 ` 125` ``` "scale a x = scale a y \ x = y \ a = 0" ``` huffman@28029 ` 126` ```by (auto intro: scale_left_imp_eq) ``` huffman@28029 ` 127` huffman@31586 ` 128` ```lemma scale_cancel_right [simp]: ``` huffman@28029 ` 129` ``` "scale a x = scale b x \ a = b \ x = 0" ``` huffman@28029 ` 130` ```by (auto intro: scale_right_imp_eq) ``` huffman@28029 ` 131` huffman@28029 ` 132` ```end ``` huffman@28029 ` 133` huffman@20504 ` 134` ```subsection {* Real vector spaces *} ``` huffman@20504 ` 135` haftmann@29608 ` 136` ```class scaleR = ``` haftmann@25062 ` 137` ``` fixes scaleR :: "real \ 'a \ 'a" (infixr "*\<^sub>R" 75) ``` haftmann@24748 ` 138` ```begin ``` huffman@20504 ` 139` huffman@20763 ` 140` ```abbreviation ``` haftmann@25062 ` 141` ``` divideR :: "'a \ real \ 'a" (infixl "'/\<^sub>R" 70) ``` haftmann@24748 ` 142` ```where ``` haftmann@25062 ` 143` ``` "x /\<^sub>R r == scaleR (inverse r) x" ``` haftmann@24748 ` 144` haftmann@24748 ` 145` ```end ``` haftmann@24748 ` 146` haftmann@24588 ` 147` ```class real_vector = scaleR + ab_group_add + ``` huffman@44282 ` 148` ``` assumes scaleR_add_right: "scaleR a (x + y) = scaleR a x + scaleR a y" ``` huffman@44282 ` 149` ``` and scaleR_add_left: "scaleR (a + b) x = scaleR a x + scaleR b x" ``` huffman@30070 ` 150` ``` and scaleR_scaleR: "scaleR a (scaleR b x) = scaleR (a * b) x" ``` huffman@30070 ` 151` ``` and scaleR_one: "scaleR 1 x = x" ``` huffman@20504 ` 152` wenzelm@30729 ` 153` ```interpretation real_vector: ``` ballarin@29229 ` 154` ``` vector_space "scaleR :: real \ 'a \ 'a::real_vector" ``` huffman@28009 ` 155` ```apply unfold_locales ``` huffman@44282 ` 156` ```apply (rule scaleR_add_right) ``` huffman@44282 ` 157` ```apply (rule scaleR_add_left) ``` huffman@28009 ` 158` ```apply (rule scaleR_scaleR) ``` huffman@28009 ` 159` ```apply (rule scaleR_one) ``` huffman@28009 ` 160` ```done ``` huffman@28009 ` 161` huffman@28009 ` 162` ```text {* Recover original theorem names *} ``` huffman@28009 ` 163` huffman@28009 ` 164` ```lemmas scaleR_left_commute = real_vector.scale_left_commute ``` huffman@28009 ` 165` ```lemmas scaleR_zero_left = real_vector.scale_zero_left ``` huffman@28009 ` 166` ```lemmas scaleR_minus_left = real_vector.scale_minus_left ``` huffman@44282 ` 167` ```lemmas scaleR_diff_left = real_vector.scale_left_diff_distrib ``` huffman@44282 ` 168` ```lemmas scaleR_setsum_left = real_vector.scale_setsum_left ``` huffman@28009 ` 169` ```lemmas scaleR_zero_right = real_vector.scale_zero_right ``` huffman@28009 ` 170` ```lemmas scaleR_minus_right = real_vector.scale_minus_right ``` huffman@44282 ` 171` ```lemmas scaleR_diff_right = real_vector.scale_right_diff_distrib ``` huffman@44282 ` 172` ```lemmas scaleR_setsum_right = real_vector.scale_setsum_right ``` huffman@28009 ` 173` ```lemmas scaleR_eq_0_iff = real_vector.scale_eq_0_iff ``` huffman@28009 ` 174` ```lemmas scaleR_left_imp_eq = real_vector.scale_left_imp_eq ``` huffman@28009 ` 175` ```lemmas scaleR_right_imp_eq = real_vector.scale_right_imp_eq ``` huffman@28009 ` 176` ```lemmas scaleR_cancel_left = real_vector.scale_cancel_left ``` huffman@28009 ` 177` ```lemmas scaleR_cancel_right = real_vector.scale_cancel_right ``` huffman@28009 ` 178` huffman@44282 ` 179` ```text {* Legacy names *} ``` huffman@44282 ` 180` huffman@44282 ` 181` ```lemmas scaleR_left_distrib = scaleR_add_left ``` huffman@44282 ` 182` ```lemmas scaleR_right_distrib = scaleR_add_right ``` huffman@44282 ` 183` ```lemmas scaleR_left_diff_distrib = scaleR_diff_left ``` huffman@44282 ` 184` ```lemmas scaleR_right_diff_distrib = scaleR_diff_right ``` huffman@44282 ` 185` huffman@31285 ` 186` ```lemma scaleR_minus1_left [simp]: ``` huffman@31285 ` 187` ``` fixes x :: "'a::real_vector" ``` huffman@31285 ` 188` ``` shows "scaleR (-1) x = - x" ``` huffman@31285 ` 189` ``` using scaleR_minus_left [of 1 x] by simp ``` huffman@31285 ` 190` haftmann@24588 ` 191` ```class real_algebra = real_vector + ring + ``` haftmann@25062 ` 192` ``` assumes mult_scaleR_left [simp]: "scaleR a x * y = scaleR a (x * y)" ``` haftmann@25062 ` 193` ``` and mult_scaleR_right [simp]: "x * scaleR a y = scaleR a (x * y)" ``` huffman@20504 ` 194` haftmann@24588 ` 195` ```class real_algebra_1 = real_algebra + ring_1 ``` huffman@20554 ` 196` haftmann@24588 ` 197` ```class real_div_algebra = real_algebra_1 + division_ring ``` huffman@20584 ` 198` haftmann@24588 ` 199` ```class real_field = real_div_algebra + field ``` huffman@20584 ` 200` huffman@30069 ` 201` ```instantiation real :: real_field ``` huffman@30069 ` 202` ```begin ``` huffman@30069 ` 203` huffman@30069 ` 204` ```definition ``` huffman@30069 ` 205` ``` real_scaleR_def [simp]: "scaleR a x = a * x" ``` huffman@30069 ` 206` huffman@30070 ` 207` ```instance proof ``` huffman@30070 ` 208` ```qed (simp_all add: algebra_simps) ``` huffman@20554 ` 209` huffman@30069 ` 210` ```end ``` huffman@30069 ` 211` wenzelm@30729 ` 212` ```interpretation scaleR_left: additive "(\a. scaleR a x::'a::real_vector)" ``` haftmann@28823 ` 213` ```proof qed (rule scaleR_left_distrib) ``` huffman@20504 ` 214` wenzelm@30729 ` 215` ```interpretation scaleR_right: additive "(\x. scaleR a x::'a::real_vector)" ``` haftmann@28823 ` 216` ```proof qed (rule scaleR_right_distrib) ``` huffman@20504 ` 217` huffman@20584 ` 218` ```lemma nonzero_inverse_scaleR_distrib: ``` huffman@21809 ` 219` ``` fixes x :: "'a::real_div_algebra" shows ``` huffman@21809 ` 220` ``` "\a \ 0; x \ 0\ \ inverse (scaleR a x) = scaleR (inverse a) (inverse x)" ``` huffman@20763 ` 221` ```by (rule inverse_unique, simp) ``` huffman@20584 ` 222` huffman@20584 ` 223` ```lemma inverse_scaleR_distrib: ``` haftmann@36409 ` 224` ``` fixes x :: "'a::{real_div_algebra, division_ring_inverse_zero}" ``` huffman@21809 ` 225` ``` shows "inverse (scaleR a x) = scaleR (inverse a) (inverse x)" ``` huffman@20584 ` 226` ```apply (case_tac "a = 0", simp) ``` huffman@20584 ` 227` ```apply (case_tac "x = 0", simp) ``` huffman@20584 ` 228` ```apply (erule (1) nonzero_inverse_scaleR_distrib) ``` huffman@20584 ` 229` ```done ``` huffman@20584 ` 230` huffman@20554 ` 231` huffman@20554 ` 232` ```subsection {* Embedding of the Reals into any @{text real_algebra_1}: ``` huffman@20554 ` 233` ```@{term of_real} *} ``` huffman@20554 ` 234` huffman@20554 ` 235` ```definition ``` wenzelm@21404 ` 236` ``` of_real :: "real \ 'a::real_algebra_1" where ``` huffman@21809 ` 237` ``` "of_real r = scaleR r 1" ``` huffman@20554 ` 238` huffman@21809 ` 239` ```lemma scaleR_conv_of_real: "scaleR r x = of_real r * x" ``` huffman@20763 ` 240` ```by (simp add: of_real_def) ``` huffman@20763 ` 241` huffman@20554 ` 242` ```lemma of_real_0 [simp]: "of_real 0 = 0" ``` huffman@20554 ` 243` ```by (simp add: of_real_def) ``` huffman@20554 ` 244` huffman@20554 ` 245` ```lemma of_real_1 [simp]: "of_real 1 = 1" ``` huffman@20554 ` 246` ```by (simp add: of_real_def) ``` huffman@20554 ` 247` huffman@20554 ` 248` ```lemma of_real_add [simp]: "of_real (x + y) = of_real x + of_real y" ``` huffman@20554 ` 249` ```by (simp add: of_real_def scaleR_left_distrib) ``` huffman@20554 ` 250` huffman@20554 ` 251` ```lemma of_real_minus [simp]: "of_real (- x) = - of_real x" ``` huffman@20554 ` 252` ```by (simp add: of_real_def) ``` huffman@20554 ` 253` huffman@20554 ` 254` ```lemma of_real_diff [simp]: "of_real (x - y) = of_real x - of_real y" ``` huffman@20554 ` 255` ```by (simp add: of_real_def scaleR_left_diff_distrib) ``` huffman@20554 ` 256` huffman@20554 ` 257` ```lemma of_real_mult [simp]: "of_real (x * y) = of_real x * of_real y" ``` haftmann@57512 ` 258` ```by (simp add: of_real_def mult.commute) ``` huffman@20554 ` 259` hoelzl@56889 ` 260` ```lemma of_real_setsum[simp]: "of_real (setsum f s) = (\x\s. of_real (f x))" ``` hoelzl@56889 ` 261` ``` by (induct s rule: infinite_finite_induct) auto ``` hoelzl@56889 ` 262` hoelzl@56889 ` 263` ```lemma of_real_setprod[simp]: "of_real (setprod f s) = (\x\s. of_real (f x))" ``` hoelzl@56889 ` 264` ``` by (induct s rule: infinite_finite_induct) auto ``` hoelzl@56889 ` 265` huffman@20584 ` 266` ```lemma nonzero_of_real_inverse: ``` huffman@20584 ` 267` ``` "x \ 0 \ of_real (inverse x) = ``` huffman@20584 ` 268` ``` inverse (of_real x :: 'a::real_div_algebra)" ``` huffman@20584 ` 269` ```by (simp add: of_real_def nonzero_inverse_scaleR_distrib) ``` huffman@20584 ` 270` huffman@20584 ` 271` ```lemma of_real_inverse [simp]: ``` huffman@20584 ` 272` ``` "of_real (inverse x) = ``` haftmann@36409 ` 273` ``` inverse (of_real x :: 'a::{real_div_algebra, division_ring_inverse_zero})" ``` huffman@20584 ` 274` ```by (simp add: of_real_def inverse_scaleR_distrib) ``` huffman@20584 ` 275` huffman@20584 ` 276` ```lemma nonzero_of_real_divide: ``` huffman@20584 ` 277` ``` "y \ 0 \ of_real (x / y) = ``` huffman@20584 ` 278` ``` (of_real x / of_real y :: 'a::real_field)" ``` huffman@20584 ` 279` ```by (simp add: divide_inverse nonzero_of_real_inverse) ``` huffman@20722 ` 280` huffman@20722 ` 281` ```lemma of_real_divide [simp]: ``` huffman@20584 ` 282` ``` "of_real (x / y) = ``` haftmann@36409 ` 283` ``` (of_real x / of_real y :: 'a::{real_field, field_inverse_zero})" ``` huffman@20584 ` 284` ```by (simp add: divide_inverse) ``` huffman@20584 ` 285` huffman@20722 ` 286` ```lemma of_real_power [simp]: ``` haftmann@31017 ` 287` ``` "of_real (x ^ n) = (of_real x :: 'a::{real_algebra_1}) ^ n" ``` huffman@30273 ` 288` ```by (induct n) simp_all ``` huffman@20722 ` 289` huffman@20554 ` 290` ```lemma of_real_eq_iff [simp]: "(of_real x = of_real y) = (x = y)" ``` huffman@35216 ` 291` ```by (simp add: of_real_def) ``` huffman@20554 ` 292` haftmann@38621 ` 293` ```lemma inj_of_real: ``` haftmann@38621 ` 294` ``` "inj of_real" ``` haftmann@38621 ` 295` ``` by (auto intro: injI) ``` haftmann@38621 ` 296` huffman@20584 ` 297` ```lemmas of_real_eq_0_iff [simp] = of_real_eq_iff [of _ 0, simplified] ``` huffman@20554 ` 298` huffman@20554 ` 299` ```lemma of_real_eq_id [simp]: "of_real = (id :: real \ real)" ``` huffman@20554 ` 300` ```proof ``` huffman@20554 ` 301` ``` fix r ``` huffman@20554 ` 302` ``` show "of_real r = id r" ``` huffman@22973 ` 303` ``` by (simp add: of_real_def) ``` huffman@20554 ` 304` ```qed ``` huffman@20554 ` 305` huffman@20554 ` 306` ```text{*Collapse nested embeddings*} ``` huffman@20554 ` 307` ```lemma of_real_of_nat_eq [simp]: "of_real (of_nat n) = of_nat n" ``` wenzelm@20772 ` 308` ```by (induct n) auto ``` huffman@20554 ` 309` huffman@20554 ` 310` ```lemma of_real_of_int_eq [simp]: "of_real (of_int z) = of_int z" ``` huffman@20554 ` 311` ```by (cases z rule: int_diff_cases, simp) ``` huffman@20554 ` 312` hoelzl@56889 ` 313` ```lemma of_real_real_of_nat_eq [simp]: "of_real (real n) = of_nat n" ``` hoelzl@56889 ` 314` ``` by (simp add: real_of_nat_def) ``` hoelzl@56889 ` 315` hoelzl@56889 ` 316` ```lemma of_real_real_of_int_eq [simp]: "of_real (real z) = of_int z" ``` hoelzl@56889 ` 317` ``` by (simp add: real_of_int_def) ``` hoelzl@56889 ` 318` huffman@47108 ` 319` ```lemma of_real_numeral: "of_real (numeral w) = numeral w" ``` huffman@47108 ` 320` ```using of_real_of_int_eq [of "numeral w"] by simp ``` huffman@47108 ` 321` haftmann@54489 ` 322` ```lemma of_real_neg_numeral: "of_real (- numeral w) = - numeral w" ``` haftmann@54489 ` 323` ```using of_real_of_int_eq [of "- numeral w"] by simp ``` huffman@20554 ` 324` huffman@22912 ` 325` ```text{*Every real algebra has characteristic zero*} ``` haftmann@38621 ` 326` huffman@22912 ` 327` ```instance real_algebra_1 < ring_char_0 ``` huffman@22912 ` 328` ```proof ``` haftmann@38621 ` 329` ``` from inj_of_real inj_of_nat have "inj (of_real \ of_nat)" by (rule inj_comp) ``` haftmann@38621 ` 330` ``` then show "inj (of_nat :: nat \ 'a)" by (simp add: comp_def) ``` huffman@22912 ` 331` ```qed ``` huffman@22912 ` 332` huffman@27553 ` 333` ```instance real_field < field_char_0 .. ``` huffman@27553 ` 334` huffman@20554 ` 335` huffman@20554 ` 336` ```subsection {* The Set of Real Numbers *} ``` huffman@20554 ` 337` haftmann@37767 ` 338` ```definition Reals :: "'a::real_algebra_1 set" where ``` haftmann@37767 ` 339` ``` "Reals = range of_real" ``` huffman@20554 ` 340` wenzelm@21210 ` 341` ```notation (xsymbols) ``` huffman@20554 ` 342` ``` Reals ("\") ``` huffman@20554 ` 343` huffman@21809 ` 344` ```lemma Reals_of_real [simp]: "of_real r \ Reals" ``` huffman@20554 ` 345` ```by (simp add: Reals_def) ``` huffman@20554 ` 346` huffman@21809 ` 347` ```lemma Reals_of_int [simp]: "of_int z \ Reals" ``` huffman@21809 ` 348` ```by (subst of_real_of_int_eq [symmetric], rule Reals_of_real) ``` huffman@20718 ` 349` huffman@21809 ` 350` ```lemma Reals_of_nat [simp]: "of_nat n \ Reals" ``` huffman@21809 ` 351` ```by (subst of_real_of_nat_eq [symmetric], rule Reals_of_real) ``` huffman@21809 ` 352` huffman@47108 ` 353` ```lemma Reals_numeral [simp]: "numeral w \ Reals" ``` huffman@47108 ` 354` ```by (subst of_real_numeral [symmetric], rule Reals_of_real) ``` huffman@47108 ` 355` huffman@20554 ` 356` ```lemma Reals_0 [simp]: "0 \ Reals" ``` huffman@20554 ` 357` ```apply (unfold Reals_def) ``` huffman@20554 ` 358` ```apply (rule range_eqI) ``` huffman@20554 ` 359` ```apply (rule of_real_0 [symmetric]) ``` huffman@20554 ` 360` ```done ``` huffman@20554 ` 361` huffman@20554 ` 362` ```lemma Reals_1 [simp]: "1 \ Reals" ``` huffman@20554 ` 363` ```apply (unfold Reals_def) ``` huffman@20554 ` 364` ```apply (rule range_eqI) ``` huffman@20554 ` 365` ```apply (rule of_real_1 [symmetric]) ``` huffman@20554 ` 366` ```done ``` huffman@20554 ` 367` huffman@20584 ` 368` ```lemma Reals_add [simp]: "\a \ Reals; b \ Reals\ \ a + b \ Reals" ``` huffman@20554 ` 369` ```apply (auto simp add: Reals_def) ``` huffman@20554 ` 370` ```apply (rule range_eqI) ``` huffman@20554 ` 371` ```apply (rule of_real_add [symmetric]) ``` huffman@20554 ` 372` ```done ``` huffman@20554 ` 373` huffman@20584 ` 374` ```lemma Reals_minus [simp]: "a \ Reals \ - a \ Reals" ``` huffman@20584 ` 375` ```apply (auto simp add: Reals_def) ``` huffman@20584 ` 376` ```apply (rule range_eqI) ``` huffman@20584 ` 377` ```apply (rule of_real_minus [symmetric]) ``` huffman@20584 ` 378` ```done ``` huffman@20584 ` 379` huffman@20584 ` 380` ```lemma Reals_diff [simp]: "\a \ Reals; b \ Reals\ \ a - b \ Reals" ``` huffman@20584 ` 381` ```apply (auto simp add: Reals_def) ``` huffman@20584 ` 382` ```apply (rule range_eqI) ``` huffman@20584 ` 383` ```apply (rule of_real_diff [symmetric]) ``` huffman@20584 ` 384` ```done ``` huffman@20584 ` 385` huffman@20584 ` 386` ```lemma Reals_mult [simp]: "\a \ Reals; b \ Reals\ \ a * b \ Reals" ``` huffman@20554 ` 387` ```apply (auto simp add: Reals_def) ``` huffman@20554 ` 388` ```apply (rule range_eqI) ``` huffman@20554 ` 389` ```apply (rule of_real_mult [symmetric]) ``` huffman@20554 ` 390` ```done ``` huffman@20554 ` 391` huffman@20584 ` 392` ```lemma nonzero_Reals_inverse: ``` huffman@20584 ` 393` ``` fixes a :: "'a::real_div_algebra" ``` huffman@20584 ` 394` ``` shows "\a \ Reals; a \ 0\ \ inverse a \ Reals" ``` huffman@20584 ` 395` ```apply (auto simp add: Reals_def) ``` huffman@20584 ` 396` ```apply (rule range_eqI) ``` huffman@20584 ` 397` ```apply (erule nonzero_of_real_inverse [symmetric]) ``` huffman@20584 ` 398` ```done ``` huffman@20584 ` 399` lp15@55719 ` 400` ```lemma Reals_inverse: ``` haftmann@36409 ` 401` ``` fixes a :: "'a::{real_div_algebra, division_ring_inverse_zero}" ``` huffman@20584 ` 402` ``` shows "a \ Reals \ inverse a \ Reals" ``` huffman@20584 ` 403` ```apply (auto simp add: Reals_def) ``` huffman@20584 ` 404` ```apply (rule range_eqI) ``` huffman@20584 ` 405` ```apply (rule of_real_inverse [symmetric]) ``` huffman@20584 ` 406` ```done ``` huffman@20584 ` 407` lp15@55719 ` 408` ```lemma Reals_inverse_iff [simp]: ``` lp15@55719 ` 409` ``` fixes x:: "'a :: {real_div_algebra, division_ring_inverse_zero}" ``` lp15@55719 ` 410` ``` shows "inverse x \ \ \ x \ \" ``` lp15@55719 ` 411` ```by (metis Reals_inverse inverse_inverse_eq) ``` lp15@55719 ` 412` huffman@20584 ` 413` ```lemma nonzero_Reals_divide: ``` huffman@20584 ` 414` ``` fixes a b :: "'a::real_field" ``` huffman@20584 ` 415` ``` shows "\a \ Reals; b \ Reals; b \ 0\ \ a / b \ Reals" ``` huffman@20584 ` 416` ```apply (auto simp add: Reals_def) ``` huffman@20584 ` 417` ```apply (rule range_eqI) ``` huffman@20584 ` 418` ```apply (erule nonzero_of_real_divide [symmetric]) ``` huffman@20584 ` 419` ```done ``` huffman@20584 ` 420` huffman@20584 ` 421` ```lemma Reals_divide [simp]: ``` haftmann@36409 ` 422` ``` fixes a b :: "'a::{real_field, field_inverse_zero}" ``` huffman@20584 ` 423` ``` shows "\a \ Reals; b \ Reals\ \ a / b \ Reals" ``` huffman@20584 ` 424` ```apply (auto simp add: Reals_def) ``` huffman@20584 ` 425` ```apply (rule range_eqI) ``` huffman@20584 ` 426` ```apply (rule of_real_divide [symmetric]) ``` huffman@20584 ` 427` ```done ``` huffman@20584 ` 428` huffman@20722 ` 429` ```lemma Reals_power [simp]: ``` haftmann@31017 ` 430` ``` fixes a :: "'a::{real_algebra_1}" ``` huffman@20722 ` 431` ``` shows "a \ Reals \ a ^ n \ Reals" ``` huffman@20722 ` 432` ```apply (auto simp add: Reals_def) ``` huffman@20722 ` 433` ```apply (rule range_eqI) ``` huffman@20722 ` 434` ```apply (rule of_real_power [symmetric]) ``` huffman@20722 ` 435` ```done ``` huffman@20722 ` 436` huffman@20554 ` 437` ```lemma Reals_cases [cases set: Reals]: ``` huffman@20554 ` 438` ``` assumes "q \ \" ``` huffman@20554 ` 439` ``` obtains (of_real) r where "q = of_real r" ``` huffman@20554 ` 440` ``` unfolding Reals_def ``` huffman@20554 ` 441` ```proof - ``` huffman@20554 ` 442` ``` from `q \ \` have "q \ range of_real" unfolding Reals_def . ``` huffman@20554 ` 443` ``` then obtain r where "q = of_real r" .. ``` huffman@20554 ` 444` ``` then show thesis .. ``` huffman@20554 ` 445` ```qed ``` huffman@20554 ` 446` lp15@55719 ` 447` ```lemma setsum_in_Reals: assumes "\i. i \ s \ f i \ \" shows "setsum f s \ \" ``` lp15@55719 ` 448` ```proof (cases "finite s") ``` lp15@55719 ` 449` ``` case True then show ?thesis using assms ``` lp15@55719 ` 450` ``` by (induct s rule: finite_induct) auto ``` lp15@55719 ` 451` ```next ``` lp15@55719 ` 452` ``` case False then show ?thesis using assms ``` haftmann@57418 ` 453` ``` by (metis Reals_0 setsum.infinite) ``` lp15@55719 ` 454` ```qed ``` lp15@55719 ` 455` lp15@55719 ` 456` ```lemma setprod_in_Reals: assumes "\i. i \ s \ f i \ \" shows "setprod f s \ \" ``` lp15@55719 ` 457` ```proof (cases "finite s") ``` lp15@55719 ` 458` ``` case True then show ?thesis using assms ``` lp15@55719 ` 459` ``` by (induct s rule: finite_induct) auto ``` lp15@55719 ` 460` ```next ``` lp15@55719 ` 461` ``` case False then show ?thesis using assms ``` haftmann@57418 ` 462` ``` by (metis Reals_1 setprod.infinite) ``` lp15@55719 ` 463` ```qed ``` lp15@55719 ` 464` huffman@20554 ` 465` ```lemma Reals_induct [case_names of_real, induct set: Reals]: ``` huffman@20554 ` 466` ``` "q \ \ \ (\r. P (of_real r)) \ P q" ``` huffman@20554 ` 467` ``` by (rule Reals_cases) auto ``` huffman@20554 ` 468` immler@54778 ` 469` ```subsection {* Ordered real vector spaces *} ``` immler@54778 ` 470` immler@54778 ` 471` ```class ordered_real_vector = real_vector + ordered_ab_group_add + ``` immler@54778 ` 472` ``` assumes scaleR_left_mono: "x \ y \ 0 \ a \ a *\<^sub>R x \ a *\<^sub>R y" ``` immler@54778 ` 473` ``` assumes scaleR_right_mono: "a \ b \ 0 \ x \ a *\<^sub>R x \ b *\<^sub>R x" ``` immler@54778 ` 474` ```begin ``` immler@54778 ` 475` immler@54778 ` 476` ```lemma scaleR_mono: ``` immler@54778 ` 477` ``` "a \ b \ x \ y \ 0 \ b \ 0 \ x \ a *\<^sub>R x \ b *\<^sub>R y" ``` immler@54778 ` 478` ```apply (erule scaleR_right_mono [THEN order_trans], assumption) ``` immler@54778 ` 479` ```apply (erule scaleR_left_mono, assumption) ``` immler@54778 ` 480` ```done ``` immler@54778 ` 481` immler@54778 ` 482` ```lemma scaleR_mono': ``` immler@54778 ` 483` ``` "a \ b \ c \ d \ 0 \ a \ 0 \ c \ a *\<^sub>R c \ b *\<^sub>R d" ``` immler@54778 ` 484` ``` by (rule scaleR_mono) (auto intro: order.trans) ``` immler@54778 ` 485` immler@54785 ` 486` ```lemma pos_le_divideRI: ``` immler@54785 ` 487` ``` assumes "0 < c" ``` immler@54785 ` 488` ``` assumes "c *\<^sub>R a \ b" ``` immler@54785 ` 489` ``` shows "a \ b /\<^sub>R c" ``` immler@54785 ` 490` ```proof - ``` immler@54785 ` 491` ``` from scaleR_left_mono[OF assms(2)] assms(1) ``` immler@54785 ` 492` ``` have "c *\<^sub>R a /\<^sub>R c \ b /\<^sub>R c" ``` immler@54785 ` 493` ``` by simp ``` immler@54785 ` 494` ``` with assms show ?thesis ``` immler@54785 ` 495` ``` by (simp add: scaleR_one scaleR_scaleR inverse_eq_divide) ``` immler@54785 ` 496` ```qed ``` immler@54785 ` 497` immler@54785 ` 498` ```lemma pos_le_divideR_eq: ``` immler@54785 ` 499` ``` assumes "0 < c" ``` immler@54785 ` 500` ``` shows "a \ b /\<^sub>R c \ c *\<^sub>R a \ b" ``` immler@54785 ` 501` ```proof rule ``` immler@54785 ` 502` ``` assume "a \ b /\<^sub>R c" ``` immler@54785 ` 503` ``` from scaleR_left_mono[OF this] assms ``` immler@54785 ` 504` ``` have "c *\<^sub>R a \ c *\<^sub>R (b /\<^sub>R c)" ``` immler@54785 ` 505` ``` by simp ``` immler@54785 ` 506` ``` with assms show "c *\<^sub>R a \ b" ``` immler@54785 ` 507` ``` by (simp add: scaleR_one scaleR_scaleR inverse_eq_divide) ``` immler@54785 ` 508` ```qed (rule pos_le_divideRI[OF assms]) ``` immler@54785 ` 509` immler@54785 ` 510` ```lemma scaleR_image_atLeastAtMost: ``` immler@54785 ` 511` ``` "c > 0 \ scaleR c ` {x..y} = {c *\<^sub>R x..c *\<^sub>R y}" ``` immler@54785 ` 512` ``` apply (auto intro!: scaleR_left_mono) ``` immler@54785 ` 513` ``` apply (rule_tac x = "inverse c *\<^sub>R xa" in image_eqI) ``` immler@54785 ` 514` ``` apply (simp_all add: pos_le_divideR_eq[symmetric] scaleR_scaleR scaleR_one) ``` immler@54785 ` 515` ``` done ``` immler@54785 ` 516` immler@54778 ` 517` ```end ``` immler@54778 ` 518` immler@54778 ` 519` ```lemma scaleR_nonneg_nonneg: "0 \ a \ 0 \ (x::'a::ordered_real_vector) \ 0 \ a *\<^sub>R x" ``` immler@54778 ` 520` ``` using scaleR_left_mono [of 0 x a] ``` immler@54778 ` 521` ``` by simp ``` immler@54778 ` 522` immler@54778 ` 523` ```lemma scaleR_nonneg_nonpos: "0 \ a \ (x::'a::ordered_real_vector) \ 0 \ a *\<^sub>R x \ 0" ``` immler@54778 ` 524` ``` using scaleR_left_mono [of x 0 a] by simp ``` immler@54778 ` 525` immler@54778 ` 526` ```lemma scaleR_nonpos_nonneg: "a \ 0 \ 0 \ (x::'a::ordered_real_vector) \ a *\<^sub>R x \ 0" ``` immler@54778 ` 527` ``` using scaleR_right_mono [of a 0 x] by simp ``` immler@54778 ` 528` immler@54778 ` 529` ```lemma split_scaleR_neg_le: "(0 \ a & x \ 0) | (a \ 0 & 0 \ x) \ ``` immler@54778 ` 530` ``` a *\<^sub>R (x::'a::ordered_real_vector) \ 0" ``` immler@54778 ` 531` ``` by (auto simp add: scaleR_nonneg_nonpos scaleR_nonpos_nonneg) ``` immler@54778 ` 532` immler@54778 ` 533` ```lemma le_add_iff1: ``` immler@54778 ` 534` ``` fixes c d e::"'a::ordered_real_vector" ``` immler@54778 ` 535` ``` shows "a *\<^sub>R e + c \ b *\<^sub>R e + d \ (a - b) *\<^sub>R e + c \ d" ``` immler@54778 ` 536` ``` by (simp add: algebra_simps) ``` immler@54778 ` 537` immler@54778 ` 538` ```lemma le_add_iff2: ``` immler@54778 ` 539` ``` fixes c d e::"'a::ordered_real_vector" ``` immler@54778 ` 540` ``` shows "a *\<^sub>R e + c \ b *\<^sub>R e + d \ c \ (b - a) *\<^sub>R e + d" ``` immler@54778 ` 541` ``` by (simp add: algebra_simps) ``` immler@54778 ` 542` immler@54778 ` 543` ```lemma scaleR_left_mono_neg: ``` immler@54778 ` 544` ``` fixes a b::"'a::ordered_real_vector" ``` immler@54778 ` 545` ``` shows "b \ a \ c \ 0 \ c *\<^sub>R a \ c *\<^sub>R b" ``` immler@54778 ` 546` ``` apply (drule scaleR_left_mono [of _ _ "- c"]) ``` immler@54778 ` 547` ``` apply simp_all ``` immler@54778 ` 548` ``` done ``` immler@54778 ` 549` immler@54778 ` 550` ```lemma scaleR_right_mono_neg: ``` immler@54778 ` 551` ``` fixes c::"'a::ordered_real_vector" ``` immler@54778 ` 552` ``` shows "b \ a \ c \ 0 \ a *\<^sub>R c \ b *\<^sub>R c" ``` immler@54778 ` 553` ``` apply (drule scaleR_right_mono [of _ _ "- c"]) ``` immler@54778 ` 554` ``` apply simp_all ``` immler@54778 ` 555` ``` done ``` immler@54778 ` 556` immler@54778 ` 557` ```lemma scaleR_nonpos_nonpos: "a \ 0 \ (b::'a::ordered_real_vector) \ 0 \ 0 \ a *\<^sub>R b" ``` immler@54778 ` 558` ```using scaleR_right_mono_neg [of a 0 b] by simp ``` immler@54778 ` 559` immler@54778 ` 560` ```lemma split_scaleR_pos_le: ``` immler@54778 ` 561` ``` fixes b::"'a::ordered_real_vector" ``` immler@54778 ` 562` ``` shows "(0 \ a \ 0 \ b) \ (a \ 0 \ b \ 0) \ 0 \ a *\<^sub>R b" ``` immler@54778 ` 563` ``` by (auto simp add: scaleR_nonneg_nonneg scaleR_nonpos_nonpos) ``` immler@54778 ` 564` immler@54778 ` 565` ```lemma zero_le_scaleR_iff: ``` immler@54778 ` 566` ``` fixes b::"'a::ordered_real_vector" ``` immler@54778 ` 567` ``` shows "0 \ a *\<^sub>R b \ 0 < a \ 0 \ b \ a < 0 \ b \ 0 \ a = 0" (is "?lhs = ?rhs") ``` immler@54778 ` 568` ```proof cases ``` immler@54778 ` 569` ``` assume "a \ 0" ``` immler@54778 ` 570` ``` show ?thesis ``` immler@54778 ` 571` ``` proof ``` immler@54778 ` 572` ``` assume lhs: ?lhs ``` immler@54778 ` 573` ``` { ``` immler@54778 ` 574` ``` assume "0 < a" ``` immler@54778 ` 575` ``` with lhs have "inverse a *\<^sub>R 0 \ inverse a *\<^sub>R (a *\<^sub>R b)" ``` immler@54778 ` 576` ``` by (intro scaleR_mono) auto ``` immler@54778 ` 577` ``` hence ?rhs using `0 < a` ``` immler@54778 ` 578` ``` by simp ``` immler@54778 ` 579` ``` } moreover { ``` immler@54778 ` 580` ``` assume "0 > a" ``` immler@54778 ` 581` ``` with lhs have "- inverse a *\<^sub>R 0 \ - inverse a *\<^sub>R (a *\<^sub>R b)" ``` immler@54778 ` 582` ``` by (intro scaleR_mono) auto ``` immler@54778 ` 583` ``` hence ?rhs using `0 > a` ``` immler@54778 ` 584` ``` by simp ``` immler@54778 ` 585` ``` } ultimately show ?rhs using `a \ 0` by arith ``` immler@54778 ` 586` ``` qed (auto simp: not_le `a \ 0` intro!: split_scaleR_pos_le) ``` immler@54778 ` 587` ```qed simp ``` immler@54778 ` 588` immler@54778 ` 589` ```lemma scaleR_le_0_iff: ``` immler@54778 ` 590` ``` fixes b::"'a::ordered_real_vector" ``` immler@54778 ` 591` ``` shows "a *\<^sub>R b \ 0 \ 0 < a \ b \ 0 \ a < 0 \ 0 \ b \ a = 0" ``` immler@54778 ` 592` ``` by (insert zero_le_scaleR_iff [of "-a" b]) force ``` immler@54778 ` 593` immler@54778 ` 594` ```lemma scaleR_le_cancel_left: ``` immler@54778 ` 595` ``` fixes b::"'a::ordered_real_vector" ``` immler@54778 ` 596` ``` shows "c *\<^sub>R a \ c *\<^sub>R b \ (0 < c \ a \ b) \ (c < 0 \ b \ a)" ``` immler@54778 ` 597` ``` by (auto simp add: neq_iff scaleR_left_mono scaleR_left_mono_neg ``` immler@54778 ` 598` ``` dest: scaleR_left_mono[where a="inverse c"] scaleR_left_mono_neg[where c="inverse c"]) ``` immler@54778 ` 599` immler@54778 ` 600` ```lemma scaleR_le_cancel_left_pos: ``` immler@54778 ` 601` ``` fixes b::"'a::ordered_real_vector" ``` immler@54778 ` 602` ``` shows "0 < c \ c *\<^sub>R a \ c *\<^sub>R b \ a \ b" ``` immler@54778 ` 603` ``` by (auto simp: scaleR_le_cancel_left) ``` immler@54778 ` 604` immler@54778 ` 605` ```lemma scaleR_le_cancel_left_neg: ``` immler@54778 ` 606` ``` fixes b::"'a::ordered_real_vector" ``` immler@54778 ` 607` ``` shows "c < 0 \ c *\<^sub>R a \ c *\<^sub>R b \ b \ a" ``` immler@54778 ` 608` ``` by (auto simp: scaleR_le_cancel_left) ``` immler@54778 ` 609` immler@54778 ` 610` ```lemma scaleR_left_le_one_le: ``` immler@54778 ` 611` ``` fixes x::"'a::ordered_real_vector" and a::real ``` immler@54778 ` 612` ``` shows "0 \ x \ a \ 1 \ a *\<^sub>R x \ x" ``` immler@54778 ` 613` ``` using scaleR_right_mono[of a 1 x] by simp ``` immler@54778 ` 614` huffman@20504 ` 615` huffman@20504 ` 616` ```subsection {* Real normed vector spaces *} ``` huffman@20504 ` 617` hoelzl@51531 ` 618` ```class dist = ``` hoelzl@51531 ` 619` ``` fixes dist :: "'a \ 'a \ real" ``` hoelzl@51531 ` 620` haftmann@29608 ` 621` ```class norm = ``` huffman@22636 ` 622` ``` fixes norm :: "'a \ real" ``` huffman@20504 ` 623` huffman@24520 ` 624` ```class sgn_div_norm = scaleR + norm + sgn + ``` haftmann@25062 ` 625` ``` assumes sgn_div_norm: "sgn x = x /\<^sub>R norm x" ``` nipkow@24506 ` 626` huffman@31289 ` 627` ```class dist_norm = dist + norm + minus + ``` huffman@31289 ` 628` ``` assumes dist_norm: "dist x y = norm (x - y)" ``` huffman@31289 ` 629` hoelzl@51531 ` 630` ```class open_dist = "open" + dist + ``` hoelzl@51531 ` 631` ``` assumes open_dist: "open S \ (\x\S. \e>0. \y. dist y x < e \ y \ S)" ``` hoelzl@51531 ` 632` huffman@31492 ` 633` ```class real_normed_vector = real_vector + sgn_div_norm + dist_norm + open_dist + ``` hoelzl@51002 ` 634` ``` assumes norm_eq_zero [simp]: "norm x = 0 \ x = 0" ``` haftmann@25062 ` 635` ``` and norm_triangle_ineq: "norm (x + y) \ norm x + norm y" ``` huffman@31586 ` 636` ``` and norm_scaleR [simp]: "norm (scaleR a x) = \a\ * norm x" ``` hoelzl@51002 ` 637` ```begin ``` hoelzl@51002 ` 638` hoelzl@51002 ` 639` ```lemma norm_ge_zero [simp]: "0 \ norm x" ``` hoelzl@51002 ` 640` ```proof - ``` hoelzl@51002 ` 641` ``` have "0 = norm (x + -1 *\<^sub>R x)" ``` hoelzl@51002 ` 642` ``` using scaleR_add_left[of 1 "-1" x] norm_scaleR[of 0 x] by (simp add: scaleR_one) ``` hoelzl@51002 ` 643` ``` also have "\ \ norm x + norm (-1 *\<^sub>R x)" by (rule norm_triangle_ineq) ``` hoelzl@51002 ` 644` ``` finally show ?thesis by simp ``` hoelzl@51002 ` 645` ```qed ``` hoelzl@51002 ` 646` hoelzl@51002 ` 647` ```end ``` huffman@20504 ` 648` haftmann@24588 ` 649` ```class real_normed_algebra = real_algebra + real_normed_vector + ``` haftmann@25062 ` 650` ``` assumes norm_mult_ineq: "norm (x * y) \ norm x * norm y" ``` huffman@20504 ` 651` haftmann@24588 ` 652` ```class real_normed_algebra_1 = real_algebra_1 + real_normed_algebra + ``` haftmann@25062 ` 653` ``` assumes norm_one [simp]: "norm 1 = 1" ``` huffman@22852 ` 654` haftmann@24588 ` 655` ```class real_normed_div_algebra = real_div_algebra + real_normed_vector + ``` haftmann@25062 ` 656` ``` assumes norm_mult: "norm (x * y) = norm x * norm y" ``` huffman@20504 ` 657` haftmann@24588 ` 658` ```class real_normed_field = real_field + real_normed_div_algebra ``` huffman@20584 ` 659` huffman@22852 ` 660` ```instance real_normed_div_algebra < real_normed_algebra_1 ``` huffman@20554 ` 661` ```proof ``` huffman@20554 ` 662` ``` fix x y :: 'a ``` huffman@20554 ` 663` ``` show "norm (x * y) \ norm x * norm y" ``` huffman@20554 ` 664` ``` by (simp add: norm_mult) ``` huffman@22852 ` 665` ```next ``` huffman@22852 ` 666` ``` have "norm (1 * 1::'a) = norm (1::'a) * norm (1::'a)" ``` huffman@22852 ` 667` ``` by (rule norm_mult) ``` huffman@22852 ` 668` ``` thus "norm (1::'a) = 1" by simp ``` huffman@20554 ` 669` ```qed ``` huffman@20554 ` 670` huffman@22852 ` 671` ```lemma norm_zero [simp]: "norm (0::'a::real_normed_vector) = 0" ``` huffman@20504 ` 672` ```by simp ``` huffman@20504 ` 673` huffman@22852 ` 674` ```lemma zero_less_norm_iff [simp]: ``` huffman@22852 ` 675` ``` fixes x :: "'a::real_normed_vector" ``` huffman@22852 ` 676` ``` shows "(0 < norm x) = (x \ 0)" ``` huffman@20504 ` 677` ```by (simp add: order_less_le) ``` huffman@20504 ` 678` huffman@22852 ` 679` ```lemma norm_not_less_zero [simp]: ``` huffman@22852 ` 680` ``` fixes x :: "'a::real_normed_vector" ``` huffman@22852 ` 681` ``` shows "\ norm x < 0" ``` huffman@20828 ` 682` ```by (simp add: linorder_not_less) ``` huffman@20828 ` 683` huffman@22852 ` 684` ```lemma norm_le_zero_iff [simp]: ``` huffman@22852 ` 685` ``` fixes x :: "'a::real_normed_vector" ``` huffman@22852 ` 686` ``` shows "(norm x \ 0) = (x = 0)" ``` huffman@20828 ` 687` ```by (simp add: order_le_less) ``` huffman@20828 ` 688` huffman@20504 ` 689` ```lemma norm_minus_cancel [simp]: ``` huffman@20584 ` 690` ``` fixes x :: "'a::real_normed_vector" ``` huffman@20584 ` 691` ``` shows "norm (- x) = norm x" ``` huffman@20504 ` 692` ```proof - ``` huffman@21809 ` 693` ``` have "norm (- x) = norm (scaleR (- 1) x)" ``` huffman@20504 ` 694` ``` by (simp only: scaleR_minus_left scaleR_one) ``` huffman@20533 ` 695` ``` also have "\ = \- 1\ * norm x" ``` huffman@20504 ` 696` ``` by (rule norm_scaleR) ``` huffman@20504 ` 697` ``` finally show ?thesis by simp ``` huffman@20504 ` 698` ```qed ``` huffman@20504 ` 699` huffman@20504 ` 700` ```lemma norm_minus_commute: ``` huffman@20584 ` 701` ``` fixes a b :: "'a::real_normed_vector" ``` huffman@20584 ` 702` ``` shows "norm (a - b) = norm (b - a)" ``` huffman@20504 ` 703` ```proof - ``` huffman@22898 ` 704` ``` have "norm (- (b - a)) = norm (b - a)" ``` huffman@22898 ` 705` ``` by (rule norm_minus_cancel) ``` huffman@22898 ` 706` ``` thus ?thesis by simp ``` huffman@20504 ` 707` ```qed ``` huffman@20504 ` 708` huffman@20504 ` 709` ```lemma norm_triangle_ineq2: ``` huffman@20584 ` 710` ``` fixes a b :: "'a::real_normed_vector" ``` huffman@20533 ` 711` ``` shows "norm a - norm b \ norm (a - b)" ``` huffman@20504 ` 712` ```proof - ``` huffman@20533 ` 713` ``` have "norm (a - b + b) \ norm (a - b) + norm b" ``` huffman@20504 ` 714` ``` by (rule norm_triangle_ineq) ``` huffman@22898 ` 715` ``` thus ?thesis by simp ``` huffman@20504 ` 716` ```qed ``` huffman@20504 ` 717` huffman@20584 ` 718` ```lemma norm_triangle_ineq3: ``` huffman@20584 ` 719` ``` fixes a b :: "'a::real_normed_vector" ``` huffman@20584 ` 720` ``` shows "\norm a - norm b\ \ norm (a - b)" ``` huffman@20584 ` 721` ```apply (subst abs_le_iff) ``` huffman@20584 ` 722` ```apply auto ``` huffman@20584 ` 723` ```apply (rule norm_triangle_ineq2) ``` huffman@20584 ` 724` ```apply (subst norm_minus_commute) ``` huffman@20584 ` 725` ```apply (rule norm_triangle_ineq2) ``` huffman@20584 ` 726` ```done ``` huffman@20584 ` 727` huffman@20504 ` 728` ```lemma norm_triangle_ineq4: ``` huffman@20584 ` 729` ``` fixes a b :: "'a::real_normed_vector" ``` huffman@20533 ` 730` ``` shows "norm (a - b) \ norm a + norm b" ``` huffman@20504 ` 731` ```proof - ``` huffman@22898 ` 732` ``` have "norm (a + - b) \ norm a + norm (- b)" ``` huffman@20504 ` 733` ``` by (rule norm_triangle_ineq) ``` haftmann@54230 ` 734` ``` then show ?thesis by simp ``` huffman@22898 ` 735` ```qed ``` huffman@22898 ` 736` huffman@22898 ` 737` ```lemma norm_diff_ineq: ``` huffman@22898 ` 738` ``` fixes a b :: "'a::real_normed_vector" ``` huffman@22898 ` 739` ``` shows "norm a - norm b \ norm (a + b)" ``` huffman@22898 ` 740` ```proof - ``` huffman@22898 ` 741` ``` have "norm a - norm (- b) \ norm (a - - b)" ``` huffman@22898 ` 742` ``` by (rule norm_triangle_ineq2) ``` huffman@22898 ` 743` ``` thus ?thesis by simp ``` huffman@20504 ` 744` ```qed ``` huffman@20504 ` 745` huffman@20551 ` 746` ```lemma norm_diff_triangle_ineq: ``` huffman@20551 ` 747` ``` fixes a b c d :: "'a::real_normed_vector" ``` huffman@20551 ` 748` ``` shows "norm ((a + b) - (c + d)) \ norm (a - c) + norm (b - d)" ``` huffman@20551 ` 749` ```proof - ``` huffman@20551 ` 750` ``` have "norm ((a + b) - (c + d)) = norm ((a - c) + (b - d))" ``` haftmann@54230 ` 751` ``` by (simp add: algebra_simps) ``` huffman@20551 ` 752` ``` also have "\ \ norm (a - c) + norm (b - d)" ``` huffman@20551 ` 753` ``` by (rule norm_triangle_ineq) ``` huffman@20551 ` 754` ``` finally show ?thesis . ``` huffman@20551 ` 755` ```qed ``` huffman@20551 ` 756` lp15@55719 ` 757` ```lemma norm_triangle_mono: ``` lp15@55719 ` 758` ``` fixes a b :: "'a::real_normed_vector" ``` lp15@55719 ` 759` ``` shows "\norm a \ r; norm b \ s\ \ norm (a + b) \ r + s" ``` lp15@55719 ` 760` ```by (metis add_mono_thms_linordered_semiring(1) norm_triangle_ineq order.trans) ``` lp15@55719 ` 761` hoelzl@56194 ` 762` ```lemma norm_setsum: ``` hoelzl@56194 ` 763` ``` fixes f :: "'a \ 'b::real_normed_vector" ``` hoelzl@56194 ` 764` ``` shows "norm (setsum f A) \ (\i\A. norm (f i))" ``` hoelzl@56194 ` 765` ``` by (induct A rule: infinite_finite_induct) (auto intro: norm_triangle_mono) ``` hoelzl@56194 ` 766` hoelzl@56369 ` 767` ```lemma setsum_norm_le: ``` hoelzl@56369 ` 768` ``` fixes f :: "'a \ 'b::real_normed_vector" ``` hoelzl@56369 ` 769` ``` assumes fg: "\x \ S. norm (f x) \ g x" ``` hoelzl@56369 ` 770` ``` shows "norm (setsum f S) \ setsum g S" ``` hoelzl@56369 ` 771` ``` by (rule order_trans [OF norm_setsum setsum_mono]) (simp add: fg) ``` hoelzl@56369 ` 772` huffman@22857 ` 773` ```lemma abs_norm_cancel [simp]: ``` huffman@22857 ` 774` ``` fixes a :: "'a::real_normed_vector" ``` huffman@22857 ` 775` ``` shows "\norm a\ = norm a" ``` huffman@22857 ` 776` ```by (rule abs_of_nonneg [OF norm_ge_zero]) ``` huffman@22857 ` 777` huffman@22880 ` 778` ```lemma norm_add_less: ``` huffman@22880 ` 779` ``` fixes x y :: "'a::real_normed_vector" ``` huffman@22880 ` 780` ``` shows "\norm x < r; norm y < s\ \ norm (x + y) < r + s" ``` huffman@22880 ` 781` ```by (rule order_le_less_trans [OF norm_triangle_ineq add_strict_mono]) ``` huffman@22880 ` 782` huffman@22880 ` 783` ```lemma norm_mult_less: ``` huffman@22880 ` 784` ``` fixes x y :: "'a::real_normed_algebra" ``` huffman@22880 ` 785` ``` shows "\norm x < r; norm y < s\ \ norm (x * y) < r * s" ``` huffman@22880 ` 786` ```apply (rule order_le_less_trans [OF norm_mult_ineq]) ``` huffman@22880 ` 787` ```apply (simp add: mult_strict_mono') ``` huffman@22880 ` 788` ```done ``` huffman@22880 ` 789` huffman@22857 ` 790` ```lemma norm_of_real [simp]: ``` huffman@22857 ` 791` ``` "norm (of_real r :: 'a::real_normed_algebra_1) = \r\" ``` huffman@31586 ` 792` ```unfolding of_real_def by simp ``` huffman@20560 ` 793` huffman@47108 ` 794` ```lemma norm_numeral [simp]: ``` huffman@47108 ` 795` ``` "norm (numeral w::'a::real_normed_algebra_1) = numeral w" ``` huffman@47108 ` 796` ```by (subst of_real_numeral [symmetric], subst norm_of_real, simp) ``` huffman@47108 ` 797` huffman@47108 ` 798` ```lemma norm_neg_numeral [simp]: ``` haftmann@54489 ` 799` ``` "norm (- numeral w::'a::real_normed_algebra_1) = numeral w" ``` huffman@47108 ` 800` ```by (subst of_real_neg_numeral [symmetric], subst norm_of_real, simp) ``` huffman@22876 ` 801` huffman@22876 ` 802` ```lemma norm_of_int [simp]: ``` huffman@22876 ` 803` ``` "norm (of_int z::'a::real_normed_algebra_1) = \of_int z\" ``` huffman@22876 ` 804` ```by (subst of_real_of_int_eq [symmetric], rule norm_of_real) ``` huffman@22876 ` 805` huffman@22876 ` 806` ```lemma norm_of_nat [simp]: ``` huffman@22876 ` 807` ``` "norm (of_nat n::'a::real_normed_algebra_1) = of_nat n" ``` huffman@22876 ` 808` ```apply (subst of_real_of_nat_eq [symmetric]) ``` huffman@22876 ` 809` ```apply (subst norm_of_real, simp) ``` huffman@22876 ` 810` ```done ``` huffman@22876 ` 811` huffman@20504 ` 812` ```lemma nonzero_norm_inverse: ``` huffman@20504 ` 813` ``` fixes a :: "'a::real_normed_div_algebra" ``` huffman@20533 ` 814` ``` shows "a \ 0 \ norm (inverse a) = inverse (norm a)" ``` huffman@20504 ` 815` ```apply (rule inverse_unique [symmetric]) ``` huffman@20504 ` 816` ```apply (simp add: norm_mult [symmetric]) ``` huffman@20504 ` 817` ```done ``` huffman@20504 ` 818` huffman@20504 ` 819` ```lemma norm_inverse: ``` haftmann@36409 ` 820` ``` fixes a :: "'a::{real_normed_div_algebra, division_ring_inverse_zero}" ``` huffman@20533 ` 821` ``` shows "norm (inverse a) = inverse (norm a)" ``` huffman@20504 ` 822` ```apply (case_tac "a = 0", simp) ``` huffman@20504 ` 823` ```apply (erule nonzero_norm_inverse) ``` huffman@20504 ` 824` ```done ``` huffman@20504 ` 825` huffman@20584 ` 826` ```lemma nonzero_norm_divide: ``` huffman@20584 ` 827` ``` fixes a b :: "'a::real_normed_field" ``` huffman@20584 ` 828` ``` shows "b \ 0 \ norm (a / b) = norm a / norm b" ``` huffman@20584 ` 829` ```by (simp add: divide_inverse norm_mult nonzero_norm_inverse) ``` huffman@20584 ` 830` huffman@20584 ` 831` ```lemma norm_divide: ``` haftmann@36409 ` 832` ``` fixes a b :: "'a::{real_normed_field, field_inverse_zero}" ``` huffman@20584 ` 833` ``` shows "norm (a / b) = norm a / norm b" ``` huffman@20584 ` 834` ```by (simp add: divide_inverse norm_mult norm_inverse) ``` huffman@20584 ` 835` huffman@22852 ` 836` ```lemma norm_power_ineq: ``` haftmann@31017 ` 837` ``` fixes x :: "'a::{real_normed_algebra_1}" ``` huffman@22852 ` 838` ``` shows "norm (x ^ n) \ norm x ^ n" ``` huffman@22852 ` 839` ```proof (induct n) ``` huffman@22852 ` 840` ``` case 0 show "norm (x ^ 0) \ norm x ^ 0" by simp ``` huffman@22852 ` 841` ```next ``` huffman@22852 ` 842` ``` case (Suc n) ``` huffman@22852 ` 843` ``` have "norm (x * x ^ n) \ norm x * norm (x ^ n)" ``` huffman@22852 ` 844` ``` by (rule norm_mult_ineq) ``` huffman@22852 ` 845` ``` also from Suc have "\ \ norm x * norm x ^ n" ``` huffman@22852 ` 846` ``` using norm_ge_zero by (rule mult_left_mono) ``` huffman@22852 ` 847` ``` finally show "norm (x ^ Suc n) \ norm x ^ Suc n" ``` huffman@30273 ` 848` ``` by simp ``` huffman@22852 ` 849` ```qed ``` huffman@22852 ` 850` huffman@20684 ` 851` ```lemma norm_power: ``` haftmann@31017 ` 852` ``` fixes x :: "'a::{real_normed_div_algebra}" ``` huffman@20684 ` 853` ``` shows "norm (x ^ n) = norm x ^ n" ``` huffman@30273 ` 854` ```by (induct n) (simp_all add: norm_mult) ``` huffman@20684 ` 855` lp15@55719 ` 856` ```lemma setprod_norm: ``` lp15@55719 ` 857` ``` fixes f :: "'a \ 'b::{comm_semiring_1,real_normed_div_algebra}" ``` lp15@55719 ` 858` ``` shows "setprod (\x. norm(f x)) A = norm (setprod f A)" ``` hoelzl@57275 ` 859` ``` by (induct A rule: infinite_finite_induct) (auto simp: norm_mult) ``` hoelzl@57275 ` 860` hoelzl@57275 ` 861` ```lemma norm_setprod_le: ``` hoelzl@57275 ` 862` ``` "norm (setprod f A) \ (\a\A. norm (f a :: 'a :: {real_normed_algebra_1, comm_monoid_mult}))" ``` hoelzl@57275 ` 863` ```proof (induction A rule: infinite_finite_induct) ``` hoelzl@57275 ` 864` ``` case (insert a A) ``` hoelzl@57275 ` 865` ``` then have "norm (setprod f (insert a A)) \ norm (f a) * norm (setprod f A)" ``` hoelzl@57275 ` 866` ``` by (simp add: norm_mult_ineq) ``` hoelzl@57275 ` 867` ``` also have "norm (setprod f A) \ (\a\A. norm (f a))" ``` hoelzl@57275 ` 868` ``` by (rule insert) ``` hoelzl@57275 ` 869` ``` finally show ?case ``` hoelzl@57275 ` 870` ``` by (simp add: insert mult_left_mono) ``` hoelzl@57275 ` 871` ```qed simp_all ``` hoelzl@57275 ` 872` hoelzl@57275 ` 873` ```lemma norm_setprod_diff: ``` hoelzl@57275 ` 874` ``` fixes z w :: "'i \ 'a::{real_normed_algebra_1, comm_monoid_mult}" ``` hoelzl@57275 ` 875` ``` shows "(\i. i \ I \ norm (z i) \ 1) \ (\i. i \ I \ norm (w i) \ 1) \ ``` hoelzl@57275 ` 876` ``` norm ((\i\I. z i) - (\i\I. w i)) \ (\i\I. norm (z i - w i))" ``` hoelzl@57275 ` 877` ```proof (induction I rule: infinite_finite_induct) ``` hoelzl@57275 ` 878` ``` case (insert i I) ``` hoelzl@57275 ` 879` ``` note insert.hyps[simp] ``` hoelzl@57275 ` 880` hoelzl@57275 ` 881` ``` have "norm ((\i\insert i I. z i) - (\i\insert i I. w i)) = ``` hoelzl@57275 ` 882` ``` norm ((\i\I. z i) * (z i - w i) + ((\i\I. z i) - (\i\I. w i)) * w i)" ``` hoelzl@57275 ` 883` ``` (is "_ = norm (?t1 + ?t2)") ``` hoelzl@57275 ` 884` ``` by (auto simp add: field_simps) ``` hoelzl@57275 ` 885` ``` also have "... \ norm ?t1 + norm ?t2" ``` hoelzl@57275 ` 886` ``` by (rule norm_triangle_ineq) ``` hoelzl@57275 ` 887` ``` also have "norm ?t1 \ norm (\i\I. z i) * norm (z i - w i)" ``` hoelzl@57275 ` 888` ``` by (rule norm_mult_ineq) ``` hoelzl@57275 ` 889` ``` also have "\ \ (\i\I. norm (z i)) * norm(z i - w i)" ``` hoelzl@57275 ` 890` ``` by (rule mult_right_mono) (auto intro: norm_setprod_le) ``` hoelzl@57275 ` 891` ``` also have "(\i\I. norm (z i)) \ (\i\I. 1)" ``` hoelzl@57275 ` 892` ``` by (intro setprod_mono) (auto intro!: insert) ``` hoelzl@57275 ` 893` ``` also have "norm ?t2 \ norm ((\i\I. z i) - (\i\I. w i)) * norm (w i)" ``` hoelzl@57275 ` 894` ``` by (rule norm_mult_ineq) ``` hoelzl@57275 ` 895` ``` also have "norm (w i) \ 1" ``` hoelzl@57275 ` 896` ``` by (auto intro: insert) ``` hoelzl@57275 ` 897` ``` also have "norm ((\i\I. z i) - (\i\I. w i)) \ (\i\I. norm (z i - w i))" ``` hoelzl@57275 ` 898` ``` using insert by auto ``` hoelzl@57275 ` 899` ``` finally show ?case ``` haftmann@57514 ` 900` ``` by (auto simp add: ac_simps mult_right_mono mult_left_mono) ``` hoelzl@57275 ` 901` ```qed simp_all ``` hoelzl@57275 ` 902` hoelzl@57275 ` 903` ```lemma norm_power_diff: ``` hoelzl@57275 ` 904` ``` fixes z w :: "'a::{real_normed_algebra_1, comm_monoid_mult}" ``` hoelzl@57275 ` 905` ``` assumes "norm z \ 1" "norm w \ 1" ``` hoelzl@57275 ` 906` ``` shows "norm (z^m - w^m) \ m * norm (z - w)" ``` hoelzl@57275 ` 907` ```proof - ``` hoelzl@57275 ` 908` ``` have "norm (z^m - w^m) = norm ((\ i < m. z) - (\ i < m. w))" ``` hoelzl@57275 ` 909` ``` by (simp add: setprod_constant) ``` hoelzl@57275 ` 910` ``` also have "\ \ (\i = m * norm (z - w)" ``` hoelzl@57275 ` 913` ``` by (simp add: real_of_nat_def) ``` hoelzl@57275 ` 914` ``` finally show ?thesis . ``` lp15@55719 ` 915` ```qed ``` lp15@55719 ` 916` hoelzl@51531 ` 917` ```subsection {* Metric spaces *} ``` hoelzl@51531 ` 918` hoelzl@51531 ` 919` ```class metric_space = open_dist + ``` hoelzl@51531 ` 920` ``` assumes dist_eq_0_iff [simp]: "dist x y = 0 \ x = y" ``` hoelzl@51531 ` 921` ``` assumes dist_triangle2: "dist x y \ dist x z + dist y z" ``` hoelzl@51531 ` 922` ```begin ``` hoelzl@51531 ` 923` hoelzl@51531 ` 924` ```lemma dist_self [simp]: "dist x x = 0" ``` hoelzl@51531 ` 925` ```by simp ``` hoelzl@51531 ` 926` hoelzl@51531 ` 927` ```lemma zero_le_dist [simp]: "0 \ dist x y" ``` hoelzl@51531 ` 928` ```using dist_triangle2 [of x x y] by simp ``` hoelzl@51531 ` 929` hoelzl@51531 ` 930` ```lemma zero_less_dist_iff: "0 < dist x y \ x \ y" ``` hoelzl@51531 ` 931` ```by (simp add: less_le) ``` hoelzl@51531 ` 932` hoelzl@51531 ` 933` ```lemma dist_not_less_zero [simp]: "\ dist x y < 0" ``` hoelzl@51531 ` 934` ```by (simp add: not_less) ``` hoelzl@51531 ` 935` hoelzl@51531 ` 936` ```lemma dist_le_zero_iff [simp]: "dist x y \ 0 \ x = y" ``` hoelzl@51531 ` 937` ```by (simp add: le_less) ``` hoelzl@51531 ` 938` hoelzl@51531 ` 939` ```lemma dist_commute: "dist x y = dist y x" ``` hoelzl@51531 ` 940` ```proof (rule order_antisym) ``` hoelzl@51531 ` 941` ``` show "dist x y \ dist y x" ``` hoelzl@51531 ` 942` ``` using dist_triangle2 [of x y x] by simp ``` hoelzl@51531 ` 943` ``` show "dist y x \ dist x y" ``` hoelzl@51531 ` 944` ``` using dist_triangle2 [of y x y] by simp ``` hoelzl@51531 ` 945` ```qed ``` hoelzl@51531 ` 946` hoelzl@51531 ` 947` ```lemma dist_triangle: "dist x z \ dist x y + dist y z" ``` hoelzl@51531 ` 948` ```using dist_triangle2 [of x z y] by (simp add: dist_commute) ``` hoelzl@51531 ` 949` hoelzl@51531 ` 950` ```lemma dist_triangle3: "dist x y \ dist a x + dist a y" ``` hoelzl@51531 ` 951` ```using dist_triangle2 [of x y a] by (simp add: dist_commute) ``` hoelzl@51531 ` 952` hoelzl@51531 ` 953` ```lemma dist_triangle_alt: ``` hoelzl@51531 ` 954` ``` shows "dist y z <= dist x y + dist x z" ``` hoelzl@51531 ` 955` ```by (rule dist_triangle3) ``` hoelzl@51531 ` 956` hoelzl@51531 ` 957` ```lemma dist_pos_lt: ``` hoelzl@51531 ` 958` ``` shows "x \ y ==> 0 < dist x y" ``` hoelzl@51531 ` 959` ```by (simp add: zero_less_dist_iff) ``` hoelzl@51531 ` 960` hoelzl@51531 ` 961` ```lemma dist_nz: ``` hoelzl@51531 ` 962` ``` shows "x \ y \ 0 < dist x y" ``` hoelzl@51531 ` 963` ```by (simp add: zero_less_dist_iff) ``` hoelzl@51531 ` 964` hoelzl@51531 ` 965` ```lemma dist_triangle_le: ``` hoelzl@51531 ` 966` ``` shows "dist x z + dist y z <= e \ dist x y <= e" ``` hoelzl@51531 ` 967` ```by (rule order_trans [OF dist_triangle2]) ``` hoelzl@51531 ` 968` hoelzl@51531 ` 969` ```lemma dist_triangle_lt: ``` hoelzl@51531 ` 970` ``` shows "dist x z + dist y z < e ==> dist x y < e" ``` hoelzl@51531 ` 971` ```by (rule le_less_trans [OF dist_triangle2]) ``` hoelzl@51531 ` 972` hoelzl@51531 ` 973` ```lemma dist_triangle_half_l: ``` hoelzl@51531 ` 974` ``` shows "dist x1 y < e / 2 \ dist x2 y < e / 2 \ dist x1 x2 < e" ``` hoelzl@51531 ` 975` ```by (rule dist_triangle_lt [where z=y], simp) ``` hoelzl@51531 ` 976` hoelzl@51531 ` 977` ```lemma dist_triangle_half_r: ``` hoelzl@51531 ` 978` ``` shows "dist y x1 < e / 2 \ dist y x2 < e / 2 \ dist x1 x2 < e" ``` hoelzl@51531 ` 979` ```by (rule dist_triangle_half_l, simp_all add: dist_commute) ``` hoelzl@51531 ` 980` hoelzl@51531 ` 981` ```subclass topological_space ``` hoelzl@51531 ` 982` ```proof ``` hoelzl@51531 ` 983` ``` have "\e::real. 0 < e" ``` hoelzl@51531 ` 984` ``` by (fast intro: zero_less_one) ``` hoelzl@51531 ` 985` ``` then show "open UNIV" ``` hoelzl@51531 ` 986` ``` unfolding open_dist by simp ``` hoelzl@51531 ` 987` ```next ``` hoelzl@51531 ` 988` ``` fix S T assume "open S" "open T" ``` hoelzl@51531 ` 989` ``` then show "open (S \ T)" ``` hoelzl@51531 ` 990` ``` unfolding open_dist ``` hoelzl@51531 ` 991` ``` apply clarify ``` hoelzl@51531 ` 992` ``` apply (drule (1) bspec)+ ``` hoelzl@51531 ` 993` ``` apply (clarify, rename_tac r s) ``` hoelzl@51531 ` 994` ``` apply (rule_tac x="min r s" in exI, simp) ``` hoelzl@51531 ` 995` ``` done ``` hoelzl@51531 ` 996` ```next ``` hoelzl@51531 ` 997` ``` fix K assume "\S\K. open S" thus "open (\K)" ``` hoelzl@51531 ` 998` ``` unfolding open_dist by fast ``` hoelzl@51531 ` 999` ```qed ``` hoelzl@51531 ` 1000` hoelzl@51531 ` 1001` ```lemma open_ball: "open {y. dist x y < d}" ``` hoelzl@51531 ` 1002` ```proof (unfold open_dist, intro ballI) ``` hoelzl@51531 ` 1003` ``` fix y assume *: "y \ {y. dist x y < d}" ``` hoelzl@51531 ` 1004` ``` then show "\e>0. \z. dist z y < e \ z \ {y. dist x y < d}" ``` hoelzl@51531 ` 1005` ``` by (auto intro!: exI[of _ "d - dist x y"] simp: field_simps dist_triangle_lt) ``` hoelzl@51531 ` 1006` ```qed ``` hoelzl@51531 ` 1007` hoelzl@51531 ` 1008` ```subclass first_countable_topology ``` hoelzl@51531 ` 1009` ```proof ``` hoelzl@51531 ` 1010` ``` fix x ``` hoelzl@51531 ` 1011` ``` show "\A::nat \ 'a set. (\i. x \ A i \ open (A i)) \ (\S. open S \ x \ S \ (\i. A i \ S))" ``` hoelzl@51531 ` 1012` ``` proof (safe intro!: exI[of _ "\n. {y. dist x y < inverse (Suc n)}"]) ``` hoelzl@51531 ` 1013` ``` fix S assume "open S" "x \ S" ``` wenzelm@53374 ` 1014` ``` then obtain e where e: "0 < e" and "{y. dist x y < e} \ S" ``` hoelzl@51531 ` 1015` ``` by (auto simp: open_dist subset_eq dist_commute) ``` hoelzl@51531 ` 1016` ``` moreover ``` wenzelm@53374 ` 1017` ``` from e obtain i where "inverse (Suc i) < e" ``` hoelzl@51531 ` 1018` ``` by (auto dest!: reals_Archimedean) ``` hoelzl@51531 ` 1019` ``` then have "{y. dist x y < inverse (Suc i)} \ {y. dist x y < e}" ``` hoelzl@51531 ` 1020` ``` by auto ``` hoelzl@51531 ` 1021` ``` ultimately show "\i. {y. dist x y < inverse (Suc i)} \ S" ``` hoelzl@51531 ` 1022` ``` by blast ``` hoelzl@51531 ` 1023` ``` qed (auto intro: open_ball) ``` hoelzl@51531 ` 1024` ```qed ``` hoelzl@51531 ` 1025` hoelzl@51531 ` 1026` ```end ``` hoelzl@51531 ` 1027` hoelzl@51531 ` 1028` ```instance metric_space \ t2_space ``` hoelzl@51531 ` 1029` ```proof ``` hoelzl@51531 ` 1030` ``` fix x y :: "'a::metric_space" ``` hoelzl@51531 ` 1031` ``` assume xy: "x \ y" ``` hoelzl@51531 ` 1032` ``` let ?U = "{y'. dist x y' < dist x y / 2}" ``` hoelzl@51531 ` 1033` ``` let ?V = "{x'. dist y x' < dist x y / 2}" ``` hoelzl@51531 ` 1034` ``` have th0: "\d x y z. (d x z :: real) \ d x y + d y z \ d y z = d z y ``` hoelzl@51531 ` 1035` ``` \ \(d x y * 2 < d x z \ d z y * 2 < d x z)" by arith ``` hoelzl@51531 ` 1036` ``` have "open ?U \ open ?V \ x \ ?U \ y \ ?V \ ?U \ ?V = {}" ``` hoelzl@51531 ` 1037` ``` using dist_pos_lt[OF xy] th0[of dist, OF dist_triangle dist_commute] ``` hoelzl@51531 ` 1038` ``` using open_ball[of _ "dist x y / 2"] by auto ``` hoelzl@51531 ` 1039` ``` then show "\U V. open U \ open V \ x \ U \ y \ V \ U \ V = {}" ``` hoelzl@51531 ` 1040` ``` by blast ``` hoelzl@51531 ` 1041` ```qed ``` hoelzl@51531 ` 1042` huffman@31289 ` 1043` ```text {* Every normed vector space is a metric space. *} ``` huffman@31285 ` 1044` huffman@31289 ` 1045` ```instance real_normed_vector < metric_space ``` huffman@31289 ` 1046` ```proof ``` huffman@31289 ` 1047` ``` fix x y :: 'a show "dist x y = 0 \ x = y" ``` huffman@31289 ` 1048` ``` unfolding dist_norm by simp ``` huffman@31289 ` 1049` ```next ``` huffman@31289 ` 1050` ``` fix x y z :: 'a show "dist x y \ dist x z + dist y z" ``` huffman@31289 ` 1051` ``` unfolding dist_norm ``` huffman@31289 ` 1052` ``` using norm_triangle_ineq4 [of "x - z" "y - z"] by simp ``` huffman@31289 ` 1053` ```qed ``` huffman@31285 ` 1054` huffman@31564 ` 1055` ```subsection {* Class instances for real numbers *} ``` huffman@31564 ` 1056` huffman@31564 ` 1057` ```instantiation real :: real_normed_field ``` huffman@31564 ` 1058` ```begin ``` huffman@31564 ` 1059` hoelzl@51531 ` 1060` ```definition dist_real_def: ``` hoelzl@51531 ` 1061` ``` "dist x y = \x - y\" ``` hoelzl@51531 ` 1062` haftmann@52381 ` 1063` ```definition open_real_def [code del]: ``` hoelzl@51531 ` 1064` ``` "open (S :: real set) \ (\x\S. \e>0. \y. dist y x < e \ y \ S)" ``` hoelzl@51531 ` 1065` huffman@31564 ` 1066` ```definition real_norm_def [simp]: ``` huffman@31564 ` 1067` ``` "norm r = \r\" ``` huffman@31564 ` 1068` huffman@31564 ` 1069` ```instance ``` huffman@31564 ` 1070` ```apply (intro_classes, unfold real_norm_def real_scaleR_def) ``` huffman@31564 ` 1071` ```apply (rule dist_real_def) ``` hoelzl@51531 ` 1072` ```apply (rule open_real_def) ``` huffman@36795 ` 1073` ```apply (simp add: sgn_real_def) ``` huffman@31564 ` 1074` ```apply (rule abs_eq_0) ``` huffman@31564 ` 1075` ```apply (rule abs_triangle_ineq) ``` huffman@31564 ` 1076` ```apply (rule abs_mult) ``` huffman@31564 ` 1077` ```apply (rule abs_mult) ``` huffman@31564 ` 1078` ```done ``` huffman@31564 ` 1079` huffman@31564 ` 1080` ```end ``` huffman@31564 ` 1081` haftmann@54890 ` 1082` ```declare [[code abort: "open :: real set \ bool"]] ``` haftmann@52381 ` 1083` hoelzl@51531 ` 1084` ```instance real :: linorder_topology ``` hoelzl@51531 ` 1085` ```proof ``` hoelzl@51531 ` 1086` ``` show "(open :: real set \ bool) = generate_topology (range lessThan \ range greaterThan)" ``` hoelzl@51531 ` 1087` ``` proof (rule ext, safe) ``` hoelzl@51531 ` 1088` ``` fix S :: "real set" assume "open S" ``` wenzelm@53381 ` 1089` ``` then obtain f where "\x\S. 0 < f x \ (\y. dist y x < f x \ y \ S)" ``` wenzelm@53381 ` 1090` ``` unfolding open_real_def bchoice_iff .. ``` hoelzl@51531 ` 1091` ``` then have *: "S = (\x\S. {x - f x <..} \ {..< x + f x})" ``` hoelzl@51531 ` 1092` ``` by (fastforce simp: dist_real_def) ``` hoelzl@51531 ` 1093` ``` show "generate_topology (range lessThan \ range greaterThan) S" ``` hoelzl@51531 ` 1094` ``` apply (subst *) ``` hoelzl@51531 ` 1095` ``` apply (intro generate_topology_Union generate_topology.Int) ``` hoelzl@51531 ` 1096` ``` apply (auto intro: generate_topology.Basis) ``` hoelzl@51531 ` 1097` ``` done ``` hoelzl@51531 ` 1098` ``` next ``` hoelzl@51531 ` 1099` ``` fix S :: "real set" assume "generate_topology (range lessThan \ range greaterThan) S" ``` hoelzl@51531 ` 1100` ``` moreover have "\a::real. open {.. (\y. \y - x\ < a - x \ y \ {..e>0. \y. \y - x\ < e \ y \ {..a::real. open {a <..}" ``` hoelzl@51531 ` 1108` ``` unfolding open_real_def dist_real_def ``` hoelzl@51531 ` 1109` ``` proof clarify ``` hoelzl@51531 ` 1110` ``` fix x a :: real assume "a < x" ``` hoelzl@51531 ` 1111` ``` hence "0 < x - a \ (\y. \y - x\ < x - a \ y \ {a<..})" by auto ``` hoelzl@51531 ` 1112` ``` thus "\e>0. \y. \y - x\ < e \ y \ {a<..}" .. ``` hoelzl@51531 ` 1113` ``` qed ``` hoelzl@51531 ` 1114` ``` ultimately show "open S" ``` hoelzl@51531 ` 1115` ``` by induct auto ``` hoelzl@51531 ` 1116` ``` qed ``` hoelzl@51531 ` 1117` ```qed ``` hoelzl@51531 ` 1118` hoelzl@51775 ` 1119` ```instance real :: linear_continuum_topology .. ``` hoelzl@51518 ` 1120` hoelzl@51531 ` 1121` ```lemmas open_real_greaterThan = open_greaterThan[where 'a=real] ``` hoelzl@51531 ` 1122` ```lemmas open_real_lessThan = open_lessThan[where 'a=real] ``` hoelzl@51531 ` 1123` ```lemmas open_real_greaterThanLessThan = open_greaterThanLessThan[where 'a=real] ``` hoelzl@51531 ` 1124` ```lemmas closed_real_atMost = closed_atMost[where 'a=real] ``` hoelzl@51531 ` 1125` ```lemmas closed_real_atLeast = closed_atLeast[where 'a=real] ``` hoelzl@51531 ` 1126` ```lemmas closed_real_atLeastAtMost = closed_atLeastAtMost[where 'a=real] ``` hoelzl@51531 ` 1127` huffman@31446 ` 1128` ```subsection {* Extra type constraints *} ``` huffman@31446 ` 1129` huffman@31492 ` 1130` ```text {* Only allow @{term "open"} in class @{text topological_space}. *} ``` huffman@31492 ` 1131` huffman@31492 ` 1132` ```setup {* Sign.add_const_constraint ``` huffman@31492 ` 1133` ``` (@{const_name "open"}, SOME @{typ "'a::topological_space set \ bool"}) *} ``` huffman@31492 ` 1134` huffman@31446 ` 1135` ```text {* Only allow @{term dist} in class @{text metric_space}. *} ``` huffman@31446 ` 1136` huffman@31446 ` 1137` ```setup {* Sign.add_const_constraint ``` huffman@31446 ` 1138` ``` (@{const_name dist}, SOME @{typ "'a::metric_space \ 'a \ real"}) *} ``` huffman@31446 ` 1139` huffman@31446 ` 1140` ```text {* Only allow @{term norm} in class @{text real_normed_vector}. *} ``` huffman@31446 ` 1141` huffman@31446 ` 1142` ```setup {* Sign.add_const_constraint ``` huffman@31446 ` 1143` ``` (@{const_name norm}, SOME @{typ "'a::real_normed_vector \ real"}) *} ``` huffman@31446 ` 1144` huffman@22972 ` 1145` ```subsection {* Sign function *} ``` huffman@22972 ` 1146` nipkow@24506 ` 1147` ```lemma norm_sgn: ``` nipkow@24506 ` 1148` ``` "norm (sgn(x::'a::real_normed_vector)) = (if x = 0 then 0 else 1)" ``` huffman@31586 ` 1149` ```by (simp add: sgn_div_norm) ``` huffman@22972 ` 1150` nipkow@24506 ` 1151` ```lemma sgn_zero [simp]: "sgn(0::'a::real_normed_vector) = 0" ``` nipkow@24506 ` 1152` ```by (simp add: sgn_div_norm) ``` huffman@22972 ` 1153` nipkow@24506 ` 1154` ```lemma sgn_zero_iff: "(sgn(x::'a::real_normed_vector) = 0) = (x = 0)" ``` nipkow@24506 ` 1155` ```by (simp add: sgn_div_norm) ``` huffman@22972 ` 1156` nipkow@24506 ` 1157` ```lemma sgn_minus: "sgn (- x) = - sgn(x::'a::real_normed_vector)" ``` nipkow@24506 ` 1158` ```by (simp add: sgn_div_norm) ``` huffman@22972 ` 1159` nipkow@24506 ` 1160` ```lemma sgn_scaleR: ``` nipkow@24506 ` 1161` ``` "sgn (scaleR r x) = scaleR (sgn r) (sgn(x::'a::real_normed_vector))" ``` haftmann@57514 ` 1162` ```by (simp add: sgn_div_norm ac_simps) ``` huffman@22973 ` 1163` huffman@22972 ` 1164` ```lemma sgn_one [simp]: "sgn (1::'a::real_normed_algebra_1) = 1" ``` nipkow@24506 ` 1165` ```by (simp add: sgn_div_norm) ``` huffman@22972 ` 1166` huffman@22972 ` 1167` ```lemma sgn_of_real: ``` huffman@22972 ` 1168` ``` "sgn (of_real r::'a::real_normed_algebra_1) = of_real (sgn r)" ``` huffman@22972 ` 1169` ```unfolding of_real_def by (simp only: sgn_scaleR sgn_one) ``` huffman@22972 ` 1170` huffman@22973 ` 1171` ```lemma sgn_mult: ``` huffman@22973 ` 1172` ``` fixes x y :: "'a::real_normed_div_algebra" ``` huffman@22973 ` 1173` ``` shows "sgn (x * y) = sgn x * sgn y" ``` haftmann@57512 ` 1174` ```by (simp add: sgn_div_norm norm_mult mult.commute) ``` huffman@22973 ` 1175` huffman@22972 ` 1176` ```lemma real_sgn_eq: "sgn (x::real) = x / \x\" ``` nipkow@24506 ` 1177` ```by (simp add: sgn_div_norm divide_inverse) ``` huffman@22972 ` 1178` huffman@22972 ` 1179` ```lemma real_sgn_pos: "0 < (x::real) \ sgn x = 1" ``` hoelzl@56479 ` 1180` ```unfolding real_sgn_eq by simp ``` huffman@22972 ` 1181` huffman@22972 ` 1182` ```lemma real_sgn_neg: "(x::real) < 0 \ sgn x = -1" ``` hoelzl@56479 ` 1183` ```unfolding real_sgn_eq by simp ``` huffman@22972 ` 1184` hoelzl@56889 ` 1185` ```lemma zero_le_sgn_iff [simp]: "0 \ sgn x \ 0 \ (x::real)" ``` hoelzl@56889 ` 1186` ``` by (cases "0::real" x rule: linorder_cases) simp_all ``` hoelzl@56889 ` 1187` ``` ``` hoelzl@56889 ` 1188` ```lemma zero_less_sgn_iff [simp]: "0 < sgn x \ 0 < (x::real)" ``` hoelzl@56889 ` 1189` ``` by (cases "0::real" x rule: linorder_cases) simp_all ``` hoelzl@56889 ` 1190` hoelzl@56889 ` 1191` ```lemma sgn_le_0_iff [simp]: "sgn x \ 0 \ (x::real) \ 0" ``` hoelzl@56889 ` 1192` ``` by (cases "0::real" x rule: linorder_cases) simp_all ``` hoelzl@56889 ` 1193` ``` ``` hoelzl@56889 ` 1194` ```lemma sgn_less_0_iff [simp]: "sgn x < 0 \ (x::real) < 0" ``` hoelzl@56889 ` 1195` ``` by (cases "0::real" x rule: linorder_cases) simp_all ``` hoelzl@56889 ` 1196` hoelzl@51474 ` 1197` ```lemma norm_conv_dist: "norm x = dist x 0" ``` hoelzl@51474 ` 1198` ``` unfolding dist_norm by simp ``` huffman@22972 ` 1199` huffman@22442 ` 1200` ```subsection {* Bounded Linear and Bilinear Operators *} ``` huffman@22442 ` 1201` huffman@53600 ` 1202` ```locale linear = additive f for f :: "'a::real_vector \ 'b::real_vector" + ``` huffman@22442 ` 1203` ``` assumes scaleR: "f (scaleR r x) = scaleR r (f x)" ``` huffman@53600 ` 1204` huffman@53600 ` 1205` ```lemma linearI: ``` huffman@53600 ` 1206` ``` assumes "\x y. f (x + y) = f x + f y" ``` huffman@53600 ` 1207` ``` assumes "\c x. f (c *\<^sub>R x) = c *\<^sub>R f x" ``` huffman@53600 ` 1208` ``` shows "linear f" ``` huffman@53600 ` 1209` ``` by default (rule assms)+ ``` huffman@53600 ` 1210` huffman@53600 ` 1211` ```locale bounded_linear = linear f for f :: "'a::real_normed_vector \ 'b::real_normed_vector" + ``` huffman@22442 ` 1212` ``` assumes bounded: "\K. \x. norm (f x) \ norm x * K" ``` huffman@27443 ` 1213` ```begin ``` huffman@22442 ` 1214` huffman@27443 ` 1215` ```lemma pos_bounded: ``` huffman@22442 ` 1216` ``` "\K>0. \x. norm (f x) \ norm x * K" ``` huffman@22442 ` 1217` ```proof - ``` huffman@22442 ` 1218` ``` obtain K where K: "\x. norm (f x) \ norm x * K" ``` huffman@22442 ` 1219` ``` using bounded by fast ``` huffman@22442 ` 1220` ``` show ?thesis ``` huffman@22442 ` 1221` ``` proof (intro exI impI conjI allI) ``` huffman@22442 ` 1222` ``` show "0 < max 1 K" ``` haftmann@54863 ` 1223` ``` by (rule order_less_le_trans [OF zero_less_one max.cobounded1]) ``` huffman@22442 ` 1224` ``` next ``` huffman@22442 ` 1225` ``` fix x ``` huffman@22442 ` 1226` ``` have "norm (f x) \ norm x * K" using K . ``` huffman@22442 ` 1227` ``` also have "\ \ norm x * max 1 K" ``` haftmann@54863 ` 1228` ``` by (rule mult_left_mono [OF max.cobounded2 norm_ge_zero]) ``` huffman@22442 ` 1229` ``` finally show "norm (f x) \ norm x * max 1 K" . ``` huffman@22442 ` 1230` ``` qed ``` huffman@22442 ` 1231` ```qed ``` huffman@22442 ` 1232` huffman@27443 ` 1233` ```lemma nonneg_bounded: ``` huffman@22442 ` 1234` ``` "\K\0. \x. norm (f x) \ norm x * K" ``` huffman@22442 ` 1235` ```proof - ``` huffman@22442 ` 1236` ``` from pos_bounded ``` huffman@22442 ` 1237` ``` show ?thesis by (auto intro: order_less_imp_le) ``` huffman@22442 ` 1238` ```qed ``` huffman@22442 ` 1239` hoelzl@56369 ` 1240` ```lemma linear: "linear f" .. ``` hoelzl@56369 ` 1241` huffman@27443 ` 1242` ```end ``` huffman@27443 ` 1243` huffman@44127 ` 1244` ```lemma bounded_linear_intro: ``` huffman@44127 ` 1245` ``` assumes "\x y. f (x + y) = f x + f y" ``` huffman@44127 ` 1246` ``` assumes "\r x. f (scaleR r x) = scaleR r (f x)" ``` huffman@44127 ` 1247` ``` assumes "\x. norm (f x) \ norm x * K" ``` huffman@44127 ` 1248` ``` shows "bounded_linear f" ``` huffman@44127 ` 1249` ``` by default (fast intro: assms)+ ``` huffman@44127 ` 1250` huffman@22442 ` 1251` ```locale bounded_bilinear = ``` huffman@22442 ` 1252` ``` fixes prod :: "['a::real_normed_vector, 'b::real_normed_vector] ``` huffman@22442 ` 1253` ``` \ 'c::real_normed_vector" ``` huffman@22442 ` 1254` ``` (infixl "**" 70) ``` huffman@22442 ` 1255` ``` assumes add_left: "prod (a + a') b = prod a b + prod a' b" ``` huffman@22442 ` 1256` ``` assumes add_right: "prod a (b + b') = prod a b + prod a b'" ``` huffman@22442 ` 1257` ``` assumes scaleR_left: "prod (scaleR r a) b = scaleR r (prod a b)" ``` huffman@22442 ` 1258` ``` assumes scaleR_right: "prod a (scaleR r b) = scaleR r (prod a b)" ``` huffman@22442 ` 1259` ``` assumes bounded: "\K. \a b. norm (prod a b) \ norm a * norm b * K" ``` huffman@27443 ` 1260` ```begin ``` huffman@22442 ` 1261` huffman@27443 ` 1262` ```lemma pos_bounded: ``` huffman@22442 ` 1263` ``` "\K>0. \a b. norm (a ** b) \ norm a * norm b * K" ``` huffman@22442 ` 1264` ```apply (cut_tac bounded, erule exE) ``` huffman@22442 ` 1265` ```apply (rule_tac x="max 1 K" in exI, safe) ``` haftmann@54863 ` 1266` ```apply (rule order_less_le_trans [OF zero_less_one max.cobounded1]) ``` huffman@22442 ` 1267` ```apply (drule spec, drule spec, erule order_trans) ``` haftmann@54863 ` 1268` ```apply (rule mult_left_mono [OF max.cobounded2]) ``` huffman@22442 ` 1269` ```apply (intro mult_nonneg_nonneg norm_ge_zero) ``` huffman@22442 ` 1270` ```done ``` huffman@22442 ` 1271` huffman@27443 ` 1272` ```lemma nonneg_bounded: ``` huffman@22442 ` 1273` ``` "\K\0. \a b. norm (a ** b) \ norm a * norm b * K" ``` huffman@22442 ` 1274` ```proof - ``` huffman@22442 ` 1275` ``` from pos_bounded ``` huffman@22442 ` 1276` ``` show ?thesis by (auto intro: order_less_imp_le) ``` huffman@22442 ` 1277` ```qed ``` huffman@22442 ` 1278` huffman@27443 ` 1279` ```lemma additive_right: "additive (\b. prod a b)" ``` huffman@22442 ` 1280` ```by (rule additive.intro, rule add_right) ``` huffman@22442 ` 1281` huffman@27443 ` 1282` ```lemma additive_left: "additive (\a. prod a b)" ``` huffman@22442 ` 1283` ```by (rule additive.intro, rule add_left) ``` huffman@22442 ` 1284` huffman@27443 ` 1285` ```lemma zero_left: "prod 0 b = 0" ``` huffman@22442 ` 1286` ```by (rule additive.zero [OF additive_left]) ``` huffman@22442 ` 1287` huffman@27443 ` 1288` ```lemma zero_right: "prod a 0 = 0" ``` huffman@22442 ` 1289` ```by (rule additive.zero [OF additive_right]) ``` huffman@22442 ` 1290` huffman@27443 ` 1291` ```lemma minus_left: "prod (- a) b = - prod a b" ``` huffman@22442 ` 1292` ```by (rule additive.minus [OF additive_left]) ``` huffman@22442 ` 1293` huffman@27443 ` 1294` ```lemma minus_right: "prod a (- b) = - prod a b" ``` huffman@22442 ` 1295` ```by (rule additive.minus [OF additive_right]) ``` huffman@22442 ` 1296` huffman@27443 ` 1297` ```lemma diff_left: ``` huffman@22442 ` 1298` ``` "prod (a - a') b = prod a b - prod a' b" ``` huffman@22442 ` 1299` ```by (rule additive.diff [OF additive_left]) ``` huffman@22442 ` 1300` huffman@27443 ` 1301` ```lemma diff_right: ``` huffman@22442 ` 1302` ``` "prod a (b - b') = prod a b - prod a b'" ``` huffman@22442 ` 1303` ```by (rule additive.diff [OF additive_right]) ``` huffman@22442 ` 1304` huffman@27443 ` 1305` ```lemma bounded_linear_left: ``` huffman@22442 ` 1306` ``` "bounded_linear (\a. a ** b)" ``` huffman@44127 ` 1307` ```apply (cut_tac bounded, safe) ``` huffman@44127 ` 1308` ```apply (rule_tac K="norm b * K" in bounded_linear_intro) ``` huffman@22442 ` 1309` ```apply (rule add_left) ``` huffman@22442 ` 1310` ```apply (rule scaleR_left) ``` haftmann@57514 ` 1311` ```apply (simp add: ac_simps) ``` huffman@22442 ` 1312` ```done ``` huffman@22442 ` 1313` huffman@27443 ` 1314` ```lemma bounded_linear_right: ``` huffman@22442 ` 1315` ``` "bounded_linear (\b. a ** b)" ``` huffman@44127 ` 1316` ```apply (cut_tac bounded, safe) ``` huffman@44127 ` 1317` ```apply (rule_tac K="norm a * K" in bounded_linear_intro) ``` huffman@22442 ` 1318` ```apply (rule add_right) ``` huffman@22442 ` 1319` ```apply (rule scaleR_right) ``` haftmann@57514 ` 1320` ```apply (simp add: ac_simps) ``` huffman@22442 ` 1321` ```done ``` huffman@22442 ` 1322` huffman@27443 ` 1323` ```lemma prod_diff_prod: ``` huffman@22442 ` 1324` ``` "(x ** y - a ** b) = (x - a) ** (y - b) + (x - a) ** b + a ** (y - b)" ``` huffman@22442 ` 1325` ```by (simp add: diff_left diff_right) ``` huffman@22442 ` 1326` huffman@27443 ` 1327` ```end ``` huffman@27443 ` 1328` hoelzl@51642 ` 1329` ```lemma bounded_linear_ident[simp]: "bounded_linear (\x. x)" ``` hoelzl@51642 ` 1330` ``` by default (auto intro!: exI[of _ 1]) ``` hoelzl@51642 ` 1331` hoelzl@51642 ` 1332` ```lemma bounded_linear_zero[simp]: "bounded_linear (\x. 0)" ``` hoelzl@51642 ` 1333` ``` by default (auto intro!: exI[of _ 1]) ``` hoelzl@51642 ` 1334` hoelzl@51642 ` 1335` ```lemma bounded_linear_add: ``` hoelzl@51642 ` 1336` ``` assumes "bounded_linear f" ``` hoelzl@51642 ` 1337` ``` assumes "bounded_linear g" ``` hoelzl@51642 ` 1338` ``` shows "bounded_linear (\x. f x + g x)" ``` hoelzl@51642 ` 1339` ```proof - ``` hoelzl@51642 ` 1340` ``` interpret f: bounded_linear f by fact ``` hoelzl@51642 ` 1341` ``` interpret g: bounded_linear g by fact ``` hoelzl@51642 ` 1342` ``` show ?thesis ``` hoelzl@51642 ` 1343` ``` proof ``` hoelzl@51642 ` 1344` ``` from f.bounded obtain Kf where Kf: "\x. norm (f x) \ norm x * Kf" by blast ``` hoelzl@51642 ` 1345` ``` from g.bounded obtain Kg where Kg: "\x. norm (g x) \ norm x * Kg" by blast ``` hoelzl@51642 ` 1346` ``` show "\K. \x. norm (f x + g x) \ norm x * K" ``` hoelzl@51642 ` 1347` ``` using add_mono[OF Kf Kg] ``` hoelzl@51642 ` 1348` ``` by (intro exI[of _ "Kf + Kg"]) (auto simp: field_simps intro: norm_triangle_ineq order_trans) ``` hoelzl@51642 ` 1349` ``` qed (simp_all add: f.add g.add f.scaleR g.scaleR scaleR_right_distrib) ``` hoelzl@51642 ` 1350` ```qed ``` hoelzl@51642 ` 1351` hoelzl@51642 ` 1352` ```lemma bounded_linear_minus: ``` hoelzl@51642 ` 1353` ``` assumes "bounded_linear f" ``` hoelzl@51642 ` 1354` ``` shows "bounded_linear (\x. - f x)" ``` hoelzl@51642 ` 1355` ```proof - ``` hoelzl@51642 ` 1356` ``` interpret f: bounded_linear f by fact ``` hoelzl@51642 ` 1357` ``` show ?thesis apply (unfold_locales) ``` hoelzl@51642 ` 1358` ``` apply (simp add: f.add) ``` hoelzl@51642 ` 1359` ``` apply (simp add: f.scaleR) ``` hoelzl@51642 ` 1360` ``` apply (simp add: f.bounded) ``` hoelzl@51642 ` 1361` ``` done ``` hoelzl@51642 ` 1362` ```qed ``` hoelzl@51642 ` 1363` hoelzl@51642 ` 1364` ```lemma bounded_linear_compose: ``` hoelzl@51642 ` 1365` ``` assumes "bounded_linear f" ``` hoelzl@51642 ` 1366` ``` assumes "bounded_linear g" ``` hoelzl@51642 ` 1367` ``` shows "bounded_linear (\x. f (g x))" ``` hoelzl@51642 ` 1368` ```proof - ``` hoelzl@51642 ` 1369` ``` interpret f: bounded_linear f by fact ``` hoelzl@51642 ` 1370` ``` interpret g: bounded_linear g by fact ``` hoelzl@51642 ` 1371` ``` show ?thesis proof (unfold_locales) ``` hoelzl@51642 ` 1372` ``` fix x y show "f (g (x + y)) = f (g x) + f (g y)" ``` hoelzl@51642 ` 1373` ``` by (simp only: f.add g.add) ``` hoelzl@51642 ` 1374` ``` next ``` hoelzl@51642 ` 1375` ``` fix r x show "f (g (scaleR r x)) = scaleR r (f (g x))" ``` hoelzl@51642 ` 1376` ``` by (simp only: f.scaleR g.scaleR) ``` hoelzl@51642 ` 1377` ``` next ``` hoelzl@51642 ` 1378` ``` from f.pos_bounded ``` hoelzl@51642 ` 1379` ``` obtain Kf where f: "\x. norm (f x) \ norm x * Kf" and Kf: "0 < Kf" by fast ``` hoelzl@51642 ` 1380` ``` from g.pos_bounded ``` hoelzl@51642 ` 1381` ``` obtain Kg where g: "\x. norm (g x) \ norm x * Kg" by fast ``` hoelzl@51642 ` 1382` ``` show "\K. \x. norm (f (g x)) \ norm x * K" ``` hoelzl@51642 ` 1383` ``` proof (intro exI allI) ``` hoelzl@51642 ` 1384` ``` fix x ``` hoelzl@51642 ` 1385` ``` have "norm (f (g x)) \ norm (g x) * Kf" ``` hoelzl@51642 ` 1386` ``` using f . ``` hoelzl@51642 ` 1387` ``` also have "\ \ (norm x * Kg) * Kf" ``` hoelzl@51642 ` 1388` ``` using g Kf [THEN order_less_imp_le] by (rule mult_right_mono) ``` hoelzl@51642 ` 1389` ``` also have "(norm x * Kg) * Kf = norm x * (Kg * Kf)" ``` haftmann@57512 ` 1390` ``` by (rule mult.assoc) ``` hoelzl@51642 ` 1391` ``` finally show "norm (f (g x)) \ norm x * (Kg * Kf)" . ``` hoelzl@51642 ` 1392` ``` qed ``` hoelzl@51642 ` 1393` ``` qed ``` hoelzl@51642 ` 1394` ```qed ``` hoelzl@51642 ` 1395` huffman@44282 ` 1396` ```lemma bounded_bilinear_mult: ``` huffman@44282 ` 1397` ``` "bounded_bilinear (op * :: 'a \ 'a \ 'a::real_normed_algebra)" ``` huffman@22442 ` 1398` ```apply (rule bounded_bilinear.intro) ``` webertj@49962 ` 1399` ```apply (rule distrib_right) ``` webertj@49962 ` 1400` ```apply (rule distrib_left) ``` huffman@22442 ` 1401` ```apply (rule mult_scaleR_left) ``` huffman@22442 ` 1402` ```apply (rule mult_scaleR_right) ``` huffman@22442 ` 1403` ```apply (rule_tac x="1" in exI) ``` huffman@22442 ` 1404` ```apply (simp add: norm_mult_ineq) ``` huffman@22442 ` 1405` ```done ``` huffman@22442 ` 1406` huffman@44282 ` 1407` ```lemma bounded_linear_mult_left: ``` huffman@44282 ` 1408` ``` "bounded_linear (\x::'a::real_normed_algebra. x * y)" ``` huffman@44282 ` 1409` ``` using bounded_bilinear_mult ``` huffman@44282 ` 1410` ``` by (rule bounded_bilinear.bounded_linear_left) ``` huffman@22442 ` 1411` huffman@44282 ` 1412` ```lemma bounded_linear_mult_right: ``` huffman@44282 ` 1413` ``` "bounded_linear (\y::'a::real_normed_algebra. x * y)" ``` huffman@44282 ` 1414` ``` using bounded_bilinear_mult ``` huffman@44282 ` 1415` ``` by (rule bounded_bilinear.bounded_linear_right) ``` huffman@23127 ` 1416` hoelzl@51642 ` 1417` ```lemmas bounded_linear_mult_const = ``` hoelzl@51642 ` 1418` ``` bounded_linear_mult_left [THEN bounded_linear_compose] ``` hoelzl@51642 ` 1419` hoelzl@51642 ` 1420` ```lemmas bounded_linear_const_mult = ``` hoelzl@51642 ` 1421` ``` bounded_linear_mult_right [THEN bounded_linear_compose] ``` hoelzl@51642 ` 1422` huffman@44282 ` 1423` ```lemma bounded_linear_divide: ``` huffman@44282 ` 1424` ``` "bounded_linear (\x::'a::real_normed_field. x / y)" ``` huffman@44282 ` 1425` ``` unfolding divide_inverse by (rule bounded_linear_mult_left) ``` huffman@23120 ` 1426` huffman@44282 ` 1427` ```lemma bounded_bilinear_scaleR: "bounded_bilinear scaleR" ``` huffman@22442 ` 1428` ```apply (rule bounded_bilinear.intro) ``` huffman@22442 ` 1429` ```apply (rule scaleR_left_distrib) ``` huffman@22442 ` 1430` ```apply (rule scaleR_right_distrib) ``` huffman@22973 ` 1431` ```apply simp ``` huffman@22442 ` 1432` ```apply (rule scaleR_left_commute) ``` huffman@31586 ` 1433` ```apply (rule_tac x="1" in exI, simp) ``` huffman@22442 ` 1434` ```done ``` huffman@22442 ` 1435` huffman@44282 ` 1436` ```lemma bounded_linear_scaleR_left: "bounded_linear (\r. scaleR r x)" ``` huffman@44282 ` 1437` ``` using bounded_bilinear_scaleR ``` huffman@44282 ` 1438` ``` by (rule bounded_bilinear.bounded_linear_left) ``` huffman@23127 ` 1439` huffman@44282 ` 1440` ```lemma bounded_linear_scaleR_right: "bounded_linear (\x. scaleR r x)" ``` huffman@44282 ` 1441` ``` using bounded_bilinear_scaleR ``` huffman@44282 ` 1442` ``` by (rule bounded_bilinear.bounded_linear_right) ``` huffman@23127 ` 1443` huffman@44282 ` 1444` ```lemma bounded_linear_of_real: "bounded_linear (\r. of_real r)" ``` huffman@44282 ` 1445` ``` unfolding of_real_def by (rule bounded_linear_scaleR_left) ``` huffman@22625 ` 1446` hoelzl@51642 ` 1447` ```lemma real_bounded_linear: ``` hoelzl@51642 ` 1448` ``` fixes f :: "real \ real" ``` hoelzl@51642 ` 1449` ``` shows "bounded_linear f \ (\c::real. f = (\x. x * c))" ``` hoelzl@51642 ` 1450` ```proof - ``` hoelzl@51642 ` 1451` ``` { fix x assume "bounded_linear f" ``` hoelzl@51642 ` 1452` ``` then interpret bounded_linear f . ``` hoelzl@51642 ` 1453` ``` from scaleR[of x 1] have "f x = x * f 1" ``` hoelzl@51642 ` 1454` ``` by simp } ``` hoelzl@51642 ` 1455` ``` then show ?thesis ``` hoelzl@51642 ` 1456` ``` by (auto intro: exI[of _ "f 1"] bounded_linear_mult_left) ``` hoelzl@51642 ` 1457` ```qed ``` hoelzl@51642 ` 1458` huffman@44571 ` 1459` ```instance real_normed_algebra_1 \ perfect_space ``` huffman@44571 ` 1460` ```proof ``` huffman@44571 ` 1461` ``` fix x::'a ``` huffman@44571 ` 1462` ``` show "\ open {x}" ``` huffman@44571 ` 1463` ``` unfolding open_dist dist_norm ``` huffman@44571 ` 1464` ``` by (clarsimp, rule_tac x="x + of_real (e/2)" in exI, simp) ``` huffman@44571 ` 1465` ```qed ``` huffman@44571 ` 1466` hoelzl@51531 ` 1467` ```subsection {* Filters and Limits on Metric Space *} ``` hoelzl@51531 ` 1468` hoelzl@57448 ` 1469` ```lemma (in metric_space) nhds_metric: "nhds x = (INF e:{0 <..}. principal {y. dist y x < e})" ``` hoelzl@57448 ` 1470` ``` unfolding nhds_def ``` hoelzl@57448 ` 1471` ```proof (safe intro!: INF_eq) ``` hoelzl@57448 ` 1472` ``` fix S assume "open S" "x \ S" ``` hoelzl@57448 ` 1473` ``` then obtain e where "{y. dist y x < e} \ S" "0 < e" ``` hoelzl@57448 ` 1474` ``` by (auto simp: open_dist subset_eq) ``` hoelzl@57448 ` 1475` ``` then show "\e\{0<..}. principal {y. dist y x < e} \ principal S" ``` hoelzl@57448 ` 1476` ``` by auto ``` hoelzl@57448 ` 1477` ```qed (auto intro!: exI[of _ "{y. dist x y < e}" for e] open_ball simp: dist_commute) ``` hoelzl@57448 ` 1478` hoelzl@57448 ` 1479` ```lemma (in metric_space) tendsto_iff: ``` hoelzl@57448 ` 1480` ``` "(f ---> l) F \ (\e>0. eventually (\x. dist (f x) l < e) F)" ``` hoelzl@57448 ` 1481` ``` unfolding nhds_metric filterlim_INF filterlim_principal by auto ``` hoelzl@57448 ` 1482` hoelzl@57448 ` 1483` ```lemma (in metric_space) tendstoI: "(\e. 0 < e \ eventually (\x. dist (f x) l < e) F) \ (f ---> l) F" ``` hoelzl@57448 ` 1484` ``` by (auto simp: tendsto_iff) ``` hoelzl@57448 ` 1485` hoelzl@57448 ` 1486` ```lemma (in metric_space) tendstoD: "(f ---> l) F \ 0 < e \ eventually (\x. dist (f x) l < e) F" ``` hoelzl@57448 ` 1487` ``` by (auto simp: tendsto_iff) ``` hoelzl@57448 ` 1488` hoelzl@57448 ` 1489` ```lemma (in metric_space) eventually_nhds_metric: ``` hoelzl@57448 ` 1490` ``` "eventually P (nhds a) \ (\d>0. \x. dist x a < d \ P x)" ``` hoelzl@57448 ` 1491` ``` unfolding nhds_metric ``` hoelzl@57448 ` 1492` ``` by (subst eventually_INF_base) ``` hoelzl@57448 ` 1493` ``` (auto simp: eventually_principal Bex_def subset_eq intro: exI[of _ "min a b" for a b]) ``` hoelzl@51531 ` 1494` hoelzl@51531 ` 1495` ```lemma eventually_at: ``` hoelzl@51641 ` 1496` ``` fixes a :: "'a :: metric_space" ``` hoelzl@51641 ` 1497` ``` shows "eventually P (at a within S) \ (\d>0. \x\S. x \ a \ dist x a < d \ P x)" ``` hoelzl@51641 ` 1498` ``` unfolding eventually_at_filter eventually_nhds_metric by (auto simp: dist_nz) ``` hoelzl@51531 ` 1499` hoelzl@51641 ` 1500` ```lemma eventually_at_le: ``` hoelzl@51641 ` 1501` ``` fixes a :: "'a::metric_space" ``` hoelzl@51641 ` 1502` ``` shows "eventually P (at a within S) \ (\d>0. \x\S. x \ a \ dist x a \ d \ P x)" ``` hoelzl@51641 ` 1503` ``` unfolding eventually_at_filter eventually_nhds_metric ``` hoelzl@51641 ` 1504` ``` apply auto ``` hoelzl@51641 ` 1505` ``` apply (rule_tac x="d / 2" in exI) ``` hoelzl@51641 ` 1506` ``` apply auto ``` hoelzl@51641 ` 1507` ``` done ``` hoelzl@51531 ` 1508` hoelzl@51531 ` 1509` ```lemma metric_tendsto_imp_tendsto: ``` hoelzl@51531 ` 1510` ``` fixes a :: "'a :: metric_space" and b :: "'b :: metric_space" ``` hoelzl@51531 ` 1511` ``` assumes f: "(f ---> a) F" ``` hoelzl@51531 ` 1512` ``` assumes le: "eventually (\x. dist (g x) b \ dist (f x) a) F" ``` hoelzl@51531 ` 1513` ``` shows "(g ---> b) F" ``` hoelzl@51531 ` 1514` ```proof (rule tendstoI) ``` hoelzl@51531 ` 1515` ``` fix e :: real assume "0 < e" ``` hoelzl@51531 ` 1516` ``` with f have "eventually (\x. dist (f x) a < e) F" by (rule tendstoD) ``` hoelzl@51531 ` 1517` ``` with le show "eventually (\x. dist (g x) b < e) F" ``` hoelzl@51531 ` 1518` ``` using le_less_trans by (rule eventually_elim2) ``` hoelzl@51531 ` 1519` ```qed ``` hoelzl@51531 ` 1520` hoelzl@51531 ` 1521` ```lemma filterlim_real_sequentially: "LIM x sequentially. real x :> at_top" ``` hoelzl@51531 ` 1522` ``` unfolding filterlim_at_top ``` hoelzl@51531 ` 1523` ``` apply (intro allI) ``` hoelzl@51531 ` 1524` ``` apply (rule_tac c="natceiling (Z + 1)" in eventually_sequentiallyI) ``` hoelzl@51531 ` 1525` ``` apply (auto simp: natceiling_le_eq) ``` hoelzl@51531 ` 1526` ``` done ``` hoelzl@51531 ` 1527` hoelzl@51531 ` 1528` ```subsubsection {* Limits of Sequences *} ``` hoelzl@51531 ` 1529` hoelzl@51531 ` 1530` ```lemma LIMSEQ_def: "X ----> (L::'a::metric_space) \ (\r>0. \no. \n\no. dist (X n) L < r)" ``` hoelzl@51531 ` 1531` ``` unfolding tendsto_iff eventually_sequentially .. ``` hoelzl@51531 ` 1532` hoelzl@51531 ` 1533` ```lemma LIMSEQ_iff_nz: "X ----> (L::'a::metric_space) = (\r>0. \no>0. \n\no. dist (X n) L < r)" ``` hoelzl@51531 ` 1534` ``` unfolding LIMSEQ_def by (metis Suc_leD zero_less_Suc) ``` hoelzl@51531 ` 1535` hoelzl@51531 ` 1536` ```lemma metric_LIMSEQ_I: ``` hoelzl@51531 ` 1537` ``` "(\r. 0 < r \ \no. \n\no. dist (X n) L < r) \ X ----> (L::'a::metric_space)" ``` hoelzl@51531 ` 1538` ```by (simp add: LIMSEQ_def) ``` hoelzl@51531 ` 1539` hoelzl@51531 ` 1540` ```lemma metric_LIMSEQ_D: ``` hoelzl@51531 ` 1541` ``` "\X ----> (L::'a::metric_space); 0 < r\ \ \no. \n\no. dist (X n) L < r" ``` hoelzl@51531 ` 1542` ```by (simp add: LIMSEQ_def) ``` hoelzl@51531 ` 1543` hoelzl@51531 ` 1544` hoelzl@51531 ` 1545` ```subsubsection {* Limits of Functions *} ``` hoelzl@51531 ` 1546` hoelzl@51531 ` 1547` ```lemma LIM_def: "f -- (a::'a::metric_space) --> (L::'b::metric_space) = ``` hoelzl@51531 ` 1548` ``` (\r > 0. \s > 0. \x. x \ a & dist x a < s ``` hoelzl@51531 ` 1549` ``` --> dist (f x) L < r)" ``` hoelzl@51641 ` 1550` ``` unfolding tendsto_iff eventually_at by simp ``` hoelzl@51531 ` 1551` hoelzl@51531 ` 1552` ```lemma metric_LIM_I: ``` hoelzl@51531 ` 1553` ``` "(\r. 0 < r \ \s>0. \x. x \ a \ dist x a < s \ dist (f x) L < r) ``` hoelzl@51531 ` 1554` ``` \ f -- (a::'a::metric_space) --> (L::'b::metric_space)" ``` hoelzl@51531 ` 1555` ```by (simp add: LIM_def) ``` hoelzl@51531 ` 1556` hoelzl@51531 ` 1557` ```lemma metric_LIM_D: ``` hoelzl@51531 ` 1558` ``` "\f -- (a::'a::metric_space) --> (L::'b::metric_space); 0 < r\ ``` hoelzl@51531 ` 1559` ``` \ \s>0. \x. x \ a \ dist x a < s \ dist (f x) L < r" ``` hoelzl@51531 ` 1560` ```by (simp add: LIM_def) ``` hoelzl@51531 ` 1561` hoelzl@51531 ` 1562` ```lemma metric_LIM_imp_LIM: ``` hoelzl@51531 ` 1563` ``` assumes f: "f -- a --> (l::'a::metric_space)" ``` hoelzl@51531 ` 1564` ``` assumes le: "\x. x \ a \ dist (g x) m \ dist (f x) l" ``` hoelzl@51531 ` 1565` ``` shows "g -- a --> (m::'b::metric_space)" ``` hoelzl@51531 ` 1566` ``` by (rule metric_tendsto_imp_tendsto [OF f]) (auto simp add: eventually_at_topological le) ``` hoelzl@51531 ` 1567` hoelzl@51531 ` 1568` ```lemma metric_LIM_equal2: ``` hoelzl@51531 ` 1569` ``` assumes 1: "0 < R" ``` hoelzl@51531 ` 1570` ``` assumes 2: "\x. \x \ a; dist x a < R\ \ f x = g x" ``` hoelzl@51531 ` 1571` ``` shows "g -- a --> l \ f -- (a::'a::metric_space) --> l" ``` hoelzl@51531 ` 1572` ```apply (rule topological_tendstoI) ``` hoelzl@51531 ` 1573` ```apply (drule (2) topological_tendstoD) ``` hoelzl@51531 ` 1574` ```apply (simp add: eventually_at, safe) ``` hoelzl@51531 ` 1575` ```apply (rule_tac x="min d R" in exI, safe) ``` hoelzl@51531 ` 1576` ```apply (simp add: 1) ``` hoelzl@51531 ` 1577` ```apply (simp add: 2) ``` hoelzl@51531 ` 1578` ```done ``` hoelzl@51531 ` 1579` hoelzl@51531 ` 1580` ```lemma metric_LIM_compose2: ``` hoelzl@51531 ` 1581` ``` assumes f: "f -- (a::'a::metric_space) --> b" ``` hoelzl@51531 ` 1582` ``` assumes g: "g -- b --> c" ``` hoelzl@51531 ` 1583` ``` assumes inj: "\d>0. \x. x \ a \ dist x a < d \ f x \ b" ``` hoelzl@51531 ` 1584` ``` shows "(\x. g (f x)) -- a --> c" ``` hoelzl@51641 ` 1585` ``` using inj ``` hoelzl@51641 ` 1586` ``` by (intro tendsto_compose_eventually[OF g f]) (auto simp: eventually_at) ``` hoelzl@51531 ` 1587` hoelzl@51531 ` 1588` ```lemma metric_isCont_LIM_compose2: ``` hoelzl@51531 ` 1589` ``` fixes f :: "'a :: metric_space \ _" ``` hoelzl@51531 ` 1590` ``` assumes f [unfolded isCont_def]: "isCont f a" ``` hoelzl@51531 ` 1591` ``` assumes g: "g -- f a --> l" ``` hoelzl@51531 ` 1592` ``` assumes inj: "\d>0. \x. x \ a \ dist x a < d \ f x \ f a" ``` hoelzl@51531 ` 1593` ``` shows "(\x. g (f x)) -- a --> l" ``` hoelzl@51531 ` 1594` ```by (rule metric_LIM_compose2 [OF f g inj]) ``` hoelzl@51531 ` 1595` hoelzl@51531 ` 1596` ```subsection {* Complete metric spaces *} ``` hoelzl@51531 ` 1597` hoelzl@51531 ` 1598` ```subsection {* Cauchy sequences *} ``` hoelzl@51531 ` 1599` hoelzl@51531 ` 1600` ```definition (in metric_space) Cauchy :: "(nat \ 'a) \ bool" where ``` hoelzl@51531 ` 1601` ``` "Cauchy X = (\e>0. \M. \m \ M. \n \ M. dist (X m) (X n) < e)" ``` hoelzl@51531 ` 1602` hoelzl@51531 ` 1603` ```subsection {* Cauchy Sequences *} ``` hoelzl@51531 ` 1604` hoelzl@51531 ` 1605` ```lemma metric_CauchyI: ``` hoelzl@51531 ` 1606` ``` "(\e. 0 < e \ \M. \m\M. \n\M. dist (X m) (X n) < e) \ Cauchy X" ``` hoelzl@51531 ` 1607` ``` by (simp add: Cauchy_def) ``` hoelzl@51531 ` 1608` hoelzl@51531 ` 1609` ```lemma metric_CauchyD: ``` hoelzl@51531 ` 1610` ``` "Cauchy X \ 0 < e \ \M. \m\M. \n\M. dist (X m) (X n) < e" ``` hoelzl@51531 ` 1611` ``` by (simp add: Cauchy_def) ``` hoelzl@51531 ` 1612` hoelzl@51531 ` 1613` ```lemma metric_Cauchy_iff2: ``` hoelzl@51531 ` 1614` ``` "Cauchy X = (\j. (\M. \m \ M. \n \ M. dist (X m) (X n) < inverse(real (Suc j))))" ``` hoelzl@51531 ` 1615` ```apply (simp add: Cauchy_def, auto) ``` hoelzl@51531 ` 1616` ```apply (drule reals_Archimedean, safe) ``` hoelzl@51531 ` 1617` ```apply (drule_tac x = n in spec, auto) ``` hoelzl@51531 ` 1618` ```apply (rule_tac x = M in exI, auto) ``` hoelzl@51531 ` 1619` ```apply (drule_tac x = m in spec, simp) ``` hoelzl@51531 ` 1620` ```apply (drule_tac x = na in spec, auto) ``` hoelzl@51531 ` 1621` ```done ``` hoelzl@51531 ` 1622` hoelzl@51531 ` 1623` ```lemma Cauchy_iff2: ``` hoelzl@51531 ` 1624` ``` "Cauchy X = (\j. (\M. \m \ M. \n \ M. \X m - X n\ < inverse(real (Suc j))))" ``` hoelzl@51531 ` 1625` ``` unfolding metric_Cauchy_iff2 dist_real_def .. ``` hoelzl@51531 ` 1626` hoelzl@51531 ` 1627` ```lemma Cauchy_subseq_Cauchy: ``` hoelzl@51531 ` 1628` ``` "\ Cauchy X; subseq f \ \ Cauchy (X o f)" ``` hoelzl@51531 ` 1629` ```apply (auto simp add: Cauchy_def) ``` hoelzl@51531 ` 1630` ```apply (drule_tac x=e in spec, clarify) ``` hoelzl@51531 ` 1631` ```apply (rule_tac x=M in exI, clarify) ``` hoelzl@51531 ` 1632` ```apply (blast intro: le_trans [OF _ seq_suble] dest!: spec) ``` hoelzl@51531 ` 1633` ```done ``` hoelzl@51531 ` 1634` hoelzl@51531 ` 1635` ```theorem LIMSEQ_imp_Cauchy: ``` hoelzl@51531 ` 1636` ``` assumes X: "X ----> a" shows "Cauchy X" ``` hoelzl@51531 ` 1637` ```proof (rule metric_CauchyI) ``` hoelzl@51531 ` 1638` ``` fix e::real assume "0 < e" ``` hoelzl@51531 ` 1639` ``` hence "0 < e/2" by simp ``` hoelzl@51531 ` 1640` ``` with X have "\N. \n\N. dist (X n) a < e/2" by (rule metric_LIMSEQ_D) ``` hoelzl@51531 ` 1641` ``` then obtain N where N: "\n\N. dist (X n) a < e/2" .. ``` hoelzl@51531 ` 1642` ``` show "\N. \m\N. \n\N. dist (X m) (X n) < e" ``` hoelzl@51531 ` 1643` ``` proof (intro exI allI impI) ``` hoelzl@51531 ` 1644` ``` fix m assume "N \ m" ``` hoelzl@51531 ` 1645` ``` hence m: "dist (X m) a < e/2" using N by fast ``` hoelzl@51531 ` 1646` ``` fix n assume "N \ n" ``` hoelzl@51531 ` 1647` ``` hence n: "dist (X n) a < e/2" using N by fast ``` hoelzl@51531 ` 1648` ``` have "dist (X m) (X n) \ dist (X m) a + dist (X n) a" ``` hoelzl@51531 ` 1649` ``` by (rule dist_triangle2) ``` hoelzl@51531 ` 1650` ``` also from m n have "\ < e" by simp ``` hoelzl@51531 ` 1651` ``` finally show "dist (X m) (X n) < e" . ``` hoelzl@51531 ` 1652` ``` qed ``` hoelzl@51531 ` 1653` ```qed ``` hoelzl@51531 ` 1654` hoelzl@51531 ` 1655` ```lemma convergent_Cauchy: "convergent X \ Cauchy X" ``` hoelzl@51531 ` 1656` ```unfolding convergent_def ``` hoelzl@51531 ` 1657` ```by (erule exE, erule LIMSEQ_imp_Cauchy) ``` hoelzl@51531 ` 1658` hoelzl@51531 ` 1659` ```subsubsection {* Cauchy Sequences are Convergent *} ``` hoelzl@51531 ` 1660` hoelzl@51531 ` 1661` ```class complete_space = metric_space + ``` hoelzl@51531 ` 1662` ``` assumes Cauchy_convergent: "Cauchy X \ convergent X" ``` hoelzl@51531 ` 1663` hoelzl@51531 ` 1664` ```lemma Cauchy_convergent_iff: ``` hoelzl@51531 ` 1665` ``` fixes X :: "nat \ 'a::complete_space" ``` hoelzl@51531 ` 1666` ``` shows "Cauchy X = convergent X" ``` hoelzl@51531 ` 1667` ```by (fast intro: Cauchy_convergent convergent_Cauchy) ``` hoelzl@51531 ` 1668` hoelzl@51531 ` 1669` ```subsection {* The set of real numbers is a complete metric space *} ``` hoelzl@51531 ` 1670` hoelzl@51531 ` 1671` ```text {* ``` hoelzl@51531 ` 1672` ```Proof that Cauchy sequences converge based on the one from ``` wenzelm@54703 ` 1673` ```@{url "http://pirate.shu.edu/~wachsmut/ira/numseq/proofs/cauconv.html"} ``` hoelzl@51531 ` 1674` ```*} ``` hoelzl@51531 ` 1675` hoelzl@51531 ` 1676` ```text {* ``` hoelzl@51531 ` 1677` ``` If sequence @{term "X"} is Cauchy, then its limit is the lub of ``` hoelzl@51531 ` 1678` ``` @{term "{r::real. \N. \n\N. r < X n}"} ``` hoelzl@51531 ` 1679` ```*} ``` hoelzl@51531 ` 1680` hoelzl@51531 ` 1681` ```lemma increasing_LIMSEQ: ``` hoelzl@51531 ` 1682` ``` fixes f :: "nat \ real" ``` hoelzl@51531 ` 1683` ``` assumes inc: "\n. f n \ f (Suc n)" ``` hoelzl@51531 ` 1684` ``` and bdd: "\n. f n \ l" ``` hoelzl@51531 ` 1685` ``` and en: "\e. 0 < e \ \n. l \ f n + e" ``` hoelzl@51531 ` 1686` ``` shows "f ----> l" ``` hoelzl@51531 ` 1687` ```proof (rule increasing_tendsto) ``` hoelzl@51531 ` 1688` ``` fix x assume "x < l" ``` hoelzl@51531 ` 1689` ``` with dense[of 0 "l - x"] obtain e where "0 < e" "e < l - x" ``` hoelzl@51531 ` 1690` ``` by auto ``` hoelzl@51531 ` 1691` ``` from en[OF `0 < e`] obtain n where "l - e \ f n" ``` hoelzl@51531 ` 1692` ``` by (auto simp: field_simps) ``` hoelzl@51531 ` 1693` ``` with `e < l - x` `0 < e` have "x < f n" by simp ``` hoelzl@51531 ` 1694` ``` with incseq_SucI[of f, OF inc] show "eventually (\n. x < f n) sequentially" ``` hoelzl@51531 ` 1695` ``` by (auto simp: eventually_sequentially incseq_def intro: less_le_trans) ``` hoelzl@51531 ` 1696` ```qed (insert bdd, auto) ``` hoelzl@51531 ` 1697` hoelzl@51531 ` 1698` ```lemma real_Cauchy_convergent: ``` hoelzl@51531 ` 1699` ``` fixes X :: "nat \ real" ``` hoelzl@51531 ` 1700` ``` assumes X: "Cauchy X" ``` hoelzl@51531 ` 1701` ``` shows "convergent X" ``` hoelzl@51531 ` 1702` ```proof - ``` hoelzl@51531 ` 1703` ``` def S \ "{x::real. \N. \n\N. x < X n}" ``` hoelzl@51531 ` 1704` ``` then have mem_S: "\N x. \n\N. x < X n \ x \ S" by auto ``` hoelzl@51531 ` 1705` hoelzl@51531 ` 1706` ``` { fix N x assume N: "\n\N. X n < x" ``` hoelzl@51531 ` 1707` ``` fix y::real assume "y \ S" ``` hoelzl@51531 ` 1708` ``` hence "\M. \n\M. y < X n" ``` hoelzl@51531 ` 1709` ``` by (simp add: S_def) ``` hoelzl@51531 ` 1710` ``` then obtain M where "\n\M. y < X n" .. ``` hoelzl@51531 ` 1711` ``` hence "y < X (max M N)" by simp ``` hoelzl@51531 ` 1712` ``` also have "\ < x" using N by simp ``` hoelzl@54263 ` 1713` ``` finally have "y \ x" ``` hoelzl@54263 ` 1714` ``` by (rule order_less_imp_le) } ``` hoelzl@51531 ` 1715` ``` note bound_isUb = this ``` hoelzl@51531 ` 1716` hoelzl@51531 ` 1717` ``` obtain N where "\m\N. \n\N. dist (X m) (X n) < 1" ``` hoelzl@51531 ` 1718` ``` using X[THEN metric_CauchyD, OF zero_less_one] by auto ``` hoelzl@51531 ` 1719` ``` hence N: "\n\N. dist (X n) (X N) < 1" by simp ``` hoelzl@54263 ` 1720` ``` have [simp]: "S \ {}" ``` hoelzl@54263 ` 1721` ``` proof (intro exI ex_in_conv[THEN iffD1]) ``` hoelzl@51531 ` 1722` ``` from N have "\n\N. X N - 1 < X n" ``` hoelzl@51531 ` 1723` ``` by (simp add: abs_diff_less_iff dist_real_def) ``` hoelzl@51531 ` 1724` ``` thus "X N - 1 \ S" by (rule mem_S) ``` hoelzl@51531 ` 1725` ``` qed ``` hoelzl@54263 ` 1726` ``` have [simp]: "bdd_above S" ``` hoelzl@51531 ` 1727` ``` proof ``` hoelzl@51531 ` 1728` ``` from N have "\n\N. X n < X N + 1" ``` hoelzl@51531 ` 1729` ``` by (simp add: abs_diff_less_iff dist_real_def) ``` hoelzl@54263 ` 1730` ``` thus "\s. s \ S \ s \ X N + 1" ``` hoelzl@51531 ` 1731` ``` by (rule bound_isUb) ``` hoelzl@51531 ` 1732` ``` qed ``` hoelzl@54263 ` 1733` ``` have "X ----> Sup S" ``` hoelzl@51531 ` 1734` ``` proof (rule metric_LIMSEQ_I) ``` hoelzl@51531 ` 1735` ``` fix r::real assume "0 < r" ``` hoelzl@51531 ` 1736` ``` hence r: "0 < r/2" by simp ``` hoelzl@51531 ` 1737` ``` obtain N where "\n\N. \m\N. dist (X n) (X m) < r/2" ``` hoelzl@51531 ` 1738` ``` using metric_CauchyD [OF X r] by auto ``` hoelzl@51531 ` 1739` ``` hence "\n\N. dist (X n) (X N) < r/2" by simp ``` hoelzl@51531 ` 1740` ``` hence N: "\n\N. X N - r/2 < X n \ X n < X N + r/2" ``` hoelzl@51531 ` 1741` ``` by (simp only: dist_real_def abs_diff_less_iff) ``` hoelzl@51531 ` 1742` hoelzl@51531 ` 1743` ``` from N have "\n\N. X N - r/2 < X n" by fast ``` hoelzl@51531 ` 1744` ``` hence "X N - r/2 \ S" by (rule mem_S) ``` hoelzl@54263 ` 1745` ``` hence 1: "X N - r/2 \ Sup S" by (simp add: cSup_upper) ``` hoelzl@51531 ` 1746` hoelzl@51531 ` 1747` ``` from N have "\n\N. X n < X N + r/2" by fast ``` hoelzl@54263 ` 1748` ``` from bound_isUb[OF this] ``` hoelzl@54263 ` 1749` ``` have 2: "Sup S \ X N + r/2" ``` hoelzl@54263 ` 1750` ``` by (intro cSup_least) simp_all ``` hoelzl@51531 ` 1751` hoelzl@54263 ` 1752` ``` show "\N. \n\N. dist (X n) (Sup S) < r" ``` hoelzl@51531 ` 1753` ``` proof (intro exI allI impI) ``` hoelzl@51531 ` 1754` ``` fix n assume n: "N \ n" ``` hoelzl@51531 ` 1755` ``` from N n have "X n < X N + r/2" and "X N - r/2 < X n" by simp+ ``` hoelzl@54263 ` 1756` ``` thus "dist (X n) (Sup S) < r" using 1 2 ``` hoelzl@51531 ` 1757` ``` by (simp add: abs_diff_less_iff dist_real_def) ``` hoelzl@51531 ` 1758` ``` qed ``` hoelzl@51531 ` 1759` ``` qed ``` hoelzl@51531 ` 1760` ``` then show ?thesis unfolding convergent_def by auto ``` hoelzl@51531 ` 1761` ```qed ``` hoelzl@51531 ` 1762` hoelzl@51531 ` 1763` ```instance real :: complete_space ``` hoelzl@51531 ` 1764` ``` by intro_classes (rule real_Cauchy_convergent) ``` hoelzl@51531 ` 1765` hoelzl@51531 ` 1766` ```class banach = real_normed_vector + complete_space ``` hoelzl@51531 ` 1767` hoelzl@51531 ` 1768` ```instance real :: banach by default ``` hoelzl@51531 ` 1769` hoelzl@51531 ` 1770` ```lemma tendsto_at_topI_sequentially: ``` hoelzl@57275 ` 1771` ``` fixes f :: "real \ 'b::first_countable_topology" ``` hoelzl@57275 ` 1772` ``` assumes *: "\X. filterlim X at_top sequentially \ (\n. f (X n)) ----> y" ``` hoelzl@57275 ` 1773` ``` shows "(f ---> y) at_top" ``` hoelzl@57448 ` 1774` ```proof - ``` hoelzl@57448 ` 1775` ``` from nhds_countable[of y] guess A . note A = this ``` hoelzl@57275 ` 1776` hoelzl@57448 ` 1777` ``` have "\m. \k. \x\k. f x \ A m" ``` hoelzl@57448 ` 1778` ``` proof (rule ccontr) ``` hoelzl@57448 ` 1779` ``` assume "\ (\m. \k. \x\k. f x \ A m)" ``` hoelzl@57448 ` 1780` ``` then obtain m where "\k. \x\k. f x \ A m" ``` hoelzl@57448 ` 1781` ``` by auto ``` hoelzl@57448 ` 1782` ``` then have "\X. \n. (f (X n) \ A m) \ max n (X n) + 1 \ X (Suc n)" ``` hoelzl@57448 ` 1783` ``` by (intro dependent_nat_choice) (auto simp del: max.bounded_iff) ``` hoelzl@57448 ` 1784` ``` then obtain X where X: "\n. f (X n) \ A m" "\n. max n (X n) + 1 \ X (Suc n)" ``` hoelzl@57448 ` 1785` ``` by auto ``` hoelzl@57448 ` 1786` ``` { fix n have "1 \ n \ real n \ X n" ``` hoelzl@57448 ` 1787` ``` using X[of "n - 1"] by auto } ``` hoelzl@57448 ` 1788` ``` then have "filterlim X at_top sequentially" ``` hoelzl@57448 ` 1789` ``` by (force intro!: filterlim_at_top_mono[OF filterlim_real_sequentially] ``` hoelzl@57448 ` 1790` ``` simp: eventually_sequentially) ``` hoelzl@57448 ` 1791` ``` from topological_tendstoD[OF *[OF this] A(2, 3), of m] X(1) show False ``` hoelzl@57448 ` 1792` ``` by auto ``` hoelzl@57275 ` 1793` ``` qed ``` hoelzl@57448 ` 1794` ``` then obtain k where "\m x. k m \ x \ f x \ A m" ``` hoelzl@57448 ` 1795` ``` by metis ``` hoelzl@57448 ` 1796` ``` then show ?thesis ``` hoelzl@57448 ` 1797` ``` unfolding at_top_def A ``` hoelzl@57448 ` 1798` ``` by (intro filterlim_base[where i=k]) auto ``` hoelzl@57275 ` 1799` ```qed ``` hoelzl@57275 ` 1800` hoelzl@57275 ` 1801` ```lemma tendsto_at_topI_sequentially_real: ``` hoelzl@51531 ` 1802` ``` fixes f :: "real \ real" ``` hoelzl@51531 ` 1803` ``` assumes mono: "mono f" ``` hoelzl@51531 ` 1804` ``` assumes limseq: "(\n. f (real n)) ----> y" ``` hoelzl@51531 ` 1805` ``` shows "(f ---> y) at_top" ``` hoelzl@51531 ` 1806` ```proof (rule tendstoI) ``` hoelzl@51531 ` 1807` ``` fix e :: real assume "0 < e" ``` hoelzl@51531 ` 1808` ``` with limseq obtain N :: nat where N: "\n. N \ n \ \f (real n) - y\ < e" ``` hoelzl@51531 ` 1809` ``` by (auto simp: LIMSEQ_def dist_real_def) ``` hoelzl@51531 ` 1810` ``` { fix x :: real ``` wenzelm@53381 ` 1811` ``` obtain n where "x \ real_of_nat n" ``` wenzelm@53381 ` 1812` ``` using ex_le_of_nat[of x] .. ``` hoelzl@51531 ` 1813` ``` note monoD[OF mono this] ``` hoelzl@51531 ` 1814` ``` also have "f (real_of_nat n) \ y" ``` hoelzl@51531 ` 1815` ``` by (rule LIMSEQ_le_const[OF limseq]) ``` hoelzl@51531 ` 1816` ``` (auto intro: exI[of _ n] monoD[OF mono] simp: real_eq_of_nat[symmetric]) ``` hoelzl@51531 ` 1817` ``` finally have "f x \ y" . } ``` hoelzl@51531 ` 1818` ``` note le = this ``` hoelzl@51531 ` 1819` ``` have "eventually (\x. real N \ x) at_top" ``` hoelzl@51531 ` 1820` ``` by (rule eventually_ge_at_top) ``` hoelzl@51531 ` 1821` ``` then show "eventually (\x. dist (f x) y < e) at_top" ``` hoelzl@51531 ` 1822` ``` proof eventually_elim ``` hoelzl@51531 ` 1823` ``` fix x assume N': "real N \ x" ``` hoelzl@51531 ` 1824` ``` with N[of N] le have "y - f (real N) < e" by auto ``` hoelzl@51531 ` 1825` ``` moreover note monoD[OF mono N'] ``` hoelzl@51531 ` 1826` ``` ultimately show "dist (f x) y < e" ``` hoelzl@51531 ` 1827` ``` using le[of x] by (auto simp: dist_real_def field_simps) ``` hoelzl@51531 ` 1828` ``` qed ``` hoelzl@51531 ` 1829` ```qed ``` hoelzl@51531 ` 1830` huffman@20504 ` 1831` ```end ``` hoelzl@57276 ` 1832`