Categorical (co)products

This file defines (co)products as special cases of (co)limits.

A product is the categorical generalization of the object Π i, f i where f : ι → C. It is a limit cone over the diagram formed by f, implemented by converting f into a functor Discrete ι ⥤ C.

A coproduct is the dual concept.

Main definitions

• a Fan is a cone over a discrete category
• Fan.mk constructs a fan from an indexed collection of maps
• a Pi is a limit (Discrete.functor f)

Each of these has a dual.

Implementation notes

As with the other special shapes in the limits library, all the definitions here are given as abbreviations of the general statements for limits, so all the simp lemmas and theorems about general limits can be used.

@[inline, reducible]

abbrev CategoryTheory.Limits.Fan {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] (f : β → C) : Type (max (max w u) v)

A fan over f : β → C consists of a collection of maps from an object P to every f b.

@[inline, reducible]

abbrev CategoryTheory.Limits.Cofan {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] (f : β → C) : Type (max (max w u) v)

A cofan over f : β → C consists of a collection of maps from every f b to an object P.

@[simp]

theorem CategoryTheory.Limits.Fan.mk_π_app {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (P : C) (p : (b : β) → P ⟶ f b) (X : CategoryTheory.Discrete β) : (CategoryTheory.Limits.Fan.mk P p).π.app X = p X.as

@[simp]

theorem CategoryTheory.Limits.Fan.mk_pt {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (P : C) (p : (b : β) → P ⟶ f b) : (CategoryTheory.Limits.Fan.mk P p).pt = P

def CategoryTheory.Limits.Fan.mk {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (P : C) (p : (b : β) → P ⟶ f b) : CategoryTheory.Limits.Fan f

A fan over f : β → C consists of a collection of maps from an object P to every f b.

@[simp]

theorem CategoryTheory.Limits.Cofan.mk_pt {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (P : C) (p : (b : β) → f b ⟶ P) : (CategoryTheory.Limits.Cofan.mk P p).pt = P

@[simp]

theorem CategoryTheory.Limits.Cofan.mk_ι_app {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (P : C) (p : (b : β) → f b ⟶ P) (X : CategoryTheory.Discrete β) : (CategoryTheory.Limits.Cofan.mk P p).ι.app X = p X.as

def CategoryTheory.Limits.Cofan.mk {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (P : C) (p : (b : β) → f b ⟶ P) : CategoryTheory.Limits.Cofan f

A cofan over f : β → C consists of a collection of maps from every f b to an object P.

def CategoryTheory.Limits.Fan.proj {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (p : CategoryTheory.Limits.Fan f) (j : β) : p.pt ⟶ f j

Get the jth map in the fan

def CategoryTheory.Limits.Cofan.proj {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (p : CategoryTheory.Limits.Cofan f) (j : β) : f j ⟶ p.pt

Get the jth map in the cofan

@[simp]

theorem CategoryTheory.Limits.fan_mk_proj {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (P : C) (p : (b : β) → P ⟶ f b) (j : β) : CategoryTheory.Limits.Fan.proj (CategoryTheory.Limits.Fan.mk P p) j = p j

@[simp]

theorem CategoryTheory.Limits.cofan_mk_proj {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (P : C) (p : (b : β) → f b ⟶ P) (j : β) : CategoryTheory.Limits.Cofan.proj (CategoryTheory.Limits.Cofan.mk P p) j = p j

@[inline, reducible]

abbrev CategoryTheory.Limits.HasProduct {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] (f : β → C) : Prop

An abbreviation for HasLimit (Discrete.functor f).

@[inline, reducible]

abbrev CategoryTheory.Limits.HasCoproduct {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] (f : β → C) : Prop

An abbreviation for HasColimit (Discrete.functor f).

@[simp]

theorem CategoryTheory.Limits.mkFanLimit_lift {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (t : CategoryTheory.Limits.Fan f) (lift : (s : CategoryTheory.Limits.Fan f) → s.pt ⟶ t.pt) (fac : autoParam (∀ (s : CategoryTheory.Limits.Fan f) (j : β), CategoryTheory.CategoryStruct.comp (lift s) (CategoryTheory.Limits.Fan.proj t j) = CategoryTheory.Limits.Fan.proj s j) _auto✝) (uniq : autoParam (∀ (s : CategoryTheory.Limits.Fan f) (m : s.pt ⟶ t.pt), (∀ (j : β), CategoryTheory.CategoryStruct.comp m (CategoryTheory.Limits.Fan.proj t j) = CategoryTheory.Limits.Fan.proj s j) → m = lift s) _auto✝) (s : CategoryTheory.Limits.Fan f) : CategoryTheory.Limits.IsLimit.lift (CategoryTheory.Limits.mkFanLimit t lift) s = lift s

def CategoryTheory.Limits.mkFanLimit {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (t : CategoryTheory.Limits.Fan f) (lift : (s : CategoryTheory.Limits.Fan f) → s.pt ⟶ t.pt) (fac : autoParam (∀ (s : CategoryTheory.Limits.Fan f) (j : β), CategoryTheory.CategoryStruct.comp (lift s) (CategoryTheory.Limits.Fan.proj t j) = CategoryTheory.Limits.Fan.proj s j) _auto✝) (uniq : autoParam (∀ (s : CategoryTheory.Limits.Fan f) (m : s.pt ⟶ t.pt), (∀ (j : β), CategoryTheory.CategoryStruct.comp m (CategoryTheory.Limits.Fan.proj t j) = CategoryTheory.Limits.Fan.proj s j) → m = lift s) _auto✝) : CategoryTheory.Limits.IsLimit t

Make a fan f into a limit fan by providing lift, fac, and uniq -- just a convenience lemma to avoid having to go through Discrete

@[simp]

theorem CategoryTheory.Limits.mkCofanColimit_desc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (s : CategoryTheory.Limits.Cofan f) (desc : (t : CategoryTheory.Limits.Cofan f) → s.pt ⟶ t.pt) (fac : autoParam (∀ (t : CategoryTheory.Limits.Cofan f) (j : β), CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Cofan.proj s j) (desc t) = CategoryTheory.Limits.Cofan.proj t j) _auto✝) (uniq : autoParam (∀ (t : CategoryTheory.Limits.Cofan f) (m : s.pt ⟶ t.pt), (∀ (j : β), CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Cofan.proj s j) m = CategoryTheory.Limits.Cofan.proj t j) → m = desc t) _auto✝) (t : CategoryTheory.Limits.Cofan f) : CategoryTheory.Limits.IsColimit.desc (CategoryTheory.Limits.mkCofanColimit s desc) t = desc t

def CategoryTheory.Limits.mkCofanColimit {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} (s : CategoryTheory.Limits.Cofan f) (desc : (t : CategoryTheory.Limits.Cofan f) → s.pt ⟶ t.pt) (fac : autoParam (∀ (t : CategoryTheory.Limits.Cofan f) (j : β), CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Cofan.proj s j) (desc t) = CategoryTheory.Limits.Cofan.proj t j) _auto✝) (uniq : autoParam (∀ (t : CategoryTheory.Limits.Cofan f) (m : s.pt ⟶ t.pt), (∀ (j : β), CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Cofan.proj s j) m = CategoryTheory.Limits.Cofan.proj t j) → m = desc t) _auto✝) : CategoryTheory.Limits.IsColimit s

Make a cofan f into a colimit cofan by providing desc, fac, and uniq -- just a convenience lemma to avoid having to go through Discrete

@[inline, reducible]

abbrev CategoryTheory.Limits.HasProductsOfShape (β : Type v) (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] : Prop

An abbreviation for HasLimitsOfShape (Discrete f).

@[inline, reducible]

abbrev CategoryTheory.Limits.HasCoproductsOfShape (β : Type v) (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] : Prop

An abbreviation for HasColimitsOfShape (Discrete f).

@[inline, reducible]

abbrev CategoryTheory.Limits.piObj {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] (f : β → C) [CategoryTheory.Limits.HasProduct f] : C

piObj f computes the product of a family of elements f. (It is defined as an abbreviation for limit (Discrete.functor f), so for most facts about piObj f, you will just use general facts about limits.)

@[inline, reducible]

abbrev CategoryTheory.Limits.sigmaObj {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] (f : β → C) [CategoryTheory.Limits.HasCoproduct f] : C

sigmaObj f computes the coproduct of a family of elements f. (It is defined as an abbreviation for colimit (Discrete.functor f), so for most facts about sigmaObj f, you will just use general facts about colimits.)

def CategoryTheory.Limits.«term∏_» : Lean.ParserDescr

notation for categorical products

def CategoryTheory.Limits.«term∐_» : Lean.ParserDescr

notation for categorical coproducts

@[inline, reducible]

abbrev CategoryTheory.Limits.Pi.π {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] (f : β → C) [CategoryTheory.Limits.HasProduct f] (b : β) : ∏ f ⟶ f b

The b-th projection from the pi object over f has the form ∏ f ⟶ f b.

@[inline, reducible]

abbrev CategoryTheory.Limits.Sigma.ι {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] (f : β → C) [CategoryTheory.Limits.HasCoproduct f] (b : β) : f b ⟶ ∐ f

The b-th inclusion into the sigma object over f has the form f b ⟶ ∐ f.

theorem CategoryTheory.Limits.Pi.hom_ext {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} [CategoryTheory.Limits.HasProduct f] {X : C} (g₁ : X ⟶ ∏ f) (g₂ : X ⟶ ∏ f) (h : ∀ (b : β), CategoryTheory.CategoryStruct.comp g₁ (CategoryTheory.Limits.Pi.π f b) = CategoryTheory.CategoryStruct.comp g₂ (CategoryTheory.Limits.Pi.π f b)) : g₁ = g₂

theorem CategoryTheory.Limits.Sigma.hom_ext {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} [CategoryTheory.Limits.HasCoproduct f] {X : C} (g₁ : ∐ f ⟶ X) (g₂ : ∐ f ⟶ X) (h : ∀ (b : β), CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι f b) g₁ = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι f b) g₂) : g₁ = g₂

def CategoryTheory.Limits.productIsProduct {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] (f : β → C) [CategoryTheory.Limits.HasProduct f] : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.Fan.mk (∏ f) (CategoryTheory.Limits.Pi.π f))

The fan constructed of the projections from the product is limiting.

def CategoryTheory.Limits.coproductIsCoproduct {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] (f : β → C) [CategoryTheory.Limits.HasCoproduct f] : CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.Cofan.mk (∐ f) (CategoryTheory.Limits.Sigma.ι f))

The cofan constructed of the inclusions from the coproduct is colimiting.

@[simp]

theorem CategoryTheory.Limits.Pi.π_comp_eqToHom_assoc {C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u_1} (f : J → C) [CategoryTheory.Limits.HasProduct f] {j : J} {j' : J} (w : j = j') {Z : C} (h : f j' ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π f j) (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom (_ : f j = f j')) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π f j') h

@[simp]

theorem CategoryTheory.Limits.Pi.π_comp_eqToHom {C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u_1} (f : J → C) [CategoryTheory.Limits.HasProduct f] {j : J} {j' : J} (w : j = j') : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π f j) (CategoryTheory.eqToHom (_ : f j = f j')) = CategoryTheory.Limits.Pi.π f j'

@[simp]

theorem CategoryTheory.Limits.Sigma.eqToHom_comp_ι_assoc {C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u_1} (f : J → C) [CategoryTheory.Limits.HasCoproduct f] {j : J} {j' : J} (w : j = j') {Z : C} (h : ∐ f ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom (_ : f j = f j')) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι f j') h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι f j) h

@[simp]

theorem CategoryTheory.Limits.Sigma.eqToHom_comp_ι {C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u_1} (f : J → C) [CategoryTheory.Limits.HasCoproduct f] {j : J} {j' : J} (w : j = j') : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom (_ : f j = f j')) (CategoryTheory.Limits.Sigma.ι f j') = CategoryTheory.Limits.Sigma.ι f j

@[inline, reducible]

abbrev CategoryTheory.Limits.Pi.lift {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} [CategoryTheory.Limits.HasProduct f] {P : C} (p : (b : β) → P ⟶ f b) : P ⟶ ∏ f

A collection of morphisms P ⟶ f b induces a morphism P ⟶ ∏ f.

@[inline, reducible]

abbrev CategoryTheory.Limits.Sigma.desc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} [CategoryTheory.Limits.HasCoproduct f] {P : C} (p : (b : β) → f b ⟶ P) : ∐ f ⟶ P

A collection of morphisms f b ⟶ P induces a morphism ∐ f ⟶ P.

@[inline, reducible]

abbrev CategoryTheory.Limits.Pi.map {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} {g : β → C} [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] (p : (b : β) → f b ⟶ g b) : ∏ f ⟶ ∏ g

Construct a morphism between categorical products (indexed by the same type) from a family of morphisms between the factors.

@[simp]

theorem CategoryTheory.Limits.Pi.map_id {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} [CategoryTheory.Limits.HasProduct f] : (CategoryTheory.Limits.Pi.map fun a => CategoryTheory.CategoryStruct.id (f a)) = CategoryTheory.CategoryStruct.id (∏ f)

theorem CategoryTheory.Limits.Pi.map_comp_map {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : α → C} {h : α → C} [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] [CategoryTheory.Limits.HasProduct h] (q : (a : α) → f a ⟶ g a) (q' : (a : α) → g a ⟶ h a) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.map q) (CategoryTheory.Limits.Pi.map q') = CategoryTheory.Limits.Pi.map fun a => CategoryTheory.CategoryStruct.comp (q a) (q' a)

instance CategoryTheory.Limits.Pi.map_mono {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} {g : β → C} [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] (p : (b : β) → f b ⟶ g b) [∀ (i : β), CategoryTheory.Mono (p i)] : CategoryTheory.Mono (CategoryTheory.Limits.Pi.map p)

def CategoryTheory.Limits.Pi.map' {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] (p : β → α) (q : (b : β) → f (p b) ⟶ g b) : ∏ f ⟶ ∏ g

Construct a morphism between categorical products from a family of morphisms between the factors.

@[simp]

theorem CategoryTheory.Limits.Pi.map'_comp_π_assoc {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] (p : β → α) (q : (b : β) → f (p b) ⟶ g b) (b : β) {Z : C} (h : g b ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.map' p q) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π g b) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π f (p b)) (CategoryTheory.CategoryStruct.comp (q b) h)

@[simp]

theorem CategoryTheory.Limits.Pi.map'_comp_π {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] (p : β → α) (q : (b : β) → f (p b) ⟶ g b) (b : β) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.map' p q) (CategoryTheory.Limits.Pi.π g b) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π f (p b)) (q b)

theorem CategoryTheory.Limits.Pi.map'_id_id {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} [CategoryTheory.Limits.HasProduct f] : (CategoryTheory.Limits.Pi.map' id fun a => CategoryTheory.CategoryStruct.id (f a)) = CategoryTheory.CategoryStruct.id (∏ f)

@[simp]

theorem CategoryTheory.Limits.Pi.map'_id {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : α → C} [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] (p : (b : α) → f b ⟶ g b) : CategoryTheory.Limits.Pi.map' id p = CategoryTheory.Limits.Pi.map p

theorem CategoryTheory.Limits.Pi.map'_comp_map' {β : Type w} {α : Type w₂} {γ : Type w₃} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} {h : γ → C} [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] [CategoryTheory.Limits.HasProduct h] (p : β → α) (p' : γ → β) (q : (b : β) → f (p b) ⟶ g b) (q' : (c : γ) → g (p' c) ⟶ h c) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.map' p q) (CategoryTheory.Limits.Pi.map' p' q') = CategoryTheory.Limits.Pi.map' (p ∘ p') fun c => CategoryTheory.CategoryStruct.comp (q (p' c)) (q' c)

theorem CategoryTheory.Limits.Pi.map'_comp_map {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} {h : β → C} [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] [CategoryTheory.Limits.HasProduct h] (p : β → α) (q : (b : β) → f (p b) ⟶ g b) (q' : (b : β) → g b ⟶ h b) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.map' p q) (CategoryTheory.Limits.Pi.map q') = CategoryTheory.Limits.Pi.map' p fun b => CategoryTheory.CategoryStruct.comp (q b) (q' b)

