d8a616fa70
I made some major changes in the library. I wanted to wait with pushing until I had finished the formalization of the slice functor, but for some reason that is very hard to formalize, requiring a lot of casts and manipulation of casts. So I've not finished that yet. Changes: - in multiple files make more use of variables - move dependent congr_arg theorems to logic.cast and proof them using heq (which doesn't involve nested inductions and fewer casts). - prove some more theorems involving heq, e.g. hcongr_arg3 (which do not require piext) - in theorems where casts are used in the statement use eq.rec_on instead of eq.drec_on - in category split basic into basic, functor and natural_transformation - change the definition of functor to use fully bundled categories. @avigad: this means that the file semisimplicial.lean will also need changes (but I'm quite sure nothing major). You want to define the fully bundled category Delta, and use only fully bundled categories (type and ᵒᵖ are notations for the fully bundled Type_category and Opposite if you open namespace category.ops). If you want I can make the changes. - lots of minor changes
32 lines
1.3 KiB
Text
32 lines
1.3 KiB
Text
-- Copyright (c) 2014 Floris van Doorn. All rights reserved.
|
||
-- Released under Apache 2.0 license as described in the file LICENSE.
|
||
-- Author: Floris van Doorn
|
||
|
||
import .constructions
|
||
|
||
open eq eq.ops category functor natural_transformation category.ops prod category.product
|
||
|
||
namespace adjoint
|
||
--representable functor
|
||
|
||
definition foo (C : Category) : C ×c C ⇒ C ×c C := functor.id
|
||
|
||
-- definition Hom (C : Category) : Cᵒᵖ ×c C ⇒ type :=
|
||
-- functor.mk (λ a, hom (pr1 a) (pr2 a))
|
||
-- (λ a b f h, pr2 f ∘ h ∘ pr1 f)
|
||
-- (λ a, funext (λh, !id_left ⬝ !id_right))
|
||
-- (λ a b c g f, funext (λh,
|
||
-- show (pr2 g ∘ pr2 f) ∘ h ∘ (pr1 f ∘ pr1 g) = pr2 g ∘ (pr2 f ∘ h ∘ pr1 f) ∘ pr1 g, from sorry))
|
||
--I'm lazy, waiting for automation to fill this
|
||
|
||
variables (C D : Category)
|
||
|
||
-- private definition aux_prod_cat [instance] : category (obD × obD) := prod_category (opposite.opposite D) D
|
||
|
||
-- definition adjoint.{l} (F : C ⇒ D) (G : D ⇒ C) :=
|
||
-- --@natural_transformation _ Type.{l} (Dᵒᵖ ×c D) type_category.{l+1} (Hom D) (Hom D)
|
||
-- sorry
|
||
--(@functor.compose _ _ _ _ _ _ (Hom D) (@product.prod_functor _ _ _ _ _ _ (Dᵒᵖ) D sorry sorry))
|
||
--(Hom C ∘f sorry)
|
||
--product.prod_functor (opposite.opposite_functor F) (functor.ID D)
|
||
end adjoint
|