src/HOL/Old_Number_Theory/Gauss.thy
author haftmann
Fri Nov 27 08:41:10 2009 +0100 (2009-11-27)
changeset 33963 977b94b64905
parent 32479 521cc9bf2958
child 38159 e9b4835a54ee
permissions -rw-r--r--
renamed former datatype.ML to datatype_data.ML; datatype.ML provides uniform view on datatype.ML and datatype_rep_proofs.ML
paulson@13871
     1
(*  Title:      HOL/Quadratic_Reciprocity/Gauss.thy
kleing@14981
     2
    ID:         $Id$
paulson@13871
     3
    Authors:    Jeremy Avigad, David Gray, and Adam Kramer)
paulson@13871
     4
*)
paulson@13871
     5
paulson@13871
     6
header {* Gauss' Lemma *}
paulson@13871
     7
haftmann@27556
     8
theory Gauss
haftmann@27556
     9
imports Euler
haftmann@27556
    10
begin
paulson@13871
    11
paulson@13871
    12
locale GAUSS =
paulson@13871
    13
  fixes p :: "int"
paulson@13871
    14
  fixes a :: "int"
paulson@13871
    15
nipkow@16663
    16
  assumes p_prime: "zprime p"
paulson@13871
    17
  assumes p_g_2: "2 < p"
paulson@13871
    18
  assumes p_a_relprime: "~[a = 0](mod p)"
paulson@13871
    19
  assumes a_nonzero:    "0 < a"
wenzelm@21233
    20
begin
paulson@13871
    21
wenzelm@21233
    22
definition
wenzelm@21404
    23
  A :: "int set" where
wenzelm@21233
    24
  "A = {(x::int). 0 < x & x \<le> ((p - 1) div 2)}"
wenzelm@21233
    25
wenzelm@21404
    26
definition
wenzelm@21404
    27
  B :: "int set" where
wenzelm@21233
    28
  "B = (%x. x * a) ` A"
wenzelm@21233
    29
wenzelm@21404
    30
definition
wenzelm@21404
    31
  C :: "int set" where
wenzelm@21233
    32
  "C = StandardRes p ` B"
wenzelm@21233
    33
wenzelm@21404
    34
definition
wenzelm@21404
    35
  D :: "int set" where
wenzelm@21233
    36
  "D = C \<inter> {x. x \<le> ((p - 1) div 2)}"
wenzelm@21233
    37
wenzelm@21404
    38
definition
wenzelm@21404
    39
  E :: "int set" where
wenzelm@21233
    40
  "E = C \<inter> {x. ((p - 1) div 2) < x}"
wenzelm@21233
    41
wenzelm@21404
    42
definition
wenzelm@21404
    43
  F :: "int set" where
wenzelm@21233
    44
  "F = (%x. (p - x)) ` E"
wenzelm@21233
    45
paulson@13871
    46
paulson@13871
    47
subsection {* Basic properties of p *}
paulson@13871
    48
wenzelm@21233
    49
lemma p_odd: "p \<in> zOdd"
paulson@13871
    50
  by (auto simp add: p_prime p_g_2 zprime_zOdd_eq_grt_2)
paulson@13871
    51
wenzelm@21233
    52
lemma p_g_0: "0 < p"
wenzelm@18369
    53
  using p_g_2 by auto
paulson@13871
    54
wenzelm@21233
    55
lemma int_nat: "int (nat ((p - 1) div 2)) = (p - 1) div 2"
wenzelm@26289
    56
  using ListMem.insert p_g_2 by (auto simp add: pos_imp_zdiv_nonneg_iff)
paulson@13871
    57
wenzelm@21233
    58
lemma p_minus_one_l: "(p - 1) div 2 < p"
wenzelm@18369
    59
proof -
wenzelm@18369
    60
  have "(p - 1) div 2 \<le> (p - 1) div 1"
wenzelm@18369
    61
    by (rule zdiv_mono2) (auto simp add: p_g_0)
wenzelm@18369
    62
  also have "\<dots> = p - 1" by simp
wenzelm@18369
    63
  finally show ?thesis by simp
wenzelm@18369
    64
qed
paulson@13871
    65
wenzelm@21233
    66
lemma p_eq: "p = (2 * (p - 1) div 2) + 1"
nipkow@30034
    67
  using div_mult_self1_is_id [of 2 "p - 1"] by auto
paulson@13871
    68
wenzelm@21233
    69
wenzelm@21288
    70
lemma (in -) zodd_imp_zdiv_eq: "x \<in> zOdd ==> 2 * (x - 1) div 2 = 2 * ((x - 1) div 2)"
paulson@13871
    71
  apply (frule odd_minus_one_even)
paulson@13871
    72
  apply (simp add: zEven_def)
paulson@13871
    73
  apply (subgoal_tac "2 \<noteq> 0")
nipkow@30034
    74
  apply (frule_tac b = "2 :: int" and a = "x - 1" in div_mult_self1_is_id)
wenzelm@18369
    75
  apply (auto simp add: even_div_2_prop2)
wenzelm@18369
    76
  done
paulson@13871
    77
wenzelm@21233
    78
wenzelm@21233
    79
lemma p_eq2: "p = (2 * ((p - 1) div 2)) + 1"
paulson@13871
    80
  apply (insert p_eq p_prime p_g_2 zprime_zOdd_eq_grt_2 [of p], auto)
wenzelm@18369
    81
  apply (frule zodd_imp_zdiv_eq, auto)
wenzelm@18369
    82
  done
paulson@13871
    83
wenzelm@21233
    84
paulson@13871
    85
subsection {* Basic Properties of the Gauss Sets *}
paulson@13871
    86
wenzelm@21233
    87
lemma finite_A: "finite (A)"
wenzelm@18369
    88
  apply (auto simp add: A_def)
wenzelm@18369
    89
  apply (subgoal_tac "{x. 0 < x & x \<le> (p - 1) div 2} \<subseteq> {x. 0 \<le> x & x < 1 + (p - 1) div 2}")
wenzelm@18369
    90
  apply (auto simp add: bdd_int_set_l_finite finite_subset)
wenzelm@18369
    91
  done
paulson@13871
    92
wenzelm@21233
    93
lemma finite_B: "finite (B)"
paulson@13871
    94
  by (auto simp add: B_def finite_A finite_imageI)
paulson@13871
    95
wenzelm@21233
    96
lemma finite_C: "finite (C)"
paulson@13871
    97
  by (auto simp add: C_def finite_B finite_imageI)
paulson@13871
    98
wenzelm@21233
    99
lemma finite_D: "finite (D)"
paulson@13871
   100
  by (auto simp add: D_def finite_Int finite_C)
paulson@13871
   101
wenzelm@21233
   102
lemma finite_E: "finite (E)"
paulson@13871
   103
  by (auto simp add: E_def finite_Int finite_C)
paulson@13871
   104
wenzelm@21233
   105
lemma finite_F: "finite (F)"
paulson@13871
   106
  by (auto simp add: F_def finite_E finite_imageI)
paulson@13871
   107
wenzelm@21233
   108
lemma C_eq: "C = D \<union> E"
paulson@13871
   109
  by (auto simp add: C_def D_def E_def)
paulson@13871
   110
wenzelm@21233
   111
lemma A_card_eq: "card A = nat ((p - 1) div 2)"
wenzelm@18369
   112
  apply (auto simp add: A_def)
paulson@13871
   113
  apply (insert int_nat)
paulson@13871
   114
  apply (erule subst)
wenzelm@18369
   115
  apply (auto simp add: card_bdd_int_set_l_le)
wenzelm@18369
   116
  done
paulson@13871
   117
wenzelm@21233
   118
lemma inj_on_xa_A: "inj_on (%x. x * a) A"
wenzelm@18369
   119
  using a_nonzero by (simp add: A_def inj_on_def)
paulson@13871
   120
wenzelm@21233
   121
lemma A_res: "ResSet p A"
wenzelm@18369
   122
  apply (auto simp add: A_def ResSet_def)
wenzelm@18369
   123
  apply (rule_tac m = p in zcong_less_eq)
wenzelm@18369
   124
  apply (insert p_g_2, auto)
wenzelm@18369
   125
  done
paulson@13871
   126
wenzelm@21233
   127
lemma B_res: "ResSet p B"
paulson@13871
   128
  apply (insert p_g_2 p_a_relprime p_minus_one_l)
wenzelm@18369
   129
  apply (auto simp add: B_def)
paulson@13871
   130
  apply (rule ResSet_image)
wenzelm@18369
   131
  apply (auto simp add: A_res)
paulson@13871
   132
  apply (auto simp add: A_def)
wenzelm@18369
   133
proof -
wenzelm@18369
   134
  fix x fix y
wenzelm@18369
   135
  assume a: "[x * a = y * a] (mod p)"
wenzelm@18369
   136
  assume b: "0 < x"
wenzelm@18369
   137
  assume c: "x \<le> (p - 1) div 2"
wenzelm@18369
   138
  assume d: "0 < y"
wenzelm@18369
   139
  assume e: "y \<le> (p - 1) div 2"
wenzelm@18369
   140
  from a p_a_relprime p_prime a_nonzero zcong_cancel [of p a x y]
wenzelm@18369
   141
  have "[x = y](mod p)"
wenzelm@18369
   142
    by (simp add: zprime_imp_zrelprime zcong_def p_g_0 order_le_less)
wenzelm@18369
   143
  with zcong_less_eq [of x y p] p_minus_one_l
wenzelm@18369
   144
      order_le_less_trans [of x "(p - 1) div 2" p]
wenzelm@18369
   145
      order_le_less_trans [of y "(p - 1) div 2" p] show "x = y"
wenzelm@18369
   146
    by (simp add: prems p_minus_one_l p_g_0)
wenzelm@18369
   147
qed
paulson@13871
   148
wenzelm@21233
   149
lemma SR_B_inj: "inj_on (StandardRes p) B"
paulson@13871
   150
  apply (auto simp add: B_def StandardRes_def inj_on_def A_def prems)
wenzelm@18369
   151
proof -
wenzelm@18369
   152
  fix x fix y
wenzelm@18369
   153
  assume a: "x * a mod p = y * a mod p"
wenzelm@18369
   154
  assume b: "0 < x"
wenzelm@18369
   155
  assume c: "x \<le> (p - 1) div 2"
wenzelm@18369
   156
  assume d: "0 < y"
wenzelm@18369
   157
  assume e: "y \<le> (p - 1) div 2"
wenzelm@18369
   158
  assume f: "x \<noteq> y"
wenzelm@18369
   159
  from a have "[x * a = y * a](mod p)"
wenzelm@18369
   160
    by (simp add: zcong_zmod_eq p_g_0)
wenzelm@18369
   161
  with p_a_relprime p_prime a_nonzero zcong_cancel [of p a x y]
wenzelm@18369
   162
  have "[x = y](mod p)"
wenzelm@18369
   163
    by (simp add: zprime_imp_zrelprime zcong_def p_g_0 order_le_less)
wenzelm@18369
   164
  with zcong_less_eq [of x y p] p_minus_one_l
wenzelm@18369
   165
    order_le_less_trans [of x "(p - 1) div 2" p]
wenzelm@18369
   166
    order_le_less_trans [of y "(p - 1) div 2" p] have "x = y"
wenzelm@18369
   167
    by (simp add: prems p_minus_one_l p_g_0)
wenzelm@18369
   168
  then have False
wenzelm@18369
   169
    by (simp add: f)
wenzelm@18369
   170
  then show "a = 0"
wenzelm@18369
   171
    by simp
wenzelm@18369
   172
qed
paulson@13871
   173
wenzelm@21233
   174
lemma inj_on_pminusx_E: "inj_on (%x. p - x) E"
paulson@13871
   175
  apply (auto simp add: E_def C_def B_def A_def)
wenzelm@18369
   176
  apply (rule_tac g = "%x. -1 * (x - p)" in inj_on_inverseI)
wenzelm@18369
   177
  apply auto
wenzelm@18369
   178
  done
paulson@13871
   179
wenzelm@21233
   180
lemma A_ncong_p: "x \<in> A ==> ~[x = 0](mod p)"
paulson@13871
   181
  apply (auto simp add: A_def)
paulson@13871
   182
  apply (frule_tac m = p in zcong_not_zero)
paulson@13871
   183
  apply (insert p_minus_one_l)
wenzelm@18369
   184
  apply auto
wenzelm@18369
   185
  done
paulson@13871
   186
wenzelm@21233
   187
lemma A_greater_zero: "x \<in> A ==> 0 < x"
paulson@13871
   188
  by (auto simp add: A_def)
paulson@13871
   189
wenzelm@21233
   190
lemma B_ncong_p: "x \<in> B ==> ~[x = 0](mod p)"
paulson@13871
   191
  apply (auto simp add: B_def)
wenzelm@18369
   192
  apply (frule A_ncong_p)
paulson@13871
   193
  apply (insert p_a_relprime p_prime a_nonzero)
paulson@13871
   194
  apply (frule_tac a = x and b = a in zcong_zprime_prod_zero_contra)
wenzelm@18369
   195
  apply (auto simp add: A_greater_zero)
wenzelm@18369
   196
  done
paulson@13871
   197
wenzelm@21233
   198
lemma B_greater_zero: "x \<in> B ==> 0 < x"
wenzelm@18369
   199
  using a_nonzero by (auto simp add: B_def mult_pos_pos A_greater_zero)
paulson@13871
   200
wenzelm@21233
   201
lemma C_ncong_p: "x \<in> C ==>  ~[x = 0](mod p)"
paulson@13871
   202
  apply (auto simp add: C_def)
paulson@13871
   203
  apply (frule B_ncong_p)
wenzelm@18369
   204
  apply (subgoal_tac "[x = StandardRes p x](mod p)")
wenzelm@18369
   205
  defer apply (simp add: StandardRes_prop1)
paulson@13871
   206
  apply (frule_tac a = x and b = "StandardRes p x" and c = 0 in zcong_trans)
wenzelm@18369
   207
  apply auto
wenzelm@18369
   208
  done
paulson@13871
   209
wenzelm@21233
   210
lemma C_greater_zero: "y \<in> C ==> 0 < y"
paulson@13871
   211
  apply (auto simp add: C_def)
wenzelm@18369
   212
proof -
wenzelm@18369
   213
  fix x
wenzelm@18369
   214
  assume a: "x \<in> B"
wenzelm@18369
   215
  from p_g_0 have "0 \<le> StandardRes p x"
wenzelm@18369
   216
    by (simp add: StandardRes_lbound)
wenzelm@18369
   217
  moreover have "~[x = 0] (mod p)"
wenzelm@18369
   218
    by (simp add: a B_ncong_p)
wenzelm@18369
   219
  then have "StandardRes p x \<noteq> 0"
wenzelm@18369
   220
    by (simp add: StandardRes_prop3)
wenzelm@18369
   221
  ultimately show "0 < StandardRes p x"
wenzelm@18369
   222
    by (simp add: order_le_less)
wenzelm@18369
   223
qed
paulson@13871
   224
wenzelm@21233
   225
lemma D_ncong_p: "x \<in> D ==> ~[x = 0](mod p)"
paulson@13871
   226
  by (auto simp add: D_def C_ncong_p)
paulson@13871
   227
wenzelm@21233
   228
lemma E_ncong_p: "x \<in> E ==> ~[x = 0](mod p)"
paulson@13871
   229
  by (auto simp add: E_def C_ncong_p)
paulson@13871
   230
wenzelm@21233
   231
lemma F_ncong_p: "x \<in> F ==> ~[x = 0](mod p)"
wenzelm@18369
   232
  apply (auto simp add: F_def)
wenzelm@18369
   233
proof -
wenzelm@18369
   234
  fix x assume a: "x \<in> E" assume b: "[p - x = 0] (mod p)"
wenzelm@18369
   235
  from E_ncong_p have "~[x = 0] (mod p)"
wenzelm@18369
   236
    by (simp add: a)
wenzelm@18369
   237
  moreover from a have "0 < x"
wenzelm@18369
   238
    by (simp add: a E_def C_greater_zero)
wenzelm@18369
   239
  moreover from a have "x < p"
wenzelm@18369
   240
    by (auto simp add: E_def C_def p_g_0 StandardRes_ubound)
wenzelm@18369
   241
  ultimately have "~[p - x = 0] (mod p)"
wenzelm@18369
   242
    by (simp add: zcong_not_zero)
wenzelm@18369
   243
  from this show False by (simp add: b)
wenzelm@18369
   244
qed
paulson@13871
   245
wenzelm@21233
   246
lemma F_subset: "F \<subseteq> {x. 0 < x & x \<le> ((p - 1) div 2)}"
wenzelm@18369
   247
  apply (auto simp add: F_def E_def)
paulson@13871
   248
  apply (insert p_g_0)
paulson@13871
   249
  apply (frule_tac x = xa in StandardRes_ubound)
paulson@13871
   250
  apply (frule_tac x = x in StandardRes_ubound)
paulson@13871
   251
  apply (subgoal_tac "xa = StandardRes p xa")
paulson@13871
   252
  apply (auto simp add: C_def StandardRes_prop2 StandardRes_prop1)
wenzelm@18369
   253
proof -
wenzelm@18369
   254
  from zodd_imp_zdiv_eq p_prime p_g_2 zprime_zOdd_eq_grt_2 have
wenzelm@18369
   255
    "2 * (p - 1) div 2 = 2 * ((p - 1) div 2)"
wenzelm@18369
   256
    by simp
wenzelm@18369
   257
  with p_eq2 show " !!x. [| (p - 1) div 2 < StandardRes p x; x \<in> B |]
wenzelm@18369
   258
      ==> p - StandardRes p x \<le> (p - 1) div 2"
wenzelm@18369
   259
    by simp
wenzelm@18369
   260
qed
paulson@13871
   261
wenzelm@21233
   262
lemma D_subset: "D \<subseteq> {x. 0 < x & x \<le> ((p - 1) div 2)}"
paulson@13871
   263
  by (auto simp add: D_def C_greater_zero)
paulson@13871
   264
wenzelm@21233
   265
lemma F_eq: "F = {x. \<exists>y \<in> A. ( x = p - (StandardRes p (y*a)) & (p - 1) div 2 < StandardRes p (y*a))}"
paulson@13871
   266
  by (auto simp add: F_def E_def D_def C_def B_def A_def)
paulson@13871
   267
wenzelm@21233
   268
lemma D_eq: "D = {x. \<exists>y \<in> A. ( x = StandardRes p (y*a) & StandardRes p (y*a) \<le> (p - 1) div 2)}"
paulson@13871
   269
  by (auto simp add: D_def C_def B_def A_def)
paulson@13871
   270
wenzelm@21233
   271
lemma D_leq: "x \<in> D ==> x \<le> (p - 1) div 2"
paulson@13871
   272
  by (auto simp add: D_eq)
paulson@13871
   273
wenzelm@21233
   274
lemma F_ge: "x \<in> F ==> x \<le> (p - 1) div 2"
paulson@13871
   275
  apply (auto simp add: F_eq A_def)
wenzelm@18369
   276
proof -
wenzelm@18369
   277
  fix y
wenzelm@18369
   278
  assume "(p - 1) div 2 < StandardRes p (y * a)"
wenzelm@18369
   279
  then have "p - StandardRes p (y * a) < p - ((p - 1) div 2)"
wenzelm@18369
   280
    by arith
wenzelm@18369
   281
  also from p_eq2 have "... = 2 * ((p - 1) div 2) + 1 - ((p - 1) div 2)"
wenzelm@18369
   282
    by auto
wenzelm@18369
   283
  also have "2 * ((p - 1) div 2) + 1 - (p - 1) div 2 = (p - 1) div 2 + 1"
wenzelm@18369
   284
    by arith
wenzelm@18369
   285
  finally show "p - StandardRes p (y * a) \<le> (p - 1) div 2"
wenzelm@18369
   286
    using zless_add1_eq [of "p - StandardRes p (y * a)" "(p - 1) div 2"] by auto
wenzelm@18369
   287
qed
paulson@13871
   288
haftmann@27556
   289
lemma all_A_relprime: "\<forall>x \<in> A. zgcd x p = 1"
wenzelm@18369
   290
  using p_prime p_minus_one_l by (auto simp add: A_def zless_zprime_imp_zrelprime)
paulson@13871
   291
haftmann@27556
   292
lemma A_prod_relprime: "zgcd (setprod id A) p = 1"
nipkow@30837
   293
by(rule all_relprime_prod_relprime[OF finite_A all_A_relprime])
paulson@13871
   294
wenzelm@21233
   295
paulson@13871
   296
subsection {* Relationships Between Gauss Sets *}
paulson@13871
   297
wenzelm@21233
   298
lemma B_card_eq_A: "card B = card A"
wenzelm@18369
   299
  using finite_A by (simp add: finite_A B_def inj_on_xa_A card_image)
paulson@13871
   300
wenzelm@21233
   301
lemma B_card_eq: "card B = nat ((p - 1) div 2)"
wenzelm@18369
   302
  by (simp add: B_card_eq_A A_card_eq)
paulson@13871
   303
wenzelm@21233
   304
lemma F_card_eq_E: "card F = card E"
wenzelm@18369
   305
  using finite_E by (simp add: F_def inj_on_pminusx_E card_image)
paulson@13871
   306
wenzelm@21233
   307
lemma C_card_eq_B: "card C = card B"
paulson@13871
   308
  apply (insert finite_B)
wenzelm@18369
   309
  apply (subgoal_tac "inj_on (StandardRes p) B")
paulson@13871
   310
  apply (simp add: B_def C_def card_image)
paulson@13871
   311
  apply (rule StandardRes_inj_on_ResSet)
wenzelm@18369
   312
  apply (simp add: B_res)
wenzelm@18369
   313
  done
paulson@13871
   314
wenzelm@21233
   315
lemma D_E_disj: "D \<inter> E = {}"
paulson@13871
   316
  by (auto simp add: D_def E_def)
paulson@13871
   317
wenzelm@21233
   318
lemma C_card_eq_D_plus_E: "card C = card D + card E"
paulson@13871
   319
  by (auto simp add: C_eq card_Un_disjoint D_E_disj finite_D finite_E)
paulson@13871
   320
wenzelm@21233
   321
lemma C_prod_eq_D_times_E: "setprod id E * setprod id D = setprod id C"
paulson@13871
   322
  apply (insert D_E_disj finite_D finite_E C_eq)
nipkow@15392
   323
  apply (frule setprod_Un_disjoint [of D E id])
wenzelm@18369
   324
  apply auto
wenzelm@18369
   325
  done
paulson@13871
   326
wenzelm@21233
   327
lemma C_B_zcong_prod: "[setprod id C = setprod id B] (mod p)"
paulson@13871
   328
  apply (auto simp add: C_def)
wenzelm@18369
   329
  apply (insert finite_B SR_B_inj)
wenzelm@20898
   330
  apply (frule_tac f = "StandardRes p" in setprod_reindex_id [symmetric], auto)
nipkow@15392
   331
  apply (rule setprod_same_function_zcong)
wenzelm@18369
   332
  apply (auto simp add: StandardRes_prop1 zcong_sym p_g_0)
wenzelm@18369
   333
  done
paulson@13871
   334
wenzelm@21233
   335
lemma F_Un_D_subset: "(F \<union> D) \<subseteq> A"
paulson@13871
   336
  apply (rule Un_least)
wenzelm@18369
   337
  apply (auto simp add: A_def F_subset D_subset)
wenzelm@18369
   338
  done
paulson@13871
   339
wenzelm@21233
   340
lemma F_D_disj: "(F \<inter> D) = {}"
paulson@13871
   341
  apply (simp add: F_eq D_eq)
paulson@13871
   342
  apply (auto simp add: F_eq D_eq)
wenzelm@18369
   343
proof -
wenzelm@18369
   344
  fix y fix ya
wenzelm@18369
   345
  assume "p - StandardRes p (y * a) = StandardRes p (ya * a)"
wenzelm@18369
   346
  then have "p = StandardRes p (y * a) + StandardRes p (ya * a)"
wenzelm@18369
   347
    by arith
wenzelm@18369
   348
  moreover have "p dvd p"
wenzelm@18369
   349
    by auto
wenzelm@18369
   350
  ultimately have "p dvd (StandardRes p (y * a) + StandardRes p (ya * a))"
wenzelm@18369
   351
    by auto
wenzelm@18369
   352
  then have a: "[StandardRes p (y * a) + StandardRes p (ya * a) = 0] (mod p)"
wenzelm@18369
   353
    by (auto simp add: zcong_def)
wenzelm@18369
   354
  have "[y * a = StandardRes p (y * a)] (mod p)"
wenzelm@18369
   355
    by (simp only: zcong_sym StandardRes_prop1)
wenzelm@18369
   356
  moreover have "[ya * a = StandardRes p (ya * a)] (mod p)"
wenzelm@18369
   357
    by (simp only: zcong_sym StandardRes_prop1)
wenzelm@18369
   358
  ultimately have "[y * a + ya * a =
wenzelm@18369
   359
    StandardRes p (y * a) + StandardRes p (ya * a)] (mod p)"
