(* Partial_Fractions 

   author: Jan Rocnik, isac team

   Copyright (c) isac team 2011

   Use is subject to license terms.

*)

(* Partial Fraction Decomposition *)

theory Partial_Fractions imports RootRatEq begin

ML\<open>

(*

signature PARTFRAC =

sig

  val ansatz_rls : rls

  val ansatz_rls_ : theory -> term -> (term * term list) option

end

*)

\<close>

subsection \<open>eval_ functions\<close>

consts

  factors_from_solution :: "bool list => real"

  drop_questionmarks    :: "'a => 'a"

text \<open>these might be used for variants of fac_from_sol\<close>

ML \<open>

fun mk_minus_1 T = Free("-1", T); (*TODO DELETE WITH numbers_to_string*)

fun flip_sign t = (*TODO improve for use in factors_from_solution: -(-1) etc*)

  let val minus_1 = t |> type_of |> mk_minus_1

  in HOLogic.mk_binop "Groups.times_class.times" (minus_1, t) end;

\<close>

text \<open>from solutions (e.g. [z = 1, z = -2]) make linear factors (e.g. (z - 1)*(z - -2))\<close>

ML \<open>

fun fac_from_sol s =

  let val (lhs, rhs) = HOLogic.dest_eq s

  in HOLogic.mk_binop "Groups.minus_class.minus" (lhs, rhs) end;

fun mk_prod prod [] =

      if prod = Rule.e_term then error "mk_prod called with []" else prod

  | mk_prod prod (t :: []) =

      if prod = Rule.e_term then t else HOLogic.mk_binop "Groups.times_class.times" (prod, t)

  | mk_prod prod (t1 :: t2 :: ts) =

        if prod = Rule.e_term 

        then 

           let val p = HOLogic.mk_binop "Groups.times_class.times" (t1, t2)

           in mk_prod p ts end 

        else 

           let val p = HOLogic.mk_binop "Groups.times_class.times" (prod, t1)

           in mk_prod p (t2 :: ts) end 

fun factors_from_solution sol = 

  let val ts = HOLogic.dest_list sol

  in mk_prod Rule.e_term (map fac_from_sol ts) end;

(*("factors_from_solution", ("Partial_Fractions.factors_from_solution", 

     eval_factors_from_solution ""))*)

fun eval_factors_from_solution (thmid:string) _

     (t as Const ("Partial_Fractions.factors_from_solution", _) $ sol) thy =

       ((let val prod = factors_from_solution sol

         in SOME (TermC.mk_thmid thmid (Rule.term_to_string''' thy prod) "",

              HOLogic.Trueprop $ (TermC.mk_equality (t, prod)))

         end)

       handle _ => NONE)

 | eval_factors_from_solution _ _ _ _ = NONE;

\<close>

text \<open>'ansatz' introduces '?Vars' (questionable design); drop these again\<close>

ML \<open>

(*("drop_questionmarks", ("Partial_Fractions.drop_questionmarks", eval_drop_questionmarks ""))*)

fun eval_drop_questionmarks (thmid:string) _

     (t as Const ("Partial_Fractions.drop_questionmarks", _) $ tm) thy =

        if TermC.contains_Var tm

        then

          let

            val tm' = TermC.var2free tm

            in SOME (TermC.mk_thmid thmid (Rule.term_to_string''' thy tm') "",

                 HOLogic.Trueprop $ (TermC.mk_equality (t, tm')))

            end

        else NONE

  | eval_drop_questionmarks _ _ _ _ = NONE;

\<close>

text \<open>store eval_ functions for calls from Scripts\<close>

setup \<open>KEStore_Elems.add_calcs

  [("drop_questionmarks", ("Partial_Fractions.drop'_questionmarks", eval_drop_questionmarks ""))]\<close>

subsection \<open>'ansatz' for partial fractions\<close>

axiomatization where

  ansatz_2nd_order: "n / (a*b) = A/a + B/b" and

  ansatz_3rd_order: "n / (a*b*c) = A/a + B/b + C/c" and

  ansatz_4th_order: "n / (a*b*c*d) = A/a + B/b + C/c + D/d" and

  (*version 1*)

  equival_trans_2nd_order: "(n/(a*b) = A/a + B/b) = (n = A*b + B*a)" and

  equival_trans_3rd_order: "(n/(a*b*c) = A/a + B/b + C/c) = (n = A*b*c + B*a*c + C*a*b)" and

  equival_trans_4th_order: "(n/(a*b*c*d) = A/a + B/b + C/c + D/d) = 

    (n = A*b*c*d + B*a*c*d + C*a*b*d + D*a*b*c)" and

  (*version 2: not yet used, see partial_fractions.sml*)

  multiply_2nd_order: "(n/x = A/a + B/b) = (a*b*n/x = A*b + B*a)" and

  multiply_3rd_order: "(n/x = A/a + B/b + C/c) = (a*b*c*n/x = A*b*c + B*a*c + C*a*b)" and

  multiply_4th_order: 

    "(n/x = A/a + B/b + C/c + D/d) = (a*b*c*d*n/x = A*b*c*d + B*a*c*d + C*a*b*d + D*a*b*c)"

text \<open>Probably the optimal formalization woudl be ...

  multiply_2nd_order: "x = a*b ==> (n/x = A/a + B/b) = (a*b*n/x = A*b + B*a)" and

  multiply_3rd_order: "x = a*b*c ==>

    (n/x = A/a + B/b + C/c) = (a*b*c*n/x = A*b*c + B*a*c + C*a*b)" and

  multiply_4th_order: "x = a*b*c*d ==>

    (n/x = A/a + B/b + C/c + D/d) = (a*b*c*d*n/x = A*b*c*d + B*a*c*d + C*a*b*d + D*a*b*c)"

... because it would allow to start the ansatz as follows

(1) 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z))) = 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z)))

