src/HOL/Decision_Procs/Commutative_Ring.thy
author hoelzl
Fri Mar 22 10:41:43 2013 +0100 (2013-03-22)
changeset 51474 1e9e68247ad1
parent 48891 c0eafbd55de3
child 52658 1e7896c7f781
permissions -rw-r--r--
generalize Bfun and Bseq to metric spaces; Bseq is an abbreviation for Bfun
haftmann@28952
     1
(*  Author:     Bernhard Haeupler
wenzelm@17516
     2
wenzelm@17516
     3
Proving equalities in commutative rings done "right" in Isabelle/HOL.
wenzelm@17516
     4
*)
wenzelm@17516
     5
wenzelm@17516
     6
header {* Proving equalities in commutative rings *}
wenzelm@17516
     7
wenzelm@17516
     8
theory Commutative_Ring
haftmann@33356
     9
imports Main Parity
wenzelm@17516
    10
begin
wenzelm@17516
    11
wenzelm@17516
    12
text {* Syntax of multivariate polynomials (pol) and polynomial expressions. *}
wenzelm@17516
    13
wenzelm@17516
    14
datatype 'a pol =
wenzelm@17516
    15
    Pc 'a
wenzelm@17516
    16
  | Pinj nat "'a pol"
wenzelm@17516
    17
  | PX "'a pol" nat "'a pol"
wenzelm@17516
    18
wenzelm@17516
    19
datatype 'a polex =
wenzelm@20622
    20
    Pol "'a pol"
wenzelm@17516
    21
  | Add "'a polex" "'a polex"
wenzelm@17516
    22
  | Sub "'a polex" "'a polex"
wenzelm@17516
    23
  | Mul "'a polex" "'a polex"
wenzelm@17516
    24
  | Pow "'a polex" nat
wenzelm@17516
    25
  | Neg "'a polex"
wenzelm@17516
    26
wenzelm@17516
    27
text {* Interpretation functions for the shadow syntax. *}
wenzelm@17516
    28
haftmann@31021
    29
primrec
haftmann@31021
    30
  Ipol :: "'a::{comm_ring_1} list \<Rightarrow> 'a pol \<Rightarrow> 'a"
haftmann@22742
    31
where
haftmann@22742
    32
    "Ipol l (Pc c) = c"
haftmann@22742
    33
  | "Ipol l (Pinj i P) = Ipol (drop i l) P"
haftmann@22742
    34
  | "Ipol l (PX P x Q) = Ipol l P * (hd l)^x + Ipol (drop 1 l) Q"
wenzelm@17516
    35
haftmann@31021
    36
primrec
haftmann@31021
    37
  Ipolex :: "'a::{comm_ring_1} list \<Rightarrow> 'a polex \<Rightarrow> 'a"
haftmann@22742
    38
where
haftmann@22742
    39
    "Ipolex l (Pol P) = Ipol l P"
haftmann@22742
    40
  | "Ipolex l (Add P Q) = Ipolex l P + Ipolex l Q"
haftmann@22742
    41
  | "Ipolex l (Sub P Q) = Ipolex l P - Ipolex l Q"
haftmann@22742
    42
  | "Ipolex l (Mul P Q) = Ipolex l P * Ipolex l Q"
haftmann@22742
    43
  | "Ipolex l (Pow p n) = Ipolex l p ^ n"
haftmann@22742
    44
  | "Ipolex l (Neg P) = - Ipolex l P"
wenzelm@17516
    45
wenzelm@17516
    46
text {* Create polynomial normalized polynomials given normalized inputs. *}
wenzelm@17516
    47
wenzelm@19736
    48
definition
wenzelm@21404
    49
  mkPinj :: "nat \<Rightarrow> 'a pol \<Rightarrow> 'a pol" where
wenzelm@19736
    50
  "mkPinj x P = (case P of
wenzelm@17516
    51
    Pc c \<Rightarrow> Pc c |
wenzelm@17516
    52
    Pinj y P \<Rightarrow> Pinj (x + y) P |
wenzelm@17516
    53
    PX p1 y p2 \<Rightarrow> Pinj x P)"
wenzelm@17516
    54
wenzelm@19736
    55
