src/HOL/Real/RealPow.thy
author obua
Thu Jun 07 14:26:05 2007 +0200 (2007-06-07)
changeset 23292 1c39f1bd1f53
parent 23291 9179346e1208
child 23293 77577fc2f141
permissions -rw-r--r--
deleted legacy lemmas
wenzelm@9435
     1
(*  Title       : HOL/Real/RealPow.thy
paulson@7219
     2
    ID          : $Id$
paulson@7077
     3
    Author      : Jacques D. Fleuriot  
paulson@7077
     4
    Copyright   : 1998  University of Cambridge
huffman@20634
     5
*)
paulson@7077
     6
huffman@20634
     7
header {* Natural powers theory *}
paulson@7077
     8
nipkow@15131
     9
theory RealPow
nipkow@15140
    10
imports RealDef
nipkow@15131
    11
begin
wenzelm@9435
    12
paulson@14348
    13
declare abs_mult_self [simp]
paulson@14348
    14
wenzelm@10309
    15
instance real :: power ..
paulson@7077
    16
wenzelm@8856
    17
primrec (realpow)
paulson@12018
    18
     realpow_0:   "r ^ 0       = 1"
wenzelm@9435
    19
     realpow_Suc: "r ^ (Suc n) = (r::real) * (r ^ n)"
paulson@7077
    20
paulson@14265
    21
paulson@15003
    22
instance real :: recpower
paulson@14348
    23
proof
paulson@14348
    24
  fix z :: real
paulson@14348
    25
  fix n :: nat
paulson@14348
    26
  show "z^0 = 1" by simp
paulson@14348
    27
  show "z^(Suc n) = z * (z^n)" by simp
paulson@14348
    28
qed
paulson@14265
    29
paulson@14348
    30
obua@23292
    31
(*lemma realpow_zero_zero: "r ^ n = (0::real) ==> r = 0"
paulson@14268
    32
by simp
paulson@14265
    33
paulson@14265
    34
lemma realpow_two: "(r::real)^ (Suc (Suc 0)) = r * r"
paulson@14268
    35
by simp
paulson@14265
    36
wenzelm@19765
    37
text{*Legacy: weaker version of the theorem @{text power_strict_mono}*}
paulson@14348
    38
lemma realpow_less:
paulson@14348
    39
     "[|(0::real) < x; x < y; 0 < n|] ==> x ^ n < y ^ n"
obua@23292
    40
thm power_strict_mono
paulson@14348
    41
apply (rule power_strict_mono, auto) 
obua@23292
    42
done *)
obua@23292
    43
obua@23292
    44
(* declare [simp del]: zero_le_power
paulson@14265
    45
paulson@14268
    46
lemma realpow_two_le [simp]: "(0::real) \<le> r^ Suc (Suc 0)"
nipkow@23291
    47
by (simp)
paulson@14265
    48
obua@23292
    49
paulson@14268
    50
lemma abs_realpow_two [simp]: "abs((x::real)^Suc (Suc 0)) = x^Suc (Suc 0)"
obua@23292
    51
by (simp)
paulson@14265
    52
paulson@14268
    53
lemma realpow_two_abs [simp]: "abs(x::real)^Suc (Suc 0) = x^Suc (Suc 0)"
obua@23292
    54
by (simp)
paulson@14265
    55
obua@23292
    56
*)
paulson@14268
    57
lemma two_realpow_ge_one [simp]: "(1::real) \<le> 2 ^ n"
obua@23292
    58
by (rule power_increasing[of 0 n "2::real", simplified])
paulson@14265
    59
paulson@14268
    60
lemma two_realpow_gt [simp]: "real (n::nat) < 2 ^ n"
paulson@15251
    61
apply (induct "n")
paulson@14265
    62
apply (auto simp add: real_of_nat_Suc)
paulson@14387
    63
apply (subst mult_2)
huffman@22962
    64
apply (rule add_less_le_mono)
paulson@14265
    65
apply (auto simp add: two_realpow_ge_one)
paulson@14265
    66
done
paulson@14265
    67