(2) 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z))) = AA / (z - 1 / 2) + BB / (z - -1 / 4)

(3) (z - 1 / 2) * (z - -1 / 4) * 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z))) = 

    (z - 1 / 2) * (z - -1 / 4) * AA / (z - 1 / 2) + BB / (z - -1 / 4)

(4) 3 = A * (z - -1 / 4) + B * (z - 1 / 2)

... (1==>2) ansatz

    (2==>3) multiply_*

    (3==>4) norm_Rational

TODOs for this version ar in partial_fractions.sml "--- progr.vers.2: "

\<close>

ML \<open>

val ansatz_rls = prep_rls'(

  Rule.Rls {id = "ansatz_rls", preconds = [], rew_ord = ("dummy_ord",Rule.dummy_ord), 

	  erls = Rule.Erls, srls = Rule.Erls, calc = [], errpatts = [],

	  rules = 

	   [Rule.Thm ("ansatz_2nd_order",TermC.num_str @{thm ansatz_2nd_order}),

	    Rule.Thm ("ansatz_3rd_order",TermC.num_str @{thm ansatz_3rd_order})

	   ], 

	 scr = Rule.EmptyScr});

val equival_trans = prep_rls'(

  Rule.Rls {id = "equival_trans", preconds = [], rew_ord = ("dummy_ord",Rule.dummy_ord), 

	  erls = Rule.Erls, srls = Rule.Erls, calc = [], errpatts = [],

	  rules = 

	   [Rule.Thm ("equival_trans_2nd_order",TermC.num_str @{thm equival_trans_2nd_order}),

	    Rule.Thm ("equival_trans_3rd_order",TermC.num_str @{thm equival_trans_3rd_order})

	   ], 

	 scr = Rule.EmptyScr});

val multiply_ansatz = prep_rls'(

  Rule.Rls {id = "multiply_ansatz", preconds = [], rew_ord = ("dummy_ord",Rule.dummy_ord), 

	  erls = Rule.Erls,

	  srls = Rule.Erls, calc = [], errpatts = [],

	  rules = 

	   [Rule.Thm ("multiply_2nd_order",TermC.num_str @{thm multiply_2nd_order})

	   ], 

	 scr = Rule.EmptyScr});

\<close>

text \<open>store the rule set for math engine\<close>

setup \<open>KEStore_Elems.add_rlss 

  [("ansatz_rls", (Context.theory_name @{theory}, ansatz_rls)), 

  ("multiply_ansatz", (Context.theory_name @{theory}, multiply_ansatz)), 

  ("equival_trans", (Context.theory_name @{theory}, equival_trans))]\<close>

subsection \<open>Specification\<close>

consts

  decomposedFunction :: "real => una"

ML \<open>

Celem.check_guhs_unique := false; (*WN120307 REMOVE after editing*)

\<close>

