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