Floris van Doorn
|
4828afa781
|
fix(hott): small fixes after rebasing
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
5e4441cb43
|
fix(functor.equivalence): comment out sorry's
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
49cb516c71
|
feat(category.limit): prove that the limit functor is right adjoint to the diagonal map
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
36dfb61a3e
|
feat(category.limits): prove that yoneda preserves limits
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
46dba4ee5e
|
refactor(category): move some files to subfolders, and create file with basic functors
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
e14754a337
|
feat(category): start on proof of yoneda preserves limits and limit functor is left adjoint
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
a99a99f047
|
feat(hit/quotient): prove the flattening lemma
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
aa9f32a3bd
|
fix(init/equiv): make transport not an instance
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
f2d07ca23c
|
feat(category): various small changes in category theory
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
de1c47eda9
|
feat(categories): add exponential laws for categories
also give nicer rules to construct equalities between (pre)categories
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
0e7b7af1da
|
refactor(category): add new folder functor, split adjoint file into separate files
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
3f0d8c0a8c
|
feat(category.adjoint): prove more about functors
|
2015-11-08 14:04:58 -08:00 |
|
Floris van Doorn
|
18ec5f8b85
|
feat(categories): prove introduction rule for equivalences
|
2015-11-08 14:04:58 -08:00 |
|
Floris van Doorn
|
448178a045
|
feat(category.functor2): prove that the category of functors is complete and cocomplete if the codomain is
|
2015-11-08 14:04:58 -08:00 |
|
Floris van Doorn
|
3b7afad6ad
|
feat(category.hset): prove that the category of sets is cocomplete
|
2015-11-08 14:04:58 -08:00 |
|
Floris van Doorn
|
c7fd29f854
|
feat(category): start with the introduction rule for equivalences
|
2015-11-08 14:04:58 -08:00 |
|
Leonardo de Moura
|
50186e2db3
|
feat(library/class_instance_resolution): add old type class resolution procedure back to be able to compile HoTT library
|
2015-11-08 14:04:58 -08:00 |
|
Leonardo de Moura
|
d1e111fd6c
|
fix(hott,frontends/lean,library,library/tactic): make sure we can still compile the HoTT library
|
2015-11-08 14:04:55 -08:00 |
|
Leonardo de Moura
|
8ee214f133
|
checkpoint: new numeral encoding
|
2015-11-08 14:04:55 -08:00 |
|
Leonardo de Moura
|
744d1cba3d
|
feat(library,hott,frontends/lean): avoid keywords with hyphen
|
2015-11-08 14:04:54 -08:00 |
|
Jakob von Raumer
|
d508ceccec
|
feat(hott/homotpy) add join operator, and prove two basic lemmas
|
2015-10-13 09:59:24 -07:00 |
|
Floris van Doorn
|
115dedbd1c
|
fix(hott): notation spacing and markdown files
|
2015-10-02 16:26:10 -07:00 |
|
Leonardo de Moura
|
ede23a3267
|
feat(hott,library): add additional spacing hints
|
2015-09-30 17:41:44 -07:00 |
|
Floris van Doorn
|
aac13a2ee7
|
fix(hott): minor changes to merge ulrik and my commits
|
2015-09-28 09:09:22 -07:00 |
|
Floris van Doorn
|
2264759060
|
feat(category): define colimits as dual of limits
|
2015-09-28 09:09:22 -07:00 |
|
Floris van Doorn
|
df73931a6d
|
feat(category.opposite): prove that the opposite of a univalent category is univalent
|
2015-09-28 09:09:22 -07:00 |
|
Floris van Doorn
|
099bd95ebd
|
feat(category.limits): prove that being complete is a mere proposition for categories
|
2015-09-28 09:09:22 -07:00 |
|
Floris van Doorn
|
51edd0ad1d
|
feat(category.constructions.hset): prove that the category of sets is complete
|
2015-09-28 09:09:22 -07:00 |
|
Floris van Doorn
|
f82d1bd566
|
feat(category): add limits in a category
|
2015-09-28 09:09:22 -07:00 |
|
Floris van Doorn
|
6e23305c5d
|
feat(category): define terminal, initial, indiscrete and sum category
|
2015-09-28 09:09:21 -07:00 |
|
Floris van Doorn
|
3c4c722afd
|
feat(hott): port more from chapters 4 and 6 of the book
|
2015-09-28 09:09:21 -07:00 |
|
Ulrik Buchholtz
|
c6f3f6f3f4
|
feat(hott): prove HoTT book 7.5.4 and 7.5.5
|
2015-09-28 09:09:21 -07:00 |
|
Ulrik Buchholtz
|
25ed9d6e5a
|
feat(hott): prove HoTT book Theorem 4.7.7
|
2015-09-28 09:09:21 -07:00 |
|
Ulrik Buchholtz
|
ed1029641a
|
fix(hott/*): update book.md and clean up homotopy.connectedness
|
2015-09-28 09:09:21 -07:00 |
|
Ulrik Buchholtz
|
2c22501084
|
feat(hott): prove HoTT book Theorem 4.7.6
|
2015-09-28 09:09:21 -07:00 |
|
Leonardo de Moura
|
33f46fd137
|
feat(library/blast): parse blast tactic and invoke stub
|
2015-09-25 12:45:16 -07:00 |
|
Leonardo de Moura
|
4a6ff8058d
|
fix(hott): import commands (some files have been moved to different directories)
|
2015-09-25 09:39:45 -07:00 |
|
Ulrik Buchholtz
|
384a366e0f
|
refactor(hott): move homotopy hits to new homotopy folder
|
2015-09-24 22:52:33 -04:00 |
|
Floris van Doorn
|
732897340d
|
fix(types): change some definitions to theorems
|
2015-09-11 23:35:21 -07:00 |
|
Floris van Doorn
|
fb364f8bc7
|
feat(types): add more equivalences between combinations of type constructors
|
2015-09-11 23:35:21 -07:00 |
|
Floris van Doorn
|
e84b22864f
|
feat(hott): various changes in the HoTT library
|
2015-09-11 23:35:21 -07:00 |
|
Floris van Doorn
|
bd3aa9cf54
|
feat(category): prove Theorem 9.5.9 from the HoTT book
|
2015-09-11 23:35:21 -07:00 |
|
Floris van Doorn
|
1a3b363467
|
feat(category): prove that the yoneda embedding is an embedding
|
2015-09-11 23:35:21 -07:00 |
|
Floris van Doorn
|
fd89aa77a3
|
feat(hott): prove Yoneda lemma
|
2015-09-11 23:35:21 -07:00 |
|
Floris van Doorn
|
817d691237
|
fix(hott/init/nat): also define ℕ in the top-level in HoTT
|
2015-09-11 23:35:21 -07:00 |
|
Leonardo de Moura
|
cae2271818
|
refactor(hott/algebra/category/adjoint): rewrite expensive proof
see #815
|
2015-09-01 16:59:14 -07:00 |
|
Floris van Doorn
|
a8964adb9c
|
fix(hott): make sure there are no sorry's visible
|
2015-09-01 15:17:46 -07:00 |
|
Floris van Doorn
|
7e52c49dce
|
feat(hott): many changes is the HoTT library
Prove that 'is_left_adjoint F' is a mere proposition, although this proof is commented out because it takes ~10 seconds
|
2015-09-01 15:17:46 -07:00 |
|
Floris van Doorn
|
f555120428
|
feat(types/eq): add general encode-decode method
|
2015-09-01 15:17:46 -07:00 |
|
Floris van Doorn
|
f4892db432
|
feat(types.trunc): prove the principle of unique choice
|
2015-09-01 15:17:46 -07:00 |
|