src/HOL/Complex.thy
author paulson <lp15@cam.ac.uk>
Wed Mar 18 17:23:22 2015 +0000 (2015-03-18)
changeset 59746 ddae5727c5a9
parent 59741 5b762cd73a8e
child 59862 44b3f4fa33ca
permissions -rw-r--r--
new HOL Light material about exp, sin, cos
wenzelm@41959
     1
(*  Title:       HOL/Complex.thy
paulson@13957
     2
    Author:      Jacques D. Fleuriot
paulson@13957
     3
    Copyright:   2001 University of Edinburgh
paulson@14387
     4
    Conversion to Isar and new proofs by Lawrence C Paulson, 2003/4
paulson@13957
     5
*)
paulson@13957
     6
wenzelm@58889
     7
section {* Complex Numbers: Rectangular and Polar Representations *}
paulson@14373
     8
nipkow@15131
     9
theory Complex
haftmann@28952
    10
imports Transcendental
nipkow@15131
    11
begin
paulson@13957
    12
hoelzl@56889
    13
text {*
blanchet@58146
    14
We use the @{text codatatype} command to define the type of complex numbers. This allows us to use
blanchet@58146
    15
@{text primcorec} to define complex functions by defining their real and imaginary result
blanchet@58146
    16
separately.
hoelzl@56889
    17
*}
paulson@14373
    18
hoelzl@56889
    19
codatatype complex = Complex (Re: real) (Im: real)
hoelzl@56889
    20
hoelzl@56889
    21
lemma complex_surj: "Complex (Re z) (Im z) = z"
hoelzl@56889
    22
  by (rule complex.collapse)
paulson@13957
    23
huffman@44065
    24
lemma complex_eqI [intro?]: "\<lbrakk>Re x = Re y; Im x = Im y\<rbrakk> \<Longrightarrow> x = y"
hoelzl@56889
    25
  by (rule complex.expand) simp
huffman@23125
    26
huffman@44065
    27
lemma complex_eq_iff: "x = y \<longleftrightarrow> Re x = Re y \<and> Im x = Im y"
hoelzl@56889
    28
  by (auto intro: complex.expand)
huffman@23125
    29
huffman@23125
    30
subsection {* Addition and Subtraction *}
huffman@23125
    31
haftmann@25599
    32
instantiation complex :: ab_group_add
haftmann@25571
    33
begin
haftmann@25571
    34
hoelzl@56889
    35
primcorec zero_complex where
hoelzl@56889
    36
  "Re 0 = 0"
hoelzl@56889
    37
| "Im 0 = 0"
haftmann@25571
    38
hoelzl@56889
    39
primcorec plus_complex where
hoelzl@56889
    40
  "Re (x + y) = Re x + Re y"
hoelzl@56889
    41
| "Im (x + y) = Im x + Im y"
haftmann@25712
    42
hoelzl@56889
    43
primcorec uminus_complex where
hoelzl@56889
    44
  "Re (- x) = - Re x"
hoelzl@56889
    45
| "Im (- x) = - Im x"
huffman@23125
    46
hoelzl@56889
    47
primcorec minus_complex where
hoelzl@56889
    48
  "Re (x - y) = Re x - Re y"
hoelzl@56889
    49
| "Im (x - y) = Im x - Im y"
huffman@23125
    50
haftmann@25712
    51
instance
hoelzl@56889
    52
  by intro_classes (simp_all add: complex_eq_iff)
haftmann@25712
    53
haftmann@25712
    54
end
haftmann@25712
    55
huffman@23125
    56
subsection {* Multiplication and Division *}
huffman@23125
    57
haftmann@36409
    58
instantiation complex :: field_inverse_zero
haftmann@25571
    59
begin
haftmann@25571
    60
hoelzl@56889
    61
primcorec one_complex where
hoelzl@56889
    62
  "Re 1 = 1"
hoelzl@56889
    63
| "Im 1 = 0"
paulson@14323
    64
hoelzl@56889
    65
primcorec times_complex where
hoelzl@56889
    66
  "Re (x * y) = Re x * Re y - Im x * Im y"
hoelzl@56889
    67
| "Im (x * y) = Re x * Im y + Im x * Re y"
paulson@14323
    68
hoelzl@56889
    69
primcorec inverse_complex where
hoelzl@56889
    70
  "Re (inverse x) = Re x / ((Re x)\<^sup>2 + (Im x)\<^sup>2)"
hoelzl@56889
    71
| "Im (inverse x) = - Im x / ((Re x)\<^sup>2 + (Im x)\<^sup>2)"
paulson@14335
    72
hoelzl@56889
    73
definition "x / (y\<Colon>complex) = x * inverse y"
paulson@14335
    74
haftmann@25712
    75
instance
lp15@59613
    76
  by intro_classes
hoelzl@56889
    77
     (simp_all add: complex_eq_iff divide_complex_def
hoelzl@56889
    78
      distrib_left distrib_right right_diff_distrib left_diff_distrib
hoelzl@56889
    79
      power2_eq_square add_divide_distrib [symmetric])
paulson@14335
    80
haftmann@25712
    81
end
huffman@23125
    82
hoelzl@56889
    83
lemma Re_divide: "Re (x / y) = (Re x * Re y + Im x * Im y) / ((Re y)\<^sup>2 + (Im y)\<^sup>2)"
hoelzl@56889
    84
  unfolding divide_complex_def by (simp add: add_divide_distrib)
huffman@23125
    85
hoelzl@56889
    86
lemma Im_divide: "Im (x / y) = (Im x * Re y - Re x * Im y) / ((Re y)\<^sup>2 + (Im y)\<^sup>2)"
hoelzl@56889
    87
  unfolding divide_complex_def times_complex.sel inverse_complex.sel
hoelzl@56889
    88
  by (simp_all add: divide_simps)
huffman@23125
    89
hoelzl@56889
    90
lemma Re_power2: "Re (x ^ 2) = (Re x)^2 - (Im x)^2"
hoelzl@56889
    91
  by (simp add: power2_eq_square)
huffman@20556
    92
hoelzl@56889
    93
lemma Im_power2: "Im (x ^ 2) = 2 * Re x * Im x"
hoelzl@56889
    94
  by (simp add: power2_eq_square)
hoelzl@56889
    95
hoelzl@56889
    96
lemma Re_power_real: "Im x = 0 \<Longrightarrow> Re (x ^ n) = Re x ^ n "
huffman@44724
    97
  by (induct n) simp_all
huffman@23125
    98
hoelzl@56889
    99
lemma Im_power_real: "Im x = 0 \<Longrightarrow> Im (x ^ n) = 0"
hoelzl@56889
   100
  by (induct n) simp_all
huffman@23125
   101
huffman@23125
   102
subsection {* Scalar Multiplication *}
huffman@20556
   103
haftmann@25712
   104
instantiation complex :: real_field
haftmann@25571
   105
begin
haftmann@25571
   106
hoelzl@56889
   107
primcorec scaleR_complex where
hoelzl@56889
   108
  "Re (scaleR r x) = r * Re x"
hoelzl@56889
   109
| "Im (scaleR r x) = r * Im x"
huffman@22972
   110
haftmann@25712
   111
instance
huffman@20556
   112
proof
huffman@23125
   113
  fix a b :: real and x y :: complex
huffman@23125
   114
  show "scaleR a (x + y) = scaleR a x + scaleR a y"
webertj@49962
   115
    by (simp add: complex_eq_iff distrib_left)
huffman@23125
   116
  show "scaleR (a + b) x = scaleR a x + scaleR b x"
webertj@49962
   117
    by (simp add: complex_eq_iff distrib_right)
huffman@23125
   118
  show "scaleR a (scaleR b x) = scaleR (a * b) x"
haftmann@57512
   119
    by (simp add: complex_eq_iff mult.assoc)
huffman@23125
   120
  show "scaleR 1 x = x"
huffman@44065
   121
    by (simp add: complex_eq_iff)
huffman@23125
   122
  show "scaleR a x * y = scaleR a (x * y)"
huffman@44065
   123
    by (simp add: complex_eq_iff algebra_simps)
huffman@23125
   124
  show "x * scaleR a y = scaleR a (x * y)"
huffman@44065
   125
    by (simp add: complex_eq_iff algebra_simps)
huffman@20556
   126
qed
huffman@20556
   127
haftmann@25712
   128
end
haftmann@25712
   129
hoelzl@56889
   130
subsection {* Numerals, Arithmetic, and Embedding from Reals *}
paulson@14323
   131
huffman@44724
   132
abbreviation complex_of_real :: "real \<Rightarrow> complex"
huffman@44724
   133
  where "complex_of_real \<equiv> of_real"
huffman@20557
   134
hoelzl@59000
   135
declare [[coercion "of_real :: real \<Rightarrow> complex"]]
hoelzl@59000
   136
declare [[coercion "of_rat :: rat \<Rightarrow> complex"]]
hoelzl@56889
   137
declare [[coercion "of_int :: int \<Rightarrow> complex"]]
hoelzl@56889
   138
declare [[coercion "of_nat :: nat \<Rightarrow> complex"]]
hoelzl@56331
   139
hoelzl@56889
   140
lemma complex_Re_of_nat [simp]: "Re (of_nat n) = of_nat n"
hoelzl@56889
   141
  by (induct n) simp_all
