src/HOL/GCD.thy
author haftmann
Wed, 08 Jul 2015 14:01:41 +0200
changeset 60688 01488b559910
parent 60687 33dbbcb6a8a3
child 60689 8a2d7c04d8c0
permissions -rw-r--r--
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
32479
521cc9bf2958 some reorganization of number theory
haftmann
parents: 32415
diff changeset
     1
(*  Authors:    Christophe Tabacznyj, Lawrence C. Paulson, Amine Chaieb,
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
     2
                Thomas M. Rasmussen, Jeremy Avigad, Tobias Nipkow
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
     3
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
     4
32479
521cc9bf2958 some reorganization of number theory
haftmann
parents: 32415
diff changeset
     5
This file deals with the functions gcd and lcm.  Definitions and
521cc9bf2958 some reorganization of number theory
haftmann
parents: 32415
diff changeset
     6
lemmas are proved uniformly for the natural numbers and integers.
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
     7
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
     8
This file combines and revises a number of prior developments.
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
     9
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    10
The original theories "GCD" and "Primes" were by Christophe Tabacznyj
58623
2db1df2c8467 more bibtex entries;
wenzelm
parents: 57514
diff changeset
    11
and Lawrence C. Paulson, based on @{cite davenport92}. They introduced
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    12
gcd, lcm, and prime for the natural numbers.
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    13
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    14
The original theory "IntPrimes" was by Thomas M. Rasmussen, and
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    15
extended gcd, lcm, primes to the integers. Amine Chaieb provided
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    16
another extension of the notions to the integers, and added a number
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    17
of results to "Primes" and "GCD". IntPrimes also defined and developed
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    18
the congruence relations on the integers. The notion was extended to
34915
7894c7dab132 Adapted to changes in induct method.
berghofe
parents: 34223
diff changeset
    19
the natural numbers by Chaieb.
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    20
32036
8a9228872fbd Moved factorial lemmas from Binomial.thy to Fact.thy and merged.
avigad
parents: 31952
diff changeset
    21
Jeremy Avigad combined all of these, made everything uniform for the
8a9228872fbd Moved factorial lemmas from Binomial.thy to Fact.thy and merged.
avigad
parents: 31952
diff changeset
    22
natural numbers and the integers, and added a number of new theorems.
8a9228872fbd Moved factorial lemmas from Binomial.thy to Fact.thy and merged.
avigad
parents: 31952
diff changeset
    23
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
    24
Tobias Nipkow cleaned up a lot.
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
    25
*)
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
    26
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    27
58889
5b7a9633cfa8 modernized header uniformly as section;
wenzelm
parents: 58834
diff changeset
    28
section {* Greatest common divisor and least common multiple *}
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
    29
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
    30
theory GCD
59667
651ea265d568 Removal of the file HOL/Number_Theory/Binomial!! And class field_char_0 now declared in Int.thy
paulson <lp15@cam.ac.uk>
parents: 59545
diff changeset
    31
