src/HOL/Multivariate_Analysis/normarith.ML
author wenzelm
Sat May 15 21:50:05 2010 +0200 (2010-05-15)
changeset 36945 9bec62c10714
parent 36939 897ee863885d
child 37744 3daaf23b9ab4
permissions -rw-r--r--
less pervasive names from structure Thm;
wenzelm@36938
     1
(*  Title:      Library/normarith.ML
wenzelm@36938
     2
    Author:     Amine Chaieb, University of Cambridge
wenzelm@36938
     3
wenzelm@36938
     4
Simple decision procedure for linear problems in Euclidean space.
chaieb@31118
     5
*)
chaieb@29841
     6
wenzelm@36938
     7
signature NORM_ARITH =
chaieb@29841
     8
sig
chaieb@29841
     9
 val norm_arith : Proof.context -> conv
chaieb@29841
    10
 val norm_arith_tac : Proof.context -> int -> tactic
chaieb@29841
    11
end
chaieb@29841
    12
wenzelm@36938
    13
structure NormArith : NORM_ARITH =
chaieb@29841
    14
struct
chaieb@29841
    15
Philipp@32832
    16
 open Conv;
chaieb@29841
    17
 val bool_eq = op = : bool *bool -> bool
chaieb@30868
    18
  fun dest_ratconst t = case term_of t of
chaieb@29841
    19
   Const(@{const_name divide}, _)$a$b => Rat.rat_of_quotient(HOLogic.dest_number a |> snd, HOLogic.dest_number b |> snd)
chaieb@30868
    20
 | Const(@{const_name inverse}, _)$a => Rat.rat_of_quotient(1, HOLogic.dest_number a |> snd)
chaieb@29841
    21
 | _ => Rat.rat_of_int (HOLogic.dest_number (term_of t) |> snd)
chaieb@29841
    22
 fun is_ratconst t = can dest_ratconst t
wenzelm@36938
    23
 fun augment_norm b t acc = case term_of t of
Philipp@32832
    24
     Const(@{const_name norm}, _) $ _ => insert (eq_pair bool_eq (op aconvc)) (b,Thm.dest_arg t) acc
chaieb@29841
    25
   | _ => acc
chaieb@29841
    26
 fun find_normedterms t acc = case term_of t of
chaieb@29841
    27
    @{term "op + :: real => _"}$_$_ =>
Philipp@32832
    28
            find_normedterms (Thm.dest_arg1 t) (find_normedterms (Thm.dest_arg t) acc)
chaieb@29841
    29
      | @{term "op * :: real => _"}$_$n =>
Philipp@32832
    30
            if not (is_ratconst (Thm.dest_arg1 t)) then acc else
wenzelm@36938
    31
            augment_norm (dest_ratconst (Thm.dest_arg1 t) >=/ Rat.zero)
Philipp@32832
    32
                      (Thm.dest_arg t) acc
wenzelm@36938
    33
      | _ => augment_norm true t acc
chaieb@29841
    34
Philipp@32832
    35
 val cterm_lincomb_neg = FuncUtil.Ctermfunc.map Rat.neg
wenzelm@36938
    36
 fun cterm_lincomb_cmul c t =
Philipp@32832
    37
    if c =/ Rat.zero then FuncUtil.Ctermfunc.empty else FuncUtil.Ctermfunc.map (fn x => x */ c) t
Philipp@32832
    38
 fun cterm_lincomb_add l r = FuncUtil.Ctermfunc.combine (curry op +/) (fn x => x =/ Rat.zero) l r
chaieb@29841
    39
 fun cterm_lincomb_sub l r = cterm_lincomb_add l (cterm_lincomb_neg r)
Philipp@32832
    40
 fun cterm_lincomb_eq l r = FuncUtil.Ctermfunc.is_empty (cterm_lincomb_sub l r)
chaieb@29841
    41
Philipp@32832
    42
 val int_lincomb_neg = FuncUtil.Intfunc.map Rat.neg
wenzelm@36938
    43
 fun int_lincomb_cmul c t =
Philipp@32832
    44
    if c =/ Rat.zero then FuncUtil.Intfunc.empty else FuncUtil.Intfunc.map (fn x => x */ c) t
Philipp@32832
    45
 fun int_lincomb_add l r = FuncUtil.Intfunc.combine (curry op +/) (fn x => x =/ Rat.zero) l r
chaieb@29841
    46
 fun int_lincomb_sub l r = int_lincomb_add l (int_lincomb_neg r)
Philipp@32832
    47
 fun int_lincomb_eq l r = FuncUtil.Intfunc.is_empty (int_lincomb_sub l r)
chaieb@29841
    48
wenzelm@36938
    49
fun vector_lincomb t = case term_of t of
huffman@31445
    50
   Const(@{const_name plus}, _) $ _ $ _ =>
Philipp@32832
    51
    cterm_lincomb_add (vector_lincomb (Thm.dest_arg1 t)) (vector_lincomb (Thm.dest_arg t))
huffman@31445
    52
 | Const(@{const_name minus}, _) $ _ $ _ =>
Philipp@32832
    53
    cterm_lincomb_sub (vector_lincomb (Thm.dest_arg1 t)) (vector_lincomb (Thm.dest_arg t))
huffman@31445
    54
 | Const(@{const_name scaleR}, _)$_$_ =>
Philipp@32832
    55
    cterm_lincomb_cmul (dest_ratconst (Thm.dest_arg1 t)) (vector_lincomb (Thm.dest_arg t))
huffman@31445
    56
 | Const(@{const_name uminus}, _)$_ =>
Philipp@32832
    57
     cterm_lincomb_neg (vector_lincomb (Thm.dest_arg t))
huffman@31445
    58
(* FIXME: how should we handle numerals?
wenzelm@36938
    59
 | Const(@ {const_name vec},_)$_ =>
wenzelm@36938
    60
   let
wenzelm@36938
    61
     val b = ((snd o HOLogic.dest_number o term_of o Thm.dest_arg) t = 0
chaieb@29841
    62
               handle TERM _=> false)
Philipp@32832
    63
   in if b then FuncUtil.Ctermfunc.onefunc (t,Rat.one)
Philipp@32832
    64
      else FuncUtil.Ctermfunc.empty
chaieb@29841
    65
   end
huffman@31445
    66
*)
Philipp@32832
    67
 | _ => FuncUtil.Ctermfunc.onefunc (t,Rat.one)
chaieb@29841
    68
chaieb@29841
    69
 fun vector_lincombs ts =
wenzelm@36938
    70
  fold_rev
