src/HOL/Analysis/Complex_Analysis_Basics.thy
author paulson <lp15@cam.ac.uk>
Thu Apr 27 15:59:00 2017 +0100 (2017-04-27)
changeset 65587 16a8991ab398
parent 64394 141e1ed8d5a0
child 66089 def95e0bc529
permissions -rw-r--r--
New material (and some tidying) purely in the Analysis directory
lp15@56215
     1
(*  Author: John Harrison, Marco Maggesi, Graziano Gentili, Gianni Ciolli, Valentina Bruno
lp15@56215
     2
    Ported from "hol_light/Multivariate/canal.ml" by L C Paulson (2014)
lp15@56215
     3
*)
lp15@56215
     4
wenzelm@60420
     5
section \<open>Complex Analysis Basics\<close>
lp15@56215
     6
lp15@56215
     7
theory Complex_Analysis_Basics
hoelzl@63941
     8
imports Equivalence_Lebesgue_Henstock_Integration "~~/src/HOL/Library/Nonpos_Ints"
lp15@56215
     9
begin
lp15@56215
    10
lp15@59730
    11
paulson@62131
    12
subsection\<open>General lemmas\<close>
lp15@59730
    13
paulson@62131
    14
lemma nonneg_Reals_cmod_eq_Re: "z \<in> \<real>\<^sub>\<ge>\<^sub>0 \<Longrightarrow> norm z = Re z"
paulson@62131
    15
  by (simp add: complex_nonneg_Reals_iff cmod_eq_Re)
hoelzl@56370
    16
hoelzl@56370
    17
lemma has_derivative_mult_right:
hoelzl@56370
    18
  fixes c:: "'a :: real_normed_algebra"
hoelzl@56370
    19
  shows "((op * c) has_derivative (op * c)) F"
hoelzl@56370
    20
by (rule has_derivative_mult_right [OF has_derivative_id])
hoelzl@56370
    21
lp15@61609
    22
lemma has_derivative_of_real[derivative_intros, simp]:
hoelzl@56370
    23
  "(f has_derivative f') F \<Longrightarrow> ((\<lambda>x. of_real (f x)) has_derivative (\<lambda>x. of_real (f' x))) F"
hoelzl@56370
    24
  using bounded_linear.has_derivative[OF bounded_linear_of_real] .
hoelzl@56370
    25
hoelzl@56370
    26
lemma has_vector_derivative_real_complex:
lp15@61806
    27
  "DERIV f (of_real a) :> f' \<Longrightarrow> ((\<lambda>x. f (of_real x)) has_vector_derivative f') (at a within s)"
lp15@61806
    28
  using has_derivative_compose[of of_real of_real a _ f "op * f'"]
hoelzl@56370
    29
  by (simp add: scaleR_conv_of_real ac_simps has_vector_derivative_def has_field_derivative_def)
lp15@56215
    30
lp15@56238
    31
lemma fact_cancel:
lp15@56238
    32
  fixes c :: "'a::real_field"
lp15@59730
    33
  shows "of_nat (Suc n) * c / (fact (Suc n)) = c / (fact n)"
hoelzl@56369
    34
  by (simp add: of_nat_mult del: of_nat_Suc times_nat.simps)
hoelzl@56889
    35
lp15@56215
    36
lemma bilinear_times:
hoelzl@56369
    37
  fixes c::"'a::real_algebra" shows "bilinear (\<lambda>x y::'a. x*y)"
hoelzl@56369
    38
  by (auto simp: bilinear_def distrib_left distrib_right intro!: linearI)
lp15@56215
    39
lp15@56215
    40
lemma linear_cnj: "linear cnj"
hoelzl@56369
    41
  using bounded_linear.linear[OF bounded_linear_cnj] .
lp15@56215
    42
lp15@56215
    43
lemma tendsto_Re_upper:
lp15@61609
    44
  assumes "~ (trivial_limit F)"
wenzelm@61973
    45
          "(f \<longlongrightarrow> l) F"
lp15@56215
    46
          "eventually (\<lambda>x. Re(f x) \<le> b) F"
lp15@56215
    47
    shows  "Re(l) \<le> b"
lp15@56215
    48
  by (metis assms tendsto_le [OF _ tendsto_const]  tendsto_Re)
lp15@56215
    49
lp15@56215
    50
lemma tendsto_Re_lower:
lp15@61609
    51
  assumes "~ (trivial_limit F)"
wenzelm@61973
    52
          "(f \<longlongrightarrow> l) F"
lp15@56215
    53
          "eventually (\<lambda>x. b \<le> Re(f x)) F"
lp15@56215
    54
    shows  "b \<le> Re(l)"
lp15@56215
    55
  by (metis assms tendsto_le [OF _ _ tendsto_const]  tendsto_Re)
lp15@56215
    56
lp15@56215
    57
lemma tendsto_Im_upper:
lp15@61609
    58
  assumes "~ (trivial_limit F)"
wenzelm@61973
    59
          "(f \<longlongrightarrow> l) F"
lp15@56215
    60
          "eventually (\<lambda>x. Im(f x) \<le> b) F"
lp15@56215
    61
    shows  "Im(l) \<le> b"
lp15@56215
    62
  by (metis assms tendsto_le [OF _ tendsto_const]  tendsto_Im)
lp15@56215
    63
lp15@56215
    64
lemma tendsto_Im_lower:
lp15@61609
    65
  assumes "~ (trivial_limit F)"
wenzelm@61973
    66
          "(f \<longlongrightarrow> l) F"
lp15@56215
    67
          "eventually (\<lambda>x. b \<le> Im(f x)) F"
lp15@56215
    68
    shows  "b \<le> Im(l)"
lp15@56215
    69
  by (metis assms tendsto_le [OF _ _ tendsto_const]  tendsto_Im)
lp15@56215
    70
hoelzl@56370
    71
lemma lambda_zero: "(\<lambda>h::'a::mult_zero. 0) = op * 0"
hoelzl@56370
    72
  by auto
hoelzl@56370
    73
hoelzl@56370
    74
lemma lambda_one: "(\<lambda>x::'a::monoid_mult. x) = op * 1"
hoelzl@56370
    75
  by auto
hoelzl@56370
    76
lp15@56215
    77
lemma continuous_mult_left:
lp15@61609
    78
  fixes c::"'a::real_normed_algebra"
lp15@56215
    79
  shows "continuous F f \<Longrightarrow> continuous F (\<lambda>x. c * f x)"
lp15@56215
    80
by (rule continuous_mult [OF continuous_const])
lp15@56215
    81
lp15@56215
    82
lemma continuous_mult_right:
lp15@61609
    83
  fixes c::"'a::real_normed_algebra"
lp15@56215
    84
  shows "continuous F f \<Longrightarrow> continuous F (\<lambda>x. f x * c)"
lp15@56215
    85
by (rule continuous_mult [OF _ continuous_const])
lp15@56215
    86
lp15@56215
    87
lemma continuous_on_mult_left:
lp15@61609
    88
  fixes c::"'a::real_normed_algebra"
lp15@56215
    89
  shows "continuous_on s f \<Longrightarrow> continuous_on s (\<lambda>x. c * f x)"
lp15@56215
    90
by (rule continuous_on_mult [OF continuous_on_const])
lp15@56215
    91
lp15@56215
    92
lemma continuous_on_mult_right:
lp15@61609
    93
  fixes c::"'a::real_normed_algebra"
lp15@56215
    94
  shows "continuous_on s f \<Longrightarrow> continuous_on s (\<lambda>x. f x * c)"
lp15@56215
    95
by (rule continuous_on_mult [OF _ continuous_on_const])
lp15@56215
    96
hoelzl@56371
    97
lemma uniformly_continuous_on_cmul_right [continuous_intros]:
lp15@56215
    98
  fixes f :: "'a::real_normed_vector \<Rightarrow> 'b::real_normed_algebra"
hoelzl@56332
    99
  shows "uniformly_continuous_on s f \<Longrightarrow> uniformly_continuous_on s (\<lambda>x. f x * c)"
lp15@61609
   100
  using bounded_linear.uniformly_continuous_on[OF bounded_linear_mult_left] .
lp15@56215
   101
hoelzl@56371
   102
lemma uniformly_continuous_on_cmul_left[continuous_intros]:
lp15@56215
   103
  fixes f :: "'a::real_normed_vector \<Rightarrow> 'b::real_normed_algebra"
lp15@56215
   104
  assumes "uniformly_continuous_on s f"
lp15@56215
   105
    shows "uniformly_continuous_on s (\<lambda>x. c * f x)"
lp15@56215
   106
by (metis assms bounded_linear.uniformly_continuous_on bounded_linear_mult_right)
lp15@56215
   107
lp15@56215
   108
lemma continuous_within_norm_id [continuous_intros]: "continuous (at x within S) norm"
lp15@56215
   109
  by (rule continuous_norm [OF continuous_ident])
lp15@56215
   110
lp15@56215
   111
lemma continuous_on_norm_id [continuous_intros]: "continuous_on S norm"
hoelzl@56369
   112
  by (intro continuous_on_id continuous_on_norm)
lp15@56215
   113
wenzelm@60420
   114
subsection\<open>DERIV stuff\<close>
lp15@56215
   115
lp15@56215
   116
lemma DERIV_zero_connected_constant:
lp15@56215
   117
  fixes f :: "'a::{real_normed_field,euclidean_space} \<Rightarrow> 'a"
lp15@56215
   118
  assumes "connected s"
lp15@56215
   119
      and "open s"
lp15@56215
   120
      and "finite k"
lp15@56215
   121
      and "continuous_on s f"
lp15@56215
   122
      and "\<forall>x\<in>(s - k). DERIV f x :> 0"
lp15@56215
   123
    obtains c where "\<And>x. x \<in> s \<Longrightarrow> f(x) = c"
lp15@56215
   124
using has_derivative_zero_connected_constant [OF assms(1-4)] assms
hoelzl@56369
   125
by (metis DERIV_const has_derivative_const Diff_iff at_within_open frechet_derivative_at has_field_derivative_def)
lp15@56215
   126
lp15@56215
   127
lemma DERIV_zero_constant:
hoelzl@56370
   128
  fixes f :: "'a::{real_normed_field, real_inner} \<Rightarrow> 'a"
lp15@56215
   129
  shows    "\<lbrakk>convex s;
lp15@61609
   130
             \<And>x. x\<in>s \<Longrightarrow> (f has_field_derivative 0) (at x within s)\<rbrakk>
lp15@56215
   131
             \<Longrightarrow> \<exists>c. \<forall>x \<in> s. f(x) = c"
hoelzl@56370
   132
  by (auto simp: has_field_derivative_def lambda_zero intro: has_derivative_zero_constant)
lp15@56215
   133
lp15@56215
   134
lemma DERIV_zero_unique:
hoelzl@56370
   135
  fixes f :: "'a::{real_normed_field, real_inner} \<Rightarrow> 'a"
lp15@56215
   136
  assumes "convex s"
lp15@56215
   137
      and d0: "\<And>x. x\<in>s \<Longrightarrow> (f has_field_derivative 0) (at x within s)"
lp15@56215
   138
      and "a \<in> s"
lp15@56215
   139
      and "x \<in> s"
lp15@56215
   140
    shows "f x = f a"
hoelzl@56370
   141
  by (rule has_derivative_zero_unique [OF assms(1) _ assms(4,3)])
hoelzl@56332
   142
     (metis d0 has_field_derivative_imp_has_derivative lambda_zero)
lp15@56215
   143
lp15@56215
   144
lemma DERIV_zero_connected_unique:
hoelzl@56370
   145
  fixes f :: "'a::{real_normed_field, real_inner} \<Rightarrow> 'a"
lp15@56215
   146
  assumes "connected s"
lp15@56215
   147
      and "open s"
lp15@56215
   148
      and d0: "\<And>x. x\<in>s \<Longrightarrow> DERIV f x :> 0"
lp15@56215
   149
      and "a \<in> s"
lp15@56215
   150
      and "x \<in> s"
lp15@61609
   151
    shows "f x = f a"
hoelzl@56370
   152
    by (rule has_derivative_zero_unique_connected [OF assms(2,1) _ assms(5,4)])
hoelzl@56370
   153
       (metis has_field_derivative_def lambda_zero d0)
lp15@56215
   154
lp15@56215
   155
lemma DERIV_transform_within:
lp15@56215
   156
  assumes "(f has_field_derivative f') (at a within s)"
lp15@56215
   157
      and "0 < d" "a \<in> s"
lp15@56215
   158
      and "\<And>x. x\<in>s \<Longrightarrow> dist x a < d \<Longrightarrow> f x = g x"
lp15@56215
   159
    shows "(g has_field_derivative f') (at a within s)"
lp15@56215
   160
  using assms unfolding has_field_derivative_def
