src/HOL/Library/Inner_Product.thy
author Christian Sternagel
Wed Aug 29 12:23:14 2012 +0900 (2012-08-29)
changeset 49083 01081bca31b6
parent 44902 9ba11d41cd1f
child 49962 a8cc904a6820
permissions -rw-r--r--
dropped ord and bot instance for list prefixes (use locale interpretation instead, which allows users to decide what order to use on lists)
wenzelm@41959
     1
(*  Title:      HOL/Library/Inner_Product.thy
wenzelm@41959
     2
    Author:     Brian Huffman
huffman@29993
     3
*)
huffman@29993
     4
huffman@29993
     5
header {* Inner Product Spaces and the Gradient Derivative *}
huffman@29993
     6
huffman@29993
     7
theory Inner_Product
huffman@44282
     8
imports FrechetDeriv
huffman@29993
     9
begin
huffman@29993
    10
huffman@29993
    11
subsection {* Real inner product spaces *}
huffman@29993
    12
huffman@31492
    13
text {*
huffman@31492
    14
  Temporarily relax type constraints for @{term "open"},
huffman@31492
    15
  @{term dist}, and @{term norm}.
huffman@31492
    16
*}
huffman@31492
    17
huffman@31492
    18
setup {* Sign.add_const_constraint
huffman@31492
    19
  (@{const_name "open"}, SOME @{typ "'a::open set \<Rightarrow> bool"}) *}
huffman@31446
    20
huffman@31446
    21
setup {* Sign.add_const_constraint
huffman@31446
    22
  (@{const_name dist}, SOME @{typ "'a::dist \<Rightarrow> 'a \<Rightarrow> real"}) *}
huffman@31446
    23
huffman@31446
    24
setup {* Sign.add_const_constraint
huffman@31446
    25
  (@{const_name norm}, SOME @{typ "'a::norm \<Rightarrow> real"}) *}
huffman@31446
    26
huffman@31492
    27
class real_inner = real_vector + sgn_div_norm + dist_norm + open_dist +
huffman@29993
    28
  fixes inner :: "'a \<Rightarrow> 'a \<Rightarrow> real"
huffman@29993
    29
  assumes inner_commute: "inner x y = inner y x"
huffman@31590
    30
  and inner_add_left: "inner (x + y) z = inner x z + inner y z"
huffman@31590
    31
  and inner_scaleR_left [simp]: "inner (scaleR r x) y = r * (inner x y)"
huffman@29993
    32
  and inner_ge_zero [simp]: "0 \<le> inner x x"
huffman@29993
    33
  and inner_eq_zero_iff [simp]: "inner x x = 0 \<longleftrightarrow> x = 0"
huffman@29993
    34
  and norm_eq_sqrt_inner: "norm x = sqrt (inner x x)"
huffman@29993
    35
begin
huffman@29993
    36
huffman@29993
    37
lemma inner_zero_left [simp]: "inner 0 x = 0"
huffman@31590
    38
  using inner_add_left [of 0 0 x] by simp
huffman@29993
    39
huffman@29993
    40
lemma inner_minus_left [simp]: "inner (- x) y = - inner x y"
huffman@31590
    41
  using inner_add_left [of x "- x" y] by simp
huffman@29993
    42
huffman@29993
    43
lemma inner_diff_left: "inner (x - y) z = inner x z - inner y z"
huffman@31590
    44
  by (simp add: diff_minus inner_add_left)
huffman@29993
    45
huffman@44282
    46
lemma inner_setsum_left: "inner (\<Sum>x\<in>A. f x) y = (\<Sum>x\<in>A. inner (f x) y)"
huffman@44282
    47
  by (cases "finite A", induct set: finite, simp_all add: inner_add_left)
huffman@44282
    48
huffman@29993
    49
text {* Transfer distributivity rules to right argument. *}
huffman@29993
    50
huffman@31590
    51
lemma inner_add_right: "inner x (y + z) = inner x y + inner x z"
huffman@31590
    52
  using inner_add_left [of y z x] by (simp only: inner_commute)
huffman@29993
    53
huffman@31590
    54
lemma inner_scaleR_right [simp]: "inner x (scaleR r y) = r * (inner x y)"
huffman@29993
    55
  using inner_scaleR_left [of r y x] by (simp only: inner_commute)
huffman@29993
    56