definition
haftmann@31021
    56
  mkPX :: "'a::{comm_ring} pol \<Rightarrow> nat \<Rightarrow> 'a pol \<Rightarrow> 'a pol" where
wenzelm@19736
    57
  "mkPX P i Q = (case P of
wenzelm@17516
    58
    Pc c \<Rightarrow> (if (c = 0) then (mkPinj 1 Q) else (PX P i Q)) |
wenzelm@17516
    59
    Pinj j R \<Rightarrow> PX P i Q |
wenzelm@17516
    60
    PX P2 i2 Q2 \<Rightarrow> (if (Q2 = (Pc 0)) then (PX P2 (i+i2) Q) else (PX P i Q)) )"
wenzelm@17516
    61
wenzelm@17516
    62
text {* Defining the basic ring operations on normalized polynomials *}
wenzelm@17516
    63
haftmann@22742
    64
function
haftmann@31021
    65
  add :: "'a::{comm_ring} pol \<Rightarrow> 'a pol \<Rightarrow> 'a pol" (infixl "\<oplus>" 65)
haftmann@22742
    66
where
haftmann@22742
    67
    "Pc a \<oplus> Pc b = Pc (a + b)"
haftmann@22742
    68
  | "Pc c \<oplus> Pinj i P = Pinj i (P \<oplus> Pc c)"
haftmann@22742
    69
  | "Pinj i P \<oplus> Pc c = Pinj i (P \<oplus> Pc c)"
haftmann@22742
    70
  | "Pc c \<oplus> PX P i Q = PX P i (Q \<oplus> Pc c)"
haftmann@22742
    71
  | "PX P i Q \<oplus> Pc c = PX P i (Q \<oplus> Pc c)"
haftmann@22742
    72
  | "Pinj x P \<oplus> Pinj y Q =
haftmann@22742
    73
      (if x = y then mkPinj x (P \<oplus> Q)
haftmann@22742
    74
       else (if x > y then mkPinj y (Pinj (x - y) P \<oplus> Q)
haftmann@22742
    75
         else mkPinj x (Pinj (y - x) Q \<oplus> P)))"
haftmann@22742
    76
  | "Pinj x P \<oplus> PX Q y R =
haftmann@22742
    77
      (if x = 0 then P \<oplus> PX Q y R
haftmann@22742
    78
       else (if x = 1 then PX Q y (R \<oplus> P)
haftmann@22742
    79
         else PX Q y (R \<oplus> Pinj (x - 1) P)))"
haftmann@22742
    80
  | "PX P x R \<oplus> Pinj y Q =
haftmann@22742
    81
      (if y = 0 then PX P x R \<oplus> Q
haftmann@22742
    82
       else (if y = 1 then PX P x (R \<oplus> Q)
haftmann@22742
    83
         else PX P x (R \<oplus> Pinj (y - 1) Q)))"
haftmann@22742
    84
  | "PX P1 x P2 \<oplus> PX Q1 y Q2 =
haftmann@22742
    85
      (if x = y then mkPX (P1 \<oplus> Q1) x (P2 \<oplus> Q2)
haftmann@22742
    86
       else (if x > y then mkPX (PX P1 (x - y) (Pc 0) \<oplus> Q1) y (P2 \<oplus> Q2)
haftmann@22742
    87
         else mkPX (PX Q1 (y-x) (Pc 0) \<oplus> P1) x (P2 \<oplus> Q2)))"
haftmann@22742
    88
by pat_completeness auto
haftmann@22742
    89
termination by (relation "measure (\<lambda>(x, y). size x + size y)") auto
wenzelm@17516
    90
haftmann@22742
    91
function
haftmann@31021
    92
  mul :: "'a::{comm_ring} pol \<Rightarrow> 'a pol \<Rightarrow> 'a pol" (infixl "\<otimes>" 70)
haftmann@22742
    93
where
haftmann@22742
    94
    "Pc a \<otimes> Pc b = Pc (a * b)"
haftmann@22742
    95
  | "Pc c \<otimes> Pinj i P =
haftmann@22742
    96
      (if c = 0 then Pc 0 else mkPinj i (P \<otimes> Pc c))"
haftmann@22742
    97
  | "Pinj i P \<otimes> Pc c =