hoelzl@56332
   161
  by (blast intro: has_derivative_transform_within)
lp15@56215
   162
lp15@56215
   163
lemma DERIV_transform_within_open:
lp15@56215
   164
  assumes "DERIV f a :> f'"
lp15@56215
   165
      and "open s" "a \<in> s"
lp15@56215
   166
      and "\<And>x. x\<in>s \<Longrightarrow> f x = g x"
lp15@56215
   167
    shows "DERIV g a :> f'"
lp15@56215
   168
  using assms unfolding has_field_derivative_def
lp15@56215
   169
by (metis has_derivative_transform_within_open)
lp15@56215
   170
lp15@56215
   171
lemma DERIV_transform_at:
lp15@56215
   172
  assumes "DERIV f a :> f'"
lp15@56215
   173
      and "0 < d"
lp15@56215
   174
      and "\<And>x. dist x a < d \<Longrightarrow> f x = g x"
lp15@56215
   175
    shows "DERIV g a :> f'"
lp15@56215
   176
  by (blast intro: assms DERIV_transform_within)
lp15@56215
   177
lp15@59615
   178
(*generalising DERIV_isconst_all, which requires type real (using the ordering)*)
lp15@59615
   179
lemma DERIV_zero_UNIV_unique:
lp15@59615
   180
  fixes f :: "'a::{real_normed_field, real_inner} \<Rightarrow> 'a"
lp15@61609
   181
  shows "(\<And>x. DERIV f x :> 0) \<Longrightarrow> f x = f a"
wenzelm@63092
   182
by (metis DERIV_zero_unique UNIV_I convex_UNIV)
lp15@59615
   183
wenzelm@60420
   184
subsection \<open>Some limit theorems about real part of real series etc.\<close>
hoelzl@56370
   185
hoelzl@56370
   186
(*MOVE? But not to Finite_Cartesian_Product*)
hoelzl@56370
   187
lemma sums_vec_nth :
hoelzl@56370
   188
  assumes "f sums a"
hoelzl@56370
   189
  shows "(\<lambda>x. f x $ i) sums a $ i"
hoelzl@56370
   190
using assms unfolding sums_def
hoelzl@56370
   191
by (auto dest: tendsto_vec_nth [where i=i])
hoelzl@56370
   192
hoelzl@56370
   193
lemma summable_vec_nth :
hoelzl@56370
   194
  assumes "summable f"
hoelzl@56370
   195
  shows "summable (\<lambda>x. f x $ i)"
hoelzl@56370
   196
using assms unfolding summable_def
hoelzl@56370
   197
by (blast intro: sums_vec_nth)
hoelzl@56370
   198
wenzelm@60420
   199
subsection \<open>Complex number lemmas\<close>
hoelzl@56370
   200
hoelzl@56370
   201
lemma
hoelzl@56370
   202
  shows open_halfspace_Re_lt: "open {z. Re(z) < b}"
hoelzl@56370
   203
    and open_halfspace_Re_gt: "open {z. Re(z) > b}"
hoelzl@56370
   204
    and closed_halfspace_Re_ge: "closed {z. Re(z) \<ge> b}"
hoelzl@56370
   205
    and closed_halfspace_Re_le: "closed {z. Re(z) \<le> b}"
hoelzl@56370
   206
    and closed_halfspace_Re_eq: "closed {z. Re(z) = b}"
hoelzl@56370
   207
    and open_halfspace_Im_lt: "open {z. Im(z) < b}"
hoelzl@56370
   208
    and open_halfspace_Im_gt: "open {z. Im(z) > b}"
hoelzl@56370
   209
    and closed_halfspace_Im_ge: "closed {z. Im(z) \<ge> b}"
hoelzl@56370
   210
    and closed_halfspace_Im_le: "closed {z. Im(z) \<le> b}"
hoelzl@56370
   211
    and closed_halfspace_Im_eq: "closed {z. Im(z) = b}"
hoelzl@63332
   212
  by (intro open_Collect_less closed_Collect_le closed_Collect_eq continuous_on_Re
hoelzl@63332
   213
            continuous_on_Im continuous_on_id continuous_on_const)+
hoelzl@56370
   214
wenzelm@61070
   215
lemma closed_complex_Reals: "closed (\<real> :: complex set)"
hoelzl@56370
   216
proof -
wenzelm@61070
   217
  have "(\<real> :: complex set) = {z. Im z = 0}"
hoelzl@56370
   218
    by (auto simp: complex_is_Real_iff)
hoelzl@56370
   219
  then show ?thesis
hoelzl@56370
   220
    by (metis closed_halfspace_Im_eq)
hoelzl@56370
   221
qed
hoelzl@56370
   222
lp15@60017
   223
lemma closed_Real_halfspace_Re_le: "closed (\<real> \<inter> {w. Re w \<le> x})"
lp15@60017
   224
  by (simp add: closed_Int closed_complex_Reals closed_halfspace_Re_le)
lp15@60017
   225
paulson@62131
   226
corollary closed_nonpos_Reals_complex [simp]: "closed (\<real>\<^sub>\<le>\<^sub>0 :: complex set)"
paulson@62131
   227
proof -
paulson@62131
   228
  have "\<real>\<^sub>\<le>\<^sub>0 = \<real> \<inter> {z. Re(z) \<le> 0}"
paulson@62131
   229
    using complex_nonpos_Reals_iff complex_is_Real_iff by auto
paulson@62131
   230
  then show ?thesis
paulson@62131
   231
    by (metis closed_Real_halfspace_Re_le)
paulson@62131
   232
qed
paulson@62131
   233
lp15@60017
   234
lemma closed_Real_halfspace_Re_ge: "closed (\<real> \<inter> {w. x \<le> Re(w)})"
lp15@60017
   235
  using closed_halfspace_Re_ge
lp15@60017
   236
  by (simp add: closed_Int closed_complex_Reals)
lp15@60017
   237
paulson@62131
   238
corollary closed_nonneg_Reals_complex [simp]: "closed (\<real>\<^sub>\<ge>\<^sub>0 :: complex set)"
paulson@62131
   239
proof -
paulson@62131
   240
  have "\<real>\<^sub>\<ge>\<^sub>0 = \<real> \<inter> {z. Re(z) \<ge> 0}"
paulson@62131
   241
    using complex_nonneg_Reals_iff complex_is_Real_iff by auto
paulson@62131
   242
  then show ?thesis
paulson@62131
   243
    by (metis closed_Real_halfspace_Re_ge)
paulson@62131
   244
qed
paulson@62131
   245
lp15@60017
   246
lemma closed_real_abs_le: "closed {w \<in> \<real>. \<bar>Re w\<bar> \<le> r}"
lp15@60017
   247
proof -
lp15@60017
   248
  have "{w \<in> \<real>. \<bar>Re w\<bar> \<le> r} = (\<real> \<inter> {w. Re w \<le> r}) \<inter> (\<real> \<inter> {w. Re w \<ge> -r})"
lp15@60017
   249
    by auto
lp15@60017
   250
  then show "closed {w \<in> \<real>. \<bar>Re w\<bar> \<le> r}"
lp15@60017
   251
    by (simp add: closed_Int closed_Real_halfspace_Re_ge closed_Real_halfspace_Re_le)
lp15@60017
   252
qed
lp15@60017
   253
hoelzl@56370
   254
lemma real_lim:
hoelzl@56370
   255
  fixes l::complex
wenzelm@61973
   256
  assumes "(f \<longlongrightarrow> l) F" and "~(trivial_limit F)" and "eventually P F" and "\<And>a. P a \<Longrightarrow> f a \<in> \<real>"
hoelzl@56370
   257
  shows  "l \<in> \<real>"
hoelzl@56370
   258
proof (rule Lim_in_closed_set[OF closed_complex_Reals _ assms(2,1)])
hoelzl@56370
   259
  show "eventually (\<lambda>x. f x \<in> \<real>) F"
hoelzl@56370
   260
    using assms(3, 4) by (auto intro: eventually_mono)
hoelzl@56370
   261
qed
hoelzl@56370
   262
hoelzl@56370
   263
lemma real_lim_sequentially:
hoelzl@56370
   264
  fixes l::complex
wenzelm@61973
   265
  shows "(f \<longlongrightarrow> l) sequentially \<Longrightarrow> (\<exists>N. \<forall>n\<ge>N. f n \<in> \<real>) \<Longrightarrow> l \<in> \<real>"
hoelzl@56370
   266
by (rule real_lim [where F=sequentially]) (auto simp: eventually_sequentially)
hoelzl@56370
   267
lp15@61609
   268
lemma real_series:
hoelzl@56370
   269
  fixes l::complex
hoelzl@56370
   270
  shows "f sums l \<Longrightarrow> (\<And>n. f n \<in> \<real>) \<Longrightarrow> l \<in> \<real>"
hoelzl@56370
   271
unfolding sums_def
nipkow@64267
   272
by (metis real_lim_sequentially sum_in_Reals)
hoelzl@56370
   273
hoelzl@56370
   274
lemma Lim_null_comparison_Re:
wenzelm@61973
   275
  assumes "eventually (\<lambda>x. norm(f x) \<le> Re(g x)) F" "(g \<longlongrightarrow> 0) F" shows "(f \<longlongrightarrow> 0) F"
hoelzl@56889
   276
  by (rule Lim_null_comparison[OF assms(1)] tendsto_eq_intros assms(2))+ simp
lp15@56215
   277
wenzelm@60420
   278
subsection\<open>Holomorphic functions\<close>
lp15@56215
   279
lp15@64394
   280
subsection\<open>Holomorphic functions\<close>
hoelzl@56370
   281
hoelzl@56370
   282
definition holomorphic_on :: "[complex \<Rightarrow> complex, complex set] \<Rightarrow> bool"
hoelzl@56370
   283
           (infixl "(holomorphic'_on)" 50)
lp15@62534
   284
  where "f holomorphic_on s \<equiv> \<forall>x\<in>s. f field_differentiable (at x within s)"
lp15@61609
   285
lp15@61520
   286
named_theorems holomorphic_intros "structural introduction rules for holomorphic_on"
lp15@61520
   287
lp15@62534
   288
lemma holomorphic_onI [intro?]: "(\<And>x. x \<in> s \<Longrightarrow> f field_differentiable (at x within s)) \<Longrightarrow> f holomorphic_on s"
paulson@62131
   289
  by (simp add: holomorphic_on_def)
paulson@62131
   290
lp15@62534
   291
lemma holomorphic_onD [dest?]: "\<lbrakk>f holomorphic_on s; x \<in> s\<rbrakk> \<Longrightarrow> f field_differentiable (at x within s)"
paulson@62131
   292
  by (simp add: holomorphic_on_def)
paulson@62131
   293
lp15@64394
   294
lemma holomorphic_on_imp_differentiable_on:
lp15@64394
   295
    "f holomorphic_on s \<Longrightarrow> f differentiable_on s"
lp15@64394
   296
  unfolding holomorphic_on_def differentiable_on_def
lp15@64394
   297
  by (simp add: field_differentiable_imp_differentiable)
lp15@64394
   298
paulson@62131
   299
lemma holomorphic_on_imp_differentiable_at:
lp15@62534
   300
   "\<lbrakk>f holomorphic_on s; open s; x \<in> s\<rbrakk> \<Longrightarrow> f field_differentiable (at x)"
paulson@62131
   301
using at_within_open holomorphic_on_def by fastforce
paulson@62131
   302
lp15@61520
   303
lemma holomorphic_on_empty [holomorphic_intros]: "f holomorphic_on {}"
hoelzl@56370
   304
  by (simp add: holomorphic_on_def)
hoelzl@56370
   305
hoelzl@56370
   306
lemma holomorphic_on_open:
hoelzl@56370
   307
    "open s \<Longrightarrow> f holomorphic_on s \<longleftrightarrow> (\<forall>x \<in> s. \<exists>f'. DERIV f x :> f')"
lp15@62534
   308
  by (auto simp: holomorphic_on_def field_differentiable_def has_field_derivative_def at_within_open [of _ s])
hoelzl@56370
   309
lp15@61609
   310
lemma holomorphic_on_imp_continuous_on:
hoelzl@56370
   311
    "f holomorphic_on s \<Longrightarrow> continuous_on s f"
lp15@62534
   312
  by (metis field_differentiable_imp_continuous_at continuous_on_eq_continuous_within holomorphic_on_def)
hoelzl@56370
   313
lp15@62540
   314
lemma holomorphic_on_subset [elim]:
hoelzl@56370
   315
    "f holomorphic_on s \<Longrightarrow> t \<subseteq> s \<Longrightarrow> f holomorphic_on t"
hoelzl@56370
   316
  unfolding holomorphic_on_def
lp15@62534
   317
  by (metis field_differentiable_within_subset subsetD)