paulson@14348
    68
lemma realpow_Suc_le_self: "[| 0 \<le> r; r \<le> (1::real) |] ==> r ^ Suc n \<le> r"
paulson@14348
    69
by (insert power_decreasing [of 1 "Suc n" r], simp)
paulson@14265
    70
paulson@14348
    71
lemma realpow_minus_mult [rule_format]:
paulson@14348
    72
     "0 < n --> (x::real) ^ (n - 1) * x = x ^ n" 
paulson@14348
    73
apply (simp split add: nat_diff_split)
paulson@14265
    74
done
paulson@14265
    75
paulson@14348
    76
lemma realpow_two_mult_inverse [simp]:
paulson@14348
    77
     "r \<noteq> 0 ==> r * inverse r ^Suc (Suc 0) = inverse (r::real)"
obua@23292
    78
by (simp add:  real_mult_assoc [symmetric])
paulson@14265
    79
paulson@14268
    80
lemma realpow_two_minus [simp]: "(-x)^Suc (Suc 0) = (x::real)^Suc (Suc 0)"
paulson@14268
    81
by simp
paulson@14265
    82
paulson@14348
    83
lemma realpow_two_diff:
paulson@14348
    84
     "(x::real)^Suc (Suc 0) - y^Suc (Suc 0) = (x - y) * (x + y)"
paulson@14265
    85
apply (unfold real_diff_def)
paulson@14334
    86
apply (simp add: right_distrib left_distrib mult_ac)
paulson@14265
    87
done
paulson@14265
    88
paulson@14348
    89
lemma realpow_two_disj:
paulson@14348
    90
     "((x::real)^Suc (Suc 0) = y^Suc (Suc 0)) = (x = y | x = -y)"
paulson@14268
    91
apply (cut_tac x = x and y = y in realpow_two_diff)
paulson@14265
    92
apply (auto simp del: realpow_Suc)
paulson@14265
    93
done
paulson@14265
    94
paulson@14265
    95
lemma realpow_real_of_nat: "real (m::nat) ^ n = real (m ^ n)"
paulson@15251
    96
apply (induct "n")
paulson@14265
    97
apply (auto simp add: real_of_nat_one real_of_nat_mult)
paulson@14265
    98
done
paulson@14265
    99
paulson@14268
   100
lemma realpow_real_of_nat_two_pos [simp] : "0 < real (Suc (Suc 0) ^ n)"
paulson@15251
   101
apply (induct "n")
paulson@14334
   102
apply (auto simp add: real_of_nat_mult zero_less_mult_iff)
paulson@14265
   103
done
paulson@14265
   104
huffman@22962
   105
(* used by AFP Integration theory *)
paulson@14265
   106
lemma realpow_increasing:
paulson@14348
   107
     "[|(0::real) \<le> x; 0 \<le> y; x ^ Suc n \<le> y ^ Suc n|] ==> x \<le> y"
paulson@14348
   108
  by (rule power_le_imp_le_base)
paulson@14265
   109
paulson@14265
   110
paulson@14348
   111
subsection{*Literal Arithmetic Involving Powers, Type @{typ real}*}
paulson@14265
   112
paulson@14265
   113
lemma real_of_int_power: "real (x::int) ^ n = real (x ^ n)"
paulson@15251
   114
apply (induct "n")
paulson@14387
   115
apply (simp_all add: nat_mult_distrib)
paulson@14265
   116
done
paulson@14265
   117
declare real_of_int_power [symmetric, simp]
paulson@14265
   118
paulson@14348
   119
lemma power_real_number_of:
paulson@14348
   120
     "(number_of v :: real) ^ n = real ((number_of v :: int) ^ n)"
paulson@14387
   121
by (simp only: real_number_of [symmetric] real_of_int_power)
paulson@14265
   122
paulson@14265
   123
declare power_real_number_of [of _ "number_of w", standard, simp]
paulson@14265
   124
paulson@14265
   125
huffman@22967
   126
subsection {* Properties of Squares *}
huffman@22967
   127
huffman@22967
   128