setup \<open>KEStore_Elems.add_pbts

  [(Specify.prep_pbt @{theory} "pbl_simp_rat_partfrac" [] Celem.e_pblID

      (["partial_fraction", "rational", "simplification"],

        [("#Given" ,["functionTerm t_t", "solveFor v_v"]),

          (* TODO: call this sub-problem with appropriate functionTerm: 

            leading coefficient of the denominator is 1: to be checked here! and..

            ("#Where" ,["((get_numerator t_t) has_degree_in v_v) < 

               ((get_denominator t_t) has_degree_in v_v)"]), TODO*)

          ("#Find"  ,["decomposedFunction p_p'''"])],

        Rule.append_rls "e_rls" Rule.e_rls [(*for preds in where_ TODO*)], 

        NONE, 

        [["simplification","of_rationals","to_partial_fraction"]]))]\<close>

subsection \<open>Method\<close>

consts

  PartFracScript  :: "[real,real,  real] => real" 

    ("((Script PartFracScript (_ _ =))// (_))" 9)

text \<open>rule set for functions called in the Script\<close>

ML \<open>

  val srls_partial_fraction = Rule.Rls {id="srls_partial_fraction", 

    preconds = [],

    rew_ord = ("termlessI",termlessI),

    erls = Rule.append_rls "erls_in_srls_partial_fraction" Rule.e_rls

      [(*for asm in NTH_CONS ...*)

       Rule.Calc ("Orderings.ord_class.less",eval_equ "#less_"),

       (*2nd NTH_CONS pushes n+-1 into asms*)

       Rule.Calc("Groups.plus_class.plus", eval_binop "#add_")], 

    srls = Rule.Erls, calc = [], errpatts = [],

    rules = [

       Rule.Thm ("NTH_CONS",TermC.num_str @{thm NTH_CONS}),

       Rule.Calc("Groups.plus_class.plus", eval_binop "#add_"),

       Rule.Thm ("NTH_NIL",TermC.num_str @{thm NTH_NIL}),

       Rule.Calc("Tools.lhs", eval_lhs "eval_lhs_"),

       Rule.Calc("Tools.rhs", eval_rhs"eval_rhs_"),

       Rule.Calc("Atools.argument'_in", eval_argument_in "Atools.argument'_in"),

       Rule.Calc("Rational.get_denominator", eval_get_denominator "#get_denominator"),

       Rule.Calc("Rational.get_numerator", eval_get_numerator "#get_numerator"),

       Rule.Calc("Partial_Fractions.factors_from_solution",

         eval_factors_from_solution "#factors_from_solution"),

       Rule.Calc("Partial_Fractions.drop_questionmarks", eval_drop_questionmarks "#drop_?")],

    scr = Rule.EmptyScr};

\<close>

ML \<open>

eval_drop_questionmarks;

\<close>

ML \<open>

val ctxt = Proof_Context.init_global @{theory};

val SOME t = TermC.parseNEW ctxt "eqr = drop_questionmarks eqr";

\<close>

ML \<open>

TermC.parseNEW ctxt "decomposedFunction p_p'''";

TermC.parseNEW ctxt "decomposedFunction";

\<close>

(* current version, error outcommented *)

setup \<open>KEStore_Elems.add_mets

  [Specify.prep_met @{theory} "met_partial_fraction" [] Celem.e_metID

      (["simplification","of_rationals","to_partial_fraction"], 

        [("#Given" ,["functionTerm t_t", "solveFor v_v"]),

          (*("#Where" ,["((get_numerator t_t) has_degree_in v_v) < 

            ((get_denominator t_t) has_degree_in v_v)"]), TODO*)

          ("#Find"  ,["decomposedFunction p_p'''"])],

        (*f_f = 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z)), zzz: z*)

        {rew_ord'="tless_true", rls'= Rule.e_rls, calc = [], srls = srls_partial_fraction, prls = Rule.e_rls,

          crls = Rule.e_rls, errpats = [], nrls = Rule.e_rls},

        (*([], Frm), Problem (Partial_Fractions, [partial_fraction, rational, simplification])*)

        "Script PartFracScript (f_f::real) (zzz::real) =   " ^

          (*([1], Frm), 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z)))*)

          "(let f_f = Take f_f;                              " ^

          (*           num_orig = 3*)

          "  (num_orig::real) = get_numerator f_f;           " ^

          (*([1], Res), 24 / (-1 + -2 * z + 8 * z ^^^ 2)*)

          "  f_f = (Rewrite_Set norm_Rational False) f_f;    " ^

          (*           denom = -1 + -2 * z + 8 * z ^^^ 2*)

          "  (denom::real) = get_denominator f_f;            " ^

          (*           equ = -1 + -2 * z + 8 * z ^^^ 2 = 0*)

          "  (equ::bool) = (denom = (0::real));              " ^

          (*([2], Pbl), solve (-1 + -2 * z + 8 * z ^^^ 2 = 0, z)*)

          "  (L_L::bool list) = (SubProblem (PolyEq',        " ^

          "    [abcFormula, degree_2, polynomial, univariate, equation], " ^

          (*([2], Res), [z = 1 / 2, z = -1 / 4]*)

          "    [no_met]) [BOOL equ, REAL zzz]);              " ^

          (*           facs: (z - 1 / 2) * (z - -1 / 4)*)

          "  (facs::real) = factors_from_solution L_L;       " ^

          (*([3], Frm), 33 / ((z - 1 / 2) * (z - -1 / 4)) *) 

          "  (eql::real) = Take (num_orig / facs);           " ^

          (*([3], Res), ?A / (z - 1 / 2) + ?B / (z - -1 / 4)*)

          "  (eqr::real) = (Try (Rewrite_Set ansatz_rls False)) eql;  " ^

          (*([4], Frm), 3 / ((z - 1 / 2) * (z - -1 / 4)) = ?A / (z - 1 / 2) + ?B / (z - -1 / 4)*)

          "  (eq::bool) = Take (eql = eqr);                  " ^

          (*([4], Res), 3 = ?A * (z - -1 / 4) + ?B * (z - 1 / 2)*)

          "  eq = (Try (Rewrite_Set equival_trans False)) eq;" ^

          (*           eq = 3 = A * (z - -1 / 4) + B * (z - 1 / 2)*)

          "  eq = drop_questionmarks eq;                     " ^

          (*           z1 = 1 / 2*)

          "  (z1::real) = (rhs (NTH 1 L_L));                 " ^

          (*           z2 = -1 / 4*)

          "  (z2::real) = (rhs (NTH 2 L_L));                 " ^

          (*([5], Frm), 3 = A * (z - -1 / 4) + B * (z - 1 / 2)*)

          "  (eq_a::bool) = Take eq;                         " ^

          (*([5], Res), 3 = A * (1 / 2 - -1 / 4) + B * (1 / 2 - 1 / 2)*)

          "  eq_a = (Substitute [zzz = z1]) eq;              " ^

          (*([6], Res), 3 = 3 * A / 4*)

          "  eq_a = (Rewrite_Set norm_Rational False) eq_a;  " ^

          (*([7], Pbl), solve (3 = 3 * A / 4, A)*)

          "  (sol_a::bool list) =                            " ^

          "    (SubProblem (Isac', [univariate,equation], [no_met])   " ^

          (*([7], Res), [A = 4]*)

          "    [BOOL eq_a, REAL (A::real)]);                 " ^

          (*           a = 4*)

          "  (a::real) = (rhs (NTH 1 sol_a));                " ^

          (*([8], Frm), 3 = A * (z - -1 / 4) + B * (z - 1 / 2)*)

          "  (eq_b::bool) = Take eq;                         " ^

          (*([8], Res), 3 = A * (-1 / 4 - -1 / 4) + B * (-1 / 4 - 1 / 2)*)

          "  eq_b = (Substitute [zzz = z2]) eq_b;            " ^

          (*([9], Res), 3 = -3 * B / 4*)

          "  eq_b = (Rewrite_Set norm_Rational False) eq_b;  " ^

          (*([10], Pbl), solve (3 = -3 * B / 4, B)*)

          "  (sol_b::bool list) =                            " ^

          "    (SubProblem (Isac', [univariate,equation], [no_met])   " ^

          (*([10], Res), [B = -4]*)

          "    [BOOL eq_b, REAL (B::real)]);                 " ^

          (*           b = -4*)

          "  (b::real) = (rhs (NTH 1 sol_b));                " ^

          (*           eqr = A / (z - 1 / 2) + B / (z - -1 / 4)*)

          "  eqr = drop_questionmarks eqr;                   " ^

          (*([11], Frm), A / (z - 1 / 2) + B / (z - -1 / 4)*)

          "  (pbz::real) = Take eqr;                         " ^

          (*([11], Res), 4 / (z - 1 / 2) + -4 / (z - -1 / 4)*)

          "  pbz = ((Substitute [A = a, B = b]) pbz)         " ^

          (*([], Res), 4 / (z - 1 / 2) + -4 / (z - -1 / 4)*)

          "in pbz)"

)]

\<close>

ML \<open>

(*

  val fmz =                                             

    ["functionTerm (3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z))))", 

      "solveFor z", "functionTerm p_p"];

  val (dI',pI',mI') =

    ("Partial_Fractions", 

      ["partial_fraction", "rational", "simplification"],

      ["simplification","of_rationals","to_partial_fraction"]);

  val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];

*)

\<close>

subsection \<open>\<close>

end