src/HOL/Hyperreal/Lim.thy
author huffman
Sun Sep 17 16:44:05 2006 +0200 (2006-09-17)
changeset 20561 6a6d8004322f
parent 20552 2c31dd358c21
child 20563 44eda2314aab
permissions -rw-r--r--
generalize type of (NS)LIM to work on functions with vector space domain types
paulson@10751
     1
(*  Title       : Lim.thy
paulson@14477
     2
    ID          : $Id$
paulson@10751
     3
    Author      : Jacques D. Fleuriot
paulson@10751
     4
    Copyright   : 1998  University of Cambridge
paulson@14477
     5
    Conversion to Isar and new proofs by Lawrence C Paulson, 2004
kleing@19023
     6
    GMVT by Benjamin Porter, 2005
paulson@10751
     7
*)
paulson@10751
     8
paulson@14477
     9
header{*Limits, Continuity and Differentiation*}
paulson@10751
    10
nipkow@15131
    11
theory Lim
nipkow@15360
    12
imports SEQ
nipkow@15131
    13
begin
paulson@14477
    14
paulson@14477
    15
text{*Standard and Nonstandard Definitions*}
paulson@10751
    16
wenzelm@19765
    17
definition
huffman@20561
    18
  LIM :: "['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool"
kleing@19023
    19
        ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)
wenzelm@19765
    20
  "f -- a --> L =
huffman@20561
    21
     (\<forall>r > 0. \<exists>s > 0. \<forall>x. x \<noteq> a & norm (x + -a) < s
huffman@20552
    22
        --> norm (f x + -L) < r)"
paulson@10751
    23
huffman@20561
    24
  NSLIM :: "['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool"
kleing@19023
    25
            ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)
huffman@20552
    26
  "f -- a --NS> L =
huffman@20552
    27
    (\<forall>x. (x \<noteq> star_of a & x @= star_of a --> ( *f* f) x @= star_of L))"
paulson@10751
    28
huffman@20561
    29
  isCont :: "['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool"
wenzelm@19765
    30
  "isCont f a = (f -- a --> (f a))"
paulson@10751
    31
huffman@20561
    32
  isNSCont :: "['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool"
paulson@15228
    33
    --{*NS definition dispenses with limit notions*}
huffman@20552
    34
  "isNSCont f a = (\<forall>y. y @= star_of a -->
huffman@20552
    35
         ( *f* f) y @= star_of (f a))"
paulson@10751
    36
paulson@14477
    37
  deriv:: "[real=>real,real,real] => bool"
paulson@15228
    38
    --{*Differentiation: D is derivative of function f at x*}
kleing@19023
    39
          ("(DERIV (_)/ (_)/ :> (_))" [1000, 1000, 60] 60)
wenzelm@19765
    40
  "DERIV f x :> D = ((%h. (f(x + h) + -f x)/h) -- 0 --> D)"
paulson@10751
    41
paulson@14477
    42
  nsderiv :: "[real=>real,real,real] => bool"
kleing@19023
    43
          ("(NSDERIV (_)/ (_)/ :> (_))" [1000, 1000, 60] 60)
wenzelm@19765
    44
  "NSDERIV f x :> D = (\<forall>h \<in> Infinitesimal - {0}.
kleing@19023
    45
      (( *f* f)(hypreal_of_real x + h) +
kleing@19023
    46
       - hypreal_of_real (f x))/h @= hypreal_of_real D)"
paulson@10751
    47
paulson@14477
    48
  differentiable :: "[real=>real,real] => bool"   (infixl "differentiable" 60)
wenzelm@19765
    49
  "f differentiable x = (\<exists>D. DERIV f x :> D)"
paulson@10751
    50
kleing@19023
    51
  NSdifferentiable :: "[real=>real,real] => bool"
paulson@14477
    52
                       (infixl "NSdifferentiable" 60)
wenzelm@19765
    53
  "f NSdifferentiable x = (\<exists>D. NSDERIV f x :> D)"
paulson@10751
    54
paulson@14477
    55
  increment :: "[real=>real,real,hypreal] => hypreal"
wenzelm@19765
    56
  "increment f x h = (@inc. f NSdifferentiable x &
kleing@19023
    57
           inc = ( *f* f)(hypreal_of_real x + h) + -hypreal_of_real (f x))"
paulson@10751
    58
paulson@14477
    59
  isUCont :: "(real=>real) => bool"
wenzelm@19765
    60
  "isUCont f =  (\<forall>r > 0. \<exists>s > 0. \<forall>x y. \<bar>x + -y\<bar> < s --> \<bar>f x + -f y\<bar> < r)"
paulson@10751
    61
paulson@14477
    62
  isNSUCont :: "(real=>real) => bool"
wenzelm@19765
    63
  "isNSUCont f = (\<forall>x y. x @= y --> ( *f* f) x @= ( *f* f) y)"
paulson@10751
    64
paulson@10751
    65
paulson@10751
    66
consts
paulson@10751
    67
  Bolzano_bisect :: "[real*real=>bool, real, real, nat] => (real*real)"
paulson@10751
    68
primrec
paulson@10751
    69
  "Bolzano_bisect P a b 0 = (a,b)"
paulson@10751
    70
  "Bolzano_bisect P a b (Suc n) =
paulson@10751
    71
      (let (x,y) = Bolzano_bisect P a b n
wenzelm@11704
    72
       in if P(x, (x+y)/2) then ((x+y)/2, y)
paulson@14477
    73
                            else (x, (x+y)/2))"
paulson@14477
    74
paulson@14477
    75
paulson@14477
    76
paulson@14477
    77
section{*Some Purely Standard Proofs*}
paulson@14477
    78
paulson@14477
    79
lemma LIM_eq:
paulson@14477
    80
     "f -- a --> L =
huffman@20561
    81
     (\<forall>r>0.\<exists>s>0.\<forall>x. x \<noteq> a & norm (x-a) < s --> norm (f x - L) < r)"
paulson@14477
    82
by (simp add: LIM_def diff_minus)
paulson@14477
    83
huffman@20552
    84
lemma LIM_I:
huffman@20561
    85
     "(!!r. 0<r ==> \<exists>s>0.\<forall>x. x \<noteq> a & norm (x-a) < s --> norm (f x - L) < r)
huffman@20552
    86
      ==> f -- a --> L"
huffman@20552
    87
by (simp add: LIM_eq)
huffman@20552
    88
paulson@14477
    89
lemma LIM_D:
paulson@14477
    90
     "[| f -- a --> L; 0<r |]
huffman@20561
    91
      ==> \<exists>s>0.\<forall>x. x \<noteq> a & norm (x-a) < s --> norm (f x - L) < r"
paulson@14477
    92
by (simp add: LIM_eq)
paulson@14477
    93
paulson@15228
    94
lemma LIM_const [simp]: "(%x. k) -- x --> k"
paulson@14477
    95
by (simp add: LIM_def)
paulson@14477
    96
paulson@14477
    97
lemma LIM_add:
huffman@20561
    98
  fixes f g :: "'a::real_normed_vector \<Rightarrow> 'b::real_normed_vector"
paulson@14477
    99
  assumes f: "f -- a --> L" and g: "g -- a --> M"
paulson@14477
   100
  shows "(%x. f x + g(x)) -- a --> (L + M)"
huffman@20552
   101
proof (rule LIM_I)
paulson@14477
   102
  fix r :: real
huffman@20409
   103
  assume r: "0 < r"
paulson@14477
   104
  from LIM_D [OF f half_gt_zero [OF r]]
paulson@14477
   105
  obtain fs
paulson@14477
   106
    where fs:    "0 < fs"
huffman@20561
   107
      and fs_lt: "\<forall>x. x \<noteq> a & norm (x-a) < fs --> norm (f x - L) < r/2"
paulson@14477
   108
  by blast
paulson@14477
   109
  from LIM_D [OF g half_gt_zero [OF r]]
paulson@14477
   110
  obtain gs
paulson@14477
   111
    where gs:    "0 < gs"
huffman@20561
   112
      and gs_lt: "\<forall>x. x \<noteq> a & norm (x-a) < gs --> norm (g x - M) < r/2"
paulson@14477
   113
  by blast
huffman@20561
   114
  show "\<exists>s>0.\<forall>x. x \<noteq> a \<and> norm (x-a) < s \<longrightarrow> norm (f x + g x - (L + M)) < r"
paulson@14477
   115
  proof (intro exI conjI strip)
paulson@14477
   116
    show "0 < min fs gs"  by (simp add: fs gs)
huffman@20561
   117
    fix x :: 'a
huffman@20561
   118
    assume "x \<noteq> a \<and> norm (x-a) < min fs gs"
huffman@20561
   119
    hence "x \<noteq> a \<and> norm (x-a) < fs \<and> norm (x-a) < gs" by simp
paulson@14477
   120
    with fs_lt gs_lt
huffman@20552
   121
    have "norm (f x - L) < r/2" and "norm (g x - M) < r/2" by blast+
huffman@20552
   122
    hence "norm (f x - L) + norm (g x - M) < r" by arith
huffman@20552
   123
    thus "norm (f x + g x - (L + M)) < r"
huffman@20552
   124
      by (blast intro: norm_diff_triangle_ineq order_le_less_trans)
paulson@14477
   125
  qed
paulson@14477
   126
qed
paulson@14477
   127
huffman@20552
   128
lemma minus_diff_minus:
huffman@20552
   129
  fixes a b :: "'a::ab_group_add"
huffman@20552
   130
  shows "(- a) - (- b) = - (a - b)"
huffman@20552
   131
by simp
huffman@20552
   132
paulson@14477
   133
lemma LIM_minus: "f -- a --> L ==> (%x. -f(x)) -- a --> -L"
huffman@20552
   134
by (simp only: LIM_eq minus_diff_minus norm_minus_cancel)
paulson@14477
   135
paulson@14477
   136
lemma LIM_add_minus:
paulson@14477
   137
    "[| f -- x --> l; g -- x --> m |] ==> (%x. f(x) + -g(x)) -- x --> (l + -m)"
huffman@20552
   138
by (intro LIM_add LIM_minus)
paulson@14477
   139
paulson@14477
   140
lemma LIM_diff:
paulson@14477
   141
    "[| f -- x --> l; g -- x --> m |] ==> (%x. f(x) - g(x)) -- x --> l-m"
huffman@20552
   142
by (simp only: diff_minus LIM_add LIM_minus)
paulson@14477
   143
paulson@14477
   144
huffman@20561
   145
lemma LIM_const_not_eq:
huffman@20561
   146
  fixes a :: "'a::real_normed_div_algebra"
huffman@20561
   147
  shows "k \<noteq> L ==> ~ ((%x. k) -- a --> L)"
huffman@20552
   148
apply (simp add: LIM_eq)
huffman@20552
   149
apply (rule_tac x="norm (k - L)" in exI, simp, safe)
huffman@20561
   150
apply (rule_tac x="a + of_real (s/2)" in exI, simp add: norm_of_real)
huffman@20552
   151
done
paulson@14477
   152
huffman@20561
   153
lemma LIM_const_eq:
huffman@20561
   154
  fixes a :: "'a::real_normed_div_algebra"
huffman@20561
   155
  shows "(%x. k) -- a --> L ==> k = L"
paulson@14477
   156
apply (rule ccontr)
kleing@19023
   157
apply (blast dest: LIM_const_not_eq)
paulson@14477
   158
done
paulson@14477
   159
huffman@20561
   160
lemma LIM_unique:
huffman@20561
   161
  fixes a :: "'a::real_normed_div_algebra"
huffman@20561
   162
  shows "[| f -- a --> L; f -- a --> M |] ==> L = M"
kleing@19023
   163
apply (drule LIM_diff, assumption)
paulson@14477
   164
apply (auto dest!: LIM_const_eq)
paulson@14477
   165
done
paulson@14477
   166
paulson@14477
   167
lemma LIM_mult_zero:
huffman@20561
   168
  fixes f g :: "'a::real_normed_vector \<Rightarrow> 'b::real_normed_algebra"
paulson@14477
   169
  assumes f: "f -- a --> 0" and g: "g -- a --> 0"
paulson@14477
   170
  shows "(%x. f(x) * g(x)) -- a --> 0"
huffman@20552
   171
proof (rule LIM_I, simp)
paulson@14477
   172
  fix r :: real
paulson@14477
   173
  assume r: "0<r"
paulson@14477
   174
  from LIM_D [OF f zero_less_one]
paulson@14477
   175
  obtain fs
paulson@14477
   176
    where fs:    "0 < fs"
huffman@20561
   177
      and fs_lt: "\<forall>x. x \<noteq> a & norm (x-a) < fs --> norm (f x) < 1"
paulson@14477
   178
  by auto
paulson@14477
   179
  from LIM_D [OF g r]
paulson@14477
   180
  obtain gs
paulson@14477
   181
    where gs:    "0 < gs"
huffman@20561
   182
      and gs_lt: "\<forall>x. x \<noteq> a & norm (x-a) < gs --> norm (g x) < r"
paulson@14477
   183
  by auto
huffman@20561
   184
  show "\<exists>s. 0 < s \<and> (\<forall>x. x \<noteq> a \<and> norm (x-a) < s \<longrightarrow> norm (f x * g x) < r)"
paulson@14477
   185
  proof (intro exI conjI strip)
paulson@14477
   186
    show "0 < min fs gs"  by (simp add: fs gs)
huffman@20561
   187
    fix x :: 'a
huffman@20561
   188
    assume "x \<noteq> a \<and> norm (x-a) < min fs gs"
huffman@20561
   189
    hence  "x \<noteq> a \<and> norm (x-a) < fs \<and> norm (x-a) < gs" by simp
paulson@14477
   190
    with fs_lt gs_lt
huffman@20552
   191
    have "norm (f x) < 1" and "norm (g x) < r" by blast+
huffman@20552
   192
    hence "norm (f x) * norm (g x) < 1*r"