theorem CategoryTheory.Limits.Pi.map_comp_map' {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : α → C} {h : β → C} [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] [CategoryTheory.Limits.HasProduct h] (p : β → α) (q : (a : α) → f a ⟶ g a) (q' : (b : β) → g (p b) ⟶ h b) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.map q) (CategoryTheory.Limits.Pi.map' p q') = CategoryTheory.Limits.Pi.map' p fun b => CategoryTheory.CategoryStruct.comp (q (p b)) (q' b)

theorem CategoryTheory.Limits.Pi.map'_eq {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] {p : β → α} {p' : β → α} {q : (b : β) → f (p b) ⟶ g b} {q' : (b : β) → f (p' b) ⟶ g b} (hp : p = p') (hq : ∀ (b : β), CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom (_ : f (p' b) = f (p b))) (q b) = q' b) : CategoryTheory.Limits.Pi.map' p q = CategoryTheory.Limits.Pi.map' p' q'

@[inline, reducible]

abbrev CategoryTheory.Limits.Pi.mapIso {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} {g : β → C} [CategoryTheory.Limits.HasProductsOfShape β C] (p : (b : β) → f b ≅ g b) : ∏ f ≅ ∏ g

Construct an isomorphism between categorical products (indexed by the same type) from a family of isomorphisms between the factors.

