Mercurial > hg > Members > kono > Proof > category
annotate HomReasoning.agda @ 790:1e7319868d77
Sets is CCC
| author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Fri, 19 Apr 2019 23:42:19 +0900 |
| parents | ca5eba647990 |
| children | dca4b29553cb |
| rev | line source |
|---|---|
| 56 | 1 module HomReasoning where |
| 31 | 2 |
| 3 -- Shinji KONO <kono@ie.u-ryukyu.ac.jp> | |
| 4 | |
| 5 open import Category -- https://github.com/konn/category-agda | |
| 6 open import Level | |
| 7 open Functor | |
| 8 | |
| 9 -- F(f) | |
| 10 -- F(a) ---→ F(b) | |
| 11 -- | | | |
| 12 -- |t(a) |t(b) G(f)t(a) = t(b)F(f) | |
| 13 -- | | | |
| 14 -- v v | |
| 15 -- G(a) ---→ G(b) | |
| 16 -- G(f) | |
| 17 | |
| 18 record IsNTrans {c₁ c₂ ℓ c₁′ c₂′ ℓ′ : Level} (D : Category c₁ c₂ ℓ) (C : Category c₁′ c₂′ ℓ′) | |
| 19 ( F G : Functor D C ) | |
| 20 (TMap : (A : Obj D) → Hom C (FObj F A) (FObj G A)) | |
| 21 : Set (suc (c₁ ⊔ c₂ ⊔ ℓ ⊔ c₁′ ⊔ c₂′ ⊔ ℓ′)) where | |
| 22 field | |
| 130 | 23 commute : {a b : Obj D} {f : Hom D a b} |
| 31 | 24 → C [ C [ ( FMap G f ) o ( TMap a ) ] ≈ C [ (TMap b ) o (FMap F f) ] ] |
| 25 | |
| 130 | 26 record NTrans {c₁ c₂ ℓ c₁′ c₂′ ℓ′ : Level} (domain : Category c₁ c₂ ℓ) (codomain : Category c₁′ c₂′ ℓ′) |
| 27 (F G : Functor domain codomain ) | |
| 31 | 28 : Set (suc (c₁ ⊔ c₂ ⊔ ℓ ⊔ c₁′ ⊔ c₂′ ⊔ ℓ′)) where |
| 29 field | |
| 30 TMap : (A : Obj domain) → Hom codomain (FObj F A) (FObj G A) | |
| 31 isNTrans : IsNTrans domain codomain F G TMap | |
| 32 | |
| 33 | |
| 34 module ≈-Reasoning {c₁ c₂ ℓ : Level} (A : Category c₁ c₂ ℓ) where | |
| 35 open import Relation.Binary.Core | |
| 36 | |
| 37 _o_ : {a b c : Obj A } ( x : Hom A a b ) ( y : Hom A c a ) → Hom A c b | |
| 38 x o y = A [ x o y ] | |
| 39 | |
| 40 _≈_ : {a b : Obj A } → Rel (Hom A a b) ℓ | |
| 41 x ≈ y = A [ x ≈ y ] | |
| 42 | |
| 43 infixr 9 _o_ | |
| 44 infix 4 _≈_ | |
| 45 | |
| 46 refl-hom : {a b : Obj A } { x : Hom A a b } → x ≈ x | |
| 47 refl-hom = IsEquivalence.refl (IsCategory.isEquivalence ( Category.isCategory A )) | |
| 48 | |
| 49 trans-hom : {a b : Obj A } { x y z : Hom A a b } → | |
| 50 x ≈ y → y ≈ z → x ≈ z | |
| 51 trans-hom b c = ( IsEquivalence.trans (IsCategory.isEquivalence ( Category.isCategory A ))) b c | |
| 52 | |
| 53 -- some short cuts | |
| 54 | |
| 55 car : {a b c : Obj A } {x y : Hom A a b } { f : Hom A c a } → | |
| 56 x ≈ y → ( x o f ) ≈ ( y o f ) | |
| 787 | 57 car eq = ( IsCategory.o-resp-≈ ( Category.isCategory A )) ( refl-hom ) eq |
| 58 | |
| 59 car1 : { c₁ c₂ ℓ : Level} (A : Category c₁ c₂ ℓ) {a b c : Obj A } {x y : Hom A a b } { f : Hom A c a } → | |
| 60 A [ x ≈ y ] → A [ A [ x o f ] ≈ A [ y o f ] ] | |
| 61 car1 A eq = ( IsCategory.o-resp-≈ ( Category.isCategory A )) ( IsEquivalence.refl (IsCategory.isEquivalence ( Category.isCategory A )) ) eq | |
| 31 | 62 |
| 63 cdr : {a b c : Obj A } {x y : Hom A a b } { f : Hom A b c } → | |
| 64 x ≈ y → f o x ≈ f o y | |
| 787 | 65 cdr eq = ( IsCategory.o-resp-≈ ( Category.isCategory A )) eq (refl-hom ) |
| 66 | |
| 67 cdr1 : { c₁ c₂ ℓ : Level} (A : Category c₁ c₂ ℓ) {a b c : Obj A } {x y : Hom A a b } { f : Hom A b c } → | |
| 68 A [ x ≈ y ] → A [ A [ f o x ] ≈ A [ f o y ] ] | |
| 69 cdr1 A eq = ( IsCategory.o-resp-≈ ( Category.isCategory A )) eq (IsEquivalence.refl (IsCategory.isEquivalence ( Category.isCategory A )) ) | |
| 31 | 70 |
| 71 id : (a : Obj A ) → Hom A a a | |
| 72 id a = (Id {_} {_} {_} {A} a) | |
| 73 | |
|
479
a5034bdf6f38
Comma Category with A B C
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
460
diff
changeset
|
74 idL : {a b : Obj A } { f : Hom A a b } → id b o f ≈ f |
| 31 | 75 idL = IsCategory.identityL (Category.isCategory A) |
| 76 | |
| 77 idR : {a b : Obj A } { f : Hom A a b } → f o id a ≈ f | |
| 78 idR = IsCategory.identityR (Category.isCategory A) | |
| 79 | |
| 80 sym : {a b : Obj A } { f g : Hom A a b } → f ≈ g → g ≈ f | |
| 81 sym = IsEquivalence.sym (IsCategory.isEquivalence (Category.isCategory A)) | |
| 82 | |
| 455 | 83 sym-hom = sym |
| 84 | |
|
299
8c72f5284bc8
remove module parameter from yoneda functor
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
253
diff
changeset
|
85 -- working on another cateogry |
|
8c72f5284bc8
remove module parameter from yoneda functor
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
253
diff
changeset
|
86 idL1 : { c₁ c₂ ℓ : Level} (A : Category c₁ c₂ ℓ) {a b : Obj A } { f : Hom A b a } → A [ A [ Id {_} {_} {_} {A} a o f ] ≈ f ] |
|
8c72f5284bc8
remove module parameter from yoneda functor
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
253
diff
changeset
|
87 idL1 A = IsCategory.identityL (Category.isCategory A) |
|
8c72f5284bc8
remove module parameter from yoneda functor
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
253
diff
changeset
|
88 |
|
8c72f5284bc8
remove module parameter from yoneda functor
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
253
diff
changeset
|
89 idR1 : { c₁ c₂ ℓ : Level} (A : Category c₁ c₂ ℓ) {a b : Obj A } { f : Hom A a b } → A [ A [ f o Id {_} {_} {_} {A} a ] ≈ f ] |
|
8c72f5284bc8
remove module parameter from yoneda functor
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
253
diff
changeset
|
90 idR1 A = IsCategory.identityR (Category.isCategory A) |
|
8c72f5284bc8
remove module parameter from yoneda functor
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
253
diff
changeset
|
91 |
| 781 | 92 open import Relation.Binary.PropositionalEquality using ( _≡_ ) |
| 693 | 93 ≈←≡ : {a b : Obj A } { x y : Hom A a b } → (x≈y : x ≡ y ) → x ≈ y |
| 781 | 94 ≈←≡ _≡_.refl = refl-hom |
| 75 | 95 |
| 693 | 96 -- Ho← to prove this? |
| 97 -- ≡←≈ : {a b : Obj A } { x y : Hom A a b } → (x≈y : x ≈ y ) → x ≡ y | |
| 98 -- ≡←≈ x≈y = irr x≈y | |
| 99 | |
| 75 | 100 ≡-cong : { c₁′ c₂′ ℓ′ : Level} {B : Category c₁′ c₂′ ℓ′} {x y : Obj B } { a b : Hom B x y } {x' y' : Obj A } → |
|
420
3e44951b9bdb
refl in free-monoid trouble
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
299
diff
changeset
|
101 (f : Hom B x y → Hom A x' y' ) → a ≡ b → f a ≈ f b |
| 781 | 102 ≡-cong f _≡_.refl = ≈←≡ _≡_.refl |
| 75 | 103 |
| 67 | 104 -- cong-≈ : { c₁′ c₂′ ℓ′ : Level} {B : Category c₁′ c₂′ ℓ′} {x y : Obj B } { a b : Hom B x y } {x' y' : Obj A } → |
| 105 -- B [ a ≈ b ] → (f : Hom B x y → Hom A x' y' ) → f a ≈ f b | |
| 75 | 106 -- cong-≈ eq f = {!!} |
| 67 | 107 |
|
69
84a150c980ce
generalized distr and assco1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
67
diff
changeset
|
108 assoc : {a b c d : Obj A } {f : Hom A c d} {g : Hom A b c} {h : Hom A a b} |
|
299
8c72f5284bc8
remove module parameter from yoneda functor
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
253
diff
changeset
|
109 → f o ( g o h ) ≈ ( f o g ) o h |
| 31 | 110 assoc = IsCategory.associative (Category.isCategory A) |
| 111 | |
|
299
8c72f5284bc8
remove module parameter from yoneda functor
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
253
diff
changeset
|
112 -- working on another cateogry |
|
8c72f5284bc8
remove module parameter from yoneda functor
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
253
diff
changeset
|
113 assoc1 : { c₁ c₂ ℓ : Level} (A : Category c₁ c₂ ℓ) {a b c d : Obj A } {f : Hom A c d} {g : Hom A b c} {h : Hom A a b} |
|
69
84a150c980ce
generalized distr and assco1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
67
diff
changeset
|
114 → A [ A [ f o ( A [ g o h ] ) ] ≈ A [ ( A [ f o g ] ) o h ] ] |
|
299
8c72f5284bc8
remove module parameter from yoneda functor
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
253
diff
changeset
|
115 assoc1 A = IsCategory.associative (Category.isCategory A) |
|
69
84a150c980ce
generalized distr and assco1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
67
diff
changeset
|
116 |
|
84a150c980ce
generalized distr and assco1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
67
diff
changeset
|
117 distr : { c₁ c₂ ℓ : Level} {A : Category c₁ c₂ ℓ} |
|
84a150c980ce
generalized distr and assco1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
67
diff
changeset
|
118 { c₁′ c₂′ ℓ′ : Level} {D : Category c₁′ c₂′ ℓ′} (T : Functor D A) → {a b c : Obj D} {g : Hom D b c} { f : Hom D a b } |
|
84a150c980ce
generalized distr and assco1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
67
diff
changeset
|
119 → A [ FMap T ( D [ g o f ] ) ≈ A [ FMap T g o FMap T f ] ] |
| 75 | 120 distr T = IsFunctor.distr ( isFunctor T ) |
| 121 | |
| 122 resp : {a b c : Obj A} {f g : Hom A a b} {h i : Hom A b c} → f ≈ g → h ≈ i → (h o f) ≈ (i o g) | |
| 123 resp = IsCategory.o-resp-≈ (Category.isCategory A) | |
| 124 | |
| 125 fcong : { c₁ c₂ ℓ : Level} {C : Category c₁ c₂ ℓ} | |
| 126 { c₁′ c₂′ ℓ′ : Level} {D : Category c₁′ c₂′ ℓ′} {a b : Obj C} {f g : Hom C a b} → (T : Functor C D) → C [ f ≈ g ] → D [ FMap T f ≈ FMap T g ] | |
| 127 fcong T = IsFunctor.≈-cong (isFunctor T) | |
| 31 | 128 |
| 129 open NTrans | |
|
69
84a150c980ce
generalized distr and assco1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
67
diff
changeset
|
130 nat : { c₁ c₂ ℓ : Level} {A : Category c₁ c₂ ℓ} { c₁′ c₂′ ℓ′ : Level} {D : Category c₁′ c₂′ ℓ′} |
|
84a150c980ce
generalized distr and assco1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
67
diff
changeset
|
131 {a b : Obj D} {f : Hom D a b} {F G : Functor D A } |
| 31 | 132 → (η : NTrans D A F G ) |
|
69
84a150c980ce
generalized distr and assco1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
67
diff
changeset
|
133 → A [ A [ FMap G f o TMap η a ] ≈ A [ TMap η b o FMap F f ] ] |
| 130 | 134 nat η = IsNTrans.commute ( isNTrans η ) |
| 31 | 135 |
| 460 | 136 nat1 : { c₁ c₂ ℓ : Level} {A : Category c₁ c₂ ℓ} { c₁′ c₂′ ℓ′ : Level} {D : Category c₁′ c₂′ ℓ′} |
| 137 {a b : Obj D} {F G : Functor D A } | |
| 138 → (η : NTrans D A F G ) → (f : Hom D a b) | |
| 139 → A [ A [ FMap G f o TMap η a ] ≈ A [ TMap η b o FMap F f ] ] | |
| 140 nat1 η f = IsNTrans.commute ( isNTrans η ) | |
| 141 | |
| 606 | 142 infix 3 _∎ |
| 31 | 143 infixr 2 _≈⟨_⟩_ _≈⟨⟩_ |
| 168 | 144 infixr 2 _≈↑⟨_⟩_ |
| 31 | 145 infix 1 begin_ |
| 146 | |
| 147 ------ If we have this, for example, as an axiom of a category, we can use ≡-Reasoning directly | |
| 148 -- ≈-to-≡ : {a b : Obj A } { x y : Hom A a b } → A [ x ≈ y ] → x ≡ y | |
| 149 -- ≈-to-≡ refl-hom = refl | |
| 150 | |
| 151 data _IsRelatedTo_ { a b : Obj A } ( x y : Hom A a b ) : | |
| 152 Set (suc (c₁ ⊔ c₂ ⊔ ℓ )) where | |
| 153 relTo : (x≈y : x ≈ y ) → x IsRelatedTo y | |
| 154 | |
| 155 begin_ : { a b : Obj A } { x y : Hom A a b } → | |
| 156 x IsRelatedTo y → x ≈ y | |
| 157 begin relTo x≈y = x≈y | |
| 158 | |
| 159 _≈⟨_⟩_ : { a b : Obj A } ( x : Hom A a b ) → { y z : Hom A a b } → | |
| 160 x ≈ y → y IsRelatedTo z → x IsRelatedTo z | |
| 161 _ ≈⟨ x≈y ⟩ relTo y≈z = relTo (trans-hom x≈y y≈z) | |
| 162 | |
| 168 | 163 _≈↑⟨_⟩_ : { a b : Obj A } ( x : Hom A a b ) → { y z : Hom A a b } → |
| 164 y ≈ x → y IsRelatedTo z → x IsRelatedTo z | |
| 165 _ ≈↑⟨ y≈x ⟩ relTo y≈z = relTo (trans-hom ( sym y≈x ) y≈z) | |
| 166 | |
| 31 | 167 _≈⟨⟩_ : { a b : Obj A } ( x : Hom A a b ) → { y : Hom A a b } → x IsRelatedTo y → x IsRelatedTo y |
| 168 _ ≈⟨⟩ x∼y = x∼y | |
| 169 | |
| 170 _∎ : { a b : Obj A } ( x : Hom A a b ) → x IsRelatedTo x | |
| 171 _∎ _ = relTo refl-hom | |
| 172 | |
| 56 | 173 -- an example |
| 174 | |
| 175 Lemma61 : {c₁ c₂ ℓ : Level} (A : Category c₁ c₂ ℓ) → | |
| 176 { a : Obj A } ( b : Obj A ) → | |
| 177 ( f : Hom A a b ) | |
| 178 → A [ A [ (Id {_} {_} {_} {A} b) o f ] ≈ f ] | |
| 179 Lemma61 c b g = -- IsCategory.identityL (Category.isCategory c) | |
| 606 | 180 let open ≈-Reasoning (c) in begin |
| 181 c [ ( Id {_} {_} {_} {c} b ) o g ] | |
| 56 | 182 ≈⟨ IsCategory.identityL (Category.isCategory c) ⟩ |
| 183 g | |
| 184 ∎ | |
| 253 | 185 |
| 186 Lemma62 : {c₁ c₂ ℓ : Level} (A : Category c₁ c₂ ℓ) → | |
| 187 { a b : Obj A } → | |
| 188 ( f g : Hom A a b ) | |
| 189 → A [ A [ (Id {_} {_} {_} {A} b) o f ] ≈ A [ (Id {_} {_} {_} {A} b) o g ] ] | |
| 190 → A [ g ≈ f ] | |
| 191 Lemma62 A {a} {b} f g 1g=1f = let open ≈-Reasoning A in | |
| 192 begin | |
| 193 g | |
| 194 ≈↑⟨ idL ⟩ | |
| 195 id b o g | |
| 196 ≈↑⟨ 1g=1f ⟩ | |
| 197 id b o f | |
| 198 ≈⟨ idL ⟩ | |
| 199 f | |
| 200 ∎ |