src/HOL/Algebra/Coset.thy
author wenzelm
Wed Jun 13 00:01:41 2007 +0200 (2007-06-13)
changeset 23350 50c5b0912a0c
parent 21404 eb85850d3eb7
child 23463 9953ff53cc64
permissions -rw-r--r--
tuned proofs: avoid implicit prems;
wenzelm@14706
     1
(*  Title:      HOL/Algebra/Coset.thy
paulson@13870
     2
    ID:         $Id$
ballarin@20318
     3
    Author:     Florian Kammueller, with new proofs by L C Paulson, and
ballarin@20318
     4
                Stephan Hohe
paulson@13870
     5
*)
paulson@13870
     6
ballarin@20318
     7
theory Coset imports Group Exponent begin
paulson@13870
     8
ballarin@20318
     9
ballarin@20318
    10
section {*Cosets and Quotient Groups*}
paulson@13870
    11
wenzelm@14651
    12
constdefs (structure G)
paulson@14963
    13
  r_coset    :: "[_, 'a set, 'a] \<Rightarrow> 'a set"    (infixl "#>\<index>" 60)
paulson@14963
    14
  "H #> a \<equiv> \<Union>h\<in>H. {h \<otimes> a}"
paulson@13870
    15
paulson@14963
    16
  l_coset    :: "[_, 'a, 'a set] \<Rightarrow> 'a set"    (infixl "<#\<index>" 60)
paulson@14963
    17
  "a <# H \<equiv> \<Union>h\<in>H. {a \<otimes> h}"
paulson@13870
    18
paulson@14963
    19
  RCOSETS  :: "[_, 'a set] \<Rightarrow> ('a set)set"   ("rcosets\<index> _" [81] 80)
paulson@14963
    20
  "rcosets H \<equiv> \<Union>a\<in>carrier G. {H #> a}"
paulson@14963
    21
paulson@14963
    22
  set_mult  :: "[_, 'a set ,'a set] \<Rightarrow> 'a set" (infixl "<#>\<index>" 60)
paulson@14963
    23
  "H <#> K \<equiv> \<Union>h\<in>H. \<Union>k\<in>K. {h \<otimes> k}"
paulson@13870
    24
paulson@14963
    25
  SET_INV :: "[_,'a set] \<Rightarrow> 'a set"  ("set'_inv\<index> _" [81] 80)
paulson@14963
    26
  "set_inv H \<equiv> \<Union>h\<in>H. {inv h}"
paulson@13870
    27
paulson@14963
    28
paulson@14963
    29
locale normal = subgroup + group +
paulson@14963
    30
  assumes coset_eq: "(\<forall>x \<in> carrier G. H #> x = x <# H)"
paulson@13870
    31
wenzelm@19380
    32
abbreviation
wenzelm@21404
    33
  normal_rel :: "['a set, ('a, 'b) monoid_scheme] \<Rightarrow> bool"  (infixl "\<lhd>" 60) where
wenzelm@19380
    34
  "H \<lhd> G \<equiv> normal H G"
paulson@13870
    35
paulson@13870
    36
paulson@14803
    37
subsection {*Basic Properties of Cosets*}
paulson@13870
    38
paulson@14747
    39
lemma (in group) coset_mult_assoc:
paulson@14747
    40
     "[| M \<subseteq> carrier G; g \<in> carrier G; h \<in> carrier G |]
paulson@13870
    41
      ==> (M #> g) #> h = M #> (g \<otimes> h)"
paulson@14747
    42
by (force simp add: r_coset_def m_assoc)
paulson@13870
    43
paulson@14747
    44
lemma (in group) coset_mult_one [simp]: "M \<subseteq> carrier G ==> M #> \<one> = M"
paulson@14747
    45
by (force simp add: r_coset_def)
paulson@13870
    46
paulson@14747
    47
lemma (in group) coset_mult_inv1:
wenzelm@14666
    48
     "[| M #> (x \<otimes> (inv y)) = M;  x \<in> carrier G ; y \<in> carrier G;
paulson@14747
    49
         M \<subseteq> carrier G |] ==> M #> x = M #> y"
paulson@13870
    50
apply (erule subst [of concl: "%z. M #> x = z #> y"])
paulson@13870
    51
apply (simp add: coset_mult_assoc m_assoc)
paulson@13870
    52
done
paulson@13870
    53
paulson@14747
    54
lemma (in group) coset_mult_inv2:
paulson@14747
    55
     "[| M #> x = M #> y;  x \<in> carrier G;  y \<in> carrier G;  M \<subseteq> carrier G |]
paulson@13870
    56
      ==> M #> (x \<otimes> (inv y)) = M "
paulson@13870
    57
apply (simp add: coset_mult_assoc [symmetric])
paulson@13870
    58
apply (simp add: coset_mult_assoc)
paulson@13870
    59
done
paulson@13870
    60
paulson@14747
    61
lemma (in group) coset_join1:
paulson@14747
    62
     "[| H #> x = H;  x \<in> carrier G;  subgroup H G |] ==> x \<in> H"
paulson@13870
    63
apply (erule subst)
paulson@14963
    64
apply (simp add: r_coset_def)
paulson@14963
    65
apply (blast intro: l_one subgroup.one_closed sym)
paulson@13870
    66
done
paulson@13870
    67
paulson@14747
    68
lemma (in group) solve_equation:
paulson@14963
    69
    "\<lbrakk>subgroup H G; x \<in> H; y \<in> H\<rbrakk> \<Longrightarrow> \<exists>h\<in>H. y = h \<otimes> x"
paulson@13870
    70
apply (rule bexI [of _ "y \<otimes> (inv x)"])
wenzelm@14666
    71
apply (auto simp add: subgroup.m_closed subgroup.m_inv_closed m_assoc
paulson@13870
    72
                      subgroup.subset [THEN subsetD])
paulson@13870
    73
done
paulson@13870
    74
paulson@14963
    75
lemma (in group) repr_independence:
paulson@14963
    76
     "\<lbrakk>y \<in> H #> x;  x \<in> carrier G; subgroup H G\<rbrakk> \<Longrightarrow> H #> x = H #> y"
paulson@14963
    77
by (auto simp add: r_coset_def m_assoc [symmetric]
paulson@14963
    78
                   subgroup.subset [THEN subsetD]
paulson@14963
    79
                   subgroup.m_closed solve_equation)
paulson@14963
    80
paulson@14747
    81
lemma (in group) coset_join2:
paulson@14963
    82
     "\<lbrakk>x \<in> carrier G;  subgroup H G;  x\<in>H\<rbrakk> \<Longrightarrow> H #> x = H"
paulson@14963
    83
  --{*Alternative proof is to put @{term "x=\<one>"} in @{text repr_independence}.*}
paulson@14963
    84
by (force simp add: subgroup.m_closed r_coset_def solve_equation)
paulson@13870
    85
ballarin@20318
    86
lemma (in monoid) r_coset_subset_G:
paulson@14747
    87
     "[| H \<subseteq> carrier G; x \<in> carrier G |] ==> H #> x \<subseteq> carrier G"
paulson@14747
    88
by (auto simp add: r_coset_def)
paulson@13870
    89
paulson@14747
    90
lemma (in group) rcosI:
paulson@14747
    91
     "[| h \<in> H; H \<subseteq> carrier G; x \<in> carrier G|] ==> h \<otimes> x \<in> H #> x"
paulson@14747
    92
by (auto simp add: r_coset_def)
paulson@13870
    93
paulson@14963
    94
lemma (in group) rcosetsI:
paulson@14963
    95
     "\<lbrakk>H \<subseteq> carrier G; x \<in> carrier G\<rbrakk> \<Longrightarrow> H #> x \<in> rcosets H"
paulson@14963
    96
by (auto simp add: RCOSETS_def)
paulson@13870
    97
paulson@13870
    98
text{*Really needed?*}
paulson@14747
    99
lemma (in group) transpose_inv:
wenzelm@14666
   100
     "[| x \<otimes> y = z;  x \<in> carrier G;  y \<in> carrier G;  z \<in> carrier G |]
paulson@13870
   101
      ==> (inv x) \<otimes> z = y"
paulson@13870
   102
by (force simp add: m_assoc [symmetric])
paulson@13870
   103
paulson@14747
   104
lemma (in group) rcos_self: "[| x \<in> carrier G; subgroup H G |] ==> x \<in> H #> x"
paulson@14963
   105
apply (simp add: r_coset_def)
paulson@14963
   106
apply (blast intro: sym l_one subgroup.subset [THEN subsetD]
paulson@13870
   107
                    subgroup.one_closed)
paulson@13870
   108
done
paulson@13870
   109
wenzelm@23350
   110
text (in group) {* Opposite of @{thm [source] "repr_independence"} *}
ballarin@20318
   111
lemma (in group) repr_independenceD:
ballarin@20318
   112
  includes subgroup H G
ballarin@20318
   113
  assumes ycarr: "y \<in> carrier G"
ballarin@20318
   114
      and repr:  "H #> x = H #> y"
ballarin@20318
   115
  shows "y \<in> H #> x"
wenzelm@23350
   116
  apply (subst repr)
wenzelm@23350
   117
  apply (intro rcos_self)