wenzelm@18369
   360
    by (rule zcong_zadd)
wenzelm@18369
   361
  with a have "[y * a + ya * a = 0] (mod p)"
wenzelm@18369
   362
    apply (elim zcong_trans)
wenzelm@18369
   363
    by (simp only: zcong_refl)
wenzelm@18369
   364
  also have "y * a + ya * a = a * (y + ya)"
wenzelm@18369
   365
    by (simp add: zadd_zmult_distrib2 zmult_commute)
wenzelm@18369
   366
  finally have "[a * (y + ya) = 0] (mod p)" .
wenzelm@18369
   367
  with p_prime a_nonzero zcong_zprime_prod_zero [of p a "y + ya"]
wenzelm@18369
   368
    p_a_relprime
wenzelm@18369
   369
  have a: "[y + ya = 0] (mod p)"
wenzelm@18369
   370
    by auto
wenzelm@18369
   371
  assume b: "y \<in> A" and c: "ya: A"
wenzelm@18369
   372
  with A_def have "0 < y + ya"
wenzelm@18369
   373
    by auto
wenzelm@18369
   374
  moreover from b c A_def have "y + ya \<le> (p - 1) div 2 + (p - 1) div 2"
wenzelm@18369
   375
    by auto
wenzelm@18369
   376
  moreover from b c p_eq2 A_def have "y + ya < p"