huffman@29993
    57
lemma inner_zero_right [simp]: "inner x 0 = 0"
huffman@29993
    58
  using inner_zero_left [of x] by (simp only: inner_commute)
huffman@29993
    59
huffman@29993
    60
lemma inner_minus_right [simp]: "inner x (- y) = - inner x y"
huffman@29993
    61
  using inner_minus_left [of y x] by (simp only: inner_commute)
huffman@29993
    62
huffman@29993
    63
lemma inner_diff_right: "inner x (y - z) = inner x y - inner x z"
huffman@29993
    64
  using inner_diff_left [of y z x] by (simp only: inner_commute)
huffman@29993
    65
huffman@44282
    66
lemma inner_setsum_right: "inner x (\<Sum>y\<in>A. f y) = (\<Sum>y\<in>A. inner x (f y))"
huffman@44282
    67
  using inner_setsum_left [of f A x] by (simp only: inner_commute)
huffman@44282
    68
huffman@31590
    69
lemmas inner_add [algebra_simps] = inner_add_left inner_add_right
huffman@31590
    70
lemmas inner_diff [algebra_simps]  = inner_diff_left inner_diff_right
huffman@31590
    71
lemmas inner_scaleR = inner_scaleR_left inner_scaleR_right
huffman@31590
    72
huffman@31590
    73
text {* Legacy theorem names *}
huffman@31590
    74
lemmas inner_left_distrib = inner_add_left
huffman@31590
    75
lemmas inner_right_distrib = inner_add_right
huffman@29993
    76
lemmas inner_distrib = inner_left_distrib inner_right_distrib
huffman@29993
    77
huffman@29993
    78
lemma inner_gt_zero_iff [simp]: "0 < inner x x \<longleftrightarrow> x \<noteq> 0"
huffman@29993
    79
  by (simp add: order_less_le)
huffman@29993
    80
huffman@29993
    81
lemma power2_norm_eq_inner: "(norm x)\<twosuperior> = inner x x"
huffman@29993
    82
  by (simp add: norm_eq_sqrt_inner)
huffman@29993
    83
huffman@30046
    84
lemma Cauchy_Schwarz_ineq:
huffman@29993
    85
  "(inner x y)\<twosuperior> \<le> inner x x * inner y y"
huffman@29993
    86
proof (cases)
huffman@29993
    87
  assume "y = 0"
huffman@29993
    88
  thus ?thesis by simp
huffman@29993
    89
next
huffman@29993
    90
  assume y: "y \<noteq> 0"
huffman@29993
    91
  let ?r = "inner x y / inner y y"
huffman@29993
    92
  have "0 \<le> inner (x - scaleR ?r y) (x - scaleR ?r y)"
huffman@29993
    93
    by (rule inner_ge_zero)
huffman@29993
    94
  also have "\<dots> = inner x x - inner y x * ?r"
huffman@31590
    95
    by (simp add: inner_diff)
huffman@29993
    96
  also have "\<dots> = inner x x - (inner x y)\<twosuperior> / inner y y"
huffman@29993
    97
    by (simp add: power2_eq_square inner_commute)
huffman@29993
    98
  finally have "0 \<le> inner x x - (inner x y)\<twosuperior> / inner y y" .
huffman@29993
    99
  hence "(inner x y)\<twosuperior> / inner y y \<le> inner x x"
huffman@29993
   100
    by (simp add: le_diff_eq)
huffman@29993
   101
  thus "(inner x y)\<twosuperior> \<le> inner x x * inner y y"
huffman@29993
   102
    by (simp add: pos_divide_le_eq y)
huffman@29993
   103
qed
huffman@29993
   104
huffman@30046
   105
lemma Cauchy_Schwarz_ineq2:
huffman@29993
   106
  "\<bar>inner x y\<bar> \<le> norm x * norm y"
huffman@29993
   107
proof (rule power2_le_imp_le)
huffman@29993
   108
  have "(inner x y)\<twosuperior> \<le> inner x x * inner y y"
huffman@30046
   109
    using Cauchy_Schwarz_ineq .
huffman@29993
   110
  thus "\<bar>inner x y\<bar>\<twosuperior> \<le> (norm x * norm y)\<twosuperior>"
huffman@29993
   111
    by (simp add: power_mult_distrib power2_norm_eq_inner)
