The forgetful functor from R-modules preserves filtered colimits.

Forgetful functors from algebraic categories usually don't preserve colimits. However, they tend to preserve filtered colimits.

In this file, we start with a ring R, a small filtered category J and a functor F : J ⥤ ModuleCat R. We show that the colimit of F ⋙ forget₂ (ModuleCat R) AddCommGroupCat (in AddCommGroupCat) carries the structure of an R-module, thereby showing that the forgetful functor forget₂ (ModuleCat R) AddCommGroupCat preserves filtered colimits. In particular, this implies that forget (ModuleCat R) preserves filtered colimits.

@[inline, reducible]

abbrev ModuleCat.FilteredColimits.M {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) : AddCommGroupCat

The colimit of F ⋙ forget₂ (ModuleCat R) AddCommGroupCat in the category AddCommGroupCat. In the following, we will show that this has the structure of an R-module.

Equations

• ModuleCat.FilteredColimits.M F = AddCommGroupCat.FilteredColimits.colimit (CategoryTheory.Functor.comp F (CategoryTheory.forget₂ (ModuleCat R) AddCommGroupCat))

@[inline, reducible]

abbrev ModuleCat.FilteredColimits.M.mk {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) : (j : J) × ↑(F.obj j) → ↑(ModuleCat.FilteredColimits.M F)

The canonical projection into the colimit, as a quotient type.

Equations

• ModuleCat.FilteredColimits.M.mk F = Quot.mk (CategoryTheory.Limits.Types.Quot.Rel (CategoryTheory.Functor.comp F (CategoryTheory.forget (ModuleCat R))))

theorem ModuleCat.FilteredColimits.M.mk_eq {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) (x : (j : J) × ↑(F.obj j)) (y : (j : J) × ↑(F.obj j)) (h : ∃ (k : J) (f : x.fst ⟶ k) (g : y.fst ⟶ k), (F.map f) x.snd = (F.map g) y.snd) : ModuleCat.FilteredColimits.M.mk F x = ModuleCat.FilteredColimits.M.mk F y

def ModuleCat.FilteredColimits.colimitSMulAux {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) (r : R) (x : (j : J) × ↑(F.obj j)) : ↑(ModuleCat.FilteredColimits.M F)

The "unlifted" version of scalar multiplication in the colimit.

Equations

• ModuleCat.FilteredColimits.colimitSMulAux F r x = ModuleCat.FilteredColimits.M.mk F { fst := x.fst, snd := r • x.snd }

theorem ModuleCat.FilteredColimits.colimitSMulAux_eq_of_rel {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) (r : R) (x : (j : J) × ↑(F.obj j)) (y : (j : J) × ↑(F.obj j)) (h : CategoryTheory.Limits.Types.FilteredColimit.Rel (CategoryTheory.Functor.comp F (CategoryTheory.forget (ModuleCat R))) x y) : ModuleCat.FilteredColimits.colimitSMulAux F r x = ModuleCat.FilteredColimits.colimitSMulAux F r y

instance ModuleCat.FilteredColimits.colimitHasSMul {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) : SMul R ↑(ModuleCat.FilteredColimits.M F)

Scalar multiplication in the colimit. See also colimitSMulAux.

Equations

• ModuleCat.FilteredColimits.colimitHasSMul F = { smul := fun (r : R) (x : ↑(ModuleCat.FilteredColimits.M F)) => Quot.lift (ModuleCat.FilteredColimits.colimitSMulAux F r) ⋯ x }

@[simp]

theorem ModuleCat.FilteredColimits.colimit_smul_mk_eq {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) (r : R) (x : (j : J) × ↑(F.obj j)) : r • ModuleCat.FilteredColimits.M.mk F x = ModuleCat.FilteredColimits.M.mk F { fst := x.fst, snd := r • x.snd }

instance ModuleCat.FilteredColimits.colimitMulAction {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) : MulAction R ↑(ModuleCat.FilteredColimits.M F)

Equations

• ModuleCat.FilteredColimits.colimitMulAction F = MulAction.mk ⋯ ⋯

instance ModuleCat.FilteredColimits.colimitSMulWithZero {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) : SMulWithZero R ↑(ModuleCat.FilteredColimits.M F)

Equations

• ModuleCat.FilteredColimits.colimitSMulWithZero F = let __src := ModuleCat.FilteredColimits.colimitMulAction F; SMulWithZero.mk ⋯

instance ModuleCat.FilteredColimits.colimitModule {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) : Module R ↑(ModuleCat.FilteredColimits.M F)

Equations

• ModuleCat.FilteredColimits.colimitModule F = let __src := ModuleCat.FilteredColimits.colimitMulAction F; let __src_1 := ModuleCat.FilteredColimits.colimitSMulWithZero F; Module.mk ⋯ ⋯

def ModuleCat.FilteredColimits.colimit {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) : ModuleCatMax R

The bundled R-module giving the filtered colimit of a diagram.

Equations

• ModuleCat.FilteredColimits.colimit F = ModuleCat.of R ↑(ModuleCat.FilteredColimits.M F)

def ModuleCat.FilteredColimits.coconeMorphism {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) (j : J) : F.obj j ⟶ ModuleCat.FilteredColimits.colimit F

The linear map from a given R-module in the diagram to the colimit module.

Equations

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

def ModuleCat.FilteredColimits.colimitCocone {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) : CategoryTheory.Limits.Cocone F

The cocone over the proposed colimit module.

Equations

• ModuleCat.FilteredColimits.colimitCocone F = { pt := ModuleCat.FilteredColimits.colimit F, ι := { app := ModuleCat.FilteredColimits.coconeMorphism F, naturality := ⋯ } }

def ModuleCat.FilteredColimits.colimitDesc {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) (t : CategoryTheory.Limits.Cocone F) : ModuleCat.FilteredColimits.colimit F ⟶ t.pt

Given a cocone t of F, the induced monoid linear map from the colimit to the cocone point. We already know that this is a morphism between additive groups. The only thing left to see is that it is a linear map, i.e. preserves scalar multiplication.

Equations

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

def ModuleCat.FilteredColimits.colimitCoconeIsColimit {R : Type u} [Ring R] {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J (ModuleCatMax R)) : CategoryTheory.Limits.IsColimit (ModuleCat.FilteredColimits.colimitCocone F)

The proposed colimit cocone is a colimit in ModuleCat R.

Equations

• ModuleCat.FilteredColimits.colimitCoconeIsColimit F = { desc := ModuleCat.FilteredColimits.colimitDesc F, fac := ⋯, uniq := ⋯ }

instance ModuleCat.FilteredColimits.forget₂AddCommGroupPreservesFilteredColimits {R : Type u} [Ring R] : CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ (ModuleCat R) AddCommGroupCat)

Equations

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

instance ModuleCat.FilteredColimits.forgetPreservesFilteredColimits {R : Type u} [Ring R] : CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget (ModuleCat R))

Equations

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