wenzelm@23350
   118
   apply (rule ycarr)
wenzelm@23350
   119
   apply (rule is_subgroup)
wenzelm@23350
   120
  done
ballarin@20318
   121
ballarin@20318
   122
text {* Elements of a right coset are in the carrier *}
ballarin@20318
   123
lemma (in subgroup) elemrcos_carrier:
ballarin@20318
   124
  includes group
ballarin@20318
   125
  assumes acarr: "a \<in> carrier G"
ballarin@20318
   126
    and a': "a' \<in> H #> a"
ballarin@20318
   127
  shows "a' \<in> carrier G"
ballarin@20318
   128
proof -
ballarin@20318
   129
  from subset and acarr
ballarin@20318
   130
  have "H #> a \<subseteq> carrier G" by (rule r_coset_subset_G)
ballarin@20318
   131
  from this and a'
ballarin@20318
   132
  show "a' \<in> carrier G"
ballarin@20318
   133
    by fast
ballarin@20318
   134
qed
ballarin@20318
   135
ballarin@20318
   136
lemma (in subgroup) rcos_const:
ballarin@20318
   137
  includes group
ballarin@20318
   138
  assumes hH: "h \<in> H"
ballarin@20318
   139
  shows "H #> h = H"
ballarin@20318
   140
  apply (unfold r_coset_def)
ballarin@20318
   141
  apply rule apply rule
ballarin@20318
   142
  apply clarsimp
ballarin@20318
   143
  apply (intro subgroup.m_closed)
ballarin@20318
   144
  apply assumption+
ballarin@20318
   145
  apply rule
ballarin@20318
   146
  apply simp
ballarin@20318
   147
proof -
ballarin@20318
   148
  fix h'
ballarin@20318
   149
  assume h'H: "h' \<in> H"
ballarin@20318
   150
  note carr = hH[THEN mem_carrier] h'H[THEN mem_carrier]
ballarin@20318
   151
  from carr
ballarin@20318
   152
  have a: "h' = (h' \<otimes> inv h) \<otimes> h" by (simp add: m_assoc)
ballarin@20318
   153
  from h'H hH
ballarin@20318
   154
  have "h' \<otimes> inv h \<in> H" by simp
ballarin@20318
   155
  from this and a
ballarin@20318
   156
  show "\<exists>x\<in>H. h' = x \<otimes> h" by fast
ballarin@20318
   157
qed
ballarin@20318
   158
ballarin@20318
   159
text {* Step one for lemma @{text "rcos_module"} *}
ballarin@20318
   160
lemma (in subgroup) rcos_module_imp:
ballarin@20318
   161
  includes group
ballarin@20318
   162
  assumes xcarr: "x \<in> carrier G"
ballarin@20318
   163
      and x'cos: "x' \<in> H #> x"
ballarin@20318
   164
  shows "(x' \<otimes> inv x) \<in> H"
ballarin@20318
   165
proof -
ballarin@20318
   166
  from xcarr x'cos
ballarin@20318
   167
      have x'carr: "x' \<in> carrier G"
ballarin@20318
   168
      by (rule elemrcos_carrier[OF is_group])
ballarin@20318
   169
  from xcarr
ballarin@20318
   170
      have ixcarr: "inv x \<in> carrier G"
ballarin@20318
   171
      by simp
ballarin@20318
   172
  from x'cos
ballarin@20318
   173
      have "\<exists>h\<in>H. x' = h \<otimes> x"
ballarin@20318
   174
      unfolding r_coset_def
ballarin@20318
   175
      by fast
ballarin@20318
   176
  from this
ballarin@20318
   177
      obtain h
ballarin@20318
   178
        where hH: "h \<in> H"
ballarin@20318
   179
        and x': "x' = h \<otimes> x"
ballarin@20318
   180
      by auto
ballarin@20318
   181
  from hH and subset
ballarin@20318
   182
      have hcarr: "h \<in> carrier G" by fast
ballarin@20318
   183
  note carr = xcarr x'carr hcarr
ballarin@20318
   184
  from x' and carr
ballarin@20318
   185
      have "x' \<otimes> (inv x) = (h \<otimes> x) \<otimes> (inv x)" by fast
ballarin@20318
   186
  also from carr
ballarin@20318
   187
      have "\<dots> = h \<otimes> (x \<otimes> inv x)" by (simp add: m_assoc)
ballarin@20318
   188
  also from carr
ballarin@20318
   189
      have "\<dots> = h \<otimes> \<one>" by simp
ballarin@20318
   190
  also from carr
ballarin@20318
   191
      have "\<dots> = h" by simp
ballarin@20318
   192
  finally
ballarin@20318
   193
      have "x' \<otimes> (inv x) = h" by simp
ballarin@20318
   194
  from hH this
ballarin@20318
   195
      show "x' \<otimes> (inv x) \<in> H" by simp
ballarin@20318
   196
qed
ballarin@20318
   197
ballarin@20318
   198
text {* Step two for lemma @{text "rcos_module"} *}
ballarin@20318
   199
lemma (in subgroup) rcos_module_rev:
ballarin@20318
   200
  includes group
ballarin@20318
   201
  assumes carr: "x \<in> carrier G" "x' \<in> carrier G"
ballarin@20318
   202
      and xixH: "(x' \<otimes> inv x) \<in> H"
ballarin@20318
   203
  shows "x' \<in> H #> x"
ballarin@20318
   204
proof -
ballarin@20318
   205
  from xixH
ballarin@20318
   206
      have "\<exists>h\<in>H. x' \<otimes> (inv x) = h" by fast
ballarin@20318
   207
  from this
ballarin@20318
   208
      obtain h
ballarin@20318
   209
        where hH: "h \<in> H"
ballarin@20318
   210
        and hsym: "x' \<otimes> (inv x) = h"
ballarin@20318
   211
      by fast
ballarin@20318
   212
  from hH subset have hcarr: "h \<in> carrier G" by simp
ballarin@20318
   213
  note carr = carr hcarr
ballarin@20318
   214
  from hsym[symmetric] have "h \<otimes> x = x' \<otimes> (inv x) \<otimes> x" by fast
ballarin@20318
   215
  also from carr
ballarin@20318
   216
      have "\<dots> = x' \<otimes> ((inv x) \<otimes> x)" by (simp add: m_assoc)
ballarin@20318
   217
  also from carr
ballarin@20318
   218
      have "\<dots> = x' \<otimes> \<one>" by (simp add: l_inv)
ballarin@20318
   219
  also from carr
ballarin@20318
   220
      have "\<dots> = x'" by simp
ballarin@20318
   221
  finally
ballarin@20318
   222
      have "h \<otimes> x = x'" by simp
ballarin@20318
   223
  from this[symmetric] and hH
ballarin@20318
   224
      show "x' \<in> H #> x"
ballarin@20318
   225
      unfolding r_coset_def
ballarin@20318
   226
      by fast
ballarin@20318
   227
qed
ballarin@20318
   228
ballarin@20318
   229
text {* Module property of right cosets *}
ballarin@20318
   230
lemma (in subgroup) rcos_module:
ballarin@20318
   231
  includes group
ballarin@20318
   232
  assumes carr: "x \<in> carrier G" "x' \<in> carrier G"
ballarin@20318
   233
  shows "(x' \<in> H #> x) = (x' \<otimes> inv x \<in> H)"
ballarin@20318
   234
proof
ballarin@20318
   235
  assume "x' \<in> H #> x"
ballarin@20318
   236
  from this and carr
ballarin@20318
   237
      show "x' \<otimes> inv x \<in> H"
ballarin@20318
   238
      by (intro rcos_module_imp[OF is_group])
ballarin@20318
   239
next
ballarin@20318
   240
  assume "x' \<otimes> inv x \<in> H"
ballarin@20318
   241
  from this and carr
ballarin@20318
   242
      show "x' \<in> H #> x"
ballarin@20318
   243
      by (intro rcos_module_rev[OF is_group])
ballarin@20318
   244
qed
ballarin@20318
   245
ballarin@20318
   246
text {* Right cosets are subsets of the carrier. *} 
ballarin@20318
   247
lemma (in subgroup) rcosets_carrier:
ballarin@20318
   248
  includes group
ballarin@20318
   249
  assumes XH: "X \<in> rcosets H"
ballarin@20318
   250
  shows "X \<subseteq> carrier G"
ballarin@20318
   251
proof -
ballarin@20318
   252
  from XH have "\<exists>x\<in> carrier G. X = H #> x"
ballarin@20318
   253
      unfolding RCOSETS_def
ballarin@20318
   254
      by fast
ballarin@20318
   255
  from this
ballarin@20318
   256
      obtain x
ballarin@20318
   257
        where xcarr: "x\<in> carrier G"
ballarin@20318
   258
        and X: "X = H #> x"
ballarin@20318
   259
      by fast
ballarin@20318
   260
  from subset and xcarr
ballarin@20318
   261
      show "X \<subseteq> carrier G"
ballarin@20318
   262
      unfolding X
ballarin@20318
   263
      by (rule r_coset_subset_G)
ballarin@20318
   264
qed
ballarin@20318
   265
ballarin@20318
   266
text {* Multiplication of general subsets *}
ballarin@20318
   267
lemma (in monoid) set_mult_closed:
ballarin@20318
   268
  assumes Acarr: "A \<subseteq> carrier G"
ballarin@20318
   269
      and Bcarr: "B \<subseteq> carrier G"
ballarin@20318
   270
  shows "A <#> B \<subseteq> carrier G"
ballarin@20318
   271
apply rule apply (simp add: set_mult_def, clarsimp)
ballarin@20318
   272
proof -
ballarin@20318
   273
  fix a b
ballarin@20318
   274
  assume "a \<in> A"
ballarin@20318
   275
  from this and Acarr
ballarin@20318
   276
      have acarr: "a \<in> carrier G" by fast
ballarin@20318
   277
ballarin@20318
   278
  assume "b \<in> B"
ballarin@20318
   279
  from this and Bcarr
ballarin@20318
   280
      have bcarr: "b \<in> carrier G" by fast
ballarin@20318
   281
ballarin@20318
   282
  from acarr bcarr
ballarin@20318
   283
      show "a \<otimes> b \<in> carrier G" by (rule m_closed)
ballarin@20318
   284
qed
ballarin@20318
   285
ballarin@20318
   286
lemma (in comm_group) mult_subgroups:
ballarin@20318
   287
  assumes subH: "subgroup H G"
ballarin@20318
   288
      and subK: "subgroup K G"
ballarin@20318
   289
  shows "subgroup (H <#> K) G"
ballarin@20318
   290
apply (rule subgroup.intro)
ballarin@20318
   291
   apply (intro set_mult_closed subgroup.subset[OF subH] subgroup.subset[OF subK])
ballarin@20318
   292
  apply (simp add: set_mult_def) apply clarsimp defer 1
ballarin@20318
   293
  apply (simp add: set_mult_def) defer 1
ballarin@20318
   294
  apply (simp add: set_mult_def, clarsimp) defer 1
ballarin@20318
   295
proof -
ballarin@20318
   296
  fix ha hb ka kb
ballarin@20318
   297
  assume haH: "ha \<in> H" and hbH: "hb \<in> H" and kaK: "ka \<in> K" and kbK: "kb \<in> K"
ballarin@20318
   298
  note carr = haH[THEN subgroup.mem_carrier[OF subH]] hbH[THEN subgroup.mem_carrier[OF subH]]
ballarin@20318
   299
              kaK[THEN subgroup.mem_carrier[OF subK]] kbK[THEN subgroup.mem_carrier[OF subK]]
ballarin@20318
   300
  from carr
ballarin@20318
   301
      have "(ha \<otimes> ka) \<otimes> (hb \<otimes> kb) = ha \<otimes> (ka \<otimes> hb) \<otimes> kb" by (simp add: m_assoc)
ballarin@20318
   302
  also from carr
ballarin@20318
   303
      have "\<dots> = ha \<otimes> (hb \<otimes> ka) \<otimes> kb" by (simp add: m_comm)
ballarin@20318
   304
  also from carr
ballarin@20318
   305
      have "\<dots> = (ha \<otimes> hb) \<otimes> (ka \<otimes> kb)" by (simp add: m_assoc)
ballarin@20318
   306
  finally
ballarin@20318
   307
      have eq: "(ha \<otimes> ka) \<otimes> (hb \<otimes> kb) = (ha \<otimes> hb) \<otimes> (ka \<otimes> kb)" .
ballarin@20318
   308
ballarin@20318
   309
  from haH hbH have hH: "ha \<otimes> hb \<in> H" by (simp add: subgroup.m_closed[OF subH])
ballarin@20318
   310
  from kaK kbK have kK: "ka \<otimes> kb \<in> K" by (simp add: subgroup.m_closed[OF subK])
ballarin@20318
   311
  
ballarin@20318
   312
  from hH and kK and eq
ballarin@20318
   313
      show "\<exists>h'\<in>H. \<exists>k'\<in>K. (ha \<otimes> ka) \<otimes> (hb \<otimes> kb) = h' \<otimes> k'" by fast
ballarin@20318
   314
next
ballarin@20318
   315
  have "\<one> = \<one> \<otimes> \<one>" by simp
ballarin@20318
   316
  from subgroup.one_closed[OF subH] subgroup.one_closed[OF subK] this
ballarin@20318
   317
      show "\<exists>h\<in>H. \<exists>k\<in>K. \<one> = h \<otimes> k" by fast
ballarin@20318
   318
next
ballarin@20318
   319
  fix h k
ballarin@20318
   320
  assume hH: "h \<in> H"
ballarin@20318
   321
     and kK: "k \<in> K"
ballarin@20318
   322
ballarin@20318
   323
  from hH[THEN subgroup.mem_carrier[OF subH]] kK[THEN subgroup.mem_carrier[OF subK]]
ballarin@20318
   324
      have "inv (h \<otimes> k) = inv h \<otimes> inv k" by (simp add: inv_mult_group m_comm)
ballarin@20318
   325
ballarin@20318
   326
  from subgroup.m_inv_closed[OF subH hH] and subgroup.m_inv_closed[OF subK kK] and this
ballarin@20318
   327
      show "\<exists>ha\<in>H. \<exists>ka\<in>K. inv (h \<otimes> k) = ha \<otimes> ka" by fast
ballarin@20318
   328
qed
ballarin@20318
   329
ballarin@20318
   330
lemma (in subgroup) lcos_module_rev:
ballarin@20318
   331
  includes group
ballarin@20318
   332
  assumes carr: "x \<in> carrier G" "x' \<in> carrier G"
ballarin@20318
   333
      and xixH: "(inv x \<otimes> x') \<in> H"
ballarin@20318
   334
  shows "x' \<in> x <# H"
ballarin@20318
   335
proof -
ballarin@20318
   336
  from xixH
ballarin@20318
   337
      have "\<exists>h\<in>H. (inv x) \<otimes> x' = h" by fast
ballarin@20318
   338
  from this
ballarin@20318
   339
      obtain h
ballarin@20318
   340
        where hH: "h \<in> H"
ballarin@20318
   341
        and hsym: "(inv x) \<otimes> x' = h"
ballarin@20318
   342
      by fast
ballarin@20318
   343
ballarin@20318
   344
  from hH subset have hcarr: "h \<in> carrier G" by simp
ballarin@20318
   345
  note carr = carr hcarr
ballarin@20318
   346
  from hsym[symmetric] have "x \<otimes> h = x \<otimes> ((inv x) \<otimes> x')" by fast
ballarin@20318
   347
  also from carr
ballarin@20318
   348
      have "\<dots> = (x \<otimes> (inv x)) \<otimes> x'" by (simp add: m_assoc[symmetric])
ballarin@20318
   349
  also from carr
ballarin@20318
   350
      have "\<dots> = \<one> \<otimes> x'" by simp
ballarin@20318
   351
  also from carr
ballarin@20318
   352
      have "\<dots> = x'" by simp
ballarin@20318
   353
  finally
ballarin@20318
   354
      have "x \<otimes> h = x'" by simp
ballarin@20318
   355
ballarin@20318
   356
  from this[symmetric] and hH
ballarin@20318
   357
      show "x' \<in> x <# H"
ballarin@20318
   358
      unfolding l_coset_def
ballarin@20318
   359
      by fast
ballarin@20318
   360
qed
ballarin@20318
   361
paulson@13870
   362
wenzelm@14666
   363
subsection {* Normal subgroups *}
paulson@13870
   364
paulson@14963
   365
lemma normal_imp_subgroup: "H \<lhd> G \<Longrightarrow> subgroup H G"
paulson@14963
   366
  by (simp add: normal_def subgroup_def)
paulson@13870
   367
paulson@14963
   368
lemma (in group) normalI: 
paulson@14963
   369
  "subgroup H G \<Longrightarrow> (\<forall>x \<in> carrier G. H #> x = x <# H) \<Longrightarrow> H \<lhd> G";
paulson@14963
   370
  by (simp add: normal_def normal_axioms_def prems) 
paulson@14963
   371
paulson@14963
   372
lemma (in normal) inv_op_closed1:
paulson@14963
   373
     "\<lbrakk>x \<in> carrier G; h \<in> H\<rbrakk> \<Longrightarrow> (inv x) \<otimes> h \<otimes> x \<in> H"
paulson@14963
   374
apply (insert coset_eq) 
paulson@14963
   375
apply (auto simp add: l_coset_def r_coset_def)
wenzelm@14666
   376
apply (drule bspec, assumption)
paulson@13870
   377
apply (drule equalityD1 [THEN subsetD], blast, clarify)
paulson@14963
   378
apply (simp add: m_assoc)
paulson@14963
   379
apply (simp add: m_assoc [symmetric])
paulson@13870
   380
done
paulson@13870
   381
paulson@14963
   382
lemma (in normal) inv_op_closed2:
paulson@14963
   383
     "\<lbrakk>x \<in> carrier G; h \<in> H\<rbrakk> \<Longrightarrow> x \<otimes> h \<otimes> (inv x) \<in> H"
paulson@14963
   384
apply (subgoal_tac "inv (inv x) \<otimes> h \<otimes> (inv x) \<in> H") 
paulson@14963
   385
apply (simp add: ); 
paulson@14963
   386
apply (blast intro: inv_op_closed1) 
paulson@13870
   387
done
paulson@13870
   388
paulson@14747
   389
text{*Alternative characterization of normal subgroups*}
paulson@14747
   390
lemma (in group) normal_inv_iff:
paulson@14747
   391
     "(N \<lhd> G) = 
paulson@14747
   392
      (subgroup N G & (\<forall>x \<in> carrier G. \<forall>h \<in> N. x \<otimes> h \<otimes> (inv x) \<in> N))"
paulson@14747
   393
      (is "_ = ?rhs")
paulson@14747
   394
proof
paulson@14747
   395
  assume N: "N \<lhd> G"
paulson@14747
   396
  show ?rhs
paulson@14963
   397
    by (blast intro: N normal.inv_op_closed2 normal_imp_subgroup) 
paulson@14747
   398
next
paulson@14747
   399
  assume ?rhs
paulson@14747
   400
  hence sg: "subgroup N G" 
paulson@14963
   401
    and closed: "\<And>x. x\<in>carrier G \<Longrightarrow> \<forall>h\<in>N. x \<otimes> h \<otimes> inv x \<in> N" by auto
paulson@14747
   402
  hence sb: "N \<subseteq> carrier G" by (simp add: subgroup.subset) 
paulson@14747
   403
  show "N \<lhd> G"
paulson@14963
   404
  proof (intro normalI [OF sg], simp add: l_coset_def r_coset_def, clarify)
paulson@14747
   405
    fix x
paulson@14747
   406
    assume x: "x \<in> carrier G"
nipkow@15120
   407
    show "(\<Union>h\<in>N. {h \<otimes> x}) = (\<Union>h\<in>N. {x \<otimes> h})"
paulson@14747
   408
    proof
nipkow@15120
   409
      show "(\<Union>h\<in>N. {h \<otimes> x}) \<subseteq> (\<Union>h\<in>N. {x \<otimes> h})"
paulson@14747
   410
      proof clarify
paulson@14747
   411
        fix n
paulson@14747
   412
        assume n: "n \<in> N" 
nipkow@15120
   413
        show "n \<otimes> x \<in> (\<Union>h\<in>N. {x \<otimes> h})"
paulson@14747
   414
        proof 
paulson@14963
   415
          from closed [of "inv x"]
paulson@14963
   416
          show "inv x \<otimes> n \<otimes> x \<in> N" by (simp add: x n)
paulson@14963
   417
          show "n \<otimes> x \<in> {x \<otimes> (inv x \<otimes> n \<otimes> x)}"
paulson@14747
   418
            by (simp add: x n m_assoc [symmetric] sb [THEN subsetD])
paulson@14747
   419
        qed
paulson@14747
   420
      qed
paulson@14747
   421
    next
nipkow@15120
   422
      show "(\<Union>h\<in>N. {x \<otimes> h}) \<subseteq> (\<Union>h\<in>N. {h \<otimes> x})"
paulson@14747
   423
      proof clarify
paulson@14747
   424
        fix n
paulson@14747
   425
        assume n: "n \<in> N" 
nipkow@15120
   426
        show "x \<otimes> n \<in> (\<Union>h\<in>N. {h \<otimes> x})"
paulson@14747
   427
        proof 
paulson@14963
   428
          show "x \<otimes> n \<otimes> inv x \<in> N" by (simp add: x n closed)
paulson@14963
   429
          show "x \<otimes> n \<in> {x \<otimes> n \<otimes> inv x \<otimes> x}"
paulson@14747
   430
            by (simp add: x n m_assoc sb [THEN subsetD])
paulson@14747
   431
        qed
paulson@14747
   432
      qed
paulson@14747
   433
    qed
paulson@14747
   434
  qed
paulson@14747
   435
qed
paulson@13870
   436
paulson@14963
   437
paulson@14803
   438
subsection{*More Properties of Cosets*}
paulson@14803
   439
paulson@14747
   440
lemma (in group) lcos_m_assoc:
paulson@14747
   441
     "[| M \<subseteq> carrier G; g \<in> carrier G; h \<in> carrier G |]
paulson@14747
   442
      ==> g <# (h <# M) = (g \<otimes> h) <# M"
paulson@14747
   443
by (force simp add: l_coset_def m_assoc)
paulson@13870
   444
paulson@14747
   445
lemma (in group) lcos_mult_one: "M \<subseteq> carrier G ==> \<one> <# M = M"
paulson@14747
   446
by (force simp add: l_coset_def)
paulson@13870
   447
paulson@14747
   448
lemma (in group) l_coset_subset_G:
paulson@14747
   449
     "[| H \<subseteq> carrier G; x \<in> carrier G |] ==> x <# H \<subseteq> carrier G"
paulson@14747
   450
by (auto simp add: l_coset_def subsetD)
paulson@14747
   451
paulson@14747
   452
lemma (in group) l_coset_swap:
paulson@14963
   453
     "\<lbrakk>y \<in> x <# H;  x \<in> carrier G;  subgroup H G\<rbrakk> \<Longrightarrow> x \<in> y <# H"
paulson@14963
   454
proof (simp add: l_coset_def)
paulson@14963
   455
  assume "\<exists>h\<in>H. y = x \<otimes> h"
wenzelm@14666
   456
    and x: "x \<in> carrier G"
paulson@14530
   457
    and sb: "subgroup H G"
paulson@14530
   458
  then obtain h' where h': "h' \<in> H & x \<otimes> h' = y" by blast
paulson@14963
   459
  show "\<exists>h\<in>H. x = y \<otimes> h"
paulson@14530
   460
  proof
paulson@14963
   461
    show "x = y \<otimes> inv h'" using h' x sb
paulson@14530
   462
      by (auto simp add: m_assoc subgroup.subset [THEN subsetD])
paulson@14530
   463
    show "inv h' \<in> H" using h' sb
paulson@14530
   464
      by (auto simp add: subgroup.subset [THEN subsetD] subgroup.m_inv_closed)
paulson@14530
   465
  qed
paulson@14530
   466
qed
paulson@14530
   467
paulson@14747
   468
lemma (in group) l_coset_carrier:
paulson@14530
   469
     "[| y \<in> x <# H;  x \<in> carrier G;  subgroup H G |] ==> y \<in> carrier G"
paulson@14747
   470
by (auto simp add: l_coset_def m_assoc
paulson@14530
   471
                   subgroup.subset [THEN subsetD] subgroup.m_closed)
paulson@14530
   472
paulson@14747
   473
lemma (in group) l_repr_imp_subset:
wenzelm@14666
   474
  assumes y: "y \<in> x <# H" and x: "x \<in> carrier G" and sb: "subgroup H G"
paulson@14530
   475
  shows "y <# H \<subseteq> x <# H"
paulson@14530
   476
proof -
paulson@14530
   477
  from y
paulson@14747
   478
  obtain h' where "h' \<in> H" "x \<otimes> h' = y" by (auto simp add: l_coset_def)
paulson@14530
   479
  thus ?thesis using x sb
paulson@14747
   480
    by (auto simp add: l_coset_def m_assoc
paulson@14530
   481
                       subgroup.subset [THEN subsetD] subgroup.m_closed)
paulson@14530
   482
qed
paulson@14530
   483
paulson@14747
   484
lemma (in group) l_repr_independence:
wenzelm@14666
   485
  assumes y: "y \<in> x <# H" and x: "x \<in> carrier G" and sb: "subgroup H G"
paulson@14530
   486
  shows "x <# H = y <# H"
wenzelm@14666
   487
proof
paulson@14530
   488
  show "x <# H \<subseteq> y <# H"
wenzelm@14666
   489
    by (rule l_repr_imp_subset,
paulson@14530
   490
        (blast intro: l_coset_swap l_coset_carrier y x sb)+)
wenzelm@14666
   491
  show "y <# H \<subseteq> x <# H" by (rule l_repr_imp_subset [OF y x sb])
paulson@14530
   492
qed
paulson@13870
   493
paulson@14747
   494
lemma (in group) setmult_subset_G:
paulson@14963
   495
     "\<lbrakk>H \<subseteq> carrier G; K \<subseteq> carrier G\<rbrakk> \<Longrightarrow> H <#> K \<subseteq> carrier G"
paulson@14963
   496
by (auto simp add: set_mult_def subsetD)
paulson@13870
   497
paulson@14963
   498
lemma (in group) subgroup_mult_id: "subgroup H G \<Longrightarrow> H <#> H = H"
paulson@14963
   499
apply (auto simp add: subgroup.m_closed set_mult_def Sigma_def image_def)
paulson@13870
   500
apply (rule_tac x = x in bexI)
paulson@13870
   501
apply (rule bexI [of _ "\<one>"])
wenzelm@14666
   502
apply (auto simp add: subgroup.m_closed subgroup.one_closed
paulson@13870
   503
                      r_one subgroup.subset [THEN subsetD])
paulson@13870
   504
done
paulson@13870
   505
paulson@13870
   506
ballarin@20318
   507
subsubsection {* Set of Inverses of an @{text r_coset}. *}
wenzelm@14666
   508
paulson@14963
   509