imports Main
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    32
begin
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    33
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    34
context semidom_divide
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    35
begin
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    36
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    37
lemma divide_1 [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    38
  "a div 1 = a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    39
  using nonzero_mult_divide_cancel_left [of 1 a] by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    40
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    41
lemma dvd_mult_cancel_left [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    42
  assumes "a \<noteq> 0"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    43
  shows "a * b dvd a * c \<longleftrightarrow> b dvd c" (is "?P \<longleftrightarrow> ?Q")
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    44
proof
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    45
  assume ?P then obtain d where "a * c = a * b * d" ..
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    46
  with assms have "c = b * d" by (simp add: ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    47
  then show ?Q ..
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    48
next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    49
  assume ?Q then obtain d where "c = b * d" .. 
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    50
  then have "a * c = a * b * d" by (simp add: ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    51
  then show ?P ..
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    52
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    53
  
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    54
lemma dvd_mult_cancel_right [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    55
  assumes "a \<noteq> 0"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    56
  shows "b * a dvd c * a \<longleftrightarrow> b dvd c" (is "?P \<longleftrightarrow> ?Q")
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    57
using dvd_mult_cancel_left [of a b c] assms by (simp add: ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    58
  
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    59
lemma div_dvd_iff_mult:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    60
  assumes "b \<noteq> 0" and "b dvd a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    61
  shows "a div b dvd c \<longleftrightarrow> a dvd c * b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    62
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    63
  from \<open>b dvd a\<close> obtain d where "a = b * d" ..
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    64
  with \<open>b \<noteq> 0\<close> show ?thesis by (simp add: ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    65
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    66
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    67
lemma dvd_div_iff_mult:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    68
  assumes "c \<noteq> 0" and "c dvd b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    69
  shows "a dvd b div c \<longleftrightarrow> a * c dvd b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    70
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    71
  from \<open>c dvd b\<close> obtain d where "b = c * d" ..
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    72
  with \<open>c \<noteq> 0\<close> show ?thesis by (simp add: mult.commute [of a])
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    73
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    74
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    75
end
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    76
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    77
declare One_nat_def [simp del]
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    78
34030
829eb528b226 resorted code equations from "old" number theory version
haftmann
parents: 33946
diff changeset
    79
subsection {* GCD and LCM definitions *}
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    80
31992
f8aed98faae7 More about gcd/lcm, and some cleaning up
nipkow
parents: 31952
diff changeset
    81
class gcd = zero + one + dvd +
41550
efa734d9b221 eliminated global prems;
wenzelm
parents: 37770
diff changeset
    82
  fixes gcd :: "'a \<Rightarrow> 'a \<Rightarrow> 'a"
efa734d9b221 eliminated global prems;
wenzelm
parents: 37770
diff changeset
    83
    and lcm :: "'a \<Rightarrow> 'a \<Rightarrow> 'a"
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
    84
begin
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
    85
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    86
abbreviation coprime :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    87
  where "coprime x y \<equiv> gcd x y = 1"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    88
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    89
end
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
    90
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    91
class Gcd = gcd +
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    92
  fixes Gcd :: "'a set \<Rightarrow> 'a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    93
    and Lcm :: "'a set \<Rightarrow> 'a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    94
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    95
class semiring_gcd = normalization_semidom + gcd +
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
    96
  assumes gcd_dvd1 [iff]: "gcd a b dvd a"
59977
ad2d1cd53877 eliminated hard tabs;
wenzelm
parents: 59807
diff changeset
    97
    and gcd_dvd2 [iff]: "gcd a b dvd b"
ad2d1cd53877 eliminated hard tabs;
wenzelm
parents: 59807
diff changeset
    98
    and gcd_greatest: "c dvd a \<Longrightarrow> c dvd b \<Longrightarrow> c dvd gcd a b"
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
    99
    and normalize_gcd [simp]: "normalize (gcd a b) = gcd a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   100
    and lcm_gcd: "lcm a b = normalize (a * b) div gcd a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   101
begin    
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   102
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   103
lemma gcd_greatest_iff [iff]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   104
  "a dvd gcd b c \<longleftrightarrow> a dvd b \<and> a dvd c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   105
  by (blast intro!: gcd_greatest intro: dvd_trans)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   106
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   107
lemma gcd_0_left [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   108
  "gcd 0 a = normalize a"
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   109
  by (rule associated_eqI) simp_all
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   110
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   111
lemma gcd_0_right [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   112
  "gcd a 0 = normalize a"
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   113
  by (rule associated_eqI) simp_all
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   114
  
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   115
lemma gcd_eq_0_iff [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   116
  "gcd a b = 0 \<longleftrightarrow> a = 0 \<and> b = 0" (is "?P \<longleftrightarrow> ?Q")
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   117
proof
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   118
  assume ?P then have "0 dvd gcd a b" by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   119
  then have "0 dvd a" and "0 dvd b" by (blast intro: dvd_trans)+
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   120
  then show ?Q by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   121
next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   122
  assume ?Q then show ?P by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   123
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   124
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   125
lemma unit_factor_gcd:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   126
  "unit_factor (gcd a b) = (if a = 0 \<and> b = 0 then 0 else 1)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   127
proof (cases "gcd a b = 0")
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   128
  case True then show ?thesis by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   129
next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   130
  case False
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   131
  have "unit_factor (gcd a b) * normalize (gcd a b) = gcd a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   132
    by (rule unit_factor_mult_normalize)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   133
  then have "unit_factor (gcd a b) * gcd a b = gcd a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   134
    by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   135
  then have "unit_factor (gcd a b) * gcd a b div gcd a b = gcd a b div gcd a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   136
    by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   137
  with False show ?thesis by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   138
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   139
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   140
sublocale gcd!: abel_semigroup gcd
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   141
proof
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   142
  fix a b c
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   143
  show "gcd a b = gcd b a"
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   144
    by (rule associated_eqI) simp_all
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   145
  from gcd_dvd1 have "gcd (gcd a b) c dvd a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   146
    by (rule dvd_trans) simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   147
  moreover from gcd_dvd1 have "gcd (gcd a b) c dvd b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   148
    by (rule dvd_trans) simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   149
  ultimately have P1: "gcd (gcd a b) c dvd gcd a (gcd b c)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   150
    by (auto intro!: gcd_greatest)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   151
  from gcd_dvd2 have "gcd a (gcd b c) dvd b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   152
    by (rule dvd_trans) simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   153
  moreover from gcd_dvd2 have "gcd a (gcd b c) dvd c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   154
    by (rule dvd_trans) simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   155
  ultimately have P2: "gcd a (gcd b c) dvd gcd (gcd a b) c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   156
    by (auto intro!: gcd_greatest)
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   157
  from P1 P2 show "gcd (gcd a b) c = gcd a (gcd b c)"
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   158
    by (rule associated_eqI) simp_all
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   159
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   160
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   161
lemma gcd_self [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   162
  "gcd a a = normalize a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   163
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   164
  have "a dvd gcd a a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   165
    by (rule gcd_greatest) simp_all
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   166
  then show ?thesis
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   167
    by (auto intro: associated_eqI)
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   168
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   169
    
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   170
lemma coprime_1_left [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   171
  "coprime 1 a"
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   172
  by (rule associated_eqI) simp_all
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   173
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   174
lemma coprime_1_right [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   175
  "coprime a 1"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   176
  using coprime_1_left [of a] by (simp add: ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   177
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   178
lemma gcd_mult_left:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   179
  "gcd (c * a) (c * b) = normalize c * gcd a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   180
proof (cases "c = 0")
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   181
  case True then show ?thesis by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   182
next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   183
  case False
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   184
  then have "c * gcd a b dvd gcd (c * a) (c * b)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   185
    by (auto intro: gcd_greatest)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   186
  moreover from calculation False have "gcd (c * a) (c * b) dvd c * gcd a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   187
    by (metis div_dvd_iff_mult dvd_mult_left gcd_dvd1 gcd_dvd2 gcd_greatest mult_commute)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   188
  ultimately have "normalize (gcd (c * a) (c * b)) = normalize (c * gcd a b)"
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   189
    by (auto intro: associated_eqI)
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   190
  then show ?thesis by (simp add: normalize_mult)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   191
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   192
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   193
lemma gcd_mult_right:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   194
  "gcd (a * c) (b * c) = gcd b a * normalize c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   195
  using gcd_mult_left [of c a b] by (simp add: ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   196
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   197
lemma mult_gcd_left:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   198
  "c * gcd a b = unit_factor c * gcd (c * a) (c * b)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   199
  by (simp add: gcd_mult_left mult.assoc [symmetric])
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   200
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   201
lemma mult_gcd_right:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   202
  "gcd a b * c = gcd (a * c) (b * c) * unit_factor c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   203
  using mult_gcd_left [of c a b] by (simp add: ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   204
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   205
lemma lcm_dvd1 [iff]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   206
  "a dvd lcm a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   207
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   208
  have "normalize (a * b) div gcd a b = normalize a * (normalize b div gcd a b)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   209
    by (simp add: lcm_gcd normalize_mult div_mult_swap)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   210
  then show ?thesis
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   211
    by (simp add: lcm_gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   212
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   213
  
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   214
lemma lcm_dvd2 [iff]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   215
  "b dvd lcm a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   216
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   217
  have "normalize (a * b) div gcd a b = normalize b * (normalize a div gcd a b)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   218
    by (simp add: lcm_gcd normalize_mult div_mult_swap ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   219
  then show ?thesis
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   220
    by (simp add: lcm_gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   221
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   222
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   223
lemma lcm_least:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   224
  assumes "a dvd c" and "b dvd c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   225
  shows "lcm a b dvd c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   226
proof (cases "c = 0")
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   227
  case True then show ?thesis by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   228
next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   229
  case False then have U: "is_unit (unit_factor c)" by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   230
  show ?thesis
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   231
  proof (cases "gcd a b = 0")
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   232
    case True with assms show ?thesis by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   233
  next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   234
    case False then have "a \<noteq> 0 \<or> b \<noteq> 0" by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   235
    with \<open>c \<noteq> 0\<close> assms have "a * b dvd a * c" "a * b dvd c * b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   236
      by (simp_all add: mult_dvd_mono)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   237
    then have "normalize (a * b) dvd gcd (a * c) (b * c)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   238
      by (auto intro: gcd_greatest simp add: ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   239
    then have "normalize (a * b) dvd gcd (a * c) (b * c) * unit_factor c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   240
      using U by (simp add: dvd_mult_unit_iff)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   241
    then have "normalize (a * b) dvd gcd a b * c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   242
      by (simp add: mult_gcd_right [of a b c])
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   243
    then have "normalize (a * b) div gcd a b dvd c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   244
      using False by (simp add: div_dvd_iff_mult ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   245
    then show ?thesis by (simp add: lcm_gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   246
  qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   247
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   248
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   249
lemma lcm_least_iff [iff]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   250
  "lcm a b dvd c \<longleftrightarrow> a dvd c \<and> b dvd c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   251
  by (blast intro!: lcm_least intro: dvd_trans)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   252
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   253
lemma normalize_lcm [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   254
  "normalize (lcm a b) = lcm a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   255
  by (simp add: lcm_gcd dvd_normalize_div)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   256
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   257
lemma lcm_0_left [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   258
  "lcm 0 a = 0"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   259
  by (simp add: lcm_gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   260
  
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   261
lemma lcm_0_right [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   262
  "lcm a 0 = 0"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   263
  by (simp add: lcm_gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   264
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   265
lemma lcm_eq_0_iff:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   266
  "lcm a b = 0 \<longleftrightarrow> a = 0 \<or> b = 0" (is "?P \<longleftrightarrow> ?Q")
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   267
proof
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   268
  assume ?P then have "0 dvd lcm a b" by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   269
  then have "0 dvd normalize (a * b) div gcd a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   270
    by (simp add: lcm_gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   271
  then have "0 * gcd a b dvd normalize (a * b)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   272
    using dvd_div_iff_mult [of "gcd a b" _ 0] by (cases "gcd a b = 0") simp_all
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   273
  then have "normalize (a * b) = 0"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   274
    by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   275
  then show ?Q by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   276
next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   277
  assume ?Q then show ?P by auto
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   278
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   279
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   280
lemma unit_factor_lcm :
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   281
  "unit_factor (lcm a b) = (if a = 0 \<or> b = 0 then 0 else 1)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   282
  by (simp add: unit_factor_gcd dvd_unit_factor_div lcm_gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   283
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   284
sublocale lcm!: abel_semigroup lcm
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   285
proof
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   286
  fix a b c
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   287
  show "lcm a b = lcm b a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   288
    by (simp add: lcm_gcd ac_simps normalize_mult dvd_normalize_div)
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   289
  have "lcm (lcm a b) c dvd lcm a (lcm b c)"
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   290
    and "lcm a (lcm b c) dvd lcm (lcm a b) c"
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   291
    by (auto intro: lcm_least
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   292
      dvd_trans [of b "lcm b c" "lcm a (lcm b c)"]
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   293
      dvd_trans [of c "lcm b c" "lcm a (lcm b c)"]
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   294
      dvd_trans [of a "lcm a b" "lcm (lcm a b) c"]
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   295
      dvd_trans [of b "lcm a b" "lcm (lcm a b) c"])
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   296
  then show "lcm (lcm a b) c = lcm a (lcm b c)"
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   297
    by (rule associated_eqI) simp_all
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   298
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   299
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   300
lemma lcm_self [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   301
  "lcm a a = normalize a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   302
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   303
  have "lcm a a dvd a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   304
    by (rule lcm_least) simp_all
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   305
  then show ?thesis
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   306
    by (auto intro: associated_eqI)
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   307
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   308
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   309
lemma gcd_mult_lcm [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   310
  "gcd a b * lcm a b = normalize a * normalize b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   311
  by (simp add: lcm_gcd normalize_mult)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   312
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   313
lemma lcm_mult_gcd [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   314
  "lcm a b * gcd a b = normalize a * normalize b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   315
  using gcd_mult_lcm [of a b] by (simp add: ac_simps) 
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   316
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   317
lemma gcd_lcm:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   318
  assumes "a \<noteq> 0" and "b \<noteq> 0"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   319
  shows "gcd a b = normalize (a * b) div lcm a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   320
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   321
  from assms have "lcm a b \<noteq> 0"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   322
    by (simp add: lcm_eq_0_iff)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   323
  have "gcd a b * lcm a b = normalize a * normalize b" by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   324
  then have "gcd a b * lcm a b div lcm a b = normalize (a * b) div lcm a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   325
    by (simp_all add: normalize_mult)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   326
  with \<open>lcm a b \<noteq> 0\<close> show ?thesis
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   327
    using nonzero_mult_divide_cancel_right [of "lcm a b" "gcd a b"] by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   328
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   329
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   330
lemma lcm_1_left [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   331
  "lcm 1 a = normalize a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   332
  by (simp add: lcm_gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   333
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   334
lemma lcm_1_right [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   335
  "lcm a 1 = normalize a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   336
  by (simp add: lcm_gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   337
  
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   338
lemma lcm_mult_left:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   339
  "lcm (c * a) (c * b) = normalize c * lcm a b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   340
  by (cases "c = 0")
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   341
    (simp_all add: gcd_mult_right lcm_gcd div_mult_swap normalize_mult ac_simps,
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   342
      simp add: dvd_div_mult2_eq mult.left_commute [of "normalize c", symmetric])
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   343
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   344
lemma lcm_mult_right:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   345
  "lcm (a * c) (b * c) = lcm b a * normalize c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   346
  using lcm_mult_left [of c a b] by (simp add: ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   347
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   348
lemma mult_lcm_left:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   349
  "c * lcm a b = unit_factor c * lcm (c * a) (c * b)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   350
  by (simp add: lcm_mult_left mult.assoc [symmetric])
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   351
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   352
lemma mult_lcm_right:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   353
  "lcm a b * c = lcm (a * c) (b * c) * unit_factor c"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   354
  using mult_lcm_left [of c a b] by (simp add: ac_simps)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   355
  
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   356
end
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   357
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   358
class semiring_Gcd = semiring_gcd + Gcd +
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   359
  assumes Gcd_dvd: "a \<in> A \<Longrightarrow> Gcd A dvd a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   360
    and Gcd_greatest: "(\<And>b. b \<in> A \<Longrightarrow> a dvd b) \<Longrightarrow> a dvd Gcd A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   361
    and normalize_Gcd [simp]: "normalize (Gcd A) = Gcd A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   362
begin
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   363
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   364
lemma Gcd_empty [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   365
  "Gcd {} = 0"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   366
  by (rule dvd_0_left, rule Gcd_greatest) simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   367
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   368
lemma Gcd_0_iff [simp]:
60687
33dbbcb6a8a3 eliminated some duplication
haftmann
parents: 60686
diff changeset
   369
  "Gcd A = 0 \<longleftrightarrow> A \<subseteq> {0}" (is "?P \<longleftrightarrow> ?Q")
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   370
proof
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   371
  assume ?P
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   372
  show ?Q
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   373
  proof
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   374
    fix a
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   375
    assume "a \<in> A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   376
    then have "Gcd A dvd a" by (rule Gcd_dvd)
60687
33dbbcb6a8a3 eliminated some duplication
haftmann
parents: 60686
diff changeset
   377
    with \<open>?P\<close> have "a = 0" by simp
33dbbcb6a8a3 eliminated some duplication
haftmann
parents: 60686
diff changeset
   378
    then show "a \<in> {0}" by simp
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   379
  qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   380
next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   381
  assume ?Q
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   382
  have "0 dvd Gcd A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   383
  proof (rule Gcd_greatest)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   384
    fix a
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   385
    assume "a \<in> A"
60687
33dbbcb6a8a3 eliminated some duplication
haftmann
parents: 60686
diff changeset
   386
    with \<open>?Q\<close> have "a = 0" by auto
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   387
    then show "0 dvd a" by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   388
  qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   389
  then show ?P by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   390
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   391
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   392
lemma unit_factor_Gcd:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   393
  "unit_factor (Gcd A) = (if \<forall>a\<in>A. a = 0 then 0 else 1)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   394
proof (cases "Gcd A = 0")
60687
33dbbcb6a8a3 eliminated some duplication
haftmann
parents: 60686
diff changeset
   395
  case True then show ?thesis by auto
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   396
next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   397
  case False
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   398
  from unit_factor_mult_normalize
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   399
  have "unit_factor (Gcd A) * normalize (Gcd A) = Gcd A" .
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   400
  then have "unit_factor (Gcd A) * Gcd A = Gcd A" by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   401
  then have "unit_factor (Gcd A) * Gcd A div Gcd A = Gcd A div Gcd A" by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   402
  with False have "unit_factor (Gcd A) = 1" by simp
60687
33dbbcb6a8a3 eliminated some duplication
haftmann
parents: 60686
diff changeset
   403
  with False show ?thesis by auto
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   404
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   405
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   406
lemma Gcd_UNIV [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   407
  "Gcd UNIV = 1"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   408
  by (rule associated_eqI) (auto intro: Gcd_dvd simp add: unit_factor_Gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   409
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   410
lemma Gcd_eq_1_I:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   411
  assumes "is_unit a" and "a \<in> A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   412
  shows "Gcd A = 1"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   413
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   414
  from assms have "is_unit (Gcd A)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   415
    by (blast intro: Gcd_dvd dvd_unit_imp_unit)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   416
  then have "normalize (Gcd A) = 1"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   417
    by (rule is_unit_normalize)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   418
  then show ?thesis
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   419
    by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   420
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   421
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   422
lemma Gcd_insert [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   423
  "Gcd (insert a A) = gcd a (Gcd A)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   424
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   425
  have "Gcd (insert a A) dvd gcd a (Gcd A)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   426
    by (auto intro: Gcd_dvd Gcd_greatest)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   427
  moreover have "gcd a (Gcd A) dvd Gcd (insert a A)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   428
  proof (rule Gcd_greatest)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   429
    fix b
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   430
    assume "b \<in> insert a A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   431
    then show "gcd a (Gcd A) dvd b"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   432
    proof
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   433
      assume "b = a" then show ?thesis by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   434
    next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   435
      assume "b \<in> A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   436
      then have "Gcd A dvd b" by (rule Gcd_dvd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   437
      moreover have "gcd a (Gcd A) dvd Gcd A" by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   438
      ultimately show ?thesis by (blast intro: dvd_trans)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   439
    qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   440
  qed
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   441
  ultimately show ?thesis
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   442
    by (auto intro: associated_eqI)
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   443
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   444
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   445
lemma dvd_Gcd: -- \<open>FIXME remove\<close>
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   446
  "\<forall>b\<in>A. a dvd b \<Longrightarrow> a dvd Gcd A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   447
  by (blast intro: Gcd_greatest)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   448
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   449
lemma Gcd_set [code_unfold]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   450
  "Gcd (set as) = foldr gcd as 0"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   451
  by (induct as) simp_all
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   452
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   453
end  
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   454
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   455
class semiring_Lcm = semiring_Gcd +
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   456
  assumes Lcm_Gcd: "Lcm A = Gcd {b. \<forall>a\<in>A. a dvd b}"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   457
begin
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   458
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   459
lemma dvd_Lcm:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   460
  assumes "a \<in> A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   461
  shows "a dvd Lcm A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   462
  using assms by (auto intro: Gcd_greatest simp add: Lcm_Gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   463
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   464
lemma Gcd_image_normalize [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   465
  "Gcd (normalize ` A) = Gcd A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   466
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   467
  have "Gcd (normalize ` A) dvd a" if "a \<in> A" for a
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   468
  proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   469
    from that obtain B where "A = insert a B" by blast
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   470
    moreover have " gcd (normalize a) (Gcd (normalize ` B)) dvd normalize a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   471
      by (rule gcd_dvd1)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   472
    ultimately show "Gcd (normalize ` A) dvd a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   473
      by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   474
  qed
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   475
  then have "Gcd (normalize ` A) dvd Gcd A" and "Gcd A dvd Gcd (normalize ` A)"
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   476
    by (auto intro!: Gcd_greatest intro: Gcd_dvd)
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   477
  then show ?thesis
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   478
    by (auto intro: associated_eqI)
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   479
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   480
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   481
lemma Lcm_least:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   482
  assumes "\<And>b. b \<in> A \<Longrightarrow> b dvd a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   483
  shows "Lcm A dvd a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   484
  using assms by (auto intro: Gcd_dvd simp add: Lcm_Gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   485
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   486
lemma normalize_Lcm [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   487
  "normalize (Lcm A) = Lcm A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   488
  by (simp add: Lcm_Gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   489
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   490
lemma unit_factor_Lcm:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   491
  "unit_factor (Lcm A) = (if Lcm A = 0 then 0 else 1)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   492
proof (cases "Lcm A = 0")
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   493
  case True then show ?thesis by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   494
next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   495
  case False
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   496
  with unit_factor_normalize have "unit_factor (normalize (Lcm A)) = 1"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   497
    by blast
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   498
  with False show ?thesis
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   499
    by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   500
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   501
  
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   502
lemma Lcm_empty [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   503
  "Lcm {} = 1"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   504
  by (simp add: Lcm_Gcd)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   505
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   506
lemma Lcm_1_iff [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   507
  "Lcm A = 1 \<longleftrightarrow> (\<forall>a\<in>A. is_unit a)" (is "?P \<longleftrightarrow> ?Q")
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   508
proof
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   509
  assume ?P
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   510
  show ?Q
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   511
  proof
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   512
    fix a
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   513
    assume "a \<in> A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   514
    then have "a dvd Lcm A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   515
      by (rule dvd_Lcm)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   516
    with \<open>?P\<close> show "is_unit a"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   517
      by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   518
  qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   519
next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   520
  assume ?Q
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   521
  then have "is_unit (Lcm A)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   522
    by (blast intro: Lcm_least)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   523
  then have "normalize (Lcm A) = 1"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   524
    by (rule is_unit_normalize)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   525
  then show ?P
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   526
    by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   527
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   528
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   529
lemma Lcm_UNIV [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   530
  "Lcm UNIV = 0"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   531
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   532
  have "0 dvd Lcm UNIV"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   533
    by (rule dvd_Lcm) simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   534
  then show ?thesis
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   535
    by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   536
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   537
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   538
lemma Lcm_eq_0_I:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   539
  assumes "0 \<in> A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   540
  shows "Lcm A = 0"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   541
proof -
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   542
  from assms have "0 dvd Lcm A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   543
    by (rule dvd_Lcm)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   544
  then show ?thesis
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   545
    by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   546
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   547
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   548
lemma Gcd_Lcm:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   549
  "Gcd A = Lcm {b. \<forall>a\<in>A. b dvd a}"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   550
  by (rule associated_eqI) (auto intro: associatedI Gcd_dvd dvd_Lcm Gcd_greatest Lcm_least
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   551
    simp add: unit_factor_Gcd unit_factor_Lcm)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   552
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   553
lemma Lcm_insert [simp]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   554
  "Lcm (insert a A) = lcm a (Lcm A)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   555
proof (rule sym)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   556
  have "lcm a (Lcm A) dvd Lcm (insert a A)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   557
    by (auto intro: dvd_Lcm Lcm_least)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   558
  moreover have "Lcm (insert a A) dvd lcm a (Lcm A)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   559
  proof (rule Lcm_least)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   560
    fix b
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   561
    assume "b \<in> insert a A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   562
    then show "b dvd lcm a (Lcm A)"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   563
    proof
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   564
      assume "b = a" then show ?thesis by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   565
    next
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   566
      assume "b \<in> A"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   567
      then have "b dvd Lcm A" by (rule dvd_Lcm)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   568
      moreover have "Lcm A dvd lcm a (Lcm A)" by simp
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   569
      ultimately show ?thesis by (blast intro: dvd_trans)
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   570
    qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   571
  qed
60688
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   572
  ultimately show "lcm a (Lcm A) = Lcm (insert a A)"
01488b559910 avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents: 60687
diff changeset
   573
    by (rule associated_eqI) (simp_all add: lcm_eq_0_iff)
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   574
qed
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   575
  
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   576
lemma Lcm_set [code_unfold]:
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   577
  "Lcm (set as) = foldr lcm as 1"
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   578
  by (induct as) simp_all
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   579
  
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   580
end
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   581
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   582
class ring_gcd = comm_ring_1 + semiring_gcd
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   583
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   584
instantiation nat :: gcd
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   585
begin
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   586
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   587
fun
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   588
  gcd_nat  :: "nat \<Rightarrow> nat \<Rightarrow> nat"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   589
where
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   590
  "gcd_nat x y =
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   591
   (if y = 0 then x else gcd y (x mod y))"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   592
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   593
definition
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   594
  lcm_nat :: "nat \<Rightarrow> nat \<Rightarrow> nat"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   595
where
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   596
  "lcm_nat x y = x * y div (gcd x y)"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   597
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   598
instance proof qed
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   599
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   600
end
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   601
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   602
instantiation int :: gcd
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   603
begin
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   604
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   605
definition
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   606
  gcd_int  :: "int \<Rightarrow> int \<Rightarrow> int"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   607
where
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   608
  "gcd_int x y = int (gcd (nat (abs x)) (nat (abs y)))"
23687
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   609
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   610
definition
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   611
  lcm_int :: "int \<Rightarrow> int \<Rightarrow> int"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   612
where
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   613
  "lcm_int x y = int (lcm (nat (abs x)) (nat (abs y)))"
23687
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   614
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   615
instance proof qed
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   616
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   617
end
23687
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   618
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   619
34030
829eb528b226 resorted code equations from "old" number theory version
haftmann
parents: 33946
diff changeset
   620
subsection {* Transfer setup *}
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   621
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   622
lemma transfer_nat_int_gcd:
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   623
  "(x::int) >= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> gcd (nat x) (nat y) = nat (gcd x y)"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   624
  "(x::int) >= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> lcm (nat x) (nat y) = nat (lcm x y)"
32479
521cc9bf2958 some reorganization of number theory
haftmann
parents: 32415
diff changeset
   625
  unfolding gcd_int_def lcm_int_def
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   626
  by auto
23687
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   627
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   628
lemma transfer_nat_int_gcd_closures:
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   629
  "x >= (0::int) \<Longrightarrow> y >= 0 \<Longrightarrow> gcd x y >= 0"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   630
  "x >= (0::int) \<Longrightarrow> y >= 0 \<Longrightarrow> lcm x y >= 0"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   631
  by (auto simp add: gcd_int_def lcm_int_def)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   632
35644
d20cf282342e transfer: avoid camel case
haftmann
parents: 35368
diff changeset
   633
declare transfer_morphism_nat_int[transfer add return:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   634
    transfer_nat_int_gcd transfer_nat_int_gcd_closures]
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   635
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   636
lemma transfer_int_nat_gcd:
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   637
  "gcd (int x) (int y) = int (gcd x y)"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   638
  "lcm (int x) (int y) = int (lcm x y)"
32479
521cc9bf2958 some reorganization of number theory
haftmann
parents: 32415
diff changeset
   639
  by (unfold gcd_int_def lcm_int_def, auto)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   640
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   641
lemma transfer_int_nat_gcd_closures:
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   642
  "is_nat x \<Longrightarrow> is_nat y \<Longrightarrow> gcd x y >= 0"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   643
  "is_nat x \<Longrightarrow> is_nat y \<Longrightarrow> lcm x y >= 0"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   644
  by (auto simp add: gcd_int_def lcm_int_def)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   645
35644
d20cf282342e transfer: avoid camel case
haftmann
parents: 35368
diff changeset
   646
declare transfer_morphism_int_nat[transfer add return:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   647
    transfer_int_nat_gcd transfer_int_nat_gcd_closures]
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   648
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   649
34030
829eb528b226 resorted code equations from "old" number theory version
haftmann
parents: 33946
diff changeset
   650
subsection {* GCD properties *}
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   651
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   652
(* was gcd_induct *)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   653
lemma gcd_nat_induct:
23687
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   654
  fixes m n :: nat
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   655
  assumes "\<And>m. P m 0"
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   656
    and "\<And>m n. 0 < n \<Longrightarrow> P n (m mod n) \<Longrightarrow> P m n"
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   657
  shows "P m n"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   658
  apply (rule gcd_nat.induct)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   659
  apply (case_tac "y = 0")
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   660
  using assms apply simp_all
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   661
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   662
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   663
(* specific to int *)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   664
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   665
lemma gcd_neg1_int [simp]: "gcd (-x::int) y = gcd x y"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   666
  by (simp add: gcd_int_def)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   667
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   668
lemma gcd_neg2_int [simp]: "gcd (x::int) (-y) = gcd x y"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   669
  by (simp add: gcd_int_def)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   670
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54437
diff changeset
   671
lemma gcd_neg_numeral_1_int [simp]:
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54437
diff changeset
   672
  "gcd (- numeral n :: int) x = gcd (numeral n) x"
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54437
diff changeset
   673
  by (fact gcd_neg1_int)
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54437
diff changeset
   674
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54437
diff changeset
   675
lemma gcd_neg_numeral_2_int [simp]:
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54437
diff changeset
   676
  "gcd x (- numeral n :: int) = gcd x (numeral n)"
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54437
diff changeset
   677
  by (fact gcd_neg2_int)
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54437
diff changeset
   678
31813
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   679
lemma abs_gcd_int[simp]: "abs(gcd (x::int) y) = gcd x y"
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   680
by(simp add: gcd_int_def)
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   681
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   682
lemma gcd_abs_int: "gcd (x::int) y = gcd (abs x) (abs y)"
31813
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   683
by (simp add: gcd_int_def)
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   684
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   685
lemma gcd_abs1_int[simp]: "gcd (abs x) (y::int) = gcd x y"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   686
by (metis abs_idempotent gcd_abs_int)
31813
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   687
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   688
lemma gcd_abs2_int[simp]: "gcd x (abs y::int) = gcd x y"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   689
by (metis abs_idempotent gcd_abs_int)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   690
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   691
lemma gcd_cases_int:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   692
  fixes x :: int and y
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   693
  assumes "x >= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> P (gcd x y)"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   694
      and "x >= 0 \<Longrightarrow> y <= 0 \<Longrightarrow> P (gcd x (-y))"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   695
      and "x <= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> P (gcd (-x) y)"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   696
      and "x <= 0 \<Longrightarrow> y <= 0 \<Longrightarrow> P (gcd (-x) (-y))"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   697
  shows "P (gcd x y)"
35216
7641e8d831d2 get rid of many duplicate simp rule warnings
huffman
parents: 35028
diff changeset
   698
by (insert assms, auto, arith)
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   699
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   700
lemma gcd_ge_0_int [simp]: "gcd (x::int) y >= 0"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   701
  by (simp add: gcd_int_def)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   702
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   703
lemma lcm_neg1_int: "lcm (-x::int) y = lcm x y"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   704
  by (simp add: lcm_int_def)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   705
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   706
lemma lcm_neg2_int: "lcm (x::int) (-y) = lcm x y"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   707
  by (simp add: lcm_int_def)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   708
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   709
lemma lcm_abs_int: "lcm (x::int) y = lcm (abs x) (abs y)"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   710
  by (simp add: lcm_int_def)
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   711
31814
7c122634da81 lcm abs lemmas
nipkow
parents: 31813
diff changeset
   712
lemma abs_lcm_int [simp]: "abs (lcm i j::int) = lcm i j"
7c122634da81 lcm abs lemmas
nipkow
parents: 31813
diff changeset
   713
by(simp add:lcm_int_def)
7c122634da81 lcm abs lemmas
nipkow
parents: 31813
diff changeset
   714
7c122634da81 lcm abs lemmas
nipkow
parents: 31813
diff changeset
   715
lemma lcm_abs1_int[simp]: "lcm (abs x) (y::int) = lcm x y"
7c122634da81 lcm abs lemmas
nipkow
parents: 31813
diff changeset
   716
by (metis abs_idempotent lcm_int_def)
7c122634da81 lcm abs lemmas
nipkow
parents: 31813
diff changeset
   717
7c122634da81 lcm abs lemmas
nipkow
parents: 31813
diff changeset
   718
lemma lcm_abs2_int[simp]: "lcm x (abs y::int) = lcm x y"
7c122634da81 lcm abs lemmas
nipkow
parents: 31813
diff changeset
   719
by (metis abs_idempotent lcm_int_def)
7c122634da81 lcm abs lemmas
nipkow
parents: 31813
diff changeset
   720
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   721
lemma lcm_cases_int:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   722
  fixes x :: int and y
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   723
  assumes "x >= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> P (lcm x y)"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   724
      and "x >= 0 \<Longrightarrow> y <= 0 \<Longrightarrow> P (lcm x (-y))"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   725
      and "x <= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> P (lcm (-x) y)"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   726
      and "x <= 0 \<Longrightarrow> y <= 0 \<Longrightarrow> P (lcm (-x) (-y))"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   727
  shows "P (lcm x y)"
41550
efa734d9b221 eliminated global prems;
wenzelm
parents: 37770
diff changeset
   728
  using assms by (auto simp add: lcm_neg1_int lcm_neg2_int) arith
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   729
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   730
lemma lcm_ge_0_int [simp]: "lcm (x::int) y >= 0"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   731
  by (simp add: lcm_int_def)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   732
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   733
(* was gcd_0, etc. *)
54867
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   734
lemma gcd_0_nat: "gcd (x::nat) 0 = x"
23687
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   735
  by simp
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   736
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   737
(* was igcd_0, etc. *)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   738
lemma gcd_0_int [simp]: "gcd (x::int) 0 = abs x"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   739
  by (unfold gcd_int_def, auto)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   740
54867
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   741
lemma gcd_0_left_nat: "gcd 0 (x::nat) = x"
23687
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   742
  by simp
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
   743
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   744
lemma gcd_0_left_int [simp]: "gcd 0 (x::int) = abs x"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   745
  by (unfold gcd_int_def, auto)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   746
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   747
lemma gcd_red_nat: "gcd (x::nat) y = gcd y (x mod y)"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   748
  by (case_tac "y = 0", auto)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   749
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   750
(* weaker, but useful for the simplifier *)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   751
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   752
lemma gcd_non_0_nat: "y ~= (0::nat) \<Longrightarrow> gcd (x::nat) y = gcd y (x mod y)"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   753
  by simp
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   754
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   755
lemma gcd_1_nat [simp]: "gcd (m::nat) 1 = 1"
21263
wenzelm
parents: 21256
diff changeset
   756
  by simp
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   757
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   758
lemma gcd_Suc_0 [simp]: "gcd (m::nat) (Suc 0) = Suc 0"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   759
  by (simp add: One_nat_def)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   760
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   761
lemma gcd_1_int [simp]: "gcd (m::int) 1 = 1"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   762
  by (simp add: gcd_int_def)
30082
43c5b7bfc791 make more proofs work whether or not One_nat_def is a simp rule
huffman
parents: 30042
diff changeset
   763
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   764
lemma gcd_idem_nat: "gcd (x::nat) x = x"
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
   765
by simp
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   766
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   767
lemma gcd_idem_int: "gcd (x::int) x = abs x"
31813
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   768
by (auto simp add: gcd_int_def)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   769
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   770
declare gcd_nat.simps [simp del]
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   771
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   772
text {*
27556
292098f2efdf unified curried gcd, lcm, zgcd, zlcm
haftmann
parents: 27487
diff changeset
   773
  \medskip @{term "gcd m n"} divides @{text m} and @{text n}.  The
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   774
  conjunctions don't seem provable separately.
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   775
*}
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   776
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   777
instance nat :: semiring_gcd
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   778
proof
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   779
  fix m n :: nat
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   780
  show "gcd m n dvd m" and "gcd m n dvd n"
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   781
  proof (induct m n rule: gcd_nat_induct)
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   782
    fix m n :: nat
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   783
    assume "gcd n (m mod n) dvd m mod n" and "gcd n (m mod n) dvd n"
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   784
    then have "gcd n (m mod n) dvd m"
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   785
      by (rule dvd_mod_imp_dvd)
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   786
    moreover assume "0 < n"
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   787
    ultimately show "gcd m n dvd m"
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   788
      by (simp add: gcd_non_0_nat)
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   789
  qed (simp_all add: gcd_0_nat gcd_non_0_nat)
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   790
next
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   791
  fix m n k :: nat
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   792
  assume "k dvd m" and "k dvd n"
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   793
  then show "k dvd gcd m n"
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   794
    by (induct m n rule: gcd_nat_induct) (simp_all add: gcd_non_0_nat dvd_mod gcd_0_nat)
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   795
qed (simp_all add: lcm_nat_def)
59667
651ea265d568 Removal of the file HOL/Number_Theory/Binomial!! And class field_char_0 now declared in Int.thy
paulson <lp15@cam.ac.uk>
parents: 59545
diff changeset
   796
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   797
instance int :: ring_gcd
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   798
  by standard
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   799
    (simp_all add: dvd_int_unfold_dvd_nat gcd_int_def lcm_int_def zdiv_int nat_abs_mult_distrib [symmetric] lcm_gcd gcd_greatest)
59667
651ea265d568 Removal of the file HOL/Number_Theory/Binomial!! And class field_char_0 now declared in Int.thy
paulson <lp15@cam.ac.uk>
parents: 59545
diff changeset
   800
31730
d74830dc3e4a added lemmas; tuned
nipkow
parents: 31729
diff changeset
   801
lemma dvd_gcd_D1_nat: "k dvd gcd m n \<Longrightarrow> (k::nat) dvd m"
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   802
  by (metis gcd_dvd1 dvd_trans)
31730
d74830dc3e4a added lemmas; tuned
nipkow
parents: 31729
diff changeset
   803
d74830dc3e4a added lemmas; tuned
nipkow
parents: 31729
diff changeset
   804
lemma dvd_gcd_D2_nat: "k dvd gcd m n \<Longrightarrow> (k::nat) dvd n"
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   805
  by (metis gcd_dvd2 dvd_trans)
31730
d74830dc3e4a added lemmas; tuned
nipkow
parents: 31729
diff changeset
   806
d74830dc3e4a added lemmas; tuned
nipkow
parents: 31729
diff changeset
   807
lemma dvd_gcd_D1_int: "i dvd gcd m n \<Longrightarrow> (i::int) dvd m"
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   808
  by (metis gcd_dvd1 dvd_trans)
31730
d74830dc3e4a added lemmas; tuned
nipkow
parents: 31729
diff changeset
   809
d74830dc3e4a added lemmas; tuned
nipkow
parents: 31729
diff changeset
   810
lemma dvd_gcd_D2_int: "i dvd gcd m n \<Longrightarrow> (i::int) dvd n"
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   811
  by (metis gcd_dvd2 dvd_trans)
31730
d74830dc3e4a added lemmas; tuned
nipkow
parents: 31729
diff changeset
   812
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   813
lemma gcd_le1_nat [simp]: "a \<noteq> 0 \<Longrightarrow> gcd (a::nat) b \<le> a"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   814
  by (rule dvd_imp_le, auto)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   815
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   816
lemma gcd_le2_nat [simp]: "b \<noteq> 0 \<Longrightarrow> gcd (a::nat) b \<le> b"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   817
  by (rule dvd_imp_le, auto)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   818
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   819
lemma gcd_le1_int [simp]: "a > 0 \<Longrightarrow> gcd (a::int) b \<le> a"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   820
  by (rule zdvd_imp_le, auto)
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   821
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   822
lemma gcd_le2_int [simp]: "b > 0 \<Longrightarrow> gcd (a::int) b \<le> b"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   823
  by (rule zdvd_imp_le, auto)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   824
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   825
lemma gcd_greatest_iff_nat [iff]: "(k dvd gcd (m::nat) n) =
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   826
    (k dvd m & k dvd n)"
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   827
  by (blast intro!: gcd_greatest intro: dvd_trans)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   828
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   829
lemma gcd_greatest_iff_int: "((k::int) dvd gcd m n) = (k dvd m & k dvd n)"
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   830
  by (blast intro!: gcd_greatest intro: dvd_trans)
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   831
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   832
lemma gcd_zero_nat [simp]: "(gcd (m::nat) n = 0) = (m = 0 & n = 0)"
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   833
  by (simp only: dvd_0_left_iff [symmetric] gcd_greatest_iff_nat)
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   834
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   835
lemma gcd_zero_int [simp]: "(gcd (m::int) n = 0) = (m = 0 & n = 0)"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   836
  by (auto simp add: gcd_int_def)
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   837
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   838
lemma gcd_pos_nat [simp]: "(gcd (m::nat) n > 0) = (m ~= 0 | n ~= 0)"
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   839
  by (insert gcd_zero_nat [of m n], arith)
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   840
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   841
lemma gcd_pos_int [simp]: "(gcd (m::int) n > 0) = (m ~= 0 | n ~= 0)"
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   842
  by (insert gcd_zero_int [of m n], insert gcd_ge_0_int [of m n], arith)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   843
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   844
lemma gcd_unique_nat: "(d::nat) dvd a \<and> d dvd b \<and>
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   845
    (\<forall>e. e dvd a \<and> e dvd b \<longrightarrow> e dvd d) \<longleftrightarrow> d = gcd a b"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   846
  apply auto
33657
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33318
diff changeset
   847
  apply (rule dvd_antisym)
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   848
  apply (erule (1) gcd_greatest)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   849
  apply auto
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   850
done
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   851
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   852
lemma gcd_unique_int: "d >= 0 & (d::int) dvd a \<and> d dvd b \<and>
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   853
    (\<forall>e. e dvd a \<and> e dvd b \<longrightarrow> e dvd d) \<longleftrightarrow> d = gcd a b"
33657
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33318
diff changeset
   854
apply (case_tac "d = 0")
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33318
diff changeset
   855
 apply simp
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33318
diff changeset
   856
apply (rule iffI)
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33318
diff changeset
   857
 apply (rule zdvd_antisym_nonneg)
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   858
 apply (auto intro: gcd_greatest)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   859
done
30082
43c5b7bfc791 make more proofs work whether or not One_nat_def is a simp rule
huffman
parents: 30042
diff changeset
   860
54867
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   861
interpretation gcd_nat: abel_semigroup "gcd :: nat \<Rightarrow> nat \<Rightarrow> nat"
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   862
  + gcd_nat: semilattice_neutr_order "gcd :: nat \<Rightarrow> nat \<Rightarrow> nat" 0 "op dvd" "(\<lambda>m n. m dvd n \<and> \<not> n dvd m)"
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   863
apply standard
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   864
apply (auto intro: dvd_antisym dvd_trans)[2]
59545
12a6088ed195 explicit equivalence for strict order on lattices
haftmann
parents: 59497
diff changeset
   865
apply (metis dvd.dual_order.refl gcd_unique_nat)+
54867
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   866
done
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   867
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   868
interpretation gcd_int: abel_semigroup "gcd :: int \<Rightarrow> int \<Rightarrow> int" ..
54867
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   869
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   870
lemmas gcd_assoc_nat = gcd.assoc [where ?'a = nat]
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   871
lemmas gcd_commute_nat = gcd.commute [where ?'a = nat]
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   872
lemmas gcd_left_commute_nat = gcd.left_commute [where ?'a = nat]
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   873
lemmas gcd_assoc_int = gcd.assoc [where ?'a = int]
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   874
lemmas gcd_commute_int = gcd.commute [where ?'a = int]
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
   875
lemmas gcd_left_commute_int = gcd.left_commute [where ?'a = int]
54867
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   876
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   877
lemmas gcd_ac_nat = gcd_assoc_nat gcd_commute_nat gcd_left_commute_nat
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   878
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   879
lemmas gcd_ac_int = gcd_assoc_int gcd_commute_int gcd_left_commute_int
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   880
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
   881
lemma gcd_proj1_if_dvd_nat [simp]: "(x::nat) dvd y \<Longrightarrow> gcd x y = x"
54867
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   882
  by (fact gcd_nat.absorb1)
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
   883
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
   884
lemma gcd_proj2_if_dvd_nat [simp]: "(y::nat) dvd x \<Longrightarrow> gcd x y = y"
54867
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   885
  by (fact gcd_nat.absorb2)
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
   886
54867
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   887
lemma gcd_proj1_if_dvd_int [simp]: "x dvd y \<Longrightarrow> gcd (x::int) y = abs x"
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   888
  by (metis abs_dvd_iff gcd_0_left_int gcd_abs_int gcd_unique_int)
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
   889
54867
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   890
lemma gcd_proj2_if_dvd_int [simp]: "y dvd x \<Longrightarrow> gcd (x::int) y = abs y"
c21a2465cac1 prefer ephemeral interpretation over interpretation in proof contexts;
haftmann
parents: 54489
diff changeset
   891
  by (metis gcd_proj1_if_dvd_int gcd_commute_int)
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
   892
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   893
text {*
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   894
  \medskip Multiplication laws
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   895
*}
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   896
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   897
lemma gcd_mult_distrib_nat: "(k::nat) * gcd m n = gcd (k * m) (k * n)"
58623
2db1df2c8467 more bibtex entries;
wenzelm
parents: 57514
diff changeset
   898
    -- {* @{cite \<open>page 27\<close> davenport92} *}
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   899
  apply (induct m n rule: gcd_nat_induct)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   900
  apply simp
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   901
  apply (case_tac "k = 0")
45270
d5b5c9259afd fix bug in cancel_factor simprocs so they will work on goals like 'x * y < x * z' where the common term is already on the left
huffman
parents: 45264
diff changeset
   902
  apply (simp_all add: gcd_non_0_nat)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   903
done
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   904
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   905
lemma gcd_mult_distrib_int: "abs (k::int) * gcd m n = gcd (k * m) (k * n)"
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   906
  apply (subst (1 2) gcd_abs_int)
31813
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   907
  apply (subst (1 2) abs_mult)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   908
  apply (rule gcd_mult_distrib_nat [transferred])
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   909
  apply auto
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   910
done
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   911
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   912
lemma coprime_dvd_mult_nat: "coprime (k::nat) n \<Longrightarrow> k dvd m * n \<Longrightarrow> k dvd m"
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   913
  apply (insert gcd_mult_distrib_nat [of m k n])
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   914
  apply simp
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   915
  apply (erule_tac t = m in ssubst)
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   916
  apply simp
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   917
  done
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   918
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   919
lemma coprime_dvd_mult_int:
31813
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   920
  "coprime (k::int) n \<Longrightarrow> k dvd m * n \<Longrightarrow> k dvd m"
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   921
apply (subst abs_dvd_iff [symmetric])
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   922
apply (subst dvd_abs_iff [symmetric])
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   923
apply (subst (asm) gcd_abs_int)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   924
apply (rule coprime_dvd_mult_nat [transferred])
31813
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   925
    prefer 4 apply assumption
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   926
   apply auto
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   927
apply (subst abs_mult [symmetric], auto)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   928
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   929
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   930
lemma coprime_dvd_mult_iff_nat: "coprime (k::nat) n \<Longrightarrow>
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   931
    (k dvd m * n) = (k dvd m)"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   932
  by (auto intro: coprime_dvd_mult_nat)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   933
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   934
lemma coprime_dvd_mult_iff_int: "coprime (k::int) n \<Longrightarrow>
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   935
    (k dvd m * n) = (k dvd m)"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   936
  by (auto intro: coprime_dvd_mult_int)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   937
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   938
lemma gcd_mult_cancel_nat: "coprime k n \<Longrightarrow> gcd ((k::nat) * m) n = gcd m n"
33657
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33318
diff changeset
   939
  apply (rule dvd_antisym)
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
   940
  apply (rule gcd_greatest)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   941
  apply (rule_tac n = k in coprime_dvd_mult_nat)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   942
  apply (simp add: gcd_assoc_nat)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   943
  apply (simp add: gcd_commute_nat)
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56218
diff changeset
   944
  apply (simp_all add: mult.commute)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   945
done
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   946
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   947
lemma gcd_mult_cancel_int:
31813
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   948
  "coprime (k::int) n \<Longrightarrow> gcd (k * m) n = gcd m n"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   949
apply (subst (1 2) gcd_abs_int)
31813
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
   950
apply (subst abs_mult)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   951
apply (rule gcd_mult_cancel_nat [transferred], auto)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   952
done
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   953
35368
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   954
lemma coprime_crossproduct_nat:
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   955
  fixes a b c d :: nat
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   956
  assumes "coprime a d" and "coprime b c"
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   957
  shows "a * c = b * d \<longleftrightarrow> a = b \<and> c = d" (is "?lhs \<longleftrightarrow> ?rhs")
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   958
proof
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   959
  assume ?rhs then show ?lhs by simp
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   960
next
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   961
  assume ?lhs
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   962
  from `?lhs` have "a dvd b * d" by (auto intro: dvdI dest: sym)
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   963
  with `coprime a d` have "a dvd b" by (simp add: coprime_dvd_mult_iff_nat)
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   964
  from `?lhs` have "b dvd a * c" by (auto intro: dvdI dest: sym)
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   965
  with `coprime b c` have "b dvd a" by (simp add: coprime_dvd_mult_iff_nat)
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56218
diff changeset
   966
  from `?lhs` have "c dvd d * b" by (auto intro: dvdI dest: sym simp add: mult.commute)
35368
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   967
  with `coprime b c` have "c dvd d" by (simp add: coprime_dvd_mult_iff_nat gcd_commute_nat)
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56218
diff changeset
   968
  from `?lhs` have "d dvd c * a" by (auto intro: dvdI dest: sym simp add: mult.commute)
35368
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   969
  with `coprime a d` have "d dvd c" by (simp add: coprime_dvd_mult_iff_nat gcd_commute_nat)
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   970
  from `a dvd b` `b dvd a` have "a = b" by (rule Nat.dvd.antisym)
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   971
  moreover from `c dvd d` `d dvd c` have "c = d" by (rule Nat.dvd.antisym)
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   972
  ultimately show ?rhs ..
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   973
qed
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   974
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   975
lemma coprime_crossproduct_int:
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   976
  fixes a b c d :: int
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   977
  assumes "coprime a d" and "coprime b c"
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   978
  shows "\<bar>a\<bar> * \<bar>c\<bar> = \<bar>b\<bar> * \<bar>d\<bar> \<longleftrightarrow> \<bar>a\<bar> = \<bar>b\<bar> \<and> \<bar>c\<bar> = \<bar>d\<bar>"
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   979
  using assms by (intro coprime_crossproduct_nat [transferred]) auto
19b340c3f1ff crossproduct coprimality lemmas
haftmann
parents: 35216
diff changeset
   980
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   981
text {* \medskip Addition laws *}
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
   982
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   983
lemma gcd_add1_nat [simp]: "gcd ((m::nat) + n) n = gcd m n"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   984
  apply (case_tac "n = 0")
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   985
  apply (simp_all add: gcd_non_0_nat)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   986
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   987
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   988
lemma gcd_add2_nat [simp]: "gcd (m::nat) (m + n) = gcd m n"
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   989
  apply (subst (1 2) gcd_commute_nat)
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56218
diff changeset
   990
  apply (subst add.commute)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   991
  apply simp
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   992
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   993
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   994
(* to do: add the other variations? *)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   995
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   996
lemma gcd_diff1_nat: "(m::nat) >= n \<Longrightarrow> gcd (m - n) n = gcd m n"
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   997
  by (subst gcd_add1_nat [symmetric], auto)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
   998
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
   999
lemma gcd_diff2_nat: "(n::nat) >= m \<Longrightarrow> gcd (n - m) n = gcd m n"
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1000
  apply (subst gcd_commute_nat)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1001
  apply (subst gcd_diff1_nat [symmetric])
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1002
  apply auto
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1003
  apply (subst gcd_commute_nat)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1004
  apply (subst gcd_diff1_nat)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1005
  apply assumption
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1006
  apply (rule gcd_commute_nat)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1007
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1008
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1009
lemma gcd_non_0_int: "(y::int) > 0 \<Longrightarrow> gcd x y = gcd y (x mod y)"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1010
  apply (frule_tac b = y and a = x in pos_mod_sign)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1011
  apply (simp del: pos_mod_sign add: gcd_int_def abs_if nat_mod_distrib)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1012
  apply (auto simp add: gcd_non_0_nat nat_mod_distrib [symmetric]
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1013
    zmod_zminus1_eq_if)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1014
  apply (frule_tac a = x in pos_mod_bound)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1015
  apply (subst (1 2) gcd_commute_nat)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1016
  apply (simp del: pos_mod_bound add: nat_diff_distrib gcd_diff2_nat
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1017
    nat_le_eq_zle)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1018
done
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
  1019
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1020
lemma gcd_red_int: "gcd (x::int) y = gcd y (x mod y)"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1021
  apply (case_tac "y = 0")
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1022
  apply force
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1023
  apply (case_tac "y > 0")
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1024
  apply (subst gcd_non_0_int, auto)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1025
  apply (insert gcd_non_0_int [of "-y" "-x"])
35216
7641e8d831d2 get rid of many duplicate simp rule warnings
huffman
parents: 35028
diff changeset
  1026
  apply auto
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1027
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1028
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1029
lemma gcd_add1_int [simp]: "gcd ((m::int) + n) n = gcd m n"
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56218
diff changeset
  1030
by (metis gcd_red_int mod_add_self1 add.commute)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1031
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1032
lemma gcd_add2_int [simp]: "gcd m ((m::int) + n) = gcd m n"
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56218
diff changeset
  1033
by (metis gcd_add1_int gcd_commute_int add.commute)
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
  1034
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1035
lemma gcd_add_mult_nat: "gcd (m::nat) (k * m + n) = gcd m n"
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1036
by (metis mod_mult_self3 gcd_commute_nat gcd_red_nat)
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
  1037
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1038
lemma gcd_add_mult_int: "gcd (m::int) (k * m + n) = gcd m n"
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56218
diff changeset
  1039
by (metis gcd_commute_int gcd_red_int mod_mult_self1 add.commute)
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
  1040
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents:
diff changeset
  1041
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1042
(* to do: differences, and all variations of addition rules
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1043
    as simplification rules for nat and int *)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1044
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
  1045
(* FIXME remove iff *)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1046
lemma gcd_dvd_prod_nat [iff]: "gcd (m::nat) n dvd k * n"
23687
06884f7ffb18 extended - convers now basic lcm properties also
haftmann
parents: 23431
diff changeset
  1047
  using mult_dvd_mono [of 1] by auto
22027
e4a08629c4bd A few lemmas about relative primes when dividing trough gcd
chaieb
parents: 21404
diff changeset
  1048
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1049
(* to do: add the three variations of these, and for ints? *)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1050
31992
f8aed98faae7 More about gcd/lcm, and some cleaning up
nipkow
parents: 31952
diff changeset
  1051
lemma finite_divisors_nat[simp]:
f8aed98faae7 More about gcd/lcm, and some cleaning up
nipkow
parents: 31952
diff changeset
  1052
  assumes "(m::nat) ~= 0" shows "finite{d. d dvd m}"
31734
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1053
proof-
60512
e0169291b31c tuned proofs -- slightly faster;
wenzelm
parents: 60357
diff changeset
  1054
  have "finite{d. d <= m}"
e0169291b31c tuned proofs -- slightly faster;
wenzelm
parents: 60357
diff changeset
  1055
    by (blast intro: bounded_nat_set_is_finite)
31734
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1056
  from finite_subset[OF _ this] show ?thesis using assms
60512
e0169291b31c tuned proofs -- slightly faster;
wenzelm
parents: 60357
diff changeset
  1057
    by (metis Collect_mono dvd_imp_le neq0_conv)
31734
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1058
qed
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1059
31995
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1060
lemma finite_divisors_int[simp]:
31734
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1061
  assumes "(i::int) ~= 0" shows "finite{d. d dvd i}"
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1062
proof-
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1063
  have "{d. abs d <= abs i} = {- abs i .. abs i}" by(auto simp:abs_if)
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1064
  hence "finite{d. abs d <= abs i}" by simp
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1065
  from finite_subset[OF _ this] show ?thesis using assms
60512
e0169291b31c tuned proofs -- slightly faster;
wenzelm
parents: 60357
diff changeset
  1066
    by (simp add: dvd_imp_le_int subset_iff)
31734
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1067
qed
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1068
31995
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1069
lemma Max_divisors_self_nat[simp]: "n\<noteq>0 \<Longrightarrow> Max{d::nat. d dvd n} = n"
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1070
apply(rule antisym)
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 44845
diff changeset
  1071
 apply (fastforce intro: Max_le_iff[THEN iffD2] simp: dvd_imp_le)
31995
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1072
apply simp
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1073
done
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1074
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1075
lemma Max_divisors_self_int[simp]: "n\<noteq>0 \<Longrightarrow> Max{d::int. d dvd n} = abs n"
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1076
apply(rule antisym)
44278
1220ecb81e8f observe distinction between sets and predicates more properly
haftmann
parents: 42871
diff changeset
  1077
 apply(rule Max_le_iff [THEN iffD2])
1220ecb81e8f observe distinction between sets and predicates more properly
haftmann
parents: 42871
diff changeset
  1078
  apply (auto intro: abs_le_D1 dvd_imp_le_int)
31995
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1079
done
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1080
31734
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1081
lemma gcd_is_Max_divisors_nat:
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1082
  "m ~= 0 \<Longrightarrow> n ~= 0 \<Longrightarrow> gcd (m::nat) n = (Max {d. d dvd m & d dvd n})"
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1083
apply(rule Max_eqI[THEN sym])
31995
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1084
  apply (metis finite_Collect_conjI finite_divisors_nat)
31734
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1085
 apply simp
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1086
 apply(metis Suc_diff_1 Suc_neq_Zero dvd_imp_le gcd_greatest_iff_nat gcd_pos_nat)
31734
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1087
apply simp
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1088
done
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1089
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1090
lemma gcd_is_Max_divisors_int:
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1091
  "m ~= 0 ==> n ~= 0 ==> gcd (m::int) n = (Max {d. d dvd m & d dvd n})"
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1092
apply(rule Max_eqI[THEN sym])
31995
8f37cf60b885 more gcd/lcm lemmas
nipkow
parents: 31992
diff changeset
  1093
  apply (metis finite_Collect_conjI finite_divisors_int)
31734
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1094
 apply simp
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1095
 apply (metis gcd_greatest_iff_int gcd_pos_int zdvd_imp_le)
31734
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1096
apply simp
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1097
done
a4a79836d07b new lemmas
nipkow
parents: 31730
diff changeset
  1098
34030
829eb528b226 resorted code equations from "old" number theory version
haftmann
parents: 33946
diff changeset
  1099
lemma gcd_code_int [code]:
829eb528b226 resorted code equations from "old" number theory version
haftmann
parents: 33946
diff changeset
  1100
  "gcd k l = \<bar>if l = (0::int) then k else gcd l (\<bar>k\<bar> mod \<bar>l\<bar>)\<bar>"
829eb528b226 resorted code equations from "old" number theory version
haftmann
parents: 33946
diff changeset
  1101
  by (simp add: gcd_int_def nat_mod_distrib gcd_non_0_nat)
829eb528b226 resorted code equations from "old" number theory version
haftmann
parents: 33946
diff changeset
  1102
22027
e4a08629c4bd A few lemmas about relative primes when dividing trough gcd
chaieb
parents: 21404
diff changeset
  1103
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1104
subsection {* Coprimality *}
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1105
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1106
lemma div_gcd_coprime_nat:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1107
  assumes nz: "(a::nat) \<noteq> 0 \<or> b \<noteq> 0"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1108
  shows "coprime (a div gcd a b) (b div gcd a b)"
22367
6860f09242bf tuned document;
wenzelm
parents: 22027
diff changeset
  1109
proof -
27556
292098f2efdf unified curried gcd, lcm, zgcd, zlcm
haftmann
parents: 27487
diff changeset
  1110
  let ?g = "gcd a b"
22027
e4a08629c4bd A few lemmas about relative primes when dividing trough gcd
chaieb
parents: 21404
diff changeset
  1111
  let ?a' = "a div ?g"
e4a08629c4bd A few lemmas about relative primes when dividing trough gcd
chaieb
parents: 21404
diff changeset
  1112
  let ?b' = "b div ?g"
27556
292098f2efdf unified curried gcd, lcm, zgcd, zlcm
haftmann
parents: 27487
diff changeset
  1113
  let ?g' = "gcd ?a' ?b'"
22027
e4a08629c4bd A few lemmas about relative primes when dividing trough gcd
chaieb
parents: 21404
diff changeset
  1114
  have dvdg: "?g dvd a" "?g dvd b" by simp_all
e4a08629c4bd A few lemmas about relative primes when dividing trough gcd
chaieb
parents: 21404
diff changeset
  1115
  have dvdg': "?g' dvd ?a'" "?g' dvd ?b'" by simp_all
22367
6860f09242bf tuned document;
wenzelm
parents: 22027
diff changeset
  1116
  from dvdg dvdg' obtain ka kb ka' kb' where
6860f09242bf tuned document;
wenzelm
parents: 22027
diff changeset
  1117
      kab: "a = ?g * ka" "b = ?g * kb" "?a' = ?g' * ka'" "?b' = ?g' * kb'"
22027
e4a08629c4bd A few lemmas about relative primes when dividing trough gcd
chaieb
parents: 21404
diff changeset
  1118
    unfolding dvd_def by blast
58834
773b378d9313 more simp rules concerning dvd and even/odd
haftmann
parents: 58787
diff changeset
  1119
  from this [symmetric] have "?g * ?a' = (?g * ?g') * ka'" "?g * ?b' = (?g * ?g') * kb'"
773b378d9313 more simp rules concerning dvd and even/odd
haftmann
parents: 58787
diff changeset
  1120
    by (simp_all add: mult.assoc mult.left_commute [of "gcd a b"])
22367
6860f09242bf tuned document;
wenzelm
parents: 22027
diff changeset
  1121
  then have dvdgg':"?g * ?g' dvd a" "?g* ?g' dvd b"
6860f09242bf tuned document;
wenzelm
parents: 22027
diff changeset
  1122
    by (auto simp add: dvd_mult_div_cancel [OF dvdg(1)]
6860f09242bf tuned document;
wenzelm
parents: 22027
diff changeset
  1123
      dvd_mult_div_cancel [OF dvdg(2)] dvd_def)
35216
7641e8d831d2 get rid of many duplicate simp rule warnings
huffman
parents: 35028
diff changeset
  1124
  have "?g \<noteq> 0" using nz by simp
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1125
  then have gp: "?g > 0" by arith
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
  1126
  from gcd_greatest [OF dvdgg'] have "?g * ?g' dvd ?g" .
22367
6860f09242bf tuned document;
wenzelm
parents: 22027
diff changeset
  1127
  with dvd_mult_cancel1 [OF gp] show "?g' = 1" by simp
22027
e4a08629c4bd A few lemmas about relative primes when dividing trough gcd
chaieb
parents: 21404
diff changeset
  1128
qed
e4a08629c4bd A few lemmas about relative primes when dividing trough gcd
chaieb
parents: 21404
diff changeset
  1129
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1130
lemma div_gcd_coprime_int:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1131
  assumes nz: "(a::int) \<noteq> 0 \<or> b \<noteq> 0"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1132
  shows "coprime (a div gcd a b) (b div gcd a b)"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1133
apply (subst (1 2 3) gcd_abs_int)
31813
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
  1134
apply (subst (1 2) abs_div)
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
  1135
  apply simp
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
  1136
 apply simp
4df828bbc411 gcd abs lemmas
nipkow
parents: 31798
diff changeset
  1137
apply(subst (1 2) abs_gcd_int)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1138
apply (rule div_gcd_coprime_nat [transferred])
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1139
using nz apply (auto simp add: gcd_abs_int [symmetric])
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1140
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1141
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1142
lemma coprime_nat: "coprime (a::nat) b \<longleftrightarrow> (\<forall>d. d dvd a \<and> d dvd b \<longleftrightarrow> d = 1)"
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1143
  using gcd_unique_nat[of 1 a b, simplified] by auto
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1144
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1145
lemma coprime_Suc_0_nat:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1146
    "coprime (a::nat) b \<longleftrightarrow> (\<forall>d. d dvd a \<and> d dvd b \<longleftrightarrow> d = Suc 0)"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1147
  using coprime_nat by (simp add: One_nat_def)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1148
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1149
lemma coprime_int: "coprime (a::int) b \<longleftrightarrow>
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1150
    (\<forall>d. d >= 0 \<and> d dvd a \<and> d dvd b \<longleftrightarrow> d = 1)"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1151
  using gcd_unique_int [of 1 a b]
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1152
  apply clarsimp
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1153
  apply (erule subst)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1154
  apply (rule iffI)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1155
  apply force
59807
22bc39064290 prefer local fixes;
wenzelm
parents: 59667
diff changeset
  1156
  apply (drule_tac x = "abs e" for e in exI)
22bc39064290 prefer local fixes;
wenzelm
parents: 59667
diff changeset
  1157
  apply (case_tac "e >= 0" for e :: int)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1158
  apply force
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1159
  apply force
59807
22bc39064290 prefer local fixes;
wenzelm
parents: 59667
diff changeset
  1160
  done
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1161
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1162
lemma gcd_coprime_nat:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1163
  assumes z: "gcd (a::nat) b \<noteq> 0" and a: "a = a' * gcd a b" and
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1164
    b: "b = b' * gcd a b"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1165
  shows    "coprime a' b'"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1166
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1167
  apply (subgoal_tac "a' = a div gcd a b")
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1168
  apply (erule ssubst)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1169
  apply (subgoal_tac "b' = b div gcd a b")
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1170
  apply (erule ssubst)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1171
  apply (rule div_gcd_coprime_nat)
41550
efa734d9b221 eliminated global prems;
wenzelm
parents: 37770
diff changeset
  1172
  using z apply force
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1173
  apply (subst (1) b)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1174
  using z apply force
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1175
  apply (subst (1) a)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1176
  using z apply force
41550
efa734d9b221 eliminated global prems;
wenzelm
parents: 37770
diff changeset
  1177
  done
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1178
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1179
lemma gcd_coprime_int:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1180
  assumes z: "gcd (a::int) b \<noteq> 0" and a: "a = a' * gcd a b" and
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1181
    b: "b = b' * gcd a b"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1182
  shows    "coprime a' b'"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1183
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1184
  apply (subgoal_tac "a' = a div gcd a b")
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1185
  apply (erule ssubst)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1186
  apply (subgoal_tac "b' = b div gcd a b")
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1187
  apply (erule ssubst)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1188
  apply (rule div_gcd_coprime_int)
41550
efa734d9b221 eliminated global prems;
wenzelm
parents: 37770
diff changeset
  1189
  using z apply force
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1190
  apply (subst (1) b)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1191
  using z apply force
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1192
  apply (subst (1) a)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1193
  using z apply force
41550
efa734d9b221 eliminated global prems;
wenzelm
parents: 37770
diff changeset
  1194
  done
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1195
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1196
lemma coprime_mult_nat: assumes da: "coprime (d::nat) a" and db: "coprime d b"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1197
    shows "coprime d (a * b)"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1198
  apply (subst gcd_commute_nat)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1199
  using da apply (subst gcd_mult_cancel_nat)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1200
  apply (subst gcd_commute_nat, assumption)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1201
  apply (subst gcd_commute_nat, rule db)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1202
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1203
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1204
lemma coprime_mult_int: assumes da: "coprime (d::int) a" and db: "coprime d b"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1205
    shows "coprime d (a * b)"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1206
  apply (subst gcd_commute_int)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1207
  using da apply (subst gcd_mult_cancel_int)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1208
  apply (subst gcd_commute_int, assumption)
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1209
  apply (subst gcd_commute_int, rule db)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1210
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1211
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1212
lemma coprime_lmult_nat:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1213
  assumes dab: "coprime (d::nat) (a * b)" shows "coprime d a"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1214
proof -
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1215
  have "gcd d a dvd gcd d (a * b)"
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
  1216
    by (rule gcd_greatest, auto)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1217
  with dab show ?thesis
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1218
    by auto
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1219
qed
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1220
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1221
lemma coprime_lmult_int:
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
  1222
  assumes "coprime (d::int) (a * b)" shows "coprime d a"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1223
proof -
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1224
  have "gcd d a dvd gcd d (a * b)"
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
  1225
    by (rule gcd_greatest, auto)
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
  1226
  with assms show ?thesis
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1227
    by auto
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1228
qed
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1229
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1230
lemma coprime_rmult_nat:
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
  1231
  assumes "coprime (d::nat) (a * b)" shows "coprime d b"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1232
proof -
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1233
  have "gcd d b dvd gcd d (a * b)"
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
  1234
    by (rule gcd_greatest, auto intro: dvd_mult)
31798
fe9a3043d36c Cleaned up GCD
nipkow
parents: 31766
diff changeset
  1235
  with assms show ?thesis
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1236
    by auto
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1237
qed
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1238
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1239
lemma coprime_rmult_int:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1240
  assumes dab: "coprime (d::int) (a * b)" shows "coprime d b"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1241
proof -
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1242
  have "gcd d b dvd gcd d (a * b)"
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
  1243
    by (rule gcd_greatest, auto intro: dvd_mult)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1244
  with dab show ?thesis
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1245
    by auto
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1246
qed
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1247
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1248
lemma coprime_mul_eq_nat: "coprime (d::nat) (a * b) \<longleftrightarrow>
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1249
    coprime d a \<and>  coprime d b"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1250
  using coprime_rmult_nat[of d a b] coprime_lmult_nat[of d a b]
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1251
    coprime_mult_nat[of d a b]
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1252
  by blast
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1253
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1254
lemma coprime_mul_eq_int: "coprime (d::int) (a * b) \<longleftrightarrow>
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1255
    coprime d a \<and>  coprime d b"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1256
  using coprime_rmult_int[of d a b] coprime_lmult_int[of d a b]
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1257
    coprime_mult_int[of d a b]
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1258
  by blast
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1259
52397
e95f6b4b1bcf added coprimality lemma
noschinl
parents: 51547
diff changeset
  1260
lemma coprime_power_int:
e95f6b4b1bcf added coprimality lemma
noschinl
parents: 51547
diff changeset
  1261
  assumes "0 < n" shows "coprime (a :: int) (b ^ n) \<longleftrightarrow> coprime a b"
e95f6b4b1bcf added coprimality lemma
noschinl
parents: 51547
diff changeset
  1262
  using assms
e95f6b4b1bcf added coprimality lemma
noschinl
parents: 51547
diff changeset
  1263
proof (induct n)
e95f6b4b1bcf added coprimality lemma
noschinl
parents: 51547
diff changeset
  1264
  case (Suc n) then show ?case
e95f6b4b1bcf added coprimality lemma
noschinl
parents: 51547
diff changeset
  1265
    by (cases n) (simp_all add: coprime_mul_eq_int)
e95f6b4b1bcf added coprimality lemma
noschinl
parents: 51547
diff changeset
  1266
qed simp
e95f6b4b1bcf added coprimality lemma
noschinl
parents: 51547
diff changeset
  1267
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1268
lemma gcd_coprime_exists_nat:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1269
    assumes nz: "gcd (a::nat) b \<noteq> 0"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1270
    shows "\<exists>a' b'. a = a' * gcd a b \<and> b = b' * gcd a b \<and> coprime a' b'"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1271
  apply (rule_tac x = "a div gcd a b" in exI)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1272
  apply (rule_tac x = "b div gcd a b" in exI)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1273
  using nz apply (auto simp add: div_gcd_coprime_nat dvd_div_mult)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1274
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1275
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1276
lemma gcd_coprime_exists_int:
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1277
    assumes nz: "gcd (a::int) b \<noteq> 0"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1278
    shows "\<exists>a' b'. a = a' * gcd a b \<and> b = b' * gcd a b \<and> coprime a' b'"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1279
  apply (rule_tac x = "a div gcd a b" in exI)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1280
  apply (rule_tac x = "b div gcd a b" in exI)
59008
f61482b0f240 formally self-contained gcd type classes
haftmann
parents: 58889
diff changeset
  1281
  using nz apply (auto simp add: div_gcd_coprime_int)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1282
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1283
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1284
lemma coprime_exp_nat: "coprime (d::nat) a \<Longrightarrow> coprime d (a^n)"
60596
54168997757f algebraic specification for set gcd
haftmann
parents: 60580
diff changeset
  1285
  by (induct n) (simp_all add: coprime_mult_nat)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1286
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1287
lemma coprime_exp_int: "coprime (d::int) a \<Longrightarrow> coprime d (a^n)"
60596
54168997757f algebraic specification for set gcd
haftmann
parents: 60580
diff changeset
  1288
  by (induct n) (simp_all add: coprime_mult_int)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1289
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1290
lemma coprime_exp2_nat [intro]: "coprime (a::nat) b \<Longrightarrow> coprime (a^n) (b^m)"
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
  1291
  by (simp add: coprime_exp_nat ac_simps)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1292
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1293
lemma coprime_exp2_int [intro]: "coprime (a::int) b \<Longrightarrow> coprime (a^n) (b^m)"
60686
ea5bc46c11e6 more algebraic properties for gcd/lcm
haftmann
parents: 60597
diff changeset
  1294
  by (simp add: coprime_exp_int ac_simps)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1295
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1296
lemma gcd_exp_nat: "gcd ((a::nat)^n) (b^n) = (gcd a b)^n"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1297
proof (cases)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1298
  assume "a = 0 & b = 0"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1299
  thus ?thesis by simp
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1300
  next assume "~(a = 0 & b = 0)"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1301
  hence "coprime ((a div gcd a b)^n) ((b div gcd a b)^n)"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1302
    by (auto simp:div_gcd_coprime_nat)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1303
  hence "gcd ((a div gcd a b)^n * (gcd a b)^n)
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1304
      ((b div gcd a b)^n * (gcd a b)^n) = (gcd a b)^n"
60162
645058aa9d6f tidying some messy proofs
paulson <lp15@cam.ac.uk>
parents: 59977
diff changeset
  1305
    by (metis gcd_mult_distrib_nat mult.commute mult.right_neutral)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1306
  also have "(a div gcd a b)^n * (gcd a b)^n = a^n"
60162
645058aa9d6f tidying some messy proofs
paulson <lp15@cam.ac.uk>
parents: 59977
diff changeset
  1307
    by (metis dvd_div_mult_self gcd_unique_nat power_mult_distrib)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1308
  also have "(b div gcd a b)^n * (gcd a b)^n = b^n"
60162
645058aa9d6f tidying some messy proofs
paulson <lp15@cam.ac.uk>
parents: 59977
diff changeset
  1309
    by (metis dvd_div_mult_self gcd_unique_nat power_mult_distrib)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1310
  finally show ?thesis .
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1311
qed
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1312
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1313
lemma gcd_exp_int: "gcd ((a::int)^n) (b^n) = (gcd a b)^n"
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1314
  apply (subst (1 2) gcd_abs_int)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1315
  apply (subst (1 2) power_abs)
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1316
  apply (rule gcd_exp_nat [where n = n, transferred])
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1317
  apply auto
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1318
done
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1319
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1320
lemma division_decomp_nat: assumes dc: "(a::nat) dvd b * c"
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1321
  shows "\<exists>b' c'. a = b' * c' \<and> b' dvd b \<and> c' dvd c"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1322
proof-
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1323
  let ?g = "gcd a b"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1324
  {assume "?g = 0" with dc have ?thesis by auto}
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1325
  moreover
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1326
  {assume z: "?g \<noteq> 0"
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1327
    from gcd_coprime_exists_nat[OF z]
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1328
    obtain a' b' where ab': "a = a' * ?g" "b = b' * ?g" "coprime a' b'"
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1329
      by blast
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1330
    have thb: "?g dvd b" by auto
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1331
    from ab'(1) have "a' dvd a"  unfolding dvd_def by blast
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1332
    with dc have th0: "a' dvd b*c" using dvd_trans[of a' a "b*c"] by simp
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1333
    from dc ab'(1,2) have "a'*?g dvd (b'*?g) *c" by auto
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56218
diff changeset
  1334
    hence "?g*a' dvd ?g * (b' * c)" by (simp add: mult.assoc)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1335
    with z have th_1: "a' dvd b' * c" by auto
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int
nipkow
parents: 31814
diff changeset
  1336
    from coprime_dvd_mult_nat[OF ab'(3)] th_1
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56218
diff changeset
  1337
    have thc: "a' dvd c" by (subst (asm) mult.commute, blast)
31706
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1338
    from ab' have "a = ?g*a'" by algebra
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1339
    with thb thc have ?thesis by blast }
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1340
  ultimately show ?thesis by blast
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1341
qed
1db0c8f235fb new GCD library, courtesy of Jeremy Avigad
huffman
parents: 30738
diff changeset
  1342
31952
40501bb2d57c renamed lemmas: nat_xyz/int_xyz -> xyz_nat/xyz_int