huffman@29993
   112
  show "0 \<le> norm x * norm y"
huffman@29993
   113
    unfolding norm_eq_sqrt_inner
huffman@29993
   114
    by (intro mult_nonneg_nonneg real_sqrt_ge_zero inner_ge_zero)
huffman@29993
   115
qed
huffman@29993
   116
huffman@29993
   117
subclass real_normed_vector
huffman@29993
   118
proof
huffman@29993
   119
  fix a :: real and x y :: 'a
huffman@29993
   120
  show "0 \<le> norm x"
huffman@29993
   121
    unfolding norm_eq_sqrt_inner by simp
huffman@29993
   122
  show "norm x = 0 \<longleftrightarrow> x = 0"
huffman@29993
   123
    unfolding norm_eq_sqrt_inner by simp
huffman@29993
   124
  show "norm (x + y) \<le> norm x + norm y"
huffman@29993
   125
    proof (rule power2_le_imp_le)
huffman@29993
   126
      have "inner x y \<le> norm x * norm y"
huffman@30046
   127
        by (rule order_trans [OF abs_ge_self Cauchy_Schwarz_ineq2])
huffman@29993
   128
      thus "(norm (x + y))\<twosuperior> \<le> (norm x + norm y)\<twosuperior>"
huffman@29993
   129
        unfolding power2_sum power2_norm_eq_inner
huffman@31590
   130
        by (simp add: inner_add inner_commute)
huffman@29993
   131
      show "0 \<le> norm x + norm y"
huffman@44126
   132
        unfolding norm_eq_sqrt_inner by simp
huffman@29993
   133
    qed
huffman@29993
   134
  have "sqrt (a\<twosuperior> * inner x x) = \<bar>a\<bar> * sqrt (inner x x)"
huffman@29993
   135
    by (simp add: real_sqrt_mult_distrib)
huffman@29993
   136
  then show "norm (a *\<^sub>R x) = \<bar>a\<bar> * norm x"
huffman@29993
   137
    unfolding norm_eq_sqrt_inner
huffman@31590
   138
    by (simp add: power2_eq_square mult_assoc)
huffman@29993
   139
qed
huffman@29993
   140
huffman@29993
   141
end
huffman@29993
   142
huffman@31492
   143
text {*
huffman@31492
   144
  Re-enable constraints for @{term "open"},
huffman@31492
   145
  @{term dist}, and @{term norm}.
huffman@31492
   146
*}
huffman@31492
   147
huffman@31492
   148
setup {* Sign.add_const_constraint
huffman@31492
   149
  (@{const_name "open"}, SOME @{typ "'a::topological_space set \<Rightarrow> bool"}) *}
huffman@31446
   150
huffman@31446
   151
setup {* Sign.add_const_constraint
huffman@31446
   152
  (@{const_name dist}, SOME @{typ "'a::metric_space \<Rightarrow> 'a \<Rightarrow> real"}) *}
huffman@31446
   153
huffman@31446
   154
setup {* Sign.add_const_constraint
huffman@31446
   155
  (@{const_name norm}, SOME @{typ "'a::real_normed_vector \<Rightarrow> real"}) *}
huffman@31446
   156
huffman@44282
   157
lemma bounded_bilinear_inner:
huffman@44282
   158
  "bounded_bilinear (inner::'a::real_inner \<Rightarrow> 'a \<Rightarrow> real)"
huffman@29993
   159
proof
huffman@29993
   160
  fix x y z :: 'a and r :: real
huffman@29993
   161
  show "inner (x + y) z = inner x z + inner y z"
huffman@31590
   162
    by (rule inner_add_left)
huffman@29993
   163
  show "inner x (y + z) = inner x y + inner x z"
huffman@31590
   164
    by (rule inner_add_right)
huffman@29993
   165
  show "inner (scaleR r x) y = scaleR r (inner x y)"
huffman@29993
   166
    unfolding real_scaleR_def by (rule inner_scaleR_left)
huffman@29993
   167
  show "inner x (scaleR r y) = scaleR r (inner x y)"
huffman@29993
   168
    unfolding real_scaleR_def by (rule inner_scaleR_right)
huffman@29993
   169
  show "\<exists>K. \<forall>x y::'a. norm (inner x y) \<le> norm x * norm y * K"
huffman@29993
   170
  proof