hoelzl@56889
   142
hoelzl@56889
   143
lemma complex_Im_of_nat [simp]: "Im (of_nat n) = 0"
hoelzl@56889
   144
  by (induct n) simp_all
hoelzl@56889
   145
hoelzl@56889
   146
lemma complex_Re_of_int [simp]: "Re (of_int z) = of_int z"
hoelzl@56889
   147
  by (cases z rule: int_diff_cases) simp
hoelzl@56889
   148
hoelzl@56889
   149
lemma complex_Im_of_int [simp]: "Im (of_int z) = 0"
hoelzl@56889
   150
  by (cases z rule: int_diff_cases) simp
hoelzl@56889
   151
hoelzl@56889
   152
lemma complex_Re_numeral [simp]: "Re (numeral v) = numeral v"
hoelzl@56889
   153
  using complex_Re_of_int [of "numeral v"] by simp
hoelzl@56889
   154
hoelzl@56889
   155
lemma complex_Im_numeral [simp]: "Im (numeral v) = 0"
hoelzl@56889
   156
  using complex_Im_of_int [of "numeral v"] by simp
huffman@20557
   157
huffman@20557
   158
lemma Re_complex_of_real [simp]: "Re (complex_of_real z) = z"
hoelzl@56889
   159
  by (simp add: of_real_def)
huffman@20557
   160
huffman@20557
   161
lemma Im_complex_of_real [simp]: "Im (complex_of_real z) = 0"
hoelzl@56889
   162
  by (simp add: of_real_def)
hoelzl@56889
   163
lp15@59613
   164
lemma Re_divide_numeral [simp]: "Re (z / numeral w) = Re z / numeral w"
lp15@59613
   165
  by (simp add: Re_divide sqr_conv_mult)
lp15@59613
   166
lp15@59613
   167
lemma Im_divide_numeral [simp]: "Im (z / numeral w) = Im z / numeral w"
lp15@59613
   168
  by (simp add: Im_divide sqr_conv_mult)
lp15@59613
   169
hoelzl@56889
   170
subsection {* The Complex Number $i$ *}
hoelzl@56889
   171
hoelzl@56889
   172
primcorec "ii" :: complex  ("\<i>") where
hoelzl@56889
   173
  "Re ii = 0"
hoelzl@56889
   174
| "Im ii = 1"
huffman@20557
   175
hoelzl@57259
   176
lemma Complex_eq[simp]: "Complex a b = a + \<i> * b"
hoelzl@57259
   177
  by (simp add: complex_eq_iff)
hoelzl@57259
   178
hoelzl@57259
   179
lemma complex_eq: "a = Re a + \<i> * Im a"
hoelzl@57259
   180
  by (simp add: complex_eq_iff)
hoelzl@57259
   181
hoelzl@57259
   182
lemma fun_complex_eq: "f = (\<lambda>x. Re (f x) + \<i> * Im (f x))"
hoelzl@57259
   183
  by (simp add: fun_eq_iff complex_eq)
hoelzl@57259
   184
hoelzl@56889
   185
lemma i_squared [simp]: "ii * ii = -1"
hoelzl@56889
   186
  by (simp add: complex_eq_iff)
hoelzl@56889
   187
hoelzl@56889
   188
lemma power2_i [simp]: "ii\<^sup>2 = -1"
hoelzl@56889
   189
  by (simp add: power2_eq_square)
paulson@14377
   190
hoelzl@56889
   191
lemma inverse_i [simp]: "inverse ii = - ii"
hoelzl@56889
   192
  by (rule inverse_unique) simp
hoelzl@56889
   193
hoelzl@56889
   194
lemma divide_i [simp]: "x / ii = - ii * x"
hoelzl@56889
   195
  by (simp add: divide_complex_def)
paulson@14377
   196
hoelzl@56889
   197
lemma complex_i_mult_minus [simp]: "ii * (ii * x) = - x"
haftmann@57512
   198
  by (simp add: mult.assoc [symmetric])
paulson@14377
   199
hoelzl@56889
   200
lemma complex_i_not_zero [simp]: "ii \<noteq> 0"
hoelzl@56889
   201
  by (simp add: complex_eq_iff)
huffman@20557
   202
hoelzl@56889
   203
lemma complex_i_not_one [simp]: "ii \<noteq> 1"
hoelzl@56889
   204
  by (simp add: complex_eq_iff)
hoelzl@56889
   205
hoelzl@56889
   206
lemma complex_i_not_numeral [simp]: "ii \<noteq> numeral w"
hoelzl@56889
   207
  by (simp add: complex_eq_iff)
huffman@44841
   208
hoelzl@56889
   209
lemma complex_i_not_neg_numeral [simp]: "ii \<noteq> - numeral w"
hoelzl@56889
   210
  by (simp add: complex_eq_iff)
hoelzl@56889
   211
hoelzl@56889
   212
lemma complex_split_polar: "\<exists>r a. z = complex_of_real r * (cos a + \<i> * sin a)"
huffman@44827
   213
  by (simp add: complex_eq_iff polar_Ex)
huffman@44827
   214
lp15@59613
   215
lemma i_even_power [simp]: "\<i> ^ (n * 2) = (-1) ^ n"
lp15@59613
   216
  by (metis mult.commute power2_i power_mult)
lp15@59613
   217
lp15@59741
   218
lemma Re_ii_times [simp]: "Re (ii*z) = - Im z"
lp15@59741
   219
  by simp
lp15@59741
   220
lp15@59741
   221
lemma Im_ii_times [simp]: "Im (ii*z) = Re z"
lp15@59741
   222
  by simp
lp15@59741
   223
lp15@59741
   224
lemma ii_times_eq_iff: "ii*w = z \<longleftrightarrow> w = -(ii*z)"
lp15@59741
   225
  by auto
lp15@59741
   226
lp15@59741
   227
lemma divide_numeral_i [simp]: "z / (numeral n * ii) = -(ii*z) / numeral n"
lp15@59741
   228
  by (metis divide_divide_eq_left divide_i mult.commute mult_minus_right)
lp15@59741
   229
huffman@23125
   230
subsection {* Vector Norm *}
paulson@14323
   231
haftmann@25712
   232
instantiation complex :: real_normed_field
haftmann@25571
   233
begin
haftmann@25571
   234
hoelzl@56889
   235
definition "norm z = sqrt ((Re z)\<^sup>2 + (Im z)\<^sup>2)"
haftmann@25571
   236
huffman@44724
   237
abbreviation cmod :: "complex \<Rightarrow> real"
huffman@44724
   238
  where "cmod \<equiv> norm"
haftmann@25571
   239
huffman@31413
   240
definition complex_sgn_def:
huffman@31413
   241
  "sgn x = x /\<^sub>R cmod x"
haftmann@25571
   242
huffman@31413
   243
definition dist_complex_def:
huffman@31413
   244
  "dist x y = cmod (x - y)"
huffman@31413
   245
haftmann@37767
   246
definition open_complex_def:
huffman@31492
   247
  "open (S :: complex set) \<longleftrightarrow> (\<forall>x\<in>S. \<exists>e>0. \<forall>y. dist y x < e \<longrightarrow> y \<in> S)"
huffman@31292
   248
huffman@31413
   249
instance proof
huffman@31492
   250
  fix r :: real and x y :: complex and S :: "complex set"
huffman@23125
   251
  show "(norm x = 0) = (x = 0)"
hoelzl@56889
   252
    by (simp add: norm_complex_def complex_eq_iff)
huffman@23125
   253
  show "norm (x + y) \<le> norm x + norm y"
hoelzl@56889
   254
    by (simp add: norm_complex_def complex_eq_iff real_sqrt_sum_squares_triangle_ineq)
huffman@23125
   255
  show "norm (scaleR r x) = \<bar>r\<bar> * norm x"
hoelzl@56889
   256
    by (simp add: norm_complex_def complex_eq_iff power_mult_distrib distrib_left [symmetric] real_sqrt_mult)
huffman@23125
   257
  show "norm (x * y) = norm x * norm y"
hoelzl@56889
   258
    by (simp add: norm_complex_def complex_eq_iff real_sqrt_mult [symmetric] power2_eq_square algebra_simps)
hoelzl@56889
   259
qed (rule complex_sgn_def dist_complex_def open_complex_def)+
huffman@20557
   260
haftmann@25712
   261
end
haftmann@25712
   262
hoelzl@56889
   263
lemma norm_ii [simp]: "norm ii = 1"
hoelzl@56889
   264
  by (simp add: norm_complex_def)
paulson@14323
   265
hoelzl@56889
   266
lemma cmod_unit_one: "cmod (cos a + \<i> * sin a) = 1"
hoelzl@56889
   267
  by (simp add: norm_complex_def)
hoelzl@56889
   268
hoelzl@56889
   269
lemma cmod_complex_polar: "cmod (r * (cos a + \<i> * sin a)) = \<bar>r\<bar>"
hoelzl@56889
   270
  by (simp add: norm_mult cmod_unit_one)
huffman@22861
   271
huffman@22861
   272
lemma complex_Re_le_cmod: "Re x \<le> cmod x"
hoelzl@56889
   273
  unfolding norm_complex_def