haftmann@22742
    98
      (if c = 0 then Pc 0 else mkPinj i (P \<otimes> Pc c))"
haftmann@22742
    99
  | "Pc c \<otimes> PX P i Q =
haftmann@22742
   100
      (if c = 0 then Pc 0 else mkPX (P \<otimes> Pc c) i (Q \<otimes> Pc c))"
haftmann@22742
   101
  | "PX P i Q \<otimes> Pc c =
haftmann@22742
   102
      (if c = 0 then Pc 0 else mkPX (P \<otimes> Pc c) i (Q \<otimes> Pc c))"
haftmann@22742
   103
  | "Pinj x P \<otimes> Pinj y Q =
haftmann@22742
   104
      (if x = y then mkPinj x (P \<otimes> Q) else
haftmann@22742
   105
         (if x > y then mkPinj y (Pinj (x-y) P \<otimes> Q)
haftmann@22742
   106
           else mkPinj x (Pinj (y - x) Q \<otimes> P)))"
haftmann@22742
   107
  | "Pinj x P \<otimes> PX Q y R =
haftmann@22742
   108
      (if x = 0 then P \<otimes> PX Q y R else
haftmann@22742
   109
         (if x = 1 then mkPX (Pinj x P \<otimes> Q) y (R \<otimes> P)
haftmann@22742
   110
           else mkPX (Pinj x P \<otimes> Q) y (R \<otimes> Pinj (x - 1) P)))"
haftmann@22742
   111
  | "PX P x R \<otimes> Pinj y Q =
haftmann@22742
   112
      (if y = 0 then PX P x R \<otimes> Q else
haftmann@22742
   113
         (if y = 1 then mkPX (Pinj y Q \<otimes> P) x (R \<otimes> Q)
haftmann@22742
   114
           else mkPX (Pinj y Q \<otimes> P) x (R \<otimes> Pinj (y - 1) Q)))"
haftmann@22742
   115
  | "PX P1 x P2 \<otimes> PX Q1 y Q2 =
haftmann@22742
   116
      mkPX (P1 \<otimes> Q1) (x + y) (P2 \<otimes> Q2) \<oplus>
haftmann@22742
   117
        (mkPX (P1 \<otimes> mkPinj 1 Q2) x (Pc 0) \<oplus>
haftmann@22742
   118
          (mkPX (Q1 \<otimes> mkPinj 1 P2) y (Pc 0)))"
haftmann@22742
   119
by pat_completeness auto
haftmann@22742
   120
termination by (relation "measure (\<lambda>(x, y). size x + size y)")
haftmann@22742
   121
  (auto simp add: mkPinj_def split: pol.split)
wenzelm@17516
   122
wenzelm@17516
   123
text {* Negation*}
haftmann@31021
   124
primrec
haftmann@31021
   125
  neg :: "'a::{comm_ring} pol \<Rightarrow> 'a pol"
haftmann@22742
   126
where
haftmann@22742
   127
    "neg (Pc c) = Pc (-c)"
haftmann@22742
   128
  | "neg (Pinj i P) = Pinj i (neg P)"
haftmann@22742
   129
  | "neg (PX P x Q) = PX (neg P) x (neg Q)"
wenzelm@17516
   130
wenzelm@17516
   131
text {* Substraction *}
wenzelm@19736
   132
definition
haftmann@31021
   133
  sub :: "'a::{comm_ring} pol \<Rightarrow> 'a pol \<Rightarrow> 'a pol" (infixl "\<ominus>" 65)
haftmann@22742
   134
where
haftmann@22742
   135
  "sub P Q = P \<oplus> neg Q"
wenzelm@17516
   136
wenzelm@17516
   137
text {* Square for Fast Exponentation *}
haftmann@31021
   138
primrec
haftmann@31021
   139
  sqr :: "'a::{comm_ring_1} pol \<Rightarrow> 'a pol"
haftmann@22742
   140
where
haftmann@22742
   141
    "sqr (Pc c) = Pc (c * c)"
haftmann@22742
   142
  | "sqr (Pinj i P) = mkPinj i (sqr P)"
haftmann@22742
   143
  | "sqr (PX A x B) = mkPX (sqr A) (x + x) (sqr B) \<oplus>