wenzelm@18369
   377
    by auto
wenzelm@18369
   378
  ultimately show False
wenzelm@18369
   379
    apply simp
wenzelm@18369
   380
    apply (frule_tac m = p in zcong_not_zero)
wenzelm@18369
   381
    apply (auto simp add: a)
wenzelm@18369
   382
    done
wenzelm@18369
   383
qed
paulson@13871
   384
wenzelm@21233
   385
lemma F_Un_D_card: "card (F \<union> D) = nat ((p - 1) div 2)"
wenzelm@18369
   386
proof -
wenzelm@18369
   387
  have "card (F \<union> D) = card E + card D"
wenzelm@18369
   388
    by (auto simp add: finite_F finite_D F_D_disj
wenzelm@18369
   389
      card_Un_disjoint F_card_eq_E)
wenzelm@18369
   390
  then have "card (F \<union> D) = card C"
wenzelm@18369
   391
    by (simp add: C_card_eq_D_plus_E)
wenzelm@18369
   392
  from this show "card (F \<union> D) = nat ((p - 1) div 2)"
wenzelm@18369
   393
    by (simp add: C_card_eq_B B_card_eq)
wenzelm@18369
   394
qed
paulson@13871
   395
wenzelm@21233
   396
lemma F_Un_D_eq_A: "F \<union> D = A"
wenzelm@18369
   397
  using finite_A F_Un_D_subset A_card_eq F_Un_D_card by (auto simp add: card_seteq)