lemma sum_squares_ge_zero:
huffman@22967
   129
  fixes x y :: "'a::ordered_ring_strict"
huffman@22967
   130
  shows "0 \<le> x * x + y * y"
huffman@22967
   131
by (intro add_nonneg_nonneg zero_le_square)
huffman@22967
   132
huffman@22967
   133
lemma not_sum_squares_lt_zero:
huffman@22967
   134
  fixes x y :: "'a::ordered_ring_strict"
huffman@22967
   135
  shows "\<not> x * x + y * y < 0"
huffman@22967
   136
by (simp add: linorder_not_less sum_squares_ge_zero)
huffman@22967
   137
huffman@22967
   138
lemma sum_nonneg_eq_zero_iff:
huffman@22967
   139
  fixes x y :: "'a::pordered_ab_group_add"
huffman@22967
   140
  assumes x: "0 \<le> x" and y: "0 \<le> y"
huffman@22967
   141
  shows "(x + y = 0) = (x = 0 \<and> y = 0)"
huffman@22967
   142
proof (auto)
huffman@22967
   143
  from y have "x + 0 \<le> x + y" by (rule add_left_mono)
huffman@22967
   144
  also assume "x + y = 0"
huffman@22967
   145
  finally have "x \<le> 0" by simp
huffman@22967
   146
  thus "x = 0" using x by (rule order_antisym)
huffman@22967
   147
next
huffman@22967
   148
  from x have "0 + y \<le> x + y" by (rule add_right_mono)
huffman@22967
   149
  also assume "x + y = 0"
huffman@22967
   150
  finally have "y \<le> 0" by simp
huffman@22967
   151
  thus "y = 0" using y by (rule order_antisym)
huffman@22967
   152
qed
huffman@22967
   153
huffman@22967
   154
lemma sum_squares_eq_zero_iff:
huffman@22967
   155
  fixes x y :: "'a::ordered_ring_strict"
huffman@22967
   156
  shows "(x * x + y * y = 0) = (x = 0 \<and> y = 0)"
nipkow@23096
   157
by (simp add: sum_nonneg_eq_zero_iff)
huffman@22967
   158
huffman@22967
   159
lemma sum_squares_le_zero_iff:
huffman@22967
   160
  fixes x y :: "'a::ordered_ring_strict"
huffman@22967
   161
  shows "(x * x + y * y \<le> 0) = (x = 0 \<and> y = 0)"
huffman@22967
   162
by (simp add: order_le_less not_sum_squares_lt_zero sum_squares_eq_zero_iff)
huffman@22967
   163
huffman@22967
   164
lemma sum_squares_gt_zero_iff:
huffman@22967
   165
  fixes x y :: "'a::ordered_ring_strict"
huffman@22967
   166
  shows "(0 < x * x + y * y) = (x \<noteq> 0 \<or> y \<noteq> 0)"
huffman@22967
   167
by (simp add: order_less_le sum_squares_ge_zero sum_squares_eq_zero_iff)
huffman@22967
   168
huffman@22967
   169
lemma sum_power2_ge_zero:
huffman@22967
   170
  fixes x y :: "'a::{ordered_idom,recpower}"
huffman@22967
   171
  shows "0 \<le> x\<twosuperior> + y\<twosuperior>"
huffman@22967
   172
unfolding power2_eq_square by (rule sum_squares_ge_zero)
huffman@22967
   173
huffman@22967
   174
lemma not_sum_power2_lt_zero:
huffman@22967
   175
  fixes x y :: "'a::{ordered_idom,recpower}"
huffman@22967
   176
  shows "\<not> x\<twosuperior> + y\<twosuperior> < 0"
huffman@22967
   177
unfolding power2_eq_square by (rule not_sum_squares_lt_zero)
huffman@22967
   178
huffman@22967
   179
lemma sum_power2_eq_zero_iff:
huffman@22967
   180
  fixes x y :: "'a::{ordered_idom,recpower}"
huffman@22967
   181
  shows "(x\<twosuperior> + y\<twosuperior> = 0) = (x = 0 \<and> y = 0)"