haftmann@22742
   144
      mkPX (Pc (1 + 1) \<otimes> A \<otimes> mkPinj 1 B) x (Pc 0)"
wenzelm@17516
   145
wenzelm@17516
   146
text {* Fast Exponentation *}
haftmann@22742
   147
fun
haftmann@31021
   148
  pow :: "nat \<Rightarrow> 'a::{comm_ring_1} pol \<Rightarrow> 'a pol"
haftmann@22742
   149
where
haftmann@22742
   150
    "pow 0 P = Pc 1"
haftmann@22742
   151
  | "pow n P = (if even n then pow (n div 2) (sqr P)
haftmann@22742
   152
       else P \<otimes> pow (n div 2) (sqr P))"
haftmann@22742
   153
  
wenzelm@17516
   154
lemma pow_if:
haftmann@22742
   155
  "pow n P =
haftmann@22742
   156
   (if n = 0 then Pc 1 else if even n then pow (n div 2) (sqr P)
haftmann@22742
   157
    else P \<otimes> pow (n div 2) (sqr P))"
wenzelm@17516
   158
  by (cases n) simp_all
wenzelm@17516
   159
wenzelm@17516
   160
wenzelm@17516
   161
text {* Normalization of polynomial expressions *}
wenzelm@17516
   162
haftmann@31021
   163
primrec
haftmann@31021
   164
  norm :: "'a::{comm_ring_1} polex \<Rightarrow> 'a pol"
haftmann@22742
   165
where
haftmann@22742
   166
    "norm (Pol P) = P"
haftmann@22742
   167
  | "norm (Add P Q) = norm P \<oplus> norm Q"
haftmann@22742
   168
  | "norm (Sub P Q) = norm P \<ominus> norm Q"
haftmann@22742
   169
  | "norm (Mul P Q) = norm P \<otimes> norm Q"
haftmann@22742
   170
  | "norm (Pow P n) = pow n (norm P)"
haftmann@22742
   171
  | "norm (Neg P) = neg (norm P)"
wenzelm@17516
   172
wenzelm@17516
   173
text {* mkPinj preserve semantics *}
wenzelm@17516
   174
lemma mkPinj_ci: "Ipol l (mkPinj a B) = Ipol l (Pinj a B)"
nipkow@29667
   175
  by (induct B) (auto simp add: mkPinj_def algebra_simps)
wenzelm@17516
   176
wenzelm@17516
   177
text {* mkPX preserves semantics *}
wenzelm@17516
   178
lemma mkPX_ci: "Ipol l (mkPX A b C) = Ipol l (PX A b C)"
nipkow@29667
   179
  by (cases A) (auto simp add: mkPX_def mkPinj_ci power_add algebra_simps)
wenzelm@17516
   180
wenzelm@17516
   181
text {* Correctness theorems for the implemented operations *}
wenzelm@17516
   182
wenzelm@17516
   183
text {* Negation *}
wenzelm@20622
   184
lemma neg_ci: "Ipol l (neg P) = -(Ipol l P)"
wenzelm@20622
   185
  by (induct P arbitrary: l) auto
wenzelm@17516
   186
wenzelm@17516
   187
text {* Addition *}
haftmann@22742
   188
lemma add_ci: "Ipol l (P \<oplus> Q) = Ipol l P + Ipol l Q"
wenzelm@20622
   189
proof (induct P Q arbitrary: l rule: add.induct)
wenzelm@17516
   190
  case (6 x P y Q)
wenzelm@17516
   191
  show ?case
wenzelm@17516
   192
  proof (rule linorder_cases)
wenzelm@17516
   193
    assume "x < y"
nipkow@29667
   194
    with 6 show ?case by (simp add: mkPinj_ci algebra_simps)
wenzelm@17516
   195
  next
wenzelm@17516
   196
    assume "x = y"
wenzelm@17516
   197
    with 6 show ?case by (simp add: mkPinj_ci)
wenzelm@17516
   198
  next
wenzelm@17516
   199
    assume "x > y"
nipkow@29667
   200
    with 6 show ?case by (simp add: mkPinj_ci algebra_simps)
wenzelm@17516
   201
  qed
wenzelm@17516
   202