paulson@13871
   398
wenzelm@21233
   399
lemma prod_D_F_eq_prod_A:
wenzelm@18369
   400
    "(setprod id D) * (setprod id F) = setprod id A"
paulson@13871
   401
  apply (insert F_D_disj finite_D finite_F)
nipkow@15392
   402
  apply (frule setprod_Un_disjoint [of F D id])
wenzelm@18369
   403
  apply (auto simp add: F_Un_D_eq_A)
wenzelm@18369
   404
  done
paulson@13871
   405
wenzelm@21233
   406
lemma prod_F_zcong:
wenzelm@18369
   407
  "[setprod id F = ((-1) ^ (card E)) * (setprod id E)] (mod p)"
wenzelm@18369
   408
proof -
wenzelm@18369
   409
  have "setprod id F = setprod id (op - p ` E)"
wenzelm@18369
   410
    by (auto simp add: F_def)
wenzelm@18369
   411
  then have "setprod id F = setprod (op - p) E"
wenzelm@18369
   412
    apply simp
wenzelm@18369
   413
    apply (insert finite_E inj_on_pminusx_E)
wenzelm@18369
   414
    apply (frule_tac f = "op - p" in setprod_reindex_id, auto)
wenzelm@18369
   415
    done
wenzelm@18369
   416
  then have one:
wenzelm@18369
   417
    "[setprod id F = setprod (StandardRes p o (op - p)) E] (mod p)"
wenzelm@18369
   418
    apply simp
nipkow@30837
   419
    apply (insert p_g_0 finite_E StandardRes_prod)
nipkow@30837
   420
    by (auto)
wenzelm@18369
   421
  moreover have a: "\<forall>x \<in> E. [p - x = 0 - x] (mod p)"
wenzelm@18369
   422
    apply clarify
wenzelm@18369
   423
    apply (insert zcong_id [of p])
wenzelm@18369
   424
    apply (rule_tac a = p and m = p and c = x and d = x in zcong_zdiff, auto)
wenzelm@18369
   425
    done
wenzelm@18369
   426
  moreover have b: "\<forall>x \<in> E. [StandardRes p (p - x) = p - x](mod p)"
wenzelm@18369
   427
    apply clarify
wenzelm@18369
   428
    apply (simp add: StandardRes_prop1 zcong_sym)
wenzelm@18369
   429
    done
wenzelm@18369
   430
  moreover have "\<forall>x \<in> E. [StandardRes p (p - x) = - x](mod p)"
wenzelm@18369
   431
    apply clarify
wenzelm@18369
   432
    apply (insert a b)
wenzelm@18369
   433
    apply (rule_tac b = "p - x" in zcong_trans, auto)