@[inline, reducible]

abbrev CategoryTheory.Limits.Sigma.map {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} {g : β → C} [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] (p : (b : β) → f b ⟶ g b) : ∐ f ⟶ ∐ g

Construct a morphism between categorical coproducts (indexed by the same type) from a family of morphisms between the factors.

@[simp]

theorem CategoryTheory.Limits.Sigma.map_id {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} [CategoryTheory.Limits.HasCoproduct f] : (CategoryTheory.Limits.Sigma.map fun a => CategoryTheory.CategoryStruct.id (f a)) = CategoryTheory.CategoryStruct.id (∐ f)

theorem CategoryTheory.Limits.Sigma.map_comp_map {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : α → C} {h : α → C} [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] [CategoryTheory.Limits.HasCoproduct h] (q : (a : α) → f a ⟶ g a) (q' : (a : α) → g a ⟶ h a) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.map q) (CategoryTheory.Limits.Sigma.map q') = CategoryTheory.Limits.Sigma.map fun a => CategoryTheory.CategoryStruct.comp (q a) (q' a)

instance CategoryTheory.Limits.Sigma.map_epi {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} {g : β → C} [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] (p : (b : β) → f b ⟶ g b) [∀ (i : β), CategoryTheory.Epi (p i)] : CategoryTheory.Epi (CategoryTheory.Limits.Sigma.map p)

def CategoryTheory.Limits.Sigma.map' {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] (p : α → β) (q : (a : α) → f a ⟶ g (p a)) : ∐ f ⟶ ∐ g

Construct a morphism between categorical coproducts from a family of morphisms between the factors.

@[simp]

theorem CategoryTheory.Limits.Sigma.ι_comp_map'_assoc {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] (p : α → β) (q : (a : α) → f a ⟶ g (p a)) (a : α) {Z : C} (h : ∐ g ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι f a) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.map' p q) h) = CategoryTheory.CategoryStruct.comp (q a) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι g (p a)) h)

@[simp]

theorem CategoryTheory.Limits.Sigma.ι_comp_map' {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] (p : α → β) (q : (a : α) → f a ⟶ g (p a)) (a : α) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι f a) (CategoryTheory.Limits.Sigma.map' p q) = CategoryTheory.CategoryStruct.comp (q a) (CategoryTheory.Limits.Sigma.ι g (p a))

theorem CategoryTheory.Limits.Sigma.map'_id_id {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} [CategoryTheory.Limits.HasCoproduct f] : (CategoryTheory.Limits.Sigma.map' id fun a => CategoryTheory.CategoryStruct.id (f a)) = CategoryTheory.CategoryStruct.id (∐ f)

@[simp]

theorem CategoryTheory.Limits.Sigma.map'_id {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : α → C} [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] (p : (b : α) → f b ⟶ g b) : CategoryTheory.Limits.Sigma.map' id p = CategoryTheory.Limits.Sigma.map p

theorem CategoryTheory.Limits.Sigma.map'_comp_map' {β : Type w} {α : Type w₂} {γ : Type w₃} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} {h : γ → C} [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] [CategoryTheory.Limits.HasCoproduct h] (p : α → β) (p' : β → γ) (q : (a : α) → f a ⟶ g (p a)) (q' : (b : β) → g b ⟶ h (p' b)) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.map' p q) (CategoryTheory.Limits.Sigma.map' p' q') = CategoryTheory.Limits.Sigma.map' (p' ∘ p) fun a => CategoryTheory.CategoryStruct.comp (q a) (q' (p a))

theorem CategoryTheory.Limits.Sigma.map'_comp_map {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} {h : β → C} [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] [CategoryTheory.Limits.HasCoproduct h] (p : α → β) (q : (a : α) → f a ⟶ g (p a)) (q' : (b : β) → g b ⟶ h b) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.map' p q) (CategoryTheory.Limits.Sigma.map q') = CategoryTheory.Limits.Sigma.map' p fun a => CategoryTheory.CategoryStruct.comp (q a) (q' (p a))

