/
Reciprocity.v
1571 lines (1532 loc) · 67.3 KB
/
Reciprocity.v
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
Require Import ZArith.
Require Import Zhints.
Require Import Zpow_facts.
Require Import BinInt. Import Z.
Require Import Znat.
Require Import Zeuclid. Import ZEuclid.
Require Import Znumtheory.
Require Import Reciprocity.Reciprocity.Finite. Import FiniteTypes.
Require Import Reciprocity.Reciprocity.Accumulation. Import Accum.
Require Import Classical.
Require Import Lia.
Lemma Zpos_induction (P : Z -> Prop) :
P 0 ->
(forall n : Z, 0 <= n -> P n -> P (succ n)) ->
(forall n : Z, 0 <= n -> P n).
Proof.
intros P0 Psucc.
assert (forall n : nat, P (Z.of_nat n)).
simple induction n. auto.
intro n0. rewrite Nat2Z.inj_succ. apply Psucc. apply Nat2Z.is_nonneg.
intros n Hpos. rewrite <- Z2Nat.id by auto. apply H.
Qed.
Lemma prime_divide_pow :
forall x p n : Z, 0 <= n -> prime p -> (p | x ^ n) -> (p | x).
Proof.
intros x p.
apply (Zpos_induction (fun n => prime p -> (p | x ^ n) -> (p | x))).
simpl. intros _ H. destruct H. exists (x * x0). rewrite <- Zmult_assoc.
rewrite <- H. apply Zred_factor0.
intros n Hpos Hrec Hprime Hdiv.
rewrite pow_succ_r in Hdiv by auto. apply prime_mult in Hdiv.
destruct Hdiv. auto. auto. auto.
Qed.
Lemma power_plus :
forall x m n, 0 <= n -> 0 <= m -> x ^ (n + m) = x ^ n * x ^ m.
Proof.
intros x m.
apply (Zpos_induction (fun n => 0 <= m -> x ^ (n + m) = x ^ n * x ^ m)).
intro H. rewrite pow_0_r. rewrite mul_1_l. auto.
intros n Hnpos Hrec Hmpos.
rewrite add_succ_l. rewrite pow_succ_r. rewrite pow_succ_r by auto.
rewrite <- Zmult_assoc. f_equal. auto. lia.
Qed.
Lemma one_pow :
forall n, 0 <= n -> 1 ^ n = 1.
Proof.
apply (Zpos_induction (fun n => 1 ^ n = 1)).
auto. intros n Hpos Hrec. rewrite pow_succ_r by auto. rewrite Hrec. lia.
Qed.
Lemma power_power :
forall x m n, 0 <= n -> 0 <= m -> (x ^ n) ^ m = x ^ (n * m).
Proof.
intros x m.
apply (Zpos_induction (fun n => 0 <= m -> (x ^ n) ^ m = x ^ (n * m))).
intro. simpl. apply one_pow. auto.
intros n Hnpos Hrec Hmpos. rewrite pow_succ_r by auto.
rewrite Zmult_power by auto. rewrite Zmult_succ_l.
rewrite power_plus. rewrite Zmult_comm. f_equal.
auto. rewrite <- mul_0_l with (n := m).
apply Zmult_le_compat_r. auto. auto. auto.
Qed.
Lemma minus_one_pow_even :
forall n : Z, 0 <= n -> Even n -> (-1) ^ n = 1.
Proof.
intros n Hpos Heven. destruct Heven.
rewrite H.
rewrite <- power_power by lia. apply one_pow. lia.
Qed.
Lemma minus_one_pow_odd :
forall n : Z, 0 <= n -> Odd n -> (-1) ^ n = -1.
Proof.
intros n Hpos Hodd. destruct Hodd.
rewrite H. rewrite power_plus by lia.
rewrite <- power_power by lia. rewrite one_pow. auto. lia.
Qed.
Lemma even_mod :
forall n : Z, Even n <-> n mod 2 = 0.
Proof.
intro n. split.
intro Heven. destruct Heven. rewrite H. rewrite Zmult_mod.
auto.
intro Hmod. exists (n / 2). apply Z_div_exact_2. lia. auto.
Qed.
Lemma odd_mod :
forall n : Z, Odd n <-> n mod 2 = 1.
Proof.
intro n. split.
intro Hodd. destruct Hodd. rewrite H. rewrite Zplus_comm.
rewrite Zmult_comm. rewrite Z_mod_plus_full. auto.
intro Hmod. exists (n / 2). rewrite <- Hmod. apply Z_div_mod_eq.
lia.
Qed.
Lemma even_or_odd n :
Even n \/ Odd n.
Proof.
rewrite <- Zeven_equiv. rewrite <- Zodd_equiv.
destruct (Zeven_odd_dec n). auto. auto.
Qed.
Lemma minus_one_pow_mod_2 :
forall n m : Z, 0 <= n -> 0 <= m -> ((-1) ^ n = (-1) ^ m <-> n mod 2 = m mod 2).
Proof.
intros n m Hnpos Hmpos.
destruct (even_or_odd n). assert (n mod 2 = 0). apply even_mod. auto.
rewrite H0. rewrite minus_one_pow_even; [ | lia | auto].
destruct (even_or_odd m). assert (m mod 2 = 0). apply even_mod. auto.
rewrite H2. rewrite minus_one_pow_even; [ | lia | auto].
tauto.
assert (m mod 2 = 1). apply odd_mod. auto.
rewrite H2. rewrite minus_one_pow_odd; [ | lia | auto].
split. intro. discriminate. intro. discriminate.
assert (n mod 2 = 1). apply odd_mod. auto.
rewrite H0. rewrite minus_one_pow_odd; [ | lia | auto].
destruct (even_or_odd m). assert (m mod 2 = 0). apply even_mod. auto.
rewrite H2. rewrite minus_one_pow_even; [ | lia | auto].
split. intro. discriminate. intro. discriminate.
assert (m mod 2 = 1). apply odd_mod. auto.
rewrite H2. rewrite minus_one_pow_odd; [ | lia | auto].
tauto.
Qed.
Definition m1_pow (n : Z) := -2 * (n mod 2) + 1.
Lemma m1_pow_1_or_m1 :
forall n : Z, m1_pow n = 1 \/ m1_pow n = -1.
Proof.
intro n.
destruct (even_or_odd n).
left. unfold m1_pow. assert (n mod 2 = 0). apply even_mod. auto. lia.
right. unfold m1_pow. assert (n mod 2 = 1). apply odd_mod. auto. lia.
Qed.
Lemma m1_pow_compatible :
forall n : Z, n >= 0 -> (-1) ^ n = m1_pow n.
Proof.
intros n H. destruct (even_or_odd n).
rewrite minus_one_pow_even by (lia || auto).
unfold m1_pow. assert (n mod 2 = 0). apply even_mod. auto. lia.
rewrite minus_one_pow_odd by (lia || auto).
unfold m1_pow. assert (n mod 2 = 1). apply odd_mod. auto. lia.
Qed.
Lemma m1_pow_morphism :
forall n m : Z, m1_pow (n + m) = m1_pow n * m1_pow m.
Proof.
intros n m. unfold m1_pow. rewrite Zplus_mod.
destruct (even_or_odd n). assert (n mod 2 = 0). apply even_mod. auto. repeat (rewrite H0).
destruct (even_or_odd m). assert (m mod 2 = 0). apply even_mod. auto. repeat (rewrite H2).
auto. assert (m mod 2 = 1). apply odd_mod. auto. repeat (rewrite H2). auto.
assert (n mod 2 = 1). apply odd_mod. auto. repeat (rewrite H0).
destruct (even_or_odd m). assert (m mod 2 = 0). apply even_mod. auto. repeat (rewrite H2).
auto. assert (m mod 2 = 1). apply odd_mod. auto. repeat (rewrite H2). auto.
Qed.
Lemma minus_mod :
forall n m, 0 < n < m -> (-n) mod m = m - n.
Proof.
intros n m H.
assert (0 < m). lia.
assert (0 <= m - n < m). split. lia. lia.
assert ((m - n) mod m = m - n).
apply Zmod_small. auto.
rewrite <- H2. rewrite <- Zminus_mod_idemp_l.
rewrite Z_mod_same. auto. lia.
Qed.
Lemma mod_eq_div :
forall a b n, n <> 0 -> (a mod n = b mod n <-> (n | a - b)).
Proof.
intros a b n Hnnz.
split.
intro H. apply Zmod_divide. auto. rewrite Zminus_mod.
rewrite H. rewrite Zminus_diag. auto.
intro H. destruct H.
assert (a = b + x * n). lia.
rewrite H0. apply Z_mod_plus_full.
Qed.
Lemma not_0_inversible_mod_p :
forall a p, prime p -> a mod p <> 0 -> exists b, (b * a) mod p = 1.
Proof.
intros a p Hprime Hanz.
assert (rel_prime p a).
apply prime_rel_prime. auto. intro H. apply Zdivide_mod in H. contradiction.
apply rel_prime_bezout in H. destruct H.
exists v. assert ((u * p + v * a) mod p = 1 mod p). f_equal. auto.
rewrite Zmod_1_l in H0 by (destruct Hprime; lia).
rewrite <- Zplus_mod_idemp_l in H0.
rewrite Zmult_mod in H0. rewrite Z_mod_same in H0 by (destruct Hprime; lia).
rewrite Zmult_0_r in H0. rewrite Zmod_0_l in H0. auto.
Qed.
Lemma simpl_mod_p :
forall a b c p, prime p -> a mod p <> 0 -> (a * b) mod p = (a * c) mod p -> b mod p = c mod p.
Proof.
intros a b c p Hprime Hanz Heq.
destruct (not_0_inversible_mod_p a p Hprime Hanz).
assert (((x * a) mod p * b) mod p = ((x * a) mod p * c) mod p).
repeat (rewrite Zmult_mod_idemp_l). repeat (rewrite <- Zmult_assoc).
rewrite <- Zmult_mod_idemp_r. rewrite Heq. rewrite Zmult_mod_idemp_r. auto.
repeat (rewrite H in H0). repeat (rewrite mul_1_l in H0). auto.
Qed.
Lemma over_2 :
forall a, a mod 2 = 1 -> (a - 1) / 2 = a / 2.
Proof.
intros a Hodd.
apply mul_reg_l with (p := 2). lia.
assert (2 * ((a - 1) / 2) = a - 1 - (a - 1) mod 2).
rewrite Zmod_eq_full. lia. lia.
assert (2 * (a / 2) = a - a mod 2).
rewrite Zmod_eq_full. lia. lia.
rewrite H. rewrite H0. rewrite Hodd. rewrite <- Zminus_mod_idemp_l.
rewrite Hodd. simpl. rewrite Zmod_0_l. lia.
Qed.
Section Z_over_pZ.
Variable p : Z.
Hypothesis p_prime : prime p.
Definition ZpZmult (x y : Z) := (x * y) mod p.
Lemma ZpZmult_comm :
forall (x y : Z), ZpZmult x y = ZpZmult y x.
Proof.
intros. unfold ZpZmult. rewrite Zmult_comm. auto.
Qed.
Lemma ZpZmult_assoc :
forall (x y z : Z), ZpZmult x (ZpZmult y z) = ZpZmult (ZpZmult x y) z.
Proof.
intros. unfold ZpZmult.
rewrite Zmult_mod_idemp_l. rewrite Zmult_mod_idemp_r. rewrite Zmult_assoc.
auto.
Qed.
Lemma one_idemp :
ZpZmult 1 1 = 1.
Proof.
unfold ZpZmult. simpl. apply Zmod_1_l. destruct p_prime. lia.
Qed.
Lemma mod_1_mod :
forall x y : Z, ZpZmult x y = ZpZmult (ZpZmult x y) 1.
Proof.
intros x y. unfold ZpZmult.
rewrite Zmult_1_r. symmetry. apply Zmod_mod.
Qed.
End Z_over_pZ.
Lemma card_interval_full :
forall a b : Z, a <= b + 1 ->
cardinality {u : Z | a <= u <= b} (Z.to_nat (b - a + 1)).
Proof.
intros a b Hsmall.
assert (forall u : {u : Z | a <= u <= b}, (Z.to_nat (`u - a) < Z.to_nat (b - a + 1))%nat).
intro u. destruct u as [u' Hu']. simpl.
apply Z2Nat.inj_lt. lia. lia. lia.
exists (fun u => exist _ (Z.to_nat (`u - a)) (H u)).
apply bijection_inversible.
assert (forall x : {x : nat | (x < Z.to_nat (b - a + 1)) % nat}, a <= a + Z.of_nat `x <= b).
intro x. destruct x as [x' Hx']. unfold proj1_sig.
assert (0 <= Z.of_nat x' < b - a + 1). split. apply Nat2Z.is_nonneg.
apply Nat2Z.inj_lt in Hx'. rewrite Z2Nat.id in Hx'. auto. lia.
lia.
exists (fun x => exist _ (a + Z.of_nat `x) (H0 x)).
split.
intro x. destruct x as [x' Hx']. apply proj1_inj. unfold proj1_sig.
rewrite Z2Nat.id. lia. lia.
intro y. destruct y as [y' Hy']. apply proj1_inj. unfold proj1_sig.
rewrite <- Nat2Z.id. f_equal. lia.
Qed.
Lemma card_interval :
forall a b : Z, a <= b ->
cardinality {u : Z | a <= u <= b} (Z.to_nat (b - a + 1)).
Proof.
intros a b H.
apply card_interval_full. lia.
Qed.
Section FLT.
Variable p : Z.
Hypothesis p_prime : prime p.
Variable a : Z.
Hypothesis a_not_0 : a mod p <> 0.
Let f (u : {u : Z | 1 <= u <= p - 1}) := (a * `u) mod p.
Let f'_exists :
forall u, 1 <= f u <= p - 1.
Proof with ((destruct p_prime; lia) || auto).
intro u. destruct u as [u' Hu']. unfold f. simpl.
assert (0 <= (a * u' mod p) < p).
apply mod_pos_bound...
assert (a * u' mod p <> 0).
intro H1. apply Zmod_divide in H1... apply prime_mult in H1...
destruct H1. apply Zdivide_mod in H0. contradiction.
apply Zdivide_mod in H0. rewrite Zmod_small in H0...
lia.
Qed.
Let f' u := exist (fun k => 1 <= k <= p - 1) (f u) (f'_exists u).
Let f'_injective :
injection f'.
Proof.
intros u1 u2 H. destruct u1 as [u1' Hu1']. destruct u2 as [u2' Hu2'].
unfold f' in H. apply proj1_inj in H. simpl in H.
apply proj1_inj. simpl. unfold f in H. simpl in H.
apply simpl_mod_p in H. repeat (rewrite Zmod_small in H by lia). auto.
auto. auto.
Qed.
Let f'_surjective :
surjection f'.
Proof with ((destruct p_prime; lia) || auto).
intro y. destruct y as [y' Hy'].
destruct (not_0_inversible_mod_p a p p_prime a_not_0) as [a' Ha'].
assert (1 <= (a' * y') mod p <= p - 1).
assert (0 <= (a' * y') mod p < p). apply mod_pos_bound...
assert ((a' * y') mod p <> 0). intro H1.
assert ((a * (a' * y')) mod p = 0). rewrite Zmult_mod. rewrite H1.
rewrite Zmult_0_r. rewrite Zmod_0_l. auto.
rewrite Zmult_assoc in H0. rewrite Zmult_comm with (m := a') in H0.
rewrite <- Zmult_mod_idemp_l in H0. rewrite Ha' in H0.
rewrite Zmult_1_l in H0. rewrite Zmod_small in H0. lia. lia.
lia.
exists (exist _ ((a' * y') mod p) H).
unfold f'. unfold f. simpl. apply proj1_inj. simpl.
rewrite Zmult_mod_idemp_r. rewrite Zmult_assoc. rewrite Zmult_comm with (m := a').
rewrite <- Zmult_mod_idemp_l. rewrite Ha'. rewrite Zmult_1_l.
apply Zmod_small. lia.
Qed.
Let card_U :
cardinality {u : Z | 1 <= u <= p - 1} (Z.to_nat (p - 1)).
Proof.
assert (cardinality {u : Z | 1 <= u <= p - 1} (Z.to_nat (p - 1 - 1 + 1))).
apply card_interval. destruct p_prime; lia.
assert (p - 1 - 1 + 1 = p - 1). lia. rewrite H0 in H. auto.
Qed.
Let U_finite :
finite {u : Z | 1 <= u <= p - 1}.
Proof.
exists (Z.to_nat (p - 1)). apply card_U.
Qed.
Let P' := product Z (ZpZmult p) (ZpZmult_comm p) (ZpZmult_assoc p) 1 _ U_finite (fun x => `x).
Let P'_not_0 :
P' mod p <> 0.
Proof.
unfold P'. apply product_property_conservation.
intros x y Hxnz Hynz. unfold ZpZmult. rewrite Zmod_mod.
intro H. apply Zmod_divide in H. apply prime_mult in H.
destruct H. apply Zdivide_mod in H. contradiction. apply Zdivide_mod in H. contradiction.
auto. destruct p_prime; lia. rewrite Zmod_1_l. lia. destruct p_prime; lia.
intro x. destruct x. simpl. rewrite Zmod_small. lia. lia.
Qed.
Let P'1 :
product Z (ZpZmult p) (ZpZmult_comm p) (ZpZmult_assoc p) 1 _ U_finite (compose (proj1_sig (P := fun k => 1 <= k <= p - 1)) f') =
(ZpZmult p) (product Z (ZpZmult p) (ZpZmult_comm p) (ZpZmult_assoc p) 1 _ U_finite (fun x => `x))
(product Z (ZpZmult p) (ZpZmult_comm p) (ZpZmult_assoc p) 1 _ U_finite (fun x => a)).
Proof.
unfold compose. unfold f'. simpl.
rewrite <- product_mul. apply product_ext.
intro i. unfold f. unfold ZpZmult. f_equal. apply Zmult_comm.
apply one_idemp. auto.
Qed.
Let P'2 :
product Z (ZpZmult p) (ZpZmult_comm p) (ZpZmult_assoc p) 1 _ U_finite (compose (proj1_sig (P := fun k => 1 <= k <= p - 1)) f') = P'.
Proof.
unfold P'. rewrite <- product_bij with (b := f') (HI := U_finite). auto.
split. apply f'_injective. apply f'_surjective.
Qed.
Let P'3 :
(product Z (ZpZmult p) (ZpZmult_comm p) (ZpZmult_assoc p) 1 _ U_finite (fun x => a)) mod p = (a ^ (p - 1)) mod p.
Proof.
assert (cardinality {u : Z | 1 <= u <= p - 1} (Z.to_nat (p - 1))).
apply card_U.
apply inv_bijection in H. destruct H as [b Hb].
rewrite (product_bij _ _ _ _ _ _ _ _ _ (Fints_finite (Z.to_nat (p - 1))) b Hb).
transitivity (a ^ (Z.of_nat (Z.to_nat (p - 1))) mod p).
unfold compose. remember (Z.to_nat (p - 1)) as n.
generalize n. simple induction n0.
rewrite empty_product. auto.
intros n1 H. rewrite product_n. rewrite Nat2Z.inj_succ.
unfold ZpZmult. rewrite Zmod_mod. rewrite Zmult_mod. unfold ZpZmult in H.
rewrite H. rewrite <- Zmult_mod. f_equal.
rewrite pow_succ_r. apply Zmult_comm. apply Nat2Z.is_nonneg.
rewrite Z2Nat.id. auto. destruct p_prime; lia.
Qed.
Theorem FLT :
(a ^ (p - 1)) mod p = 1.
Proof.
assert (
(ZpZmult p) (product Z (ZpZmult p) (ZpZmult_comm p) (ZpZmult_assoc p) 1 _ U_finite (compose (proj1_sig (P := fun k => 1 <= k <= p - 1)) f')) 1 =
(ZpZmult p) P'
(product Z (ZpZmult p) (ZpZmult_comm p) (ZpZmult_assoc p) 1 _ U_finite (fun x => a))).
unfold P'. rewrite P'1. symmetry. apply mod_1_mod.
rewrite P'2 in H.
unfold ZpZmult in H.
apply simpl_mod_p in H.
fold (ZpZmult p) in H.
rewrite P'3 in H. rewrite Zmod_1_l in H. auto.
destruct p_prime; lia. auto. apply P'_not_0.
Qed.
End FLT.
Definition inverse (p : Z) (a : Z) :=
(a ^ (p - 2)) mod p.
Lemma p_inverse :
forall p a : Z, prime p -> a mod p <> 0 -> (a * (inverse p a)) mod p = 1.
Proof.
intros p a Hprime Hanz.
unfold inverse. rewrite Zmult_mod_idemp_r.
rewrite <- pow_succ_r by (destruct Hprime; lia).
unfold succ. assert (p - 2 + 1 = p - 1). lia. rewrite H. apply FLT.
auto. auto.
Qed.
Lemma inv_not_0 :
forall p a : Z, prime p -> a mod p <> 0 -> (inverse p a) mod p <> 0.
Proof.
intros p a Hprime Hanz H. assert ((a * inverse p a) mod p = 1). apply p_inverse.
auto. auto. rewrite Zmult_mod in H0. rewrite H in H0. rewrite Zmult_0_r in H0.
rewrite Zmod_0_l in H0. discriminate.
Qed.
Lemma inv_inv :
forall p a : Z, prime p -> a mod p <> 0 -> (inverse p (inverse p a)) = a mod p.
Proof.
intros p a Hprime Hanz.
assert (inverse p (inverse p a) mod p = inverse p (inverse p a)).
unfold inverse. apply Zmod_mod. rewrite <- H.
assert (inverse p a mod p <> 0). apply inv_not_0. auto. auto.
apply simpl_mod_p with (a := (inverse p a)). auto. auto.
rewrite p_inverse by auto. rewrite Zmult_comm. rewrite p_inverse by auto. auto.
Qed.
Lemma inv_bounds :
forall p a : Z, prime p -> a mod p <> 0 -> 1 <= inverse p a <= p - 1.
Proof.
intros. assert (inverse p a <> 0). unfold inverse. rewrite <- Zmod_mod.
apply inv_not_0. auto. auto.
assert (0 <= inverse p a < p). apply Zmod_pos_bound. destruct H; lia. lia.
Qed.
Lemma inv_mod :
forall p a : Z, prime p -> inverse p a = inverse p (a mod p).
Proof.
intros. unfold inverse. apply Zpower_mod. destruct H; lia.
Qed.
Lemma inv_prod :
forall p a b : Z, prime p -> ((inverse p a) * (inverse p b)) mod p = inverse p (a * b).
Proof.
intros. unfold inverse. rewrite <- Zmult_mod.
rewrite Zmult_power. auto. destruct H; lia.
Qed.
Section Wilson.
Variable p : Z.
Hypothesis p_prime : prime p.
Hypothesis p_odd : p mod 2 = 1.
Let p_not_2 :
p <> 2.
Proof.
intro. rewrite H in p_odd. rewrite Z_mod_same in p_odd. lia. lia.
Qed.
Let U_finite :
finite {x : Z | 1 <= x <= p - 1}.
Proof.
exists (Z.to_nat (p - 1 - 1 + 1)). apply card_interval. destruct p_prime; lia.
Qed.
Theorem Wilson :
product Z (ZpZmult p) (ZpZmult_comm p) (ZpZmult_assoc p) 1 _ U_finite (fun x => `x)
= -1 mod p.
Proof.
rewrite product_split with (P := fun x => `x = inverse p `x);
[ | (apply one_idemp; auto) | (intros; symmetry; rewrite ZpZmult_comm with (x := 1); apply mod_1_mod) ].
assert (1 <= 1 <= p - 1). destruct p_prime; lia.
assert (proj1_sig (exist (fun x => 1 <= x <= p - 1) 1 H) =
inverse p (proj1_sig (exist (fun x => 1 <= x <= p - 1) 1 H))).
simpl. unfold inverse. rewrite one_pow by (destruct p_prime; lia).
rewrite Zmod_1_l by (destruct p_prime; lia). auto.
assert (1 <= p - 1 <= p - 1). destruct p_prime; lia.
assert (proj1_sig (exist (fun x => 1 <= x <= p - 1) (p - 1) H1) =
inverse p (proj1_sig (exist (fun x => 1 <= x <= p - 1) (p - 1) H1))).
simpl. unfold inverse. transitivity ((-1) ^ (p - 2) mod p).
rewrite minus_one_pow_odd. rewrite <- minus_mod. f_equal. lia. lia.
apply odd_mod. rewrite Zminus_mod. rewrite Z_mod_same. rewrite p_odd. auto. lia.
rewrite Zpower_mod. f_equal. f_equal. rewrite <- minus_mod. f_equal. lia. lia.
assert ((0 < 2)%nat). lia. remember (exist (fun x => (x < 2)%nat) (0%nat) H3) as F2Zero.
assert ((1 < 2)%nat). lia. remember (exist (fun x => (x < 2)%nat) (1%nat) H4) as F2One.
remember (fun a : (Fints 2) =>
If a = F2Zero then exist (fun k => `k = inverse p `k) (exist (fun x => 1 <= x <= p - 1) 1 H) H0 else
exist _ (exist (fun x => 1 <= x <= p - 1) (p - 1) H1) H2) as b.
assert (bijection b).
apply bijection_inversible.
exists (fun x => If ``x = 1 then F2Zero else F2One).
split. intro a. rewrite Heqb. ex_mid_destruct. ex_mid_destruct. auto.
simpl in e. exfalso. assert (p <> 2). apply p_not_2. lia.
ex_mid_destruct. simpl in n. lia. simpl in n. destruct a as [a' Ha'].
apply proj1_inj. rewrite HeqF2One. simpl. apply proj1_inj_neg in n0.
rewrite HeqF2Zero in n0. simpl in n0. lia.
intro x. rewrite Heqb. ex_mid_destruct. ex_mid_destruct.
apply proj1_inj. simpl. apply proj1_inj. simpl. auto.
rewrite HeqF2One in e. rewrite HeqF2Zero in e. discriminate.
ex_mid_destruct. contradict n. auto.
destruct x as [x' Hx']. destruct x' as [x'' Hx'']. apply proj1_inj. simpl.
apply proj1_inj. simpl in *.
assert (x'' mod p <> 0). rewrite Zmod_small. lia. lia.
assert ((x'' * (inverse p x'') - 1) mod p = 0).
rewrite Zminus_mod. rewrite p_inverse. rewrite Zminus_mod_idemp_r.
simpl. rewrite Zmod_0_l. auto. auto. auto.
rewrite <- Hx' in H6.
assert ((x'' - 1) * (x'' + 1) mod p = 0). rewrite <- H6.
f_equal. rewrite Zmult_minus_distr_r. repeat (rewrite Zmult_plus_distr_r).
lia. apply Zmod_divide in H7. apply prime_mult in H7.
destruct H7. apply Zdivide_mod in H7. rewrite Zmod_small in H7. lia.
lia. apply Zdivide_mod in H7. assert (((x'' + 1) - 1) mod p = p - 1).
rewrite Zminus_mod. rewrite H7. rewrite Zmod_1_l. apply minus_mod.
lia. lia. rewrite Zmod_small in H8. lia. lia. auto. lia.
rewrite product_bij with (b := b) (HJ := Fints_finite 2) by auto.
rewrite product_n. rewrite product_n. rewrite empty_product.
unfold compose. rewrite Heqb.
rewrite If_l by (unfold Fints_coerce; unfold Fints_last; rewrite HeqF2Zero; apply proj1_inj; auto).
rewrite If_r by (rewrite HeqF2Zero; unfold Fints_last; apply proj1_inj_neg; simpl; auto). simpl.
rewrite one_idemp by auto.
rewrite product_split with (P := fun x => ``x < inverse p ``x);
[ | (apply one_idemp; auto) | (intros; symmetry; rewrite ZpZmult_comm with (x := 1); apply mod_1_mod) ].
assert (c_ex1 : forall x : {x : Z | 1 <= x <= p - 1},
1 <= inverse p `x <= p - 1).
intro x. destruct x as [x' Hx'].
simpl in *. apply inv_bounds. auto. rewrite Zmod_small. lia. lia.
remember (fun x => exist (fun k => 1 <= k <= p - 1) (inverse p `x) (c_ex1 x)) as c1.
assert (c_ex2 : forall x : {x : {x : Z | 1 <= x <= p - 1} | `x <> inverse p `x},
proj1_sig (c1 `x) <>
inverse p (proj1_sig (c1 `x))).
rewrite Heqc1.
intro x. destruct x as [x' Hx']. destruct x' as [x'' Hx''].
simpl in *. rewrite inv_inv. rewrite Zmod_small. auto. lia. auto. rewrite Zmod_small. lia. lia.
remember (fun x => exist (fun k => `k <> inverse p `k) (c1 `x) (c_ex2 x)) as c2.
assert (c_ex3 : forall x : {x : {x : {x : Z | 1 <= x <= p - 1} | `x <> inverse p `x} |
``x < inverse p ``x},
~ (proj1_sig (proj1_sig (c2 `x)) < inverse p (proj1_sig (proj1_sig (c2 `x))))).
rewrite Heqc2. simpl. rewrite Heqc1. simpl.
intro x. destruct x as [x' Hx']. destruct x' as [x'' Hx'']. destruct x'' as [x''' Hx'''].
simpl in *. rewrite inv_inv. rewrite Zmod_small. lia. lia. auto. rewrite Zmod_small. lia. lia.
remember (fun x => exist (fun k => ~ ``k < inverse p ``k) (c2 `x) (c_ex3 x)) as c3.
assert (bijection c3).
apply bijection_inversible.
assert (c'_ex : forall x : {x : {x : {x : Z | 1 <= x <= p - 1} | `x <> inverse p `x} |
~ ``x < inverse p ``x},
proj1_sig (proj1_sig (c2 `x)) < inverse p (proj1_sig (proj1_sig (c2 `x)))).
rewrite Heqc2. simpl. rewrite Heqc1. simpl.
intro x. destruct x as [x' Hx']. destruct x' as [x'' Hx'']. destruct x'' as [x''' Hx'''].
simpl in *. rewrite inv_inv. rewrite Zmod_small. lia. lia. auto. rewrite Zmod_small. lia. lia.
remember (fun x => exist (fun k => ``k < inverse p ``k) (c2 `x) (c'_ex x)) as c'.
assert (forall x, c2 (c2 x) = x). intro x.
destruct x as [x' Hx']. destruct x' as [x'' Hx''].
rewrite Heqc2. apply proj1_inj. simpl. rewrite Heqc1. apply proj1_inj. simpl.
rewrite inv_inv. apply Zmod_small. lia. auto. rewrite Zmod_small. lia. lia.
exists c'. split.
intro x. rewrite Heqc3. rewrite Heqc'. apply proj1_inj. simpl. auto.
intro y. rewrite Heqc3. rewrite Heqc'. apply proj1_inj. simpl. auto.
rewrite product_bij with (b := c3) (HJ :=
(subtype_finite
(subtype_finite U_finite
(fun x : {x : Z | 1 <= x <= p - 1} => `x <> inverse p `x))
(fun x : {x : {x : Z | 1 <= x <= p - 1} | `x <> inverse p `x} =>
``x < inverse p ``x))) by auto.
rewrite <- product_mul by (apply one_idemp; auto).
rewrite product_ext with (g := fun x => 1).
unfold ZpZmult. rewrite Zmult_1_l. rewrite <- Zmult_1_r with (n := -1).
rewrite <- Zmult_mod_idemp_l with (a := -1). f_equal.
f_equal. rewrite Zmod_small by lia. rewrite <- minus_mod. auto. lia.
apply product_property_conservation. intros. rewrite H7. rewrite H8. apply one_idemp.
auto. auto. auto.
intro x. destruct x as [x' Hx']. destruct x' as [x'' Hx'']. destruct x'' as [x''' Hx'''].
simpl in *. unfold compose. rewrite Heqc3. simpl. rewrite Heqc2. simpl.
rewrite Heqc1. simpl. unfold ZpZmult. apply p_inverse. auto. rewrite Zmod_small. lia. lia.
Qed.
End Wilson.
Definition legendre (p a : Z) :=
If a mod p = 0 then 0 else
If exists y, (y ^ 2) mod p = a mod p then 1 else -1.
Lemma pow_0_l :
forall n : Z, 0 < n -> 0 ^ n = 0.
Proof.
intros n H. rewrite (Zsucc_pred n). rewrite pow_succ_r. lia. lia.
Qed.
Section Eulers_criterion.
Variable p : Z.
Hypothesis p_prime : prime p.
Hypothesis p_odd : p mod 2 = 1.
Variable a : Z.
Let p_not_2 :
p <> 2.
Proof.
intro. rewrite H in p_odd. rewrite Z_mod_same in p_odd. lia. lia.
Qed.
Let if_a_0 :
a mod p = 0 -> 0 mod p = (a ^ ((p - 1) / 2)) mod p.
Proof.
intro H.
rewrite Zpower_mod. rewrite H.
assert ((p - 1) / 2 >= 2 / 2). apply Z_div_ge. lia. destruct p_prime; lia.
rewrite Z_div_same in H0. assert (0 < (p - 1) / 2). lia. rewrite pow_0_l by auto.
auto. lia. destruct p_prime; lia.
Qed.
Let if_a_square :
a mod p <> 0 -> (exists y, (y ^ 2) mod p = a mod p) ->
1 mod p = (a ^ ((p - 1) / 2)) mod p.
Proof.
intros H Hsq. destruct Hsq as [y Hsq].
assert (y mod p <> 0). intro Hc. rewrite Zpower_mod in Hsq by (destruct p_prime; lia).
rewrite Hc in Hsq. rewrite pow_0_l in Hsq. rewrite Zmod_0_l in Hsq. congruence.
lia.
rewrite Zpower_mod by (destruct p_prime; lia). rewrite <- Hsq.
rewrite <- Zpower_mod by (destruct p_prime; lia).
rewrite power_power.
symmetry. rewrite Zmod_1_l by (destruct p_prime; lia).
assert (2 * ((p - 1) / 2) = p - 1). symmetry. apply Z_div_exact_2. lia.
rewrite <- Zminus_mod_idemp_l. rewrite p_odd. auto.
rewrite H1. apply FLT. auto. auto. lia. apply Z_div_pos. lia. destruct p_prime; lia.
Qed.
Let if_a_not_square :
a mod p <> 0 -> (forall y, (y * y) mod p <> a mod p) ->
-1 mod p = (a ^ ((p - 1) / 2)) mod p.
Proof.
intros Hanz Hnotsq.
remember (fun x : {x : Z | 1 <= x <= p - 1} => ((inverse p `x) * a) mod p) as f.
assert (forall x : {x : Z | 1 <= x <= p - 1}, 1 <= f x <= p - 1).
intro x. destruct x as [x' Hx']. rewrite Heqf. simpl.
assert (0 <= (inverse p x' * a) mod p < p). apply mod_pos_bound. destruct p_prime; lia.
assert ((inverse p x' * a) mod p <> 0). intro H1.
apply Zmod_divide in H1. apply prime_mult in H1. destruct H1.
apply Zdivide_mod in H0. assert (inverse p x' mod p <> 0).
apply inv_not_0. auto. rewrite Zmod_small. lia. lia. contradiction.
apply Zdivide_mod in H0. contradiction. auto. destruct p_prime; lia.
lia.
remember (fun x => exist (fun k => 1 <= k <= p - 1) (f x) (H x)) as f'.
assert (forall x, f' (f' x) = x). intro x. rewrite Heqf'. generalize H. rewrite Heqf.
intro. apply proj1_inj. simpl. destruct Heqf.
rewrite <- inv_mod. rewrite <- inv_prod. rewrite Zmult_mod_idemp_l.
rewrite <- Zmult_assoc. rewrite Zmult_mod. rewrite inv_inv. rewrite Zmult_comm with (m := a).
rewrite p_inverse. rewrite Zmult_1_r. repeat (rewrite Zmod_mod). destruct x. simpl. rewrite Zmod_small.
auto. lia. auto. auto. auto. destruct x. simpl. rewrite Zmod_small. lia. lia. auto. auto.
assert (forall x, proj1_sig (f' x) <> `x).
intro x. destruct x as [x' Hx']. rewrite Heqf'. simpl. rewrite Heqf. simpl. intro H1.
assert ((x' * ((inverse p x' * a) mod p)) mod p = a mod p).
rewrite Zmult_mod_idemp_r. rewrite Zmult_assoc. rewrite <- Zmult_mod_idemp_l.
rewrite p_inverse. f_equal. lia. auto. rewrite Zmod_small. lia. lia.
rewrite H1 in H2. apply (Hnotsq x'). auto.
assert (finite {x : Z | 1 <= x <= p - 1}).
exists (Z.to_nat (p - 1 - 1 + 1)). apply card_interval. destruct p_prime; lia.
assert (product Z (ZpZmult p) (ZpZmult_comm p) (ZpZmult_assoc p) 1 _ H2 (fun x => `x)
= -1 mod p). rewrite <- Wilson with (p_prime := p_prime) (p_odd := p_odd).
f_equal. apply proof_irrelevance. auto.
rewrite product_split with (P := fun x => proj1_sig (f' x) < `x) in H3;
[ | (apply one_idemp; auto) | (intros; symmetry; rewrite ZpZmult_comm with (x := 1); apply mod_1_mod) ].
assert (forall x : {x : {x : Z | 1 <= x <= p - 1} | proj1_sig (f' x) < `x},
~ (proj1_sig (f' (f' `x)) < (proj1_sig (f' `x)))).
intro x. destruct x as [x' Hx']. rewrite H0. simpl. lia.
remember (fun x => exist (fun k => ~ (proj1_sig (f' k) < `k)) (f' `x) (H4 x)) as b.
assert (bijection b).
apply bijection_inversible.
assert (forall x : {x : {x : Z | 1 <= x <= p - 1} | ~ (proj1_sig (f' x) < `x)},
proj1_sig (f' (f' `x)) < proj1_sig (f' `x)).
intro x. destruct x as [x' Hx']. rewrite H0. simpl.
assert (proj1_sig (f' x') <> `x'). apply H1. lia.
exists (fun x => exist _ (f' `x) (H5 x)).
split. intro x. apply proj1_inj. simpl. rewrite Heqb. simpl. apply H0.
intro y. apply proj1_inj. simpl. rewrite Heqb. simpl. apply H0.
rewrite product_bij with (b := b) (HJ := (subtype_finite H2
(fun x : {x : Z | 1 <= x <= p - 1} => proj1_sig (f' x) < `x))) in H3.
rewrite <- product_mul in H3. unfold compose in H3.
rewrite Heqb in H3. simpl in H3.
rewrite product_ext with (g := fun x => a mod p) in H3.
destruct (subtype_finite H2
(fun x : {x : Z | 1 <= x <= p - 1} => proj1_sig (f' x) < `x)) as [n Hn].
assert (cardinality
{x : {x : Z | 1 <= x <= p - 1} | ~ proj1_sig (f' x) < `x} n).
apply card_bijection with (b := b). auto. auto.
assert (cardinality {x : Z | 1 <= x <= p - 1} (n + n)).
apply disjoint_union_cardinality with (P := fun x => proj1_sig (f' x) < `x).
auto. auto. assert ((n + n = Z.to_nat (p - 1))%nat).
apply cardinality_unique with (T := {x : Z | 1 <= x <= p - 1}).
auto. assert (Z.to_nat (p - 1) = Z.to_nat (p - 1 - 1 + 1)).
f_equal. lia. rewrite H8. apply card_interval. destruct p_prime; lia.
assert (n = Z.to_nat ((p - 1) / 2)).
assert (p - 1 = (p - 1) / 2 + (p - 1) / 2).
rewrite <- Zmult_1_r. rewrite Zmult_plus_distr_l. rewrite <- Zmult_plus_distr_r.
rewrite Zmult_comm. apply Z_div_exact_2. lia. rewrite <- Zminus_mod_idemp_l.
rewrite p_odd. rewrite Zmod_0_l. auto.
rewrite H9 in H8. rewrite Z2Nat.inj_add in H8. lia.
apply Z_div_pos. lia. destruct p_prime; lia. apply Z_div_pos. lia. destruct p_prime; lia.
assert (product Z (ZpZmult p) (ZpZmult_comm p) (ZpZmult_assoc p) 1
{x : {x : Z | 1 <= x <= p - 1} | proj1_sig (f' x) < `x}
(ex_intro
(fun n0 : nat =>
cardinality {x : {x : Z | 1 <= x <= p - 1} | proj1_sig (f' x) < `x} n0) n
Hn)
(fun _ : {x : {x : Z | 1 <= x <= p - 1} | proj1_sig (f' x) < `x} => a mod p) =
a ^ ((p - 1) / 2) mod p).
assert (Hc : cardinality {x : {x : Z | 1 <= x <= p - 1} | proj1_sig (f' x) < `x} n). auto.
apply inv_bijection in Hc. destruct Hc as [c Hc].
rewrite product_bij with (b := c) (HJ := Fints_finite n) by auto. unfold compose.
assert (Z.of_nat n = (p - 1) / 2). rewrite <- Z2Nat.id. f_equal. auto.
apply Z_div_pos. lia. destruct p_prime; lia.
rewrite <- H10.
generalize n. simple induction n0.
rewrite empty_product. rewrite Zmod_1_l. auto. destruct p_prime; lia.
intros n1 Hr. rewrite product_n. rewrite Hr. rewrite Nat2Z.inj_succ.
rewrite Zpower_succ_r. unfold ZpZmult. rewrite <- Zmult_mod. f_equal. apply Zmult_comm.
apply Nat2Z.is_nonneg.
rewrite <- H10. rewrite H3. f_equal.
intro x. destruct x as [x' Hx']. destruct x' as [x'' Hx''].
unfold ZpZmult. simpl. rewrite Heqf'. simpl. rewrite Heqf. simpl.
rewrite Zmult_mod_idemp_r. rewrite Zmult_assoc.
rewrite <- Zmult_mod_idemp_l. rewrite p_inverse. f_equal. lia. auto.
rewrite Zmod_small. lia. lia. apply one_idemp. auto. auto.
Qed.
Theorem Eulers_criterion :
(legendre p a) mod p = a ^ ((p - 1) / 2) mod p.
Proof.
unfold legendre.
case_if. auto.
case_if. auto.
apply if_a_not_square. auto.
intro y. contradict n0. exists y.
assert (y ^ 2 = y * y).
simpl. unfold pow_pos. unfold Pos.iter. rewrite Zmult_assoc. rewrite Zmult_1_r. auto.
congruence.
Qed.
End Eulers_criterion.
Section Eisensteins_lemma.
Variable p : Z.
Hypothesis p_prime : prime p.
Hypothesis p_odd : p mod 2 = 1.
Let p_positive :
0 < p.
Proof.
destruct p_prime. lia.
Qed.
Let p_positive_rev :
p > 0.
Proof.
destruct p_prime. lia.
Qed.
Let p_not_0 :
p <> 0.
Proof.
assert (0 < p). apply p_positive. lia.
Qed.
Let eq_mod_2 :
forall x y : Z, (x + y) mod 2 = 0 -> x mod 2 = y mod 2.
Proof.
intros x y H. rewrite Zplus_mod in H.
destruct (even_or_odd x). assert (x mod 2 = 0). apply even_mod. auto.
rewrite H1 in H. rewrite H1. simpl in H. rewrite Zmod_mod in H. auto.
assert (x mod 2 = 1). apply odd_mod. auto.
rewrite H1 in H. rewrite H1. rewrite Zplus_mod_idemp_r in H.
assert (y = 1 + y - 1). lia. rewrite H2. rewrite Zminus_mod.
rewrite H. auto.
Qed.
Let div_mod_mod_2_even :
forall a : Z, a mod 2 = 0 -> (a / p) mod 2 = (a mod p) mod 2.
Proof.
intros a H.
rewrite <- Zmult_1_l with (n := (a / p)).
rewrite <- p_odd. rewrite Zmult_mod_idemp_l.
apply eq_mod_2. rewrite <- Z_div_mod_eq. auto. auto.
Qed.
Let div_mod_mod_2_odd :
forall a : Z, a mod 2 = 1 -> (a / p) mod 2 = (a mod p + 1) mod 2.
Proof.
intros a H.
rewrite <- Zmult_1_l with (n := (a / p)).
rewrite <- p_odd. rewrite Zmult_mod_idemp_l.
apply eq_mod_2. rewrite Zplus_assoc. rewrite <- Z_div_mod_eq.
rewrite p_odd. rewrite <- Zplus_mod_idemp_l. rewrite H. auto. auto.
Qed.
Variable q : Z.
Hypothesis q_not_0 : q mod p <> 0.
Hypothesis q_postive : q >= 0.
Let r (u : {u : Z | 1 <= u <= p - 1 /\ u mod 2 = 0}) :=
(q * `u) mod p.
Let r_positive :
forall (u : {u : Z | 1 <= u <= p - 1 /\ u mod 2 = 0}), 0 <= r u.
Proof.
intro u. assert (0 <= r u < p). unfold r.
apply mod_pos_bound with (b := p). apply p_positive. lia.
Qed.
Let r' (u : {u : Z | 1 <= u <= p - 1 /\ u mod 2 = 0}) :=
((Zpower (-1) (r u)) * (r u)) mod p.
Let r''_ex (u : {u : Z | 1 <= u <= p - 1 /\ u mod 2 = 0}) :
1 <= (r' u) <= p - 1 /\ (r' u) mod 2 = 0.
Proof with (exact p_not_0 || exact p_positive || auto).
split.
assert (0 <= r' u < p). unfold r'. apply mod_pos_bound...
destruct H.
split. assert (r' u <> 0).
intro H2. unfold r' in H2. apply Zmod_divide in H2...
apply prime_mult in H2... destruct H2.
apply prime_divide_pow in H1; [ | apply r_positive | auto].
apply Zdivide_opp_r_rev with (b := 1) in H1.
apply Zdivide_1 in H1. destruct p_prime. lia.
unfold r in H1. apply Zdivide_mod in H1.
rewrite <- Zmod_div_mod in H1... 2 : reflexivity.
apply Zmod_divide in H1... apply prime_mult in H1...
destruct H1. apply Zdivide_mod in H1...
assert (0 < `u). destruct u. simpl. lia.
assert (0 <> `u). lia.
apply Zdivide_bounds in H1... destruct u. simpl in *.
destruct p_prime. repeat (rewrite abs_eq in H1; [ | lia]).
lia. lia. lia.
unfold r'.
destruct (even_or_odd (r u)).
rewrite minus_one_pow_even; [ | apply r_positive | auto].
rewrite mul_1_l. unfold r. rewrite Zmod_mod.
apply even_mod. auto.
rewrite minus_one_pow_odd; [ | apply r_positive | auto].
assert (((p - r u) mod p) mod 2 = 0).
assert (0 <= p - r u < p).
assert (0 <= r u < p). unfold r. apply mod_pos_bound. apply p_positive.
assert (0 <> r u). intro H1. apply Zodd_equiv in H.
rewrite <- H1 in H. contradiction.
lia. rewrite Zmod_small with (n := p) by auto. apply odd_mod in H.
rewrite Zminus_mod. rewrite p_odd. rewrite H. auto.
rewrite <- H0. f_equal. rewrite Zminus_mod. f_equal.
unfold r. rewrite Zmod_mod. rewrite Z_mod_same; [ | apply p_positive_rev].
auto.
Qed.
Let r'' (u : {u : Z | 1 <= u <= p - 1 /\ u mod 2 = 0}) :=
exist (fun k => 1 <= k <= p - 1 /\ k mod 2 = 0) (r' u) (r''_ex u).
Let r''_inj1 :
forall u1 u2, r' u1 = r' u2 -> Even (r u1) -> Odd (r u2) -> r u1 = r u2.
Proof.
intros u1 u2 Heq Hodd Heven.
exfalso.
unfold r' in Heq.
rewrite minus_one_pow_even in Heq; [ | apply r_positive | auto].
rewrite mul_1_l in Heq.
rewrite minus_one_pow_odd in Heq; [ | apply r_positive | auto].
unfold r in Heq.
rewrite Zmult_mod_idemp_r in Heq.
rewrite Zmult_comm with (n := -1) in Heq.
rewrite Zmod_mod in Heq.
rewrite <- Zmult_assoc in Heq. rewrite <- opp_eq_mul_m1 in Heq.
apply simpl_mod_p in Heq; [ | auto | auto].
destruct u1 as [u1' Hu1']. destruct u2 as [u2' Hu2'].
assert (u1' mod p = u1'). apply Zmod_small. lia.
assert (u2' mod p = u2'). apply Zmod_small. lia.
simpl in Heq.
rewrite Z_mod_nz_opp_full in Heq by lia.
rewrite H in Heq. rewrite H0 in Heq.
assert (u1' mod 2 = ((p mod 2) - (u2' mod 2)) mod 2).
rewrite <- Zminus_mod. f_equal. auto.
destruct Hu1' as [Hu1' Hu1'']. destruct Hu2' as [Hu2' Hu2''].
rewrite Hu1'' in H1. rewrite Hu2'' in H1. rewrite p_odd in H1.
discriminate.
Qed.
Let r''_injective :
injection r''.
Proof.
intros u1 u2 H.
unfold r'' in H.
apply proj1_inj in H. simpl in H.
assert (H0: r' u1 = r' u2). auto.
unfold r' in H0.
assert (r u1 = r u2).
destruct (even_or_odd (r u1)).
rewrite minus_one_pow_even in H0; [ | apply r_positive | auto].
rewrite mul_1_l in H0.
destruct (even_or_odd (r u2)).
rewrite minus_one_pow_even in H0; [ | apply r_positive | auto].
rewrite mul_1_l in H0.
unfold r in H0.
repeat (rewrite Zmod_mod in H0). unfold r. auto.
(* Odd (r u2) *)
apply r''_inj1. auto. auto. auto.
(* Odd (r u1) *)
rewrite minus_one_pow_odd in H0; [ | apply r_positive | auto].
destruct (even_or_odd (r u2)).
symmetry. apply r''_inj1. auto. auto. auto.
(* Odd (r u1) *)
rewrite minus_one_pow_odd in H0; [ | apply r_positive | auto].
apply simpl_mod_p in H0; [ | auto | ].
unfold r in H0. repeat (rewrite Zmod_mod in H0). unfold r. auto.
intro H3. apply Zmod_divide in H3. apply Zdivide_opp_r in H3.
simpl in H3. apply Zdivide_mod in H3. rewrite Zmod_1_l in H3.
discriminate. destruct p_prime. auto. apply p_not_0.
unfold r in H1.
apply simpl_mod_p in H1; [ | auto | auto].
destruct u1 as [u1' Hu1']. destruct u2 as [u2' Hu2'].
assert (u1' mod p = u1'). apply Zmod_small. lia.
assert (u2' mod p = u2'). apply Zmod_small. lia.
apply proj1_inj. simpl in *. congruence.
Qed.
Let r''_surjective :
surjection r''.
Proof with (exact p_not_0 || exact p_positive ||
exact p_positive_rev || auto).
intro y. destruct y as [y' Hy']. destruct Hy' as [Hy'1 Hy'2].
cut (exists x, r' x = y'). intro H. destruct H as [x Hx]. exists x.
unfold r''. apply proj1_inj. auto.
assert (exists a : Z, (q * a) mod p = y').
destruct (not_0_inversible_mod_p q p p_prime q_not_0) as [b Hb].
exists (y' * b). rewrite Zmult_comm. rewrite <- Zmult_assoc.
rewrite <- Zmult_mod_idemp_r. rewrite Hb. rewrite Zmult_1_r.
apply Zmod_small. lia.
destruct H as [a Ha].
destruct (even_or_odd (a mod p)).
assert (1 <= a mod p <= p - 1 /\ (a mod p) mod 2 = 0).
split. assert (0 <= a mod p < p). apply mod_pos_bound...
assert (a mod p <> 0). intro H1. rewrite <- Zmult_mod_idemp_r in Ha.
rewrite H1 in Ha. rewrite mul_0_r in Ha. rewrite Zmod_0_l in Ha.
lia. lia. apply even_mod. auto.
exists (exist _ (a mod p) H0).
unfold r'. unfold r. simpl.
repeat (rewrite Zmult_mod_idemp_r). rewrite Ha.
rewrite minus_one_pow_even; [ | lia | auto]. rewrite mul_1_l.
rewrite Zmult_mod_idemp_r. auto. apply even_mod. auto.
(* Odd (a mod p) *)
assert (1 <= p - a mod p <= p - 1 /\ (p - a mod p) mod 2 = 0).
split. assert (0 <= a mod p < p). apply mod_pos_bound...
assert (a mod p <> 0). intro H1. rewrite H1 in H. rewrite odd_mod in H.
discriminate. lia. rewrite odd_mod in H.
rewrite Zminus_mod. rewrite H. rewrite p_odd. auto.
exists (exist _ (p - a mod p) H0).
unfold r'. unfold r. simpl.
repeat (rewrite Zmult_mod_idemp_r).
repeat (rewrite Zmult_minus_distr_l with (p := q)).
assert (((q * p - q * (a mod p)) mod p) = p - y').
rewrite Zminus_mod. rewrite Zmult_mod. rewrite Z_mod_same...
rewrite mul_0_r. rewrite Zmod_0_l. rewrite Zmult_mod_idemp_r.
rewrite Ha. rewrite <- Z_mod_same with (a := p)... rewrite Zminus_mod_idemp_l.
apply Zmod_small. lia. rewrite <- Zmult_mod_idemp_r. repeat (rewrite H1).
assert (Odd (p - y')).
apply odd_mod. rewrite Zminus_mod. rewrite p_odd. rewrite Hy'2. auto.
rewrite minus_one_pow_odd. assert (-1 * (p - y') = y' + -1 * p). lia.
rewrite H3. rewrite Z_mod_plus_full. apply Zmod_small. lia. lia. auto.
Qed.
Let card_R :
cardinality {u : Z | 1 <= u <= p - 1 /\ u mod 2 = 0} (Z.to_nat ((p - 1) / 2)).
Proof.
assert (forall u : {u : Z | 1 <= u <= p - 1 /\ u mod 2 = 0}, (Z.to_nat ((`u - 1) / 2) < Z.to_nat ((p - 1) / 2))%nat).
intro u. destruct u as [u' Hu']. destruct Hu' as [Hu'1 Hu'2]. simpl.
apply Nat2Z.inj_lt.
repeat (rewrite Z2Nat.id by (apply Z_div_pos; destruct p_prime; lia)).
apply Zdiv_lt_upper_bound. lia. rewrite Zmult_comm.
rewrite <- Z_div_exact_full_2. lia. lia. rewrite Zminus_mod.
rewrite p_odd. auto.
exists (fun u : {u : Z | 1 <= u <= p - 1 /\ u mod 2 = 0} =>
(exist _ (Z.to_nat ((`u - 1) / 2)) (H u))).
apply bijection_inversible.
assert (forall n : {k : nat | (k < Z.to_nat ((p - 1) / 2))%nat},
1 <= 2 + 2 * (Z.of_nat `n) <= p - 1 /\ (2 + 2 * (Z.of_nat `n)) mod 2 = 0).
intro n. destruct n as [n' Hn']. unfold proj1_sig. split.
assert (0 <= Z.of_nat n'). apply Nat2Z.is_nonneg.
assert (Z.of_nat (S n') <= Z.of_nat (Z.to_nat ((p - 1) / 2))). apply Nat2Z.inj_le. auto.
rewrite Z2Nat.id in H1. apply Zmult_le_compat_l with (p := 2) in H1.
rewrite <- Z_div_exact_full_2 in H1. rewrite Nat2Z.inj_succ in H1.
lia. lia. rewrite Zminus_mod. rewrite p_odd. auto. lia.
apply Z_div_pos. lia. destruct p_prime; lia.
rewrite Zmult_comm. rewrite Z_mod_plus_full. auto.
exists (fun n : {k : nat | (k < Z.to_nat ((p - 1) / 2))%nat} =>
exist _ (2 + 2 * (Z.of_nat `n)) (H0 n)).
unfold proj1_sig. split.
intro u. destruct u as [u' Hu']. destruct Hu' as [Hu' Hu''].
apply proj1_inj. unfold proj1_sig.
rewrite Z2Nat.id. assert (u' - 1 = 2 * ((u' - 1) / 2) + ((u' - 1) mod 2)).
apply Z_div_mod_eq. lia. assert ((u' - 1) mod 2 = 1).
rewrite Zminus_mod. rewrite Hu''. auto. lia. apply Z_div_pos. lia.
lia.
intro y. destruct y as [y' Hy'].
apply proj1_inj. unfold proj1_sig.
assert (2 + 2 * Z.of_nat y' - 1 = 1 + of_nat y' * 2). lia.
rewrite H1. rewrite Z_div_plus_full. simpl. apply Nat2Z.id. lia.
Qed.
Let R_finite :
finite {u : Z | 1 <= u <= p - 1 /\ u mod 2 = 0}.
Proof.
exists (Z.to_nat ((p - 1) / 2)). apply card_R.
Qed.
Let mlt := ZpZmult p.
Let mlt_comm := ZpZmult_comm p.
Let mlt_assoc := ZpZmult_assoc p.
Let one_id := one_idemp p p_prime.
Let P := product Z mlt mlt_comm mlt_assoc 1 _ R_finite (fun x => `x).
Let P_not_0 :
P mod p <> 0.
Proof.
unfold P. apply product_property_conservation.