wenzelm@18369
   434
    done
wenzelm@18369
   435
  ultimately have c:
wenzelm@18369
   436
    "[setprod (StandardRes p o (op - p)) E = setprod (uminus) E](mod p)"
wenzelm@18369
   437
    apply simp
nipkow@30837
   438
    using finite_E p_g_0
nipkow@30837
   439
      setprod_same_function_zcong [of E "StandardRes p o (op - p)" uminus p]
nipkow@30837
   440
    by auto
wenzelm@18369
   441
  then have two: "[setprod id F = setprod (uminus) E](mod p)"
wenzelm@18369
   442
    apply (insert one c)
wenzelm@18369
   443
    apply (rule zcong_trans [of "setprod id F"
nipkow@15392
   444
                               "setprod (StandardRes p o op - p) E" p
wenzelm@18369
   445
                               "setprod uminus E"], auto)
wenzelm@18369
   446
    done
wenzelm@18369
   447
  also have "setprod uminus E = (setprod id E) * (-1)^(card E)"
berghofe@22274
   448
    using finite_E by (induct set: finite) auto
wenzelm@18369
   449
  then have "setprod uminus E = (-1) ^ (card E) * (setprod id E)"
wenzelm@18369
   450
    by (simp add: zmult_commute)
wenzelm@18369
   451
  with two show ?thesis