huffman@29993
   171
    show "\<forall>x y::'a. norm (inner x y) \<le> norm x * norm y * 1"
huffman@30046
   172
      by (simp add: Cauchy_Schwarz_ineq2)
huffman@29993
   173
  qed
huffman@29993
   174
qed
huffman@29993
   175
huffman@44282
   176
lemmas tendsto_inner [tendsto_intros] =
huffman@44282
   177
  bounded_bilinear.tendsto [OF bounded_bilinear_inner]
huffman@44282
   178
huffman@44282
   179
lemmas isCont_inner [simp] =
huffman@44282
   180
  bounded_bilinear.isCont [OF bounded_bilinear_inner]
huffman@29993
   181
huffman@44282
   182
lemmas FDERIV_inner =
huffman@44282
   183
  bounded_bilinear.FDERIV [OF bounded_bilinear_inner]
huffman@29993
   184
huffman@44282
   185
lemmas bounded_linear_inner_left =
huffman@44282
   186
  bounded_bilinear.bounded_linear_left [OF bounded_bilinear_inner]
huffman@44282
   187
huffman@44282
   188
lemmas bounded_linear_inner_right =
huffman@44282
   189
  bounded_bilinear.bounded_linear_right [OF bounded_bilinear_inner]
huffman@44233
   190
huffman@29993
   191
huffman@29993
   192
subsection {* Class instances *}
huffman@29993
   193
huffman@29993
   194
instantiation real :: real_inner
huffman@29993
   195
begin
huffman@29993
   196
huffman@29993
   197
definition inner_real_def [simp]: "inner = op *"
huffman@29993
   198
huffman@29993
   199
instance proof
huffman@29993
   200
  fix x y z r :: real
huffman@29993
   201
  show "inner x y = inner y x"
huffman@29993
   202
    unfolding inner_real_def by (rule mult_commute)
huffman@29993
   203
  show "inner (x + y) z = inner x z + inner y z"
huffman@29993
   204
    unfolding inner_real_def by (rule left_distrib)
huffman@29993
   205
  show "inner (scaleR r x) y = r * inner x y"
huffman@29993
   206
    unfolding inner_real_def real_scaleR_def by (rule mult_assoc)
huffman@29993
   207
  show "0 \<le> inner x x"
huffman@29993
   208
    unfolding inner_real_def by simp
huffman@29993
   209
  show "inner x x = 0 \<longleftrightarrow> x = 0"
huffman@29993
   210
    unfolding inner_real_def by simp
huffman@29993
   211
  show "norm x = sqrt (inner x x)"
huffman@29993
   212
    unfolding inner_real_def by simp
huffman@29993
   213
qed
huffman@29993
   214
huffman@29993
   215
end
huffman@29993
   216
huffman@29993
   217
instantiation complex :: real_inner
huffman@29993
   218
begin
huffman@29993
   219
huffman@29993
   220
definition inner_complex_def:
huffman@29993
   221
  "inner x y = Re x * Re y + Im x * Im y"
huffman@29993
   222
huffman@29993
   223
instance proof
huffman@29993
   224
  fix x y z :: complex and r :: real
huffman@29993
   225
  show "inner x y = inner y x"
huffman@29993
   226
    unfolding inner_complex_def by (simp add: mult_commute)
huffman@29993
   227
  show "inner (x + y) z = inner x z + inner y z"
huffman@29993
   228
    unfolding inner_complex_def by (simp add: left_distrib)
huffman@29993
   229
  show "inner (scaleR r x) y = r * inner x y"
huffman@29993
   230
    unfolding inner_complex_def by (simp add: right_distrib)
huffman@29993
   231
  show "0 \<le> inner x x"
huffman@44126
   232
    unfolding inner_complex_def by simp
huffman@29993
   233
  show "inner x x = 0 \<longleftrightarrow> x = 0"
huffman@29993
   234
    unfolding inner_complex_def
huffman@29993
   235
    by (simp add: add_nonneg_eq_0_iff complex_Re_Im_cancel_iff)
huffman@29993
   236
  show "norm x = sqrt (inner x x)"
huffman@29993
   237
    unfolding inner_complex_def complex_norm_def
huffman@29993
   238
    by (simp add: power2_eq_square)
huffman@29993
   239
qed
huffman@29993
   240
huffman@29993
   241
end
huffman@29993
   242
huffman@44902
   243