theorem CategoryTheory.Limits.Sigma.map_comp_map' {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : α → C} {h : β → C} [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] [CategoryTheory.Limits.HasCoproduct h] (p : α → β) (q : (a : α) → f a ⟶ g a) (q' : (a : α) → g a ⟶ h (p a)) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.map q) (CategoryTheory.Limits.Sigma.map' p q') = CategoryTheory.Limits.Sigma.map' p fun a => CategoryTheory.CategoryStruct.comp (q a) (q' a)

theorem CategoryTheory.Limits.Sigma.map'_eq {β : Type w} {α : Type w₂} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : α → C} {g : β → C} [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] {p : α → β} {p' : α → β} {q : (a : α) → f a ⟶ g (p a)} {q' : (a : α) → f a ⟶ g (p' a)} (hp : p = p') (hq : ∀ (a : α), CategoryTheory.CategoryStruct.comp (q a) (CategoryTheory.eqToHom (_ : g (p a) = g (p' a))) = q' a) : CategoryTheory.Limits.Sigma.map' p q = CategoryTheory.Limits.Sigma.map' p' q'

@[inline, reducible]

abbrev CategoryTheory.Limits.Sigma.mapIso {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {f : β → C} {g : β → C} [CategoryTheory.Limits.HasCoproductsOfShape β C] (p : (b : β) → f b ≅ g b) : ∐ f ≅ ∐ g

Construct an isomorphism between categorical coproducts (indexed by the same type) from a family of isomorphisms between the factors.

@[simp]

theorem CategoryTheory.Limits.Pi.whiskerEquiv_hom {C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u_1} {K : Type u_2} {f : J → C} {g : K → C} (e : J ≃ K) (w : (j : J) → g (↑e j) ≅ f j) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] : (CategoryTheory.Limits.Pi.whiskerEquiv e w).hom = CategoryTheory.Limits.Pi.map' ↑e.symm fun k => CategoryTheory.CategoryStruct.comp (w (↑e.symm k)).inv (CategoryTheory.eqToHom (_ : g (↑e (↑e.symm k)) = g k))

@[simp]

theorem CategoryTheory.Limits.Pi.whiskerEquiv_inv {C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u_1} {K : Type u_2} {f : J → C} {g : K → C} (e : J ≃ K) (w : (j : J) → g (↑e j) ≅ f j) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] : (CategoryTheory.Limits.Pi.whiskerEquiv e w).inv = CategoryTheory.Limits.Pi.map' ↑e fun j => (w j).hom

def CategoryTheory.Limits.Pi.whiskerEquiv {C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u_1} {K : Type u_2} {f : J → C} {g : K → C} (e : J ≃ K) (w : (j : J) → g (↑e j) ≅ f j) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct g] : ∏ f ≅ ∏ g

Two products which differ by an equivalence in the indexing type, and up to isomorphism in the factors, are isomorphic.

@[simp]

theorem CategoryTheory.Limits.Sigma.whiskerEquiv_inv {C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u_1} {K : Type u_2} {f : J → C} {g : K → C} (e : J ≃ K) (w : (j : J) → g (↑e j) ≅ f j) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] : (CategoryTheory.Limits.Sigma.whiskerEquiv e w).inv = CategoryTheory.Limits.Sigma.map' ↑e.symm fun k => CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom (_ : g k = g (↑e (↑e.symm k)))) (w (↑e.symm k)).hom

@[simp]

theorem CategoryTheory.Limits.Sigma.whiskerEquiv_hom {C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u_1} {K : Type u_2} {f : J → C} {g : K → C} (e : J ≃ K) (w : (j : J) → g (↑e j) ≅ f j) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] : (CategoryTheory.Limits.Sigma.whiskerEquiv e w).hom = CategoryTheory.Limits.Sigma.map' ↑e fun j => (w j).inv

def CategoryTheory.Limits.Sigma.whiskerEquiv {C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u_1} {K : Type u_2} {f : J → C} {g : K → C} (e : J ≃ K) (w : (j : J) → g (↑e j) ≅ f j) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct g] : ∐ f ≅ ∐ g

Two coproducts which differ by an equivalence in the indexing type, and up to isomorphism in the factors, are isomorphic.

instance CategoryTheory.Limits.instHasProductSigmaFstSnd {C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_2} (f : ι → Type u_1) (g : (i : ι) → f i → C) [∀ (i : ι), CategoryTheory.Limits.HasProduct (g i)] [CategoryTheory.Limits.HasProduct fun i => ∏ g i] : CategoryTheory.Limits.HasProduct fun p => g p.fst p.snd

@[simp]

theorem CategoryTheory.Limits.piPiIso_hom {C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_2} (f : ι → Type u_1) (g : (i : ι) → f i → C) [∀ (i : ι), CategoryTheory.Limits.HasProduct (g i)] [CategoryTheory.Limits.HasProduct fun i => ∏ g i] : (CategoryTheory.Limits.piPiIso f g).hom = CategoryTheory.Limits.Pi.lift fun x => match x with | { fst := i, snd := x } => CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π (fun i => ∏ g i) i) (CategoryTheory.Limits.Pi.π (g i) x)

@[simp]