lemma (in normal) rcos_inv:
paulson@14963
   510
  assumes x:     "x \<in> carrier G"
paulson@14963
   511
  shows "set_inv (H #> x) = H #> (inv x)" 
paulson@14963
   512
proof (simp add: r_coset_def SET_INV_def x inv_mult_group, safe)
paulson@14963
   513
  fix h
paulson@14963
   514
  assume "h \<in> H"
nipkow@15120
   515
  show "inv x \<otimes> inv h \<in> (\<Union>j\<in>H. {j \<otimes> inv x})"
paulson@14963
   516
  proof
paulson@14963
   517
    show "inv x \<otimes> inv h \<otimes> x \<in> H"
paulson@14963
   518
      by (simp add: inv_op_closed1 prems)
paulson@14963
   519
    show "inv x \<otimes> inv h \<in> {inv x \<otimes> inv h \<otimes> x \<otimes> inv x}"
paulson@14963
   520
      by (simp add: prems m_assoc)
paulson@14963
   521
  qed
paulson@14963
   522
next
paulson@14963
   523
  fix h
paulson@14963
   524
  assume "h \<in> H"
nipkow@15120
   525
  show "h \<otimes> inv x \<in> (\<Union>j\<in>H. {inv x \<otimes> inv j})"
paulson@14963
   526
  proof
paulson@14963
   527
    show "x \<otimes> inv h \<otimes> inv x \<in> H"
paulson@14963
   528
      by (simp add: inv_op_closed2 prems)
paulson@14963
   529
    show "h \<otimes> inv x \<in> {inv x \<otimes> inv (x \<otimes> inv h \<otimes> inv x)}"
paulson@14963
   530
      by (simp add: prems m_assoc [symmetric] inv_mult_group)
paulson@13870
   531
  qed
paulson@13870
   532
qed
paulson@13870
   533
paulson@13870
   534
paulson@14803
   535
subsubsection {*Theorems for @{text "<#>"} with @{text "#>"} or @{text "<#"}.*}
wenzelm@14666
   536
paulson@14747
   537
lemma (in group) setmult_rcos_assoc:
paulson@14963
   538
     "\<lbrakk>H \<subseteq> carrier G; K \<subseteq> carrier G; x \<in> carrier G\<rbrakk>
paulson@14963
   539
      \<Longrightarrow> H <#> (K #> x) = (H <#> K) #> x"
paulson@14963
   540
by (force simp add: r_coset_def set_mult_def m_assoc)
paulson@13870
   541
paulson@14747
   542
lemma (in group) rcos_assoc_lcos:
paulson@14963
   543
     "\<lbrakk>H \<subseteq> carrier G; K \<subseteq> carrier G; x \<in> carrier G\<rbrakk>