hoelzl@56370
   318
hoelzl@56370
   319
lemma holomorphic_transform: "\<lbrakk>f holomorphic_on s; \<And>x. x \<in> s \<Longrightarrow> f x = g x\<rbrakk> \<Longrightarrow> g holomorphic_on s"
lp15@62534
   320
  by (metis field_differentiable_transform_within linordered_field_no_ub holomorphic_on_def)
hoelzl@56370
   321
hoelzl@56370
   322
lemma holomorphic_cong: "s = t ==> (\<And>x. x \<in> s \<Longrightarrow> f x = g x) \<Longrightarrow> f holomorphic_on s \<longleftrightarrow> g holomorphic_on t"
hoelzl@56370
   323
  by (metis holomorphic_transform)
hoelzl@56370
   324
lp15@62217
   325
lemma holomorphic_on_linear [simp, holomorphic_intros]: "(op * c) holomorphic_on s"
lp15@62534
   326
  unfolding holomorphic_on_def by (metis field_differentiable_linear)
hoelzl@56370
   327
lp15@62217
   328
lemma holomorphic_on_const [simp, holomorphic_intros]: "(\<lambda>z. c) holomorphic_on s"
lp15@62534
   329
  unfolding holomorphic_on_def by (metis field_differentiable_const)
hoelzl@56370
   330
lp15@62217
   331
lemma holomorphic_on_ident [simp, holomorphic_intros]: "(\<lambda>x. x) holomorphic_on s"
lp15@62534
   332
  unfolding holomorphic_on_def by (metis field_differentiable_ident)
hoelzl@56370
   333
lp15@62217
   334
lemma holomorphic_on_id [simp, holomorphic_intros]: "id holomorphic_on s"
hoelzl@56370
   335
  unfolding id_def by (rule holomorphic_on_ident)
hoelzl@56370
   336
hoelzl@56370
   337
lemma holomorphic_on_compose:
hoelzl@56370
   338
  "f holomorphic_on s \<Longrightarrow> g holomorphic_on (f ` s) \<Longrightarrow> (g o f) holomorphic_on s"
lp15@62534
   339
  using field_differentiable_compose_within[of f _ s g]
hoelzl@56370
   340
  by (auto simp: holomorphic_on_def)
hoelzl@56370
   341
hoelzl@56370
   342
lemma holomorphic_on_compose_gen:
hoelzl@56370
   343
  "f holomorphic_on s \<Longrightarrow> g holomorphic_on t \<Longrightarrow> f ` s \<subseteq> t \<Longrightarrow> (g o f) holomorphic_on s"
hoelzl@56370
   344
  by (metis holomorphic_on_compose holomorphic_on_subset)
hoelzl@56370
   345
lp15@61520
   346
lemma holomorphic_on_minus [holomorphic_intros]: "f holomorphic_on s \<Longrightarrow> (\<lambda>z. -(f z)) holomorphic_on s"
lp15@62534
   347
  by (metis field_differentiable_minus holomorphic_on_def)
hoelzl@56370
   348
lp15@61520
   349
lemma holomorphic_on_add [holomorphic_intros]:
hoelzl@56370
   350
  "\<lbrakk>f holomorphic_on s; g holomorphic_on s\<rbrakk> \<Longrightarrow> (\<lambda>z. f z + g z) holomorphic_on s"
lp15@62534
   351
  unfolding holomorphic_on_def by (metis field_differentiable_add)
hoelzl@56370
   352
lp15@61520
   353
lemma holomorphic_on_diff [holomorphic_intros]:
hoelzl@56370
   354
  "\<lbrakk>f holomorphic_on s; g holomorphic_on s\<rbrakk> \<Longrightarrow> (\<lambda>z. f z - g z) holomorphic_on s"
lp15@62534
   355
  unfolding holomorphic_on_def by (metis field_differentiable_diff)
hoelzl@56370
   356
lp15@61520
   357
lemma holomorphic_on_mult [holomorphic_intros]:
hoelzl@56370
   358
  "\<lbrakk>f holomorphic_on s; g holomorphic_on s\<rbrakk> \<Longrightarrow> (\<lambda>z. f z * g z) holomorphic_on s"
lp15@62534
   359
  unfolding holomorphic_on_def by (metis field_differentiable_mult)
hoelzl@56370
   360
lp15@61520
   361
lemma holomorphic_on_inverse [holomorphic_intros]:
hoelzl@56370
   362
  "\<lbrakk>f holomorphic_on s; \<And>z. z \<in> s \<Longrightarrow> f z \<noteq> 0\<rbrakk> \<Longrightarrow> (\<lambda>z. inverse (f z)) holomorphic_on s"
lp15@62534
   363
  unfolding holomorphic_on_def by (metis field_differentiable_inverse)
hoelzl@56370
   364
lp15@61520
   365
lemma holomorphic_on_divide [holomorphic_intros]:
hoelzl@56370
   366
  "\<lbrakk>f holomorphic_on s; g holomorphic_on s; \<And>z. z \<in> s \<Longrightarrow> g z \<noteq> 0\<rbrakk> \<Longrightarrow> (\<lambda>z. f z / g z) holomorphic_on s"
lp15@62534
   367
  unfolding holomorphic_on_def by (metis field_differentiable_divide)
hoelzl@56370
   368
lp15@61520
   369
lemma holomorphic_on_power [holomorphic_intros]:
hoelzl@56370
   370
  "f holomorphic_on s \<Longrightarrow> (\<lambda>z. (f z)^n) holomorphic_on s"
lp15@62534
   371
  unfolding holomorphic_on_def by (metis field_differentiable_power)
hoelzl@56370
   372
nipkow@64267
   373
lemma holomorphic_on_sum [holomorphic_intros]:
nipkow@64267
   374
  "(\<And>i. i \<in> I \<Longrightarrow> (f i) holomorphic_on s) \<Longrightarrow> (\<lambda>x. sum (\<lambda>i. f i x) I) holomorphic_on s"
nipkow@64267
   375
  unfolding holomorphic_on_def by (metis field_differentiable_sum)
hoelzl@56370
   376
lp15@62534
   377
lemma DERIV_deriv_iff_field_differentiable:
lp15@62534
   378
  "DERIV f x :> deriv f x \<longleftrightarrow> f field_differentiable at x"
lp15@62534
   379
  unfolding field_differentiable_def by (metis DERIV_imp_deriv)
hoelzl@56370
   380
lp15@62533
   381
lemma holomorphic_derivI:
lp15@62533
   382
     "\<lbrakk>f holomorphic_on S; open S; x \<in> S\<rbrakk>
lp15@62533
   383
      \<Longrightarrow> (f has_field_derivative deriv f x) (at x within T)"
lp15@62534
   384
by (metis DERIV_deriv_iff_field_differentiable at_within_open  holomorphic_on_def has_field_derivative_at_within)
lp15@62533
   385
hoelzl@56370
   386
lemma complex_derivative_chain:
lp15@62534
   387
  "f field_differentiable at x \<Longrightarrow> g field_differentiable at (f x)
hoelzl@56370
   388
    \<Longrightarrow> deriv (g o f) x = deriv g (f x) * deriv f x"
lp15@62534
   389
  by (metis DERIV_deriv_iff_field_differentiable DERIV_chain DERIV_imp_deriv)
hoelzl@56370
   390
lp15@62397
   391
lemma deriv_linear [simp]: "deriv (\<lambda>w. c * w) = (\<lambda>z. c)"
hoelzl@56370
   392
  by (metis DERIV_imp_deriv DERIV_cmult_Id)
hoelzl@56370
   393
lp15@62397
   394
lemma deriv_ident [simp]: "deriv (\<lambda>w. w) = (\<lambda>z. 1)"
hoelzl@56370
   395
  by (metis DERIV_imp_deriv DERIV_ident)
hoelzl@56370
   396
lp15@62397
   397
lemma deriv_id [simp]: "deriv id = (\<lambda>z. 1)"
lp15@62397
   398
  by (simp add: id_def)
lp15@62397
   399
lp15@62397
   400
lemma deriv_const [simp]: "deriv (\<lambda>w. c) = (\<lambda>z. 0)"
hoelzl@56370
   401
  by (metis DERIV_imp_deriv DERIV_const)
hoelzl@56370
   402
lp15@62534
   403
lemma deriv_add [simp]:
lp15@62534
   404
  "\<lbrakk>f field_differentiable at z; g field_differentiable at z\<rbrakk>
hoelzl@56370
   405
   \<Longrightarrow> deriv (\<lambda>w. f w + g w) z = deriv f z + deriv g z"
lp15@62534
   406
  unfolding DERIV_deriv_iff_field_differentiable[symmetric]
hoelzl@56381
   407
  by (auto intro!: DERIV_imp_deriv derivative_intros)
hoelzl@56370
   408
lp15@62534
   409
lemma deriv_diff [simp]:
lp15@62534
   410
  "\<lbrakk>f field_differentiable at z; g field_differentiable at z\<rbrakk>
hoelzl@56370
   411
   \<Longrightarrow> deriv (\<lambda>w. f w - g w) z = deriv f z - deriv g z"
lp15@62534
   412
  unfolding DERIV_deriv_iff_field_differentiable[symmetric]
hoelzl@56381
   413
  by (auto intro!: DERIV_imp_deriv derivative_intros)
hoelzl@56370
   414
lp15@62534
   415
lemma deriv_mult [simp]:
lp15@62534
   416
  "\<lbrakk>f field_differentiable at z; g field_differentiable at z\<rbrakk>
hoelzl@56370
   417
   \<Longrightarrow> deriv (\<lambda>w. f w * g w) z = f z * deriv g z + deriv f z * g z"
lp15@62534
   418
  unfolding DERIV_deriv_iff_field_differentiable[symmetric]
hoelzl@56381
   419
  by (auto intro!: DERIV_imp_deriv derivative_eq_intros)
hoelzl@56370
   420
lp15@62534
   421
lemma deriv_cmult [simp]:
lp15@62534
   422
  "f field_differentiable at z \<Longrightarrow> deriv (\<lambda>w. c * f w) z = c * deriv f z"
lp15@62534
   423
  unfolding DERIV_deriv_iff_field_differentiable[symmetric]
hoelzl@56381
   424
  by (auto intro!: DERIV_imp_deriv derivative_eq_intros)
hoelzl@56370
   425
lp15@62534
   426
lemma deriv_cmult_right [simp]:
lp15@62534
   427
  "f field_differentiable at z \<Longrightarrow> deriv (\<lambda>w. f w * c) z = deriv f z * c"
lp15@62534
   428
  unfolding DERIV_deriv_iff_field_differentiable[symmetric]
hoelzl@56381
   429
  by (auto intro!: DERIV_imp_deriv derivative_eq_intros)
hoelzl@56370
   430
lp15@62534
   431
lemma deriv_cdivide_right [simp]:
lp15@62534
   432
  "f field_differentiable at z \<Longrightarrow> deriv (\<lambda>w. f w / c) z = deriv f z / c"
lp15@62217
   433
  unfolding Fields.field_class.field_divide_inverse
lp15@62534
   434
  by (blast intro: deriv_cmult_right)
lp15@62217
   435
hoelzl@56370
   436
lemma complex_derivative_transform_within_open:
lp15@61609
   437
  "\<lbrakk>f holomorphic_on s; g holomorphic_on s; open s; z \<in> s; \<And>w. w \<in> s \<Longrightarrow> f w = g w\<rbrakk>
hoelzl@56370
   438
   \<Longrightarrow> deriv f z = deriv g z"
hoelzl@56370
   439
  unfolding holomorphic_on_def
hoelzl@56370
   440
  by (rule DERIV_imp_deriv)
lp15@62534
   441
     (metis DERIV_deriv_iff_field_differentiable DERIV_transform_within_open at_within_open)
hoelzl@56370
   442
lp15@62534
   443
lemma deriv_compose_linear:
lp15@62534
   444
  "f field_differentiable at (c * z) \<Longrightarrow> deriv (\<lambda>w. f (c * w)) z = c * deriv f (c * z)"
hoelzl@56370
   445
apply (rule DERIV_imp_deriv)
lp15@62534
   446
apply (simp add: DERIV_deriv_iff_field_differentiable [symmetric])
haftmann@59554
   447