theorem CategoryTheory.Limits.piPiIso_inv {C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_2} (f : ι → Type u_1) (g : (i : ι) → f i → C) [∀ (i : ι), CategoryTheory.Limits.HasProduct (g i)] [CategoryTheory.Limits.HasProduct fun i => ∏ g i] : (CategoryTheory.Limits.piPiIso f g).inv = CategoryTheory.Limits.Pi.lift fun i => CategoryTheory.Limits.Pi.lift fun x => CategoryTheory.Limits.Pi.π (fun p => g p.fst p.snd) { fst := i, snd := x }

def CategoryTheory.Limits.piPiIso {C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_2} (f : ι → Type u_1) (g : (i : ι) → f i → C) [∀ (i : ι), CategoryTheory.Limits.HasProduct (g i)] [CategoryTheory.Limits.HasProduct fun i => ∏ g i] : (∏ fun i => ∏ g i) ≅ ∏ fun p => g p.fst p.snd

An iterated product is a product over a sigma type.

instance CategoryTheory.Limits.instHasCoproductSigmaFstSnd {C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_2} (f : ι → Type u_1) (g : (i : ι) → f i → C) [∀ (i : ι), CategoryTheory.Limits.HasCoproduct (g i)] [CategoryTheory.Limits.HasCoproduct fun i => ∐ g i] : CategoryTheory.Limits.HasCoproduct fun p => g p.fst p.snd

@[simp]

theorem CategoryTheory.Limits.sigmaSigmaIso_hom {C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_2} (f : ι → Type u_1) (g : (i : ι) → f i → C) [∀ (i : ι), CategoryTheory.Limits.HasCoproduct (g i)] [CategoryTheory.Limits.HasCoproduct fun i => ∐ g i] : (CategoryTheory.Limits.sigmaSigmaIso f g).hom = CategoryTheory.Limits.Sigma.desc fun i => CategoryTheory.Limits.Sigma.desc fun x => CategoryTheory.Limits.Sigma.ι (fun p => g p.fst p.snd) { fst := i, snd := x }

@[simp]

theorem CategoryTheory.Limits.sigmaSigmaIso_inv {C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_2} (f : ι → Type u_1) (g : (i : ι) → f i → C) [∀ (i : ι), CategoryTheory.Limits.HasCoproduct (g i)] [CategoryTheory.Limits.HasCoproduct fun i => ∐ g i] : (CategoryTheory.Limits.sigmaSigmaIso f g).inv = CategoryTheory.Limits.Sigma.desc fun x => match x with | { fst := i, snd := x } => CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (g i) x) (CategoryTheory.Limits.Sigma.ι (fun i => ∐ g i) i)

def CategoryTheory.Limits.sigmaSigmaIso {C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_2} (f : ι → Type u_1) (g : (i : ι) → f i → C) [∀ (i : ι), CategoryTheory.Limits.HasCoproduct (g i)] [CategoryTheory.Limits.HasCoproduct fun i => ∐ g i] : (∐ fun i => ∐ g i) ≅ ∐ fun p => g p.fst p.snd

An iterated coproduct is a coproduct over a sigma type.

def CategoryTheory.Limits.piComparison {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) (f : β → C) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct fun b => G.obj (f b)] : G.obj (∏ f) ⟶ ∏ fun b => G.obj (f b)

The comparison morphism for the product of f. This is an iso iff G preserves the product of f, see PreservesProduct.ofIsoComparison.

@[simp]

theorem CategoryTheory.Limits.piComparison_comp_π_assoc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) (f : β → C) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct fun b => G.obj (f b)] (b : β) {Z : D} (h : G.obj (f b) ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.piComparison G f) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π (fun b => G.obj (f b)) b) h) = CategoryTheory.CategoryStruct.comp (G.map (CategoryTheory.Limits.Pi.π f b)) h

@[simp]

theorem CategoryTheory.Limits.piComparison_comp_π {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) (f : β → C) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct fun b => G.obj (f b)] (b : β) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.piComparison G f) (CategoryTheory.Limits.Pi.π (fun b => G.obj (f b)) b) = G.map (CategoryTheory.Limits.Pi.π f b)

@[simp]

theorem CategoryTheory.Limits.map_lift_piComparison_assoc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) (f : β → C) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct fun b => G.obj (f b)] (P : C) (g : (j : β) → P ⟶ f j) {Z : D} (h : (∏ fun b => G.obj (f b)) ⟶ Z) : CategoryTheory.CategoryStruct.comp (G.map (CategoryTheory.Limits.Pi.lift g)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.piComparison G f) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.lift fun j => G.map (g j)) h

@[simp]

theorem CategoryTheory.Limits.map_lift_piComparison {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) (f : β → C) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct fun b => G.obj (f b)] (P : C) (g : (j : β) → P ⟶ f j) : CategoryTheory.CategoryStruct.comp (G.map (CategoryTheory.Limits.Pi.lift g)) (CategoryTheory.Limits.piComparison G f) = CategoryTheory.Limits.Pi.lift fun j => G.map (g j)

def CategoryTheory.Limits.sigmaComparison {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) (f : β → C) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct fun b => G.obj (f b)] : (∐ fun b => G.obj (f b)) ⟶ G.obj (∐ f)

The comparison morphism for the coproduct of f. This is an iso iff G preserves the coproduct of f, see PreservesCoproduct.ofIsoComparison.

@[simp]

theorem CategoryTheory.Limits.ι_comp_sigmaComparison_assoc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) (f : β → C) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct fun b => G.obj (f b)] (b : β) {Z : D} (h : G.obj (∐ f) ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (fun b => G.obj (f b)) b) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.sigmaComparison G f) h) = CategoryTheory.CategoryStruct.comp (G.map (CategoryTheory.Limits.Sigma.ι f b)) h

@[simp]

theorem CategoryTheory.Limits.ι_comp_sigmaComparison {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) (f : β → C) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct fun b => G.obj (f b)] (b : β) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (fun b => G.obj (f b)) b) (CategoryTheory.Limits.sigmaComparison G f) = G.map (CategoryTheory.Limits.Sigma.ι f b)

@[simp]

theorem CategoryTheory.Limits.sigmaComparison_map_desc_assoc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) (f : β → C) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct fun b => G.obj (f b)] (P : C) (g : (j : β) → f j ⟶ P) {Z : D} (h : G.obj P ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.sigmaComparison G f) (CategoryTheory.CategoryStruct.comp (G.map (CategoryTheory.Limits.Sigma.desc g)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.desc fun j => G.map (g j)) h

@[simp]

theorem CategoryTheory.Limits.sigmaComparison_map_desc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) (f : β → C) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct fun b => G.obj (f b)] (P : C) (g : (j : β) → f j ⟶ P) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.sigmaComparison G f) (G.map (CategoryTheory.Limits.Sigma.desc g)) = CategoryTheory.Limits.Sigma.desc fun j => G.map (g j)

@[inline, reducible]

abbrev CategoryTheory.Limits.HasProducts (C : Type u) [CategoryTheory.Category.{v, u} C] : Prop

An abbreviation for Π J, HasLimitsOfShape (Discrete J) C

@[inline, reducible]

abbrev CategoryTheory.Limits.HasCoproducts (C : Type u) [CategoryTheory.Category.{v, u} C] : Prop

An abbreviation for Π J, HasColimitsOfShape (Discrete J) C

theorem CategoryTheory.Limits.has_smallest_products_of_hasProducts {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] : CategoryTheory.Limits.HasProducts C

theorem CategoryTheory.Limits.has_smallest_coproducts_of_hasCoproducts {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasCoproducts C] : CategoryTheory.Limits.HasCoproducts C

theorem CategoryTheory.Limits.hasProducts_of_limit_fans {C : Type u} [CategoryTheory.Category.{v, u} C] (lf : {J : Type w} → (f : J → C) → CategoryTheory.Limits.Fan f) (lf_is_limit : {J : Type w} → (f : J → C) → CategoryTheory.Limits.IsLimit (lf J f)) : CategoryTheory.Limits.HasProducts C

(Co)products over a type with a unique term.

@[simp]