huffman@22967
   182
unfolding power2_eq_square by (rule sum_squares_eq_zero_iff)
huffman@22967
   183
huffman@22967
   184
lemma sum_power2_le_zero_iff:
huffman@22967
   185
  fixes x y :: "'a::{ordered_idom,recpower}"
huffman@22967
   186
  shows "(x\<twosuperior> + y\<twosuperior> \<le> 0) = (x = 0 \<and> y = 0)"
huffman@22967
   187
unfolding power2_eq_square by (rule sum_squares_le_zero_iff)
huffman@22967
   188
huffman@22967
   189
lemma sum_power2_gt_zero_iff:
huffman@22967
   190
  fixes x y :: "'a::{ordered_idom,recpower}"
huffman@22967
   191
  shows "(0 < x\<twosuperior> + y\<twosuperior>) = (x \<noteq> 0 \<or> y \<noteq> 0)"
huffman@22967
   192
unfolding power2_eq_square by (rule sum_squares_gt_zero_iff)
huffman@22967
   193
huffman@22967
   194
huffman@22970
   195
subsection{* Squares of Reals *}
huffman@22970
   196
huffman@22970
   197
lemma real_two_squares_add_zero_iff [simp]:
huffman@22970
   198
  "(x * x + y * y = 0) = ((x::real) = 0 \<and> y = 0)"
huffman@22970
   199
by (rule sum_squares_eq_zero_iff)
huffman@22970
   200
huffman@22970
   201
lemma real_sum_squares_cancel: "x * x + y * y = 0 ==> x = (0::real)"
huffman@22970
   202
by simp
huffman@22970
   203
huffman@22970
   204
lemma real_sum_squares_cancel2: "x * x + y * y = 0 ==> y = (0::real)"
huffman@22970
   205
by simp
huffman@22970
   206
huffman@22970
   207
lemma real_mult_self_sum_ge_zero: "(0::real) \<le> x*x + y*y"
huffman@22970
   208
by (rule sum_squares_ge_zero)
paulson@14268
   209
paulson@14268
   210
lemma real_sum_squares_cancel_a: "x * x = -(y * y) ==> x = (0::real) & y=0"
huffman@22970
   211
by (simp add: real_add_eq_0_iff [symmetric])
paulson@14268
   212
paulson@14268
   213
lemma real_squared_diff_one_factored: "x*x - (1::real) = (x + 1)*(x - 1)"
huffman@22970
   214
by (simp add: left_distrib right_diff_distrib)
paulson@14268
   215
paulson@14348
   216
lemma real_mult_is_one [simp]: "(x*x = (1::real)) = (x = 1 | x = - 1)"
paulson@14268
   217
apply auto
paulson@14268
   218
apply (drule right_minus_eq [THEN iffD2]) 
paulson@14268
   219
apply (auto simp add: real_squared_diff_one_factored)
paulson@14268
   220
done
paulson@14268
   221
huffman@22970
   222
lemma real_sum_squares_not_zero: "x ~= 0 ==> x * x + y * y ~= (0::real)"
huffman@22970
   223
by simp
huffman@22970
   224
huffman@22970
   225
lemma real_sum_squares_not_zero2: "y ~= 0 ==> x * x + y * y ~= (0::real)"
huffman@22970
   226
by simp
huffman@22970
   227
huffman@22970
   228
lemma realpow_two_sum_zero_iff [simp]:
huffman@22970
   229
     "(x ^ 2 + y ^ 2 = (0::real)) = (x = 0 & y = 0)"
huffman@22970
   230
by (rule sum_power2_eq_zero_iff)
huffman@22970
   231
huffman@22970
   232
lemma realpow_two_le_add_order [simp]: "(0::real) \<le> u ^ 2 + v ^ 2"
huffman@22970
   233
by (rule sum_power2_ge_zero)
huffman@22970
   234
huffman@22970
   235
lemma realpow_two_le_add_order2 [simp]: "(0::real) \<le> u ^ 2 + v ^ 2 + w ^ 2"
huffman@22970
   236