next
wenzelm@17516
   203
  case (7 x P Q y R)
wenzelm@17516
   204
  have "x = 0 \<or> x = 1 \<or> x > 1" by arith
wenzelm@17516
   205
  moreover
wenzelm@17516
   206
  { assume "x = 0" with 7 have ?case by simp }
wenzelm@17516
   207
  moreover
nipkow@29667
   208
  { assume "x = 1" with 7 have ?case by (simp add: algebra_simps) }
wenzelm@17516
   209
  moreover
wenzelm@17516
   210
  { assume "x > 1" from 7 have ?case by (cases x) simp_all }
wenzelm@17516
   211
  ultimately show ?case by blast
wenzelm@17516
   212
next
wenzelm@17516
   213
  case (8 P x R y Q)
wenzelm@17516
   214
  have "y = 0 \<or> y = 1 \<or> y > 1" by arith
wenzelm@17516
   215
  moreover
wenzelm@17516
   216
  { assume "y = 0" with 8 have ?case by simp }
wenzelm@17516
   217
  moreover
wenzelm@17516
   218
  { assume "y = 1" with 8 have ?case by simp }
wenzelm@17516
   219
  moreover
wenzelm@17516
   220
  { assume "y > 1" with 8 have ?case by simp }
wenzelm@17516
   221
  ultimately show ?case by blast
wenzelm@17516
   222
next
wenzelm@17516
   223
  case (9 P1 x P2 Q1 y Q2)
wenzelm@17516
   224
  show ?case
wenzelm@17516
   225
  proof (rule linorder_cases)
wenzelm@17516
   226
    assume a: "x < y" hence "EX d. d + x = y" by arith
nipkow@29667
   227
    with 9 a show ?case by (auto simp add: mkPX_ci power_add algebra_simps)
wenzelm@17516
   228
  next
wenzelm@17516
   229
    assume a: "y < x" hence "EX d. d + y = x" by arith
nipkow@29667
   230
    with 9 a show ?case by (auto simp add: power_add mkPX_ci algebra_simps)
wenzelm@17516
   231
  next
wenzelm@17516
   232
    assume "x = y"
nipkow@29667
   233
    with 9 show ?case by (simp add: mkPX_ci algebra_simps)
wenzelm@17516
   234
  qed
nipkow@29667
   235
qed (auto simp add: algebra_simps)
wenzelm@17516
   236
wenzelm@17516
   237
text {* Multiplication *}
haftmann@22742
   238
lemma mul_ci: "Ipol l (P \<otimes> Q) = Ipol l P * Ipol l Q"
wenzelm@20622
   239
  by (induct P Q arbitrary: l rule: mul.induct)
nipkow@29667
   240
    (simp_all add: mkPX_ci mkPinj_ci algebra_simps add_ci power_add)
wenzelm@17516
   241
wenzelm@17516
   242
text {* Substraction *}
haftmann@22742
   243
lemma sub_ci: "Ipol l (P \<ominus> Q) = Ipol l P - Ipol l Q"
wenzelm@17516
   244
  by (simp add: add_ci neg_ci sub_def)
wenzelm@17516
   245
wenzelm@17516
   246
text {* Square *}
haftmann@22742
   247
lemma sqr_ci: "Ipol ls (sqr P) = Ipol ls P * Ipol ls P"
haftmann@22742
   248
  by (induct P arbitrary: ls)
nipkow@29667
   249
    (simp_all add: add_ci mkPinj_ci mkPX_ci mul_ci algebra_simps power_add)
wenzelm@17516
   250
wenzelm@17516
   251
text {* Power *}
haftmann@22742
   252
lemma even_pow:"even n \<Longrightarrow> pow n P = pow (n div 2) (sqr P)"
wenzelm@20622
   253
  by (induct n) simp_all
wenzelm@17516
   254
haftmann@22742
   255
lemma pow_ci: "Ipol ls (pow n P) = Ipol ls P ^ n"
haftmann@22742
   256
proof (induct n arbitrary: P rule: nat_less_induct)
wenzelm@17516
   257
  case (1 k)
wenzelm@17516
   258
  show ?case
wenzelm@17516
   259
  proof (cases k)