lemma complex_inner_1 [simp]: "inner 1 x = Re x"
huffman@44902
   244
  unfolding inner_complex_def by simp
huffman@44902
   245
huffman@44902
   246
lemma complex_inner_1_right [simp]: "inner x 1 = Re x"
huffman@44902
   247
  unfolding inner_complex_def by simp
huffman@44902
   248
huffman@44902
   249
lemma complex_inner_ii_left [simp]: "inner ii x = Im x"
huffman@44902
   250
  unfolding inner_complex_def by simp
huffman@44902
   251
huffman@44902
   252
lemma complex_inner_ii_right [simp]: "inner x ii = Im x"
huffman@44902
   253
  unfolding inner_complex_def by simp
huffman@44902
   254
huffman@29993
   255
huffman@29993
   256
subsection {* Gradient derivative *}
huffman@29993
   257
huffman@29993
   258
definition
huffman@29993
   259
  gderiv ::
huffman@29993
   260
    "['a::real_inner \<Rightarrow> real, 'a, 'a] \<Rightarrow> bool"
huffman@29993
   261
          ("(GDERIV (_)/ (_)/ :> (_))" [1000, 1000, 60] 60)
huffman@29993
   262
where
huffman@29993
   263
  "GDERIV f x :> D \<longleftrightarrow> FDERIV f x :> (\<lambda>h. inner h D)"
huffman@29993
   264
huffman@29993
   265
lemma deriv_fderiv: "DERIV f x :> D \<longleftrightarrow> FDERIV f x :> (\<lambda>h. h * D)"
huffman@29993
   266
  by (simp only: deriv_def field_fderiv_def)
huffman@29993
   267
huffman@29993
   268
lemma gderiv_deriv [simp]: "GDERIV f x :> D \<longleftrightarrow> DERIV f x :> D"
huffman@29993
   269
  by (simp only: gderiv_def deriv_fderiv inner_real_def)
huffman@29993
   270
huffman@29993
   271
lemma GDERIV_DERIV_compose:
huffman@29993
   272
    "\<lbrakk>GDERIV f x :> df; DERIV g (f x) :> dg\<rbrakk>
huffman@29993
   273
     \<Longrightarrow> GDERIV (\<lambda>x. g (f x)) x :> scaleR dg df"
huffman@29993
   274
  unfolding gderiv_def deriv_fderiv
huffman@29993
   275
  apply (drule (1) FDERIV_compose)
huffman@31590
   276
  apply (simp add: mult_ac)
huffman@29993
   277
  done
huffman@29993
   278
huffman@29993
   279
lemma FDERIV_subst: "\<lbrakk>FDERIV f x :> df; df = d\<rbrakk> \<Longrightarrow> FDERIV f x :> d"
huffman@29993
   280
  by simp
huffman@29993
   281
huffman@29993
   282
lemma GDERIV_subst: "\<lbrakk>GDERIV f x :> df; df = d\<rbrakk> \<Longrightarrow> GDERIV f x :> d"
huffman@29993
   283
  by simp
huffman@29993
   284
huffman@29993
   285
lemma GDERIV_const: "GDERIV (\<lambda>x. k) x :> 0"
huffman@44282
   286
  unfolding gderiv_def inner_zero_right by (rule FDERIV_const)
huffman@29993
   287
huffman@29993
   288
lemma GDERIV_add:
huffman@29993
   289
    "\<lbrakk>GDERIV f x :> df; GDERIV g x :> dg\<rbrakk>
huffman@29993
   290
     \<Longrightarrow> GDERIV (\<lambda>x. f x + g x) x :> df + dg"
huffman@44282
   291
  unfolding gderiv_def inner_add_right by (rule FDERIV_add)
huffman@29993
   292
huffman@29993
   293
lemma GDERIV_minus:
huffman@29993
   294
    "GDERIV f x :> df \<Longrightarrow> GDERIV (\<lambda>x. - f x) x :> - df"
huffman@44282
   295
  unfolding gderiv_def inner_minus_right by (rule FDERIV_minus)
huffman@29993
   296
huffman@29993
   297
lemma GDERIV_diff:
huffman@29993
   298
    "\<lbrakk>GDERIV f x :> df; GDERIV g x :> dg\<rbrakk>
huffman@29993
   299
     \<Longrightarrow> GDERIV (\<lambda>x. f x - g x) x :> df - dg"