huffman@20552
   193
      by (rule mult_strict_mono' [OF _ _ norm_ge_zero norm_ge_zero])
huffman@20552
   194
    thus "norm (f x * g x) < r"
huffman@20552
   195
      by (simp add: order_le_less_trans [OF norm_mult_ineq])
paulson@14477
   196
  qed
paulson@14477
   197
qed
paulson@14477
   198
paulson@14477
   199
lemma LIM_self: "(%x. x) -- a --> a"
paulson@14477
   200
by (auto simp add: LIM_def)
paulson@14477
   201
paulson@14477
   202
text{*Limits are equal for functions equal except at limit point*}
paulson@14477
   203
lemma LIM_equal:
paulson@14477
   204
     "[| \<forall>x. x \<noteq> a --> (f x = g x) |] ==> (f -- a --> l) = (g -- a --> l)"
paulson@14477
   205
by (simp add: LIM_def)
paulson@14477
   206
paulson@14477
   207
text{*Two uses in Hyperreal/Transcendental.ML*}
paulson@14477
   208
lemma LIM_trans:
paulson@14477
   209
     "[| (%x. f(x) + -g(x)) -- a --> 0;  g -- a --> l |] ==> f -- a --> l"
paulson@14477
   210
apply (drule LIM_add, assumption)
paulson@14477
   211
apply (auto simp add: add_assoc)
paulson@14477
   212
done
paulson@14477
   213
paulson@14477
   214
paulson@14477
   215
subsection{*Relationships Between Standard and Nonstandard Concepts*}
paulson@14477
   216
paulson@14477
   217
text{*Standard and NS definitions of Limit*} (*NEEDS STRUCTURING*)
paulson@14477
   218
lemma LIM_NSLIM:
huffman@20552
   219
      "f -- a --> L ==> f -- a --NS> L"
huffman@20552
   220
apply (simp add: LIM_def NSLIM_def approx_def, safe)
huffman@20552
   221
apply (rule_tac x="x" in star_cases)
huffman@20552
   222
apply (simp add: star_of_def star_n_minus star_n_add starfun)
paulson@14477
   223
apply (simp add: Infinitesimal_FreeUltrafilterNat_iff, safe)
huffman@20552
   224
apply (simp add: star_n_eq_iff)
paulson@14477
   225
apply (drule_tac x = u in spec, clarify)
paulson@14477
   226
apply (drule_tac x = s in spec, clarify)
huffman@20552
   227
apply (simp only: FUFNat.Collect_not [symmetric])
huffman@20552
   228
apply (elim ultra, simp)
paulson@14477
   229
done
paulson@14477
   230
paulson@15228
   231
paulson@15228
   232
subsubsection{*Limit: The NS definition implies the standard definition.*}
paulson@14477
   233
huffman@20552
   234
lemma lemma_LIM:
huffman@20552
   235
  fixes L :: "'a::real_normed_vector"
huffman@20561
   236
  shows "\<forall>s>0. \<exists>x. x \<noteq> a \<and> norm (x + - a) < s \<and> \<not> norm (f x + -L) < r
huffman@20552
   237
      ==> \<forall>n::nat. \<exists>x. x \<noteq> a \<and>
huffman@20561
   238
              norm (x + -a) < inverse(real(Suc n)) \<and> \<not> norm (f x + -L) < r"
paulson@14477
   239
apply clarify
paulson@14477
   240
apply (cut_tac n1 = n in real_of_nat_Suc_gt_zero [THEN positive_imp_inverse_positive], auto)
paulson@14477
   241
done
paulson@14477
   242
paulson@14477
   243
lemma lemma_skolemize_LIM2:
huffman@20552
   244
  fixes L :: "'a::real_normed_vector"
huffman@20561
   245
  shows "\<forall>s>0. \<exists>x. x \<noteq> a \<and> norm (x + - a) < s \<and> \<not> norm (f x + -L) < r
huffman@20552
   246
      ==> \<exists>X. \<forall>n::nat. X n \<noteq> a \<and>
huffman@20561
   247
         norm (X n + -a) < inverse(real(Suc n)) \<and> \<not> norm(f (X n) + -L) < r"
paulson@14477
   248
apply (drule lemma_LIM)
paulson@14477
   249
apply (drule choice, blast)
paulson@14477
   250
done
paulson@14477
   251
huffman@20552
   252
lemma FreeUltrafilterNat_most: "\<exists>N. \<forall>n\<ge>N. P n \<Longrightarrow> {n. P n} \<in> \<U>"
huffman@20552
   253
apply (erule exE)
huffman@20552
   254
apply (rule_tac u="{n. N \<le> n}" in FUFNat.subset)
huffman@20552
   255
apply (rule cofinite_mem_FreeUltrafilterNat)
huffman@20552
   256
apply (simp add: Collect_neg_eq [symmetric])
huffman@20552
   257
apply (simp add: linorder_not_le finite_nat_segment)
huffman@20552
   258
apply fast
huffman@20552
   259
done
huffman@20552
   260
huffman@20552
   261
lemma lemma_simp: "\<forall>n. X n \<noteq> a &
huffman@20561
   262
          norm (X n + - a) < inverse (real(Suc n)) &
huffman@20552
   263
          \<not> norm (f (X n) + - L) < r ==>
huffman@20561
   264
          \<forall>n. norm (X n + - a) < inverse (real(Suc n))"
paulson@14477
   265
by auto
paulson@14477
   266
paulson@14477
   267
paulson@15228
   268
text{*NSLIM => LIM*}
paulson@14477
   269
huffman@20552
   270
lemma NSLIM_LIM: "f -- a --NS> L ==> f -- a --> L"
paulson@14477
   271
apply (simp add: LIM_def NSLIM_def approx_def)
huffman@20552
   272
apply (rule ccontr, simp, clarify)
paulson@14477
   273
apply (drule lemma_skolemize_LIM2, safe)
huffman@17318
   274
apply (drule_tac x = "star_n X" in spec)
huffman@20552
   275
apply (drule mp, rule conjI)
huffman@20552
   276
apply (simp add: star_of_def star_n_eq_iff)
huffman@20552
   277
apply (rule real_seq_to_hypreal_Infinitesimal, simp)
huffman@20552
   278
apply (simp add: starfun star_of_def star_n_minus star_n_add)
huffman@20552
   279
apply (simp add: Infinitesimal_FreeUltrafilterNat_iff)
huffman@20552
   280
apply (drule spec, drule (1) mp)
huffman@20552
   281
apply simp
paulson@14477
   282
done
paulson@14477
   283
paulson@15228
   284
theorem LIM_NSLIM_iff: "(f -- x --> L) = (f -- x --NS> L)"
paulson@14477
   285
by (blast intro: LIM_NSLIM NSLIM_LIM)
paulson@14477
   286
paulson@15228
   287
text{*Proving properties of limits using nonstandard definition.
paulson@15228
   288
      The properties hold for standard limits as well!*}
paulson@14477
   289
paulson@14477
   290
lemma NSLIM_mult:
huffman@20552
   291
  fixes l m :: "'a::real_normed_algebra"
huffman@20552
   292
  shows "[| f -- x --NS> l; g -- x --NS> m |]
paulson@14477
   293
      ==> (%x. f(x) * g(x)) -- x --NS> (l * m)"
paulson@15228
   294
by (auto simp add: NSLIM_def intro!: approx_mult_HFinite)
paulson@14477
   295
paulson@15228
   296
lemma LIM_mult2:
huffman@20552
   297
  fixes l m :: "'a::real_normed_algebra"
huffman@20552
   298
  shows "[| f -- x --> l; g -- x --> m |]
huffman@20552
   299
      ==> (%x. f(x) * g(x)) -- x --> (l * m)"
paulson@14477
   300
by (simp add: LIM_NSLIM_iff NSLIM_mult)
paulson@14477
   301
paulson@14477
   302
lemma NSLIM_add:
paulson@14477
   303
     "[| f -- x --NS> l; g -- x --NS> m |]
paulson@14477
   304
      ==> (%x. f(x) + g(x)) -- x --NS> (l + m)"
paulson@15228
   305
by (auto simp add: NSLIM_def intro!: approx_add)
paulson@14477
   306
paulson@15228
   307
lemma LIM_add2:
paulson@15228
   308
     "[| f -- x --> l; g -- x --> m |] ==> (%x. f(x) + g(x)) -- x --> (l + m)"
paulson@14477
   309
by (simp add: LIM_NSLIM_iff NSLIM_add)
paulson@14477
   310
paulson@14477
   311
paulson@15228
   312
lemma NSLIM_const [simp]: "(%x. k) -- x --NS> k"
paulson@14477
   313
by (simp add: NSLIM_def)
paulson@14477
   314
paulson@14477
   315
lemma LIM_const2: "(%x. k) -- x --> k"
paulson@14477
   316
by (simp add: LIM_NSLIM_iff)
paulson@14477
   317
paulson@14477
   318
lemma NSLIM_minus: "f -- a --NS> L ==> (%x. -f(x)) -- a --NS> -L"
paulson@14477
   319
by (simp add: NSLIM_def)
paulson@14477
   320
paulson@14477
   321
lemma LIM_minus2: "f -- a --> L ==> (%x. -f(x)) -- a --> -L"
paulson@14477
   322
by (simp add: LIM_NSLIM_iff NSLIM_minus)
paulson@14477
   323
paulson@14477
   324
paulson@14477
   325
lemma NSLIM_add_minus: "[| f -- x --NS> l; g -- x --NS> m |] ==> (%x. f(x) + -g(x)) -- x --NS> (l + -m)"
paulson@14477
   326
by (blast dest: NSLIM_add NSLIM_minus)
paulson@14477
   327
paulson@14477
   328
lemma LIM_add_minus2: "[| f -- x --> l; g -- x --> m |] ==> (%x. f(x) + -g(x)) -- x --> (l + -m)"
paulson@14477
   329
by (simp add: LIM_NSLIM_iff NSLIM_add_minus)
paulson@14477
   330
paulson@14477
   331
paulson@14477
   332
lemma NSLIM_inverse:
huffman@20552
   333
  fixes L :: "'a::{real_normed_div_algebra,division_by_zero}"
huffman@20552
   334
  shows "[| f -- a --NS> L;  L \<noteq> 0 |]
paulson@14477
   335
      ==> (%x. inverse(f(x))) -- a --NS> (inverse L)"
paulson@14477
   336
apply (simp add: NSLIM_def, clarify)
paulson@14477
   337
apply (drule spec)
huffman@20552
   338
apply (auto simp add: star_of_approx_inverse)
paulson@14477
   339
done
paulson@14477
   340
huffman@20552
   341
lemma LIM_inverse:
huffman@20552
   342
  fixes L :: "'a::{real_normed_div_algebra,division_by_zero}"
huffman@20552
   343
  shows "[| f -- a --> L; L \<noteq> 0 |]
huffman@20552
   344
      ==> (%x. inverse(f(x))) -- a --> (inverse L)"
paulson@14477
   345
by (simp add: LIM_NSLIM_iff NSLIM_inverse)
paulson@14477
   346
paulson@14477
   347
paulson@14477
   348
lemma NSLIM_zero:
paulson@14477
   349
  assumes f: "f -- a --NS> l" shows "(%x. f(x) + -l) -- a --NS> 0"
paulson@15228
   350
proof -
paulson@14477
   351
  have "(\<lambda>x. f x + - l) -- a --NS> l + -l"
paulson@15228
   352
    by (rule NSLIM_add_minus [OF f NSLIM_const])
paulson@14477
   353
  thus ?thesis by simp
paulson@14477
   354
qed
paulson@14477
   355
paulson@14477
   356
lemma LIM_zero2: "f -- a --> l ==> (%x. f(x) + -l) -- a --> 0"
paulson@14477
   357
by (simp add: LIM_NSLIM_iff NSLIM_zero)
paulson@14477
   358
paulson@14477
   359
lemma NSLIM_zero_cancel: "(%x. f(x) - l) -- x --NS> 0 ==> f -- x --NS> l"
paulson@14477
   360
apply (drule_tac g = "%x. l" and m = l in NSLIM_add)
paulson@14477
   361
apply (auto simp add: diff_minus add_assoc)
paulson@14477
   362
done
paulson@14477
   363
paulson@14477
   364
lemma LIM_zero_cancel: "(%x. f(x) - l) -- x --> 0 ==> f -- x --> l"
paulson@14477
   365
apply (drule_tac g = "%x. l" and M = l in LIM_add)
paulson@14477
   366
apply (auto simp add: diff_minus add_assoc)
paulson@14477
   367
done
paulson@14477
   368
huffman@20561
   369
lemma NSLIM_const_not_eq:
huffman@20561
   370
  fixes a :: real (* TODO: generalize to real_normed_div_algebra *)
huffman@20561
   371
  shows "k \<noteq> L ==> ~ ((%x. k) -- a --NS> L)"
paulson@14477
   372
apply (simp add: NSLIM_def)
huffman@20561
   373
apply (rule_tac x="star_of a + epsilon" in exI)
paulson@14477
   374
apply (auto intro: Infinitesimal_add_approx_self [THEN approx_sym]
paulson@14477
   375
            simp add: hypreal_epsilon_not_zero)
paulson@14477
   376
done
paulson@14477
   377
huffman@20561
   378
lemma NSLIM_not_zero:
huffman@20561
   379
  fixes a :: real
huffman@20561
   380
  shows "k \<noteq> 0 ==> ~ ((%x. k) -- a --NS> 0)"
huffman@20552
   381
by (rule NSLIM_const_not_eq)
paulson@14477
   382
huffman@20561
   383
lemma NSLIM_const_eq:
huffman@20561
   384
  fixes a :: real
huffman@20561
   385
  shows "(%x. k) -- a --NS> L ==> k = L"
paulson@14477
   386
apply (rule ccontr)
paulson@15228
   387
apply (blast dest: NSLIM_const_not_eq)
paulson@14477
   388
done
paulson@14477
   389
paulson@15228
   390
text{* can actually be proved more easily by unfolding the definition!*}
huffman@20561
   391
lemma NSLIM_unique:
huffman@20561
   392
  fixes a :: real
huffman@20561
   393
  shows "[| f -- a --NS> L; f -- a --NS> M |] ==> L = M"
paulson@14477
   394
apply (drule NSLIM_minus)
paulson@14477
   395
apply (drule NSLIM_add, assumption)
paulson@14477
   396
apply (auto dest!: NSLIM_const_eq [symmetric])
huffman@20552
   397
apply (simp add: diff_def [symmetric])
paulson@14477
   398
done
paulson@14477
   399
huffman@20561
   400
lemma LIM_unique2:
huffman@20561
   401
  fixes a :: real
huffman@20561
   402
  shows "[| f -- a --> L; f -- a --> M |] ==> L = M"
paulson@14477
   403
by (simp add: LIM_NSLIM_iff NSLIM_unique)
paulson@14477
   404
paulson@14477
   405
huffman@20552
   406
lemma NSLIM_mult_zero:
huffman@20561
   407
  fixes f g :: "'a::real_normed_vector \<Rightarrow> 'b::real_normed_algebra"
huffman@20552
   408
  shows "[| f -- x --NS> 0; g -- x --NS> 0 |] ==> (%x. f(x)*g(x)) -- x --NS> 0"
paulson@14477
   409
by (drule NSLIM_mult, auto)
paulson@14477
   410
paulson@14477
   411
(* we can use the corresponding thm LIM_mult2 *)
paulson@14477
   412
(* for standard definition of limit           *)
paulson@14477
   413
huffman@20552
   414
lemma LIM_mult_zero2:
huffman@20561
   415
  fixes f g :: "'a::real_normed_vector \<Rightarrow> 'b::real_normed_algebra"
huffman@20552
   416
  shows "[| f -- x --> 0; g -- x --> 0 |] ==> (%x. f(x)*g(x)) -- x --> 0"
paulson@14477
   417
by (drule LIM_mult2, auto)
paulson@14477
   418
paulson@14477
   419
paulson@14477
   420
lemma NSLIM_self: "(%x. x) -- a --NS> a"
paulson@14477
   421
by (simp add: NSLIM_def)
paulson@14477
   422
paulson@14477
   423
paulson@15228
   424
subsection{* Derivatives and Continuity: NS and Standard properties*}
paulson@15228
   425
paulson@15228
   426
subsubsection{*Continuity*}
paulson@14477
   427
paulson@14477
   428
lemma isNSContD: "[| isNSCont f a; y \<approx> hypreal_of_real a |] ==> ( *f* f) y \<approx> hypreal_of_real (f a)"
paulson@14477
   429
by (simp add: isNSCont_def)
paulson@14477
   430
paulson@14477
   431
lemma isNSCont_NSLIM: "isNSCont f a ==> f -- a --NS> (f a) "
paulson@14477
   432
by (simp add: isNSCont_def NSLIM_def)
paulson@14477
   433
paulson@14477
   434
lemma NSLIM_isNSCont: "f -- a --NS> (f a) ==> isNSCont f a"
paulson@14477
   435
apply (simp add: isNSCont_def NSLIM_def, auto)
huffman@20561
   436
apply (case_tac "y = star_of a", auto)
paulson@14477
   437
done
paulson@14477
   438
paulson@15228
   439
text{*NS continuity can be defined using NS Limit in
paulson@15228
   440
    similar fashion to standard def of continuity*}
paulson@14477
   441
lemma isNSCont_NSLIM_iff: "(isNSCont f a) = (f -- a --NS> (f a))"
paulson@14477
   442
by (blast intro: isNSCont_NSLIM NSLIM_isNSCont)
paulson@14477
   443
paulson@15228
   444
text{*Hence, NS continuity can be given
paulson@15228
   445
  in terms of standard limit*}
paulson@14477
   446
lemma isNSCont_LIM_iff: "(isNSCont f a) = (f -- a --> (f a))"
paulson@14477
   447
by (simp add: LIM_NSLIM_iff isNSCont_NSLIM_iff)
paulson@14477
   448
paulson@15228
   449
text{*Moreover, it's trivial now that NS continuity
paulson@15228
   450
  is equivalent to standard continuity*}
paulson@14477
   451
lemma isNSCont_isCont_iff: "(isNSCont f a) = (isCont f a)"
paulson@14477
   452
apply (simp add: isCont_def)
paulson@14477
   453
apply (rule isNSCont_LIM_iff)
paulson@14477
   454
done
paulson@14477
   455
paulson@15228
   456
text{*Standard continuity ==> NS continuity*}
paulson@14477
   457
lemma isCont_isNSCont: "isCont f a ==> isNSCont f a"
paulson@14477
   458
by (erule isNSCont_isCont_iff [THEN iffD2])
paulson@14477
   459
paulson@15228
   460
text{*NS continuity ==> Standard continuity*}
paulson@14477
   461
lemma isNSCont_isCont: "isNSCont f a ==> isCont f a"
paulson@14477
   462
by (erule isNSCont_isCont_iff [THEN iffD1])
paulson@14477
   463
paulson@14477
   464
text{*Alternative definition of continuity*}
paulson@14477
   465
(* Prove equivalence between NS limits - *)
paulson@14477
   466
(* seems easier than using standard def  *)
paulson@14477
   467
lemma NSLIM_h_iff: "(f -- a --NS> L) = ((%h. f(a + h)) -- 0 --NS> L)"
paulson@14477
   468
apply (simp add: NSLIM_def, auto)
huffman@20561
   469
apply (drule_tac x = "star_of a + x" in spec)
huffman@20561
   470
apply (drule_tac [2] x = "- star_of a + x" in spec, safe, simp)
huffman@20561
   471
apply (erule mem_infmal_iff [THEN iffD2, THEN Infinitesimal_add_approx_self [THEN approx_sym]])
huffman@20561
   472
apply (erule_tac [3] approx_minus_iff2 [THEN iffD1])
huffman@20561
   473
 prefer 2 apply (simp add: add_commute diff_def [symmetric])
huffman@20561
   474
apply (rule_tac x = x in star_cases)
huffman@17318
   475
apply (rule_tac [2] x = x in star_cases)
huffman@17318
   476
apply (auto simp add: starfun star_of_def star_n_minus star_n_add add_assoc approx_refl star_n_zero_num)
paulson@14477
   477
done
paulson@14477
   478
paulson@14477
   479
lemma NSLIM_isCont_iff: "(f -- a --NS> f a) = ((%h. f(a + h)) -- 0 --NS> f a)"
paulson@14477
   480
by (rule NSLIM_h_iff)
paulson@14477
   481
paulson@14477
   482
lemma LIM_isCont_iff: "(f -- a --> f a) = ((%h. f(a + h)) -- 0 --> f(a))"
paulson@14477
   483
by (simp add: LIM_NSLIM_iff NSLIM_isCont_iff)
paulson@14477
   484
paulson@14477
   485
lemma isCont_iff: "(isCont f x) = ((%h. f(x + h)) -- 0 --> f(x))"
paulson@14477
   486
by (simp add: isCont_def LIM_isCont_iff)
paulson@14477
   487
paulson@15228
   488
text{*Immediate application of nonstandard criterion for continuity can offer
paulson@15228
   489
   very simple proofs of some standard property of continuous functions*}
paulson@14477
   490
text{*sum continuous*}
paulson@14477
   491
lemma isCont_add: "[| isCont f a; isCont g a |] ==> isCont (%x. f(x) + g(x)) a"
paulson@14477
   492
by (auto intro: approx_add simp add: isNSCont_isCont_iff [symmetric] isNSCont_def)
paulson@14477
   493
paulson@14477
   494
text{*mult continuous*}
huffman@20552
   495
lemma isCont_mult:
huffman@20561
   496
  fixes f g :: "'a::real_normed_vector \<Rightarrow> 'b::real_normed_algebra"
huffman@20552
   497
  shows "[| isCont f a; isCont g a |] ==> isCont (%x. f(x) * g(x)) a"
paulson@15228
   498
by (auto intro!: starfun_mult_HFinite_approx
paulson@15228
   499
            simp del: starfun_mult [symmetric]
paulson@14477
   500
            simp add: isNSCont_isCont_iff [symmetric] isNSCont_def)
paulson@14477
   501
paulson@15228
   502
text{*composition of continuous functions
paulson@15228
   503
     Note very short straightforard proof!*}
paulson@14477
   504
lemma isCont_o: "[| isCont f a; isCont g (f a) |] ==> isCont (g o f) a"
paulson@14477
   505
by (auto simp add: isNSCont_isCont_iff [symmetric] isNSCont_def starfun_o [symmetric])
paulson@14477
   506
paulson@14477
   507
lemma isCont_o2: "[| isCont f a; isCont g (f a) |] ==> isCont (%x. g (f x)) a"
paulson@14477
   508
by (auto dest: isCont_o simp add: o_def)
paulson@14477
   509
paulson@14477
   510
lemma isNSCont_minus: "isNSCont f a ==> isNSCont (%x. - f x) a"
paulson@14477
   511
by (simp add: isNSCont_def)
paulson@14477
   512
paulson@14477
   513
lemma isCont_minus: "isCont f a ==> isCont (%x. - f x) a"
paulson@14477
   514
by (auto simp add: isNSCont_isCont_iff [symmetric] isNSCont_minus)
paulson@14477
   515
paulson@14477
   516
lemma isCont_inverse:
huffman@20561
   517
  fixes f :: "'a::real_normed_vector \<Rightarrow>
huffman@20561
   518
              'b::{real_normed_div_algebra,division_by_zero}"
huffman@20552
   519
  shows "[| isCont f x; f x \<noteq> 0 |] ==> isCont (%x. inverse (f x)) x"
paulson@14477
   520
apply (simp add: isCont_def)
paulson@14477
   521
apply (blast intro: LIM_inverse)
paulson@14477
   522
done
paulson@14477
   523
huffman@20552
   524
lemma isNSCont_inverse:
huffman@20561
   525
  fixes f :: "'a::real_normed_vector \<Rightarrow>
huffman@20561
   526
              'b::{real_normed_div_algebra,division_by_zero}"
huffman@20552
   527
  shows "[| isNSCont f x; f x \<noteq> 0 |] ==> isNSCont (%x. inverse (f x)) x"
paulson@14477
   528
by (auto intro: isCont_inverse simp add: isNSCont_isCont_iff)
paulson@14477
   529
paulson@14477
   530
lemma isCont_diff:
paulson@14477
   531
      "[| isCont f a; isCont g a |] ==> isCont (%x. f(x) - g(x)) a"
paulson@14477
   532
apply (simp add: diff_minus)
paulson@14477
   533
apply (auto intro: isCont_add isCont_minus)
paulson@14477
   534
done
paulson@14477
   535
paulson@15228
   536
lemma isCont_const [simp]: "isCont (%x. k) a"
paulson@14477
   537
by (simp add: isCont_def)
paulson@14477
   538
paulson@15228
   539
lemma isNSCont_const [simp]: "isNSCont (%x. k) a"
paulson@14477
   540
by (simp add: isNSCont_def)
paulson@14477
   541
huffman@20561
   542
lemma isNSCont_abs [simp]: "isNSCont abs (a::real)"
paulson@14477
   543
apply (simp add: isNSCont_def)
paulson@14477
   544
apply (auto intro: approx_hrabs simp add: hypreal_of_real_hrabs [symmetric] starfun_rabs_hrabs)
paulson@14477
   545
done
paulson@14477
   546
huffman@20561
   547
lemma isCont_abs [simp]: "isCont abs (a::real)"
paulson@14477
   548
by (auto simp add: isNSCont_isCont_iff [symmetric])
paulson@15228
   549
paulson@14477
   550
paulson@14477
   551
(****************************************************************
paulson@14477
   552
(%* Leave as commented until I add topology theory or remove? *%)
paulson@14477
   553
(%*------------------------------------------------------------
paulson@14477
   554
  Elementary topology proof for a characterisation of
paulson@14477
   555
  continuity now: a function f is continuous if and only
paulson@14477
   556
  if the inverse image, {x. f(x) \<in> A}, of any open set A
paulson@14477
   557
  is always an open set
paulson@14477
   558
 ------------------------------------------------------------*%)
paulson@14477
   559
Goal "[| isNSopen A; \<forall>x. isNSCont f x |]
paulson@14477
   560
               ==> isNSopen {x. f x \<in> A}"
paulson@14477
   561
by (auto_tac (claset(),simpset() addsimps [isNSopen_iff1]));
paulson@14477
   562
by (dtac (mem_monad_approx RS approx_sym);
paulson@14477
   563
by (dres_inst_tac [("x","a")] spec 1);
paulson@14477
   564
by (dtac isNSContD 1 THEN assume_tac 1)
paulson@14477
   565
by (dtac bspec 1 THEN assume_tac 1)
paulson@14477
   566
by (dres_inst_tac [("x","( *f* f) x")] approx_mem_monad2 1);
paulson@14477
   567
by (blast_tac (claset() addIs [starfun_mem_starset]);
paulson@14477
   568
qed "isNSCont_isNSopen";
paulson@14477
   569
paulson@14477
   570
Goalw [isNSCont_def]
paulson@14477
   571
          "\<forall>A. isNSopen A --> isNSopen {x. f x \<in> A} \
paulson@14477
   572
\              ==> isNSCont f x";
paulson@14477
   573
by (auto_tac (claset() addSIs [(mem_infmal_iff RS iffD1) RS
paulson@14477
   574
     (approx_minus_iff RS iffD2)],simpset() addsimps
paulson@14477
   575
      [Infinitesimal_def,SReal_iff]));
paulson@14477
   576
by (dres_inst_tac [("x","{z. abs(z + -f(x)) < ya}")] spec 1);
paulson@14477
   577
by (etac (isNSopen_open_interval RSN (2,impE));
paulson@14477
   578
by (auto_tac (claset(),simpset() addsimps [isNSopen_def,isNSnbhd_def]));
paulson@14477
   579
by (dres_inst_tac [("x","x")] spec 1);
paulson@14477
   580
by (auto_tac (claset() addDs [approx_sym RS approx_mem_monad],
paulson@14477
   581
    simpset() addsimps [hypreal_of_real_zero RS sym,STAR_starfun_rabs_add_minus]));
paulson@14477
   582
qed "isNSopen_isNSCont";
paulson@14477
   583
paulson@14477
   584
Goal "(\<forall>x. isNSCont f x) = \
paulson@14477
   585
\     (\<forall>A. isNSopen A --> isNSopen {x. f(x) \<in> A})";
paulson@14477
   586
by (blast_tac (claset() addIs [isNSCont_isNSopen,
paulson@14477
   587
    isNSopen_isNSCont]);
paulson@14477
   588
qed "isNSCont_isNSopen_iff";
paulson@14477
   589
paulson@14477
   590
(%*------- Standard version of same theorem --------*%)
paulson@14477
   591
Goal "(\<forall>x. isCont f x) = \
paulson@14477
   592
\         (\<forall>A. isopen A --> isopen {x. f(x) \<in> A})";
paulson@14477
   593
by (auto_tac (claset() addSIs [isNSCont_isNSopen_iff],
paulson@14477
   594
              simpset() addsimps [isNSopen_isopen_iff RS sym,
paulson@14477
   595
              isNSCont_isCont_iff RS sym]));
paulson@14477
   596
qed "isCont_isopen_iff";
paulson@14477
   597
*******************************************************************)
paulson@14477
   598
paulson@14477
   599
text{*Uniform continuity*}
paulson@14477
   600
lemma isNSUContD: "[| isNSUCont f; x \<approx> y|] ==> ( *f* f) x \<approx> ( *f* f) y"
paulson@14477
   601
by (simp add: isNSUCont_def)
paulson@14477
   602
paulson@14477
   603
lemma isUCont_isCont: "isUCont f ==> isCont f x"
paulson@14477
   604
by (simp add: isUCont_def isCont_def LIM_def, meson)
paulson@14477
   605
paulson@14477
   606
lemma isUCont_isNSUCont: "isUCont f ==> isNSUCont f"
paulson@14477
   607
apply (simp add: isNSUCont_def isUCont_def approx_def)
huffman@20552
   608
apply (simp add: all_star_eq starfun star_n_minus star_n_add)
paulson@14477
   609
apply (simp add: Infinitesimal_FreeUltrafilterNat_iff, safe)
huffman@20552
   610
apply (rename_tac Xa Xb u)
paulson@14477
   611
apply (drule_tac x = u in spec, clarify)
paulson@14477
   612
apply (drule_tac x = s in spec, clarify)
huffman@17318
   613
apply (subgoal_tac "\<forall>n::nat. abs ((Xa n) + - (Xb n)) < s --> abs (f (Xa n) + - f (Xb n)) < u")
paulson@14477
   614
prefer 2 apply blast
paulson@14477
   615
apply (erule_tac V = "\<forall>x y. \<bar>x + - y\<bar> < s --> \<bar>f x + - f y\<bar> < u" in thin_rl)
huffman@20552
   616
apply (erule ultra, simp)
paulson@14477
   617
done
paulson@14477
   618
nipkow@15360
   619
lemma lemma_LIMu: "\<forall>s>0.\<exists>z y. \<bar>z + - y\<bar> < s & r \<le> \<bar>f z + -f y\<bar>
nipkow@15360
   620
      ==> \<forall>n::nat. \<exists>z y. \<bar>z + -y\<bar> < inverse(real(Suc n)) & r \<le> \<bar>f z + -f y\<bar>"
paulson@14477
   621
apply clarify
kleing@19023
   622
apply (cut_tac n1 = n
paulson@15234
   623
       in real_of_nat_Suc_gt_zero [THEN positive_imp_inverse_positive], auto)
paulson@14477
   624
done
paulson@14477
   625
paulson@15234
   626
lemma lemma_skolemize_LIM2u:
nipkow@15360
   627
     "\<forall>s>0.\<exists>z y. \<bar>z + - y\<bar> < s  & r \<le> \<bar>f z + -f y\<bar>
paulson@14477
   628
      ==> \<exists>X Y. \<forall>n::nat.
paulson@14477
   629
               abs(X n + -(Y n)) < inverse(real(Suc n)) &
paulson@14477
   630
               r \<le> abs(f (X n) + -f (Y n))"
paulson@14477
   631
apply (drule lemma_LIMu)
paulson@14477
   632
apply (drule choice, safe)
paulson@14477
   633
apply (drule choice, blast)
paulson@14477
   634
done
paulson@14477
   635
paulson@14477
   636
lemma lemma_simpu: "\<forall>n. \<bar>X n + -Y n\<bar> < inverse (real(Suc n)) &
paulson@14477
   637
          r \<le> abs (f (X n) + - f(Y n)) ==>
paulson@14477
   638
          \<forall>n. \<bar>X n + - Y n\<bar> < inverse (real(Suc n))"
paulson@15228
   639
by auto
paulson@14477
   640
paulson@14477
   641
lemma isNSUCont_isUCont:
paulson@14477
   642
     "isNSUCont f ==> isUCont f"
huffman@20552
   643
apply (simp add: isNSUCont_def isUCont_def approx_def, safe)
paulson@15228
   644
apply (rule ccontr, simp)
paulson@14477
   645
apply (simp add: linorder_not_less)
paulson@14477
   646
apply (drule lemma_skolemize_LIM2u, safe)
huffman@17318
   647
apply (drule_tac x = "star_n X" in spec)
huffman@17318
   648
apply (drule_tac x = "star_n Y" in spec)
huffman@20552
   649
apply (drule mp)
huffman@20552
   650
apply (rule real_seq_to_hypreal_Infinitesimal2, simp)
huffman@20552
   651
apply (simp add: all_star_eq starfun star_n_minus star_n_add)
huffman@20552
   652
apply (simp add: Infinitesimal_FreeUltrafilterNat_iff)
huffman@20552
   653
apply (drule spec, drule (1) mp)
paulson@14477
   654
apply (drule FreeUltrafilterNat_all, ultra)
paulson@14477
   655
done
paulson@14477
   656
paulson@14477
   657
text{*Derivatives*}
paulson@14477
   658
lemma DERIV_iff: "(DERIV f x :> D) = ((%h. (f(x + h) + - f(x))/h) -- 0 --> D)"
paulson@14477
   659
by (simp add: deriv_def)
paulson@14477
   660
paulson@14477
   661
lemma DERIV_NS_iff:
paulson@14477
   662
      "(DERIV f x :> D) = ((%h. (f(x + h) + - f(x))/h) -- 0 --NS> D)"
paulson@14477
   663
by (simp add: deriv_def LIM_NSLIM_iff)
paulson@14477
   664
paulson@14477
   665
lemma DERIV_D: "DERIV f x :> D ==> (%h. (f(x + h) + - f(x))/h) -- 0 --> D"
paulson@14477
   666
by (simp add: deriv_def)
paulson@14477
   667
paulson@15228
   668
lemma NS_DERIV_D: "DERIV f x :> D ==> (%h. (f(x + h) + - f(x))/h) -- 0 --NS> D"
paulson@14477
   669
by (simp add: deriv_def LIM_NSLIM_iff)
paulson@14477
   670
paulson@15228
   671
paulson@14477
   672
subsubsection{*Uniqueness*}
paulson@14477
   673
paulson@14477
   674
lemma DERIV_unique:
paulson@14477
   675
      "[| DERIV f x :> D; DERIV f x :> E |] ==> D = E"
paulson@14477
   676
apply (simp add: deriv_def)
paulson@14477
   677
apply (blast intro: LIM_unique)
paulson@14477
   678
done
paulson@14477
   679
paulson@14477
   680
lemma NSDeriv_unique:
paulson@14477
   681
     "[| NSDERIV f x :> D; NSDERIV f x :> E |] ==> D = E"
paulson@14477
   682
apply (simp add: nsderiv_def)
paulson@14477
   683
apply (cut_tac Infinitesimal_epsilon hypreal_epsilon_not_zero)
paulson@15228
   684
apply (auto dest!: bspec [where x=epsilon]
paulson@15228
   685
            intro!: inj_hypreal_of_real [THEN injD]
paulson@14477
   686
            dest: approx_trans3)
paulson@14477
   687
done
paulson@14477
   688
paulson@14477
   689
subsubsection{*Differentiable*}
paulson@14477
   690
paulson@14477
   691
lemma differentiableD: "f differentiable x ==> \<exists>D. DERIV f x :> D"
paulson@14477
   692
by (simp add: differentiable_def)
paulson@14477
   693
paulson@14477
   694
lemma differentiableI: "DERIV f x :> D ==> f differentiable x"
paulson@14477
   695
by (force simp add: differentiable_def)
paulson@14477
   696
paulson@14477
   697
lemma NSdifferentiableD: "f NSdifferentiable x ==> \<exists>D. NSDERIV f x :> D"
paulson@14477
   698
by (simp add: NSdifferentiable_def)
paulson@14477
   699
paulson@14477
   700
lemma NSdifferentiableI: "NSDERIV f x :> D ==> f NSdifferentiable x"
paulson@14477
   701
by (force simp add: NSdifferentiable_def)
paulson@14477
   702
paulson@14477
   703
subsubsection{*Alternative definition for differentiability*}
paulson@14477
   704
paulson@14477
   705
lemma DERIV_LIM_iff:
huffman@20561
   706
     "((%h::real. (f(a + h) - f(a)) / h) -- 0 --> D) =
paulson@14477
   707
      ((%x. (f(x)-f(a)) / (x-a)) -- a --> D)"
paulson@14477
   708
proof (intro iffI LIM_I)
paulson@14477
   709
  fix r::real
paulson@14477
   710
  assume r: "0<r"
paulson@14477
   711
  assume "(\<lambda>h. (f (a + h) - f a) / h) -- 0 --> D"
paulson@14477
   712
  from LIM_D [OF this r]
paulson@14477
   713
  obtain s
paulson@14477
   714
    where s:    "0 < s"
paulson@14477
   715
      and s_lt: "\<forall>x. x \<noteq> 0 & \<bar>x\<bar> < s --> \<bar>(f (a + x) - f a) / x - D\<bar> < r"
paulson@14477
   716
  by auto
paulson@14477
   717
  show "\<exists>s. 0 < s \<and>
huffman@20561
   718
        (\<forall>x. x \<noteq> a \<and> norm (x-a) < s \<longrightarrow> norm ((f x - f a) / (x-a) - D) < r)"
paulson@14477
   719
  proof (intro exI conjI strip)
paulson@14477
   720
    show "0 < s"  by (rule s)
paulson@14477
   721
  next
paulson@14477
   722
    fix x::real
huffman@20561
   723
    assume "x \<noteq> a \<and> norm (x-a) < s"
paulson@14477
   724
    with s_lt [THEN spec [where x="x-a"]]
huffman@20552
   725
    show "norm ((f x - f a) / (x-a) - D) < r" by auto
paulson@14477
   726
  qed
paulson@14477
   727
next
paulson@14477
   728
  fix r::real
paulson@14477
   729
  assume r: "0<r"
paulson@14477
   730
  assume "(\<lambda>x. (f x - f a) / (x-a)) -- a --> D"
paulson@14477
   731
  from LIM_D [OF this r]
paulson@14477
   732
  obtain s
paulson@14477
   733
    where s:    "0 < s"
paulson@14477
   734
      and s_lt: "\<forall>x. x \<noteq> a & \<bar>x-a\<bar> < s --> \<bar>(f x - f a)/(x-a) - D\<bar> < r"
paulson@14477
   735
  by auto
paulson@14477
   736
  show "\<exists>s. 0 < s \<and>
huffman@20561
   737
        (\<forall>x. x \<noteq> 0 & norm (x - 0) < s --> norm ((f (a + x) - f a) / x - D) < r)"
paulson@14477
   738
  proof (intro exI conjI strip)
paulson@14477
   739
    show "0 < s"  by (rule s)
paulson@14477
   740
  next
paulson@14477
   741
    fix x::real
huffman@20561
   742
    assume "x \<noteq> 0 \<and> norm (x - 0) < s"
paulson@14477
   743
    with s_lt [THEN spec [where x="x+a"]]
huffman@20552
   744
    show "norm ((f (a + x) - f a) / x - D) < r" by (auto simp add: add_ac)
paulson@14477
   745
  qed
paulson@14477
   746
qed
paulson@14477
   747
paulson@14477
   748
lemma DERIV_iff2: "(DERIV f x :> D) = ((%z. (f(z) - f(x)) / (z-x)) -- x --> D)"
paulson@14477
   749
by (simp add: deriv_def diff_minus [symmetric] DERIV_LIM_iff)
paulson@14477
   750
paulson@14477
   751
paulson@14477
   752
subsection{*Equivalence of NS and standard definitions of differentiation*}
paulson@14477
   753
paulson@15228
   754
subsubsection{*First NSDERIV in terms of NSLIM*}
paulson@14477
   755
paulson@15228
   756
text{*first equivalence *}
paulson@14477
   757
lemma NSDERIV_NSLIM_iff:
paulson@14477
   758
      "(NSDERIV f x :> D) = ((%h. (f(x + h) + - f(x))/h) -- 0 --NS> D)"
paulson@14477
   759
apply (simp add: nsderiv_def NSLIM_def, auto)
paulson@14477
   760
apply (drule_tac x = xa in bspec)
paulson@14477
   761
apply (rule_tac [3] ccontr)
paulson@14477
   762
apply (drule_tac [3] x = h in spec)
paulson@14477
   763
apply (auto simp add: mem_infmal_iff starfun_lambda_cancel)
paulson@14477
   764
done
paulson@14477
   765
paulson@15228
   766
text{*second equivalence *}
paulson@14477
   767
lemma NSDERIV_NSLIM_iff2:
paulson@14477
   768
     "(NSDERIV f x :> D) = ((%z. (f(z) - f(x)) / (z-x)) -- x --NS> D)"
paulson@15228
   769
by (simp add: NSDERIV_NSLIM_iff DERIV_LIM_iff  diff_minus [symmetric]
paulson@14477
   770
              LIM_NSLIM_iff [symmetric])
paulson@14477
   771
paulson@14477
   772
(* while we're at it! *)
paulson@14477
   773
lemma NSDERIV_iff2:
paulson@14477
   774
     "(NSDERIV f x :> D) =
paulson@14477
   775
      (\<forall>w.
paulson@14477
   776
        w \<noteq> hypreal_of_real x & w \<approx> hypreal_of_real x -->
paulson@14477
   777
        ( *f* (%z. (f z - f x) / (z-x))) w \<approx> hypreal_of_real D)"
paulson@14477
   778
by (simp add: NSDERIV_NSLIM_iff2 NSLIM_def)
paulson@14477
   779
paulson@14477
   780
(*FIXME DELETE*)
paulson@14477
   781
lemma hypreal_not_eq_minus_iff: "(x \<noteq> a) = (x + -a \<noteq> (0::hypreal))"
paulson@14477
   782
by (auto dest: hypreal_eq_minus_iff [THEN iffD2])
paulson@14477
   783
paulson@14477
   784
lemma NSDERIVD5:
paulson@14477
   785
  "(NSDERIV f x :> D) ==>
paulson@14477
   786
   (\<forall>u. u \<approx> hypreal_of_real x -->
paulson@14477
   787
     ( *f* (%z. f z - f x)) u \<approx> hypreal_of_real D * (u - hypreal_of_real x))"
paulson@14477
   788
apply (auto simp add: NSDERIV_iff2)
paulson@14477
   789
apply (case_tac "u = hypreal_of_real x", auto)
paulson@14477
   790
apply (drule_tac x = u in spec, auto)
paulson@14477
   791
apply (drule_tac c = "u - hypreal_of_real x" and b = "hypreal_of_real D" in approx_mult1)
paulson@14477
   792
apply (drule_tac [!] hypreal_not_eq_minus_iff [THEN iffD1])
paulson@14477
   793
apply (subgoal_tac [2] "( *f* (%z. z-x)) u \<noteq> (0::hypreal) ")
nipkow@15539
   794
apply (auto simp add: diff_minus
kleing@19023
   795
         approx_minus_iff [THEN iffD1, THEN mem_infmal_iff [THEN iffD2]]
kleing@19023
   796
         Infinitesimal_subset_HFinite [THEN subsetD])
paulson@14477
   797
done
paulson@14477
   798
paulson@14477
   799
lemma NSDERIVD4:
paulson@14477
   800
     "(NSDERIV f x :> D) ==>
paulson@14477
   801
      (\<forall>h \<in> Infinitesimal.
paulson@14477
   802
               (( *f* f)(hypreal_of_real x + h) -
paulson@14477
   803
                 hypreal_of_real (f x))\<approx> (hypreal_of_real D) * h)"
paulson@14477
   804
apply (auto simp add: nsderiv_def)
paulson@14477
   805
apply (case_tac "h = (0::hypreal) ")
paulson@14477
   806
apply (auto simp add: diff_minus)
paulson@14477
   807
apply (drule_tac x = h in bspec)
paulson@14477
   808
apply (drule_tac [2] c = h in approx_mult1)
paulson@14477
   809
apply (auto intro: Infinitesimal_subset_HFinite [THEN subsetD]
nipkow@15539
   810
            simp add: diff_minus)
paulson@14477
   811
done
paulson@14477
   812
paulson@14477
   813
lemma NSDERIVD3:
paulson@14477
   814
     "(NSDERIV f x :> D) ==>
paulson@14477
   815
      (\<forall>h \<in> Infinitesimal - {0}.
paulson@14477
   816
               (( *f* f)(hypreal_of_real x + h) -
paulson@14477
   817
                 hypreal_of_real (f x))\<approx> (hypreal_of_real D) * h)"
paulson@14477
   818
apply (auto simp add: nsderiv_def)
paulson@14477
   819
apply (rule ccontr, drule_tac x = h in bspec)
paulson@14477
   820
apply (drule_tac [2] c = h in approx_mult1)
paulson@14477
   821
apply (auto intro: Infinitesimal_subset_HFinite [THEN subsetD]
nipkow@15539
   822
            simp add: mult_assoc diff_minus)
paulson@14477
   823
done
paulson@14477
   824
paulson@14477
   825
text{*Now equivalence between NSDERIV and DERIV*}
paulson@14477
   826
lemma NSDERIV_DERIV_iff: "(NSDERIV f x :> D) = (DERIV f x :> D)"
paulson@14477
   827
by (simp add: deriv_def NSDERIV_NSLIM_iff LIM_NSLIM_iff)
paulson@14477
   828
paulson@15228
   829
text{*Differentiability implies continuity
paulson@15228
   830
         nice and simple "algebraic" proof*}
paulson@14477
   831
lemma NSDERIV_isNSCont: "NSDERIV f x :> D ==> isNSCont f x"
paulson@14477
   832
apply (auto simp add: nsderiv_def isNSCont_NSLIM_iff NSLIM_def)
paulson@14477
   833
apply (drule approx_minus_iff [THEN iffD1])
paulson@14477
   834
apply (drule hypreal_not_eq_minus_iff [THEN iffD1])
paulson@14477
   835
apply (drule_tac x = "-hypreal_of_real x + xa" in bspec)
paulson@15228
   836
 prefer 2 apply (simp add: add_assoc [symmetric])
paulson@15234
   837
apply (auto simp add: mem_infmal_iff [symmetric] add_commute)
paulson@14477
   838
apply (drule_tac c = "xa + -hypreal_of_real x" in approx_mult1)
paulson@14477
   839
apply (auto intro: Infinitesimal_subset_HFinite [THEN subsetD]
paulson@14477
   840
            simp add: mult_assoc)
paulson@14477
   841
apply (drule_tac x3=D in
paulson@14477
   842
           HFinite_hypreal_of_real [THEN [2] Infinitesimal_HFinite_mult,
paulson@14477
   843
             THEN mem_infmal_iff [THEN iffD1]])
nipkow@15539
   844
apply (auto simp add: mult_commute
paulson@14477
   845
            intro: approx_trans approx_minus_iff [THEN iffD2])
paulson@14477
   846
done
paulson@14477
   847
paulson@14477
   848
text{*Now Sandard proof*}
paulson@14477
   849
lemma DERIV_isCont: "DERIV f x :> D ==> isCont f x"
paulson@15228
   850
by (simp add: NSDERIV_DERIV_iff [symmetric] isNSCont_isCont_iff [symmetric]
paulson@14477
   851
              NSDERIV_isNSCont)
paulson@14477
   852
paulson@14477
   853
paulson@15228
   854
text{*Differentiation rules for combinations of functions
paulson@14477
   855
      follow from clear, straightforard, algebraic
paulson@15228
   856
      manipulations*}
paulson@14477
   857
text{*Constant function*}
paulson@14477
   858
paulson@14477
   859
(* use simple constant nslimit theorem *)
paulson@15228
   860
lemma NSDERIV_const [simp]: "(NSDERIV (%x. k) x :> 0)"
paulson@14477
   861
by (simp add: NSDERIV_NSLIM_iff)
paulson@14477
   862
paulson@15228
   863
lemma DERIV_const [simp]: "(DERIV (%x. k) x :> 0)"
paulson@14477
   864
by (simp add: NSDERIV_DERIV_iff [symmetric])
paulson@14477
   865
paulson@15228
   866
text{*Sum of functions- proved easily*}
paulson@14477
   867
paulson@14477
   868
paulson@14477
   869
lemma NSDERIV_add: "[| NSDERIV f x :> Da;  NSDERIV g x :> Db |]
paulson@14477
   870
      ==> NSDERIV (%x. f x + g x) x :> Da + Db"
paulson@14477
   871
apply (auto simp add: NSDERIV_NSLIM_iff NSLIM_def)
paulson@14477
   872
apply (auto simp add: add_divide_distrib dest!: spec)
paulson@14477
   873
apply (drule_tac b = "hypreal_of_real Da" and d = "hypreal_of_real Db" in approx_add)
paulson@14477
   874
apply (auto simp add: add_ac)
paulson@14477
   875
done
paulson@14477
   876
paulson@14477
   877
(* Standard theorem *)
paulson@14477
   878
lemma DERIV_add: "[| DERIV f x :> Da; DERIV g x :> Db |]
paulson@14477
   879
      ==> DERIV (%x. f x + g x) x :> Da + Db"
paulson@14477
   880
apply (simp add: NSDERIV_add NSDERIV_DERIV_iff [symmetric])
paulson@14477
   881
done
paulson@14477
   882
paulson@15228
   883
text{*Product of functions - Proof is trivial but tedious
paulson@15228
   884
  and long due to rearrangement of terms*}
paulson@14477
   885
paulson@14477
   886
lemma lemma_nsderiv1: "((a::hypreal)*b) + -(c*d) = (b*(a + -c)) + (c*(b + -d))"
paulson@14477
   887
by (simp add: right_distrib)
paulson@14477
   888
paulson@14477
   889
lemma lemma_nsderiv2: "[| (x + y) / z = hypreal_of_real D + yb; z \<noteq> 0;
paulson@14477
   890
         z \<in> Infinitesimal; yb \<in> Infinitesimal |]
paulson@14477
   891
      ==> x + y \<approx> 0"
paulson@14477
   892
apply (frule_tac c1 = z in hypreal_mult_right_cancel [THEN iffD2], assumption)
paulson@15234
   893
apply (erule_tac V = "(x + y) / z = hypreal_of_real D + yb" in thin_rl)
paulson@14477
   894
apply (auto intro!: Infinitesimal_HFinite_mult2 HFinite_add
nipkow@15539
   895
            simp add: mult_assoc mem_infmal_iff [symmetric])
paulson@14477
   896
apply (erule Infinitesimal_subset_HFinite [THEN subsetD])
paulson@14477
   897
done
paulson@14477
   898
paulson@14477
   899
paulson@14477
   900
lemma NSDERIV_mult: "[| NSDERIV f x :> Da; NSDERIV g x :> Db |]
paulson@14477
   901
      ==> NSDERIV (%x. f x * g x) x :> (Da * g(x)) + (Db * f(x))"
paulson@14477
   902
apply (auto simp add: NSDERIV_NSLIM_iff NSLIM_def)
paulson@14477
   903
apply (auto dest!: spec
kleing@19023
   904
      simp add: starfun_lambda_cancel lemma_nsderiv1)
paulson@14477
   905
apply (simp (no_asm) add: add_divide_distrib)
paulson@14477
   906
apply (drule bex_Infinitesimal_iff2 [THEN iffD2])+
paulson@15234
   907
apply (auto simp add: times_divide_eq_right [symmetric]
paulson@15234
   908
            simp del: times_divide_eq)
paulson@14477
   909
apply (drule_tac D = Db in lemma_nsderiv2)
paulson@14477
   910
apply (drule_tac [4]
paulson@15228
   911
     approx_minus_iff [THEN iffD2, THEN bex_Infinitesimal_iff2 [THEN iffD2]])
paulson@15228
   912
apply (auto intro!: approx_add_mono1
paulson@14477
   913
            simp add: left_distrib right_distrib mult_commute add_assoc)
paulson@15228
   914
apply (rule_tac b1 = "hypreal_of_real Db * hypreal_of_real (f x)"
paulson@14477
   915
         in add_commute [THEN subst])
paulson@15228
   916
apply (auto intro!: Infinitesimal_add_approx_self2 [THEN approx_sym]
paulson@15228
   917
                    Infinitesimal_add Infinitesimal_mult
paulson@15228
   918
                    Infinitesimal_hypreal_of_real_mult
paulson@14477
   919
                    Infinitesimal_hypreal_of_real_mult2
paulson@14477
   920
          simp add: add_assoc [symmetric])
paulson@14477
   921
done
paulson@14477
   922
paulson@14477
   923
lemma DERIV_mult:
paulson@15228
   924
     "[| DERIV f x :> Da; DERIV g x :> Db |]
paulson@14477
   925
      ==> DERIV (%x. f x * g x) x :> (Da * g(x)) + (Db * f(x))"
paulson@14477
   926
by (simp add: NSDERIV_mult NSDERIV_DERIV_iff [symmetric])
paulson@14477
   927
paulson@14477
   928
text{*Multiplying by a constant*}
paulson@14477
   929
lemma NSDERIV_cmult: "NSDERIV f x :> D
paulson@14477
   930
      ==> NSDERIV (%x. c * f x) x :> c*D"
paulson@15228
   931
apply (simp only: times_divide_eq_right [symmetric] NSDERIV_NSLIM_iff
paulson@14477
   932
                  minus_mult_right right_distrib [symmetric])
paulson@14477
   933
apply (erule NSLIM_const [THEN NSLIM_mult])
paulson@14477
   934
done
paulson@14477
   935
paulson@14477
   936
(* let's do the standard proof though theorem *)
paulson@14477
   937
(* LIM_mult2 follows from a NS proof          *)
paulson@14477
   938
paulson@14477
   939
lemma DERIV_cmult:
paulson@14477
   940
      "DERIV f x :> D ==> DERIV (%x. c * f x) x :> c*D"
paulson@15228
   941
apply (simp only: deriv_def times_divide_eq_right [symmetric]
paulson@14477
   942
                  NSDERIV_NSLIM_iff minus_mult_right right_distrib [symmetric])
paulson@14477
   943
apply (erule LIM_const [THEN LIM_mult2])
paulson@14477
   944
done
paulson@14477
   945
paulson@14477
   946
text{*Negation of function*}
paulson@14477
   947
lemma NSDERIV_minus: "NSDERIV f x :> D ==> NSDERIV (%x. -(f x)) x :> -D"
paulson@14477
   948
proof (simp add: NSDERIV_NSLIM_iff)
paulson@14477
   949
  assume "(\<lambda>h. (f (x + h) + - f x) / h) -- 0 --NS> D"
paulson@15228
   950
  hence deriv: "(\<lambda>h. - ((f(x+h) + - f x) / h)) -- 0 --NS> - D"
paulson@14477
   951
    by (rule NSLIM_minus)
paulson@14477
   952
  have "\<forall>h. - ((f (x + h) + - f x) / h) = (- f (x + h) + f x) / h"
paulson@15228
   953
    by (simp add: minus_divide_left)
paulson@14477
   954
  with deriv
paulson@14477
   955
  show "(\<lambda>h. (- f (x + h) + f x) / h) -- 0 --NS> - D" by simp
paulson@14477
   956
qed
paulson@14477
   957
paulson@14477
   958
paulson@14477
   959
lemma DERIV_minus: "DERIV f x :> D ==> DERIV (%x. -(f x)) x :> -D"
paulson@14477
   960
by (simp add: NSDERIV_minus NSDERIV_DERIV_iff [symmetric])
paulson@14477
   961
paulson@14477
   962
text{*Subtraction*}
paulson@14477
   963
lemma NSDERIV_add_minus: "[| NSDERIV f x :> Da; NSDERIV g x :> Db |] ==> NSDERIV (%x. f x + -g x) x :> Da + -Db"
paulson@14477
   964
by (blast dest: NSDERIV_add NSDERIV_minus)
paulson@14477
   965
paulson@14477
   966
lemma DERIV_add_minus: "[| DERIV f x :> Da; DERIV g x :> Db |] ==> DERIV (%x. f x + -g x) x :> Da + -Db"
paulson@14477
   967
by (blast dest: DERIV_add DERIV_minus)
paulson@14477
   968
paulson@14477
   969
lemma NSDERIV_diff:
paulson@14477
   970
     "[| NSDERIV f x :> Da; NSDERIV g x :> Db |]
paulson@14477
   971
      ==> NSDERIV (%x. f x - g x) x :> Da-Db"
paulson@14477
   972
apply (simp add: diff_minus)
paulson@14477
   973
apply (blast intro: NSDERIV_add_minus)
paulson@14477
   974
done
paulson@14477
   975
paulson@14477
   976
lemma DERIV_diff:
paulson@14477
   977
     "[| DERIV f x :> Da; DERIV g x :> Db |]
paulson@14477
   978
       ==> DERIV (%x. f x - g x) x :> Da-Db"
paulson@14477
   979
apply (simp add: diff_minus)
paulson@14477
   980
apply (blast intro: DERIV_add_minus)
paulson@14477
   981
done
paulson@14477
   982
paulson@15228
   983
text{*(NS) Increment*}
paulson@14477
   984
lemma incrementI:
paulson@14477
   985
      "f NSdifferentiable x ==>
paulson@14477
   986
      increment f x h = ( *f* f) (hypreal_of_real(x) + h) +
paulson@14477
   987
      -hypreal_of_real (f x)"
paulson@14477
   988
by (simp add: increment_def)
paulson@14477
   989
paulson@14477
   990
lemma incrementI2: "NSDERIV f x :> D ==>
paulson@14477
   991
     increment f x h = ( *f* f) (hypreal_of_real(x) + h) +
paulson@14477
   992
     -hypreal_of_real (f x)"
paulson@14477
   993
apply (erule NSdifferentiableI [THEN incrementI])
paulson@14477
   994
done
paulson@14477
   995
paulson@14477
   996
(* The Increment theorem -- Keisler p. 65 *)
paulson@14477
   997
lemma increment_thm: "[| NSDERIV f x :> D; h \<in> Infinitesimal; h \<noteq> 0 |]
paulson@14477
   998
      ==> \<exists>e \<in> Infinitesimal. increment f x h = hypreal_of_real(D)*h + e*h"
paulson@14477
   999
apply (frule_tac h = h in incrementI2, simp add: nsderiv_def)
paulson@14477
  1000
apply (drule bspec, auto)
paulson@15228
  1001
apply (drule bex_Infinitesimal_iff2 [THEN iffD2], clarify)
paulson@15228
  1002
apply (frule_tac b1 = "hypreal_of_real (D) + y"
paulson@14477
  1003
        in hypreal_mult_right_cancel [THEN iffD2])
paulson@14477
  1004
apply (erule_tac [2] V = "(( *f* f) (hypreal_of_real (x) + h) + - hypreal_of_real (f x)) / h = hypreal_of_real (D) + y" in thin_rl)
paulson@14477
  1005
apply assumption
nipkow@15539
  1006
apply (simp add: times_divide_eq_right [symmetric])
paulson@14477
  1007
apply (auto simp add: left_distrib)
paulson@14477
  1008
done
paulson@15228
  1009
paulson@14477
  1010
lemma increment_thm2:
paulson@14477
  1011
     "[| NSDERIV f x :> D; h \<approx> 0; h \<noteq> 0 |]
paulson@14477
  1012
      ==> \<exists>e \<in> Infinitesimal. increment f x h =
paulson@14477
  1013
              hypreal_of_real(D)*h + e*h"
paulson@14477
  1014
by (blast dest!: mem_infmal_iff [THEN iffD2] intro!: increment_thm)
paulson@14477
  1015
paulson@14477
  1016
paulson@14477
  1017
lemma increment_approx_zero: "[| NSDERIV f x :> D; h \<approx> 0; h \<noteq> 0 |]
paulson@14477
  1018
      ==> increment f x h \<approx> 0"
paulson@15228
  1019
apply (drule increment_thm2,
paulson@14477
  1020
       auto intro!: Infinitesimal_HFinite_mult2 HFinite_add simp add: left_distrib [symmetric] mem_infmal_iff [symmetric])
paulson@14477
  1021
apply (erule Infinitesimal_subset_HFinite [THEN subsetD])
paulson@14477
  1022
done
paulson@14477
  1023
paulson@14477
  1024
text{*  Similarly to the above, the chain rule admits an entirely
paulson@14477
  1025
   straightforward derivation. Compare this with Harrison's
paulson@14477
  1026
   HOL proof of the chain rule, which proved to be trickier and
paulson@14477
  1027
   required an alternative characterisation of differentiability-
paulson@14477
  1028
   the so-called Carathedory derivative. Our main problem is
paulson@14477
  1029
   manipulation of terms.*}
paulson@14477
  1030
paulson@14477
  1031
paulson@14477
  1032
(* lemmas *)
paulson@14477
  1033
lemma NSDERIV_zero:
paulson@14477
  1034
      "[| NSDERIV g x :> D;
paulson@14477
  1035
               ( *f* g) (hypreal_of_real(x) + xa) = hypreal_of_real(g x);
paulson@14477
  1036
               xa \<in> Infinitesimal;
paulson@14477
  1037
               xa \<noteq> 0
paulson@14477
  1038
            |] ==> D = 0"
paulson@14477
  1039
apply (simp add: nsderiv_def)
paulson@14477
  1040
apply (drule bspec, auto)
paulson@14477
  1041
done
paulson@14477
  1042
paulson@14477
  1043
(* can be proved differently using NSLIM_isCont_iff *)
paulson@14477
  1044
lemma NSDERIV_approx:
paulson@14477
  1045
     "[| NSDERIV f x :> D;  h \<in> Infinitesimal;  h \<noteq> 0 |]
paulson@14477
  1046
      ==> ( *f* f) (hypreal_of_real(x) + h) + -hypreal_of_real(f x) \<approx> 0"
paulson@14477
  1047
apply (simp add: nsderiv_def)
paulson@14477
  1048
apply (simp add: mem_infmal_iff [symmetric])
paulson@14477
  1049
apply (rule Infinitesimal_ratio)
paulson@14477
  1050
apply (rule_tac [3] approx_hypreal_of_real_HFinite, auto)
paulson@14477
  1051
done
paulson@14477
  1052
paulson@14477
  1053
(*---------------------------------------------------------------
paulson@14477
  1054
   from one version of differentiability
paulson@14477
  1055
paulson@14477
  1056
                f(x) - f(a)
paulson@14477
  1057
              --------------- \<approx> Db
paulson@14477
  1058
                  x - a
paulson@14477
  1059
 ---------------------------------------------------------------*)
paulson@14477
  1060
lemma NSDERIVD1: "[| NSDERIV f (g x) :> Da;
paulson@14477
  1061
         ( *f* g) (hypreal_of_real(x) + xa) \<noteq> hypreal_of_real (g x);
paulson@14477
  1062
         ( *f* g) (hypreal_of_real(x) + xa) \<approx> hypreal_of_real (g x)
paulson@14477
  1063
      |] ==> (( *f* f) (( *f* g) (hypreal_of_real(x) + xa))
paulson@14477
  1064
                   + - hypreal_of_real (f (g x)))
paulson@14477
  1065
              / (( *f* g) (hypreal_of_real(x) + xa) + - hypreal_of_real (g x))
paulson@14477
  1066
             \<approx> hypreal_of_real(Da)"
paulson@14477
  1067
by (auto simp add: NSDERIV_NSLIM_iff2 NSLIM_def diff_minus [symmetric])
paulson@14477
  1068
paulson@14477
  1069
(*--------------------------------------------------------------
paulson@14477
  1070
   from other version of differentiability
paulson@14477
  1071
paulson@14477
  1072
                f(x + h) - f(x)
paulson@14477
  1073
               ----------------- \<approx> Db
paulson@14477
  1074
                       h
paulson@14477
  1075
 --------------------------------------------------------------*)
paulson@14477
  1076
lemma NSDERIVD2: "[| NSDERIV g x :> Db; xa \<in> Infinitesimal; xa \<noteq> 0 |]
paulson@14477
  1077
      ==> (( *f* g) (hypreal_of_real(x) + xa) + - hypreal_of_real(g x)) / xa
paulson@14477
  1078
          \<approx> hypreal_of_real(Db)"
paulson@14477
  1079
by (auto simp add: NSDERIV_NSLIM_iff NSLIM_def mem_infmal_iff starfun_lambda_cancel)
paulson@14477
  1080
paulson@14477
  1081
lemma lemma_chain: "(z::hypreal) \<noteq> 0 ==> x*y = (x*inverse(z))*(z*y)"
paulson@14477
  1082
by auto
paulson@14477
  1083
paulson@15228
  1084
text{*This proof uses both definitions of differentiability.*}
paulson@14477
  1085
lemma NSDERIV_chain: "[| NSDERIV f (g x) :> Da; NSDERIV g x :> Db |]
paulson@14477
  1086
      ==> NSDERIV (f o g) x :> Da * Db"
paulson@14477
  1087
apply (simp (no_asm_simp) add: NSDERIV_NSLIM_iff NSLIM_def
paulson@14477
  1088
                mem_infmal_iff [symmetric])
paulson@14477
  1089
apply clarify
paulson@14477
  1090
apply (frule_tac f = g in NSDERIV_approx)
paulson@14477
  1091
apply (auto simp add: starfun_lambda_cancel2 starfun_o [symmetric])
paulson@14477
  1092
apply (case_tac "( *f* g) (hypreal_of_real (x) + xa) = hypreal_of_real (g x) ")
paulson@14477
  1093
apply (drule_tac g = g in NSDERIV_zero)
paulson@14477
  1094
apply (auto simp add: divide_inverse)
paulson@14477
  1095
apply (rule_tac z1 = "( *f* g) (hypreal_of_real (x) + xa) + -hypreal_of_real (g x) " and y1 = "inverse xa" in lemma_chain [THEN ssubst])
paulson@14477
  1096
apply (erule hypreal_not_eq_minus_iff [THEN iffD1])
paulson@14477
  1097
apply (rule approx_mult_hypreal_of_real)
paulson@14477
  1098
apply (simp_all add: divide_inverse [symmetric])
paulson@14477
  1099
apply (blast intro: NSDERIVD1 approx_minus_iff [THEN iffD2])
paulson@14477
  1100
apply (blast intro: NSDERIVD2)
paulson@14477
  1101
done
paulson@14477
  1102
paulson@14477
  1103
(* standard version *)
paulson@14477
  1104
lemma DERIV_chain: "[| DERIV f (g x) :> Da; DERIV g x :> Db |] ==> DERIV (f o g) x :> Da * Db"
paulson@14477
  1105
by (simp add: NSDERIV_DERIV_iff [symmetric] NSDERIV_chain)
paulson@14477
  1106
paulson@14477
  1107
lemma DERIV_chain2: "[| DERIV f (g x) :> Da; DERIV g x :> Db |] ==> DERIV (%x. f (g x)) x :> Da * Db"
paulson@14477
  1108
by (auto dest: DERIV_chain simp add: o_def)
paulson@14477
  1109
paulson@14477
  1110
text{*Differentiation of natural number powers*}
paulson@15228
  1111
lemma NSDERIV_Id [simp]: "NSDERIV (%x. x) x :> 1"
paulson@15228
  1112
by (simp add: NSDERIV_NSLIM_iff NSLIM_def divide_self del: divide_self_if)
paulson@14477
  1113
paulson@14477
  1114
(*derivative of the identity function*)
paulson@15228
  1115
lemma DERIV_Id [simp]: "DERIV (%x. x) x :> 1"
paulson@14477
  1116
by (simp add: NSDERIV_DERIV_iff [symmetric])
paulson@14477
  1117
paulson@14477
  1118
lemmas isCont_Id = DERIV_Id [THEN DERIV_isCont, standard]
paulson@14477
  1119
paulson@14477
  1120
(*derivative of linear multiplication*)
paulson@15228
  1121
lemma DERIV_cmult_Id [simp]: "DERIV (op * c) x :> c"
paulson@14477
  1122
by (cut_tac c = c and x = x in DERIV_Id [THEN DERIV_cmult], simp)
paulson@14477
  1123
paulson@15228
  1124
lemma NSDERIV_cmult_Id [simp]: "NSDERIV (op * c) x :> c"
paulson@14477
  1125
by (simp add: NSDERIV_DERIV_iff)
paulson@14477
  1126
paulson@14477
  1127
lemma DERIV_pow: "DERIV (%x. x ^ n) x :> real n * (x ^ (n - Suc 0))"
paulson@15251
  1128
apply (induct "n")
paulson@14477
  1129
apply (drule_tac [2] DERIV_Id [THEN DERIV_mult])
paulson@14477
  1130
apply (auto simp add: real_of_nat_Suc left_distrib)
paulson@14477
  1131
apply (case_tac "0 < n")
paulson@14477
  1132
apply (drule_tac x = x in realpow_minus_mult)
paulson@15234
  1133
apply (auto simp add: mult_assoc add_commute)
paulson@14477
  1134
done
paulson@14477
  1135
paulson@14477
  1136
(* NS version *)
paulson@14477
  1137
lemma NSDERIV_pow: "NSDERIV (%x. x ^ n) x :> real n * (x ^ (n - Suc 0))"
paulson@14477
  1138
by (simp add: NSDERIV_DERIV_iff DERIV_pow)
paulson@14477
  1139
paulson@15228
  1140
text{*Power of -1*}
paulson@14477
  1141
paulson@14477
  1142
(*Can't get rid of x \<noteq> 0 because it isn't continuous at zero*)
paulson@14477
  1143
lemma NSDERIV_inverse:
paulson@14477
  1144
     "x \<noteq> 0 ==> NSDERIV (%x. inverse(x)) x :> (- (inverse x ^ Suc (Suc 0)))"
paulson@14477
  1145
apply (simp add: nsderiv_def)
paulson@15228
  1146
apply (rule ballI, simp, clarify)
paulson@14477
  1147
apply (frule Infinitesimal_add_not_zero)
paulson@15228
  1148
prefer 2 apply (simp add: add_commute)
paulson@15228
  1149
apply (auto simp add: starfun_inverse_inverse realpow_two
paulson@14477
  1150
        simp del: minus_mult_left [symmetric] minus_mult_right [symmetric])
paulson@14477
  1151
apply (simp add: inverse_add inverse_mult_distrib [symmetric]
paulson@14477
  1152
              inverse_minus_eq [symmetric] add_ac mult_ac
paulson@15228
  1153
            del: inverse_mult_distrib inverse_minus_eq
paulson@14477
  1154
                 minus_mult_left [symmetric] minus_mult_right [symmetric])
paulson@14477
  1155
apply (simp (no_asm_simp) add: mult_assoc [symmetric] right_distrib
paulson@14477
  1156
            del: minus_mult_left [symmetric] minus_mult_right [symmetric])
paulson@15234
  1157
apply (rule_tac y = "inverse (- hypreal_of_real x * hypreal_of_real x)" in approx_trans)
paulson@14477
  1158
apply (rule inverse_add_Infinitesimal_approx2)
paulson@15228
  1159
apply (auto dest!: hypreal_of_real_HFinite_diff_Infinitesimal
paulson@14477
  1160
            simp add: inverse_minus_eq [symmetric] HFinite_minus_iff)
paulson@14477
  1161
apply (rule Infinitesimal_HFinite_mult2, auto)
paulson@14477
  1162
done
paulson@14477
  1163
paulson@14477
  1164
paulson@14477
  1165
paulson@14477
  1166
paulson@14477
  1167
lemma DERIV_inverse: "x \<noteq> 0 ==> DERIV (%x. inverse(x)) x :> (-(inverse x ^ Suc (Suc 0)))"
paulson@14477
  1168
by (simp add: NSDERIV_inverse NSDERIV_DERIV_iff [symmetric] del: realpow_Suc)
paulson@14477
  1169
paulson@14477
  1170
text{*Derivative of inverse*}
paulson@14477
  1171
lemma DERIV_inverse_fun: "[| DERIV f x :> d; f(x) \<noteq> 0 |]
paulson@14477
  1172
      ==> DERIV (%x. inverse(f x)) x :> (- (d * inverse(f(x) ^ Suc (Suc 0))))"
paulson@14477
  1173
apply (simp only: mult_commute [of d] minus_mult_left power_inverse)
paulson@14477
  1174
apply (fold o_def)
paulson@14477
  1175
apply (blast intro!: DERIV_chain DERIV_inverse)
paulson@14477
  1176
done
paulson@14477
  1177
paulson@14477
  1178
lemma NSDERIV_inverse_fun: "[| NSDERIV f x :> d; f(x) \<noteq> 0 |]
paulson@14477
  1179
      ==> NSDERIV (%x. inverse(f x)) x :> (- (d * inverse(f(x) ^ Suc (Suc 0))))"
paulson@14477
  1180
by (simp add: NSDERIV_DERIV_iff DERIV_inverse_fun del: realpow_Suc)
paulson@14477
  1181
paulson@14477
  1182
text{*Derivative of quotient*}
paulson@14477
  1183
lemma DERIV_quotient: "[| DERIV f x :> d; DERIV g x :> e; g(x) \<noteq> 0 |]
paulson@14477
  1184
       ==> DERIV (%y. f(y) / (g y)) x :> (d*g(x) + -(e*f(x))) / (g(x) ^ Suc (Suc 0))"
paulson@14477
  1185
apply (drule_tac f = g in DERIV_inverse_fun)
paulson@14477
  1186
apply (drule_tac [2] DERIV_mult)
paulson@14477
  1187
apply (assumption+)
paulson@14477
  1188
apply (simp add: divide_inverse right_distrib power_inverse minus_mult_left
paulson@15228
  1189
                 mult_ac
paulson@14477
  1190
     del: realpow_Suc minus_mult_right [symmetric] minus_mult_left [symmetric])
paulson@14477
  1191
done
paulson@14477
  1192
paulson@14477
  1193
lemma NSDERIV_quotient: "[| NSDERIV f x :> d; DERIV g x :> e; g(x) \<noteq> 0 |]
paulson@14477
  1194
       ==> NSDERIV (%y. f(y) / (g y)) x :> (d*g(x)
paulson@14477
  1195
                            + -(e*f(x))) / (g(x) ^ Suc (Suc 0))"
paulson@14477
  1196
by (simp add: NSDERIV_DERIV_iff DERIV_quotient del: realpow_Suc)
paulson@14477
  1197
paulson@14477
  1198
(* ------------------------------------------------------------------------ *)
paulson@14477
  1199
(* Caratheodory formulation of derivative at a point: standard proof        *)
paulson@14477
  1200
(* ------------------------------------------------------------------------ *)
paulson@14477
  1201
paulson@14477
  1202
lemma CARAT_DERIV:
paulson@14477
  1203
     "(DERIV f x :> l) =
paulson@14477
  1204
      (\<exists>g. (\<forall>z. f z - f x = g z * (z-x)) & isCont g x & g x = l)"
paulson@14477
  1205
      (is "?lhs = ?rhs")
paulson@14477
  1206
proof
paulson@14477
  1207
  assume der: "DERIV f x :> l"
paulson@14477
  1208
  show "\<exists>g. (\<forall>z. f z - f x = g z * (z-x)) \<and> isCont g x \<and> g x = l"
paulson@14477
  1209
  proof (intro exI conjI)
paulson@14477
  1210
    let ?g = "(%z. if z = x then l else (f z - f x) / (z-x))"
nipkow@15539
  1211
    show "\<forall>z. f z - f x = ?g z * (z-x)" by (simp)
paulson@15228
  1212
    show "isCont ?g x" using der
paulson@15228
  1213
      by (simp add: isCont_iff DERIV_iff diff_minus
paulson@14477
  1214
               cong: LIM_equal [rule_format])
paulson@14477
  1215
    show "?g x = l" by simp
paulson@14477
  1216
  qed
paulson@14477
  1217
next
paulson@14477
  1218
  assume "?rhs"
paulson@15228
  1219
  then obtain g where
paulson@14477
  1220
    "(\<forall>z. f z - f x = g z * (z-x))" and "isCont g x" and "g x = l" by blast
paulson@15228
  1221
  thus "(DERIV f x :> l)"
paulson@15228
  1222
     by (auto simp add: isCont_iff DERIV_iff diff_minus
paulson@14477
  1223
               cong: LIM_equal [rule_format])
paulson@14477
  1224
qed
paulson@14477
  1225
paulson@14477
  1226
paulson@14477
  1227
lemma CARAT_NSDERIV: "NSDERIV f x :> l ==>
paulson@14477
  1228
      \<exists>g. (\<forall>z. f z - f x = g z * (z-x)) & isNSCont g x & g x = l"
paulson@14477
  1229
by (auto simp add: NSDERIV_DERIV_iff isNSCont_isCont_iff CARAT_DERIV)
paulson@14477
  1230
paulson@14477
  1231
lemma hypreal_eq_minus_iff3: "(x = y + z) = (x + -z = (y::hypreal))"
paulson@14477
  1232
by auto
paulson@14477
  1233
paulson@14477
  1234
lemma CARAT_DERIVD:
paulson@14477
  1235
  assumes all: "\<forall>z. f z - f x = g z * (z-x)"
paulson@14477
  1236
      and nsc: "isNSCont g x"
paulson@14477
  1237
  shows "NSDERIV f x :> g x"
paulson@14477
  1238
proof -
paulson@14477
  1239
  from nsc
paulson@14477
  1240
  have "\<forall>w. w \<noteq> hypreal_of_real x \<and> w \<approx> hypreal_of_real x \<longrightarrow>
paulson@14477
  1241
         ( *f* g) w * (w - hypreal_of_real x) / (w - hypreal_of_real x) \<approx>
paulson@15228
  1242
         hypreal_of_real (g x)"
paulson@14477
  1243
    by (simp add: diff_minus isNSCont_def)
paulson@14477
  1244
  thus ?thesis using all
paulson@15228
  1245
    by (simp add: NSDERIV_iff2 starfun_if_eq cong: if_cong)
paulson@14477
  1246
qed
paulson@14477
  1247
paulson@15234
  1248
text{*Lemmas about nested intervals and proof by bisection (cf.Harrison).
paulson@15234
  1249
     All considerably tidied by lcp.*}
paulson@14477
  1250
paulson@14477
  1251
lemma lemma_f_mono_add [rule_format (no_asm)]: "(\<forall>n. (f::nat=>real) n \<le> f (Suc n)) --> f m \<le> f(m + no)"
paulson@15251
  1252
apply (induct "no")
paulson@14477
  1253
apply (auto intro: order_trans)
paulson@14477
  1254
done
paulson@14477
  1255
paulson@14477
  1256
lemma f_inc_g_dec_Beq_f: "[| \<forall>n. f(n) \<le> f(Suc n);
paulson@14477
  1257
         \<forall>n. g(Suc n) \<le> g(n);
paulson@14477
  1258
         \<forall>n. f(n) \<le> g(n) |]
huffman@20552
  1259
      ==> Bseq (f :: nat \<Rightarrow> real)"
paulson@14477
  1260
apply (rule_tac k = "f 0" and K = "g 0" in BseqI2, rule allI)
paulson@14477
  1261
apply (induct_tac "n")
paulson@14477
  1262
apply (auto intro: order_trans)
paulson@15234
  1263
apply (rule_tac y = "g (Suc na)" in order_trans)
paulson@14477
  1264
apply (induct_tac [2] "na")
paulson@14477
  1265
apply (auto intro: order_trans)
paulson@14477
  1266
done
paulson@14477
  1267
paulson@14477
  1268
lemma f_inc_g_dec_Beq_g: "[| \<forall>n. f(n) \<le> f(Suc n);
paulson@14477
  1269
         \<forall>n. g(Suc n) \<le> g(n);
paulson@14477
  1270
         \<forall>n. f(n) \<le> g(n) |]
huffman@20552
  1271
      ==> Bseq (g :: nat \<Rightarrow> real)"
paulson@14477
  1272
apply (subst Bseq_minus_iff [symmetric])
paulson@15234
  1273
apply (rule_tac g = "%x. - (f x)" in f_inc_g_dec_Beq_f)
paulson@14477
  1274
apply auto
paulson@14477
  1275
done
paulson@14477
  1276
paulson@14477
  1277
lemma f_inc_imp_le_lim: "[| \<forall>n. f n \<le> f (Suc n);  convergent f |] ==> f n \<le> lim f"
paulson@14477
  1278
apply (rule linorder_not_less [THEN iffD1])
paulson@14477
  1279
apply (auto simp add: convergent_LIMSEQ_iff LIMSEQ_iff monoseq_Suc)
paulson@14477
  1280
apply (drule real_less_sum_gt_zero)
paulson@14477
  1281
apply (drule_tac x = "f n + - lim f" in spec, safe)
paulson@14477
  1282
apply (drule_tac P = "%na. no\<le>na --> ?Q na" and x = "no + n" in spec, auto)
paulson@14477
  1283
apply (subgoal_tac "lim f \<le> f (no + n) ")
paulson@14477
  1284
apply (drule_tac no=no and m=n in lemma_f_mono_add)
paulson@14477
  1285
apply (auto simp add: add_commute)
webertj@20254
  1286
apply (induct_tac "no")
webertj@20254
  1287
apply simp
webertj@20254
  1288
apply (auto intro: order_trans simp add: diff_minus abs_if)
paulson@14477
  1289
done
paulson@14477
  1290
paulson@14477
  1291
lemma lim_uminus: "convergent g ==> lim (%x. - g x) = - (lim g)"
paulson@14477
  1292
apply (rule LIMSEQ_minus [THEN limI])
paulson@14477
  1293
apply (simp add: convergent_LIMSEQ_iff)
paulson@14477
  1294
done
paulson@14477
  1295
paulson@14477
  1296
lemma g_dec_imp_lim_le: "[| \<forall>n. g(Suc n) \<le> g(n);  convergent g |] ==> lim g \<le> g n"
paulson@14477
  1297
apply (subgoal_tac "- (g n) \<le> - (lim g) ")
paulson@15234
  1298
apply (cut_tac [2] f = "%x. - (g x)" in f_inc_imp_le_lim)
paulson@14477
  1299
apply (auto simp add: lim_uminus convergent_minus_iff [symmetric])
paulson@14477
  1300
done
paulson@14477
  1301
paulson@14477
  1302
lemma lemma_nest: "[| \<forall>n. f(n) \<le> f(Suc n);
paulson@14477
  1303
         \<forall>n. g(Suc n) \<le> g(n);
paulson@14477
  1304
         \<forall>n. f(n) \<le> g(n) |]
huffman@20552
  1305
      ==> \<exists>l m :: real. l \<le> m &  ((\<forall>n. f(n) \<le> l) & f ----> l) &
paulson@14477
  1306
                            ((\<forall>n. m \<le> g(n)) & g ----> m)"
paulson@14477
  1307
apply (subgoal_tac "monoseq f & monoseq g")
paulson@14477
  1308
prefer 2 apply (force simp add: LIMSEQ_iff monoseq_Suc)
paulson@14477
  1309
apply (subgoal_tac "Bseq f & Bseq g")
paulson@14477
  1310
prefer 2 apply (blast intro: f_inc_g_dec_Beq_f f_inc_g_dec_Beq_g)
paulson@14477
  1311
apply (auto dest!: Bseq_monoseq_convergent simp add: convergent_LIMSEQ_iff)
paulson@14477
  1312
apply (rule_tac x = "lim f" in exI)
paulson@14477
  1313
apply (rule_tac x = "lim g" in exI)
paulson@14477
  1314
apply (auto intro: LIMSEQ_le)
paulson@14477
  1315
apply (auto simp add: f_inc_imp_le_lim g_dec_imp_lim_le convergent_LIMSEQ_iff)
paulson@14477
  1316
done
paulson@14477
  1317
paulson@14477
  1318
lemma lemma_nest_unique: "[| \<forall>n. f(n) \<le> f(Suc n);
paulson@14477
  1319
         \<forall>n. g(Suc n) \<le> g(n);
paulson@14477
  1320
         \<forall>n. f(n) \<le> g(n);
paulson@14477
  1321
         (%n. f(n) - g(n)) ----> 0 |]