wenzelm@20622
   260
    case 0
wenzelm@20622
   261
    then show ?thesis by simp
wenzelm@20622
   262
  next
wenzelm@17516
   263
    case (Suc l)
wenzelm@17516
   264
    show ?thesis
wenzelm@17516
   265
    proof cases
wenzelm@20622
   266
      assume "even l"
wenzelm@20622
   267
      then have "Suc l div 2 = l div 2"
nipkow@40077
   268
        by (simp add: eval_nat_numeral even_nat_plus_one_div_two)
wenzelm@17516
   269
      moreover
wenzelm@17516
   270
      from Suc have "l < k" by simp
haftmann@22742
   271
      with 1 have "\<And>P. Ipol ls (pow l P) = Ipol ls P ^ l" by simp
wenzelm@17516
   272
      moreover
wenzelm@20622
   273
      note Suc `even l` even_nat_plus_one_div_two
wenzelm@17516
   274
      ultimately show ?thesis by (auto simp add: mul_ci power_Suc even_pow)
wenzelm@17516
   275
    next
wenzelm@20622
   276
      assume "odd l"
wenzelm@20622
   277
      {
wenzelm@20622
   278
        fix p
haftmann@22742
   279
        have "Ipol ls (sqr P) ^ (Suc l div 2) = Ipol ls P ^ Suc l"
wenzelm@20622
   280
        proof (cases l)
wenzelm@20622
   281
          case 0
wenzelm@20622
   282
          with `odd l` show ?thesis by simp
wenzelm@20622
   283
        next
wenzelm@20622
   284
          case (Suc w)
wenzelm@20622
   285
          with `odd l` have "even w" by simp
wenzelm@20678
   286
          have two_times: "2 * (w div 2) = w"
wenzelm@20678
   287
            by (simp only: numerals even_nat_div_two_times_two [OF `even w`])
haftmann@22742
   288
          have "Ipol ls P * Ipol ls P = Ipol ls P ^ Suc (Suc 0)"
wenzelm@20622
   289
            by (simp add: power_Suc)
wenzelm@32960
   290
          then have "Ipol ls P * Ipol ls P = Ipol ls P ^ 2"
wenzelm@32960
   291
            by (simp add: numerals)
wenzelm@20622
   292
          with Suc show ?thesis
huffman@30273
   293
            by (auto simp add: power_mult [symmetric, of _ 2 _] two_times mul_ci sqr_ci
huffman@30273
   294
                     simp del: power_Suc)
wenzelm@20622
   295
        qed
wenzelm@20622
   296
      } with 1 Suc `odd l` show ?thesis by simp
wenzelm@17516
   297
    qed
wenzelm@17516
   298
  qed
wenzelm@17516
   299
qed
wenzelm@17516
   300
wenzelm@17516
   301
text {* Normalization preserves semantics  *}
wenzelm@20622
   302
lemma norm_ci: "Ipolex l Pe = Ipol l (norm Pe)"
wenzelm@17516
   303
  by (induct Pe) (simp_all add: add_ci sub_ci mul_ci neg_ci pow_ci)
wenzelm@17516
   304
wenzelm@17516
   305
text {* Reflection lemma: Key to the (incomplete) decision procedure *}
wenzelm@17516
   306
lemma norm_eq:
wenzelm@20622
   307
  assumes "norm P1 = norm P2"
wenzelm@17516
   308
  shows "Ipolex l P1 = Ipolex l P2"
wenzelm@17516
   309
proof -
wenzelm@41807
   310
  from assms have "Ipol l (norm P1) = Ipol l (norm P2)" by simp
wenzelm@20622
   311
  then show ?thesis by (simp only: norm_ci)
wenzelm@17516
   312
qed
wenzelm@17516
   313
wenzelm@17516
   314
wenzelm@48891
   315
ML_file "commutative_ring_tac.ML"
wenzelm@47432
   316
wenzelm@47432
   317
method_setup comm_ring = {*
wenzelm@47432
   318
  Scan.succeed (SIMPLE_METHOD' o Commutative_Ring_Tac.tac)
wenzelm@47432
   319
*} "reflective decision procedure for equalities over commutative rings"
wenzelm@17516
   320
wenzelm@17516
   321
end