wenzelm@18369
   452
    by simp
nipkow@15392
   453
qed
paulson@13871
   454
wenzelm@21233
   455
paulson@13871
   456
subsection {* Gauss' Lemma *}
paulson@13871
   457
wenzelm@21233
   458
lemma aux: "setprod id A * -1 ^ card E * a ^ card A * -1 ^ card E = setprod id A * a ^ card A"
paulson@13871
   459
  by (auto simp add: finite_E neg_one_special)
paulson@13871
   460
wenzelm@21233
   461
theorem pre_gauss_lemma:
wenzelm@18369
   462
  "[a ^ nat((p - 1) div 2) = (-1) ^ (card E)] (mod p)"
wenzelm@18369
   463
proof -
wenzelm@18369
   464
  have "[setprod id A = setprod id F * setprod id D](mod p)"
nipkow@30837
   465
    by (auto simp add: prod_D_F_eq_prod_A zmult_commute cong del:setprod_cong)
wenzelm@18369
   466
  then have "[setprod id A = ((-1)^(card E) * setprod id E) *
wenzelm@18369
   467
      setprod id D] (mod p)"
wenzelm@18369
   468
    apply (rule zcong_trans)
nipkow@30837
   469
    apply (auto simp add: prod_F_zcong zcong_scalar cong del: setprod_cong)
wenzelm@18369
   470
    done
wenzelm@18369
   471
  then have "[setprod id A = ((-1)^(card E) * setprod id C)] (mod p)"
wenzelm@18369
   472
    apply (rule zcong_trans)
wenzelm@18369
   473
    apply (insert C_prod_eq_D_times_E, erule subst)