huffman@44724
   274
  by (rule real_sqrt_sum_squares_ge1)
huffman@22861
   275
huffman@44761
   276
lemma complex_mod_minus_le_complex_mod: "- cmod x \<le> cmod x"
hoelzl@56889
   277
  by (rule order_trans [OF _ norm_ge_zero]) simp
huffman@22861
   278
hoelzl@56889
   279
lemma complex_mod_triangle_ineq2: "cmod (b + a) - cmod b \<le> cmod a"
hoelzl@56889
   280
  by (rule ord_le_eq_trans [OF norm_triangle_ineq2]) simp
paulson@14323
   281
chaieb@26117
   282
lemma abs_Re_le_cmod: "\<bar>Re x\<bar> \<le> cmod x"
hoelzl@56889
   283
  by (simp add: norm_complex_def)
chaieb@26117
   284
chaieb@26117
   285
lemma abs_Im_le_cmod: "\<bar>Im x\<bar> \<le> cmod x"
hoelzl@56889
   286
  by (simp add: norm_complex_def)
hoelzl@56889
   287
hoelzl@57259
   288
lemma cmod_le: "cmod z \<le> \<bar>Re z\<bar> + \<bar>Im z\<bar>"
hoelzl@57259
   289
  apply (subst complex_eq)
hoelzl@57259
   290
  apply (rule order_trans)
hoelzl@57259
   291
  apply (rule norm_triangle_ineq)
hoelzl@57259
   292
  apply (simp add: norm_mult)
hoelzl@57259
   293
  done
hoelzl@57259
   294
hoelzl@56889
   295
lemma cmod_eq_Re: "Im z = 0 \<Longrightarrow> cmod z = \<bar>Re z\<bar>"
hoelzl@56889
   296
  by (simp add: norm_complex_def)
hoelzl@56889
   297
hoelzl@56889
   298
lemma cmod_eq_Im: "Re z = 0 \<Longrightarrow> cmod z = \<bar>Im z\<bar>"
hoelzl@56889
   299
  by (simp add: norm_complex_def)
huffman@44724
   300
hoelzl@56889
   301
lemma cmod_power2: "cmod z ^ 2 = (Re z)^2 + (Im z)^2"
hoelzl@56889
   302
  by (simp add: norm_complex_def)
hoelzl@56889
   303
hoelzl@56889
   304
lemma cmod_plus_Re_le_0_iff: "cmod z + Re z \<le> 0 \<longleftrightarrow> Re z = - cmod z"
hoelzl@56889
   305
  using abs_Re_le_cmod[of z] by auto
hoelzl@56889
   306
hoelzl@56889
   307
lemma Im_eq_0: "\<bar>Re z\<bar> = cmod z \<Longrightarrow> Im z = 0"
hoelzl@56889
   308
  by (subst (asm) power_eq_iff_eq_base[symmetric, where n=2])
hoelzl@56889
   309
     (auto simp add: norm_complex_def)
hoelzl@56369
   310
hoelzl@56369
   311
lemma abs_sqrt_wlog:
hoelzl@56369
   312
  fixes x::"'a::linordered_idom"
hoelzl@56369
   313
  assumes "\<And>x::'a. x \<ge> 0 \<Longrightarrow> P x (x\<^sup>2)" shows "P \<bar>x\<bar> (x\<^sup>2)"
hoelzl@56369
   314
by (metis abs_ge_zero assms power2_abs)
hoelzl@56369
   315
hoelzl@56369
   316
lemma complex_abs_le_norm: "\<bar>Re z\<bar> + \<bar>Im z\<bar> \<le> sqrt 2 * norm z"
hoelzl@56889
   317
  unfolding norm_complex_def
hoelzl@56369
   318
  apply (rule abs_sqrt_wlog [where x="Re z"])
hoelzl@56369
   319
  apply (rule abs_sqrt_wlog [where x="Im z"])
hoelzl@56369
   320
  apply (rule power2_le_imp_le)
haftmann@57512
   321
  apply (simp_all add: power2_sum add.commute sum_squares_bound real_sqrt_mult [symmetric])
hoelzl@56369
   322
  done
hoelzl@56369
   323
lp15@59741
   324
lemma complex_unit_circle: "z \<noteq> 0 \<Longrightarrow> (Re z / cmod z)\<^sup>2 + (Im z / cmod z)\<^sup>2 = 1"
lp15@59741
   325
  by (simp add: norm_complex_def divide_simps complex_eq_iff)
lp15@59741
   326
hoelzl@56369
   327
huffman@44843
   328
text {* Properties of complex signum. *}
huffman@44843
   329
huffman@44843
   330
lemma sgn_eq: "sgn z = z / complex_of_real (cmod z)"
haftmann@57512
   331
  by (simp add: sgn_div_norm divide_inverse scaleR_conv_of_real mult.commute)
huffman@44843
   332
huffman@44843
   333
lemma Re_sgn [simp]: "Re(sgn z) = Re(z)/cmod z"
huffman@44843
   334
  by (simp add: complex_sgn_def divide_inverse)
huffman@44843
   335
huffman@44843
   336
lemma Im_sgn [simp]: "Im(sgn z) = Im(z)/cmod z"
huffman@44843
   337
  by (simp add: complex_sgn_def divide_inverse)
huffman@44843
   338
paulson@14354
   339
huffman@23123
   340
subsection {* Completeness of the Complexes *}
huffman@23123
   341
huffman@44290
   342
lemma bounded_linear_Re: "bounded_linear Re"
hoelzl@56889
   343
  by (rule bounded_linear_intro [where K=1], simp_all add: norm_complex_def)
huffman@44290
   344
huffman@44290
   345
lemma bounded_linear_Im: "bounded_linear Im"
hoelzl@56889
   346
  by (rule bounded_linear_intro [where K=1], simp_all add: norm_complex_def)
huffman@23123
   347
huffman@44290
   348
lemmas Cauchy_Re = bounded_linear.Cauchy [OF bounded_linear_Re]
huffman@44290
   349
lemmas Cauchy_Im = bounded_linear.Cauchy [OF bounded_linear_Im]
hoelzl@56381
   350
lemmas tendsto_Re [tendsto_intros] = bounded_linear.tendsto [OF bounded_linear_Re]
hoelzl@56381
   351
lemmas tendsto_Im [tendsto_intros] = bounded_linear.tendsto [OF bounded_linear_Im]
hoelzl@56381
   352
lemmas isCont_Re [simp] = bounded_linear.isCont [OF bounded_linear_Re]
hoelzl@56381
   353
lemmas isCont_Im [simp] = bounded_linear.isCont [OF bounded_linear_Im]
hoelzl@56381
   354
lemmas continuous_Re [simp] = bounded_linear.continuous [OF bounded_linear_Re]
hoelzl@56381
   355
lemmas continuous_Im [simp] = bounded_linear.continuous [OF bounded_linear_Im]
hoelzl@56381
   356
lemmas continuous_on_Re [continuous_intros] = bounded_linear.continuous_on[OF bounded_linear_Re]
hoelzl@56381
   357
lemmas continuous_on_Im [continuous_intros] = bounded_linear.continuous_on[OF bounded_linear_Im]
hoelzl@56381
   358
lemmas has_derivative_Re [derivative_intros] = bounded_linear.has_derivative[OF bounded_linear_Re]
hoelzl@56381
   359
lemmas has_derivative_Im [derivative_intros] = bounded_linear.has_derivative[OF bounded_linear_Im]
hoelzl@56381
   360
lemmas sums_Re = bounded_linear.sums [OF bounded_linear_Re]
hoelzl@56381
   361
lemmas sums_Im = bounded_linear.sums [OF bounded_linear_Im]
hoelzl@56369
   362
huffman@36825
   363
lemma tendsto_Complex [tendsto_intros]:
hoelzl@56889
   364
  "(f ---> a) F \<Longrightarrow> (g ---> b) F \<Longrightarrow> ((\<lambda>x. Complex (f x) (g x)) ---> Complex a b) F"
hoelzl@56889
   365
  by (auto intro!: tendsto_intros)
hoelzl@56369
   366
hoelzl@56369
   367
lemma tendsto_complex_iff:
hoelzl@56369
   368
  "(f ---> x) F \<longleftrightarrow> (((\<lambda>x. Re (f x)) ---> Re x) F \<and> ((\<lambda>x. Im (f x)) ---> Im x) F)"
hoelzl@56889
   369
proof safe
hoelzl@56889
   370
  assume "((\<lambda>x. Re (f x)) ---> Re x) F" "((\<lambda>x. Im (f x)) ---> Im x) F"
hoelzl@56889
   371
  from tendsto_Complex[OF this] show "(f ---> x) F"
hoelzl@56889
   372
    unfolding complex.collapse .
hoelzl@56889
   373
qed (auto intro: tendsto_intros)
hoelzl@56369
   374
hoelzl@57259
   375
lemma continuous_complex_iff: "continuous F f \<longleftrightarrow>
hoelzl@57259
   376
    continuous F (\<lambda>x. Re (f x)) \<and> continuous F (\<lambda>x. Im (f x))"
hoelzl@57259
   377
  unfolding continuous_def tendsto_complex_iff ..
hoelzl@57259
   378
hoelzl@57259
   379