huffman@20552
  1322
      ==> \<exists>l::real. ((\<forall>n. f(n) \<le> l) & f ----> l) &
paulson@14477
  1323
                ((\<forall>n. l \<le> g(n)) & g ----> l)"
paulson@14477
  1324
apply (drule lemma_nest, auto)
paulson@14477
  1325
apply (subgoal_tac "l = m")
paulson@14477
  1326
apply (drule_tac [2] X = f in LIMSEQ_diff)
paulson@14477
  1327
apply (auto intro: LIMSEQ_unique)
paulson@14477
  1328
done
paulson@14477
  1329
paulson@14477
  1330
text{*The universal quantifiers below are required for the declaration
paulson@14477
  1331
  of @{text Bolzano_nest_unique} below.*}
paulson@14477
  1332
paulson@14477
  1333
lemma Bolzano_bisect_le:
paulson@14477
  1334
 "a \<le> b ==> \<forall>n. fst (Bolzano_bisect P a b n) \<le> snd (Bolzano_bisect P a b n)"
paulson@14477
  1335
apply (rule allI)
paulson@14477
  1336
apply (induct_tac "n")
paulson@14477
  1337
apply (auto simp add: Let_def split_def)
paulson@14477
  1338
done
paulson@14477
  1339
paulson@14477
  1340