wenzelm@18369
   474
    apply (subst zmult_assoc, auto)
wenzelm@18369
   475
    done
wenzelm@18369
   476
  then have "[setprod id A = ((-1)^(card E) * setprod id B)] (mod p)"
wenzelm@18369
   477
    apply (rule zcong_trans)
nipkow@30837
   478
    apply (simp add: C_B_zcong_prod zcong_scalar2 cong del:setprod_cong)
wenzelm@18369
   479
    done
wenzelm@18369
   480
  then have "[setprod id A = ((-1)^(card E) *
wenzelm@18369
   481
    (setprod id ((%x. x * a) ` A)))] (mod p)"
wenzelm@18369
   482
    by (simp add: B_def)
wenzelm@18369
   483
  then have "[setprod id A = ((-1)^(card E) * (setprod (%x. x * a) A))]
wenzelm@18369
   484
    (mod p)"
nipkow@30837
   485
    by (simp add:finite_A inj_on_xa_A setprod_reindex_id[symmetric] cong del:setprod_cong)
wenzelm@18369
   486
  moreover have "setprod (%x. x * a) A =
wenzelm@18369
   487
    setprod (%x. a) A * setprod id A"
berghofe@22274
   488
    using finite_A by (induct set: finite) auto
wenzelm@18369
   489
  ultimately have "[setprod id A = ((-1)^(card E) * (setprod (%x. a) A *
wenzelm@18369
   490
    setprod id A))] (mod p)"
wenzelm@18369
   491
    by simp
wenzelm@18369
   492
  then have "[setprod id A = ((-1)^(card E) * a^(card A) *
wenzelm@18369
   493
      setprod id A)](mod p)"
wenzelm@18369
   494
    apply (rule zcong_trans)
wenzelm@18369
   495
    apply (simp add: zcong_scalar2 zcong_scalar finite_A setprod_constant zmult_assoc)
wenzelm@18369
   496
    done
wenzelm@18369
   497
  then have a: "[setprod id A * (-1)^(card E) =
wenzelm@18369
   498
      ((-1)^(card E) * a^(card A) * setprod id A * (-1)^(card E))](mod p)"
wenzelm@18369
   499
    by (rule zcong_scalar)
wenzelm@18369
   500
  then have "[setprod id A * (-1)^(card E) = setprod id A *
wenzelm@18369
   501
      (-1)^(card E) * a^(card A) * (-1)^(card E)](mod p)"
wenzelm@18369
   502
    apply (rule zcong_trans)
wenzelm@18369
   503
    apply (simp add: a mult_commute mult_left_commute)
wenzelm@18369
   504
    done
wenzelm@18369
   505
  then have "[setprod id A * (-1)^(card E) = setprod id A *
wenzelm@18369
   506
      a^(card A)](mod p)"
wenzelm@18369
   507
    apply (rule zcong_trans)
nipkow@30837
   508
    apply (simp add: aux cong del:setprod_cong)
wenzelm@18369
   509
    done
wenzelm@18369
   510
  with this zcong_cancel2 [of p "setprod id A" "-1 ^ card E" "a ^ card A"]
wenzelm@18369
   511
      p_g_0 A_prod_relprime have "[-1 ^ card E = a ^ card A](mod p)"
wenzelm@18369
   512
    by (simp add: order_less_imp_le)
wenzelm@18369
   513
  from this show ?thesis
wenzelm@18369
   514
    by (simp add: A_card_eq zcong_sym)
nipkow@15392
   515
qed
paulson@13871
   516
wenzelm@21233
   517
theorem gauss_lemma: "(Legendre a p) = (-1) ^ (card E)"
nipkow@15392
   518
proof -
paulson@13871
   519
  from Euler_Criterion p_prime p_g_2 have
wenzelm@18369
   520
      "[(Legendre a p) = a^(nat (((p) - 1) div 2))] (mod p)"
paulson@13871
   521
    by auto
nipkow@15392
   522
  moreover note pre_gauss_lemma
nipkow@15392
   523
  ultimately have "[(Legendre a p) = (-1) ^ (card E)] (mod p)"
paulson@13871
   524
    by (rule zcong_trans)
nipkow@15392
   525
  moreover from p_a_relprime have "(Legendre a p) = 1 | (Legendre a p) = (-1)"
paulson@13871
   526
    by (auto simp add: Legendre_def)
nipkow@15392
   527
  moreover have "(-1::int) ^ (card E) = 1 | (-1::int) ^ (card E) = -1"
paulson@13871
   528
    by (rule neg_one_power)
nipkow@15392
   529
  ultimately show ?thesis
paulson@13871
   530
    by (auto simp add: p_g_2 one_not_neg_one_mod_m zcong_sym)
nipkow@15392
   531
qed
paulson@13871
   532
avigad@16775
   533
end
wenzelm@21233
   534
wenzelm@21233
   535
end