| 1 |
(* ========================================================================== *) |
| 2 |
(* Formal verification of nonlinear inequalities in HOL Light *) |
| 3 |
(* *) |
| 4 |
(* Copyright (c) 2014 Alexey Solovyev *) |
| 5 |
(* *) |
| 6 |
(* This file is distributed under the terms of the MIT licence *) |
| 7 |
(* ========================================================================== *) |
| 8 |
|
| 9 |
(* -------------------------------------------------------------------------- *) |
| 10 |
(* Formal interval evaluation of functions: exp, log (theory) *) |
| 11 |
(* -------------------------------------------------------------------------- *) |
| 12 |
|
| 13 |
needs "Formal_ineqs/trig/series.hl";; |
| 14 |
|
| 15 |
module Exp_log = struct |
| 16 |
|
| 17 |
open Series;; |
| 18 |
|
| 19 |
prioritize_real();; |
| 20 |
|
| 21 |
(* --------------------- *) |
| 22 |
(* exp *) |
| 23 |
(* --------------------- *) |
| 24 |
|
| 25 |
let exp_pos_poly_lower_bound = prove |
| 26 |
(`!x n. &0 <= x ==> |
| 27 |
sum (0..n) (\k. inv (&(FACT k)) * x pow k) <= exp x`, |
| 28 |
REPEAT STRIP_TAC THEN |
| 29 |
REWRITE_TAC[GSYM exp_infsum] THEN |
| 30 |
MP_TAC (SPECL[`0`; `n:num`; `\k. &1 / &(FACT k) * x pow k`] real_infsum_offset) THEN |
| 31 |
MP_TAC (MATCH_MP REAL_SUMS_SUMMABLE (SPEC `x:real` exp_series)) THEN |
| 32 |
REWRITE_TAC[GSYM FROM_0; LE_0] THEN DISCH_TAC THEN |
| 33 |
ASM_REWRITE_TAC[] THEN DISCH_THEN (fun th -> REWRITE_TAC[th]) THEN |
| 34 |
REWRITE_TAC[REAL_ARITH `inv a = &1 / a`; REAL_ARITH `a <= a + b <=> &0 <= b`] THEN |
| 35 |
MATCH_MP_TAC REAL_SERIES_POS THEN |
| 36 |
MAP_EVERY EXISTS_TAC [`\k. &1 / &(FACT k) * x pow k`; `from (n + 1)`] THEN |
| 37 |
ASM_REWRITE_TAC[REAL_SUMS_INFSUM] THEN CONJ_TAC THENL [ |
| 38 |
MATCH_MP_TAC REAL_SUMMABLE_FROM_ELSEWHERE THEN |
| 39 |
EXISTS_TAC `0` THEN ASM_REWRITE_TAC[]; |
| 40 |
ALL_TAC |
| 41 |
] THEN |
| 42 |
REPEAT STRIP_TAC THEN MATCH_MP_TAC REAL_LE_MUL THEN ASM_SIMP_TAC[REAL_POW_LE] THEN |
| 43 |
MATCH_MP_TAC REAL_LE_DIV THEN REWRITE_TAC[REAL_POS]);; |
| 44 |
|
| 45 |
let exp_ge1 = prove |
| 46 |
(`!x. &0 <= x ==> &1 <= exp x`, |
| 47 |
REPEAT STRIP_TAC THEN MP_TAC (SPECL[`x:real`; `0`] exp_pos_poly_lower_bound) THEN |
| 48 |
ASM_REWRITE_TAC[SUM_CLAUSES_NUMSEG; real_pow; FACT; REAL_INV_1; REAL_MUL_LID]);; |
| 49 |
|
| 50 |
let neg_exp_le1 = prove |
| 51 |
(`!x. &0 <= x ==> exp (--x) <= &1`, |
| 52 |
REPEAT STRIP_TAC THEN REWRITE_TAC[REAL_EXP_NEG] THEN |
| 53 |
MATCH_MP_TAC REAL_INV_LE_1 THEN ASM_SIMP_TAC[exp_ge1]);; |
| 54 |
|
| 55 |
let neg_exp_series = prove |
| 56 |
(`!x. ((\k. (-- &1) pow k / &(FACT k) * x pow k) real_sums exp (--x)) (from 0)`, |
| 57 |
GEN_TAC THEN MP_TAC (SPEC `--x:real` exp_series) THEN |
| 58 |
SUBGOAL_THEN `!k. &1 / &(FACT k) * --x pow k = (-- &1) pow k / &(FACT k) * x pow k` ASSUME_TAC THENL [ |
| 59 |
GEN_TAC THEN ONCE_REWRITE_TAC[REAL_ARITH `--x = -- &1 * x`] THEN |
| 60 |
REWRITE_TAC[REAL_POW_MUL; REAL_POW_ONE] THEN REAL_ARITH_TAC; |
| 61 |
ALL_TAC |
| 62 |
] THEN |
| 63 |
ASM_REWRITE_TAC[FROM_0]);; |
| 64 |
|
| 65 |
let neg_exp_infsum = prove |
| 66 |
(`!x. real_infsum (from 0) (\k. (-- &1) pow k / &(FACT k) * x pow k) = exp (--x)`, |
| 67 |
GEN_TAC THEN MP_TAC (MATCH_MP REAL_INFSUM_UNIQUE (SPEC_ALL neg_exp_series)) THEN |
| 68 |
REWRITE_TAC[]);; |
| 69 |
|
| 70 |
let n_le_fact = prove |
| 71 |
(`!n. n <= FACT n`, |
| 72 |
INDUCT_TAC THEN REWRITE_TAC[FACT; ARITH_LE] THEN |
| 73 |
ONCE_REWRITE_TAC[ARITH_RULE `a <= b <=> a * 1 <= b`] THEN |
| 74 |
MATCH_MP_TAC LE_MULT2 THEN REWRITE_TAC[LE_REFL; FACT_LE]);; |
| 75 |
|
| 76 |
let exp_alt_sign_lemma = prove |
| 77 |
(`!x. &0 <= x /\ x <= &1 |
| 78 |
==> (!k. abs ((-- &1) pow (k + 1) / &(FACT (k + 1)) * x pow (k + 1)) |
| 79 |
<= abs ((-- &1) pow k / &(FACT k) * x pow k) /\ |
| 80 |
((-- &1) pow (k + 1) / &(FACT (k + 1)) * x pow (k + 1)) * |
| 81 |
((-- &1) pow k / &(FACT k) * x pow k) <= &0) /\ |
| 82 |
((\k. (-- &1) pow k / &(FACT k) * x pow k) ---> &0) sequentially`, |
| 83 |
REPEAT STRIP_TAC THENL [ |
| 84 |
REWRITE_TAC[REAL_ABS_MUL] THEN MATCH_MP_TAC REAL_LE_MUL2 THEN |
| 85 |
REWRITE_TAC[REAL_ABS_POS] THEN CONJ_TAC THENL [ |
| 86 |
REWRITE_TAC[REAL_ABS_DIV; REAL_ABS_NUM] THEN |
| 87 |
REWRITE_TAC[REAL_ABS_POW; REAL_ABS_NEG; REAL_ABS_NUM; REAL_POW_ONE] THEN |
| 88 |
REWRITE_TAC[REAL_ARITH `&1 / a = inv a`] THEN |
| 89 |
MATCH_MP_TAC REAL_LE_INV2 THEN |
| 90 |
REWRITE_TAC[REAL_OF_NUM_LT; REAL_OF_NUM_LE; FACT_LT] THEN |
| 91 |
MATCH_MP_TAC FACT_MONO THEN ARITH_TAC; |
| 92 |
ALL_TAC |
| 93 |
] THEN |
| 94 |
REWRITE_TAC[REAL_ABS_POW] THEN |
| 95 |
MATCH_MP_TAC REAL_POW_MONO_INV THEN ASM_ARITH_TAC; |
| 96 |
REWRITE_TAC[REAL_ARITH `(a / b * r) * (c / d * t) <= &0 |
| 97 |
<=> &0 <= ((-- &1 pow 1 * a * c) * (r * t)) / b / d`] THEN |
| 98 |
MATCH_MP_TAC REAL_LE_DIV THEN SIMP_TAC[REAL_OF_NUM_LE; FACT_LT; LT_IMP_LE] THEN |
| 99 |
MATCH_MP_TAC REAL_LE_DIV THEN SIMP_TAC[REAL_OF_NUM_LE; FACT_LT; LT_IMP_LE] THEN |
| 100 |
REWRITE_TAC[GSYM REAL_POW_ADD; ARITH_RULE `1 + (k + 1) + k = 2 * (k + 1)`] THEN |
| 101 |
REWRITE_TAC[REAL_POW_NEG; EVEN_DOUBLE; REAL_POW_ONE; REAL_MUL_LID] THEN |
| 102 |
MATCH_MP_TAC REAL_POW_LE THEN ASM_REWRITE_TAC[]; |
| 103 |
MATCH_MP_TAC REALLIM_NULL_COMPARISON THEN |
| 104 |
EXISTS_TAC `\k. inv (&k)` THEN |
| 105 |
REWRITE_TAC[REALLIM_1_OVER_N; EVENTUALLY_SEQUENTIALLY] THEN |
| 106 |
EXISTS_TAC `1` THEN REPEAT STRIP_TAC THEN |
| 107 |
REWRITE_TAC[REAL_ABS_MUL] THEN ONCE_REWRITE_TAC[REAL_ARITH `a <= b <=> a <= b * &1`] THEN |
| 108 |
MATCH_MP_TAC REAL_LE_MUL2 THEN REWRITE_TAC[REAL_ABS_POS] THEN |
| 109 |
CONJ_TAC THENL [ |
| 110 |
REWRITE_TAC[REAL_ABS_DIV; REAL_ABS_POW; REAL_ABS_NEG] THEN |
| 111 |
REWRITE_TAC[REAL_POW_ONE; REAL_ARITH `&1 / a = inv a`; REAL_ABS_NUM] THEN |
| 112 |
MATCH_MP_TAC REAL_LE_INV2 THEN |
| 113 |
REWRITE_TAC[REAL_OF_NUM_LT; REAL_OF_NUM_LE; n_le_fact] THEN |
| 114 |
ASM_ARITH_TAC; |
| 115 |
ALL_TAC |
| 116 |
] THEN |
| 117 |
REWRITE_TAC[REAL_ABS_POW] THEN MATCH_MP_TAC REAL_POW_1_LE THEN |
| 118 |
ASM_ARITH_TAC |
| 119 |
]);; |
| 120 |
|
| 121 |
let exp_neg_poly_upper_bound = prove |
| 122 |
(`!x n. &0 <= x /\ x <= &1 /\ EVEN n ==> |
| 123 |
exp (--x) <= sum (0..n) (\k. (-- &1) pow k / &(FACT k) * x pow k)`, |
| 124 |
REWRITE_TAC[EVEN_EXISTS] THEN REPEAT STRIP_TAC THEN |
| 125 |
ABBREV_TAC `f = \k. (-- &1) pow k / &(FACT k) * x pow k` THEN |
| 126 |
ASM_CASES_TAC `n = 0` THENL [ |
| 127 |
POP_ASSUM (fun th -> REWRITE_TAC[th; SUM_CLAUSES_NUMSEG]) THEN |
| 128 |
EXPAND_TAC "f" THEN REWRITE_TAC[real_pow; FACT] THEN |
| 129 |
ASM_SIMP_TAC[REAL_ARITH `&1 / &1 * &1 = &1`; neg_exp_le1]; |
| 130 |
ALL_TAC |
| 131 |
] THEN |
| 132 |
MP_TAC (SPECL[`f:num->real`; `0`; `n:num`] alt_sign_upper_bound) THEN |
| 133 |
ANTS_TAC THENL [ |
| 134 |
ASM_SIMP_TAC[ARITH_RULE `~(n = 0) ==> 0 < n`] THEN |
| 135 |
EXPAND_TAC "f" THEN ASM_SIMP_TAC[exp_alt_sign_lemma]; |
| 136 |
ALL_TAC |
| 137 |
] THEN |
| 138 |
EXPAND_TAC "f" THEN ASM_REWRITE_TAC[neg_exp_infsum] THEN |
| 139 |
SUBGOAL_THEN `SUC (2 * m - 1) = 2 * m` ASSUME_TAC THENL [ ASM_ARITH_TAC; ALL_TAC ] THEN |
| 140 |
SUBGOAL_THEN `sum (0..2 * m) f = sum (0..SUC (2 * m - 1)) f` ASSUME_TAC THENL [ |
| 141 |
ASM_REWRITE_TAC[]; |
| 142 |
ALL_TAC |
| 143 |
] THEN |
| 144 |
ASM_REWRITE_TAC[SUM_CLAUSES_NUMSEG; LE_0] THEN |
| 145 |
SUBGOAL_THEN `abs (-- &1 pow (2 * m) / &(FACT (2 * m)) * x pow (2 * m)) = f (2 * m)` ASSUME_TAC THENL [ |
| 146 |
EXPAND_TAC "f" THEN REWRITE_TAC[REAL_ABS_MUL] THEN |
| 147 |
REWRITE_TAC[REAL_ABS_DIV; REAL_ABS_POW; REAL_ABS_NEG; REAL_ABS_NUM] THEN |
| 148 |
REWRITE_TAC[REAL_POW_NEG; EVEN_DOUBLE; REAL_POW_ONE] THEN |
| 149 |
ASM_SIMP_TAC[REAL_ARITH `&0 <= x ==> abs x = x`]; |
| 150 |
ALL_TAC |
| 151 |
] THEN |
| 152 |
ASM_REWRITE_TAC[] THEN REAL_ARITH_TAC);; |
| 153 |
|
| 154 |
let exp_neg_poly_lower_bound = prove |
| 155 |
(`!x n. &0 <= x /\ x <= &1 /\ ODD n ==> |
| 156 |
sum (0..n) (\k. (-- &1) pow k / &(FACT k) * x pow k) <= exp (--x)`, |
| 157 |
REWRITE_TAC[ODD_EXISTS] THEN REPEAT STRIP_TAC THEN |
| 158 |
ABBREV_TAC `f = \k. (-- &1) pow k / &(FACT k) * x pow k` THEN |
| 159 |
MP_TAC (SPECL[`f:num->real`; `0`; `n:num`] alt_sign_lower_bound) THEN |
| 160 |
ANTS_TAC THENL [ |
| 161 |
EXPAND_TAC "f" THEN ASM_SIMP_TAC[exp_alt_sign_lemma] THEN ARITH_TAC; |
| 162 |
ALL_TAC |
| 163 |
] THEN |
| 164 |
EXPAND_TAC "f" THEN ASM_REWRITE_TAC[neg_exp_infsum] THEN |
| 165 |
REWRITE_TAC[ARITH_RULE `SUC a - 1 = a`; SUM_CLAUSES_NUMSEG; LE_0] THEN |
| 166 |
SUBGOAL_THEN `abs (-- &1 pow (SUC (2 * m)) / &(FACT (SUC (2 * m))) * x pow SUC (2 * m)) = |
| 167 |
--f (SUC (2 * m))` ASSUME_TAC THENL [ |
| 168 |
EXPAND_TAC "f" THEN REWRITE_TAC[REAL_ABS_MUL] THEN |
| 169 |
REWRITE_TAC[REAL_ABS_DIV; REAL_ABS_POW; REAL_ABS_NEG; REAL_ABS_NUM] THEN |
| 170 |
REWRITE_TAC[REAL_POW_NEG; EVEN; EVEN_DOUBLE; REAL_POW_ONE] THEN |
| 171 |
ASM_SIMP_TAC[REAL_ARITH `&0 <= x ==> abs x = x`] THEN |
| 172 |
REAL_ARITH_TAC; |
| 173 |
ALL_TAC |
| 174 |
] THEN |
| 175 |
ASM_REWRITE_TAC[] THEN REAL_ARITH_TAC);; |
| 176 |
|
| 177 |
let exp_reduce = prove |
| 178 |
(`!x k. 0 < k ==> exp (x / &k) pow k = exp x`, |
| 179 |
REPEAT STRIP_TAC THEN REWRITE_TAC[GSYM REAL_EXP_N; REAL_ARITH `a * b / a = b * (a / a)`] THEN |
| 180 |
SUBGOAL_THEN `~(&k = &0)` ASSUME_TAC THENL [ |
| 181 |
REWRITE_TAC[REAL_OF_NUM_EQ] THEN ASM_ARITH_TAC; |
| 182 |
ALL_TAC |
| 183 |
] THEN |
| 184 |
ASM_SIMP_TAC[REAL_DIV_REFL; REAL_MUL_RID]);; |
| 185 |
|
| 186 |
let exp_full_reduce = prove |
| 187 |
(`!x k. 0 < k ==> inv (exp (--x / &k) pow k) = exp x`, |
| 188 |
REPEAT STRIP_TAC THEN ASM_SIMP_TAC[exp_reduce] THEN |
| 189 |
REWRITE_TAC[GSYM REAL_EXP_NEG; REAL_NEG_NEG]);; |
| 190 |
|
| 191 |
(* --------------------- *) |
| 192 |
(* log *) |
| 193 |
(* --------------------- *) |
| 194 |
|
| 195 |
let log_alt_sign_lemma = prove |
| 196 |
(`!x. &0 <= x /\ x <= &1 |
| 197 |
==> let f = (\k. (-- &1) pow k / &(k + 1) * x pow (k + 1)) in |
| 198 |
(!k. abs (f (k + 1)) <= abs (f k) /\ f (k + 1) * f k <= &0) /\ |
| 199 |
(f ---> &0) sequentially`, |
| 200 |
REPEAT STRIP_TAC THEN CONV_TAC let_CONV THEN REPEAT STRIP_TAC THENL [ |
| 201 |
REWRITE_TAC[REAL_ABS_MUL] THEN MATCH_MP_TAC REAL_LE_MUL2 THEN |
| 202 |
REWRITE_TAC[REAL_ABS_POS] THEN CONJ_TAC THENL [ |
| 203 |
REWRITE_TAC[REAL_ABS_DIV; REAL_ABS_NUM] THEN |
| 204 |
REWRITE_TAC[REAL_ABS_POW; REAL_ABS_NEG; REAL_ABS_NUM; REAL_POW_ONE] THEN |
| 205 |
REWRITE_TAC[REAL_ARITH `&1 / a = inv a`] THEN |
| 206 |
MATCH_MP_TAC REAL_LE_INV2 THEN |
| 207 |
REWRITE_TAC[REAL_OF_NUM_LT; REAL_OF_NUM_LE] THEN ARITH_TAC; |
| 208 |
ALL_TAC |
| 209 |
] THEN |
| 210 |
REWRITE_TAC[REAL_ABS_POW] THEN |
| 211 |
MATCH_MP_TAC REAL_POW_MONO_INV THEN ASM_ARITH_TAC; |
| 212 |
REWRITE_TAC[REAL_ARITH `(a / b * r) * (c / d * t) <= &0 |
| 213 |
<=> &0 <= ((-- &1 pow 1 * a * c) * (r * t)) / b / d`] THEN |
| 214 |
MATCH_MP_TAC REAL_LE_DIV THEN REWRITE_TAC[REAL_OF_NUM_LE; ARITH_RULE `0 <= t + 1`] THEN |
| 215 |
MATCH_MP_TAC REAL_LE_DIV THEN REWRITE_TAC[REAL_OF_NUM_LE; ARITH_RULE `0 <= t + 1`] THEN |
| 216 |
REWRITE_TAC[GSYM REAL_POW_ADD; ARITH_RULE `1 + (k + 1) + k = 2 * (k + 1)`] THEN |
| 217 |
REWRITE_TAC[REAL_POW_NEG; EVEN_DOUBLE; REAL_POW_ONE; REAL_MUL_LID] THEN |
| 218 |
MATCH_MP_TAC REAL_POW_LE THEN ASM_REWRITE_TAC[]; |
| 219 |
MATCH_MP_TAC REALLIM_NULL_COMPARISON THEN |
| 220 |
EXISTS_TAC `\k. inv (&k)` THEN |
| 221 |
REWRITE_TAC[REALLIM_1_OVER_N; EVENTUALLY_SEQUENTIALLY] THEN |
| 222 |
EXISTS_TAC `1` THEN REPEAT STRIP_TAC THEN |
| 223 |
REWRITE_TAC[REAL_ABS_MUL] THEN ONCE_REWRITE_TAC[REAL_ARITH `a <= b <=> a <= b * &1`] THEN |
| 224 |
MATCH_MP_TAC REAL_LE_MUL2 THEN REWRITE_TAC[REAL_ABS_POS] THEN |
| 225 |
CONJ_TAC THENL [ |
| 226 |
REWRITE_TAC[REAL_ABS_DIV; REAL_ABS_POW; REAL_ABS_NEG] THEN |
| 227 |
REWRITE_TAC[REAL_POW_ONE; REAL_ARITH `&1 / a = inv a`; REAL_ABS_NUM] THEN |
| 228 |
MATCH_MP_TAC REAL_LE_INV2 THEN |
| 229 |
REWRITE_TAC[REAL_OF_NUM_LT; REAL_OF_NUM_LE] THEN ASM_ARITH_TAC; |
| 230 |
ALL_TAC |
| 231 |
] THEN |
| 232 |
REWRITE_TAC[REAL_ABS_POW] THEN MATCH_MP_TAC REAL_POW_1_LE THEN |
| 233 |
ASM_ARITH_TAC |
| 234 |
]);; |
| 235 |
|
| 236 |
let log_poly_upper_bound = prove |
| 237 |
(`!x n. &0 <= x /\ x < &1 /\ EVEN n /\ 0 < n ==> |
| 238 |
log (&1 + x) <= x * sum (0..n) (\k. (-- &1) pow k / &(k + 1) * x pow k)`, |
| 239 |
REWRITE_TAC[EVEN_EXISTS] THEN REPEAT STRIP_TAC THEN |
| 240 |
ABBREV_TAC `f = \k. (-- &1) pow k / &(k + 1) * x pow (k + 1)` THEN |
| 241 |
SUBGOAL_THEN `x * sum (0..n) (\k. -- &1 pow k / &(k + 1) * x pow k) |
| 242 |
= sum (0..n) f` ASSUME_TAC THENL [ |
| 243 |
REWRITE_TAC[GSYM SUM_LMUL; REAL_ARITH `a * b / c * d = b / c * (a * d)`] THEN |
| 244 |
REWRITE_TAC[GSYM real_pow; ARITH_RULE `SUC k = k + 1`] THEN |
| 245 |
ASM_REWRITE_TAC[real_pow]; |
| 246 |
ALL_TAC |
| 247 |
] THEN |
| 248 |
ASM_REWRITE_TAC[] THEN |
| 249 |
MP_TAC (SPECL[`f:num->real`; `0`; `n:num`] alt_sign_upper_bound) THEN |
| 250 |
ANTS_TAC THENL [ |
| 251 |
ASM_REWRITE_TAC[] THEN |
| 252 |
MP_TAC (SPEC_ALL (CONV_RULE (DEPTH_CONV let_CONV) log_alt_sign_lemma)) THEN |
| 253 |
ASM_SIMP_TAC[REAL_LT_IMP_LE] THEN |
| 254 |
EXPAND_TAC "f" THEN SIMP_TAC[]; |
| 255 |
ALL_TAC |
| 256 |
] THEN |
| 257 |
SUBGOAL_THEN `real_infsum (from 0) f = log (&1 + x)` (fun th -> REWRITE_TAC[th]) THENL [ |
| 258 |
ASM_SIMP_TAC[REAL_ARITH `&0 <= x /\ x < &1 ==> abs x < &1`; GSYM log_infsum]; |
| 259 |
ALL_TAC |
| 260 |
] THEN |
| 261 |
SUBGOAL_THEN `SUC (2 * m - 1) = 2 * m` ASSUME_TAC THENL [ ASM_ARITH_TAC; ALL_TAC ] THEN |
| 262 |
SUBGOAL_THEN `sum (0..2 * m) f = sum (0..SUC (2 * m - 1)) f` ASSUME_TAC THENL [ |
| 263 |
ASM_REWRITE_TAC[]; |
| 264 |
ALL_TAC |
| 265 |
] THEN |
| 266 |
ASM_REWRITE_TAC[SUM_CLAUSES_NUMSEG; LE_0] THEN |
| 267 |
SUBGOAL_THEN `abs (f (2 * m)) = f (2 * m)` (fun th -> REWRITE_TAC[th]) THEN |
| 268 |
MATCH_MP_TAC (REAL_ARITH `&0 <= x ==> abs x = x`) THEN |
| 269 |
EXPAND_TAC "f" THEN REWRITE_TAC[REAL_POW_NEG; EVEN_DOUBLE; REAL_POW_ONE] THEN |
| 270 |
MATCH_MP_TAC REAL_LE_MUL THEN CONJ_TAC THENL [ |
| 271 |
MATCH_MP_TAC REAL_LE_DIV THEN REWRITE_TAC[REAL_OF_NUM_LE] THEN ARITH_TAC; |
| 272 |
MATCH_MP_TAC REAL_POW_LE THEN ASM_REWRITE_TAC[] |
| 273 |
]);; |
| 274 |
|
| 275 |
let log_poly_lower_bound = prove |
| 276 |
(`!x n. &0 <= x /\ x < &1 /\ ODD n ==> |
| 277 |
x * sum (0..n) (\k. (-- &1) pow k / &(k + 1) * x pow k) <= log (&1 + x)`, |
| 278 |
REWRITE_TAC[ODD_EXISTS] THEN REPEAT STRIP_TAC THEN |
| 279 |
ABBREV_TAC `f = \k. (-- &1) pow k / &(k + 1) * x pow (k + 1)` THEN |
| 280 |
SUBGOAL_THEN `x * sum (0..n) (\k. -- &1 pow k / &(k + 1) * x pow k) |
| 281 |
= sum (0..n) f` ASSUME_TAC THENL [ |
| 282 |
REWRITE_TAC[GSYM SUM_LMUL; REAL_ARITH `a * b / c * d = b / c * (a * d)`] THEN |
| 283 |
REWRITE_TAC[GSYM real_pow; ARITH_RULE `SUC k = k + 1`] THEN |
| 284 |
ASM_REWRITE_TAC[real_pow]; |
| 285 |
ALL_TAC |
| 286 |
] THEN |
| 287 |
ASM_REWRITE_TAC[] THEN |
| 288 |
MP_TAC (SPECL[`f:num->real`; `0`; `n:num`] alt_sign_lower_bound) THEN |
| 289 |
ANTS_TAC THENL [ |
| 290 |
ASM_REWRITE_TAC[ARITH_RULE `0 < SUC (2 * m)`] THEN |
| 291 |
MP_TAC (SPEC_ALL (CONV_RULE (DEPTH_CONV let_CONV) log_alt_sign_lemma)) THEN |
| 292 |
ASM_SIMP_TAC[REAL_LT_IMP_LE] THEN |
| 293 |
EXPAND_TAC "f" THEN SIMP_TAC[]; |
| 294 |
ALL_TAC |
| 295 |
] THEN |
| 296 |
SUBGOAL_THEN `real_infsum (from 0) f = log (&1 + x)` (fun th -> REWRITE_TAC[th]) THENL [ |
| 297 |
ASM_SIMP_TAC[REAL_ARITH `&0 <= x /\ x < &1 ==> abs x < &1`; GSYM log_infsum]; |
| 298 |
ALL_TAC |
| 299 |
] THEN |
| 300 |
ASM_REWRITE_TAC[ARITH_RULE `SUC a - 1 = a`; SUM_CLAUSES_NUMSEG; LE_0] THEN |
| 301 |
SUBGOAL_THEN `abs (f (SUC (2 * m))) = --f (SUC (2 * m))` (fun th -> REWRITE_TAC[th]) THENL [ |
| 302 |
MATCH_MP_TAC (REAL_ARITH `&0 <= --x ==> abs x = --x`) THEN |
| 303 |
EXPAND_TAC "f" THEN REWRITE_TAC[REAL_POW_NEG; EVEN; EVEN_DOUBLE; REAL_POW_ONE] THEN |
| 304 |
REWRITE_TAC[REAL_ARITH `--(-- &1 / b * c) = inv b * c`] THEN |
| 305 |
MATCH_MP_TAC REAL_LE_MUL THEN CONJ_TAC THENL [ |
| 306 |
MATCH_MP_TAC REAL_LE_INV THEN REWRITE_TAC[REAL_OF_NUM_LE] THEN ARITH_TAC; |
| 307 |
MATCH_MP_TAC REAL_POW_LE THEN ASM_REWRITE_TAC[] |
| 308 |
]; |
| 309 |
ALL_TAC |
| 310 |
] THEN |
| 311 |
REAL_ARITH_TAC);; |
| 312 |
|
| 313 |
let log_reduce_pos_pow = prove |
| 314 |
(`!k y. &0 < y ==> log (&2 pow k * y) = &k * log (&2) + log y`, |
| 315 |
REPEAT STRIP_TAC THEN |
| 316 |
ASM_SIMP_TAC[LOG_MUL; REAL_LT_POW2] THEN |
| 317 |
ASM_SIMP_TAC[LOG_POW; REAL_ARITH `&0 < &2`]);; |
| 318 |
|
| 319 |
let log_reduce_neg_pow = prove |
| 320 |
(`!k y. &0 < y ==> log (y / (&2 pow k)) = log y - &k * log (&2)`, |
| 321 |
REPEAT STRIP_TAC THEN |
| 322 |
ASM_SIMP_TAC[LOG_DIV; REAL_LT_POW2] THEN |
| 323 |
ASM_SIMP_TAC[LOG_POW; REAL_ARITH `&0 < &2`]);; |
| 324 |
|
| 325 |
end;; |