chaieb@29841
    71
   (fn t => fn fns => case AList.lookup (op aconvc) fns t of
wenzelm@36938
    72
     NONE =>
wenzelm@36938
    73
       let val f = vector_lincomb t
chaieb@29841
    74
       in case find_first (fn (_,f') => cterm_lincomb_eq f f') fns of
chaieb@29841
    75
           SOME (_,f') => (t,f') :: fns
wenzelm@36938
    76
         | NONE => (t,f) :: fns
chaieb@29841
    77
       end
chaieb@29841
    78
   | SOME _ => fns) ts []
chaieb@29841
    79
wenzelm@36938
    80
fun replacenegnorms cv t = case term_of t of
chaieb@29841
    81
  @{term "op + :: real => _"}$_$_ => binop_conv (replacenegnorms cv) t
wenzelm@36938
    82
| @{term "op * :: real => _"}$_$_ =>
wenzelm@36945
    83
    if dest_ratconst (Thm.dest_arg1 t) </ Rat.zero then arg_conv cv t else Thm.reflexive t
wenzelm@36945
    84
| _ => Thm.reflexive t
wenzelm@36938
    85
fun flip v eq =
wenzelm@36938
    86
  if FuncUtil.Ctermfunc.defined eq v
Philipp@32832
    87
  then FuncUtil.Ctermfunc.update (v, Rat.neg (FuncUtil.Ctermfunc.apply eq v)) eq else eq
wenzelm@36938
    88
fun allsubsets s = case s of
chaieb@29841
    89
  [] => [[]]
chaieb@29841
    90
|(a::t) => let val res = allsubsets t in
chaieb@29841
    91
               map (cons a) res @ res end
chaieb@29841
    92
fun evaluate env lin =
wenzelm@36938
    93
 FuncUtil.Intfunc.fold (fn (x,c) => fn s => s +/ c */ (FuncUtil.Intfunc.apply env x))
chaieb@29841
    94
   lin Rat.zero
chaieb@29841
    95
chaieb@29841
    96
fun solve (vs,eqs) = case (vs,eqs) of
Philipp@32832
    97
  ([],[]) => SOME (FuncUtil.Intfunc.onefunc (0,Rat.one))
wenzelm@36938
    98
 |(_,eq::oeqs) =>
Philipp@32832
    99
   (case filter (member (op =) vs) (FuncUtil.Intfunc.dom eq) of (*FIXME use find_first here*)
chaieb@29841
   100
     [] => NONE
wenzelm@36938
   101
    | v::_ =>
wenzelm@36938
   102
       if FuncUtil.Intfunc.defined eq v
wenzelm@36938
   103
       then
wenzelm@36938
   104
        let
Philipp@32832
   105
         val c = FuncUtil.Intfunc.apply eq v
chaieb@29841
   106
         val vdef = int_lincomb_cmul (Rat.neg (Rat.inv c)) eq
wenzelm@36938
   107
         fun eliminate eqn = if not (FuncUtil.Intfunc.defined eqn v) then eqn
Philipp@32832
   108
                             else int_lincomb_add (int_lincomb_cmul (FuncUtil.Intfunc.apply eqn v) vdef) eqn
haftmann@33040
   109
        in (case solve (remove (op =) v vs, map eliminate oeqs) of
chaieb@29841
   110
            NONE => NONE
Philipp@32832
   111
          | SOME soln => SOME (FuncUtil.Intfunc.update (v, evaluate soln (FuncUtil.Intfunc.delete_safe v vdef)) soln))
chaieb@29841
   112
        end
chaieb@29841
   113
       else NONE)
chaieb@29841
   114
chaieb@29841
   115
fun combinations k l = if k = 0 then [[]] else
wenzelm@36938
   116
 case l of
chaieb@29841
   117
  [] => []
chaieb@29841
   118
| h::t => map (cons h) (combinations (k - 1) t) @ combinations k t
chaieb@29841
   119
chaieb@29841
   120
wenzelm@36938
   121
fun forall2 p l1 l2 = case (l1,l2) of
chaieb@29841
   122
   ([],[]) => true
chaieb@29841
   123
 | (h1::t1,h2::t2) => p h1 h2 andalso forall2 p t1 t2
chaieb@29841
   124
 | _ => false;
chaieb@29841
   125
chaieb@29841
   126
chaieb@29841
   127
fun vertices vs eqs =
wenzelm@36938
   128
 let
chaieb@29841
   129
  fun vertex cmb = case solve(vs,cmb) of
chaieb@29841
   130
    NONE => NONE
Philipp@32832
   131
   | SOME soln => SOME (map (fn v => FuncUtil.Intfunc.tryapplyd soln v Rat.zero) vs)
chaieb@29841
   132
  val rawvs = map_filter vertex (combinations (length vs) eqs)
wenzelm@36938
   133
  val unset = filter (forall (fn c => c >=/ Rat.zero)) rawvs
wenzelm@36938
   134
 in fold_rev (insert (uncurry (forall2 (curry op =/)))) unset []
wenzelm@36938
   135
 end
chaieb@29841
   136
wenzelm@36938
   137
fun subsumes l m = forall2 (fn x => fn y => Rat.abs x <=/ Rat.abs y) l m
chaieb@29841
   138
chaieb@29841
   139
fun subsume todo dun = case todo of
chaieb@29841
   140
 [] => dun
wenzelm@36938
   141
|v::ovs =>
chaieb@29841
   142
   let val dun' = if exists (fn w => subsumes w v) dun then dun
wenzelm@36938
   143
                  else v::(filter (fn w => not(subsumes v w)) dun)
wenzelm@36938
   144
   in subsume ovs dun'
chaieb@29841
   145
   end;
chaieb@29841
   146
chaieb@29841
   147
fun match_mp PQ P = P RS PQ;
chaieb@29841
   148
wenzelm@36938
   149
fun cterm_of_rat x =
chaieb@29841
   150
let val (a, b) = Rat.quotient_of_rat x
wenzelm@36938
   151
in
chaieb@29841
   152
 if b = 1 then Numeral.mk_cnumber @{ctyp "real"} a
wenzelm@36938
   153
  else Thm.capply (Thm.capply @{cterm "op / :: real => _"}
chaieb@29841
   154
                   (Numeral.mk_cnumber @{ctyp "real"} a))
chaieb@29841
   155
        (Numeral.mk_cnumber @{ctyp "real"} b)
chaieb@29841
   156
end;
chaieb@29841
   157
chaieb@29841
   158
fun norm_cmul_rule c th = instantiate' [] [SOME (cterm_of_rat c)] (th RS @{thm norm_cmul_rule_thm});
chaieb@29841
   159
chaieb@29841
   160
fun norm_add_rule th1 th2 = [th1, th2] MRS @{thm norm_add_rule_thm};
chaieb@29841
   161
chaieb@29841
   162
  (* I think here the static context should be sufficient!! *)
wenzelm@36938
   163
fun inequality_canon_rule ctxt =
wenzelm@36938
   164
 let
chaieb@29841
   165
  (* FIXME : Should be computed statically!! *)
wenzelm@36938
   166
  val real_poly_conv =
haftmann@36753
   167
    Semiring_Normalizer.semiring_normalize_wrapper ctxt
haftmann@36753
   168
     (the (Semiring_Normalizer.match ctxt @{cterm "(0::real) + 1"}))
haftmann@36751
   169
 in fconv_rule (arg_conv ((rewr_conv @{thm ge_iff_diff_ge_0}) then_conv arg_conv (Numeral_Simprocs.field_comp_conv then_conv real_poly_conv)))
chaieb@29841
   170
end;
chaieb@29841
   171
chaieb@29841
   172
 val apply_pth1 = rewr_conv @{thm pth_1};
chaieb@29841
   173
 val apply_pth2 = rewr_conv @{thm pth_2};
chaieb@29841
   174
 val apply_pth3 = rewr_conv @{thm pth_3};
chaieb@29841
   175
 val apply_pth4 = rewrs_conv @{thms pth_4};
chaieb@29841
   176
 val apply_pth5 = rewr_conv @{thm pth_5};
chaieb@29841
   177
 val apply_pth6 = rewr_conv @{thm pth_6};
chaieb@29841
   178
 val apply_pth7 = rewrs_conv @{thms pth_7};
haftmann@36751
   179
 val apply_pth8 = rewr_conv @{thm pth_8} then_conv arg1_conv Numeral_Simprocs.field_comp_conv then_conv (try_conv (rewr_conv (mk_meta_eq @{thm scaleR_zero_left})));
haftmann@36751
   180
 val apply_pth9 = rewrs_conv @{thms pth_9} then_conv arg1_conv (arg1_conv Numeral_Simprocs.field_comp_conv);
chaieb@29841
   181
 val apply_ptha = rewr_conv @{thm pth_a};
chaieb@29841
   182
 val apply_pthb = rewrs_conv @{thms pth_b};
chaieb@29841
   183
 val apply_pthc = rewrs_conv @{thms pth_c};
chaieb@29841
   184
 val apply_pthd = try_conv (rewr_conv @{thm pth_d});
chaieb@29841
   185
wenzelm@36938
   186
fun headvector t = case t of
huffman@31445
   187
  Const(@{const_name plus}, _)$
huffman@31445
   188
   (Const(@{const_name scaleR}, _)$l$v)$r => v
huffman@31445
   189
 | Const(@{const_name scaleR}, _)$l$v => v
chaieb@29841
   190
 | _ => error "headvector: non-canonical term"
chaieb@29841
   191
chaieb@29841
   192
fun vector_cmul_conv ct =
haftmann@36751
   193
   ((apply_pth5 then_conv arg1_conv Numeral_Simprocs.field_comp_conv) else_conv
chaieb@29841
   194
    (apply_pth6 then_conv binop_conv vector_cmul_conv)) ct
chaieb@29841
   195
wenzelm@36938
   196
fun vector_add_conv ct = apply_pth7 ct
wenzelm@36938
   197
 handle CTERM _ =>
wenzelm@36938
   198
  (apply_pth8 ct
wenzelm@36938
   199
   handle CTERM _ =>
wenzelm@36938
   200
    (case term_of ct of
chaieb@29841
   201
     Const(@{const_name plus},_)$lt$rt =>
wenzelm@36938
   202
      let
wenzelm@36938
   203
       val l = headvector lt
chaieb@29841
   204
       val r = headvector rt
wenzelm@35408
   205
      in (case Term_Ord.fast_term_ord (l,r) of
wenzelm@36938
   206
         LESS => (apply_pthb then_conv arg_conv vector_add_conv
chaieb@29841
   207
                  then_conv apply_pthd) ct
wenzelm@36938
   208
        | GREATER => (apply_pthc then_conv arg_conv vector_add_conv
wenzelm@36938
   209
                     then_conv apply_pthd) ct
wenzelm@36938
   210
        | EQUAL => (apply_pth9 then_conv
wenzelm@36938
   211
                ((apply_ptha then_conv vector_add_conv) else_conv
chaieb@29841
   212
              arg_conv vector_add_conv then_conv apply_pthd)) ct)
chaieb@29841
   213
      end
wenzelm@36945
   214
     | _ => Thm.reflexive ct))
chaieb@29841
   215
chaieb@29841
   216
fun vector_canon_conv ct = case term_of ct of
chaieb@29841
   217
 Const(@{const_name plus},_)$_$_ =>
wenzelm@36938
   218
  let
chaieb@29841
   219
   val ((p,l),r) = Thm.dest_comb ct |>> Thm.dest_comb
wenzelm@36938
   220
   val lth = vector_canon_conv l
chaieb@29841
   221
   val rth = vector_canon_conv r
wenzelm@36938
   222
   val th = Drule.binop_cong_rule p lth rth
chaieb@29841
   223
  in fconv_rule (arg_conv vector_add_conv) th end
chaieb@29841
   224
huffman@31445
   225
| Const(@{const_name scaleR}, _)$_$_ =>
wenzelm@36938
   226
  let
chaieb@29841
   227
   val (p,r) = Thm.dest_comb ct
wenzelm@36938
   228
   val rth = Drule.arg_cong_rule p (vector_canon_conv r)
chaieb@29841
   229
  in fconv_rule (arg_conv (apply_pth4 else_conv vector_cmul_conv)) rth
chaieb@29841
   230
  end
chaieb@29841
   231
chaieb@29841
   232
| Const(@{const_name minus},_)$_$_ => (apply_pth2 then_conv vector_canon_conv) ct
chaieb@29841
   233
chaieb@29841
   234
| Const(@{const_name uminus},_)$_ => (apply_pth3 then_conv vector_canon_conv) ct
chaieb@29841
   235
huffman@31445
   236
(* FIXME
wenzelm@36938
   237
| Const(@{const_name vec},_)$n =>
chaieb@29841
   238
  let val n = Thm.dest_arg ct
wenzelm@36938
   239
  in if is_ratconst n andalso not (dest_ratconst n =/ Rat.zero)
wenzelm@36945
   240
     then Thm.reflexive ct else apply_pth1 ct
chaieb@29841
   241
  end
huffman@31445
   242
*)
chaieb@29841
   243
| _ => apply_pth1 ct
chaieb@29841
   244
chaieb@29841
   245
fun norm_canon_conv ct = case term_of ct of
chaieb@29841
   246
  Const(@{const_name norm},_)$_ => arg_conv vector_canon_conv ct
chaieb@29841
   247
 | _ => raise CTERM ("norm_canon_conv", [ct])
chaieb@29841
   248
chaieb@29841
   249
fun fold_rev2 f [] [] z = z
chaieb@29841
   250
 | fold_rev2 f (x::xs) (y::ys) z = f x y (fold_rev2 f xs ys z)
chaieb@29841
   251
 | fold_rev2 f _ _ _ = raise UnequalLengths;
chaieb@29841
   252
wenzelm@36938
   253
fun int_flip v eq =
wenzelm@36938
   254
  if FuncUtil.Intfunc.defined eq v
Philipp@32832
   255
  then FuncUtil.Intfunc.update (v, Rat.neg (FuncUtil.Intfunc.apply eq v)) eq else eq;
chaieb@29841
   256
chaieb@29841
   257
local
huffman@31445
   258
 val pth_zero = @{thm norm_zero}
Philipp@32832
   259
 val tv_n = (ctyp_of_term o Thm.dest_arg o Thm.dest_arg1 o Thm.dest_arg o cprop_of)
chaieb@29841
   260
             pth_zero
wenzelm@36938
   261
 val concl = Thm.dest_arg o cprop_of
wenzelm@36938
   262
 fun real_vector_combo_prover ctxt translator (nubs,ges,gts) =
wenzelm@36938
   263
  let
chaieb@29841
   264
   (* FIXME: Should be computed statically!!*)
wenzelm@36938
   265
   val real_poly_conv =
haftmann@36753
   266
      Semiring_Normalizer.semiring_normalize_wrapper ctxt
haftmann@36753
   267
       (the (Semiring_Normalizer.match ctxt @{cterm "(0::real) + 1"}))
Philipp@32832
   268
   val sources = map (Thm.dest_arg o Thm.dest_arg1 o concl) nubs
wenzelm@36938
   269
   val rawdests = fold_rev (find_normedterms o Thm.dest_arg o concl) (ges @ gts) []
wenzelm@36938
   270
   val _ = if not (forall fst rawdests) then error "real_vector_combo_prover: Sanity check"
chaieb@29841
   271
           else ()
chaieb@29841
   272
   val dests = distinct (op aconvc) (map snd rawdests)
chaieb@29841
   273
   val srcfuns = map vector_lincomb sources
wenzelm@36938
   274
   val destfuns = map vector_lincomb dests
haftmann@33042
   275
   val vvs = fold_rev (union (op aconvc) o FuncUtil.Ctermfunc.dom) (srcfuns @ destfuns) []
chaieb@29841
   276
   val n = length srcfuns
chaieb@29841
   277
   val nvs = 1 upto n
chaieb@29841
   278
   val srccombs = srcfuns ~~ nvs
chaieb@29841
   279
   fun consider d =
wenzelm@36938
   280
    let
chaieb@29841
   281
     fun coefficients x =
wenzelm@36938
   282
      let
Philipp@32832
   283
       val inp = if FuncUtil.Ctermfunc.defined d x then FuncUtil.Intfunc.onefunc (0, Rat.neg(FuncUtil.Ctermfunc.apply d x))
wenzelm@36938
   284
                      else FuncUtil.Intfunc.empty
wenzelm@36938
   285
      in fold_rev (fn (f,v) => fn g => if FuncUtil.Ctermfunc.defined f x then FuncUtil.Intfunc.update (v, FuncUtil.Ctermfunc.apply f x) g else g) srccombs inp
chaieb@29841
   286
      end
chaieb@29841
   287
     val equations = map coefficients vvs
Philipp@32832
   288
     val inequalities = map (fn n => FuncUtil.Intfunc.onefunc (n,Rat.one)) nvs
chaieb@29841
   289
     fun plausiblevertices f =
wenzelm@36938
   290
      let
chaieb@29841
   291
       val flippedequations = map (fold_rev int_flip f) equations
chaieb@29841
   292
       val constraints = flippedequations @ inequalities
chaieb@29841
   293
       val rawverts = vertices nvs constraints
chaieb@29841
   294
       fun check_solution v =
wenzelm@36938
   295
        let
Philipp@32832
   296
          val f = fold_rev2 (curry FuncUtil.Intfunc.update) nvs v (FuncUtil.Intfunc.onefunc (0, Rat.one))
chaieb@29841
   297
        in forall (fn e => evaluate f e =/ Rat.zero) flippedequations
chaieb@29841
   298
        end
chaieb@29841
   299
       val goodverts = filter check_solution rawverts
wenzelm@36938
   300
       val signfixups = map (fn n => if member (op =) f n then ~1 else 1) nvs
chaieb@29841
   301
      in map (map2 (fn s => fn c => Rat.rat_of_int s */ c) signfixups) goodverts
chaieb@29841
   302
      end
wenzelm@36938
   303
     val allverts = fold_rev append (map plausiblevertices (allsubsets nvs)) []
chaieb@29841
   304
    in subsume allverts []
chaieb@29841
   305
    end
chaieb@29841
   306
   fun compute_ineq v =
wenzelm@36938
   307
    let
wenzelm@36938
   308
     val ths = map_filter (fn (v,t) => if v =/ Rat.zero then NONE
chaieb@29841
   309
                                     else SOME(norm_cmul_rule v t))
wenzelm@36938
   310
                            (v ~~ nubs)
boehmes@32402
   311
     fun end_itlist f xs = split_last xs |> uncurry (fold_rev f)
chaieb@29841
   312
    in inequality_canon_rule ctxt (end_itlist norm_add_rule ths)
chaieb@29841
   313
    end
chaieb@29841
   314
   val ges' = map_filter (try compute_ineq) (fold_rev (append o consider) destfuns []) @
chaieb@29841
   315
                 map (inequality_canon_rule ctxt) nubs @ ges
chaieb@29841
   316
   val zerodests = filter
Philipp@32832
   317
        (fn t => null (FuncUtil.Ctermfunc.dom (vector_lincomb t))) (map snd rawdests)
chaieb@29841
   318
Philipp@32645
   319
  in fst (RealArith.real_linear_prover translator
huffman@31445
   320
        (map (fn t => instantiate ([(tv_n, ctyp_of_term t)],[]) pth_zero)
chaieb@29841
   321
            zerodests,
wenzelm@36936
   322
        map (fconv_rule (try_conv (Conv.top_sweep_conv (K norm_canon_conv) ctxt) then_conv
chaieb@29841
   323
                       arg_conv (arg_conv real_poly_conv))) ges',
wenzelm@36938
   324
        map (fconv_rule (try_conv (Conv.top_sweep_conv (K norm_canon_conv) ctxt) then_conv
Philipp@32645
   325
                       arg_conv (arg_conv real_poly_conv))) gts))
chaieb@29841
   326
  end
chaieb@29841
   327
in val real_vector_combo_prover = real_vector_combo_prover
chaieb@29841
   328
end;
chaieb@29841
   329
chaieb@29841
   330
local
chaieb@29841
   331
 val pth = @{thm norm_imp_pos_and_ge}
chaieb@29841
   332
 val norm_mp = match_mp pth
Philipp@32832
   333
 val concl = Thm.dest_arg o cprop_of
chaieb@29841
   334
 fun conjunct1 th = th RS @{thm conjunct1}
chaieb@29841
   335
 fun conjunct2 th = th RS @{thm conjunct2}
wenzelm@36938
   336
fun real_vector_ineq_prover ctxt translator (ges,gts) =
wenzelm@36938
   337
 let
chaieb@29841
   338
(*   val _ = error "real_vector_ineq_prover: pause" *)
Philipp@32832
   339
  val ntms = fold_rev find_normedterms (map (Thm.dest_arg o concl) (ges @ gts)) []
chaieb@29841
   340
  val lctab = vector_lincombs (map snd (filter (not o fst) ntms))
chaieb@29841
   341
  val (fxns, ctxt') = Variable.variant_fixes (replicate (length lctab) "x") ctxt
boehmes@32402
   342
  fun instantiate_cterm' ty tms = Drule.cterm_rule (Drule.instantiate' ty tms)
Philipp@32832
   343
  fun mk_norm t = Thm.capply (instantiate_cterm' [SOME (ctyp_of_term t)] [] @{cpat "norm :: (?'a :: real_normed_vector) => real"}) t
Philipp@32832
   344
  fun mk_equals l r = Thm.capply (Thm.capply (instantiate_cterm' [SOME (ctyp_of_term l)] [] @{cpat "op == :: ?'a =>_"}) l) r
wenzelm@36945
   345
  val asl = map2 (fn (t,_) => fn n => Thm.assume (mk_equals (mk_norm t) (cterm_of (ProofContext.theory_of ctxt') (Free(n,@{typ real}))))) lctab fxns
chaieb@29841
   346
  val replace_conv = try_conv (rewrs_conv asl)
chaieb@29841
   347
  val replace_rule = fconv_rule (funpow 2 arg_conv (replacenegnorms replace_conv))
chaieb@29841
   348
  val ges' =
chaieb@29841
   349
       fold_rev (fn th => fn ths => conjunct1(norm_mp th)::ths)
chaieb@29841
   350
              asl (map replace_rule ges)
chaieb@29841
   351
  val gts' = map replace_rule gts
chaieb@29841
   352
  val nubs = map (conjunct2 o norm_mp) asl
chaieb@29841
   353
  val th1 = real_vector_combo_prover ctxt' translator (nubs,ges',gts')
wenzelm@36938
   354
  val shs = filter (member (fn (t,th) => t aconvc cprop_of th) asl) (#hyps (crep_thm th1))
wenzelm@36945
   355
  val th11 = hd (Variable.export ctxt' ctxt [fold Thm.implies_intr shs th1])
Philipp@32832
   356
  val cps = map (swap o Thm.dest_equals) (cprems_of th11)
chaieb@29841
   357
  val th12 = instantiate ([], cps) th11
wenzelm@36945
   358
  val th13 = fold Thm.elim_implies (map (Thm.reflexive o snd) cps) th12;
chaieb@29841
   359
 in hd (Variable.export ctxt' ctxt [th13])
wenzelm@36938
   360
 end
chaieb@29841
   361
in val real_vector_ineq_prover = real_vector_ineq_prover
chaieb@29841
   362
end;
chaieb@29841
   363
chaieb@29841
   364
local
chaieb@29841
   365
 val rawrule = fconv_rule (arg_conv (rewr_conv @{thm real_eq_0_iff_le_ge_0}))
chaieb@29841
   366
 fun conj_pair th = (th RS @{thm conjunct1}, th RS @{thm conjunct2})
wenzelm@35408
   367
 fun simple_cterm_ord t u = Term_Ord.term_ord (term_of t, term_of u) = LESS;
chaieb@29841
   368
  (* FIXME: Lookup in the context every time!!! Fix this !!!*)
chaieb@29841
   369
 fun splitequation ctxt th acc =
wenzelm@36938
   370
  let
chaieb@29841
   371
   val real_poly_neg_conv = #neg
haftmann@36753
   372
       (Semiring_Normalizer.semiring_normalizers_ord_wrapper ctxt
haftmann@36753
   373
        (the (Semiring_Normalizer.match ctxt @{cterm "(0::real) + 1"})) simple_cterm_ord)
chaieb@29841
   374
   val (th1,th2) = conj_pair(rawrule th)
chaieb@29841
   375
  in th1::fconv_rule (arg_conv (arg_conv real_poly_neg_conv)) th2::acc
chaieb@29841
   376
  end
Philipp@32645
   377
in fun real_vector_prover ctxt _ translator (eqs,ges,gts) =
Philipp@32645
   378
     (real_vector_ineq_prover ctxt translator
Philipp@32645
   379
         (fold_rev (splitequation ctxt) eqs ges,gts), RealArith.Trivial)
chaieb@29841
   380
end;
chaieb@29841
   381
wenzelm@36938
   382
  fun init_conv ctxt =
wenzelm@36938
   383
   Simplifier.rewrite (Simplifier.context ctxt
huffman@36587
   384
     (HOL_basic_ss addsimps ([(*@{thm vec_0}, @{thm vec_1},*) @{thm dist_norm}, @{thm diff_0_right}, @{thm right_minus}, @{thm diff_self}, @{thm norm_zero}] @ @{thms arithmetic_simps} @ @{thms norm_pths})))
wenzelm@36938
   385
   then_conv Numeral_Simprocs.field_comp_conv
chaieb@29841
   386
   then_conv nnf_conv
chaieb@29841
   387
Philipp@32645
   388
 fun pure ctxt = fst o RealArith.gen_prover_real_arith ctxt (real_vector_prover ctxt);
wenzelm@36938
   389
 fun norm_arith ctxt ct =
wenzelm@36938
   390
  let
chaieb@29841
   391
   val ctxt' = Variable.declare_term (term_of ct) ctxt
chaieb@29841
   392
   val th = init_conv ctxt' ct
wenzelm@36945
   393
  in Thm.equal_elim (Drule.arg_cong_rule @{cterm Trueprop} (Thm.symmetric th))
Philipp@32832
   394
                (pure ctxt' (Thm.rhs_of th))
chaieb@29841
   395
 end
chaieb@29841
   396
wenzelm@36938
   397
 fun norm_arith_tac ctxt =
chaieb@29841
   398
   clarify_tac HOL_cs THEN'
wenzelm@35625
   399
   Object_Logic.full_atomize_tac THEN'
chaieb@29841
   400
   CSUBGOAL ( fn (p,i) => rtac (norm_arith ctxt (Thm.dest_arg p )) i);
chaieb@29841
   401
huffman@31445
   402
end;