huffman@44282
   300
  unfolding gderiv_def inner_diff_right by (rule FDERIV_diff)
huffman@29993
   301
huffman@29993
   302
lemma GDERIV_scaleR:
huffman@29993
   303
    "\<lbrakk>DERIV f x :> df; GDERIV g x :> dg\<rbrakk>
huffman@29993
   304
     \<Longrightarrow> GDERIV (\<lambda>x. scaleR (f x) (g x)) x
huffman@29993
   305
      :> (scaleR (f x) dg + scaleR df (g x))"
huffman@44282
   306
  unfolding gderiv_def deriv_fderiv inner_add_right inner_scaleR_right
huffman@29993
   307
  apply (rule FDERIV_subst)
huffman@44282
   308
  apply (erule (1) FDERIV_scaleR)
huffman@29993
   309
  apply (simp add: mult_ac)
huffman@29993
   310
  done
huffman@29993
   311
huffman@29993
   312
lemma GDERIV_mult:
huffman@29993
   313
    "\<lbrakk>GDERIV f x :> df; GDERIV g x :> dg\<rbrakk>
huffman@29993
   314
     \<Longrightarrow> GDERIV (\<lambda>x. f x * g x) x :> scaleR (f x) dg + scaleR (g x) df"
huffman@29993
   315
  unfolding gderiv_def
huffman@29993
   316
  apply (rule FDERIV_subst)
huffman@29993
   317
  apply (erule (1) FDERIV_mult)
huffman@31590
   318
  apply (simp add: inner_add mult_ac)
huffman@29993
   319
  done
huffman@29993
   320
huffman@29993
   321
lemma GDERIV_inverse:
huffman@29993
   322
    "\<lbrakk>GDERIV f x :> df; f x \<noteq> 0\<rbrakk>
huffman@29993
   323
     \<Longrightarrow> GDERIV (\<lambda>x. inverse (f x)) x :> - (inverse (f x))\<twosuperior> *\<^sub>R df"
huffman@29993
   324
  apply (erule GDERIV_DERIV_compose)
huffman@29993
   325
  apply (erule DERIV_inverse [folded numeral_2_eq_2])
huffman@29993
   326
  done
huffman@29993
   327
huffman@29993
   328
lemma GDERIV_norm:
huffman@29993
   329
  assumes "x \<noteq> 0" shows "GDERIV (\<lambda>x. norm x) x :> sgn x"
huffman@29993
   330
proof -
huffman@29993
   331
  have 1: "FDERIV (\<lambda>x. inner x x) x :> (\<lambda>h. inner x h + inner h x)"
huffman@44282
   332
    by (intro FDERIV_inner FDERIV_ident)
huffman@29993
   333
  have 2: "(\<lambda>h. inner x h + inner h x) = (\<lambda>h. inner h (scaleR 2 x))"
nipkow@39302
   334
    by (simp add: fun_eq_iff inner_commute)
huffman@29993
   335
  have "0 < inner x x" using `x \<noteq> 0` by simp
huffman@29993
   336
  then have 3: "DERIV sqrt (inner x x) :> (inverse (sqrt (inner x x)) / 2)"
huffman@29993
   337
    by (rule DERIV_real_sqrt)
huffman@29993
   338
  have 4: "(inverse (sqrt (inner x x)) / 2) *\<^sub>R 2 *\<^sub>R x = sgn x"
huffman@29993
   339
    by (simp add: sgn_div_norm norm_eq_sqrt_inner)
huffman@29993
   340
  show ?thesis
huffman@29993
   341
    unfolding norm_eq_sqrt_inner
huffman@29993
   342
    apply (rule GDERIV_subst [OF _ 4])
huffman@29993
   343
    apply (rule GDERIV_DERIV_compose [where g=sqrt and df="scaleR 2 x"])
huffman@29993
   344
    apply (subst gderiv_def)
huffman@29993
   345
    apply (rule FDERIV_subst [OF _ 2])
huffman@29993
   346
    apply (rule 1)
huffman@29993
   347
    apply (rule 3)
huffman@29993
   348
    done
huffman@29993
   349
qed
huffman@29993
   350
huffman@29993
   351
lemmas FDERIV_norm = GDERIV_norm [unfolded gderiv_def]
huffman@29993
   352
huffman@29993
   353
end