by (intro add_nonneg_nonneg zero_le_power2)
huffman@22970
   237
huffman@22970
   238
lemma real_sum_square_gt_zero: "x ~= 0 ==> (0::real) < x * x + y * y"
huffman@22970
   239
by (simp add: sum_squares_gt_zero_iff)
huffman@22970
   240
huffman@22970
   241
lemma real_sum_square_gt_zero2: "y ~= 0 ==> (0::real) < x * x + y * y"
huffman@22970
   242
by (simp add: sum_squares_gt_zero_iff)
huffman@22970
   243
huffman@22970
   244
lemma real_minus_mult_self_le [simp]: "-(u * u) \<le> (x * (x::real))"
huffman@22970
   245
by (rule_tac j = 0 in real_le_trans, auto)
huffman@22970
   246
huffman@22970
   247
lemma realpow_square_minus_le [simp]: "-(u ^ 2) \<le> (x::real) ^ 2"
huffman@22970
   248
by (auto simp add: power2_eq_square)
huffman@22970
   249
huffman@22970
   250
(* The following theorem is by Benjamin Porter *)
huffman@22970
   251
lemma real_sq_order:
huffman@22970
   252
  fixes x::real
huffman@22970
   253
  assumes xgt0: "0 \<le> x" and ygt0: "0 \<le> y" and sq: "x^2 \<le> y^2"
huffman@22970
   254
  shows "x \<le> y"
huffman@22970
   255
proof -
huffman@22970
   256
  from sq have "x ^ Suc (Suc 0) \<le> y ^ Suc (Suc 0)"
huffman@22970
   257
    by (simp only: numeral_2_eq_2)
huffman@22970
   258
  thus "x \<le> y" using ygt0
huffman@22970
   259
    by (rule power_le_imp_le_base)
huffman@22970
   260
qed
huffman@22970
   261
huffman@22970
   262
huffman@22970
   263
subsection {*Various Other Theorems*}
huffman@22970
   264
paulson@14304
   265
lemma real_le_add_half_cancel: "(x + y/2 \<le> (y::real)) = (x \<le> y /2)"
paulson@14348
   266
by auto
paulson@14268
   267
paulson@14348
   268
lemma real_minus_half_eq [simp]: "(x::real) - x/2 = x/2"
paulson@14348
   269
by auto
paulson@14268
   270
paulson@14268
   271
lemma real_mult_inverse_cancel:
paulson@14268
   272
     "[|(0::real) < x; 0 < x1; x1 * y < x * u |] 
paulson@14268
   273
      ==> inverse x * y < inverse x1 * u"
paulson@14268
   274
apply (rule_tac c=x in mult_less_imp_less_left) 
paulson@14268
   275
apply (auto simp add: real_mult_assoc [symmetric])
paulson@14334
   276
apply (simp (no_asm) add: mult_ac)
paulson@14268
   277
apply (rule_tac c=x1 in mult_less_imp_less_right) 
paulson@14334
   278
apply (auto simp add: mult_ac)
paulson@14268
   279
done
paulson@14268
   280
paulson@14348
   281
lemma real_mult_inverse_cancel2:
paulson@14348
   282
     "[|(0::real) < x;0 < x1; x1 * y < x * u |] ==> y * inverse x < u * inverse x1"
paulson@14334
   283
apply (auto dest: real_mult_inverse_cancel simp add: mult_ac)
paulson@14268
   284
done
paulson@14268
   285
paulson@14348
   286
lemma inverse_real_of_nat_gt_zero [simp]: "0 < inverse (real (Suc n))"
huffman@20517
   287
by simp
paulson@14268
   288
paulson@14348
   289
lemma inverse_real_of_nat_ge_zero [simp]: "0 \<le> inverse (real (Suc n))"
huffman@20517
   290
by simp
paulson@14268
   291
paulson@14268
   292
lemma realpow_num_eq_if: "(m::real) ^ n = (if n=0 then 1 else m * m ^ (n - 1))"
paulson@14348
   293
by (case_tac "n", auto)
paulson@14268
   294
paulson@7077
   295
end