lemma Bolzano_bisect_fst_le_Suc: "a \<le> b ==>
paulson@14477
  1341
   \<forall>n. fst(Bolzano_bisect P a b n) \<le> fst (Bolzano_bisect P a b (Suc n))"
paulson@14477
  1342
apply (rule allI)
paulson@14477
  1343
apply (induct_tac "n")
paulson@14477
  1344
apply (auto simp add: Bolzano_bisect_le Let_def split_def)
paulson@14477
  1345
done
paulson@14477
  1346
paulson@14477
  1347
lemma Bolzano_bisect_Suc_le_snd: "a \<le> b ==>
paulson@14477
  1348
   \<forall>n. snd(Bolzano_bisect P a b (Suc n)) \<le> snd (Bolzano_bisect P a b n)"
paulson@14477
  1349
apply (rule allI)
paulson@14477
  1350
apply (induct_tac "n")
nipkow@15539
  1351
apply (auto simp add: Bolzano_bisect_le Let_def split_def)
paulson@14477
  1352
done
paulson@14477
  1353
kleing@19023
  1354
lemma eq_divide_2_times_iff: "((x::real) = y / (2 * z)) = (2 * x = y/z)"
nipkow@15539
  1355
apply (auto)
paulson@14477
  1356
apply (drule_tac f = "%u. (1/2) *u" in arg_cong)
nipkow@15539
  1357
apply (simp)
paulson@14477
  1358
done
paulson@14477
  1359
paulson@14477
  1360
lemma Bolzano_bisect_diff:
paulson@14477
  1361
     "a \<le> b ==>
paulson@14477
  1362
      snd(Bolzano_bisect P a b n) - fst(Bolzano_bisect P a b n) =
paulson@14477
  1363
      (b-a) / (2 ^ n)"
paulson@15251
  1364
apply (induct "n")
paulson@14477
  1365
apply (auto simp add: eq_divide_2_times_iff add_divide_distrib Let_def split_def)
paulson@14477
  1366
done
paulson@14477
  1367
paulson@14477
  1368
lemmas Bolzano_nest_unique =
paulson@14477
  1369
    lemma_nest_unique
paulson@14477
  1370
    [OF Bolzano_bisect_fst_le_Suc Bolzano_bisect_Suc_le_snd Bolzano_bisect_le]
paulson@14477
  1371
paulson@14477
  1372
paulson@14477
  1373
lemma not_P_Bolzano_bisect:
paulson@14477
  1374
  assumes P:    "!!a b c. [| P(a,b); P(b,c); a \<le> b; b \<le> c|] ==> P(a,c)"
paulson@14477
  1375
      and notP: "~ P(a,b)"
paulson@14477
  1376
      and le:   "a \<le> b"
paulson@14477
  1377
  shows "~ P(fst(Bolzano_bisect P a b n), snd(Bolzano_bisect P a b n))"
paulson@14477
  1378
proof (induct n)
paulson@14477
  1379
  case 0 thus ?case by simp
paulson@14477
  1380
 next
paulson@14477
  1381
  case (Suc n)
paulson@14477
  1382
  thus ?case
paulson@15228
  1383
 by (auto simp del: surjective_pairing [symmetric]
paulson@15228
  1384
             simp add: Let_def split_def Bolzano_bisect_le [OF le]
paulson@15228
  1385
     P [of "fst (Bolzano_bisect P a b n)" _ "snd (Bolzano_bisect P a b n)"])
paulson@14477
  1386
qed
paulson@14477
  1387
paulson@14477
  1388
(*Now we re-package P_prem as a formula*)
paulson@14477
  1389
lemma not_P_Bolzano_bisect':
paulson@14477
  1390
     "[| \<forall>a b c. P(a,b) & P(b,c) & a \<le> b & b \<le> c --> P(a,c);
paulson@14477
  1391
         ~ P(a,b);  a \<le> b |] ==>
paulson@14477
  1392
      \<forall>n. ~ P(fst(Bolzano_bisect P a b n), snd(Bolzano_bisect P a b n))"
paulson@14477
  1393
by (blast elim!: not_P_Bolzano_bisect [THEN [2] rev_notE])
paulson@14477
  1394
paulson@14477
  1395
paulson@14477
  1396
paulson@14477
  1397
lemma lemma_BOLZANO:
paulson@14477
  1398
     "[| \<forall>a b c. P(a,b) & P(b,c) & a \<le> b & b \<le> c --> P(a,c);
paulson@14477
  1399
         \<forall>x. \<exists>d::real. 0 < d &
paulson@14477
  1400
                (\<forall>a b. a \<le> x & x \<le> b & (b-a) < d --> P(a,b));
paulson@14477
  1401
         a \<le> b |]
paulson@14477
  1402
      ==> P(a,b)"
paulson@14477
  1403
apply (rule Bolzano_nest_unique [where P1=P, THEN exE], assumption+)
paulson@14477
  1404
apply (rule LIMSEQ_minus_cancel)
paulson@14477
  1405
apply (simp (no_asm_simp) add: Bolzano_bisect_diff LIMSEQ_divide_realpow_zero)
paulson@14477
  1406
apply (rule ccontr)
paulson@14477
  1407
apply (drule not_P_Bolzano_bisect', assumption+)
paulson@14477
  1408
apply (rename_tac "l")
paulson@14477
  1409
apply (drule_tac x = l in spec, clarify)
paulson@14477
  1410
apply (simp add: LIMSEQ_def)
paulson@14477
  1411
apply (drule_tac P = "%r. 0<r --> ?Q r" and x = "d/2" in spec)
paulson@14477
  1412
apply (drule_tac P = "%r. 0<r --> ?Q r" and x = "d/2" in spec)
paulson@15228
  1413
apply (drule real_less_half_sum, auto)
paulson@14477
  1414
apply (drule_tac x = "fst (Bolzano_bisect P a b (no + noa))" in spec)
paulson@14477
  1415
apply (drule_tac x = "snd (Bolzano_bisect P a b (no + noa))" in spec)
paulson@14477
  1416
apply safe
paulson@14477
  1417
apply (simp_all (no_asm_simp))
paulson@15234
  1418
apply (rule_tac y = "abs (fst (Bolzano_bisect P a b (no + noa)) - l) + abs (snd (Bolzano_bisect P a b (no + noa)) - l)" in order_le_less_trans)
paulson@14477
  1419
apply (simp (no_asm_simp) add: abs_if)
paulson@14477
  1420
apply (rule real_sum_of_halves [THEN subst])
paulson@14477
  1421
apply (rule add_strict_mono)
paulson@14477
  1422
apply (simp_all add: diff_minus [symmetric])
paulson@14477
  1423
done
paulson@14477
  1424
paulson@14477
  1425
paulson@14477
  1426
lemma lemma_BOLZANO2: "((\<forall>a b c. (a \<le> b & b \<le> c & P(a,b) & P(b,c)) --> P(a,c)) &
paulson@14477
  1427
       (\<forall>x. \<exists>d::real. 0 < d &
paulson@14477
  1428
                (\<forall>a b. a \<le> x & x \<le> b & (b-a) < d --> P(a,b))))
paulson@14477
  1429
      --> (\<forall>a b. a \<le> b --> P(a,b))"
paulson@14477
  1430
apply clarify
paulson@14477
  1431
apply (blast intro: lemma_BOLZANO)
paulson@14477
  1432
done
paulson@14477
  1433
paulson@14477
  1434
paulson@14477
  1435
subsection{*Intermediate Value Theorem: Prove Contrapositive by Bisection*}
paulson@14477
  1436
huffman@20561
  1437
lemma IVT: "[| f(a::real) \<le> (y::real); y \<le> f(b);
paulson@14477
  1438
         a \<le> b;
paulson@14477
  1439
         (\<forall>x. a \<le> x & x \<le> b --> isCont f x) |]
paulson@14477
  1440
      ==> \<exists>x. a \<le> x & x \<le> b & f(x) = y"
paulson@14477
  1441
apply (rule contrapos_pp, assumption)
paulson@14477
  1442
apply (cut_tac P = "% (u,v) . a \<le> u & u \<le> v & v \<le> b --> ~ (f (u) \<le> y & y \<le> f (v))" in lemma_BOLZANO2)
paulson@14477
  1443
apply safe
paulson@14477
  1444
apply simp_all
paulson@14477
  1445
apply (simp add: isCont_iff LIM_def)
paulson@14477
  1446
apply (rule ccontr)
paulson@14477
  1447
apply (subgoal_tac "a \<le> x & x \<le> b")
paulson@14477
  1448
 prefer 2
paulson@15228
  1449
 apply simp
paulson@14477
  1450
 apply (drule_tac P = "%d. 0<d --> ?P d" and x = 1 in spec, arith)
paulson@14477
  1451
apply (drule_tac x = x in spec)+
paulson@14477
  1452
apply simp
nipkow@15360
  1453
apply (drule_tac P = "%r. ?P r --> (\<exists>s>0. ?Q r s) " and x = "\<bar>y - f x\<bar>" in spec)
paulson@14477
  1454
apply safe
paulson@14477
  1455
apply simp
paulson@14477
  1456
apply (drule_tac x = s in spec, clarify)
paulson@14477
  1457
apply (cut_tac x = "f x" and y = y in linorder_less_linear, safe)
paulson@14477
  1458
apply (drule_tac x = "ba-x" in spec)
paulson@14477
  1459
apply (simp_all add: abs_if)
paulson@14477
  1460
apply (drule_tac x = "aa-x" in spec)
paulson@14477
  1461
apply (case_tac "x \<le> aa", simp_all)
paulson@14477
  1462
done
paulson@14477
  1463
huffman@20561
  1464
lemma IVT2: "[| f(b::real) \<le> (y::real); y \<le> f(a);
paulson@14477
  1465
         a \<le> b;
paulson@14477
  1466
         (\<forall>x. a \<le> x & x \<le> b --> isCont f x)
paulson@14477
  1467
      |] ==> \<exists>x. a \<le> x & x \<le> b & f(x) = y"
paulson@15228
  1468
apply (subgoal_tac "- f a \<le> -y & -y \<le> - f b", clarify)
paulson@14477
  1469
apply (drule IVT [where f = "%x. - f x"], assumption)
paulson@14477
  1470
apply (auto intro: isCont_minus)
paulson@14477
  1471
done
paulson@14477
  1472
paulson@14477
  1473
(*HOL style here: object-level formulations*)
huffman@20561
  1474
lemma IVT_objl: "(f(a::real) \<le> (y::real) & y \<le> f(b) & a \<le> b &
paulson@14477
  1475
      (\<forall>x. a \<le> x & x \<le> b --> isCont f x))
paulson@14477
  1476
      --> (\<exists>x. a \<le> x & x \<le> b & f(x) = y)"
paulson@14477
  1477
apply (blast intro: IVT)
paulson@14477
  1478
done
paulson@14477
  1479
huffman@20561
  1480
lemma IVT2_objl: "(f(b::real) \<le> (y::real) & y \<le> f(a) & a \<le> b &
paulson@14477
  1481
      (\<forall>x. a \<le> x & x \<le> b --> isCont f x))
paulson@14477
  1482
      --> (\<exists>x. a \<le> x & x \<le> b & f(x) = y)"
paulson@14477
  1483
apply (blast intro: IVT2)
paulson@14477
  1484
done
paulson@14477
  1485
paulson@15234
  1486
subsection{*By bisection, function continuous on closed interval is bounded above*}
paulson@14477
  1487
paulson@14477
  1488
lemma isCont_bounded:
paulson@14477
  1489
     "[| a \<le> b; \<forall>x. a \<le> x & x \<le> b --> isCont f x |]
huffman@20561
  1490
      ==> \<exists>M::real. \<forall>x::real. a \<le> x & x \<le> b --> f(x) \<le> M"
paulson@15234
  1491
apply (cut_tac P = "% (u,v) . a \<le> u & u \<le> v & v \<le> b --> (\<exists>M. \<forall>x. u \<le> x & x \<le> v --> f x \<le> M)" in lemma_BOLZANO2)
paulson@14477
  1492
apply safe
paulson@14477
  1493
apply simp_all
paulson@14477
  1494
apply (rename_tac x xa ya M Ma)
paulson@14477
  1495
apply (cut_tac x = M and y = Ma in linorder_linear, safe)
paulson@14477
  1496
apply (rule_tac x = Ma in exI, clarify)
paulson@14477
  1497
apply (cut_tac x = xb and y = xa in linorder_linear, force)
paulson@14477
  1498
apply (rule_tac x = M in exI, clarify)
paulson@14477
  1499
apply (cut_tac x = xb and y = xa in linorder_linear, force)
paulson@14477
  1500
apply (case_tac "a \<le> x & x \<le> b")
paulson@14477
  1501
apply (rule_tac [2] x = 1 in exI)
paulson@14477
  1502
prefer 2 apply force
paulson@14477
  1503
apply (simp add: LIM_def isCont_iff)
paulson@14477
  1504
apply (drule_tac x = x in spec, auto)
paulson@14477
  1505
apply (erule_tac V = "\<forall>M. \<exists>x. a \<le> x & x \<le> b & ~ f x \<le> M" in thin_rl)
paulson@14477
  1506
apply (drule_tac x = 1 in spec, auto)
paulson@14477
  1507
apply (rule_tac x = s in exI, clarify)
paulson@14477
  1508
apply (rule_tac x = "\<bar>f x\<bar> + 1" in exI, clarify)
paulson@14477
  1509
apply (drule_tac x = "xa-x" in spec)
webertj@20217
  1510
apply (auto simp add: abs_ge_self)
paulson@14477
  1511
done
paulson@14477
  1512
paulson@15234
  1513
text{*Refine the above to existence of least upper bound*}
paulson@14477
  1514
paulson@14477
  1515
lemma lemma_reals_complete: "((\<exists>x. x \<in> S) & (\<exists>y. isUb UNIV S (y::real))) -->
paulson@14477
  1516
      (\<exists>t. isLub UNIV S t)"
paulson@15234
  1517
by (blast intro: reals_complete)
paulson@14477
  1518
paulson@14477
  1519
lemma isCont_has_Ub: "[| a \<le> b; \<forall>x. a \<le> x & x \<le> b --> isCont f x |]
huffman@20561
  1520
         ==> \<exists>M::real. (\<forall>x::real. a \<le> x & x \<le> b --> f(x) \<le> M) &
paulson@14477
  1521
                   (\<forall>N. N < M --> (\<exists>x. a \<le> x & x \<le> b & N < f(x)))"
kleing@19023
  1522
apply (cut_tac S = "Collect (%y. \<exists>x. a \<le> x & x \<le> b & y = f x)"
paulson@15234
  1523
        in lemma_reals_complete)
paulson@14477
  1524
apply auto
paulson@14477
  1525
apply (drule isCont_bounded, assumption)
paulson@14477
  1526
apply (auto simp add: isUb_def leastP_def isLub_def setge_def setle_def)
paulson@14477
  1527
apply (rule exI, auto)
paulson@15228
  1528
apply (auto dest!: spec simp add: linorder_not_less)
paulson@14477
  1529
done
paulson@14477
  1530
paulson@15234
  1531
text{*Now show that it attains its upper bound*}
paulson@14477
  1532
paulson@14477
  1533
lemma isCont_eq_Ub:
paulson@14477
  1534
  assumes le: "a \<le> b"
huffman@20561
  1535
      and con: "\<forall>x::real. a \<le> x & x \<le> b --> isCont f x"
huffman@20552
  1536
  shows "\<exists>M::real. (\<forall>x. a \<le> x & x \<le> b --> f(x) \<le> M) &
paulson@14477
  1537
             (\<exists>x. a \<le> x & x \<le> b & f(x) = M)"
paulson@14477
  1538
proof -
paulson@14477
  1539
  from isCont_has_Ub [OF le con]
paulson@14477
  1540
  obtain M where M1: "\<forall>x. a \<le> x \<and> x \<le> b \<longrightarrow> f x \<le> M"
paulson@14477
  1541
             and M2: "!!N. N<M ==> \<exists>x. a \<le> x \<and> x \<le> b \<and> N < f x"  by blast
paulson@14477
  1542
  show ?thesis
paulson@14477
  1543
  proof (intro exI, intro conjI)
paulson@14477
  1544
    show " \<forall>x. a \<le> x \<and> x \<le> b \<longrightarrow> f x \<le> M" by (rule M1)
paulson@15228
  1545
    show "\<exists>x. a \<le> x \<and> x \<le> b \<and> f x = M"
paulson@14477
  1546
    proof (rule ccontr)
paulson@14477
  1547
      assume "\<not> (\<exists>x. a \<le> x \<and> x \<le> b \<and> f x = M)"
paulson@14477
  1548
      with M1 have M3: "\<forall>x. a \<le> x & x \<le> b --> f x < M"
nipkow@15195
  1549
        by (fastsimp simp add: linorder_not_le [symmetric])
paulson@14477
  1550
      hence "\<forall>x. a \<le> x & x \<le> b --> isCont (%x. inverse (M - f x)) x"
paulson@14477
  1551
        by (auto simp add: isCont_inverse isCont_diff con)
paulson@14477
  1552
      from isCont_bounded [OF le this]
paulson@14477
  1553
      obtain k where k: "!!x. a \<le> x & x \<le> b --> inverse (M - f x) \<le> k" by auto
paulson@14477
  1554
      have Minv: "!!x. a \<le> x & x \<le> b --> 0 < inverse (M - f (x))"
paulson@15228
  1555
        by (simp add: M3 compare_rls)
paulson@15228
  1556
      have "!!x. a \<le> x & x \<le> b --> inverse (M - f x) < k+1" using k
paulson@15228
  1557
        by (auto intro: order_le_less_trans [of _ k])
paulson@15228
  1558
      with Minv
paulson@15228
  1559
      have "!!x. a \<le> x & x \<le> b --> inverse(k+1) < inverse(inverse(M - f x))"
paulson@14477
  1560
        by (intro strip less_imp_inverse_less, simp_all)
paulson@15228
  1561
      hence invlt: "!!x. a \<le> x & x \<le> b --> inverse(k+1) < M - f x"
paulson@14477
  1562
        by simp
paulson@15228
  1563
      have "M - inverse (k+1) < M" using k [of a] Minv [of a] le
paulson@14477
  1564
        by (simp, arith)
paulson@14477
  1565
      from M2 [OF this]
paulson@14477
  1566
      obtain x where ax: "a \<le> x & x \<le> b & M - inverse(k+1) < f x" ..
paulson@14477
  1567
      thus False using invlt [of x] by force
paulson@14477
  1568
    qed
paulson@14477
  1569
  qed
paulson@14477
  1570
qed
paulson@14477
  1571
paulson@14477
  1572
paulson@15234
  1573
text{*Same theorem for lower bound*}
paulson@14477
  1574
paulson@14477
  1575
lemma isCont_eq_Lb: "[| a \<le> b; \<forall>x. a \<le> x & x \<le> b --> isCont f x |]
huffman@20561
  1576
         ==> \<exists>M::real. (\<forall>x::real. a \<le> x & x \<le> b --> M \<le> f(x)) &
paulson@14477
  1577
                   (\<exists>x. a \<le> x & x \<le> b & f(x) = M)"
paulson@14477
  1578
apply (subgoal_tac "\<forall>x. a \<le> x & x \<le> b --> isCont (%x. - (f x)) x")
paulson@14477
  1579
prefer 2 apply (blast intro: isCont_minus)
paulson@15234
  1580
apply (drule_tac f = "(%x. - (f x))" in isCont_eq_Ub)
paulson@14477
  1581
apply safe
paulson@14477
  1582
apply auto
paulson@14477
  1583
done
paulson@14477
  1584
paulson@14477
  1585
paulson@15234
  1586
text{*Another version.*}
paulson@14477
  1587
paulson@14477
  1588
lemma isCont_Lb_Ub: "[|a \<le> b; \<forall>x. a \<le> x & x \<le> b --> isCont f x |]
huffman@20561
  1589
      ==> \<exists>L M::real. (\<forall>x::real. a \<le> x & x \<le> b --> L \<le> f(x) & f(x) \<le> M) &
paulson@14477
  1590
          (\<forall>y. L \<le> y & y \<le> M --> (\<exists>x. a \<le> x & x \<le> b & (f(x) = y)))"
paulson@14477
  1591
apply (frule isCont_eq_Lb)
paulson@14477
  1592
apply (frule_tac [2] isCont_eq_Ub)
paulson@14477
  1593
apply (assumption+, safe)
paulson@14477
  1594
apply (rule_tac x = "f x" in exI)
paulson@14477
  1595
apply (rule_tac x = "f xa" in exI, simp, safe)
paulson@14477
  1596
apply (cut_tac x = x and y = xa in linorder_linear, safe)
paulson@14477
  1597
apply (cut_tac f = f and a = x and b = xa and y = y in IVT_objl)
paulson@14477
  1598
apply (cut_tac [2] f = f and a = xa and b = x and y = y in IVT2_objl, safe)
paulson@14477
  1599
apply (rule_tac [2] x = xb in exI)
paulson@14477
  1600
apply (rule_tac [4] x = xb in exI, simp_all)
paulson@14477
  1601
done
paulson@14477
  1602
paulson@15003
  1603
paulson@15003
  1604
subsection{*If @{term "0 < f'(x)"} then @{term x} is Locally Strictly Increasing At The Right*}
paulson@14477
  1605
paulson@14477
  1606
lemma DERIV_left_inc:
paulson@15003
  1607
  assumes der: "DERIV f x :> l"
paulson@15003
  1608
      and l:   "0 < l"
nipkow@15360
  1609
  shows "\<exists>d > 0. \<forall>h > 0. h < d --> f(x) < f(x + h)"
paulson@15003
  1610
proof -
paulson@15003
  1611
  from l der [THEN DERIV_D, THEN LIM_D [where r = "l"]]
nipkow@15360
  1612
  have "\<exists>s > 0. (\<forall>z. z \<noteq> 0 \<and> \<bar>z\<bar> < s \<longrightarrow> \<bar>(f(x+z) - f x) / z - l\<bar> < l)"
paulson@15003
  1613
    by (simp add: diff_minus)
paulson@15003
  1614
  then obtain s
paulson@15228
  1615
        where s:   "0 < s"
paulson@15003
  1616
          and all: "!!z. z \<noteq> 0 \<and> \<bar>z\<bar> < s \<longrightarrow> \<bar>(f(x+z) - f x) / z - l\<bar> < l"
paulson@15003
  1617
    by auto
paulson@15003
  1618
  thus ?thesis
paulson@15003
  1619
  proof (intro exI conjI strip)
paulson@15003
  1620
    show "0<s" .
paulson@15003
  1621
    fix h::real
nipkow@15360
  1622
    assume "0 < h" "h < s"
paulson@15228
  1623
    with all [of h] show "f x < f (x+h)"
paulson@15228
  1624
    proof (simp add: abs_if pos_less_divide_eq diff_minus [symmetric]
kleing@19023
  1625
    split add: split_if_asm)
paulson@15228
  1626
      assume "~ (f (x+h) - f x) / h < l" and h: "0 < h"
paulson@15228
  1627
      with l
paulson@15003
  1628
      have "0 < (f (x+h) - f x) / h" by arith
paulson@15003
  1629
      thus "f x < f (x+h)"
kleing@19023
  1630
  by (simp add: pos_less_divide_eq h)
paulson@15003
  1631
    qed
paulson@15003
  1632
  qed
paulson@15003
  1633
qed
paulson@14477
  1634
paulson@14477
  1635
lemma DERIV_left_dec:
paulson@14477
  1636
  assumes der: "DERIV f x :> l"
paulson@14477
  1637
      and l:   "l < 0"
nipkow@15360
  1638
  shows "\<exists>d > 0. \<forall>h > 0. h < d --> f(x) < f(x-h)"
paulson@14477
  1639
proof -
paulson@14477
  1640
  from l der [THEN DERIV_D, THEN LIM_D [where r = "-l"]]
nipkow@15360
  1641
  have "\<exists>s > 0. (\<forall>z. z \<noteq> 0 \<and> \<bar>z\<bar> < s \<longrightarrow> \<bar>(f(x+z) - f x) / z - l\<bar> < -l)"
paulson@14477
  1642
    by (simp add: diff_minus)
paulson@14477
  1643
  then obtain s
paulson@15228
  1644
        where s:   "0 < s"
paulson@14477
  1645
          and all: "!!z. z \<noteq> 0 \<and> \<bar>z\<bar> < s \<longrightarrow> \<bar>(f(x+z) - f x) / z - l\<bar> < -l"
paulson@14477
  1646
    by auto
paulson@14477
  1647
  thus ?thesis
paulson@14477
  1648
  proof (intro exI conjI strip)
paulson@14477
  1649
    show "0<s" .
paulson@14477
  1650
    fix h::real
nipkow@15360
  1651
    assume "0 < h" "h < s"
paulson@15228
  1652
    with all [of "-h"] show "f x < f (x-h)"
paulson@15228
  1653
    proof (simp add: abs_if pos_less_divide_eq diff_minus [symmetric]
kleing@19023
  1654
    split add: split_if_asm)
paulson@15228
  1655
      assume " - ((f (x-h) - f x) / h) < l" and h: "0 < h"
paulson@15228
  1656
      with l
paulson@14477
  1657
      have "0 < (f (x-h) - f x) / h" by arith
paulson@14477
  1658
      thus "f x < f (x-h)"
kleing@19023
  1659
  by (simp add: pos_less_divide_eq h)
paulson@14477
  1660
    qed
paulson@14477
  1661
  qed
paulson@14477
  1662
qed
paulson@14477
  1663
paulson@15228
  1664
lemma DERIV_local_max:
paulson@14477
  1665
  assumes der: "DERIV f x :> l"
paulson@14477
  1666
      and d:   "0 < d"
paulson@14477
  1667
      and le:  "\<forall>y. \<bar>x-y\<bar> < d --> f(y) \<le> f(x)"
paulson@14477
  1668
  shows "l = 0"
paulson@14477
  1669
proof (cases rule: linorder_cases [of l 0])
paulson@14477
  1670
  case equal show ?thesis .
paulson@14477
  1671
next
paulson@14477
  1672
  case less
paulson@14477
  1673
  from DERIV_left_dec [OF der less]
paulson@14477
  1674
  obtain d' where d': "0 < d'"
nipkow@15360
  1675
             and lt: "\<forall>h > 0. h < d' \<longrightarrow> f x < f (x-h)" by blast
