src/HOL/NumberTheory/Chinese.thy
author webertj
Wed Aug 30 03:19:08 2006 +0200 (2006-08-30)
changeset 20432 07ec57376051
parent 20272 0ca998e83447
child 21404 eb85850d3eb7
permissions -rw-r--r--
lin_arith_prover: splitting reverted because of performance loss
wenzelm@11049
     1
(*  Title:      HOL/NumberTheory/Chinese.thy
paulson@9508
     2
    ID:         $Id$
wenzelm@11049
     3
    Author:     Thomas M. Rasmussen
wenzelm@11049
     4
    Copyright   2000  University of Cambridge
paulson@9508
     5
*)
paulson@9508
     6
wenzelm@11049
     7
header {* The Chinese Remainder Theorem *}
wenzelm@11049
     8
haftmann@16417
     9
theory Chinese imports IntPrimes begin
wenzelm@11049
    10
wenzelm@11049
    11
text {*
wenzelm@11049
    12
  The Chinese Remainder Theorem for an arbitrary finite number of
wenzelm@11049
    13
  equations.  (The one-equation case is included in theory @{text
wenzelm@11049
    14
  IntPrimes}.  Uses functions for indexing.\footnote{Maybe @{term
wenzelm@11049
    15
  funprod} and @{term funsum} should be based on general @{term fold}
wenzelm@11049
    16
  on indices?}
wenzelm@11049
    17
*}
wenzelm@11049
    18
wenzelm@11049
    19
wenzelm@11049
    20
subsection {* Definitions *}
paulson@9508
    21
paulson@9508
    22
consts
wenzelm@11049
    23
  funprod :: "(nat => int) => nat => nat => int"
wenzelm@11049
    24
  funsum :: "(nat => int) => nat => nat => int"
paulson@9508
    25
paulson@9508
    26
primrec
wenzelm@11049
    27
  "funprod f i 0 = f i"
wenzelm@11049
    28
  "funprod f i (Suc n) = f (Suc (i + n)) * funprod f i n"
paulson@9508
    29
paulson@9508
    30
primrec
wenzelm@11049
    31
  "funsum f i 0 = f i"
wenzelm@11049
    32
  "funsum f i (Suc n) = f (Suc (i + n)) + funsum f i n"
paulson@9508
    33
wenzelm@19670
    34
definition
wenzelm@11049
    35
  m_cond :: "nat => (nat => int) => bool"
wenzelm@19670
    36
  "m_cond n mf =
wenzelm@19670
    37
    ((\<forall>i. i \<le> n --> 0 < mf i) \<and>
wenzelm@19670
    38
      (\<forall>i j. i \<le> n \<and> j \<le> n \<and> i \<noteq> j --> zgcd (mf i, mf j) = 1))"
wenzelm@19670
    39
wenzelm@11049
    40
  km_cond :: "nat => (nat => int) => (nat => int) => bool"
wenzelm@19670
    41
  "km_cond n kf mf = (\<forall>i. i \<le> n --> zgcd (kf i, mf i) = 1)"
wenzelm@19670
    42
wenzelm@11049
    43
  lincong_sol ::
wenzelm@11049
    44
    "nat => (nat => int) => (nat => int) => (nat => int) => int => bool"
wenzelm@19670
    45
  "lincong_sol n kf bf mf x = (\<forall>i. i \<le> n --> zcong (kf i * x) (bf i) (mf i))"
paulson@9508
    46
wenzelm@11049
    47
  mhf :: "(nat => int) => nat => nat => int"
wenzelm@19670
    48
  "mhf mf n i =
wenzelm@19670
    49
    (if i = 0 then funprod mf (Suc 0) (n - Suc 0)
wenzelm@19670
    50
     else if i = n then funprod mf 0 (n - Suc 0)
wenzelm@19670
    51
     else funprod mf 0 (i - Suc 0) * funprod mf (Suc i) (n - Suc 0 - i))"
wenzelm@19670
    52
wenzelm@11049
    53
  xilin_sol ::
wenzelm@11049
    54
    "nat => nat => (nat => int) => (nat => int) => (nat => int) => int"
wenzelm@19670
    55
  "xilin_sol i n kf bf mf =
wenzelm@19670
    56
    (if 0 < n \<and> i \<le> n \<and> m_cond n mf \<and> km_cond n kf mf then
wenzelm@19670
    57
        (SOME x. 0 \<le> x \<and> x < mf i \<and> zcong (kf i * mhf mf n i * x) (bf i) (mf i))
wenzelm@19670
    58
     else 0)"
wenzelm@11049
    59
wenzelm@19670
    60
  x_sol :: "nat => (nat => int) => (nat => int) => (nat => int) => int"
wenzelm@19670
    61
  "x_sol n kf bf mf = funsum (\<lambda>i. xilin_sol i n kf bf mf * mhf mf n i) 0 n"
wenzelm@11049
    62
wenzelm@11049
    63
wenzelm@11049
    64
text {* \medskip @{term funprod} and @{term funsum} *}
wenzelm@11049
    65
paulson@11868
    66
lemma funprod_pos: "(\<forall>i. i \<le> n --> 0 < mf i) ==> 0 < funprod mf 0 n"
wenzelm@11049
    67
  apply (induct n)
wenzelm@11049
    68
   apply auto
paulson@14353
    69
  apply (simp add: zero_less_mult_iff)
wenzelm@11049
    70
  done
wenzelm@11049
    71
wenzelm@11049
    72
lemma funprod_zgcd [rule_format (no_asm)]:
paulson@11868
    73
  "(\<forall>i. k \<le> i \<and> i \<le> k + l --> zgcd (mf i, mf m) = 1) -->
paulson@11868
    74
    zgcd (funprod mf k l, mf m) = 1"
wenzelm@11049
    75
  apply (induct l)
wenzelm@11049
    76
   apply simp_all
wenzelm@11049
    77
  apply (rule impI)+
wenzelm@11049
    78
  apply (subst zgcd_zmult_cancel)
wenzelm@11049
    79
  apply auto
wenzelm@11049
    80
  done
paulson@9508
    81
wenzelm@11049
    82
lemma funprod_zdvd [rule_format]:
wenzelm@11049
    83
    "k \<le> i --> i \<le> k + l --> mf i dvd funprod mf k l"
wenzelm@11049
    84
  apply (induct l)
wenzelm@11049
    85
   apply auto
nipkow@15197
    86
    apply (rule_tac [1] zdvd_zmult2)
nipkow@15197
    87
    apply (rule_tac [2] zdvd_zmult)
nipkow@15236
    88
    apply (subgoal_tac "i = Suc (k + l)")
wenzelm@11049
    89
    apply (simp_all (no_asm_simp))
wenzelm@11049
    90
  done
wenzelm@11049
    91
wenzelm@11049
    92
lemma funsum_mod:
wenzelm@11049
    93
    "funsum f k l mod m = funsum (\<lambda>i. (f i) mod m) k l mod m"
wenzelm@11049
    94
  apply (induct l)
wenzelm@11049
    95
   apply auto
wenzelm@11049
    96
  apply (rule trans)
wenzelm@11049
    97
   apply (rule zmod_zadd1_eq)
wenzelm@11049
    98
  apply simp
wenzelm@11049
    99
  apply (rule zmod_zadd_right_eq [symmetric])
wenzelm@11049
   100
  done
paulson@9508
   101
wenzelm@11049
   102
lemma funsum_zero [rule_format (no_asm)]:
paulson@11868
   103
    "(\<forall>i. k \<le> i \<and> i \<le> k + l --> f i = 0) --> (funsum f k l) = 0"
wenzelm@11049
   104
  apply (induct l)
wenzelm@11049
   105
   apply auto
wenzelm@11049
   106
  done
wenzelm@11049
   107
wenzelm@11049
   108
lemma funsum_oneelem [rule_format (no_asm)]:
wenzelm@11049
   109
  "k \<le> j --> j \<le> k + l -->
paulson@11868
   110
    (\<forall>i. k \<le> i \<and> i \<le> k + l \<and> i \<noteq> j --> f i = 0) -->
wenzelm@11049
   111
    funsum f k l = f j"
wenzelm@11049
   112
  apply (induct l)
wenzelm@11049
   113
   prefer 2
wenzelm@11049
   114
   apply clarify
wenzelm@11049
   115
   defer
wenzelm@11049
   116
   apply clarify
wenzelm@11049
   117
   apply (subgoal_tac "k = j")
wenzelm@11049
   118
    apply (simp_all (no_asm_simp))
nipkow@15236
   119
  apply (case_tac "Suc (k + l) = j")
nipkow@15236
   120
   apply (subgoal_tac "funsum f k l = 0")
wenzelm@11049
   121
    apply (rule_tac [2] funsum_zero)
nipkow@15236
   122
    apply (subgoal_tac [3] "f (Suc (k + l)) = 0")
nipkow@15236
   123
     apply (subgoal_tac [3] "j \<le> k + l")
wenzelm@11049
   124
      prefer 4
wenzelm@11049
   125
      apply arith
wenzelm@11049
   126
     apply auto
wenzelm@11049
   127
  done
wenzelm@11049
   128
wenzelm@11049
   129
wenzelm@11049
   130
subsection {* Chinese: uniqueness *}
paulson@9508
   131
wenzelm@13524
   132
lemma zcong_funprod_aux:
wenzelm@11049
   133
  "m_cond n mf ==> km_cond n kf mf
wenzelm@11049
   134
    ==> lincong_sol n kf bf mf x ==> lincong_sol n kf bf mf y
wenzelm@11049
   135
    ==> [x = y] (mod mf n)"
wenzelm@11049
   136
  apply (unfold m_cond_def km_cond_def lincong_sol_def)
wenzelm@11049
   137
  apply (rule iffD1)
wenzelm@11049
   138
   apply (rule_tac k = "kf n" in zcong_cancel2)
wenzelm@11049
   139
    apply (rule_tac [3] b = "bf n" in zcong_trans)
wenzelm@11049
   140
     prefer 4
wenzelm@11049
   141
     apply (subst zcong_sym)
wenzelm@11049
   142
     defer
wenzelm@11049
   143
     apply (rule order_less_imp_le)
wenzelm@11049
   144
     apply simp_all
wenzelm@11049
   145
  done
wenzelm@11049
   146
wenzelm@11049
   147
lemma zcong_funprod [rule_format]:
wenzelm@11049
   148
  "m_cond n mf --> km_cond n kf mf -->
wenzelm@11049
   149
    lincong_sol n kf bf mf x --> lincong_sol n kf bf mf y -->
wenzelm@11049
   150
    [x = y] (mod funprod mf 0 n)"
wenzelm@11049
   151
  apply (induct n)
wenzelm@11049
   152
   apply (simp_all (no_asm))
wenzelm@13524
   153
   apply (blast intro: zcong_funprod_aux)
wenzelm@11049
   154
  apply (rule impI)+
wenzelm@11049
   155
  apply (rule zcong_zgcd_zmult_zmod)
wenzelm@13524
   156
    apply (blast intro: zcong_funprod_aux)
wenzelm@11049
   157
    prefer 2
wenzelm@11049
   158
    apply (subst zgcd_commute)
wenzelm@11049
   159
    apply (rule funprod_zgcd)
wenzelm@11049
   160
   apply (auto simp add: m_cond_def km_cond_def lincong_sol_def)
wenzelm@11049
   161
  done
wenzelm@11049
   162
wenzelm@11049
   163
wenzelm@11049
   164
subsection {* Chinese: existence *}
wenzelm@11049
   165
wenzelm@11049
   166
lemma unique_xi_sol:
wenzelm@11049
   167
  "0 < n ==> i \<le> n ==> m_cond n mf ==> km_cond n kf mf
paulson@11868
   168
    ==> \<exists>!x. 0 \<le> x \<and> x < mf i \<and> [kf i * mhf mf n i * x = bf i] (mod mf i)"
wenzelm@11049
   169
  apply (rule zcong_lineq_unique)
wenzelm@11049
   170
   apply (tactic {* stac (thm "zgcd_zmult_cancel") 2 *})
wenzelm@11049
   171
    apply (unfold m_cond_def km_cond_def mhf_def)
wenzelm@11049
   172
    apply (simp_all (no_asm_simp))
wenzelm@11049
   173
  apply safe
wenzelm@11049
   174
    apply (tactic {* stac (thm "zgcd_zmult_cancel") 3 *})
wenzelm@11049
   175
     apply (rule_tac [!] funprod_zgcd)
wenzelm@11049
   176
     apply safe
wenzelm@11049
   177
     apply simp_all
webertj@20432
   178
   apply (subgoal_tac "i<n")
webertj@20432
   179
    prefer 2
webertj@20432
   180
    apply arith
webertj@20432
   181
   apply (case_tac [2] i)
webertj@20432
   182
    apply simp_all
wenzelm@11049
   183
  done
paulson@9508
   184
wenzelm@13524
   185
lemma x_sol_lin_aux:
wenzelm@11049
   186
    "0 < n ==> i \<le> n ==> j \<le> n ==> j \<noteq> i ==> mf j dvd mhf mf n i"
wenzelm@11049
   187
  apply (unfold mhf_def)
wenzelm@11049
   188
  apply (case_tac "i = 0")
wenzelm@11049
   189
   apply (case_tac [2] "i = n")
wenzelm@11049
   190
    apply (simp_all (no_asm_simp))
wenzelm@11049
   191
    apply (case_tac [3] "j < i")
wenzelm@11049
   192
     apply (rule_tac [3] zdvd_zmult2)
wenzelm@11049
   193
     apply (rule_tac [4] zdvd_zmult)
wenzelm@11049
   194
     apply (rule_tac [!] funprod_zdvd)
wenzelm@11049
   195
          apply arith+
wenzelm@11049
   196
  done
wenzelm@11049
   197
wenzelm@11049
   198
lemma x_sol_lin:
wenzelm@11049
   199
  "0 < n ==> i \<le> n
wenzelm@11049
   200
    ==> x_sol n kf bf mf mod mf i =
wenzelm@11049
   201
      xilin_sol i n kf bf mf * mhf mf n i mod mf i"
wenzelm@11049
   202
  apply (unfold x_sol_def)
wenzelm@11049
   203
  apply (subst funsum_mod)
wenzelm@11049
   204
  apply (subst funsum_oneelem)
wenzelm@11049
   205
     apply auto
wenzelm@11049
   206
  apply (subst zdvd_iff_zmod_eq_0 [symmetric])
wenzelm@11049
   207
  apply (rule zdvd_zmult)
wenzelm@13524
   208
  apply (rule x_sol_lin_aux)
wenzelm@11049
   209
  apply auto
wenzelm@11049
   210
  done
wenzelm@11049
   211
wenzelm@11049
   212
wenzelm@11049
   213
subsection {* Chinese *}
paulson@9508
   214
wenzelm@11049
   215
lemma chinese_remainder:
wenzelm@11049
   216
  "0 < n ==> m_cond n mf ==> km_cond n kf mf
paulson@11868
   217
    ==> \<exists>!x. 0 \<le> x \<and> x < funprod mf 0 n \<and> lincong_sol n kf bf mf x"
wenzelm@11049
   218
  apply safe
wenzelm@11049
   219
   apply (rule_tac [2] m = "funprod mf 0 n" in zcong_zless_imp_eq)
wenzelm@11049
   220
       apply (rule_tac [6] zcong_funprod)
wenzelm@11049
   221
          apply auto
wenzelm@11049
   222
  apply (rule_tac x = "x_sol n kf bf mf mod funprod mf 0 n" in exI)
wenzelm@11049
   223
  apply (unfold lincong_sol_def)
wenzelm@11049
   224
  apply safe
wenzelm@11049
   225
    apply (tactic {* stac (thm "zcong_zmod") 3 *})
wenzelm@11049
   226
    apply (tactic {* stac (thm "zmod_zmult_distrib") 3 *})
wenzelm@11049
   227
    apply (tactic {* stac (thm "zmod_zdvd_zmod") 3 *})
wenzelm@11049
   228
      apply (tactic {* stac (thm "x_sol_lin") 5 *})
wenzelm@11049
   229
        apply (tactic {* stac (thm "zmod_zmult_distrib" RS sym) 7 *})
wenzelm@11049
   230
        apply (tactic {* stac (thm "zcong_zmod" RS sym) 7 *})
wenzelm@11049
   231
        apply (subgoal_tac [7]
paulson@11868
   232
          "0 \<le> xilin_sol i n kf bf mf \<and> xilin_sol i n kf bf mf < mf i
wenzelm@11049
   233
          \<and> [kf i * mhf mf n i * xilin_sol i n kf bf mf = bf i] (mod mf i)")
wenzelm@11049
   234
         prefer 7
wenzelm@11049
   235
         apply (simp add: zmult_ac)
wenzelm@11049
   236
        apply (unfold xilin_sol_def)
wenzelm@11049
   237
        apply (tactic {* Asm_simp_tac 7 *})
wenzelm@11049
   238
        apply (rule_tac [7] ex1_implies_ex [THEN someI_ex])
wenzelm@11049
   239
        apply (rule_tac [7] unique_xi_sol)
wenzelm@11049
   240
           apply (rule_tac [4] funprod_zdvd)
wenzelm@11049
   241
            apply (unfold m_cond_def)
wenzelm@11049
   242
            apply (rule funprod_pos [THEN pos_mod_sign])
wenzelm@11049
   243
            apply (rule_tac [2] funprod_pos [THEN pos_mod_bound])
wenzelm@11049
   244
            apply auto
wenzelm@11049
   245
  done
paulson@9508
   246
paulson@9508
   247
end