theorem CategoryTheory.Limits.limitConeOfUnique_cone_π {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : (CategoryTheory.Limits.limitConeOfUnique f).cone.π = CategoryTheory.Discrete.natTrans fun x => match x with | { as := j } => CategoryTheory.eqToHom (_ : ((CategoryTheory.Functor.const (CategoryTheory.Discrete β)).obj (f default)).obj { as := j } = (CategoryTheory.Discrete.functor f).obj { as := j })

@[simp]

theorem CategoryTheory.Limits.limitConeOfUnique_cone_pt {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : (CategoryTheory.Limits.limitConeOfUnique f).cone.pt = f default

@[simp]

theorem CategoryTheory.Limits.limitConeOfUnique_isLimit_lift {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) (s : CategoryTheory.Limits.Cone (CategoryTheory.Discrete.functor f)) : CategoryTheory.Limits.IsLimit.lift (CategoryTheory.Limits.limitConeOfUnique f).isLimit s = s.π.app default

def CategoryTheory.Limits.limitConeOfUnique {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : CategoryTheory.Limits.LimitCone (CategoryTheory.Discrete.functor f)

The limit cone for the product over an index type with exactly one term.

instance CategoryTheory.Limits.hasProduct_unique {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : CategoryTheory.Limits.HasProduct f

@[simp]

theorem CategoryTheory.Limits.productUniqueIso_inv {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : (CategoryTheory.Limits.productUniqueIso f).inv = CategoryTheory.Limits.limit.lift (CategoryTheory.Discrete.functor f) (CategoryTheory.Limits.limitConeOfUnique f).cone

@[simp]

theorem CategoryTheory.Limits.productUniqueIso_hom {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : (CategoryTheory.Limits.productUniqueIso f).hom = CategoryTheory.Limits.limit.π (CategoryTheory.Discrete.functor f) default

def CategoryTheory.Limits.productUniqueIso {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : ∏ f ≅ f default

A product over an index type with exactly one term is just the object over that term.

@[simp]

theorem CategoryTheory.Limits.colimitCoconeOfUnique_isColimit_desc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) (s : CategoryTheory.Limits.Cocone (CategoryTheory.Discrete.functor f)) : CategoryTheory.Limits.IsColimit.desc (CategoryTheory.Limits.colimitCoconeOfUnique f).isColimit s = s.ι.app default

@[simp]

theorem CategoryTheory.Limits.colimitCoconeOfUnique_cocone_pt {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : (CategoryTheory.Limits.colimitCoconeOfUnique f).cocone.pt = f default

@[simp]

theorem CategoryTheory.Limits.colimitCoconeOfUnique_cocone_ι {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : (CategoryTheory.Limits.colimitCoconeOfUnique f).cocone.ι = CategoryTheory.Discrete.natTrans fun x => match x with | { as := j } => CategoryTheory.eqToHom (_ : (CategoryTheory.Discrete.functor f).obj { as := j } = ((CategoryTheory.Functor.const (CategoryTheory.Discrete β)).obj (f default)).obj { as := j })

def CategoryTheory.Limits.colimitCoconeOfUnique {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : CategoryTheory.Limits.ColimitCocone (CategoryTheory.Discrete.functor f)

The colimit cocone for the coproduct over an index type with exactly one term.

instance CategoryTheory.Limits.hasCoproduct_unique {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : CategoryTheory.Limits.HasCoproduct f

@[simp]

theorem CategoryTheory.Limits.coproductUniqueIso_hom {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : (CategoryTheory.Limits.coproductUniqueIso f).hom = CategoryTheory.Limits.colimit.desc (CategoryTheory.Discrete.functor f) (CategoryTheory.Limits.colimitCoconeOfUnique f).cocone

@[simp]

theorem CategoryTheory.Limits.coproductUniqueIso_inv {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : (CategoryTheory.Limits.coproductUniqueIso f).inv = CategoryTheory.Limits.colimit.ι (CategoryTheory.Discrete.functor f) default

def CategoryTheory.Limits.coproductUniqueIso {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] [Unique β] (f : β → C) : ∐ f ≅ f default

A coproduct over an index type with exactly one term is just the object over that term.

def CategoryTheory.Limits.Pi.reindex {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {γ : Type w'} (ε : β ≃ γ) (f : γ → C) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct (f ∘ ↑ε)] : ∏ f ∘ ↑ε ≅ ∏ f

Reindex a categorical product via an equivalence of the index types.

@[simp]

theorem CategoryTheory.Limits.Pi.reindex_hom_π_assoc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {γ : Type w'} (ε : β ≃ γ) (f : γ → C) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct (f ∘ ↑ε)] (b : β) {Z : C} (h : f (↑ε b) ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.reindex ε f).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π f (↑ε b)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π (f ∘ ↑ε) b) h

@[simp]

theorem CategoryTheory.Limits.Pi.reindex_hom_π {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {γ : Type w'} (ε : β ≃ γ) (f : γ → C) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct (f ∘ ↑ε)] (b : β) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.reindex ε f).hom (CategoryTheory.Limits.Pi.π f (↑ε b)) = CategoryTheory.Limits.Pi.π (f ∘ ↑ε) b

@[simp]

theorem CategoryTheory.Limits.Pi.reindex_inv_π_assoc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {γ : Type w'} (ε : β ≃ γ) (f : γ → C) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct (f ∘ ↑ε)] (b : β) {Z : C} (h : (f ∘ ↑ε) b ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.reindex ε f).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π (f ∘ ↑ε) b) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.π f (↑ε b)) h

@[simp]

theorem CategoryTheory.Limits.Pi.reindex_inv_π {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {γ : Type w'} (ε : β ≃ γ) (f : γ → C) [CategoryTheory.Limits.HasProduct f] [CategoryTheory.Limits.HasProduct (f ∘ ↑ε)] (b : β) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Pi.reindex ε f).inv (CategoryTheory.Limits.Pi.π (f ∘ ↑ε) b) = CategoryTheory.Limits.Pi.π f (↑ε b)

def CategoryTheory.Limits.Sigma.reindex {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {γ : Type w'} (ε : β ≃ γ) (f : γ → C) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct (f ∘ ↑ε)] : ∐ f ∘ ↑ε ≅ ∐ f

Reindex a categorical coproduct via an equivalence of the index types.

@[simp]

theorem CategoryTheory.Limits.Sigma.ι_reindex_hom_assoc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {γ : Type w'} (ε : β ≃ γ) (f : γ → C) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct (f ∘ ↑ε)] (b : β) {Z : C} (h : ∐ f ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (f ∘ ↑ε) b) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.reindex ε f).hom h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι f (↑ε b)) h

@[simp]

theorem CategoryTheory.Limits.Sigma.ι_reindex_hom {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {γ : Type w'} (ε : β ≃ γ) (f : γ → C) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct (f ∘ ↑ε)] (b : β) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (f ∘ ↑ε) b) (CategoryTheory.Limits.Sigma.reindex ε f).hom = CategoryTheory.Limits.Sigma.ι f (↑ε b)

@[simp]

theorem CategoryTheory.Limits.Sigma.ι_reindex_inv_assoc {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {γ : Type w'} (ε : β ≃ γ) (f : γ → C) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct (f ∘ ↑ε)] (b : β) {Z : C} (h : ∐ f ∘ ↑ε ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι f (↑ε b)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.reindex ε f).inv h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (f ∘ ↑ε) b) h

@[simp]

theorem CategoryTheory.Limits.Sigma.ι_reindex_inv {β : Type w} {C : Type u} [CategoryTheory.Category.{v, u} C] {γ : Type w'} (ε : β ≃ γ) (f : γ → C) [CategoryTheory.Limits.HasCoproduct f] [CategoryTheory.Limits.HasCoproduct (f ∘ ↑ε)] (b : β) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι f (↑ε b)) (CategoryTheory.Limits.Sigma.reindex ε f).inv = CategoryTheory.Limits.Sigma.ι (f ∘ ↑ε) b