paulson@14963
   544
      \<Longrightarrow> (H #> x) <#> K = H <#> (x <# K)"
paulson@14963
   545
by (force simp add: r_coset_def l_coset_def set_mult_def m_assoc)
paulson@13870
   546
paulson@14963
   547
lemma (in normal) rcos_mult_step1:
paulson@14963
   548
     "\<lbrakk>x \<in> carrier G; y \<in> carrier G\<rbrakk>
paulson@14963
   549
      \<Longrightarrow> (H #> x) <#> (H #> y) = (H <#> (x <# H)) #> y"
paulson@14963
   550
by (simp add: setmult_rcos_assoc subset
paulson@13870
   551
              r_coset_subset_G l_coset_subset_G rcos_assoc_lcos)
paulson@13870
   552
paulson@14963
   553
lemma (in normal) rcos_mult_step2:
paulson@14963
   554
     "\<lbrakk>x \<in> carrier G; y \<in> carrier G\<rbrakk>
paulson@14963
   555
      \<Longrightarrow> (H <#> (x <# H)) #> y = (H <#> (H #> x)) #> y"
paulson@14963
   556
by (insert coset_eq, simp add: normal_def)
paulson@13870
   557
paulson@14963
   558
lemma (in normal) rcos_mult_step3:
paulson@14963
   559
     "\<lbrakk>x \<in> carrier G; y \<in> carrier G\<rbrakk>
paulson@14963
   560
      \<Longrightarrow> (H <#> (H #> x)) #> y = H #> (x \<otimes> y)"
paulson@14963
   561
by (simp add: setmult_rcos_assoc coset_mult_assoc
ballarin@19931
   562
              subgroup_mult_id normal.axioms subset prems)
paulson@13870
   563
paulson@14963
   564
lemma (in normal) rcos_sum:
paulson@14963
   565
     "\<lbrakk>x \<in> carrier G; y \<in> carrier G\<rbrakk>
paulson@14963
   566
      \<Longrightarrow> (H #> x) <#> (H #> y) = H #> (x \<otimes> y)"
paulson@13870
   567
by (simp add: rcos_mult_step1 rcos_mult_step2 rcos_mult_step3)
paulson@13870
   568
paulson@14963
   569
lemma (in normal) rcosets_mult_eq: "M \<in> rcosets H \<Longrightarrow> H <#> M = M"
wenzelm@14666
   570
  -- {* generalizes @{text subgroup_mult_id} *}
paulson@14963
   571
  by (auto simp add: RCOSETS_def subset
ballarin@19931
   572
        setmult_rcos_assoc subgroup_mult_id normal.axioms prems)
paulson@14963
   573
paulson@14963
   574
paulson@14963
   575
subsubsection{*An Equivalence Relation*}
paulson@14963
   576
paulson@14963
   577
constdefs (structure G)
paulson@14963
   578
  r_congruent :: "[('a,'b)monoid_scheme, 'a set] \<Rightarrow> ('a*'a)set"
paulson@14963
   579
                  ("rcong\<index> _")
paulson@14963
   580
   "rcong H \<equiv> {(x,y). x \<in> carrier G & y \<in> carrier G & inv x \<otimes> y \<in> H}"
paulson@14963
   581
paulson@14963
   582
paulson@14963
   583
lemma (in subgroup) equiv_rcong:
paulson@14963
   584
   includes group G
paulson@14963
   585
   shows "equiv (carrier G) (rcong H)"
paulson@14963
   586
proof (intro equiv.intro)
paulson@14963
   587
  show "refl (carrier G) (rcong H)"
paulson@14963
   588
    by (auto simp add: r_congruent_def refl_def) 
paulson@14963
   589
next
paulson@14963
   590
  show "sym (rcong H)"
paulson@14963
   591
  proof (simp add: r_congruent_def sym_def, clarify)
paulson@14963
   592
    fix x y
paulson@14963
   593
    assume [simp]: "x \<in> carrier G" "y \<in> carrier G" 
paulson@14963
   594
       and "inv x \<otimes> y \<in> H"
paulson@14963
   595
    hence "inv (inv x \<otimes> y) \<in> H" by (simp add: m_inv_closed) 
paulson@14963
   596
    thus "inv y \<otimes> x \<in> H" by (simp add: inv_mult_group)
paulson@14963
   597
  qed
paulson@14963
   598
next
paulson@14963
   599
  show "trans (rcong H)"
paulson@14963
   600
  proof (simp add: r_congruent_def trans_def, clarify)
paulson@14963
   601
    fix x y z
paulson@14963
   602
    assume [simp]: "x \<in> carrier G" "y \<in> carrier G" "z \<in> carrier G"
paulson@14963
   603
       and "inv x \<otimes> y \<in> H" and "inv y \<otimes> z \<in> H"
paulson@14963
   604
    hence "(inv x \<otimes> y) \<otimes> (inv y \<otimes> z) \<in> H" by simp
paulson@14963
   605
    hence "inv x \<otimes> (y \<otimes> inv y) \<otimes> z \<in> H" by (simp add: m_assoc del: r_inv) 
paulson@14963
   606
    thus "inv x \<otimes> z \<in> H" by simp
paulson@14963
   607
  qed
paulson@14963
   608
qed
paulson@14963
   609
paulson@14963
   610
text{*Equivalence classes of @{text rcong} correspond to left cosets.
paulson@14963
   611
  Was there a mistake in the definitions? I'd have expected them to
paulson@14963
   612
  correspond to right cosets.*}
paulson@14963
   613
paulson@14963
   614
(* CB: This is correct, but subtle.
paulson@14963
   615
   We call H #> a the right coset of a relative to H.  According to
paulson@14963
   616
   Jacobson, this is what the majority of group theory literature does.
paulson@14963
   617
   He then defines the notion of congruence relation ~ over monoids as
paulson@14963
   618
   equivalence relation with a ~ a' & b ~ b' \<Longrightarrow> a*b ~ a'*b'.
paulson@14963
   619
   Our notion of right congruence induced by K: rcong K appears only in
paulson@14963
   620
   the context where K is a normal subgroup.  Jacobson doesn't name it.
paulson@14963
   621
   But in this context left and right cosets are identical.
paulson@14963
   622
*)
paulson@14963
   623
paulson@14963
   624
lemma (in subgroup) l_coset_eq_rcong:
paulson@14963
   625
  includes group G
paulson@14963
   626
  assumes a: "a \<in> carrier G"
paulson@14963
   627
  shows "a <# H = rcong H `` {a}"
paulson@14963
   628
by (force simp add: r_congruent_def l_coset_def m_assoc [symmetric] a ) 
paulson@13870
   629
paulson@13870
   630
ballarin@20318
   631
subsubsection{*Two Distinct Right Cosets are Disjoint*}
paulson@14803
   632
paulson@14803
   633
lemma (in group) rcos_equation:
paulson@14963
   634
  includes subgroup H G
paulson@14963
   635
  shows
paulson@14963
   636
     "\<lbrakk>ha \<otimes> a = h \<otimes> b; a \<in> carrier G;  b \<in> carrier G;  
paulson@14963
   637
        h \<in> H;  ha \<in> H;  hb \<in> H\<rbrakk>
paulson@14963
   638
      \<Longrightarrow> hb \<otimes> a \<in> (\<Union>h\<in>H. {h \<otimes> b})"
paulson@14963
   639
apply (rule UN_I [of "hb \<otimes> ((inv ha) \<otimes> h)"])
paulson@14963
   640
apply (simp add: ); 
paulson@14963
   641
apply (simp add: m_assoc transpose_inv)
paulson@14803
   642
done
paulson@14803
   643
paulson@14803
   644
lemma (in group) rcos_disjoint:
paulson@14963
   645
  includes subgroup H G
paulson@14963
   646
  shows "\<lbrakk>a \<in> rcosets H; b \<in> rcosets H; a\<noteq>b\<rbrakk> \<Longrightarrow> a \<inter> b = {}"
paulson@14963
   647
apply (simp add: RCOSETS_def r_coset_def)
paulson@14963
   648
apply (blast intro: rcos_equation prems sym)
paulson@14803
   649
done
paulson@14803
   650
ballarin@20318
   651
subsection {* Further lemmas for @{text "r_congruent"} *}
ballarin@20318
   652
ballarin@20318
   653
text {* The relation is a congruence *}
ballarin@20318
   654
ballarin@20318
   655
lemma (in normal) congruent_rcong:
ballarin@20318
   656
  shows "congruent2 (rcong H) (rcong H) (\<lambda>a b. a \<otimes> b <# H)"
ballarin@20318
   657
proof (intro congruent2I[of "carrier G" _ "carrier G" _] equiv_rcong is_group)
ballarin@20318
   658
  fix a b c
ballarin@20318
   659
  assume abrcong: "(a, b) \<in> rcong H"
ballarin@20318
   660
    and ccarr: "c \<in> carrier G"
ballarin@20318
   661
ballarin@20318
   662
  from abrcong
ballarin@20318
   663
      have acarr: "a \<in> carrier G"
ballarin@20318
   664
        and bcarr: "b \<in> carrier G"
ballarin@20318
   665
        and abH: "inv a \<otimes> b \<in> H"
ballarin@20318
   666
      unfolding r_congruent_def
ballarin@20318
   667
      by fast+
ballarin@20318
   668
ballarin@20318
   669
  note carr = acarr bcarr ccarr
ballarin@20318
   670
ballarin@20318
   671
  from ccarr and abH
ballarin@20318
   672
      have "inv c \<otimes> (inv a \<otimes> b) \<otimes> c \<in> H" by (rule inv_op_closed1)
ballarin@20318
   673
  moreover
ballarin@20318
   674
      from carr and inv_closed
ballarin@20318
   675
      have "inv c \<otimes> (inv a \<otimes> b) \<otimes> c = (inv c \<otimes> inv a) \<otimes> (b \<otimes> c)" 
ballarin@20318
   676
      by (force cong: m_assoc)
ballarin@20318
   677
  moreover 
ballarin@20318
   678
      from carr and inv_closed
ballarin@20318
   679
      have "\<dots> = (inv (a \<otimes> c)) \<otimes> (b \<otimes> c)"
ballarin@20318
   680
      by (simp add: inv_mult_group)
ballarin@20318
   681
  ultimately
ballarin@20318
   682
      have "(inv (a \<otimes> c)) \<otimes> (b \<otimes> c) \<in> H" by simp
ballarin@20318
   683
  from carr and this
ballarin@20318
   684
     have "(b \<otimes> c) \<in> (a \<otimes> c) <# H"
ballarin@20318
   685
     by (simp add: lcos_module_rev[OF is_group])
ballarin@20318
   686
  from carr and this and is_subgroup
ballarin@20318
   687
     show "(a \<otimes> c) <# H = (b \<otimes> c) <# H" by (intro l_repr_independence, simp+)
ballarin@20318
   688
next
ballarin@20318
   689
  fix a b c
ballarin@20318
   690
  assume abrcong: "(a, b) \<in> rcong H"
ballarin@20318
   691
    and ccarr: "c \<in> carrier G"
ballarin@20318
   692
ballarin@20318
   693
  from ccarr have "c \<in> Units G" by (simp add: Units_eq)
ballarin@20318
   694
  hence cinvc_one: "inv c \<otimes> c = \<one>" by (rule Units_l_inv)
ballarin@20318
   695
ballarin@20318
   696
  from abrcong
ballarin@20318
   697
      have acarr: "a \<in> carrier G"
ballarin@20318
   698
       and bcarr: "b \<in> carrier G"
ballarin@20318
   699
       and abH: "inv a \<otimes> b \<in> H"
ballarin@20318
   700
      by (unfold r_congruent_def, fast+)
ballarin@20318
   701
ballarin@20318
   702
  note carr = acarr bcarr ccarr
ballarin@20318
   703
ballarin@20318
   704
  from carr and inv_closed
ballarin@20318
   705
     have "inv a \<otimes> b = inv a \<otimes> (\<one> \<otimes> b)" by simp
ballarin@20318
   706
  also from carr and inv_closed
ballarin@20318
   707
      have "\<dots> = inv a \<otimes> (inv c \<otimes> c) \<otimes> b" by simp
ballarin@20318
   708
  also from carr and inv_closed
ballarin@20318
   709
      have "\<dots> = (inv a \<otimes> inv c) \<otimes> (c \<otimes> b)" by (force cong: m_assoc)
ballarin@20318
   710
  also from carr and inv_closed
ballarin@20318
   711
      have "\<dots> = inv (c \<otimes> a) \<otimes> (c \<otimes> b)" by (simp add: inv_mult_group)
ballarin@20318
   712
  finally
ballarin@20318
   713
      have "inv a \<otimes> b = inv (c \<otimes> a) \<otimes> (c \<otimes> b)" .
ballarin@20318
   714
  from abH and this
ballarin@20318
   715
      have "inv (c \<otimes> a) \<otimes> (c \<otimes> b) \<in> H" by simp
ballarin@20318
   716
ballarin@20318
   717
  from carr and this
ballarin@20318
   718
     have "(c \<otimes> b) \<in> (c \<otimes> a) <# H"
ballarin@20318
   719
     by (simp add: lcos_module_rev[OF is_group])
ballarin@20318
   720
  from carr and this and is_subgroup
ballarin@20318
   721
     show "(c \<otimes> a) <# H = (c \<otimes> b) <# H" by (intro l_repr_independence, simp+)
ballarin@20318
   722
qed
ballarin@20318
   723
paulson@14803
   724
paulson@14803
   725
subsection {*Order of a Group and Lagrange's Theorem*}
paulson@14803
   726
paulson@14803
   727
constdefs
paulson@14963
   728
  order :: "('a, 'b) monoid_scheme \<Rightarrow> nat"
paulson@14963
   729
  "order S \<equiv> card (carrier S)"
paulson@13870
   730
paulson@14963
   731
lemma (in group) rcos_self:
paulson@14963
   732
  includes subgroup
paulson@14963
   733
  shows "x \<in> carrier G \<Longrightarrow> x \<in> H #> x"
paulson@14963
   734
apply (simp add: r_coset_def)
paulson@14963
   735
apply (rule_tac x="\<one>" in bexI) 
paulson@14963
   736
apply (auto simp add: ); 
paulson@14963
   737
done
paulson@14963
   738
paulson@14963
   739
lemma (in group) rcosets_part_G:
paulson@14963
   740
  includes subgroup
paulson@14963
   741
  shows "\<Union>(rcosets H) = carrier G"
paulson@13870
   742
apply (rule equalityI)
paulson@14963
   743
 apply (force simp add: RCOSETS_def r_coset_def)
paulson@14963
   744
apply (auto simp add: RCOSETS_def intro: rcos_self prems)
paulson@13870
   745
done
paulson@13870
   746
paulson@14747
   747
lemma (in group) cosets_finite:
paulson@14963
   748
     "\<lbrakk>c \<in> rcosets H;  H \<subseteq> carrier G;  finite (carrier G)\<rbrakk> \<Longrightarrow> finite c"
paulson@14963
   749
apply (auto simp add: RCOSETS_def)
paulson@14963
   750
apply (simp add: r_coset_subset_G [THEN finite_subset])
paulson@13870
   751
done
paulson@13870
   752
paulson@14747
   753
text{*The next two lemmas support the proof of @{text card_cosets_equal}.*}
paulson@14747
   754
lemma (in group) inj_on_f:
paulson@14963
   755
    "\<lbrakk>H \<subseteq> carrier G;  a \<in> carrier G\<rbrakk> \<Longrightarrow> inj_on (\<lambda>y. y \<otimes> inv a) (H #> a)"
paulson@13870
   756
apply (rule inj_onI)
paulson@13870
   757
apply (subgoal_tac "x \<in> carrier G & y \<in> carrier G")
paulson@13870
   758
 prefer 2 apply (blast intro: r_coset_subset_G [THEN subsetD])
paulson@13870
   759
apply (simp add: subsetD)
paulson@13870
   760
done
paulson@13870
   761
paulson@14747
   762
lemma (in group) inj_on_g:
paulson@14963
   763
    "\<lbrakk>H \<subseteq> carrier G;  a \<in> carrier G\<rbrakk> \<Longrightarrow> inj_on (\<lambda>y. y \<otimes> a) H"
paulson@13870
   764
by (force simp add: inj_on_def subsetD)
paulson@13870
   765
paulson@14747
   766
lemma (in group) card_cosets_equal:
paulson@14963
   767
     "\<lbrakk>c \<in> rcosets H;  H \<subseteq> carrier G; finite(carrier G)\<rbrakk>
paulson@14963
   768
      \<Longrightarrow> card c = card H"
paulson@14963
   769
apply (auto simp add: RCOSETS_def)
paulson@13870
   770
apply (rule card_bij_eq)
wenzelm@14666
   771
     apply (rule inj_on_f, assumption+)
paulson@14747
   772
    apply (force simp add: m_assoc subsetD r_coset_def)
wenzelm@14666
   773
   apply (rule inj_on_g, assumption+)
paulson@14747
   774
  apply (force simp add: m_assoc subsetD r_coset_def)
paulson@13870
   775
 txt{*The sets @{term "H #> a"} and @{term "H"} are finite.*}
paulson@13870
   776
 apply (simp add: r_coset_subset_G [THEN finite_subset])
paulson@13870
   777
apply (blast intro: finite_subset)
paulson@13870
   778
done
paulson@13870
   779
paulson@14963
   780
lemma (in group) rcosets_subset_PowG:
paulson@14963
   781
     "subgroup H G  \<Longrightarrow> rcosets H \<subseteq> Pow(carrier G)"
paulson@14963
   782
apply (simp add: RCOSETS_def)
paulson@13870
   783
apply (blast dest: r_coset_subset_G subgroup.subset)
paulson@13870
   784
done
paulson@13870
   785
paulson@14803
   786
paulson@14803
   787
theorem (in group) lagrange:
paulson@14963
   788
     "\<lbrakk>finite(carrier G); subgroup H G\<rbrakk>
paulson@14963
   789
      \<Longrightarrow> card(rcosets H) * card(H) = order(G)"
paulson@14963
   790
apply (simp (no_asm_simp) add: order_def rcosets_part_G [symmetric])
paulson@14803
   791
apply (subst mult_commute)
paulson@14803
   792
apply (rule card_partition)
paulson@14963
   793
   apply (simp add: rcosets_subset_PowG [THEN finite_subset])
paulson@14963
   794
  apply (simp add: rcosets_part_G)
paulson@14803
   795
 apply (simp add: card_cosets_equal subgroup.subset)
paulson@14803
   796
apply (simp add: rcos_disjoint)
paulson@14803
   797
done
paulson@14803
   798
paulson@14803
   799
paulson@14747
   800
subsection {*Quotient Groups: Factorization of a Group*}
paulson@13870
   801
paulson@13870
   802
constdefs
paulson@14963
   803
  FactGroup :: "[('a,'b) monoid_scheme, 'a set] \<Rightarrow> ('a set) monoid"
paulson@14803
   804
     (infixl "Mod" 65)
paulson@14747
   805
    --{*Actually defined for groups rather than monoids*}
paulson@14963
   806
  "FactGroup G H \<equiv>
paulson@14963
   807
    \<lparr>carrier = rcosets\<^bsub>G\<^esub> H, mult = set_mult G, one = H\<rparr>"
paulson@14747
   808
paulson@14963
   809
lemma (in normal) setmult_closed:
paulson@14963
   810
     "\<lbrakk>K1 \<in> rcosets H; K2 \<in> rcosets H\<rbrakk> \<Longrightarrow> K1 <#> K2 \<in> rcosets H"
paulson@14963
   811
by (auto simp add: rcos_sum RCOSETS_def)
paulson@13870
   812
paulson@14963
   813
lemma (in normal) setinv_closed:
paulson@14963
   814
     "K \<in> rcosets H \<Longrightarrow> set_inv K \<in> rcosets H"
paulson@14963
   815
by (auto simp add: rcos_inv RCOSETS_def)
ballarin@13889
   816
paulson@14963
   817
lemma (in normal) rcosets_assoc:
paulson@14963
   818
     "\<lbrakk>M1 \<in> rcosets H; M2 \<in> rcosets H; M3 \<in> rcosets H\<rbrakk>
paulson@14963
   819
      \<Longrightarrow> M1 <#> M2 <#> M3 = M1 <#> (M2 <#> M3)"
paulson@14963
   820
by (auto simp add: RCOSETS_def rcos_sum m_assoc)
paulson@13870
   821
paulson@14963
   822
lemma (in subgroup) subgroup_in_rcosets:
paulson@14963
   823
  includes group G
paulson@14963
   824
  shows "H \<in> rcosets H"
ballarin@13889
   825
proof -
wenzelm@23350
   826
  from _ `subgroup H G` have "H #> \<one> = H"
wenzelm@23350
   827
    by (rule coset_join2) auto
ballarin@13889
   828
  then show ?thesis
paulson@14963
   829
    by (auto simp add: RCOSETS_def)
ballarin@13889
   830
qed
ballarin@13889
   831
paulson@14963
   832
lemma (in normal) rcosets_inv_mult_group_eq:
paulson@14963
   833
     "M \<in> rcosets H \<Longrightarrow> set_inv M <#> M = H"
ballarin@19931
   834
by (auto simp add: RCOSETS_def rcos_inv rcos_sum subgroup.subset normal.axioms prems)
ballarin@13889
   835
paulson@14963
   836
theorem (in normal) factorgroup_is_group:
paulson@14963
   837
  "group (G Mod H)"
wenzelm@14666
   838
apply (simp add: FactGroup_def)
ballarin@13936
   839
apply (rule groupI)
paulson@14747
   840
    apply (simp add: setmult_closed)
paulson@14963
   841
   apply (simp add: normal_imp_subgroup subgroup_in_rcosets [OF is_group])
paulson@14963
   842
  apply (simp add: restrictI setmult_closed rcosets_assoc)
ballarin@13889
   843
 apply (simp add: normal_imp_subgroup
paulson@14963
   844
                  subgroup_in_rcosets rcosets_mult_eq)
paulson@14963
   845
apply (auto dest: rcosets_inv_mult_group_eq simp add: setinv_closed)
ballarin@13889
   846
done
ballarin@13889
   847
paulson@14803
   848
lemma mult_FactGroup [simp]: "X \<otimes>\<^bsub>(G Mod H)\<^esub> X' = X <#>\<^bsub>G\<^esub> X'"
paulson@14803
   849
  by (simp add: FactGroup_def) 
paulson@14803
   850
paulson@14963
   851
lemma (in normal) inv_FactGroup:
paulson@14963
   852
     "X \<in> carrier (G Mod H) \<Longrightarrow> inv\<^bsub>G Mod H\<^esub> X = set_inv X"
paulson@14747
   853
apply (rule group.inv_equality [OF factorgroup_is_group]) 
paulson@14963
   854
apply (simp_all add: FactGroup_def setinv_closed rcosets_inv_mult_group_eq)
paulson@14747
   855
done
paulson@14747
   856
paulson@14747
   857
text{*The coset map is a homomorphism from @{term G} to the quotient group
paulson@14963
   858
  @{term "G Mod H"}*}
paulson@14963
   859
lemma (in normal) r_coset_hom_Mod:
paulson@14963
   860
  "(\<lambda>a. H #> a) \<in> hom G (G Mod H)"
paulson@14963
   861
  by (auto simp add: FactGroup_def RCOSETS_def Pi_def hom_def rcos_sum)
paulson@14747
   862
paulson@14963
   863
 
paulson@14963
   864
subsection{*The First Isomorphism Theorem*}
paulson@14803
   865
paulson@14963
   866
text{*The quotient by the kernel of a homomorphism is isomorphic to the 
paulson@14963
   867
  range of that homomorphism.*}
paulson@14803
   868
paulson@14803
   869
constdefs
paulson@14963
   870
  kernel :: "('a, 'm) monoid_scheme \<Rightarrow> ('b, 'n) monoid_scheme \<Rightarrow> 
paulson@14963
   871
             ('a \<Rightarrow> 'b) \<Rightarrow> 'a set" 
paulson@14803
   872
    --{*the kernel of a homomorphism*}
paulson@14963
   873
  "kernel G H h \<equiv> {x. x \<in> carrier G & h x = \<one>\<^bsub>H\<^esub>}";
paulson@14803
   874
paulson@14803
   875
lemma (in group_hom) subgroup_kernel: "subgroup (kernel G H h) G"
paulson@14963
   876
apply (rule subgroup.intro) 
paulson@14803
   877
apply (auto simp add: kernel_def group.intro prems) 
paulson@14803
   878
done
paulson@14803
   879
paulson@14803
   880
text{*The kernel of a homomorphism is a normal subgroup*}
paulson@14963
   881
lemma (in group_hom) normal_kernel: "(kernel G H h) \<lhd> G"
ballarin@19931
   882
apply (simp add: G.normal_inv_iff subgroup_kernel)
ballarin@19931
   883
apply (simp add: kernel_def)
paulson@14803
   884
done
paulson@14803
   885
paulson@14803
   886
lemma (in group_hom) FactGroup_nonempty:
paulson@14803
   887
  assumes X: "X \<in> carrier (G Mod kernel G H h)"
paulson@14803
   888
  shows "X \<noteq> {}"
paulson@14803
   889
proof -
paulson@14803
   890
  from X
paulson@14803
   891
  obtain g where "g \<in> carrier G" 
paulson@14803
   892
             and "X = kernel G H h #> g"
paulson@14963
   893
    by (auto simp add: FactGroup_def RCOSETS_def)
paulson@14803
   894
  thus ?thesis 
paulson@14963
   895
   by (auto simp add: kernel_def r_coset_def image_def intro: hom_one)
paulson@14803
   896
qed
paulson@14803
   897
paulson@14803
   898
paulson@14803
   899
lemma (in group_hom) FactGroup_contents_mem:
paulson@14803
   900
  assumes X: "X \<in> carrier (G Mod (kernel G H h))"
paulson@14803
   901
  shows "contents (h`X) \<in> carrier H"
paulson@14803
   902
proof -
paulson@14803
   903
  from X
paulson@14803
   904
  obtain g where g: "g \<in> carrier G" 
paulson@14803
   905
             and "X = kernel G H h #> g"
paulson@14963
   906
    by (auto simp add: FactGroup_def RCOSETS_def)
paulson@14963
   907
  hence "h ` X = {h g}" by (auto simp add: kernel_def r_coset_def image_def g)
paulson@14803
   908
  thus ?thesis by (auto simp add: g)
paulson@14803
   909
qed
paulson@14803
   910
paulson@14803
   911
lemma (in group_hom) FactGroup_hom:
paulson@14963
   912
     "(\<lambda>X. contents (h`X)) \<in> hom (G Mod (kernel G H h)) H"
paulson@14963
   913
apply (simp add: hom_def FactGroup_contents_mem  normal.factorgroup_is_group [OF normal_kernel] group.axioms monoid.m_closed)  
paulson@14803
   914
proof (simp add: hom_def funcsetI FactGroup_contents_mem, intro ballI) 
paulson@14803
   915
  fix X and X'
paulson@14803
   916
  assume X:  "X  \<in> carrier (G Mod kernel G H h)"
paulson@14803
   917
     and X': "X' \<in> carrier (G Mod kernel G H h)"
paulson@14803
   918
  then
paulson@14803
   919
  obtain g and g'
paulson@14803
   920
           where "g \<in> carrier G" and "g' \<in> carrier G" 
paulson@14803
   921
             and "X = kernel G H h #> g" and "X' = kernel G H h #> g'"
paulson@14963
   922
    by (auto simp add: FactGroup_def RCOSETS_def)
paulson@14803
   923
  hence all: "\<forall>x\<in>X. h x = h g" "\<forall>x\<in>X'. h x = h g'" 
paulson@14803
   924
    and Xsub: "X \<subseteq> carrier G" and X'sub: "X' \<subseteq> carrier G"
paulson@14803
   925
    by (force simp add: kernel_def r_coset_def image_def)+
paulson@14803
   926
  hence "h ` (X <#> X') = {h g \<otimes>\<^bsub>H\<^esub> h g'}" using X X'
paulson@14803
   927
    by (auto dest!: FactGroup_nonempty
paulson@14803
   928
             simp add: set_mult_def image_eq_UN 
paulson@14803
   929
                       subsetD [OF Xsub] subsetD [OF X'sub]) 
paulson@14803
   930
  thus "contents (h ` (X <#> X')) = contents (h ` X) \<otimes>\<^bsub>H\<^esub> contents (h ` X')"
paulson@14803
   931
    by (simp add: all image_eq_UN FactGroup_nonempty X X')  
paulson@14803
   932
qed
paulson@14803
   933
paulson@14963
   934
paulson@14803
   935
text{*Lemma for the following injectivity result*}
paulson@14803
   936
lemma (in group_hom) FactGroup_subset:
paulson@14963
   937
     "\<lbrakk>g \<in> carrier G; g' \<in> carrier G; h g = h g'\<rbrakk>
paulson@14963
   938
      \<Longrightarrow>  kernel G H h #> g \<subseteq> kernel G H h #> g'"
paulson@14803
   939
apply (clarsimp simp add: kernel_def r_coset_def image_def);
paulson@14803
   940
apply (rename_tac y)  
paulson@14803
   941
apply (rule_tac x="y \<otimes> g \<otimes> inv g'" in exI) 
paulson@14803
   942
apply (simp add: G.m_assoc); 
paulson@14803
   943
done
paulson@14803
   944
paulson@14803
   945
lemma (in group_hom) FactGroup_inj_on:
paulson@14803
   946
     "inj_on (\<lambda>X. contents (h ` X)) (carrier (G Mod kernel G H h))"
paulson@14803
   947
proof (simp add: inj_on_def, clarify) 
paulson@14803
   948
  fix X and X'
paulson@14803
   949
  assume X:  "X  \<in> carrier (G Mod kernel G H h)"
paulson@14803
   950
     and X': "X' \<in> carrier (G Mod kernel G H h)"
paulson@14803
   951
  then
paulson@14803
   952
  obtain g and g'
paulson@14803
   953
           where gX: "g \<in> carrier G"  "g' \<in> carrier G" 
paulson@14803
   954
              "X = kernel G H h #> g" "X' = kernel G H h #> g'"
paulson@14963
   955
    by (auto simp add: FactGroup_def RCOSETS_def)
paulson@14803
   956
  hence all: "\<forall>x\<in>X. h x = h g" "\<forall>x\<in>X'. h x = h g'" 
paulson@14803
   957
    by (force simp add: kernel_def r_coset_def image_def)+
paulson@14803
   958
  assume "contents (h ` X) = contents (h ` X')"
paulson@14803
   959
  hence h: "h g = h g'"
paulson@14803
   960
    by (simp add: image_eq_UN all FactGroup_nonempty X X') 
paulson@14803
   961
  show "X=X'" by (rule equalityI) (simp_all add: FactGroup_subset h gX) 
paulson@14803
   962
qed
paulson@14803
   963
paulson@14803
   964
text{*If the homomorphism @{term h} is onto @{term H}, then so is the
paulson@14803
   965
homomorphism from the quotient group*}
paulson@14803
   966
lemma (in group_hom) FactGroup_onto:
paulson@14803
   967
  assumes h: "h ` carrier G = carrier H"
paulson@14803
   968
  shows "(\<lambda>X. contents (h ` X)) ` carrier (G Mod kernel G H h) = carrier H"
paulson@14803
   969
proof
paulson@14803
   970
  show "(\<lambda>X. contents (h ` X)) ` carrier (G Mod kernel G H h) \<subseteq> carrier H"
paulson@14803
   971
    by (auto simp add: FactGroup_contents_mem)
paulson@14803
   972
  show "carrier H \<subseteq> (\<lambda>X. contents (h ` X)) ` carrier (G Mod kernel G H h)"
paulson@14803
   973
  proof
paulson@14803
   974
    fix y
paulson@14803
   975
    assume y: "y \<in> carrier H"
paulson@14803
   976
    with h obtain g where g: "g \<in> carrier G" "h g = y"
paulson@14803
   977
      by (blast elim: equalityE); 
nipkow@15120
   978
    hence "(\<Union>x\<in>kernel G H h #> g. {h x}) = {y}" 
paulson@14803
   979
      by (auto simp add: y kernel_def r_coset_def) 
paulson@14803
   980
    with g show "y \<in> (\<lambda>X. contents (h ` X)) ` carrier (G Mod kernel G H h)" 
paulson@14963
   981
      by (auto intro!: bexI simp add: FactGroup_def RCOSETS_def image_eq_UN)
paulson@14803
   982
  qed
paulson@14803
   983
qed
paulson@14803
   984
paulson@14803
   985
paulson@14803
   986
text{*If @{term h} is a homomorphism from @{term G} onto @{term H}, then the
paulson@14803
   987
 quotient group @{term "G Mod (kernel G H h)"} is isomorphic to @{term H}.*}
paulson@14803
   988
theorem (in group_hom) FactGroup_iso:
paulson@14803
   989
  "h ` carrier G = carrier H
paulson@14963
   990
   \<Longrightarrow> (\<lambda>X. contents (h`X)) \<in> (G Mod (kernel G H h)) \<cong> H"
paulson@14803
   991
by (simp add: iso_def FactGroup_hom FactGroup_inj_on bij_betw_def 
paulson@14803
   992
              FactGroup_onto) 
paulson@14803
   993
paulson@14963
   994
paulson@13870
   995
end