This repository has been archived by the owner on Jul 24, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 298
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat(category_theory/filtered): finite diagrams in filtered categorie…
…s admit cocones (#4026) This is only step towards eventual results about filtered colimits commuting with finite limits, `forget CommRing` preserving filtered colimits, and applications to `Scheme`. Co-authored-by: Scott Morrison <scott.morrison@gmail.com>
- Loading branch information
Showing
5 changed files
with
237 additions
and
30 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,34 @@ | ||
/- | ||
Copyright (c) 2019 Scott Morrison. All rights reserved. | ||
Released under Apache 2.0 license as described in the file LICENSE. | ||
Authors: Scott Morrison | ||
-/ | ||
import data.fintype.basic | ||
import category_theory.discrete_category | ||
|
||
universes v u | ||
|
||
namespace category_theory | ||
|
||
instance discrete_fintype {α : Type*} [fintype α] : fintype (discrete α) := | ||
by { dsimp [discrete], apply_instance } | ||
|
||
instance discrete_hom_fintype {α : Type*} [decidable_eq α] (X Y : discrete α) : fintype (X ⟶ Y) := | ||
by { apply ulift.fintype } | ||
|
||
/-- A category with a `fintype` of objects, and a `fintype` for each morphism space. -/ | ||
class fin_category (J : Type v) [small_category J] := | ||
(decidable_eq_obj : decidable_eq J . tactic.apply_instance) | ||
(fintype_obj : fintype J . tactic.apply_instance) | ||
(decidable_eq_hom : Π (j j' : J), decidable_eq (j ⟶ j') . tactic.apply_instance) | ||
(fintype_hom : Π (j j' : J), fintype (j ⟶ j') . tactic.apply_instance) | ||
|
||
attribute [instance] fin_category.decidable_eq_obj fin_category.fintype_obj | ||
fin_category.decidable_eq_hom fin_category.fintype_hom | ||
|
||
-- We need a `decidable_eq` instance here to construct `fintype` on the morphism spaces. | ||
instance fin_category_discrete_of_decidable_fintype (J : Type v) [decidable_eq J] [fintype J] : | ||
fin_category (discrete J) := | ||
{ } | ||
|
||
end category_theory |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters