# Constructing colimits from finite colimits and filtered colimits #

We construct colimits of size w from finite colimits and filtered colimits of size w. Since w-sized colimits are constructed from coequalizers and w-sized coproducts, it suffices to construct w-sized coproducts from finite coproducts and w-sized filtered colimits.

The idea is simple: to construct coproducts of shape α, we take the colimit of the filtered diagram of all coproducts of finite subsets of α.

We also deduce the dual statement by invoking the original statement in Cᵒᵖ.

@[simp]
theorem CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinset_obj {C : Type u} {α : Type w} (F : ) (s : ) :
= fun (x : { x : // x s }) => F.obj x
@[simp]
theorem CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinset_map {C : Type u} {α : Type w} (F : ) :
∀ {x Y : } (h : x Y), = CategoryTheory.Limits.Sigma.desc fun (y : { x_1 : // x_1 x }) => CategoryTheory.Limits.Sigma.ι (fun (x : { x : // x Y }) => F.obj x) y,

If C has finite coproducts, a functor Discrete α ⥤ C lifts to a functor Finset (Discrete α) ⥤ C by taking coproducts.

Equations
• One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimitCocone_isColimit_desc {C : Type u} {α : Type w} (F : ) (s : ) :
.desc s = CategoryTheory.Limits.colimit.desc { pt := s.pt, ι := { app := fun (t : ) => CategoryTheory.Limits.Sigma.desc fun (x : { x : // x t }) => s.app x, naturality := } }

If C has finite coproducts and filtered colimits, we can construct arbitrary coproducts by taking the colimit of the diagram formed by the coproducts of finite sets over the indexing type.

Equations
• One or more equations did not get rendered due to their size.
Instances For