apply (drule DERIV_chain' [of "times c" c z UNIV f "deriv f (c * z)", OF DERIV_cmult_Id])
haftmann@59554
   448
apply (simp add: algebra_simps)
hoelzl@56370
   449
done
hoelzl@56370
   450
lp15@62533
   451
lemma nonzero_deriv_nonconstant:
lp15@62533
   452
  assumes df: "DERIV f \<xi> :> df" and S: "open S" "\<xi> \<in> S" and "df \<noteq> 0"
lp15@62533
   453
    shows "\<not> f constant_on S"
lp15@62533
   454
unfolding constant_on_def
lp15@62533
   455
by (metis \<open>df \<noteq> 0\<close> DERIV_transform_within_open [OF df S] DERIV_const DERIV_unique)
lp15@62533
   456
lp15@62533
   457
lemma holomorphic_nonconstant:
lp15@62533
   458
  assumes holf: "f holomorphic_on S" and "open S" "\<xi> \<in> S" "deriv f \<xi> \<noteq> 0"
lp15@62533
   459
    shows "\<not> f constant_on S"
lp15@62533
   460
    apply (rule nonzero_deriv_nonconstant [of f "deriv f \<xi>" \<xi> S])
lp15@62533
   461
    using assms
lp15@62533
   462
    apply (auto simp: holomorphic_derivI)
lp15@62533
   463
    done
lp15@62533
   464
lp15@64394
   465
subsection\<open>Caratheodory characterization\<close>
lp15@64394
   466
lp15@64394
   467
lemma field_differentiable_caratheodory_at:
lp15@64394
   468
  "f field_differentiable (at z) \<longleftrightarrow>
lp15@64394
   469
         (\<exists>g. (\<forall>w. f(w) - f(z) = g(w) * (w - z)) \<and> continuous (at z) g)"
lp15@64394
   470
  using CARAT_DERIV [of f]
lp15@64394
   471
  by (simp add: field_differentiable_def has_field_derivative_def)
lp15@64394
   472
lp15@64394
   473
lemma field_differentiable_caratheodory_within:
lp15@64394
   474
  "f field_differentiable (at z within s) \<longleftrightarrow>
lp15@64394
   475
         (\<exists>g. (\<forall>w. f(w) - f(z) = g(w) * (w - z)) \<and> continuous (at z within s) g)"
lp15@64394
   476
  using DERIV_caratheodory_within [of f]
lp15@64394
   477
  by (simp add: field_differentiable_def has_field_derivative_def)
lp15@64394
   478
wenzelm@60420
   479
subsection\<open>Analyticity on a set\<close>
lp15@56215
   480
lp15@61609
   481
definition analytic_on (infixl "(analytic'_on)" 50)
lp15@56215
   482
  where
lp15@56215
   483
   "f analytic_on s \<equiv> \<forall>x \<in> s. \<exists>e. 0 < e \<and> f holomorphic_on (ball x e)"
lp15@56215
   484
lp15@65587
   485
named_theorems analytic_intros "introduction rules for proving analyticity"
lp15@65587
   486
hoelzl@56370
   487
lemma analytic_imp_holomorphic: "f analytic_on s \<Longrightarrow> f holomorphic_on s"
hoelzl@56370
   488
  by (simp add: at_within_open [OF _ open_ball] analytic_on_def holomorphic_on_def)
lp15@62534
   489
     (metis centre_in_ball field_differentiable_at_within)
lp15@56215
   490
hoelzl@56370
   491
lemma analytic_on_open: "open s \<Longrightarrow> f analytic_on s \<longleftrightarrow> f holomorphic_on s"
lp15@56215
   492
apply (auto simp: analytic_imp_holomorphic)
lp15@56215
   493
apply (auto simp: analytic_on_def holomorphic_on_def)
lp15@56215
   494
by (metis holomorphic_on_def holomorphic_on_subset open_contains_ball)
lp15@56215
   495
lp15@56215
   496
lemma analytic_on_imp_differentiable_at:
lp15@62534
   497
  "f analytic_on s \<Longrightarrow> x \<in> s \<Longrightarrow> f field_differentiable (at x)"
hoelzl@56370
   498
 apply (auto simp: analytic_on_def holomorphic_on_def)
lp15@62534
   499
by (metis Topology_Euclidean_Space.open_ball centre_in_ball field_differentiable_within_open)
lp15@56215
   500
hoelzl@56370
   501
lemma analytic_on_subset: "f analytic_on s \<Longrightarrow> t \<subseteq> s \<Longrightarrow> f analytic_on t"
lp15@56215
   502
  by (auto simp: analytic_on_def)
lp15@56215
   503
hoelzl@56370
   504
lemma analytic_on_Un: "f analytic_on (s \<union> t) \<longleftrightarrow> f analytic_on s \<and> f analytic_on t"
lp15@56215
   505
  by (auto simp: analytic_on_def)
lp15@56215
   506
wenzelm@60585
   507
lemma analytic_on_Union: "f analytic_on (\<Union>s) \<longleftrightarrow> (\<forall>t \<in> s. f analytic_on t)"
hoelzl@56370
   508
  by (auto simp: analytic_on_def)
hoelzl@56370
   509
hoelzl@56370
   510
lemma analytic_on_UN: "f analytic_on (\<Union>i\<in>I. s i) \<longleftrightarrow> (\<forall>i\<in>I. f analytic_on (s i))"
lp15@56215
   511
  by (auto simp: analytic_on_def)
lp15@61609
   512
lp15@56215
   513
lemma analytic_on_holomorphic:
lp15@56215
   514
  "f analytic_on s \<longleftrightarrow> (\<exists>t. open t \<and> s \<subseteq> t \<and> f holomorphic_on t)"
lp15@56215
   515
  (is "?lhs = ?rhs")
lp15@56215
   516
proof -
lp15@56215
   517
  have "?lhs \<longleftrightarrow> (\<exists>t. open t \<and> s \<subseteq> t \<and> f analytic_on t)"
lp15@56215
   518
  proof safe
lp15@56215
   519
    assume "f analytic_on s"
lp15@56215
   520
    then show "\<exists>t. open t \<and> s \<subseteq> t \<and> f analytic_on t"
lp15@56215
   521
      apply (simp add: analytic_on_def)
lp15@56215
   522
      apply (rule exI [where x="\<Union>{u. open u \<and> f analytic_on u}"], auto)
lp15@56215
   523
      apply (metis Topology_Euclidean_Space.open_ball analytic_on_open centre_in_ball)
lp15@56215
   524
      by (metis analytic_on_def)
lp15@56215
   525
  next
lp15@56215
   526
    fix t
lp15@61609
   527
    assume "open t" "s \<subseteq> t" "f analytic_on t"
lp15@56215
   528
    then show "f analytic_on s"
lp15@56215
   529
        by (metis analytic_on_subset)
lp15@56215
   530
  qed
lp15@56215
   531
  also have "... \<longleftrightarrow> ?rhs"
lp15@56215
   532
    by (auto simp: analytic_on_open)
lp15@56215
   533
  finally show ?thesis .
lp15@56215
   534
qed
lp15@56215
   535
lp15@65587
   536
lemma analytic_on_linear [analytic_intros,simp]: "(op * c) analytic_on s"
lp15@65587
   537
  by (auto simp add: analytic_on_holomorphic)
lp15@56215
   538
lp15@65587
   539
lemma analytic_on_const [analytic_intros,simp]: "(\<lambda>z. c) analytic_on s"
hoelzl@56370
   540
  by (metis analytic_on_def holomorphic_on_const zero_less_one)
hoelzl@56370
   541
lp15@65587
   542
lemma analytic_on_ident [analytic_intros,simp]: "(\<lambda>x. x) analytic_on s"
lp15@65587
   543
  by (simp add: analytic_on_def gt_ex)
lp15@56215
   544
lp15@65587
   545
lemma analytic_on_id [analytic_intros]: "id analytic_on s"
hoelzl@56370
   546
  unfolding id_def by (rule analytic_on_ident)
lp15@56215
   547
lp15@56215
   548
lemma analytic_on_compose:
lp15@56215
   549
  assumes f: "f analytic_on s"
lp15@56215
   550
      and g: "g analytic_on (f ` s)"
lp15@56215
   551
    shows "(g o f) analytic_on s"
lp15@56215
   552
unfolding analytic_on_def
lp15@56215
   553
proof (intro ballI)
lp15@56215
   554
  fix x
lp15@56215
   555
  assume x: "x \<in> s"
lp15@56215
   556
  then obtain e where e: "0 < e" and fh: "f holomorphic_on ball x e" using f
lp15@56215
   557
    by (metis analytic_on_def)
lp15@56215
   558
  obtain e' where e': "0 < e'" and gh: "g holomorphic_on ball (f x) e'" using g
lp15@61609
   559
    by (metis analytic_on_def g image_eqI x)
lp15@56215
   560
  have "isCont f x"
lp15@62534
   561
    by (metis analytic_on_imp_differentiable_at field_differentiable_imp_continuous_at f x)
lp15@56215
   562
  with e' obtain d where d: "0 < d" and fd: "f ` ball x d \<subseteq> ball (f x) e'"
lp15@56215
   563
     by (auto simp: continuous_at_ball)
lp15@61609
   564
  have "g \<circ> f holomorphic_on ball x (min d e)"
lp15@56215
   565
    apply (rule holomorphic_on_compose)
lp15@56215
   566
    apply (metis fh holomorphic_on_subset min.bounded_iff order_refl subset_ball)
lp15@56215
   567
    by (metis fd gh holomorphic_on_subset image_mono min.cobounded1 subset_ball)
lp15@56215
   568
  then show "\<exists>e>0. g \<circ> f holomorphic_on ball x e"
lp15@61609
   569
    by (metis d e min_less_iff_conj)
lp15@56215
   570
qed
lp15@56215
   571
lp15@56215
   572
lemma analytic_on_compose_gen:
lp15@56215
   573
  "f analytic_on s \<Longrightarrow> g analytic_on t \<Longrightarrow> (\<And>z. z \<in> s \<Longrightarrow> f z \<in> t)
lp15@56215
   574
             \<Longrightarrow> g o f analytic_on s"
lp15@56215
   575
by (metis analytic_on_compose analytic_on_subset image_subset_iff)
lp15@56215
   576
lp15@65587
   577
lemma analytic_on_neg [analytic_intros]:
lp15@56215
   578
  "f analytic_on s \<Longrightarrow> (\<lambda>z. -(f z)) analytic_on s"
lp15@56215
   579
by (metis analytic_on_holomorphic holomorphic_on_minus)
lp15@56215
   580
lp15@65587
   581
lemma analytic_on_add [analytic_intros]:
lp15@56215
   582
  assumes f: "f analytic_on s"
lp15@56215
   583
      and g: "g analytic_on s"
lp15@56215
   584
    shows "(\<lambda>z. f z + g z) analytic_on s"
lp15@56215
   585
unfolding analytic_on_def
lp15@56215
   586
proof (intro ballI)
lp15@56215
   587
  fix z
lp15@56215
   588
  assume z: "z \<in> s"
lp15@56215
   589
  then obtain e where e: "0 < e" and fh: "f holomorphic_on ball z e" using f
lp15@56215
   590
    by (metis analytic_on_def)
lp15@56215
   591
  obtain e' where e': "0 < e'" and gh: "g holomorphic_on ball z e'" using g
lp15@61609
   592
    by (metis analytic_on_def g z)
lp15@61609
   593
  have "(\<lambda>z. f z + g z) holomorphic_on ball z (min e e')"
lp15@61609
   594
    apply (rule holomorphic_on_add)
lp15@56215
   595
    apply (metis fh holomorphic_on_subset min.bounded_iff order_refl subset_ball)
lp15@56215
   596
    by (metis gh holomorphic_on_subset min.bounded_iff order_refl subset_ball)
lp15@56215
   597
  then show "\<exists>e>0. (\<lambda>z. f z + g z) holomorphic_on ball z e"
lp15@56215
   598
    by (metis e e' min_less_iff_conj)
lp15@56215
   599
qed
lp15@56215
   600
lp15@65587
   601
lemma analytic_on_diff [analytic_intros]:
lp15@56215
   602
  assumes f: "f analytic_on s"
lp15@56215
   603
      and g: "g analytic_on s"
lp15@56215
   604
    shows "(\<lambda>z. f z - g z) analytic_on s"
lp15@56215
   605
unfolding analytic_on_def
lp15@56215
   606
proof (intro ballI)
lp15@56215
   607
  fix z
lp15@56215
   608
  assume z: "z \<in> s"
lp15@56215
   609
  then obtain e where e: "0 < e" and fh: "f holomorphic_on ball z e" using f
lp15@56215
   610
    by (metis analytic_on_def)
lp15@56215
   611
  obtain e' where e': "0 < e'" and gh: "g holomorphic_on ball z e'" using g
lp15@61609
   612
    by (metis analytic_on_def g z)
lp15@61609
   613
  have "(\<lambda>z. f z - g z) holomorphic_on ball z (min e e')"
lp15@61609
   614
    apply (rule holomorphic_on_diff)
lp15@56215
   615
    apply (metis fh holomorphic_on_subset min.bounded_iff order_refl subset_ball)
lp15@56215
   616
    by (metis gh holomorphic_on_subset min.bounded_iff order_refl subset_ball)
lp15@56215
   617
  then show "\<exists>e>0. (\<lambda>z. f z - g z) holomorphic_on ball z e"
lp15@56215
   618
    by (metis e e' min_less_iff_conj)
lp15@56215
   619
qed
lp15@56215
   620
lp15@65587
   621
lemma analytic_on_mult [analytic_intros]:
lp15@56215
   622
  assumes f: "f analytic_on s"
lp15@56215
   623
      and g: "g analytic_on s"
lp15@56215
   624
    shows "(\<lambda>z. f z * g z) analytic_on s"
lp15@56215
   625
unfolding analytic_on_def
lp15@56215
   626
proof (intro ballI)
lp15@56215
   627
  fix z
lp15@56215
   628
  assume z: "z \<in> s"
lp15@56215
   629
  then obtain e where e: "0 < e" and fh: "f holomorphic_on ball z e" using f
lp15@56215
   630
    by (metis analytic_on_def)
lp15@56215
   631
  obtain e' where e': "0 < e'" and gh: "g holomorphic_on ball z e'" using g
lp15@61609
   632
    by (metis analytic_on_def g z)
lp15@61609
   633
  have "(\<lambda>z. f z * g z) holomorphic_on ball z (min e e')"
lp15@61609
   634
    apply (rule holomorphic_on_mult)
lp15@56215
   635
    apply (metis fh holomorphic_on_subset min.bounded_iff order_refl subset_ball)
lp15@56215
   636
    by (metis gh holomorphic_on_subset min.bounded_iff order_refl subset_ball)
lp15@56215
   637
  then show "\<exists>e>0. (\<lambda>z. f z * g z) holomorphic_on ball z e"
lp15@56215
   638
    by (metis e e' min_less_iff_conj)
lp15@56215
   639
qed
lp15@56215
   640
lp15@65587
   641
lemma analytic_on_inverse [analytic_intros]:
lp15@56215
   642
  assumes f: "f analytic_on s"
lp15@56215
   643
      and nz: "(\<And>z. z \<in> s \<Longrightarrow> f z \<noteq> 0)"
lp15@56215
   644
    shows "(\<lambda>z. inverse (f z)) analytic_on s"
lp15@56215
   645
unfolding analytic_on_def
lp15@56215
   646
proof (intro ballI)
lp15@56215
   647
  fix z
lp15@56215
   648
  assume z: "z \<in> s"
lp15@56215
   649
  then obtain e where e: "0 < e" and fh: "f holomorphic_on ball z e" using f
lp15@56215
   650
    by (metis analytic_on_def)
lp15@56215
   651
  have "continuous_on (ball z e) f"
lp15@56215
   652
    by (metis fh holomorphic_on_imp_continuous_on)
lp15@61609
   653
  then obtain e' where e': "0 < e'" and nz': "\<And>y. dist z y < e' \<Longrightarrow> f y \<noteq> 0"
lp15@61609
   654
    by (metis Topology_Euclidean_Space.open_ball centre_in_ball continuous_on_open_avoid e z nz)
lp15@61609
   655
  have "(\<lambda>z. inverse (f z)) holomorphic_on ball z (min e e')"
lp15@56215
   656
    apply (rule holomorphic_on_inverse)
lp15@56215
   657
    apply (metis fh holomorphic_on_subset min.cobounded2 min.commute subset_ball)
lp15@61609
   658
    by (metis nz' mem_ball min_less_iff_conj)
lp15@56215
   659
  then show "\<exists>e>0. (\<lambda>z. inverse (f z)) holomorphic_on ball z e"
lp15@56215
   660
    by (metis e e' min_less_iff_conj)
lp15@56215
   661
qed
lp15@56215
   662
lp15@65587
   663
lemma analytic_on_divide [analytic_intros]:
lp15@56215
   664
  assumes f: "f analytic_on s"
lp15@56215
   665
      and g: "g analytic_on s"
lp15@56215
   666
      and nz: "(\<And>z. z \<in> s \<Longrightarrow> g z \<noteq> 0)"
lp15@56215
   667
    shows "(\<lambda>z. f z / g z) analytic_on s"
lp15@56215
   668
unfolding divide_inverse
lp15@56215
   669
by (metis analytic_on_inverse analytic_on_mult f g nz)
lp15@56215
   670
lp15@65587
   671
lemma analytic_on_power [analytic_intros]:
lp15@56215
   672
  "f analytic_on s \<Longrightarrow> (\<lambda>z. (f z) ^ n) analytic_on s"
lp15@65587
   673
by (induct n) (auto simp: analytic_on_mult)
lp15@56215
   674
lp15@65587
   675
lemma analytic_on_sum [analytic_intros]:
nipkow@64267
   676
  "(\<And>i. i \<in> I \<Longrightarrow> (f i) analytic_on s) \<Longrightarrow> (\<lambda>x. sum (\<lambda>i. f i x) I) analytic_on s"
hoelzl@56369
   677
  by (induct I rule: infinite_finite_induct) (auto simp: analytic_on_const analytic_on_add)
lp15@56215
   678
lp15@62408
   679
lemma deriv_left_inverse:
lp15@62408
   680
  assumes "f holomorphic_on S" and "g holomorphic_on T"
lp15@62408
   681
      and "open S" and "open T"
lp15@62408
   682
      and "f ` S \<subseteq> T"
lp15@62408
   683
      and [simp]: "\<And>z. z \<in> S \<Longrightarrow> g (f z) = z"
lp15@62408
   684
      and "w \<in> S"
lp15@62408
   685
    shows "deriv f w * deriv g (f w) = 1"
lp15@62408
   686
proof -
lp15@62408
   687
  have "deriv f w * deriv g (f w) = deriv g (f w) * deriv f w"
lp15@62408
   688
    by (simp add: algebra_simps)
lp15@62408
   689
  also have "... = deriv (g o f) w"
lp15@62408
   690
    using assms
lp15@62408
   691
    by (metis analytic_on_imp_differentiable_at analytic_on_open complex_derivative_chain image_subset_iff)
lp15@62408
   692
  also have "... = deriv id w"
lp15@62408
   693
    apply (rule complex_derivative_transform_within_open [where s=S])
lp15@62408
   694
    apply (rule assms holomorphic_on_compose_gen holomorphic_intros)+
lp15@62408
   695
    apply simp
lp15@62408
   696
    done
lp15@62408
   697
  also have "... = 1"
lp15@62408
   698
    by simp
lp15@62408
   699
  finally show ?thesis .
lp15@62408
   700
qed
lp15@62408
   701
lp15@62408
   702
subsection\<open>analyticity at a point\<close>
lp15@56215
   703
lp15@56215
   704
lemma analytic_at_ball:
lp15@56215
   705
  "f analytic_on {z} \<longleftrightarrow> (\<exists>e. 0<e \<and> f holomorphic_on ball z e)"
lp15@56215
   706
by (metis analytic_on_def singleton_iff)
lp15@56215
   707
lp15@56215
   708
lemma analytic_at:
lp15@56215
   709
    "f analytic_on {z} \<longleftrightarrow> (\<exists>s. open s \<and> z \<in> s \<and> f holomorphic_on s)"
lp15@56215
   710
by (metis analytic_on_holomorphic empty_subsetI insert_subset)
lp15@56215
   711
lp15@56215
   712
lemma analytic_on_analytic_at:
lp15@56215
   713
    "f analytic_on s \<longleftrightarrow> (\<forall>z \<in> s. f analytic_on {z})"
lp15@56215
   714
by (metis analytic_at_ball analytic_on_def)
lp15@56215
   715
lp15@56215
   716
lemma analytic_at_two:
lp15@56215
   717
  "f analytic_on {z} \<and> g analytic_on {z} \<longleftrightarrow>
lp15@56215
   718
   (\<exists>s. open s \<and> z \<in> s \<and> f holomorphic_on s \<and> g holomorphic_on s)"
lp15@56215
   719
  (is "?lhs = ?rhs")
lp15@61609
   720
proof
lp15@56215
   721
  assume ?lhs
lp15@61609
   722
  then obtain s t
lp15@56215
   723
    where st: "open s" "z \<in> s" "f holomorphic_on s"
lp15@56215
   724
              "open t" "z \<in> t" "g holomorphic_on t"
lp15@56215
   725
    by (auto simp: analytic_at)
lp15@56215
   726
  show ?rhs
lp15@56215
   727
    apply (rule_tac x="s \<inter> t" in exI)
lp15@56215
   728
    using st
lp15@56215
   729
    apply (auto simp: Diff_subset holomorphic_on_subset)
lp15@56215
   730
    done
lp15@56215
   731
next
lp15@61609
   732
  assume ?rhs
lp15@56215
   733
  then show ?lhs
lp15@56215
   734
    by (force simp add: analytic_at)
lp15@56215
   735
qed
lp15@56215
   736
wenzelm@60420
   737
subsection\<open>Combining theorems for derivative with ``analytic at'' hypotheses\<close>
lp15@56215
   738
lp15@61609
   739
lemma
lp15@56215
   740
  assumes "f analytic_on {z}" "g analytic_on {z}"
hoelzl@56370
   741
  shows complex_derivative_add_at: "deriv (\<lambda>w. f w + g w) z = deriv f z + deriv g z"
hoelzl@56370
   742
    and complex_derivative_diff_at: "deriv (\<lambda>w. f w - g w) z = deriv f z - deriv g z"
hoelzl@56370
   743
    and complex_derivative_mult_at: "deriv (\<lambda>w. f w * g w) z =
hoelzl@56370
   744
           f z * deriv g z + deriv f z * g z"
lp15@56215
   745
proof -
lp15@56215
   746
  obtain s where s: "open s" "z \<in> s" "f holomorphic_on s" "g holomorphic_on s"
lp15@56215
   747
    using assms by (metis analytic_at_two)
hoelzl@56370
   748
  show "deriv (\<lambda>w. f w + g w) z = deriv f z + deriv g z"
hoelzl@56370
   749
    apply (rule DERIV_imp_deriv [OF DERIV_add])
lp15@56215
   750
    using s
lp15@62534
   751
    apply (auto simp: holomorphic_on_open field_differentiable_def DERIV_deriv_iff_field_differentiable)
lp15@56215
   752
    done
hoelzl@56370
   753
  show "deriv (\<lambda>w. f w - g w) z = deriv f z - deriv g z"
hoelzl@56370
   754
    apply (rule DERIV_imp_deriv [OF DERIV_diff])
lp15@56215
   755
    using s
lp15@62534
   756
    apply (auto simp: holomorphic_on_open field_differentiable_def DERIV_deriv_iff_field_differentiable)
lp15@56215
   757
    done
hoelzl@56370
   758
  show "deriv (\<lambda>w. f w * g w) z = f z * deriv g z + deriv f z * g z"
hoelzl@56370
   759
    apply (rule DERIV_imp_deriv [OF DERIV_mult'])
lp15@56215
   760
    using s
lp15@62534
   761
    apply (auto simp: holomorphic_on_open field_differentiable_def DERIV_deriv_iff_field_differentiable)
lp15@56215
   762
    done
lp15@56215
   763
qed
lp15@56215
   764
lp15@62534
   765
lemma deriv_cmult_at:
hoelzl@56370
   766
  "f analytic_on {z} \<Longrightarrow>  deriv (\<lambda>w. c * f w) z = c * deriv f z"
lp15@61848
   767
by (auto simp: complex_derivative_mult_at deriv_const analytic_on_const)
lp15@56215
   768
lp15@62534
   769
lemma deriv_cmult_right_at:
hoelzl@56370
   770
  "f analytic_on {z} \<Longrightarrow>  deriv (\<lambda>w. f w * c) z = deriv f z * c"
lp15@61848
   771
by (auto simp: complex_derivative_mult_at deriv_const analytic_on_const)
lp15@56215
   772
wenzelm@60420
   773
subsection\<open>Complex differentiation of sequences and series\<close>
lp15@56215
   774
eberlm@61531
   775
(* TODO: Could probably be simplified using Uniform_Limit *)
lp15@56215
   776
lemma has_complex_derivative_sequence:
lp15@56215
   777
  fixes s :: "complex set"
lp15@56215
   778
  assumes cvs: "convex s"
lp15@56215
   779
      and df:  "\<And>n x. x \<in> s \<Longrightarrow> (f n has_field_derivative f' n x) (at x within s)"
lp15@56215
   780
      and conv: "\<And>e. 0 < e \<Longrightarrow> \<exists>N. \<forall>n x. n \<ge> N \<longrightarrow> x \<in> s \<longrightarrow> norm (f' n x - g' x) \<le> e"
wenzelm@61973
   781
      and "\<exists>x l. x \<in> s \<and> ((\<lambda>n. f n x) \<longlongrightarrow> l) sequentially"
wenzelm@61973
   782
    shows "\<exists>g. \<forall>x \<in> s. ((\<lambda>n. f n x) \<longlongrightarrow> g x) sequentially \<and>
lp15@56215
   783
                       (g has_field_derivative (g' x)) (at x within s)"
lp15@56215
   784
proof -
wenzelm@61973
   785
  from assms obtain x l where x: "x \<in> s" and tf: "((\<lambda>n. f n x) \<longlongrightarrow> l) sequentially"
lp15@56215
   786
    by blast
lp15@56215
   787
  { fix e::real assume e: "e > 0"
lp15@56215
   788
    then obtain N where N: "\<forall>n\<ge>N. \<forall>x. x \<in> s \<longrightarrow> cmod (f' n x - g' x) \<le> e"
lp15@61609
   789
      by (metis conv)
lp15@56215
   790
    have "\<exists>N. \<forall>n\<ge>N. \<forall>x\<in>s. \<forall>h. cmod (f' n x * h - g' x * h) \<le> e * cmod h"
lp15@56215
   791
    proof (rule exI [of _ N], clarify)
lp15@56215
   792
      fix n y h
lp15@56215
   793
      assume "N \<le> n" "y \<in> s"
lp15@56215
   794
      then have "cmod (f' n y - g' y) \<le> e"
lp15@56215
   795
        by (metis N)
lp15@56215
   796
      then have "cmod h * cmod (f' n y - g' y) \<le> cmod h * e"
lp15@56215
   797
        by (auto simp: antisym_conv2 mult_le_cancel_left norm_triangle_ineq2)
lp15@56215
   798
      then show "cmod (f' n y * h - g' y * h) \<le> e * cmod h"
lp15@56215
   799
        by (simp add: norm_mult [symmetric] field_simps)
lp15@56215
   800
    qed
lp15@56215
   801
  } note ** = this
lp15@56215
   802
  show ?thesis
lp15@56215
   803
  unfolding has_field_derivative_def
lp15@56215
   804
  proof (rule has_derivative_sequence [OF cvs _ _ x])
lp15@56215
   805
    show "\<forall>n. \<forall>x\<in>s. (f n has_derivative (op * (f' n x))) (at x within s)"
lp15@56215
   806
      by (metis has_field_derivative_def df)
wenzelm@61969
   807
  next show "(\<lambda>n. f n x) \<longlonglongrightarrow> l"
lp15@56215
   808
    by (rule tf)
lp15@56215
   809
  next show "\<forall>e>0. \<exists>N. \<forall>n\<ge>N. \<forall>x\<in>s. \<forall>h. cmod (f' n x * h - g' x * h) \<le> e * cmod h"
lp15@56215
   810
    by (blast intro: **)
lp15@56215
   811
  qed
lp15@56215
   812
qed
lp15@56215
   813
lp15@56215
   814
lemma has_complex_derivative_series:
lp15@56215
   815
  fixes s :: "complex set"
lp15@56215
   816
  assumes cvs: "convex s"
lp15@56215
   817
      and df:  "\<And>n x. x \<in> s \<Longrightarrow> (f n has_field_derivative f' n x) (at x within s)"
lp15@61609
   818
      and conv: "\<And>e. 0 < e \<Longrightarrow> \<exists>N. \<forall>n x. n \<ge> N \<longrightarrow> x \<in> s
lp15@56215
   819
                \<longrightarrow> cmod ((\<Sum>i<n. f' i x) - g' x) \<le> e"
lp15@56215
   820
      and "\<exists>x l. x \<in> s \<and> ((\<lambda>n. f n x) sums l)"
lp15@56215
   821
    shows "\<exists>g. \<forall>x \<in> s. ((\<lambda>n. f n x) sums g x) \<and> ((g has_field_derivative g' x) (at x within s))"
lp15@56215
   822
proof -
lp15@56215
   823
  from assms obtain x l where x: "x \<in> s" and sf: "((\<lambda>n. f n x) sums l)"
lp15@56215
   824
    by blast
lp15@56215
   825
  { fix e::real assume e: "e > 0"
lp15@61609
   826
    then obtain N where N: "\<forall>n x. n \<ge> N \<longrightarrow> x \<in> s
lp15@56215
   827
            \<longrightarrow> cmod ((\<Sum>i<n. f' i x) - g' x) \<le> e"
lp15@61609
   828
      by (metis conv)
lp15@56215
   829
    have "\<exists>N. \<forall>n\<ge>N. \<forall>x\<in>s. \<forall>h. cmod ((\<Sum>i<n. h * f' i x) - g' x * h) \<le> e * cmod h"
lp15@56215
   830
    proof (rule exI [of _ N], clarify)
lp15@56215
   831
      fix n y h
lp15@56215
   832
      assume "N \<le> n" "y \<in> s"
lp15@56215
   833
      then have "cmod ((\<Sum>i<n. f' i y) - g' y) \<le> e"
lp15@56215
   834
        by (metis N)
lp15@56215
   835
      then have "cmod h * cmod ((\<Sum>i<n. f' i y) - g' y) \<le> cmod h * e"
lp15@56215
   836
        by (auto simp: antisym_conv2 mult_le_cancel_left norm_triangle_ineq2)
lp15@56215
   837
      then show "cmod ((\<Sum>i<n. h * f' i y) - g' y * h) \<le> e * cmod h"
nipkow@64267
   838
        by (simp add: norm_mult [symmetric] field_simps sum_distrib_left)
lp15@56215
   839
    qed
lp15@56215
   840
  } note ** = this
lp15@56215
   841
  show ?thesis
lp15@56215
   842
  unfolding has_field_derivative_def
lp15@56215
   843
  proof (rule has_derivative_series [OF cvs _ _ x])
lp15@56215
   844
    fix n x
lp15@56215
   845
    assume "x \<in> s"
lp15@56215
   846
    then show "((f n) has_derivative (\<lambda>z. z * f' n x)) (at x within s)"
lp15@56215
   847
      by (metis df has_field_derivative_def mult_commute_abs)
lp15@56215
   848
  next show " ((\<lambda>n. f n x) sums l)"
lp15@56215
   849
    by (rule sf)
lp15@56215
   850
  next show "\<forall>e>0. \<exists>N. \<forall>n\<ge>N. \<forall>x\<in>s. \<forall>h. cmod ((\<Sum>i<n. h * f' i x) - g' x * h) \<le> e * cmod h"
lp15@56215
   851
    by (blast intro: **)
lp15@56215
   852
  qed
lp15@56215
   853
qed
lp15@56215
   854
eberlm@61531
   855
lp15@62534
   856
lemma field_differentiable_series:
eberlm@61531
   857
  fixes f :: "nat \<Rightarrow> complex \<Rightarrow> complex"
eberlm@61531
   858
  assumes "convex s" "open s"
eberlm@61531
   859
  assumes "\<And>n x. x \<in> s \<Longrightarrow> (f n has_field_derivative f' n x) (at x)"
eberlm@61531
   860
  assumes "uniformly_convergent_on s (\<lambda>n x. \<Sum>i<n. f' i x)"
eberlm@61531
   861
  assumes "x0 \<in> s" "summable (\<lambda>n. f n x0)" and x: "x \<in> s"
lp15@62534
   862
  shows   "summable (\<lambda>n. f n x)" and "(\<lambda>x. \<Sum>n. f n x) field_differentiable (at x)"
eberlm@61531
   863
proof -
eberlm@61531
   864
  from assms(4) obtain g' where A: "uniform_limit s (\<lambda>n x. \<Sum>i<n. f' i x) g' sequentially"
eberlm@61531
   865
    unfolding uniformly_convergent_on_def by blast
wenzelm@61808
   866
  from x and \<open>open s\<close> have s: "at x within s = at x" by (rule at_within_open)
eberlm@61531
   867
  have "\<exists>g. \<forall>x\<in>s. (\<lambda>n. f n x) sums g x \<and> (g has_field_derivative g' x) (at x within s)"
eberlm@61531
   868
    by (intro has_field_derivative_series[of s f f' g' x0] assms A has_field_derivative_at_within)
eberlm@61531
   869
  then obtain g where g: "\<And>x. x \<in> s \<Longrightarrow> (\<lambda>n. f n x) sums g x"
eberlm@61531
   870
    "\<And>x. x \<in> s \<Longrightarrow> (g has_field_derivative g' x) (at x within s)" by blast
eberlm@61531
   871
  from g[OF x] show "summable (\<lambda>n. f n x)" by (auto simp: summable_def)
eberlm@61531
   872
  from g(2)[OF x] have g': "(g has_derivative op * (g' x)) (at x)"
eberlm@61531
   873
    by (simp add: has_field_derivative_def s)
eberlm@61531
   874
  have "((\<lambda>x. \<Sum>n. f n x) has_derivative op * (g' x)) (at x)"
paulson@62087
   875
    by (rule has_derivative_transform_within_open[OF g' \<open>open s\<close> x])
eberlm@61531
   876
       (insert g, auto simp: sums_iff)
lp15@62534
   877
  thus "(\<lambda>x. \<Sum>n. f n x) field_differentiable (at x)" unfolding differentiable_def
lp15@62534
   878
    by (auto simp: summable_def field_differentiable_def has_field_derivative_def)
eberlm@61531
   879
qed
eberlm@61531
   880
lp15@62534
   881
lemma field_differentiable_series':
eberlm@61531
   882
  fixes f :: "nat \<Rightarrow> complex \<Rightarrow> complex"
eberlm@61531
   883
  assumes "convex s" "open s"
eberlm@61531
   884
  assumes "\<And>n x. x \<in> s \<Longrightarrow> (f n has_field_derivative f' n x) (at x)"
eberlm@61531
   885
  assumes "uniformly_convergent_on s (\<lambda>n x. \<Sum>i<n. f' i x)"
eberlm@61531
   886
  assumes "x0 \<in> s" "summable (\<lambda>n. f n x0)"
lp15@62534
   887
  shows   "(\<lambda>x. \<Sum>n. f n x) field_differentiable (at x0)"
lp15@62534
   888
  using field_differentiable_series[OF assms, of x0] \<open>x0 \<in> s\<close> by blast+
eberlm@61531
   889
wenzelm@60420
   890
subsection\<open>Bound theorem\<close>
lp15@56215
   891
lp15@62534
   892
lemma field_differentiable_bound:
lp15@56215
   893
  fixes s :: "complex set"
lp15@56215
   894
  assumes cvs: "convex s"
lp15@56215
   895
      and df:  "\<And>z. z \<in> s \<Longrightarrow> (f has_field_derivative f' z) (at z within s)"
lp15@56215
   896
      and dn:  "\<And>z. z \<in> s \<Longrightarrow> norm (f' z) \<le> B"
lp15@56215
   897
      and "x \<in> s"  "y \<in> s"
lp15@56215
   898
    shows "norm(f x - f y) \<le> B * norm(x - y)"
lp15@56215
   899
  apply (rule differentiable_bound [OF cvs])
huffman@56223
   900
  apply (rule ballI, erule df [unfolded has_field_derivative_def])
huffman@56223
   901
  apply (rule ballI, rule onorm_le, simp add: norm_mult mult_right_mono dn)
huffman@56223
   902
  apply fact
huffman@56223
   903
  apply fact
lp15@56215
   904
  done
lp15@56215
   905
lp15@62408
   906
subsection\<open>Inverse function theorem for complex derivatives\<close>
lp15@56215
   907
lp15@56215
   908
lemma has_complex_derivative_inverse_basic:
lp15@56215
   909
  fixes f :: "complex \<Rightarrow> complex"
lp15@56215
   910
  shows "DERIV f (g y) :> f' \<Longrightarrow>
lp15@56215
   911
        f' \<noteq> 0 \<Longrightarrow>
lp15@56215
   912
        continuous (at y) g \<Longrightarrow>
lp15@56215
   913
        open t \<Longrightarrow>
lp15@56215
   914
        y \<in> t \<Longrightarrow>
lp15@56215
   915
        (\<And>z. z \<in> t \<Longrightarrow> f (g z) = z)
lp15@56215
   916
        \<Longrightarrow> DERIV g y :> inverse (f')"
lp15@56215
   917
  unfolding has_field_derivative_def
lp15@56215
   918
  apply (rule has_derivative_inverse_basic)
lp15@56215
   919
  apply (auto simp:  bounded_linear_mult_right)
lp15@56215
   920
  done
lp15@56215
   921
lp15@56215
   922
(*Used only once, in Multivariate/cauchy.ml. *)
lp15@56215
   923
lemma has_complex_derivative_inverse_strong:
lp15@56215
   924
  fixes f :: "complex \<Rightarrow> complex"
lp15@56215
   925
  shows "DERIV f x :> f' \<Longrightarrow>
lp15@56215
   926
         f' \<noteq> 0 \<Longrightarrow>
lp15@56215
   927
         open s \<Longrightarrow>
lp15@56215
   928
         x \<in> s \<Longrightarrow>
lp15@56215
   929
         continuous_on s f \<Longrightarrow>
lp15@56215
   930
         (\<And>z. z \<in> s \<Longrightarrow> g (f z) = z)
lp15@56215
   931
         \<Longrightarrow> DERIV g (f x) :> inverse (f')"
lp15@56215
   932
  unfolding has_field_derivative_def
lp15@56215
   933
  apply (rule has_derivative_inverse_strong [of s x f g ])
lp15@56215
   934
  by auto
lp15@56215
   935
lp15@56215
   936
lemma has_complex_derivative_inverse_strong_x:
lp15@56215
   937
  fixes f :: "complex \<Rightarrow> complex"
lp15@56215
   938
  shows  "DERIV f (g y) :> f' \<Longrightarrow>
lp15@56215
   939
          f' \<noteq> 0 \<Longrightarrow>
lp15@56215
   940
          open s \<Longrightarrow>
lp15@56215
   941
          continuous_on s f \<Longrightarrow>
lp15@56215
   942
          g y \<in> s \<Longrightarrow> f(g y) = y \<Longrightarrow>
lp15@56215
   943
          (\<And>z. z \<in> s \<Longrightarrow> g (f z) = z)
lp15@56215
   944
          \<Longrightarrow> DERIV g y :> inverse (f')"
lp15@56215
   945
  unfolding has_field_derivative_def
lp15@56215
   946
  apply (rule has_derivative_inverse_strong_x [of s g y f])
lp15@56215
   947
  by auto
lp15@56215
   948
wenzelm@60420
   949
subsection \<open>Taylor on Complex Numbers\<close>
lp15@56215
   950
nipkow@64267
   951
lemma sum_Suc_reindex:
lp15@56215
   952
  fixes f :: "nat \<Rightarrow> 'a::ab_group_add"
nipkow@64267
   953
    shows  "sum f {0..n} = f 0 - f (Suc n) + sum (\<lambda>i. f (Suc i)) {0..n}"
lp15@56215
   954
by (induct n) auto
lp15@56215
   955
lp15@56215
   956
lemma complex_taylor:
lp15@61609
   957
  assumes s: "convex s"
lp15@56215
   958
      and f: "\<And>i x. x \<in> s \<Longrightarrow> i \<le> n \<Longrightarrow> (f i has_field_derivative f (Suc i) x) (at x within s)"
lp15@56215
   959
      and B: "\<And>x. x \<in> s \<Longrightarrow> cmod (f (Suc n) x) \<le> B"
lp15@56215
   960
      and w: "w \<in> s"
lp15@56215
   961
      and z: "z \<in> s"
lp15@59730
   962
    shows "cmod(f 0 z - (\<Sum>i\<le>n. f i w * (z-w) ^ i / (fact i)))
lp15@56215
   963
          \<le> B * cmod(z - w)^(Suc n) / fact n"
lp15@56215
   964
proof -
lp15@56215
   965
  have wzs: "closed_segment w z \<subseteq> s" using assms
lp15@56215
   966
    by (metis convex_contains_segment)
lp15@56215
   967
  { fix u
lp15@56215
   968
    assume "u \<in> closed_segment w z"
lp15@56215
   969
    then have "u \<in> s"
lp15@56215
   970
      by (metis wzs subsetD)
lp15@59730
   971
    have "(\<Sum>i\<le>n. f i u * (- of_nat i * (z-u)^(i - 1)) / (fact i) +
lp15@61609
   972
                      f (Suc i) u * (z-u)^i / (fact i)) =
lp15@59730
   973
              f (Suc n) u * (z-u) ^ n / (fact n)"
lp15@56215
   974
    proof (induction n)
lp15@56215
   975
      case 0 show ?case by simp
lp15@56215
   976
    next
lp15@56215
   977
      case (Suc n)
lp15@59730
   978
      have "(\<Sum>i\<le>Suc n. f i u * (- of_nat i * (z-u) ^ (i - 1)) / (fact i) +
lp15@61609
   979
                             f (Suc i) u * (z-u) ^ i / (fact i)) =
lp15@59730
   980
           f (Suc n) u * (z-u) ^ n / (fact n) +
lp15@59730
   981
           f (Suc (Suc n)) u * ((z-u) * (z-u) ^ n) / (fact (Suc n)) -
lp15@59730
   982
           f (Suc n) u * ((1 + of_nat n) * (z-u) ^ n) / (fact (Suc n))"
hoelzl@56479
   983
        using Suc by simp
lp15@59730
   984
      also have "... = f (Suc (Suc n)) u * (z-u) ^ Suc n / (fact (Suc n))"
lp15@56215
   985
      proof -
lp15@59730
   986
        have "(fact(Suc n)) *
lp15@59730
   987
             (f(Suc n) u *(z-u) ^ n / (fact n) +
lp15@59730
   988
               f(Suc(Suc n)) u *((z-u) *(z-u) ^ n) / (fact(Suc n)) -
lp15@59730
   989
               f(Suc n) u *((1 + of_nat n) *(z-u) ^ n) / (fact(Suc n))) =
lp15@59730
   990
            ((fact(Suc n)) *(f(Suc n) u *(z-u) ^ n)) / (fact n) +
lp15@59730
   991
            ((fact(Suc n)) *(f(Suc(Suc n)) u *((z-u) *(z-u) ^ n)) / (fact(Suc n))) -
lp15@59730
   992
            ((fact(Suc n)) *(f(Suc n) u *(of_nat(Suc n) *(z-u) ^ n))) / (fact(Suc n))"
haftmann@63367
   993
          by (simp add: algebra_simps del: fact_Suc)
lp15@59730
   994
        also have "... = ((fact (Suc n)) * (f (Suc n) u * (z-u) ^ n)) / (fact n) +
lp15@59730
   995
                         (f (Suc (Suc n)) u * ((z-u) * (z-u) ^ n)) -
lp15@59730
   996
                         (f (Suc n) u * ((1 + of_nat n) * (z-u) ^ n))"
haftmann@63367
   997
          by (simp del: fact_Suc)
lp15@59730
   998
        also have "... = (of_nat (Suc n) * (f (Suc n) u * (z-u) ^ n)) +
lp15@59730
   999
                         (f (Suc (Suc n)) u * ((z-u) * (z-u) ^ n)) -
lp15@59730
  1000
                         (f (Suc n) u * ((1 + of_nat n) * (z-u) ^ n))"
haftmann@63367
  1001
          by (simp only: fact_Suc of_nat_mult ac_simps) simp
lp15@56215
  1002
        also have "... = f (Suc (Suc n)) u * ((z-u) * (z-u) ^ n)"
lp15@56215
  1003
          by (simp add: algebra_simps)
lp15@56215
  1004
        finally show ?thesis
haftmann@63367
  1005
        by (simp add: mult_left_cancel [where c = "(fact (Suc n))", THEN iffD1] del: fact_Suc)
lp15@56215
  1006
      qed
lp15@56215
  1007
      finally show ?case .
lp15@56215
  1008
    qed
lp15@61609
  1009
    then have "((\<lambda>v. (\<Sum>i\<le>n. f i v * (z - v)^i / (fact i)))
lp15@59730
  1010
                has_field_derivative f (Suc n) u * (z-u) ^ n / (fact n))
lp15@56215
  1011
               (at u within s)"
hoelzl@56381
  1012
      apply (intro derivative_eq_intros)
wenzelm@60420
  1013
      apply (blast intro: assms \<open>u \<in> s\<close>)
lp15@56215
  1014
      apply (rule refl)+
lp15@56215
  1015
      apply (auto simp: field_simps)
lp15@56215
  1016
      done
lp15@56215
  1017
  } note sum_deriv = this
lp15@56215
  1018
  { fix u
lp15@56215
  1019
    assume u: "u \<in> closed_segment w z"
lp15@56215
  1020
    then have us: "u \<in> s"
lp15@56215
  1021
      by (metis wzs subsetD)
lp15@56215
  1022
    have "cmod (f (Suc n) u) * cmod (z - u) ^ n \<le> cmod (f (Suc n) u) * cmod (u - z) ^ n"
lp15@56215
  1023
      by (metis norm_minus_commute order_refl)
lp15@56215
  1024
    also have "... \<le> cmod (f (Suc n) u) * cmod (z - w) ^ n"
lp15@56215
  1025
      by (metis mult_left_mono norm_ge_zero power_mono segment_bound [OF u])
lp15@56215
  1026
    also have "... \<le> B * cmod (z - w) ^ n"
lp15@56215
  1027
      by (metis norm_ge_zero zero_le_power mult_right_mono  B [OF us])
lp15@56215
  1028
    finally have "cmod (f (Suc n) u) * cmod (z - u) ^ n \<le> B * cmod (z - w) ^ n" .
lp15@56215
  1029
  } note cmod_bound = this
lp15@59730
  1030
  have "(\<Sum>i\<le>n. f i z * (z - z) ^ i / (fact i)) = (\<Sum>i\<le>n. (f i z / (fact i)) * 0 ^ i)"
lp15@56215
  1031
    by simp
lp15@59730
  1032
  also have "\<dots> = f 0 z / (fact 0)"
nipkow@64267
  1033
    by (subst sum_zero_power) simp
lp15@61609
  1034
  finally have "cmod (f 0 z - (\<Sum>i\<le>n. f i w * (z - w) ^ i / (fact i)))
lp15@59730
  1035
                \<le> cmod ((\<Sum>i\<le>n. f i w * (z - w) ^ i / (fact i)) -
lp15@59730
  1036
                        (\<Sum>i\<le>n. f i z * (z - z) ^ i / (fact i)))"
lp15@56215
  1037
    by (simp add: norm_minus_commute)
lp15@59730
  1038
  also have "... \<le> B * cmod (z - w) ^ n / (fact n) * cmod (w - z)"
lp15@62534
  1039
    apply (rule field_differentiable_bound
lp15@59730
  1040
      [where f' = "\<lambda>w. f (Suc n) w * (z - w)^n / (fact n)"
paulson@61518
  1041
         and s = "closed_segment w z", OF convex_closed_segment])
lp15@61609
  1042
    apply (auto simp: ends_in_segment DERIV_subset [OF sum_deriv wzs]
lp15@56215
  1043
                  norm_divide norm_mult norm_power divide_le_cancel cmod_bound)
lp15@56215
  1044
    done
lp15@59730
  1045
  also have "...  \<le> B * cmod (z - w) ^ Suc n / (fact n)"
lp15@61609
  1046
    by (simp add: algebra_simps norm_minus_commute)
lp15@56215
  1047
  finally show ?thesis .
lp15@56215
  1048
qed
lp15@56215
  1049
lp15@62408
  1050
text\<open>Something more like the traditional MVT for real components\<close>
hoelzl@56370
  1051
lp15@56238
  1052
lemma complex_mvt_line:
hoelzl@56369
  1053
  assumes "\<And>u. u \<in> closed_segment w z \<Longrightarrow> (f has_field_derivative f'(u)) (at u)"
paulson@61518
  1054
    shows "\<exists>u. u \<in> closed_segment w z \<and> Re(f z) - Re(f w) = Re(f'(u) * (z - w))"
lp15@56238
  1055
proof -
lp15@56238
  1056
  have twz: "\<And>t. (1 - t) *\<^sub>R w + t *\<^sub>R z = w + t *\<^sub>R (z - w)"
lp15@56238
  1057
    by (simp add: real_vector.scale_left_diff_distrib real_vector.scale_right_diff_distrib)
hoelzl@56381
  1058
  note assms[unfolded has_field_derivative_def, derivative_intros]
lp15@56238
  1059
  show ?thesis
lp15@56238
  1060
    apply (cut_tac mvt_simple
lp15@56238
  1061
                     [of 0 1 "Re o f o (\<lambda>t. (1 - t) *\<^sub>R w +  t *\<^sub>R z)"
lp15@56238
  1062
                      "\<lambda>u. Re o (\<lambda>h. f'((1 - u) *\<^sub>R w + u *\<^sub>R z) * h) o (\<lambda>t. t *\<^sub>R (z - w))"])
lp15@56238
  1063
    apply auto
lp15@56238
  1064
    apply (rule_tac x="(1 - x) *\<^sub>R w + x *\<^sub>R z" in exI)
paulson@61518
  1065
    apply (auto simp: closed_segment_def twz) []
paulson@61518
  1066
    apply (intro derivative_eq_intros has_derivative_at_within, simp_all)
hoelzl@56369
  1067
    apply (simp add: fun_eq_iff real_vector.scale_right_diff_distrib)
paulson@61518
  1068
    apply (force simp: twz closed_segment_def)
lp15@56238
  1069
    done
lp15@56238
  1070
qed
lp15@56238
  1071
lp15@56238
  1072
lemma complex_taylor_mvt:
lp15@56238
  1073
  assumes "\<And>i x. \<lbrakk>x \<in> closed_segment w z; i \<le> n\<rbrakk> \<Longrightarrow> ((f i) has_field_derivative f (Suc i) x) (at x)"
lp15@56238
  1074
    shows "\<exists>u. u \<in> closed_segment w z \<and>
lp15@56238
  1075
            Re (f 0 z) =
lp15@59730
  1076
            Re ((\<Sum>i = 0..n. f i w * (z - w) ^ i / (fact i)) +
lp15@59730
  1077
                (f (Suc n) u * (z-u)^n / (fact n)) * (z - w))"
lp15@56238
  1078
proof -
lp15@56238
  1079
  { fix u
lp15@56238
  1080
    assume u: "u \<in> closed_segment w z"
lp15@56238
  1081
    have "(\<Sum>i = 0..n.
lp15@56238
  1082
               (f (Suc i) u * (z-u) ^ i - of_nat i * (f i u * (z-u) ^ (i - Suc 0))) /
lp15@59730
  1083
               (fact i)) =
lp15@56238
  1084
          f (Suc 0) u -
lp15@56238
  1085
             (f (Suc (Suc n)) u * ((z-u) ^ Suc n) - (of_nat (Suc n)) * (z-u) ^ n * f (Suc n) u) /
lp15@59730
  1086
             (fact (Suc n)) +
lp15@56238
  1087
             (\<Sum>i = 0..n.
lp15@56238
  1088
                 (f (Suc (Suc i)) u * ((z-u) ^ Suc i) - of_nat (Suc i) * (f (Suc i) u * (z-u) ^ i)) /
lp15@59730
  1089
                 (fact (Suc i)))"
nipkow@64267
  1090
       by (subst sum_Suc_reindex) simp
lp15@56238
  1091
    also have "... = f (Suc 0) u -
lp15@56238
  1092
             (f (Suc (Suc n)) u * ((z-u) ^ Suc n) - (of_nat (Suc n)) * (z-u) ^ n * f (Suc n) u) /
lp15@59730
  1093
             (fact (Suc n)) +
lp15@56238
  1094
             (\<Sum>i = 0..n.
lp15@61609
  1095
                 f (Suc (Suc i)) u * ((z-u) ^ Suc i) / (fact (Suc i))  -
lp15@59730
  1096
                 f (Suc i) u * (z-u) ^ i / (fact i))"
haftmann@57514
  1097
      by (simp only: diff_divide_distrib fact_cancel ac_simps)
lp15@56238
  1098
    also have "... = f (Suc 0) u -
lp15@56238
  1099
             (f (Suc (Suc n)) u * (z-u) ^ Suc n - of_nat (Suc n) * (z-u) ^ n * f (Suc n) u) /
lp15@59730
  1100
             (fact (Suc n)) +
lp15@59730
  1101
             f (Suc (Suc n)) u * (z-u) ^ Suc n / (fact (Suc n)) - f (Suc 0) u"
nipkow@64267
  1102
      by (subst sum_Suc_diff) auto
lp15@59730
  1103
    also have "... = f (Suc n) u * (z-u) ^ n / (fact n)"
lp15@56238
  1104
      by (simp only: algebra_simps diff_divide_distrib fact_cancel)
lp15@61609
  1105
    finally have "(\<Sum>i = 0..n. (f (Suc i) u * (z - u) ^ i
lp15@59730
  1106
                             - of_nat i * (f i u * (z-u) ^ (i - Suc 0))) / (fact i)) =
lp15@59730
  1107
                  f (Suc n) u * (z - u) ^ n / (fact n)" .
lp15@59730
  1108
    then have "((\<lambda>u. \<Sum>i = 0..n. f i u * (z - u) ^ i / (fact i)) has_field_derivative
lp15@59730
  1109
                f (Suc n) u * (z - u) ^ n / (fact n))  (at u)"
hoelzl@56381
  1110
      apply (intro derivative_eq_intros)+
lp15@56238
  1111
      apply (force intro: u assms)
lp15@56238
  1112
      apply (rule refl)+
haftmann@57514
  1113
      apply (auto simp: ac_simps)
lp15@56238
  1114
      done
lp15@56238
  1115
  }
lp15@56238
  1116
  then show ?thesis
lp15@59730
  1117
    apply (cut_tac complex_mvt_line [of w z "\<lambda>u. \<Sum>i = 0..n. f i u * (z-u) ^ i / (fact i)"
lp15@59730
  1118
               "\<lambda>u. (f (Suc n) u * (z-u)^n / (fact n))"])
lp15@56238
  1119
    apply (auto simp add: intro: open_closed_segment)
lp15@56238
  1120
    done
lp15@56238
  1121
qed
lp15@56238
  1122
lp15@60017
  1123
wenzelm@60420
  1124
subsection \<open>Polynomal function extremal theorem, from HOL Light\<close>
lp15@60017
  1125
lp15@60017
  1126
lemma polyfun_extremal_lemma: (*COMPLEX_POLYFUN_EXTREMAL_LEMMA in HOL Light*)
lp15@60017
  1127
    fixes c :: "nat \<Rightarrow> 'a::real_normed_div_algebra"
lp15@60017
  1128
  assumes "0 < e"
lp15@60017
  1129
    shows "\<exists>M. \<forall>z. M \<le> norm(z) \<longrightarrow> norm (\<Sum>i\<le>n. c(i) * z^i) \<le> e * norm(z) ^ (Suc n)"
lp15@60017
  1130
proof (induct n)
lp15@60017
  1131
  case 0 with assms
lp15@60017
  1132
  show ?case
lp15@60017
  1133
    apply (rule_tac x="norm (c 0) / e" in exI)
lp15@60017
  1134
    apply (auto simp: field_simps)
lp15@60017
  1135
    done
lp15@60017
  1136
next
lp15@60017
  1137
  case (Suc n)
lp15@60017
  1138
  obtain M where M: "\<And>z. M \<le> norm z \<Longrightarrow> norm (\<Sum>i\<le>n. c i * z^i) \<le> e * norm z ^ Suc n"
lp15@60017
  1139
    using Suc assms by blast
lp15@60017
  1140
  show ?case
lp15@60017
  1141
  proof (rule exI [where x= "max M (1 + norm(c(Suc n)) / e)"], clarsimp simp del: power_Suc)
lp15@60017
  1142
    fix z::'a
lp15@60017
  1143
    assume z1: "M \<le> norm z" and "1 + norm (c (Suc n)) / e \<le> norm z"
lp15@60017
  1144
    then have z2: "e + norm (c (Suc n)) \<le> e * norm z"
lp15@60017
  1145
      using assms by (simp add: field_simps)
lp15@60017
  1146
    have "norm (\<Sum>i\<le>n. c i * z^i) \<le> e * norm z ^ Suc n"
lp15@60017
  1147
      using M [OF z1] by simp
lp15@60017
  1148
    then have "norm (\<Sum>i\<le>n. c i * z^i) + norm (c (Suc n) * z ^ Suc n) \<le> e * norm z ^ Suc n + norm (c (Suc n) * z ^ Suc n)"
lp15@60017
  1149
      by simp
lp15@60017
  1150
    then have "norm ((\<Sum>i\<le>n. c i * z^i) + c (Suc n) * z ^ Suc n) \<le> e * norm z ^ Suc n + norm (c (Suc n) * z ^ Suc n)"
lp15@60017
  1151
      by (blast intro: norm_triangle_le elim: )
lp15@60017
  1152
    also have "... \<le> (e + norm (c (Suc n))) * norm z ^ Suc n"
lp15@60017
  1153
      by (simp add: norm_power norm_mult algebra_simps)
lp15@60017
  1154
    also have "... \<le> (e * norm z) * norm z ^ Suc n"
lp15@60017
  1155
      by (metis z2 mult.commute mult_left_mono norm_ge_zero norm_power)
lp15@60017
  1156
    finally show "norm ((\<Sum>i\<le>n. c i * z^i) + c (Suc n) * z ^ Suc n) \<le> e * norm z ^ Suc (Suc n)"
lp15@60162
  1157
      by simp
lp15@60017
  1158
  qed
lp15@60017
  1159
qed
lp15@60017
  1160
lp15@60017
  1161
lemma polyfun_extremal: (*COMPLEX_POLYFUN_EXTREMAL in HOL Light*)
lp15@60017
  1162
    fixes c :: "nat \<Rightarrow> 'a::real_normed_div_algebra"
lp15@60017
  1163
  assumes k: "c k \<noteq> 0" "1\<le>k" and kn: "k\<le>n"
lp15@60017
  1164
    shows "eventually (\<lambda>z. norm (\<Sum>i\<le>n. c(i) * z^i) \<ge> B) at_infinity"
lp15@60017
  1165
using kn
lp15@60017
  1166
proof (induction n)
lp15@60017
  1167
  case 0
lp15@60017
  1168
  then show ?case
lp15@60017
  1169
    using k  by simp
lp15@60017
  1170
next
lp15@60017
  1171
  case (Suc m)
lp15@60017
  1172
  let ?even = ?case
lp15@60017
  1173
  show ?even
lp15@60017
  1174
  proof (cases "c (Suc m) = 0")
lp15@60017
  1175
    case True
lp15@60017
  1176
    then show ?even using Suc k
lp15@60017
  1177
      by auto (metis antisym_conv less_eq_Suc_le not_le)
lp15@60017
  1178
  next
lp15@60017
  1179
    case False
lp15@60017
  1180
    then obtain M where M:
lp15@60017
  1181
          "\<And>z. M \<le> norm z \<Longrightarrow> norm (\<Sum>i\<le>m. c i * z^i) \<le> norm (c (Suc m)) / 2 * norm z ^ Suc m"
lp15@60017
  1182
      using polyfun_extremal_lemma [of "norm(c (Suc m)) / 2" c m] Suc
lp15@60017
  1183
      by auto
lp15@60017
  1184
    have "\<exists>b. \<forall>z. b \<le> norm z \<longrightarrow> B \<le> norm (\<Sum>i\<le>Suc m. c i * z^i)"
lp15@60017
  1185
    proof (rule exI [where x="max M (max 1 (\<bar>B\<bar> / (norm(c (Suc m)) / 2)))"], clarsimp simp del: power_Suc)
lp15@60017
  1186
      fix z::'a
lp15@60017
  1187
      assume z1: "M \<le> norm z" "1 \<le> norm z"
lp15@60017
  1188
         and "\<bar>B\<bar> * 2 / norm (c (Suc m)) \<le> norm z"
lp15@60017
  1189
      then have z2: "\<bar>B\<bar> \<le> norm (c (Suc m)) * norm z / 2"
lp15@60017
  1190
        using False by (simp add: field_simps)
lp15@60017
  1191
      have nz: "norm z \<le> norm z ^ Suc m"
wenzelm@60420
  1192
        by (metis \<open>1 \<le> norm z\<close> One_nat_def less_eq_Suc_le power_increasing power_one_right zero_less_Suc)
lp15@60017
  1193
      have *: "\<And>y x. norm (c (Suc m)) * norm z / 2 \<le> norm y - norm x \<Longrightarrow> B \<le> norm (x + y)"
lp15@60017
  1194
        by (metis abs_le_iff add.commute norm_diff_ineq order_trans z2)
lp15@60017
  1195
      have "norm z * norm (c (Suc m)) + 2 * norm (\<Sum>i\<le>m. c i * z^i)
lp15@60017
  1196
            \<le> norm (c (Suc m)) * norm z + norm (c (Suc m)) * norm z ^ Suc m"
lp15@60017
  1197
        using M [of z] Suc z1  by auto
lp15@60017
  1198
      also have "... \<le> 2 * (norm (c (Suc m)) * norm z ^ Suc m)"
lp15@60017
  1199
        using nz by (simp add: mult_mono del: power_Suc)
lp15@60017
  1200
      finally show "B \<le> norm ((\<Sum>i\<le>m. c i * z^i) + c (Suc m) * z ^ Suc m)"
lp15@60017
  1201
        using Suc.IH
lp15@60017
  1202
        apply (auto simp: eventually_at_infinity)
lp15@60017
  1203
        apply (rule *)
lp15@60017
  1204
        apply (simp add: field_simps norm_mult norm_power)
lp15@60017
  1205
        done
lp15@60017
  1206
    qed
lp15@60017
  1207
    then show ?even
lp15@60017
  1208
      by (simp add: eventually_at_infinity)
lp15@60017
  1209
  qed
lp15@60017
  1210
qed
lp15@60017
  1211
lp15@56215
  1212
end