lemma has_vector_derivative_complex_iff: "(f has_vector_derivative x) F \<longleftrightarrow>
hoelzl@57259
   380
    ((\<lambda>x. Re (f x)) has_field_derivative (Re x)) F \<and>
hoelzl@57259
   381
    ((\<lambda>x. Im (f x)) has_field_derivative (Im x)) F"
hoelzl@57259
   382
  unfolding has_vector_derivative_def has_field_derivative_def has_derivative_def tendsto_complex_iff
hoelzl@57259
   383
  by (simp add: field_simps bounded_linear_scaleR_left bounded_linear_mult_right)
hoelzl@57259
   384
hoelzl@57259
   385
lemma has_field_derivative_Re[derivative_intros]:
hoelzl@57259
   386
  "(f has_vector_derivative D) F \<Longrightarrow> ((\<lambda>x. Re (f x)) has_field_derivative (Re D)) F"
hoelzl@57259
   387
  unfolding has_vector_derivative_complex_iff by safe
hoelzl@57259
   388
hoelzl@57259
   389
lemma has_field_derivative_Im[derivative_intros]:
hoelzl@57259
   390
  "(f has_vector_derivative D) F \<Longrightarrow> ((\<lambda>x. Im (f x)) has_field_derivative (Im D)) F"
hoelzl@57259
   391
  unfolding has_vector_derivative_complex_iff by safe
hoelzl@57259
   392
huffman@23123
   393
instance complex :: banach
huffman@23123
   394
proof
huffman@23123
   395
  fix X :: "nat \<Rightarrow> complex"
huffman@23123
   396
  assume X: "Cauchy X"
hoelzl@56889
   397
  then have "(\<lambda>n. Complex (Re (X n)) (Im (X n))) ----> Complex (lim (\<lambda>n. Re (X n))) (lim (\<lambda>n. Im (X n)))"
hoelzl@56889
   398
    by (intro tendsto_Complex convergent_LIMSEQ_iff[THEN iffD1] Cauchy_convergent_iff[THEN iffD1] Cauchy_Re Cauchy_Im)
hoelzl@56889
   399
  then show "convergent X"
hoelzl@56889
   400
    unfolding complex.collapse by (rule convergentI)
huffman@23123
   401
qed
huffman@23123
   402
lp15@56238
   403
declare
hoelzl@56381
   404
  DERIV_power[where 'a=complex, unfolded of_nat_def[symmetric], derivative_intros]
lp15@56238
   405
huffman@23125
   406
subsection {* Complex Conjugation *}
huffman@23125
   407
hoelzl@56889
   408
primcorec cnj :: "complex \<Rightarrow> complex" where
hoelzl@56889
   409
  "Re (cnj z) = Re z"
hoelzl@56889
   410
| "Im (cnj z) = - Im z"
huffman@23125
   411
huffman@23125
   412
lemma complex_cnj_cancel_iff [simp]: "(cnj x = cnj y) = (x = y)"
huffman@44724
   413
  by (simp add: complex_eq_iff)
huffman@23125
   414
huffman@23125
   415
lemma complex_cnj_cnj [simp]: "cnj (cnj z) = z"
hoelzl@56889
   416
  by (simp add: complex_eq_iff)
huffman@23125
   417
huffman@23125
   418
lemma complex_cnj_zero [simp]: "cnj 0 = 0"
huffman@44724
   419
  by (simp add: complex_eq_iff)
huffman@23125
   420
huffman@23125
   421
lemma complex_cnj_zero_iff [iff]: "(cnj z = 0) = (z = 0)"
huffman@44724
   422
  by (simp add: complex_eq_iff)
huffman@23125
   423
hoelzl@56889
   424
lemma complex_cnj_add [simp]: "cnj (x + y) = cnj x + cnj y"
huffman@44724
   425
  by (simp add: complex_eq_iff)
huffman@23125
   426
hoelzl@56889
   427
lemma cnj_setsum [simp]: "cnj (setsum f s) = (\<Sum>x\<in>s. cnj (f x))"
hoelzl@56889
   428
  by (induct s rule: infinite_finite_induct) auto
hoelzl@56369
   429
hoelzl@56889
   430
lemma complex_cnj_diff [simp]: "cnj (x - y) = cnj x - cnj y"
huffman@44724
   431
  by (simp add: complex_eq_iff)
huffman@23125
   432
hoelzl@56889
   433
lemma complex_cnj_minus [simp]: "cnj (- x) = - cnj x"
huffman@44724
   434
  by (simp add: complex_eq_iff)
huffman@23125
   435
huffman@23125
   436
lemma complex_cnj_one [simp]: "cnj 1 = 1"
huffman@44724
   437
  by (simp add: complex_eq_iff)
huffman@23125
   438
hoelzl@56889
   439
lemma complex_cnj_mult [simp]: "cnj (x * y) = cnj x * cnj y"
huffman@44724
   440
  by (simp add: complex_eq_iff)
huffman@23125
   441
hoelzl@56889
   442
lemma cnj_setprod [simp]: "cnj (setprod f s) = (\<Prod>x\<in>s. cnj (f x))"
hoelzl@56889
   443
  by (induct s rule: infinite_finite_induct) auto
hoelzl@56369
   444
hoelzl@56889
   445
lemma complex_cnj_inverse [simp]: "cnj (inverse x) = inverse (cnj x)"
hoelzl@56889
   446
  by (simp add: complex_eq_iff)
paulson@14323
   447
hoelzl@56889
   448
lemma complex_cnj_divide [simp]: "cnj (x / y) = cnj x / cnj y"
hoelzl@56889
   449
  by (simp add: divide_complex_def)
huffman@23125
   450
hoelzl@56889
   451
lemma complex_cnj_power [simp]: "cnj (x ^ n) = cnj x ^ n"
hoelzl@56889
   452
  by (induct n) simp_all
huffman@23125
   453
huffman@23125
   454
lemma complex_cnj_of_nat [simp]: "cnj (of_nat n) = of_nat n"
huffman@44724
   455
  by (simp add: complex_eq_iff)
huffman@23125
   456
huffman@23125
   457
lemma complex_cnj_of_int [simp]: "cnj (of_int z) = of_int z"
huffman@44724
   458
  by (simp add: complex_eq_iff)
huffman@23125
   459
huffman@47108
   460
lemma complex_cnj_numeral [simp]: "cnj (numeral w) = numeral w"
huffman@47108
   461
  by (simp add: complex_eq_iff)
huffman@47108
   462
haftmann@54489
   463
lemma complex_cnj_neg_numeral [simp]: "cnj (- numeral w) = - numeral w"
huffman@44724
   464
  by (simp add: complex_eq_iff)
huffman@23125
   465
hoelzl@56889
   466
lemma complex_cnj_scaleR [simp]: "cnj (scaleR r x) = scaleR r (cnj x)"
huffman@44724
   467
  by (simp add: complex_eq_iff)
huffman@23125
   468
huffman@23125
   469
lemma complex_mod_cnj [simp]: "cmod (cnj z) = cmod z"
hoelzl@56889
   470
  by (simp add: norm_complex_def)
paulson@14323
   471
huffman@23125
   472
lemma complex_cnj_complex_of_real [simp]: "cnj (of_real x) = of_real x"
huffman@44724
   473
  by (simp add: complex_eq_iff)
huffman@23125
   474
huffman@23125
   475
lemma complex_cnj_i [simp]: "cnj ii = - ii"
huffman@44724
   476
  by (simp add: complex_eq_iff)
huffman@23125
   477
huffman@23125
   478
lemma complex_add_cnj: "z + cnj z = complex_of_real (2 * Re z)"
huffman@44724
   479
  by (simp add: complex_eq_iff)
huffman@23125
   480
huffman@23125
   481
lemma complex_diff_cnj: "z - cnj z = complex_of_real (2 * Im z) * ii"
huffman@44724
   482
  by (simp add: complex_eq_iff)
paulson@14354
   483
wenzelm@53015
   484
lemma complex_mult_cnj: "z * cnj z = complex_of_real ((Re z)\<^sup>2 + (Im z)\<^sup>2)"
huffman@44724
   485
  by (simp add: complex_eq_iff power2_eq_square)
huffman@23125
   486
wenzelm@53015
   487
lemma complex_mod_mult_cnj: "cmod (z * cnj z) = (cmod z)\<^sup>2"
huffman@44724
   488
  by (simp add: norm_mult power2_eq_square)
huffman@23125
   489
huffman@44827
   490
lemma complex_mod_sqrt_Re_mult_cnj: "cmod z = sqrt (Re (z * cnj z))"
hoelzl@56889
   491
  by (simp add: norm_complex_def power2_eq_square)
huffman@44827
   492
huffman@44827
   493
lemma complex_In_mult_cnj_zero [simp]: "Im (z * cnj z) = 0"
huffman@44827
   494
  by simp
huffman@44827
   495
huffman@44290
   496
lemma bounded_linear_cnj: "bounded_linear cnj"
huffman@44127
   497
  using complex_cnj_add complex_cnj_scaleR
huffman@44127
   498
  by (rule bounded_linear_intro [where K=1], simp)
paulson@14354
   499
hoelzl@56381
   500
lemmas tendsto_cnj [tendsto_intros] = bounded_linear.tendsto [OF bounded_linear_cnj]
hoelzl@56381
   501
lemmas isCont_cnj [simp] = bounded_linear.isCont [OF bounded_linear_cnj]
hoelzl@56381
   502
lemmas continuous_cnj [simp, continuous_intros] = bounded_linear.continuous [OF bounded_linear_cnj]
hoelzl@56381
   503
lemmas continuous_on_cnj [simp, continuous_intros] = bounded_linear.continuous_on [OF bounded_linear_cnj]
hoelzl@56381
   504
lemmas has_derivative_cnj [simp, derivative_intros] = bounded_linear.has_derivative [OF bounded_linear_cnj]
huffman@44290
   505
hoelzl@56369
   506
lemma lim_cnj: "((\<lambda>x. cnj(f x)) ---> cnj l) F \<longleftrightarrow> (f ---> l) F"
hoelzl@56889
   507
  by (simp add: tendsto_iff dist_complex_def complex_cnj_diff [symmetric] del: complex_cnj_diff)
hoelzl@56369
   508
hoelzl@56369
   509
lemma sums_cnj: "((\<lambda>x. cnj(f x)) sums cnj l) \<longleftrightarrow> (f sums l)"
hoelzl@56889
   510
  by (simp add: sums_def lim_cnj cnj_setsum [symmetric] del: cnj_setsum)
hoelzl@56369
   511
paulson@14354
   512
lp15@55734
   513
subsection{*Basic Lemmas*}
lp15@55734
   514
lp15@55734
   515
lemma complex_eq_0: "z=0 \<longleftrightarrow> (Re z)\<^sup>2 + (Im z)\<^sup>2 = 0"
hoelzl@56889
   516
  by (metis zero_complex.sel complex_eqI sum_power2_eq_zero_iff)
lp15@55734
   517
lp15@55734
   518
lemma complex_neq_0: "z\<noteq>0 \<longleftrightarrow> (Re z)\<^sup>2 + (Im z)\<^sup>2 > 0"
hoelzl@56889
   519
  by (metis complex_eq_0 less_numeral_extra(3) sum_power2_gt_zero_iff)
lp15@55734
   520
lp15@55734
   521
lemma complex_norm_square: "of_real ((norm z)\<^sup>2) = z * cnj z"
hoelzl@56889
   522
by (cases z)
hoelzl@56889
   523
   (auto simp: complex_eq_iff norm_complex_def power2_eq_square[symmetric] of_real_power[symmetric]
hoelzl@56889
   524
         simp del: of_real_power)
lp15@55734
   525
lp15@59741
   526
lemma Re_complex_div_eq_0: "Re (a / b) = 0 \<longleftrightarrow> Re (a * cnj b) = 0"
hoelzl@56889
   527
  by (auto simp add: Re_divide)
lp15@59613
   528
lp15@59741
   529
lemma Im_complex_div_eq_0: "Im (a / b) = 0 \<longleftrightarrow> Im (a * cnj b) = 0"
hoelzl@56889
   530
  by (auto simp add: Im_divide)
hoelzl@56889
   531
lp15@59613
   532
lemma complex_div_gt_0:
hoelzl@56889
   533
  "(Re (a / b) > 0 \<longleftrightarrow> Re (a * cnj b) > 0) \<and> (Im (a / b) > 0 \<longleftrightarrow> Im (a * cnj b) > 0)"
hoelzl@56889
   534
proof cases
hoelzl@56889
   535
  assume "b = 0" then show ?thesis by auto
lp15@55734
   536
next
hoelzl@56889
   537
  assume "b \<noteq> 0"
hoelzl@56889
   538
  then have "0 < (Re b)\<^sup>2 + (Im b)\<^sup>2"
hoelzl@56889
   539
    by (simp add: complex_eq_iff sum_power2_gt_zero_iff)
hoelzl@56889
   540
  then show ?thesis
hoelzl@56889
   541
    by (simp add: Re_divide Im_divide zero_less_divide_iff)
lp15@55734
   542
qed
lp15@55734
   543
lp15@59741
   544
lemma Re_complex_div_gt_0: "Re (a / b) > 0 \<longleftrightarrow> Re (a * cnj b) > 0"
lp15@59741
   545
  and Im_complex_div_gt_0: "Im (a / b) > 0 \<longleftrightarrow> Im (a * cnj b) > 0"
hoelzl@56889
   546
  using complex_div_gt_0 by auto
lp15@55734
   547
lp15@59741
   548
lemma Re_complex_div_ge_0: "Re(a / b) \<ge> 0 \<longleftrightarrow> Re(a * cnj b) \<ge> 0"
lp15@59741
   549
  by (metis le_less Re_complex_div_eq_0 Re_complex_div_gt_0)
lp15@55734
   550
lp15@59741
   551
lemma Im_complex_div_ge_0: "Im(a / b) \<ge> 0 \<longleftrightarrow> Im(a * cnj b) \<ge> 0"
lp15@59741
   552
  by (metis Im_complex_div_eq_0 Im_complex_div_gt_0 le_less)
lp15@55734
   553
lp15@59741
   554
lemma Re_complex_div_lt_0: "Re(a / b) < 0 \<longleftrightarrow> Re(a * cnj b) < 0"
lp15@59741
   555
  by (metis less_asym neq_iff Re_complex_div_eq_0 Re_complex_div_gt_0)
lp15@55734
   556
lp15@59741
   557
lemma Im_complex_div_lt_0: "Im(a / b) < 0 \<longleftrightarrow> Im(a * cnj b) < 0"
lp15@59741
   558
  by (metis Im_complex_div_eq_0 Im_complex_div_gt_0 less_asym neq_iff)
lp15@55734
   559
lp15@59741
   560
lemma Re_complex_div_le_0: "Re(a / b) \<le> 0 \<longleftrightarrow> Re(a * cnj b) \<le> 0"
lp15@59741
   561
  by (metis not_le Re_complex_div_gt_0)
lp15@55734
   562
lp15@59741
   563
lemma Im_complex_div_le_0: "Im(a / b) \<le> 0 \<longleftrightarrow> Im(a * cnj b) \<le> 0"
lp15@59741
   564
  by (metis Im_complex_div_gt_0 not_le)
lp15@55734
   565
hoelzl@56889
   566
lemma Re_setsum[simp]: "Re (setsum f s) = (\<Sum>x\<in>s. Re (f x))"
hoelzl@56369
   567
  by (induct s rule: infinite_finite_induct) auto
lp15@55734
   568
hoelzl@56889
   569
lemma Im_setsum[simp]: "Im (setsum f s) = (\<Sum>x\<in>s. Im(f x))"
hoelzl@56369
   570
  by (induct s rule: infinite_finite_induct) auto
hoelzl@56369
   571
hoelzl@56369
   572
lemma sums_complex_iff: "f sums x \<longleftrightarrow> ((\<lambda>x. Re (f x)) sums Re x) \<and> ((\<lambda>x. Im (f x)) sums Im x)"
hoelzl@56369
   573
  unfolding sums_def tendsto_complex_iff Im_setsum Re_setsum ..
lp15@59613
   574
hoelzl@56369
   575
lemma summable_complex_iff: "summable f \<longleftrightarrow> summable (\<lambda>x. Re (f x)) \<and>  summable (\<lambda>x. Im (f x))"
hoelzl@56889
   576
  unfolding summable_def sums_complex_iff[abs_def] by (metis complex.sel)
hoelzl@56369
   577
hoelzl@56369
   578
lemma summable_complex_of_real [simp]: "summable (\<lambda>n. complex_of_real (f n)) \<longleftrightarrow> summable f"
hoelzl@56369
   579
  unfolding summable_complex_iff by simp
hoelzl@56369
   580
hoelzl@56369
   581
lemma summable_Re: "summable f \<Longrightarrow> summable (\<lambda>x. Re (f x))"
hoelzl@56369
   582
  unfolding summable_complex_iff by blast
hoelzl@56369
   583
hoelzl@56369
   584
lemma summable_Im: "summable f \<Longrightarrow> summable (\<lambda>x. Im (f x))"
hoelzl@56369
   585
  unfolding summable_complex_iff by blast
lp15@56217
   586
hoelzl@56889
   587
lemma complex_is_Real_iff: "z \<in> \<real> \<longleftrightarrow> Im z = 0"
hoelzl@56889
   588
  by (auto simp: Reals_def complex_eq_iff)
lp15@55734
   589
lp15@55734
   590
lemma Reals_cnj_iff: "z \<in> \<real> \<longleftrightarrow> cnj z = z"
hoelzl@56889
   591
  by (auto simp: complex_is_Real_iff complex_eq_iff)
lp15@55734
   592
lp15@55734
   593
lemma in_Reals_norm: "z \<in> \<real> \<Longrightarrow> norm(z) = abs(Re z)"
hoelzl@56889
   594
  by (simp add: complex_is_Real_iff norm_complex_def)
hoelzl@56369
   595
hoelzl@56369
   596
lemma series_comparison_complex:
hoelzl@56369
   597
  fixes f:: "nat \<Rightarrow> 'a::banach"
hoelzl@56369
   598
  assumes sg: "summable g"
hoelzl@56369
   599
     and "\<And>n. g n \<in> \<real>" "\<And>n. Re (g n) \<ge> 0"
hoelzl@56369
   600
     and fg: "\<And>n. n \<ge> N \<Longrightarrow> norm(f n) \<le> norm(g n)"
hoelzl@56369
   601
  shows "summable f"
hoelzl@56369
   602
proof -
hoelzl@56369
   603
  have g: "\<And>n. cmod (g n) = Re (g n)" using assms
hoelzl@56369
   604
    by (metis abs_of_nonneg in_Reals_norm)
hoelzl@56369
   605
  show ?thesis
hoelzl@56369
   606
    apply (rule summable_comparison_test' [where g = "\<lambda>n. norm (g n)" and N=N])
hoelzl@56369
   607
    using sg
hoelzl@56369
   608
    apply (auto simp: summable_def)
hoelzl@56369
   609
    apply (rule_tac x="Re s" in exI)
hoelzl@56369
   610
    apply (auto simp: g sums_Re)
hoelzl@56369
   611
    apply (metis fg g)
hoelzl@56369
   612
    done
hoelzl@56369
   613
qed
lp15@55734
   614
lp15@59746
   615
subsection{*Polar Form for Complex Numbers*}
lp15@59746
   616
lp15@59746
   617
lemma complex_unimodular_polar: "(norm z = 1) \<Longrightarrow> \<exists>x. z = Complex (cos x) (sin x)"
lp15@59746
   618
  using sincos_total_2pi [of "Re z" "Im z"]
lp15@59746
   619
  by auto (metis cmod_power2 complex_eq power_one)
paulson@14323
   620
huffman@44827
   621
subsubsection {* $\cos \theta + i \sin \theta$ *}
huffman@20557
   622
hoelzl@56889
   623
primcorec cis :: "real \<Rightarrow> complex" where
hoelzl@56889
   624
  "Re (cis a) = cos a"
hoelzl@56889
   625
| "Im (cis a) = sin a"
huffman@44827
   626
huffman@44827
   627
lemma cis_zero [simp]: "cis 0 = 1"
hoelzl@56889
   628
  by (simp add: complex_eq_iff)
huffman@44827
   629
huffman@44828
   630
lemma norm_cis [simp]: "norm (cis a) = 1"
hoelzl@56889
   631
  by (simp add: norm_complex_def)
huffman@44828
   632
huffman@44828
   633
lemma sgn_cis [simp]: "sgn (cis a) = cis a"
huffman@44828
   634
  by (simp add: sgn_div_norm)
huffman@44828
   635
huffman@44828
   636
lemma cis_neq_zero [simp]: "cis a \<noteq> 0"
huffman@44828
   637
  by (metis norm_cis norm_zero zero_neq_one)
huffman@44828
   638
huffman@44827
   639
lemma cis_mult: "cis a * cis b = cis (a + b)"
hoelzl@56889
   640
  by (simp add: complex_eq_iff cos_add sin_add)
huffman@44827
   641
huffman@44827
   642
lemma DeMoivre: "(cis a) ^ n = cis (real n * a)"
huffman@44827
   643
  by (induct n, simp_all add: real_of_nat_Suc algebra_simps cis_mult)
huffman@44827
   644
huffman@44827
   645
lemma cis_inverse [simp]: "inverse(cis a) = cis (-a)"
hoelzl@56889
   646
  by (simp add: complex_eq_iff)
huffman@44827
   647
huffman@44827
   648
lemma cis_divide: "cis a / cis b = cis (a - b)"
hoelzl@56889
   649
  by (simp add: divide_complex_def cis_mult)
huffman@44827
   650
huffman@44827
   651
lemma cos_n_Re_cis_pow_n: "cos (real n * a) = Re(cis a ^ n)"
huffman@44827
   652
  by (auto simp add: DeMoivre)
huffman@44827
   653
huffman@44827
   654
lemma sin_n_Im_cis_pow_n: "sin (real n * a) = Im(cis a ^ n)"
huffman@44827
   655
  by (auto simp add: DeMoivre)
huffman@44827
   656
hoelzl@56889
   657
lemma cis_pi: "cis pi = -1"
hoelzl@56889
   658
  by (simp add: complex_eq_iff)
hoelzl@56889
   659
huffman@44827
   660
subsubsection {* $r(\cos \theta + i \sin \theta)$ *}
huffman@44715
   661
hoelzl@56889
   662
definition rcis :: "real \<Rightarrow> real \<Rightarrow> complex" where
huffman@20557
   663
  "rcis r a = complex_of_real r * cis a"
huffman@20557
   664
huffman@44827
   665
lemma Re_rcis [simp]: "Re(rcis r a) = r * cos a"
huffman@44828
   666
  by (simp add: rcis_def)
huffman@44827
   667
huffman@44827
   668
lemma Im_rcis [simp]: "Im(rcis r a) = r * sin a"
huffman@44828
   669
  by (simp add: rcis_def)
huffman@44827
   670
huffman@44827
   671
lemma rcis_Ex: "\<exists>r a. z = rcis r a"
huffman@44828
   672
  by (simp add: complex_eq_iff polar_Ex)
huffman@44827
   673
huffman@44827
   674
lemma complex_mod_rcis [simp]: "cmod(rcis r a) = abs r"
huffman@44828
   675
  by (simp add: rcis_def norm_mult)
huffman@44827
   676
huffman@44827
   677
lemma cis_rcis_eq: "cis a = rcis 1 a"
huffman@44827
   678
  by (simp add: rcis_def)
huffman@44827
   679
huffman@44827
   680
lemma rcis_mult: "rcis r1 a * rcis r2 b = rcis (r1*r2) (a + b)"
huffman@44828
   681
  by (simp add: rcis_def cis_mult)
huffman@44827
   682
huffman@44827
   683
lemma rcis_zero_mod [simp]: "rcis 0 a = 0"
huffman@44827
   684
  by (simp add: rcis_def)
huffman@44827
   685
huffman@44827
   686
lemma rcis_zero_arg [simp]: "rcis r 0 = complex_of_real r"
huffman@44827
   687
  by (simp add: rcis_def)
huffman@44827
   688
huffman@44828
   689
lemma rcis_eq_zero_iff [simp]: "rcis r a = 0 \<longleftrightarrow> r = 0"
huffman@44828
   690
  by (simp add: rcis_def)
huffman@44828
   691
huffman@44827
   692
lemma DeMoivre2: "(rcis r a) ^ n = rcis (r ^ n) (real n * a)"
huffman@44827
   693
  by (simp add: rcis_def power_mult_distrib DeMoivre)
huffman@44827
   694
huffman@44827
   695
lemma rcis_inverse: "inverse(rcis r a) = rcis (1/r) (-a)"
huffman@44827
   696
  by (simp add: divide_inverse rcis_def)
huffman@44827
   697
huffman@44827
   698
lemma rcis_divide: "rcis r1 a / rcis r2 b = rcis (r1/r2) (a - b)"
huffman@44828
   699
  by (simp add: rcis_def cis_divide [symmetric])
huffman@44827
   700
huffman@44827
   701
subsubsection {* Complex exponential *}
huffman@44827
   702
lp15@59658
   703
abbreviation Exp :: "complex \<Rightarrow> complex"
lp15@59658
   704
  where "Exp \<equiv> exp"
huffman@44291
   705
hoelzl@56889
   706
lemma cis_conv_exp: "cis b = exp (\<i> * b)"
hoelzl@56889
   707
proof -
hoelzl@56889
   708
  { fix n :: nat
hoelzl@56889
   709
    have "\<i> ^ n = fact n *\<^sub>R (cos_coeff n + \<i> * sin_coeff n)"
hoelzl@56889
   710
      by (induct n)
hoelzl@56889
   711
         (simp_all add: sin_coeff_Suc cos_coeff_Suc complex_eq_iff Re_divide Im_divide field_simps
hoelzl@56889
   712
                        power2_eq_square real_of_nat_Suc add_nonneg_eq_0_iff
hoelzl@56889
   713
                        real_of_nat_def[symmetric])
hoelzl@56889
   714
    then have "(\<i> * complex_of_real b) ^ n /\<^sub>R fact n =
hoelzl@56889
   715
        of_real (cos_coeff n * b^n) + \<i> * of_real (sin_coeff n * b^n)"
hoelzl@56889
   716
      by (simp add: field_simps) }
lp15@59658
   717
  then show ?thesis using sin_converges [of b] cos_converges [of b]
hoelzl@56889
   718
    by (auto simp add: cis.ctr exp_def simp del: of_real_mult
lp15@59658
   719
             intro!: sums_unique sums_add sums_mult sums_of_real)
huffman@44291
   720
qed
huffman@44291
   721
lp15@59658
   722
lemma Exp_eq_polar: "Exp z = exp (Re z) * cis (Im z)"
hoelzl@56889
   723
  unfolding cis_conv_exp exp_of_real [symmetric] mult_exp_exp by (cases z) simp
huffman@20557
   724
huffman@44828
   725
lemma Re_exp: "Re (exp z) = exp (Re z) * cos (Im z)"
lp15@59658
   726
  unfolding Exp_eq_polar by simp
huffman@44828
   727
huffman@44828
   728
lemma Im_exp: "Im (exp z) = exp (Re z) * sin (Im z)"
lp15@59658
   729
  unfolding Exp_eq_polar by simp
huffman@44828
   730
lp15@59746
   731
lemma norm_cos_sin [simp]: "norm (Complex (cos t) (sin t)) = 1"
lp15@59746
   732
  by (simp add: norm_complex_def)
lp15@59746
   733
lp15@59746
   734
lemma norm_exp_eq_Re [simp]: "norm (exp z) = exp (Re z)"
lp15@59746
   735
  by (simp add: cis.code cmod_complex_polar Exp_eq_polar)
lp15@59746
   736
lp15@59658
   737
lemma complex_Exp_Ex: "\<exists>a r. z = complex_of_real r * Exp a"
lp15@59746
   738
  apply (insert rcis_Ex [of z])
lp15@59746
   739
  apply (auto simp add: Exp_eq_polar rcis_def mult.assoc [symmetric])
lp15@59746
   740
  apply (rule_tac x = "ii * complex_of_real a" in exI, auto)
lp15@59746
   741
  done
paulson@14323
   742
lp15@59658
   743
lemma Exp_two_pi_i [simp]: "Exp((2::complex) * complex_of_real pi * ii) = 1"
lp15@59658
   744
  by (simp add: Exp_eq_polar complex_eq_iff)
paulson@14387
   745
huffman@44844
   746
subsubsection {* Complex argument *}
huffman@44844
   747
huffman@44844
   748
definition arg :: "complex \<Rightarrow> real" where
huffman@44844
   749
  "arg z = (if z = 0 then 0 else (SOME a. sgn z = cis a \<and> -pi < a \<and> a \<le> pi))"
huffman@44844
   750
huffman@44844
   751
lemma arg_zero: "arg 0 = 0"
huffman@44844
   752
  by (simp add: arg_def)
huffman@44844
   753
huffman@44844
   754
lemma arg_unique:
huffman@44844
   755
  assumes "sgn z = cis x" and "-pi < x" and "x \<le> pi"
huffman@44844
   756
  shows "arg z = x"
huffman@44844
   757
proof -
huffman@44844
   758
  from assms have "z \<noteq> 0" by auto
huffman@44844
   759
  have "(SOME a. sgn z = cis a \<and> -pi < a \<and> a \<le> pi) = x"
huffman@44844
   760
  proof
huffman@44844
   761
    fix a def d \<equiv> "a - x"
huffman@44844
   762
    assume a: "sgn z = cis a \<and> - pi < a \<and> a \<le> pi"
huffman@44844
   763
    from a assms have "- (2*pi) < d \<and> d < 2*pi"
huffman@44844
   764
      unfolding d_def by simp
huffman@44844
   765
    moreover from a assms have "cos a = cos x" and "sin a = sin x"
huffman@44844
   766
      by (simp_all add: complex_eq_iff)
wenzelm@53374
   767
    hence cos: "cos d = 1" unfolding d_def cos_diff by simp
wenzelm@53374
   768
    moreover from cos have "sin d = 0" by (rule cos_one_sin_zero)
huffman@44844
   769
    ultimately have "d = 0"
haftmann@58709
   770
      unfolding sin_zero_iff
haftmann@58740
   771
      by (auto elim!: evenE dest!: less_2_cases)
huffman@44844
   772
    thus "a = x" unfolding d_def by simp
huffman@44844
   773
  qed (simp add: assms del: Re_sgn Im_sgn)
huffman@44844
   774
  with `z \<noteq> 0` show "arg z = x"
huffman@44844
   775
    unfolding arg_def by simp
huffman@44844
   776
qed
huffman@44844
   777
huffman@44844
   778
lemma arg_correct:
huffman@44844
   779
  assumes "z \<noteq> 0" shows "sgn z = cis (arg z) \<and> -pi < arg z \<and> arg z \<le> pi"
huffman@44844
   780
proof (simp add: arg_def assms, rule someI_ex)
huffman@44844
   781
  obtain r a where z: "z = rcis r a" using rcis_Ex by fast
huffman@44844
   782
  with assms have "r \<noteq> 0" by auto
huffman@44844
   783
  def b \<equiv> "if 0 < r then a else a + pi"
huffman@44844
   784
  have b: "sgn z = cis b"
huffman@44844
   785
    unfolding z b_def rcis_def using `r \<noteq> 0`
hoelzl@56889
   786
    by (simp add: of_real_def sgn_scaleR sgn_if complex_eq_iff)
huffman@44844
   787
  have cis_2pi_nat: "\<And>n. cis (2 * pi * real_of_nat n) = 1"
hoelzl@56889
   788
    by (induct_tac n) (simp_all add: distrib_left cis_mult [symmetric] complex_eq_iff)
huffman@44844
   789
  have cis_2pi_int: "\<And>x. cis (2 * pi * real_of_int x) = 1"
hoelzl@56889
   790
    by (case_tac x rule: int_diff_cases)
hoelzl@56889
   791
       (simp add: right_diff_distrib cis_divide [symmetric] cis_2pi_nat)
huffman@44844
   792
  def c \<equiv> "b - 2*pi * of_int \<lceil>(b - pi) / (2*pi)\<rceil>"
huffman@44844
   793
  have "sgn z = cis c"
huffman@44844
   794
    unfolding b c_def
huffman@44844
   795
    by (simp add: cis_divide [symmetric] cis_2pi_int)
huffman@44844
   796
  moreover have "- pi < c \<and> c \<le> pi"
huffman@44844
   797
    using ceiling_correct [of "(b - pi) / (2*pi)"]
huffman@44844
   798
    by (simp add: c_def less_divide_eq divide_le_eq algebra_simps)
huffman@44844
   799
  ultimately show "\<exists>a. sgn z = cis a \<and> -pi < a \<and> a \<le> pi" by fast
huffman@44844
   800
qed
huffman@44844
   801
huffman@44844
   802
lemma arg_bounded: "- pi < arg z \<and> arg z \<le> pi"
hoelzl@56889
   803
  by (cases "z = 0") (simp_all add: arg_zero arg_correct)
huffman@44844
   804
huffman@44844
   805
lemma cis_arg: "z \<noteq> 0 \<Longrightarrow> cis (arg z) = sgn z"
huffman@44844
   806
  by (simp add: arg_correct)
huffman@44844
   807
huffman@44844
   808
lemma rcis_cmod_arg: "rcis (cmod z) (arg z) = z"
hoelzl@56889
   809
  by (cases "z = 0") (simp_all add: rcis_def cis_arg sgn_div_norm of_real_def)
hoelzl@56889
   810
hoelzl@56889
   811
lemma cos_arg_i_mult_zero [simp]: "y \<noteq> 0 \<Longrightarrow> Re y = 0 \<Longrightarrow> cos (arg y) = 0"
hoelzl@56889
   812
  using cis_arg [of y] by (simp add: complex_eq_iff)
hoelzl@56889
   813
hoelzl@56889
   814
subsection {* Square root of complex numbers *}
hoelzl@56889
   815
hoelzl@56889
   816
primcorec csqrt :: "complex \<Rightarrow> complex" where
hoelzl@56889
   817
  "Re (csqrt z) = sqrt ((cmod z + Re z) / 2)"
hoelzl@56889
   818
| "Im (csqrt z) = (if Im z = 0 then 1 else sgn (Im z)) * sqrt ((cmod z - Re z) / 2)"
hoelzl@56889
   819
hoelzl@56889
   820
lemma csqrt_of_real_nonneg [simp]: "Im x = 0 \<Longrightarrow> Re x \<ge> 0 \<Longrightarrow> csqrt x = sqrt (Re x)"
hoelzl@56889
   821
  by (simp add: complex_eq_iff norm_complex_def)
hoelzl@56889
   822
hoelzl@56889
   823
lemma csqrt_of_real_nonpos [simp]: "Im x = 0 \<Longrightarrow> Re x \<le> 0 \<Longrightarrow> csqrt x = \<i> * sqrt \<bar>Re x\<bar>"
hoelzl@56889
   824
  by (simp add: complex_eq_iff norm_complex_def)
hoelzl@56889
   825
hoelzl@56889
   826
lemma csqrt_0 [simp]: "csqrt 0 = 0"
hoelzl@56889
   827
  by simp
hoelzl@56889
   828
hoelzl@56889
   829
lemma csqrt_1 [simp]: "csqrt 1 = 1"
hoelzl@56889
   830
  by simp
hoelzl@56889
   831
hoelzl@56889
   832
lemma csqrt_ii [simp]: "csqrt \<i> = (1 + \<i>) / sqrt 2"
hoelzl@56889
   833
  by (simp add: complex_eq_iff Re_divide Im_divide real_sqrt_divide real_div_sqrt)
huffman@44844
   834
lp15@59741
   835
lemma power2_csqrt[simp,algebra]: "(csqrt z)\<^sup>2 = z"
hoelzl@56889
   836
proof cases
hoelzl@56889
   837
  assume "Im z = 0" then show ?thesis
hoelzl@56889
   838
    using real_sqrt_pow2[of "Re z"] real_sqrt_pow2[of "- Re z"]
hoelzl@56889
   839
    by (cases "0::real" "Re z" rule: linorder_cases)
hoelzl@56889
   840
       (simp_all add: complex_eq_iff Re_power2 Im_power2 power2_eq_square cmod_eq_Re)
hoelzl@56889
   841
next
hoelzl@56889
   842
  assume "Im z \<noteq> 0"
hoelzl@56889
   843
  moreover
hoelzl@56889
   844
  have "cmod z * cmod z - Re z * Re z = Im z * Im z"
hoelzl@56889
   845
    by (simp add: norm_complex_def power2_eq_square)
hoelzl@56889
   846
  moreover
hoelzl@56889
   847
  have "\<bar>Re z\<bar> \<le> cmod z"
hoelzl@56889
   848
    by (simp add: norm_complex_def)
hoelzl@56889
   849
  ultimately show ?thesis
hoelzl@56889
   850
    by (simp add: Re_power2 Im_power2 complex_eq_iff real_sgn_eq
hoelzl@56889
   851
                  field_simps real_sqrt_mult[symmetric] real_sqrt_divide)
hoelzl@56889
   852
qed
hoelzl@56889
   853
hoelzl@56889
   854
lemma csqrt_eq_0 [simp]: "csqrt z = 0 \<longleftrightarrow> z = 0"
hoelzl@56889
   855
  by auto (metis power2_csqrt power_eq_0_iff)
hoelzl@56889
   856
hoelzl@56889
   857
lemma csqrt_eq_1 [simp]: "csqrt z = 1 \<longleftrightarrow> z = 1"
hoelzl@56889
   858
  by auto (metis power2_csqrt power2_eq_1_iff)
hoelzl@56889
   859
hoelzl@56889
   860
lemma csqrt_principal: "0 < Re (csqrt z) \<or> Re (csqrt z) = 0 \<and> 0 \<le> Im (csqrt z)"
hoelzl@56889
   861
  by (auto simp add: not_less cmod_plus_Re_le_0_iff Im_eq_0)
hoelzl@56889
   862
hoelzl@56889
   863
lemma Re_csqrt: "0 \<le> Re (csqrt z)"
hoelzl@56889
   864
  by (metis csqrt_principal le_less)
hoelzl@56889
   865
hoelzl@56889
   866
lemma csqrt_square:
hoelzl@56889
   867
  assumes "0 < Re b \<or> (Re b = 0 \<and> 0 \<le> Im b)"
hoelzl@56889
   868
  shows "csqrt (b^2) = b"
hoelzl@56889
   869
proof -
hoelzl@56889
   870
  have "csqrt (b^2) = b \<or> csqrt (b^2) = - b"
hoelzl@56889
   871
    unfolding power2_eq_iff[symmetric] by (simp add: power2_csqrt)
hoelzl@56889
   872
  moreover have "csqrt (b^2) \<noteq> -b \<or> b = 0"
hoelzl@56889
   873
    using csqrt_principal[of "b ^ 2"] assms by (intro disjCI notI) (auto simp: complex_eq_iff)
hoelzl@56889
   874
  ultimately show ?thesis
hoelzl@56889
   875
    by auto
hoelzl@56889
   876
qed
hoelzl@56889
   877
lp15@59746
   878
lemma csqrt_unique:
lp15@59746
   879
    "w^2 = z \<Longrightarrow> (0 < Re w \<or> Re w = 0 \<and> 0 \<le> Im w) \<Longrightarrow> csqrt z = w"
lp15@59746
   880
  by (auto simp: csqrt_square)
lp15@59746
   881
lp15@59613
   882
lemma csqrt_minus [simp]:
hoelzl@56889
   883
  assumes "Im x < 0 \<or> (Im x = 0 \<and> 0 \<le> Re x)"
hoelzl@56889
   884
  shows "csqrt (- x) = \<i> * csqrt x"
hoelzl@56889
   885
proof -
hoelzl@56889
   886
  have "csqrt ((\<i> * csqrt x)^2) = \<i> * csqrt x"
hoelzl@56889
   887
  proof (rule csqrt_square)
hoelzl@56889
   888
    have "Im (csqrt x) \<le> 0"
hoelzl@56889
   889
      using assms by (auto simp add: cmod_eq_Re mult_le_0_iff field_simps complex_Re_le_cmod)
hoelzl@56889
   890
    then show "0 < Re (\<i> * csqrt x) \<or> Re (\<i> * csqrt x) = 0 \<and> 0 \<le> Im (\<i> * csqrt x)"
hoelzl@56889
   891
      by (auto simp add: Re_csqrt simp del: csqrt.simps)
hoelzl@56889
   892
  qed
hoelzl@56889
   893
  also have "(\<i> * csqrt x)^2 = - x"
lp15@59746
   894
    by (simp add: power_mult_distrib)
hoelzl@56889
   895
  finally show ?thesis .
hoelzl@56889
   896
qed
huffman@44844
   897
huffman@44065
   898
text {* Legacy theorem names *}
huffman@44065
   899
huffman@44065
   900
lemmas expand_complex_eq = complex_eq_iff
huffman@44065
   901
lemmas complex_Re_Im_cancel_iff = complex_eq_iff
huffman@44065
   902
lemmas complex_equality = complex_eqI
hoelzl@56889
   903
lemmas cmod_def = norm_complex_def
hoelzl@56889
   904
lemmas complex_norm_def = norm_complex_def
hoelzl@56889
   905
lemmas complex_divide_def = divide_complex_def
hoelzl@56889
   906
hoelzl@56889
   907
lemma legacy_Complex_simps:
hoelzl@56889
   908
  shows Complex_eq_0: "Complex a b = 0 \<longleftrightarrow> a = 0 \<and> b = 0"
hoelzl@56889
   909
    and complex_add: "Complex a b + Complex c d = Complex (a + c) (b + d)"
hoelzl@56889
   910
    and complex_minus: "- (Complex a b) = Complex (- a) (- b)"
hoelzl@56889
   911
    and complex_diff: "Complex a b - Complex c d = Complex (a - c) (b - d)"
hoelzl@56889
   912
    and Complex_eq_1: "Complex a b = 1 \<longleftrightarrow> a = 1 \<and> b = 0"
hoelzl@56889
   913
    and Complex_eq_neg_1: "Complex a b = - 1 \<longleftrightarrow> a = - 1 \<and> b = 0"
hoelzl@56889
   914
    and complex_mult: "Complex a b * Complex c d = Complex (a * c - b * d) (a * d + b * c)"
hoelzl@56889
   915
    and complex_inverse: "inverse (Complex a b) = Complex (a / (a\<^sup>2 + b\<^sup>2)) (- b / (a\<^sup>2 + b\<^sup>2))"
hoelzl@56889
   916
    and Complex_eq_numeral: "Complex a b = numeral w \<longleftrightarrow> a = numeral w \<and> b = 0"
hoelzl@56889
   917
    and Complex_eq_neg_numeral: "Complex a b = - numeral w \<longleftrightarrow> a = - numeral w \<and> b = 0"
hoelzl@56889
   918
    and complex_scaleR: "scaleR r (Complex a b) = Complex (r * a) (r * b)"
hoelzl@56889
   919
    and Complex_eq_i: "(Complex x y = ii) = (x = 0 \<and> y = 1)"
hoelzl@56889
   920
    and i_mult_Complex: "ii * Complex a b = Complex (- b) a"
hoelzl@56889
   921
    and Complex_mult_i: "Complex a b * ii = Complex (- b) a"
hoelzl@56889
   922
    and i_complex_of_real: "ii * complex_of_real r = Complex 0 r"
hoelzl@56889
   923
    and complex_of_real_i: "complex_of_real r * ii = Complex 0 r"
hoelzl@56889
   924
    and Complex_add_complex_of_real: "Complex x y + complex_of_real r = Complex (x+r) y"
hoelzl@56889
   925
    and complex_of_real_add_Complex: "complex_of_real r + Complex x y = Complex (r+x) y"
hoelzl@56889
   926
    and Complex_mult_complex_of_real: "Complex x y * complex_of_real r = Complex (x*r) (y*r)"
hoelzl@56889
   927
    and complex_of_real_mult_Complex: "complex_of_real r * Complex x y = Complex (r*x) (r*y)"
hoelzl@56889
   928
    and complex_eq_cancel_iff2: "(Complex x y = complex_of_real xa) = (x = xa & y = 0)"
hoelzl@56889
   929
    and complex_cn: "cnj (Complex a b) = Complex a (- b)"
hoelzl@56889
   930
    and Complex_setsum': "setsum (%x. Complex (f x) 0) s = Complex (setsum f s) 0"
hoelzl@56889
   931
    and Complex_setsum: "Complex (setsum f s) 0 = setsum (%x. Complex (f x) 0) s"
hoelzl@56889
   932
    and complex_of_real_def: "complex_of_real r = Complex r 0"
hoelzl@56889
   933
    and complex_norm: "cmod (Complex x y) = sqrt (x\<^sup>2 + y\<^sup>2)"
hoelzl@56889
   934
  by (simp_all add: norm_complex_def field_simps complex_eq_iff Re_divide Im_divide del: Complex_eq)
hoelzl@56889
   935
hoelzl@56889
   936
lemma Complex_in_Reals: "Complex x 0 \<in> \<real>"
hoelzl@56889
   937
  by (metis Reals_of_real complex_of_real_def)
huffman@44065
   938
paulson@13957
   939
end