Mercurial > hg > Members > kono > Proof > galois
annotate src/Solvable.agda @ 274:691b2ee844ef
...
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Thu, 26 Jan 2023 01:16:38 +0900 |
parents | 6d1619d9f880 |
children | 386ece574509 |
rev | line source |
---|---|
0 | 1 open import Level hiding ( suc ; zero ) |
2 open import Algebra | |
4 | 3 module Solvable {n m : Level} (G : Group n m ) where |
0 | 4 |
4 | 5 open import Data.Unit |
6 open import Function.Inverse as Inverse using (_↔_; Inverse; _InverseOf_) | |
6 | 7 open import Function |
7 | 8 open import Data.Nat hiding (_⊔_) -- using (ℕ; suc; zero) |
4 | 9 open import Relation.Nullary |
10 open import Data.Empty | |
5 | 11 open import Data.Product |
70 | 12 open import Relation.Binary.PropositionalEquality hiding ( [_] ; sym ) |
5 | 13 |
0 | 14 |
4 | 15 open Group G |
14 | 16 open import Gutil G |
0 | 17 |
4 | 18 [_,_] : Carrier → Carrier → Carrier |
19 [ g , h ] = g ⁻¹ ∙ h ⁻¹ ∙ g ∙ h | |
0 | 20 |
5 | 21 data Commutator (P : Carrier → Set (Level.suc n ⊔ m)) : (f : Carrier) → Set (Level.suc n ⊔ m) where |
6 | 22 comm : {g h : Carrier} → P g → P h → Commutator P [ g , h ] |
23 ccong : {f g : Carrier} → f ≈ g → Commutator P f → Commutator P g | |
5 | 24 |
25 deriving : ( i : ℕ ) → Carrier → Set (Level.suc n ⊔ m) | |
26 deriving 0 x = Lift (Level.suc n ⊔ m) ⊤ | |
27 deriving (suc i) x = Commutator (deriving i) x | |
28 | |
116
6022d00a0690
check termination problem remains
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
75
diff
changeset
|
29 open import Relation.Binary.HeterogeneousEquality as HE using (_≅_ ) |
6022d00a0690
check termination problem remains
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
75
diff
changeset
|
30 |
6022d00a0690
check termination problem remains
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
75
diff
changeset
|
31 deriving-subst : { i : ℕ } → {x y : Carrier } → x ≈ y → (dx : deriving i x ) → deriving i y |
6022d00a0690
check termination problem remains
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
75
diff
changeset
|
32 deriving-subst {zero} {x} {y} x=y dx = lift tt |
6022d00a0690
check termination problem remains
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
75
diff
changeset
|
33 deriving-subst {suc i} {x} {y} x=y dx = ccong x=y dx |
6022d00a0690
check termination problem remains
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
75
diff
changeset
|
34 |
68 | 35 record solvable : Set (Level.suc n ⊔ m) where |
4 | 36 field |
37 dervied-length : ℕ | |
38 end : (x : Carrier ) → deriving dervied-length x → x ≈ ε | |
6 | 39 |
40 -- deriving stage is closed on multiplication and inversion | |
41 | |
42 import Relation.Binary.Reasoning.Setoid as EqReasoning | |
43 | |
122 | 44 open EqReasoning (Algebra.Group.setoid G) |
45 | |
8 | 46 lemma4 : (g h : Carrier ) → [ h , g ] ≈ [ g , h ] ⁻¹ |
47 lemma4 g h = begin | |
48 [ h , g ] ≈⟨ grefl ⟩ | |
49 (h ⁻¹ ∙ g ⁻¹ ∙ h ) ∙ g ≈⟨ assoc _ _ _ ⟩ | |
50 h ⁻¹ ∙ g ⁻¹ ∙ (h ∙ g) ≈⟨ ∙-cong grefl (gsym (∙-cong lemma6 lemma6)) ⟩ | |
51 h ⁻¹ ∙ g ⁻¹ ∙ ((h ⁻¹) ⁻¹ ∙ (g ⁻¹) ⁻¹) ≈⟨ ∙-cong grefl (lemma5 _ _ ) ⟩ | |
52 h ⁻¹ ∙ g ⁻¹ ∙ (g ⁻¹ ∙ h ⁻¹) ⁻¹ ≈⟨ assoc _ _ _ ⟩ | |
53 h ⁻¹ ∙ (g ⁻¹ ∙ (g ⁻¹ ∙ h ⁻¹) ⁻¹) ≈⟨ ∙-cong grefl (lemma5 (g ⁻¹ ∙ h ⁻¹ ) g ) ⟩ | |
54 h ⁻¹ ∙ (g ⁻¹ ∙ h ⁻¹ ∙ g) ⁻¹ ≈⟨ lemma5 (g ⁻¹ ∙ h ⁻¹ ∙ g) h ⟩ | |
55 (g ⁻¹ ∙ h ⁻¹ ∙ g ∙ h) ⁻¹ ≈⟨ grefl ⟩ | |
56 [ g , h ] ⁻¹ | |
122 | 57 ∎ |
6 | 58 |
59 deriving-inv : { i : ℕ } → { x : Carrier } → deriving i x → deriving i ( x ⁻¹ ) | |
60 deriving-inv {zero} {x} (lift tt) = lift tt | |
75 | 61 deriving-inv {suc i} {_} (comm x x₁ ) = ccong (lemma4 _ _) (comm x₁ x) |
6 | 62 deriving-inv {suc i} {x} (ccong eq ix ) = ccong (⁻¹-cong eq) ( deriving-inv ix ) |
63 | |
70 | 64 idcomtr : (g : Carrier ) → [ g , ε ] ≈ ε |
65 idcomtr g = begin | |
66 (g ⁻¹ ∙ ε ⁻¹ ∙ g ∙ ε ) ≈⟨ ∙-cong (∙-cong (∙-cong grefl (sym lemma3 )) grefl ) grefl ⟩ | |
67 (g ⁻¹ ∙ ε ∙ g ∙ ε ) ≈⟨ ∙-cong (∙-cong (proj₂ identity _) grefl) grefl ⟩ | |
68 (g ⁻¹ ∙ g ∙ ε ) ≈⟨ ∙-cong (proj₁ inverse _ ) grefl ⟩ | |
69 ( ε ∙ ε ) ≈⟨ proj₂ identity _ ⟩ | |
70 ε | |
122 | 71 ∎ |
70 | 72 |
73 idcomtl : (g : Carrier ) → [ ε , g ] ≈ ε | |
74 idcomtl g = begin | |
75 (ε ⁻¹ ∙ g ⁻¹ ∙ ε ∙ g ) ≈⟨ ∙-cong (proj₂ identity _) grefl ⟩ | |
76 (ε ⁻¹ ∙ g ⁻¹ ∙ g ) ≈⟨ ∙-cong (∙-cong (sym lemma3 ) grefl ) grefl ⟩ | |
77 (ε ∙ g ⁻¹ ∙ g ) ≈⟨ ∙-cong (proj₁ identity _) grefl ⟩ | |
78 (g ⁻¹ ∙ g ) ≈⟨ proj₁ inverse _ ⟩ | |
79 ε | |
122 | 80 ∎ |
121 | 81 |
186 | 82 deriving-ε : { i : ℕ } → deriving i ε |
83 deriving-ε {zero} = lift tt | |
84 deriving-ε {suc i} = ccong (idcomtr ε) (comm deriving-ε deriving-ε) | |
85 | |
122 | 86 comm-refl : {f g : Carrier } → f ≈ g → [ f , g ] ≈ ε |
87 comm-refl {f} {g} f=g = begin | |
88 f ⁻¹ ∙ g ⁻¹ ∙ f ∙ g | |
89 ≈⟨ ∙-cong (∙-cong (∙-cong (⁻¹-cong f=g ) grefl ) f=g ) grefl ⟩ | |
90 g ⁻¹ ∙ g ⁻¹ ∙ g ∙ g | |
91 ≈⟨ ∙-cong (assoc _ _ _ ) grefl ⟩ | |
92 g ⁻¹ ∙ (g ⁻¹ ∙ g ) ∙ g | |
93 ≈⟨ ∙-cong (∙-cong grefl (proj₁ inverse _) ) grefl ⟩ | |
94 g ⁻¹ ∙ ε ∙ g | |
95 ≈⟨ ∙-cong (proj₂ identity _) grefl ⟩ | |
96 g ⁻¹ ∙ g | |
97 ≈⟨ proj₁ inverse _ ⟩ | |
98 ε | |
99 ∎ | |
121 | 100 |
122 | 101 comm-resp : {g h g1 h1 : Carrier } → g ≈ g1 → h ≈ h1 → [ g , h ] ≈ [ g1 , h1 ] |
102 comm-resp {g} {h} {g1} {h1} g=g1 h=h1 = ∙-cong (∙-cong (∙-cong (⁻¹-cong g=g1 ) (⁻¹-cong h=h1 )) g=g1 ) h=h1 | |
103 |