paulson@14477
  1676
  from real_lbound_gt_zero [OF d d']
paulson@14477
  1677
  obtain e where "0 < e \<and> e < d \<and> e < d'" ..
paulson@15228
  1678
  with lt le [THEN spec [where x="x-e"]]
paulson@14477
  1679
  show ?thesis by (auto simp add: abs_if)
paulson@14477
  1680
next
paulson@14477
  1681
  case greater
paulson@14477
  1682
  from DERIV_left_inc [OF der greater]
paulson@14477
  1683
  obtain d' where d': "0 < d'"
nipkow@15360
  1684
             and lt: "\<forall>h > 0. h < d' \<longrightarrow> f x < f (x + h)" by blast
paulson@14477
  1685
  from real_lbound_gt_zero [OF d d']
paulson@14477
  1686
  obtain e where "0 < e \<and> e < d \<and> e < d'" ..
paulson@14477
  1687
  with lt le [THEN spec [where x="x+e"]]
paulson@14477
  1688
  show ?thesis by (auto simp add: abs_if)
paulson@14477
  1689
qed
paulson@14477
  1690
paulson@14477
  1691
paulson@14477
  1692
text{*Similar theorem for a local minimum*}
paulson@14477
  1693
lemma DERIV_local_min:
paulson@14477
  1694
     "[| DERIV f x :> l; 0 < d; \<forall>y. \<bar>x-y\<bar> < d --> f(x) \<le> f(y) |] ==> l = 0"
paulson@14477
  1695
by (drule DERIV_minus [THEN DERIV_local_max], auto)
paulson@14477
  1696
paulson@14477
  1697
paulson@14477
  1698
text{*In particular, if a function is locally flat*}
paulson@14477
  1699
lemma DERIV_local_const:
paulson@14477
  1700
     "[| DERIV f x :> l; 0 < d; \<forall>y. \<bar>x-y\<bar> < d --> f(x) = f(y) |] ==> l = 0"
paulson@14477
  1701
by (auto dest!: DERIV_local_max)
paulson@14477
  1702
paulson@14477
  1703
text{*Lemma about introducing open ball in open interval*}
paulson@14477
  1704
lemma lemma_interval_lt:
paulson@15228
  1705
     "[| a < x;  x < b |]
paulson@14477
  1706
      ==> \<exists>d::real. 0 < d & (\<forall>y. \<bar>x-y\<bar> < d --> a < y & y < b)"
paulson@14477
  1707
apply (simp add: abs_interval_iff)
paulson@14477
  1708
apply (insert linorder_linear [of "x-a" "b-x"], safe)
paulson@14477
  1709
apply (rule_tac x = "x-a" in exI)
paulson@14477
  1710
apply (rule_tac [2] x = "b-x" in exI, auto)
paulson@14477
  1711
done
paulson@14477
  1712
paulson@14477
  1713
lemma lemma_interval: "[| a < x;  x < b |] ==>
paulson@14477
  1714
        \<exists>d::real. 0 < d &  (\<forall>y. \<bar>x-y\<bar> < d --> a \<le> y & y \<le> b)"
paulson@14477
  1715
apply (drule lemma_interval_lt, auto)
paulson@14477
  1716
apply (auto intro!: exI)
paulson@14477
  1717
done
paulson@14477
  1718
paulson@14477
  1719
text{*Rolle's Theorem.
paulson@15228
  1720
   If @{term f} is defined and continuous on the closed interval
paulson@15228
  1721
   @{text "[a,b]"} and differentiable on the open interval @{text "(a,b)"},
paulson@14477
  1722
   and @{term "f(a) = f(b)"},
paulson@14477
  1723
   then there exists @{text "x0 \<in> (a,b)"} such that @{term "f'(x0) = 0"}*}
paulson@15228
  1724
theorem Rolle:
paulson@14477
  1725
  assumes lt: "a < b"
paulson@14477
  1726
      and eq: "f(a) = f(b)"
paulson@14477
  1727
      and con: "\<forall>x. a \<le> x & x \<le> b --> isCont f x"
paulson@14477
  1728
      and dif [rule_format]: "\<forall>x. a < x & x < b --> f differentiable x"
paulson@14477
  1729
  shows "\<exists>z. a < z & z < b & DERIV f z :> 0"
paulson@14477
  1730
proof -
paulson@14477
  1731
  have le: "a \<le> b" using lt by simp
paulson@14477
  1732
  from isCont_eq_Ub [OF le con]
paulson@15228
  1733
  obtain x where x_max: "\<forall>z. a \<le> z \<and> z \<le> b \<longrightarrow> f z \<le> f x"
paulson@15228
  1734
             and alex: "a \<le> x" and xleb: "x \<le> b"
paulson@14477
  1735
    by blast
paulson@14477
  1736
  from isCont_eq_Lb [OF le con]
paulson@15228
  1737
  obtain x' where x'_min: "\<forall>z. a \<le> z \<and> z \<le> b \<longrightarrow> f x' \<le> f z"
paulson@15228
  1738
              and alex': "a \<le> x'" and x'leb: "x' \<le> b"
paulson@14477
  1739
    by blast
paulson@14477
  1740
  show ?thesis
paulson@14477
  1741
  proof cases
paulson@14477
  1742
    assume axb: "a < x & x < b"
paulson@14477
  1743
        --{*@{term f} attains its maximum within the interval*}
paulson@14477
  1744
    hence ax: "a<x" and xb: "x<b" by auto
paulson@14477
  1745
    from lemma_interval [OF ax xb]
paulson@14477
  1746
    obtain d where d: "0<d" and bound: "\<forall>y. \<bar>x-y\<bar> < d \<longrightarrow> a \<le> y \<and> y \<le> b"
paulson@14477
  1747
      by blast
paulson@14477
  1748
    hence bound': "\<forall>y. \<bar>x-y\<bar> < d \<longrightarrow> f y \<le> f x" using x_max
paulson@14477
  1749
      by blast
paulson@14477
  1750
    from differentiableD [OF dif [OF axb]]
paulson@14477
  1751
    obtain l where der: "DERIV f x :> l" ..
paulson@15228
  1752
    have "l=0" by (rule DERIV_local_max [OF der d bound'])
paulson@14477
  1753
        --{*the derivative at a local maximum is zero*}
paulson@14477
  1754
    thus ?thesis using ax xb der by auto
paulson@14477
  1755
  next
paulson@14477
  1756
    assume notaxb: "~ (a < x & x < b)"
paulson@14477
  1757
    hence xeqab: "x=a | x=b" using alex xleb by arith
paulson@15228
  1758
    hence fb_eq_fx: "f b = f x" by (auto simp add: eq)
paulson@14477
  1759
    show ?thesis
paulson@14477
  1760
    proof cases
paulson@14477
  1761
      assume ax'b: "a < x' & x' < b"
paulson@14477
  1762
        --{*@{term f} attains its minimum within the interval*}
paulson@14477
  1763
      hence ax': "a<x'" and x'b: "x'<b" by auto
paulson@14477
  1764
      from lemma_interval [OF ax' x'b]
paulson@14477
  1765
      obtain d where d: "0<d" and bound: "\<forall>y. \<bar>x'-y\<bar> < d \<longrightarrow> a \<le> y \<and> y \<le> b"
kleing@19023
  1766
  by blast
paulson@14477
  1767
      hence bound': "\<forall>y. \<bar>x'-y\<bar> < d \<longrightarrow> f x' \<le> f y" using x'_min
kleing@19023
  1768
  by blast
paulson@14477
  1769
      from differentiableD [OF dif [OF ax'b]]
paulson@14477
  1770
      obtain l where der: "DERIV f x' :> l" ..
paulson@15228
  1771
      have "l=0" by (rule DERIV_local_min [OF der d bound'])
paulson@14477
  1772
        --{*the derivative at a local minimum is zero*}
paulson@14477
  1773
      thus ?thesis using ax' x'b der by auto
paulson@14477
  1774
    next
paulson@14477
  1775
      assume notax'b: "~ (a < x' & x' < b)"
paulson@14477
  1776
        --{*@{term f} is constant througout the interval*}
paulson@14477
  1777
      hence x'eqab: "x'=a | x'=b" using alex' x'leb by arith
paulson@15228
  1778
      hence fb_eq_fx': "f b = f x'" by (auto simp add: eq)
paulson@14477
  1779
      from dense [OF lt]
paulson@14477
  1780
      obtain r where ar: "a < r" and rb: "r < b" by blast
paulson@14477
  1781
      from lemma_interval [OF ar rb]
paulson@14477
  1782
      obtain d where d: "0<d" and bound: "\<forall>y. \<bar>r-y\<bar> < d \<longrightarrow> a \<le> y \<and> y \<le> b"
kleing@19023
  1783
  by blast
paulson@15228
  1784
      have eq_fb: "\<forall>z. a \<le> z --> z \<le> b --> f z = f b"
paulson@15228
  1785
      proof (clarify)
paulson@14477
  1786
        fix z::real
paulson@14477
  1787
        assume az: "a \<le> z" and zb: "z \<le> b"
paulson@14477
  1788
        show "f z = f b"
paulson@14477
  1789
        proof (rule order_antisym)
nipkow@15195
  1790
          show "f z \<le> f b" by (simp add: fb_eq_fx x_max az zb)
nipkow@15195
  1791
          show "f b \<le> f z" by (simp add: fb_eq_fx' x'_min az zb)
paulson@14477
  1792
        qed
paulson@14477
  1793
      qed
paulson@14477
  1794
      have bound': "\<forall>y. \<bar>r-y\<bar> < d \<longrightarrow> f r = f y"
paulson@14477
  1795
      proof (intro strip)
paulson@14477
  1796
        fix y::real
paulson@14477
  1797
        assume lt: "\<bar>r-y\<bar> < d"
paulson@15228
  1798
        hence "f y = f b" by (simp add: eq_fb bound)
paulson@14477
  1799
        thus "f r = f y" by (simp add: eq_fb ar rb order_less_imp_le)
paulson@14477
  1800
      qed
paulson@14477
  1801
      from differentiableD [OF dif [OF conjI [OF ar rb]]]
paulson@14477
  1802
      obtain l where der: "DERIV f r :> l" ..
paulson@15228
  1803
      have "l=0" by (rule DERIV_local_const [OF der d bound'])
paulson@14477
  1804
        --{*the derivative of a constant function is zero*}
paulson@14477
  1805
      thus ?thesis using ar rb der by auto
paulson@14477
  1806
    qed
paulson@14477
  1807
  qed
paulson@14477
  1808
qed
paulson@14477
  1809
paulson@14477
  1810
paulson@14477
  1811
subsection{*Mean Value Theorem*}
paulson@14477
  1812
paulson@14477
  1813
lemma lemma_MVT:
paulson@14477
  1814
     "f a - (f b - f a)/(b-a) * a = f b - (f b - f a)/(b-a) * (b::real)"
paulson@14477
  1815
proof cases
paulson@14477
  1816
  assume "a=b" thus ?thesis by simp
paulson@14477
  1817
next
paulson@15228
  1818
  assume "a\<noteq>b"
paulson@14477
  1819
  hence ba: "b-a \<noteq> 0" by arith
paulson@14477
  1820
  show ?thesis
paulson@14477
  1821
    by (rule real_mult_left_cancel [OF ba, THEN iffD1],
kleing@19023
  1822
        simp add: right_diff_distrib,
paulson@15234
  1823
        simp add: left_diff_distrib)
paulson@14477
  1824
qed
paulson@14477
  1825
paulson@15228
  1826
theorem MVT:
paulson@14477
  1827
  assumes lt:  "a < b"
paulson@14477
  1828
      and con: "\<forall>x. a \<le> x & x \<le> b --> isCont f x"
paulson@14477
  1829
      and dif [rule_format]: "\<forall>x. a < x & x < b --> f differentiable x"
paulson@14477
  1830
  shows "\<exists>l z. a < z & z < b & DERIV f z :> l &
paulson@14477
  1831
                   (f(b) - f(a) = (b-a) * l)"
paulson@14477
  1832
proof -
paulson@14477
  1833
  let ?F = "%x. f x - ((f b - f a) / (b-a)) * x"
paulson@14477
  1834
  have contF: "\<forall>x. a \<le> x \<and> x \<le> b \<longrightarrow> isCont ?F x" using con
paulson@15228
  1835
    by (fast intro: isCont_diff isCont_const isCont_mult isCont_Id)
paulson@14477
  1836
  have difF: "\<forall>x. a < x \<and> x < b \<longrightarrow> ?F differentiable x"
paulson@14477
  1837
  proof (clarify)
paulson@14477
  1838
    fix x::real
paulson@14477
  1839
    assume ax: "a < x" and xb: "x < b"
paulson@14477
  1840
    from differentiableD [OF dif [OF conjI [OF ax xb]]]
paulson@14477
  1841
    obtain l where der: "DERIV f x :> l" ..
paulson@14477
  1842
    show "?F differentiable x"
paulson@14477
  1843
      by (rule differentiableI [where D = "l - (f b - f a)/(b-a)"],
paulson@15228
  1844
          blast intro: DERIV_diff DERIV_cmult_Id der)
paulson@15228
  1845
  qed
paulson@14477
  1846
  from Rolle [where f = ?F, OF lt lemma_MVT contF difF]
paulson@15228
  1847
  obtain z where az: "a < z" and zb: "z < b" and der: "DERIV ?F z :> 0"
paulson@14477
  1848
    by blast
paulson@14477
  1849
  have "DERIV (%x. ((f b - f a)/(b-a)) * x) z :> (f b - f a)/(b-a)"
paulson@14477
  1850
    by (rule DERIV_cmult_Id)
paulson@15228
  1851
  hence derF: "DERIV (\<lambda>x. ?F x + (f b - f a) / (b - a) * x) z
paulson@14477
  1852
                   :> 0 + (f b - f a) / (b - a)"
paulson@14477
  1853
    by (rule DERIV_add [OF der])
paulson@15228
  1854
  show ?thesis
paulson@14477
  1855
  proof (intro exI conjI)
paulson@14477
  1856
    show "a < z" .
paulson@14477
  1857
    show "z < b" .
nipkow@15539
  1858
    show "f b - f a = (b - a) * ((f b - f a)/(b-a))" by (simp)
paulson@14477
  1859
    show "DERIV f z :> ((f b - f a)/(b-a))"  using derF by simp
paulson@14477
  1860
  qed
paulson@14477
  1861
qed
paulson@14477
  1862
paulson@14477
  1863
paulson@14477
  1864
text{*A function is constant if its derivative is 0 over an interval.*}
paulson@14477
  1865
paulson@14477
  1866
lemma DERIV_isconst_end: "[| a < b;
paulson@14477
  1867
         \<forall>x. a \<le> x & x \<le> b --> isCont f x;
paulson@14477
  1868
         \<forall>x. a < x & x < b --> DERIV f x :> 0 |]
nipkow@15360
  1869
        ==> f b = f a"
paulson@14477
  1870
apply (drule MVT, assumption)
paulson@14477
  1871
apply (blast intro: differentiableI)
paulson@14477
  1872
apply (auto dest!: DERIV_unique simp add: diff_eq_eq)
paulson@14477
  1873
done
paulson@14477
  1874
paulson@14477
  1875
lemma DERIV_isconst1: "[| a < b;
paulson@14477
  1876
         \<forall>x. a \<le> x & x \<le> b --> isCont f x;
paulson@14477
  1877
         \<forall>x. a < x & x < b --> DERIV f x :> 0 |]
paulson@14477
  1878
        ==> \<forall>x. a \<le> x & x \<le> b --> f x = f a"
paulson@14477
  1879
apply safe
paulson@14477
  1880
apply (drule_tac x = a in order_le_imp_less_or_eq, safe)
paulson@14477
  1881
apply (drule_tac b = x in DERIV_isconst_end, auto)
paulson@14477
  1882
done
paulson@14477
  1883
paulson@14477
  1884
lemma DERIV_isconst2: "[| a < b;
paulson@14477
  1885
         \<forall>x. a \<le> x & x \<le> b --> isCont f x;
paulson@14477
  1886
         \<forall>x. a < x & x < b --> DERIV f x :> 0;
paulson@14477
  1887
         a \<le> x; x \<le> b |]
paulson@14477
  1888
        ==> f x = f a"
paulson@14477
  1889
apply (blast dest: DERIV_isconst1)
paulson@14477
  1890
done
paulson@14477
  1891
paulson@14477
  1892
lemma DERIV_isconst_all: "\<forall>x. DERIV f x :> 0 ==> f(x) = f(y)"
paulson@14477
  1893
apply (rule linorder_cases [of x y])
paulson@14477
  1894
apply (blast intro: sym DERIV_isCont DERIV_isconst_end)+
paulson@14477
  1895
done
paulson@14477
  1896
paulson@14477
  1897
lemma DERIV_const_ratio_const:
paulson@14477
  1898
     "[|a \<noteq> b; \<forall>x. DERIV f x :> k |] ==> (f(b) - f(a)) = (b-a) * k"
paulson@14477
  1899
apply (rule linorder_cases [of a b], auto)
paulson@14477
  1900
apply (drule_tac [!] f = f in MVT)
paulson@14477
  1901
apply (auto dest: DERIV_isCont DERIV_unique simp add: differentiable_def)
paulson@14477
  1902
apply (auto dest: DERIV_unique simp add: left_distrib diff_minus)
paulson@14477
  1903
done
paulson@14477
  1904
paulson@14477
  1905
lemma DERIV_const_ratio_const2:
paulson@14477
  1906
     "[|a \<noteq> b; \<forall>x. DERIV f x :> k |] ==> (f(b) - f(a))/(b-a) = k"
paulson@14477
  1907
apply (rule_tac c1 = "b-a" in real_mult_right_cancel [THEN iffD1])
nipkow@15539
  1908
apply (auto dest!: DERIV_const_ratio_const simp add: mult_assoc)
paulson@14477
  1909
done
paulson@14477
  1910
paulson@15228
  1911
lemma real_average_minus_first [simp]: "((a + b) /2 - a) = (b-a)/(2::real)"
kleing@19023
  1912
by (simp)
paulson@14477
  1913
paulson@15228
  1914
lemma real_average_minus_second [simp]: "((b + a)/2 - a) = (b-a)/(2::real)"
kleing@19023
  1915
by (simp)
paulson@14477
  1916
paulson@14477
  1917
text{*Gallileo's "trick": average velocity = av. of end velocities*}
paulson@14477
  1918
paulson@14477
  1919
lemma DERIV_const_average:
paulson@14477
  1920
  assumes neq: "a \<noteq> (b::real)"
paulson@14477
  1921
      and der: "\<forall>x. DERIV v x :> k"
paulson@14477
  1922
  shows "v ((a + b)/2) = (v a + v b)/2"
paulson@14477
  1923
proof (cases rule: linorder_cases [of a b])
paulson@14477
  1924
  case equal with neq show ?thesis by simp
paulson@14477
  1925
next
paulson@14477
  1926
  case less
paulson@14477
  1927
  have "(v b - v a) / (b - a) = k"
paulson@14477
  1928
    by (rule DERIV_const_ratio_const2 [OF neq der])
paulson@15228
  1929
  hence "(b-a) * ((v b - v a) / (b-a)) = (b-a) * k" by simp
paulson@14477
  1930
  moreover have "(v ((a + b) / 2) - v a) / ((a + b) / 2 - a) = k"
paulson@14477
  1931
    by (rule DERIV_const_ratio_const2 [OF _ der], simp add: neq)
paulson@14477
  1932
  ultimately show ?thesis using neq by force
paulson@14477
  1933
next
paulson@14477
  1934
  case greater
paulson@14477
  1935
  have "(v b - v a) / (b - a) = k"
paulson@14477
  1936
    by (rule DERIV_const_ratio_const2 [OF neq der])
paulson@15228
  1937
  hence "(b-a) * ((v b - v a) / (b-a)) = (b-a) * k" by simp
paulson@14477
  1938
  moreover have " (v ((b + a) / 2) - v a) / ((b + a) / 2 - a) = k"
paulson@14477
  1939
    by (rule DERIV_const_ratio_const2 [OF _ der], simp add: neq)
paulson@15228
  1940
  ultimately show ?thesis using neq by (force simp add: add_commute)
paulson@14477
  1941
qed
paulson@14477
  1942
paulson@14477
  1943
paulson@14477
  1944
text{*Dull lemma: an continuous injection on an interval must have a
paulson@14477
  1945
strict maximum at an end point, not in the middle.*}
paulson@14477
  1946
paulson@14477
  1947
lemma lemma_isCont_inj:
huffman@20552
  1948
  fixes f :: "real \<Rightarrow> real"
paulson@14477
  1949
  assumes d: "0 < d"
paulson@14477
  1950
      and inj [rule_format]: "\<forall>z. \<bar>z-x\<bar> \<le> d --> g(f z) = z"
paulson@14477
  1951
      and cont: "\<forall>z. \<bar>z-x\<bar> \<le> d --> isCont f z"
paulson@14477
  1952
  shows "\<exists>z. \<bar>z-x\<bar> \<le> d & f x < f z"
paulson@14477
  1953
proof (rule ccontr)
paulson@14477
  1954
  assume  "~ (\<exists>z. \<bar>z-x\<bar> \<le> d & f x < f z)"
paulson@15228
  1955
  hence all [rule_format]: "\<forall>z. \<bar>z - x\<bar> \<le> d --> f z \<le> f x" by auto
paulson@14477
  1956
  show False
paulson@14477
  1957
  proof (cases rule: linorder_le_cases [of "f(x-d)" "f(x+d)"])
paulson@14477
  1958
    case le
paulson@14477
  1959
    from d cont all [of "x+d"]
paulson@15228
  1960
    have flef: "f(x+d) \<le> f x"
paulson@15228
  1961
     and xlex: "x - d \<le> x"
paulson@15228
  1962
     and cont': "\<forall>z. x - d \<le> z \<and> z \<le> x \<longrightarrow> isCont f z"
paulson@14477
  1963
       by (auto simp add: abs_if)
paulson@14477
  1964
    from IVT [OF le flef xlex cont']
paulson@14477
  1965
    obtain x' where "x-d \<le> x'" "x' \<le> x" "f x' = f(x+d)" by blast
paulson@14477
  1966
    moreover
paulson@14477
  1967
    hence "g(f x') = g (f(x+d))" by simp
paulson@14477
  1968
    ultimately show False using d inj [of x'] inj [of "x+d"]
paulson@14477
  1969
      by (simp add: abs_le_interval_iff)
paulson@14477
  1970
  next
paulson@14477
  1971
    case ge
paulson@14477
  1972
    from d cont all [of "x-d"]
paulson@15228
  1973
    have flef: "f(x-d) \<le> f x"
paulson@15228
  1974
     and xlex: "x \<le> x+d"
paulson@15228
  1975
     and cont': "\<forall>z. x \<le> z \<and> z \<le> x+d \<longrightarrow> isCont f z"
paulson@14477
  1976
       by (auto simp add: abs_if)
paulson@14477
  1977
    from IVT2 [OF ge flef xlex cont']
paulson@14477
  1978
    obtain x' where "x \<le> x'" "x' \<le> x+d" "f x' = f(x-d)" by blast
paulson@14477
  1979
    moreover
paulson@14477
  1980
    hence "g(f x') = g (f(x-d))" by simp
paulson@14477
  1981
    ultimately show False using d inj [of x'] inj [of "x-d"]
paulson@14477
  1982
      by (simp add: abs_le_interval_iff)
paulson@14477
  1983
  qed
paulson@14477
  1984
qed
paulson@14477
  1985
paulson@14477
  1986
paulson@14477
  1987
text{*Similar version for lower bound.*}
paulson@14477
  1988
paulson@14477
  1989
lemma lemma_isCont_inj2:
huffman@20552
  1990
  fixes f g :: "real \<Rightarrow> real"
huffman@20552
  1991
  shows "[|0 < d; \<forall>z. \<bar>z-x\<bar> \<le> d --> g(f z) = z;
paulson@14477
  1992
        \<forall>z. \<bar>z-x\<bar> \<le> d --> isCont f z |]
paulson@14477
  1993
      ==> \<exists>z. \<bar>z-x\<bar> \<le> d & f z < f x"
paulson@14477
  1994
apply (insert lemma_isCont_inj
paulson@14477
  1995
          [where f = "%x. - f x" and g = "%y. g(-y)" and x = x and d = d])
paulson@15228
  1996
apply (simp add: isCont_minus linorder_not_le)
paulson@14477
  1997
done
paulson@14477
  1998
paulson@15228
  1999
text{*Show there's an interval surrounding @{term "f(x)"} in
paulson@14477
  2000
@{text "f[[x - d, x + d]]"} .*}
paulson@14477
  2001
paulson@15228
  2002
lemma isCont_inj_range:
huffman@20552
  2003
  fixes f :: "real \<Rightarrow> real"
paulson@14477
  2004
  assumes d: "0 < d"
paulson@14477
  2005
      and inj: "\<forall>z. \<bar>z-x\<bar> \<le> d --> g(f z) = z"
paulson@14477
  2006
      and cont: "\<forall>z. \<bar>z-x\<bar> \<le> d --> isCont f z"
nipkow@15360
  2007
  shows "\<exists>e>0. \<forall>y. \<bar>y - f x\<bar> \<le> e --> (\<exists>z. \<bar>z-x\<bar> \<le> d & f z = y)"
paulson@14477
  2008
proof -
paulson@14477
  2009
  have "x-d \<le> x+d" "\<forall>z. x-d \<le> z \<and> z \<le> x+d \<longrightarrow> isCont f z" using cont d
paulson@14477
  2010
    by (auto simp add: abs_le_interval_iff)
paulson@14477
  2011
  from isCont_Lb_Ub [OF this]
paulson@15228
  2012
  obtain L M
paulson@14477
  2013
  where all1 [rule_format]: "\<forall>z. x-d \<le> z \<and> z \<le> x+d \<longrightarrow> L \<le> f z \<and> f z \<le> M"
paulson@14477
  2014
    and all2 [rule_format]:
paulson@14477
  2015
           "\<forall>y. L \<le> y \<and> y \<le> M \<longrightarrow> (\<exists>z. x-d \<le> z \<and> z \<le> x+d \<and> f z = y)"
paulson@14477
  2016
    by auto
paulson@14477
  2017
  with d have "L \<le> f x & f x \<le> M" by simp
paulson@14477
  2018
  moreover have "L \<noteq> f x"
paulson@14477
  2019
  proof -
paulson@14477
  2020
    from lemma_isCont_inj2 [OF d inj cont]
paulson@14477
  2021
    obtain u where "\<bar>u - x\<bar> \<le> d" "f u < f x"  by auto
paulson@14477
  2022
    thus ?thesis using all1 [of u] by arith
paulson@14477
  2023
  qed
paulson@14477
  2024
  moreover have "f x \<noteq> M"
paulson@14477
  2025
  proof -
paulson@14477
  2026
    from lemma_isCont_inj [OF d inj cont]
paulson@14477
  2027
    obtain u where "\<bar>u - x\<bar> \<le> d" "f x < f u"  by auto
paulson@14477
  2028
    thus ?thesis using all1 [of u] by arith
paulson@14477
  2029
  qed
paulson@14477
  2030
  ultimately have "L < f x & f x < M" by arith
paulson@14477
  2031
  hence "0 < f x - L" "0 < M - f x" by arith+
paulson@14477
  2032
  from real_lbound_gt_zero [OF this]
paulson@14477
  2033
  obtain e where e: "0 < e" "e < f x - L" "e < M - f x" by auto
paulson@14477
  2034
  thus ?thesis
paulson@14477
  2035
  proof (intro exI conjI)
paulson@14477
  2036
    show "0<e" .
paulson@14477
  2037
    show "\<forall>y. \<bar>y - f x\<bar> \<le> e \<longrightarrow> (\<exists>z. \<bar>z - x\<bar> \<le> d \<and> f z = y)"
paulson@14477
  2038
    proof (intro strip)
paulson@14477
  2039
      fix y::real
paulson@14477
  2040
      assume "\<bar>y - f x\<bar> \<le> e"
paulson@14477
  2041
      with e have "L \<le> y \<and> y \<le> M" by arith
paulson@14477
  2042
      from all2 [OF this]
paulson@14477
  2043
      obtain z where "x - d \<le> z" "z \<le> x + d" "f z = y" by blast
paulson@15228
  2044
      thus "\<exists>z. \<bar>z - x\<bar> \<le> d \<and> f z = y"
paulson@14477
  2045
        by (force simp add: abs_le_interval_iff)
paulson@14477
  2046
    qed
paulson@14477
  2047
  qed
paulson@14477
  2048
qed
paulson@14477
  2049
paulson@14477
  2050
paulson@14477
  2051
text{*Continuity of inverse function*}
paulson@14477
  2052
paulson@14477
  2053
lemma isCont_inverse_function:
huffman@20561
  2054
  fixes f g :: "real \<Rightarrow> real"
paulson@14477
  2055
  assumes d: "0 < d"
paulson@14477
  2056
      and inj: "\<forall>z. \<bar>z-x\<bar> \<le> d --> g(f z) = z"
paulson@14477
  2057
      and cont: "\<forall>z. \<bar>z-x\<bar> \<le> d --> isCont f z"
paulson@14477
  2058
  shows "isCont g (f x)"
paulson@14477
  2059
proof (simp add: isCont_iff LIM_eq)
paulson@14477
  2060
  show "\<forall>r. 0 < r \<longrightarrow>
nipkow@15360
  2061
         (\<exists>s>0. \<forall>z. z\<noteq>0 \<and> \<bar>z\<bar> < s \<longrightarrow> \<bar>g(f x + z) - g(f x)\<bar> < r)"
paulson@14477
  2062
  proof (intro strip)
paulson@14477
  2063
    fix r::real
paulson@14477
  2064
    assume r: "0<r"
paulson@14477
  2065
    from real_lbound_gt_zero [OF r d]
paulson@14477
  2066
    obtain e where e: "0 < e" and e_lt: "e < r \<and> e < d" by blast
paulson@14477
  2067
    with inj cont
paulson@15228
  2068
    have e_simps: "\<forall>z. \<bar>z-x\<bar> \<le> e --> g (f z) = z"
paulson@14477
  2069
                  "\<forall>z. \<bar>z-x\<bar> \<le> e --> isCont f z"   by auto
paulson@14477
  2070
    from isCont_inj_range [OF e this]
paulson@15228
  2071
    obtain e' where e': "0 < e'"
paulson@14477
  2072
        and all: "\<forall>y. \<bar>y - f x\<bar> \<le> e' \<longrightarrow> (\<exists>z. \<bar>z - x\<bar> \<le> e \<and> f z = y)"
paulson@14477
  2073
          by blast
nipkow@15360
  2074
    show "\<exists>s>0. \<forall>z. z\<noteq>0 \<and> \<bar>z\<bar> < s \<longrightarrow> \<bar>g(f x + z) - g(f x)\<bar> < r"
paulson@14477
  2075
    proof (intro exI conjI)
paulson@14477
  2076
      show "0<e'" .
paulson@14477
  2077
      show "\<forall>z. z \<noteq> 0 \<and> \<bar>z\<bar> < e' \<longrightarrow> \<bar>g (f x + z) - g (f x)\<bar> < r"
paulson@14477
  2078
      proof (intro strip)
paulson@14477
  2079
        fix z::real
paulson@14477
  2080
        assume z: "z \<noteq> 0 \<and> \<bar>z\<bar> < e'"
paulson@14477
  2081
        with e e_lt e_simps all [rule_format, of "f x + z"]
paulson@14477
  2082
        show "\<bar>g (f x + z) - g (f x)\<bar> < r" by force
paulson@14477
  2083
      qed
paulson@14477
  2084
    qed
paulson@14477
  2085
  qed
paulson@15228
  2086
qed
paulson@14477
  2087
kleing@19023
  2088
kleing@19023
  2089
lemma differentiable_const: "(\<lambda>z. a) differentiable x"
kleing@19023
  2090
  apply (unfold differentiable_def)
kleing@19023
  2091
  apply (rule_tac x=0 in exI)
kleing@19023
  2092
  apply simp
kleing@19023
  2093
  done
kleing@19023
  2094
kleing@19023
  2095
lemma differentiable_sum:
kleing@19023
  2096
  assumes "f differentiable x"
kleing@19023
  2097
  and "g differentiable x"
kleing@19023
  2098
  shows "(\<lambda>x. f x + g x) differentiable x"
kleing@19023
  2099
proof -
kleing@19023
  2100
  from prems have "\<exists>D. DERIV f x :> D" by (unfold differentiable_def)
kleing@19023
  2101
  then obtain df where "DERIV f x :> df" ..
kleing@19023
  2102
  moreover from prems have "\<exists>D. DERIV g x :> D" by (unfold differentiable_def)
kleing@19023
  2103
  then obtain dg where "DERIV g x :> dg" ..
kleing@19023
  2104
  ultimately have "DERIV (\<lambda>x. f x + g x) x :> df + dg" by (rule DERIV_add)
kleing@19023
  2105
  hence "\<exists>D. DERIV (\<lambda>x. f x + g x) x :> D" by auto
kleing@19023
  2106
  thus ?thesis by (fold differentiable_def)
kleing@19023
  2107
qed
kleing@19023
  2108
kleing@19023
  2109
lemma differentiable_diff:
kleing@19023
  2110
  assumes "f differentiable x"
kleing@19023
  2111
  and "g differentiable x"
kleing@19023
  2112
  shows "(\<lambda>x. f x - g x) differentiable x"
kleing@19023
  2113
proof -
kleing@19023
  2114
  from prems have "f differentiable x" by simp
kleing@19023
  2115
  moreover
kleing@19023
  2116
  from prems have "\<exists>D. DERIV g x :> D" by (unfold differentiable_def)
kleing@19023
  2117
  then obtain dg where "DERIV g x :> dg" ..
kleing@19023
  2118
  then have "DERIV (\<lambda>x. - g x) x :> -dg" by (rule DERIV_minus)
kleing@19023
  2119
  hence "\<exists>D. DERIV (\<lambda>x. - g x) x :> D" by auto
kleing@19023
  2120
  hence "(\<lambda>x. - g x) differentiable x" by (fold differentiable_def)
kleing@19023
  2121
  ultimately 
kleing@19023
  2122
  show ?thesis
kleing@19023
  2123
    by (auto simp: real_diff_def dest: differentiable_sum)
kleing@19023
  2124
qed
kleing@19023
  2125
kleing@19023
  2126
lemma differentiable_mult:
kleing@19023
  2127
  assumes "f differentiable x"
kleing@19023
  2128
  and "g differentiable x"
kleing@19023
  2129
  shows "(\<lambda>x. f x * g x) differentiable x"
kleing@19023
  2130
proof -
kleing@19023
  2131
  from prems have "\<exists>D. DERIV f x :> D" by (unfold differentiable_def)
kleing@19023
  2132
  then obtain df where "DERIV f x :> df" ..
kleing@19023
  2133
  moreover from prems have "\<exists>D. DERIV g x :> D" by (unfold differentiable_def)
kleing@19023
  2134
  then obtain dg where "DERIV g x :> dg" ..
kleing@19023
  2135
  ultimately have "DERIV (\<lambda>x. f x * g x) x :> df * g x + dg * f x" by (simp add: DERIV_mult)
kleing@19023
  2136
  hence "\<exists>D. DERIV (\<lambda>x. f x * g x) x :> D" by auto
kleing@19023
  2137
  thus ?thesis by (fold differentiable_def)
kleing@19023
  2138
qed
kleing@19023
  2139
kleing@19023
  2140
kleing@19023
  2141
theorem GMVT:
kleing@19023
  2142
  assumes alb: "a < b"
kleing@19023
  2143
  and fc: "\<forall>x. a \<le> x \<and> x \<le> b \<longrightarrow> isCont f x"
kleing@19023
  2144
  and fd: "\<forall>x. a < x \<and> x < b \<longrightarrow> f differentiable x"
kleing@19023
  2145
  and gc: "\<forall>x. a \<le> x \<and> x \<le> b \<longrightarrow> isCont g x"
kleing@19023
  2146
  and gd: "\<forall>x. a < x \<and> x < b \<longrightarrow> g differentiable x"
kleing@19023
  2147
  shows "\<exists>g'c f'c c. DERIV g c :> g'c \<and> DERIV f c :> f'c \<and> a < c \<and> c < b \<and> ((f b - f a) * g'c) = ((g b - g a) * f'c)"
kleing@19023
  2148
proof -
kleing@19023
  2149
  let ?h = "\<lambda>x. (f b - f a)*(g x) - (g b - g a)*(f x)"
kleing@19023
  2150
  from prems have "a < b" by simp
kleing@19023
  2151
  moreover have "\<forall>x. a \<le> x \<and> x \<le> b \<longrightarrow> isCont ?h x"
kleing@19023
  2152
  proof -
kleing@19023
  2153
    have "\<forall>x. a <= x \<and> x <= b \<longrightarrow> isCont (\<lambda>x. f b - f a) x" by simp
kleing@19023
  2154
    with gc have "\<forall>x. a <= x \<and> x <= b \<longrightarrow> isCont (\<lambda>x. (f b - f a) * g x) x"
kleing@19023
  2155
      by (auto intro: isCont_mult)
kleing@19023
  2156
    moreover
kleing@19023
  2157
    have "\<forall>x. a <= x \<and> x <= b \<longrightarrow> isCont (\<lambda>x. g b - g a) x" by simp
kleing@19023
  2158
    with fc have "\<forall>x. a <= x \<and> x <= b \<longrightarrow> isCont (\<lambda>x. (g b - g a) * f x) x"
kleing@19023
  2159
      by (auto intro: isCont_mult)
kleing@19023
  2160
    ultimately show ?thesis
kleing@19023
  2161
      by (fastsimp intro: isCont_diff)
kleing@19023
  2162
  qed
kleing@19023
  2163
  moreover
kleing@19023
  2164
  have "\<forall>x. a < x \<and> x < b \<longrightarrow> ?h differentiable x"
kleing@19023
  2165
  proof -
kleing@19023
  2166
    have "\<forall>x. a < x \<and> x < b \<longrightarrow> (\<lambda>x. f b - f a) differentiable x" by (simp add: differentiable_const)
kleing@19023
  2167
    with gd have "\<forall>x. a < x \<and> x < b \<longrightarrow> (\<lambda>x. (f b - f a) * g x) differentiable x" by (simp add: differentiable_mult)
kleing@19023
  2168
    moreover
kleing@19023
  2169
    have "\<forall>x. a < x \<and> x < b \<longrightarrow> (\<lambda>x. g b - g a) differentiable x" by (simp add: differentiable_const)
kleing@19023
  2170
    with fd have "\<forall>x. a < x \<and> x < b \<longrightarrow> (\<lambda>x. (g b - g a) * f x) differentiable x" by (simp add: differentiable_mult)
kleing@19023
  2171
    ultimately show ?thesis by (simp add: differentiable_diff)
kleing@19023
  2172
  qed
kleing@19023
  2173
  ultimately have "\<exists>l z. a < z \<and> z < b \<and> DERIV ?h z :> l \<and> ?h b - ?h a = (b - a) * l" by (rule MVT)
kleing@19023
  2174
  then obtain l where ldef: "\<exists>z. a < z \<and> z < b \<and> DERIV ?h z :> l \<and> ?h b - ?h a = (b - a) * l" ..
kleing@19023
  2175
  then obtain c where cdef: "a < c \<and> c < b \<and> DERIV ?h c :> l \<and> ?h b - ?h a = (b - a) * l" ..
kleing@19023
  2176
kleing@19023
  2177
  from cdef have cint: "a < c \<and> c < b" by auto
kleing@19023
  2178
  with gd have "g differentiable c" by simp
kleing@19023
  2179
  hence "\<exists>D. DERIV g c :> D" by (rule differentiableD)
kleing@19023
  2180
  then obtain g'c where g'cdef: "DERIV g c :> g'c" ..
kleing@19023
  2181
kleing@19023
  2182
  from cdef have "a < c \<and> c < b" by auto
kleing@19023
  2183
  with fd have "f differentiable c" by simp
kleing@19023
  2184
  hence "\<exists>D. DERIV f c :> D" by (rule differentiableD)
kleing@19023
  2185
  then obtain f'c where f'cdef: "DERIV f c :> f'c" ..
kleing@19023
  2186
kleing@19023
  2187
  from cdef have "DERIV ?h c :> l" by auto
kleing@19023
  2188
  moreover
kleing@19023
  2189
  {
kleing@19023
  2190
    from g'cdef have "DERIV (\<lambda>x. (f b - f a) * g x) c :> g'c * (f b - f a)"
kleing@19023
  2191
      apply (insert DERIV_const [where k="f b - f a"])
kleing@19023
  2192
      apply (drule meta_spec [of _ c])
kleing@19023
  2193
      apply (drule DERIV_mult [where f="(\<lambda>x. f b - f a)" and g=g])
kleing@19023
  2194
      by simp_all
kleing@19023
  2195
    moreover from f'cdef have "DERIV (\<lambda>x. (g b - g a) * f x) c :> f'c * (g b - g a)"
kleing@19023
  2196
      apply (insert DERIV_const [where k="g b - g a"])
kleing@19023
  2197
      apply (drule meta_spec [of _ c])
kleing@19023
  2198
      apply (drule DERIV_mult [where f="(\<lambda>x. g b - g a)" and g=f])
kleing@19023
  2199
      by simp_all
kleing@19023
  2200
    ultimately have "DERIV ?h c :>  g'c * (f b - f a) - f'c * (g b - g a)"
kleing@19023
  2201
      by (simp add: DERIV_diff)
kleing@19023
  2202
  }
kleing@19023
  2203
  ultimately have leq: "l =  g'c * (f b - f a) - f'c * (g b - g a)" by (rule DERIV_unique)
kleing@19023
  2204
kleing@19023
  2205
  {
kleing@19023
  2206
    from cdef have "?h b - ?h a = (b - a) * l" by auto
kleing@19023
  2207
    also with leq have "\<dots> = (b - a) * (g'c * (f b - f a) - f'c * (g b - g a))" by simp
kleing@19023
  2208
    finally have "?h b - ?h a = (b - a) * (g'c * (f b - f a) - f'c * (g b - g a))" by simp
kleing@19023
  2209
  }
kleing@19023
  2210
  moreover
kleing@19023
  2211
  {
kleing@19023
  2212
    have "?h b - ?h a =
kleing@19023
  2213
         ((f b)*(g b) - (f a)*(g b) - (g b)*(f b) + (g a)*(f b)) -
kleing@19023
  2214
          ((f b)*(g a) - (f a)*(g a) - (g b)*(f a) + (g a)*(f a))"
kleing@19023
  2215
      by (simp add: mult_ac add_ac real_diff_mult_distrib)
kleing@19023
  2216
    hence "?h b - ?h a = 0" by auto
kleing@19023
  2217
  }
kleing@19023
  2218
  ultimately have "(b - a) * (g'c * (f b - f a) - f'c * (g b - g a)) = 0" by auto
kleing@19023
  2219
  with alb have "g'c * (f b - f a) - f'c * (g b - g a) = 0" by simp
kleing@19023
  2220
  hence "g'c * (f b - f a) = f'c * (g b - g a)" by simp
kleing@19023
  2221
  hence "(f b - f a) * g'c = (g b - g a) * f'c" by (simp add: mult_ac)
kleing@19023
  2222
kleing@19023
  2223
  with g'cdef f'cdef cint show ?thesis by auto
kleing@19023
  2224
qed
kleing@19023
  2225
kleing@19023
  2226
kleing@19023
  2227
lemma LIMSEQ_SEQ_conv1:
huffman@20561
  2228
  fixes a :: real
kleing@19023
  2229
  assumes "X -- a --> L"
kleing@19023
  2230
  shows "\<forall>S. (\<forall>n. S n \<noteq> a) \<and> S ----> a \<longrightarrow> (\<lambda>n. X (S n)) ----> L"
kleing@19023
  2231
proof -
kleing@19023
  2232
  {
huffman@20561
  2233
    from prems have Xdef: "\<forall>r > 0. \<exists>s > 0. \<forall>x. x \<noteq> a & norm (x + -a) < s --> norm (X x + -L) < r" by (unfold LIM_def)
kleing@19023
  2234
    
kleing@19023
  2235
    fix S
kleing@19023
  2236
    assume as: "(\<forall>n. S n \<noteq> a) \<and> S ----> a"
kleing@19023
  2237
    then have "S ----> a" by auto
huffman@20552
  2238
    then have Sdef: "(\<forall>r. 0 < r --> (\<exists>no. \<forall>n. no \<le> n --> norm (S n + -a) < r))" by (unfold LIMSEQ_def)
kleing@19023
  2239
    {
kleing@19023
  2240
      fix r
huffman@20552
  2241
      from Xdef have Xdef2: "0 < r --> (\<exists>s > 0. \<forall>x. x \<noteq> a \<and> \<bar>x + -a\<bar> < s --> norm (X x + -L) < r)" by simp
kleing@19023
  2242
      {
kleing@19023
  2243
        assume rgz: "0 < r"
kleing@19023
  2244
huffman@20552
  2245
        from Xdef2 rgz have "\<exists>s > 0. \<forall>x. x \<noteq> a \<and> \<bar>x + -a\<bar> < s --> norm (X x + -L) < r" by simp 
huffman@20552
  2246
        then obtain s where sdef: "s > 0 \<and> (\<forall>x. x\<noteq>a \<and> \<bar>x + -a\<bar> < s \<longrightarrow> norm (X x + -L) < r)" by auto
huffman@20552
  2247
        then have aux: "\<forall>x. x\<noteq>a \<and> \<bar>x + -a\<bar> < s \<longrightarrow> norm (X x + -L) < r" by auto
kleing@19023
  2248
        {
kleing@19023
  2249
          fix n
huffman@20552
  2250
          from aux have "S n \<noteq> a \<and> \<bar>S n + -a\<bar> < s \<longrightarrow> norm (X (S n) + -L) < r" by simp
huffman@20552
  2251
          with as have imp2: "\<bar>S n + -a\<bar> < s --> norm (X (S n) + -L) < r" by auto
kleing@19023
  2252
        }
huffman@20552
  2253
        hence "\<forall>n. \<bar>S n + -a\<bar> < s --> norm (X (S n) + -L) < r" ..
kleing@19023
  2254
        moreover
kleing@19023
  2255
        from Sdef sdef have imp1: "\<exists>no. \<forall>n. no \<le> n --> \<bar>S n + -a\<bar> < s" by auto  
kleing@19023
  2256
        then obtain no where "\<forall>n. no \<le> n --> \<bar>S n + -a\<bar> < s" by auto
huffman@20552
  2257
        ultimately have "\<forall>n. no \<le> n \<longrightarrow> norm (X (S n) + -L) < r" by simp
huffman@20552
  2258
        hence "\<exists>no. \<forall>n. no \<le> n \<longrightarrow> norm (X (S n) + -L) < r" by auto
kleing@19023
  2259
      }
kleing@19023
  2260
    }
huffman@20552
  2261
    hence "(\<forall>r. 0 < r --> (\<exists>no. \<forall>n. no \<le> n --> norm (X (S n) + -L) < r))" by simp
kleing@19023
  2262
    hence "(\<lambda>n. X (S n)) ----> L" by (fold LIMSEQ_def)
kleing@19023
  2263
  }
kleing@19023
  2264
  thus ?thesis by simp
kleing@19023
  2265
qed
kleing@19023
  2266
webertj@20432
  2267
ML {* fast_arith_split_limit := 0; *}  (* FIXME *)
webertj@20217
  2268
kleing@19023
  2269
lemma LIMSEQ_SEQ_conv2:
huffman@20561
  2270
  fixes a :: real
kleing@19023
  2271
  assumes "\<forall>S. (\<forall>n. S n \<noteq> a) \<and> S ----> a \<longrightarrow> (\<lambda>n. X (S n)) ----> L"
kleing@19023
  2272
  shows "X -- a --> L"
kleing@19023
  2273
proof (rule ccontr)
kleing@19023
  2274
  assume "\<not> (X -- a --> L)"
huffman@20561
  2275
  hence "\<not> (\<forall>r > 0. \<exists>s > 0. \<forall>x. x \<noteq> a & norm (x + -a) < s --> norm (X x + -L) < r)" by (unfold LIM_def)
huffman@20552
  2276
  hence "\<exists>r > 0. \<forall>s > 0. \<exists>x. \<not>(x \<noteq> a \<and> \<bar>x + -a\<bar> < s --> norm (X x + -L) < r)" by simp
huffman@20552
  2277
  hence "\<exists>r > 0. \<forall>s > 0. \<exists>x. (x \<noteq> a \<and> \<bar>x + -a\<bar> < s \<and> norm (X x + -L) \<ge> r)" by (simp add: linorder_not_less)
huffman@20552
  2278
  then obtain r where rdef: "r > 0 \<and> (\<forall>s > 0. \<exists>x. (x \<noteq> a \<and> \<bar>x + -a\<bar> < s \<and> norm (X x + -L) \<ge> r))" by auto
kleing@19023
  2279
huffman@20552
  2280
  let ?F = "\<lambda>n::nat. SOME x. x\<noteq>a \<and> \<bar>x + -a\<bar> < inverse (real (Suc n)) \<and> norm (X x + -L) \<ge> r"
kleing@19023
  2281
  have "?F ----> a"
kleing@19023
  2282
  proof -
kleing@19023
  2283
    {
kleing@19023
  2284
      fix e::real
kleing@19023
  2285
      assume "0 < e"
kleing@19023
  2286
        (* choose no such that inverse (real (Suc n)) < e *)
kleing@19023
  2287
      have "\<exists>no. inverse (real (Suc no)) < e" by (rule reals_Archimedean)
kleing@19023
  2288
      then obtain m where nodef: "inverse (real (Suc m)) < e" by auto
kleing@19023
  2289
      {
kleing@19023
  2290
        fix n
kleing@19023
  2291
        assume mlen: "m \<le> n"
kleing@19023
  2292
        then have
kleing@19023
  2293
          "inverse (real (Suc n)) \<le> inverse (real (Suc m))"
kleing@19023
  2294
          by auto
kleing@19023
  2295
        moreover have
kleing@19023
  2296
          "\<bar>?F n + -a\<bar> < inverse (real (Suc n))"
kleing@19023
  2297
        proof -
kleing@19023
  2298
          from rdef have
huffman@20552
  2299
            "\<exists>x. x\<noteq>a \<and> \<bar>x + -a\<bar> < inverse (real (Suc n)) \<and> norm (X x + -L) \<ge> r"
kleing@19023
  2300
            by simp
kleing@19023
  2301
          hence
huffman@20552
  2302
            "(?F n)\<noteq>a \<and> \<bar>(?F n) + -a\<bar> < inverse (real (Suc n)) \<and> norm (X (?F n) + -L) \<ge> r"
kleing@19023
  2303
            by (simp add: some_eq_ex [symmetric])
kleing@19023
  2304
          thus ?thesis by simp
kleing@19023
  2305
        qed
kleing@19023
  2306
        moreover from nodef have
kleing@19023
  2307
          "inverse (real (Suc m)) < e" .
kleing@19023
  2308
        ultimately have "\<bar>?F n + -a\<bar> < e" by arith
kleing@19023
  2309
      }
kleing@19023
  2310
      then have "\<exists>no. \<forall>n. no \<le> n --> \<bar>?F n + -a\<bar> < e" by auto
kleing@19023
  2311
    }
kleing@19023
  2312
    thus ?thesis by (unfold LIMSEQ_def, simp)
kleing@19023
  2313
  qed
kleing@19023
  2314
  
kleing@19023
  2315
  moreover have "\<forall>n. ?F n \<noteq> a"
kleing@19023
  2316
  proof -
kleing@19023
  2317
    {
kleing@19023
  2318
      fix n
kleing@19023
  2319
      from rdef have
huffman@20552
  2320
        "\<exists>x. x\<noteq>a \<and> \<bar>x + -a\<bar> < inverse (real (Suc n)) \<and> norm (X x + -L) \<ge> r"
kleing@19023
  2321
        by simp
kleing@19023
  2322
      hence "?F n \<noteq> a" by (simp add: some_eq_ex [symmetric])
kleing@19023
  2323
    }
kleing@19023
  2324
    thus ?thesis ..
kleing@19023
  2325
  qed
kleing@19023
  2326
  moreover from prems have "\<forall>S. (\<forall>n. S n \<noteq> a) \<and> S ----> a \<longrightarrow> (\<lambda>n. X (S n)) ----> L" by simp
kleing@19023
  2327
  ultimately have "(\<lambda>n. X (?F n)) ----> L" by simp
kleing@19023
  2328
  
kleing@19023
  2329
  moreover have "\<not> ((\<lambda>n. X (?F n)) ----> L)"
kleing@19023
  2330
  proof -
kleing@19023
  2331
    {
kleing@19023
  2332
      fix no::nat
kleing@19023
  2333
      obtain n where "n = no + 1" by simp
kleing@19023
  2334
      then have nolen: "no \<le> n" by simp
kleing@19023
  2335
        (* We prove this by showing that for any m there is an n\<ge>m such that |X (?F n) - L| \<ge> r *)
huffman@20552
  2336
      from rdef have "\<forall>s > 0. \<exists>x. (x \<noteq> a \<and> \<bar>x + -a\<bar> < s \<and> norm (X x + -L) \<ge> r)" ..
kleing@19023
  2337
huffman@20552
  2338
      then have "\<exists>x. x\<noteq>a \<and> \<bar>x + -a\<bar> < inverse (real (Suc n)) \<and> norm (X x + -L) \<ge> r" by simp
kleing@19023
  2339
      
huffman@20552
  2340
      hence "norm (X (?F n) + -L) \<ge> r" by (simp add: some_eq_ex [symmetric])
huffman@20552
  2341
      with nolen have "\<exists>n. no \<le> n \<and> norm (X (?F n) + -L) \<ge> r" by auto
kleing@19023
  2342
    }
huffman@20552
  2343
    then have "(\<forall>no. \<exists>n. no \<le> n \<and> norm (X (?F n) + -L) \<ge> r)" by simp
huffman@20552
  2344
    with rdef have "\<exists>e>0. (\<forall>no. \<exists>n. no \<le> n \<and> norm (X (?F n) + -L) \<ge> e)" by auto
kleing@19023
  2345
    thus ?thesis by (unfold LIMSEQ_def, auto simp add: linorder_not_less)
kleing@19023
  2346
  qed
kleing@19023
  2347
  ultimately show False by simp
kleing@19023
  2348
qed
kleing@19023
  2349
webertj@20432
  2350
ML {* fast_arith_split_limit := 9; *}  (* FIXME *)
kleing@19023
  2351
kleing@19023
  2352
lemma LIMSEQ_SEQ_conv:
huffman@20561
  2353
  "(\<forall>S. (\<forall>n. S n \<noteq> a) \<and> S ----> (a::real) \<longrightarrow> (\<lambda>n. X (S n)) ----> L) =
huffman@20561
  2354
   (X -- a --> L)"
kleing@19023
  2355
proof
kleing@19023
  2356
  assume "\<forall>S. (\<forall>n. S n \<noteq> a) \<and> S ----> a \<longrightarrow> (\<lambda>n. X (S n)) ----> L"
kleing@19023
  2357
  show "X -- a --> L" by (rule LIMSEQ_SEQ_conv2)
kleing@19023
  2358
next
kleing@19023
  2359
  assume "(X -- a --> L)"
kleing@19023
  2360
  show "\<forall>S. (\<forall>n. S n \<noteq> a) \<and> S ----> a \<longrightarrow> (\<lambda>n. X (S n)) ----> L" by (rule LIMSEQ_SEQ_conv1)
kleing@19023
  2361
qed
kleing@19023
  2362
kleing@19023
  2363
lemma real_sqz:
kleing@19023
  2364
  fixes a::real
kleing@19023
  2365
  assumes "a < c"
kleing@19023
  2366
  shows "\<exists>b. a < b \<and> b < c"
kleing@19023
  2367
proof
kleing@19023
  2368
  let ?b = "(a + c) / 2"
kleing@19023
  2369
  have "a < ?b" by simp
kleing@19023
  2370
  moreover
kleing@19023
  2371
  have "?b < c" by simp
kleing@19023
  2372
  ultimately