Loogle!
Result
Found 175 declarations mentioning CategoryTheory.Limits.HasFiniteCoproducts.
- CategoryTheory.Limits.HasFiniteCoproducts 📋 Mathlib.CategoryTheory.Limits.Shapes.FiniteProducts
(C : Type u) [CategoryTheory.Category.{v, u} C] : Prop - CategoryTheory.Limits.hasFiniteCoproducts_of_hasCoproducts 📋 Mathlib.CategoryTheory.Limits.Shapes.FiniteProducts
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasCoproducts C] : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.Limits.hasFiniteCoproducts_of_hasFiniteColimits 📋 Mathlib.CategoryTheory.Limits.Shapes.FiniteProducts
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasFiniteColimits C] : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.Limits.hasColimitsOfShape_discrete 📋 Mathlib.CategoryTheory.Limits.Shapes.FiniteProducts
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasFiniteCoproducts C] (ι : Type w) [Finite ι] : CategoryTheory.Limits.HasColimitsOfShape (CategoryTheory.Discrete ι) C - CategoryTheory.Limits.HasFiniteCoproducts.mk 📋 Mathlib.CategoryTheory.Limits.Shapes.FiniteProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] (out : ∀ (n : ℕ), CategoryTheory.Limits.HasColimitsOfShape (CategoryTheory.Discrete (Fin n)) C) : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.Limits.HasFiniteCoproducts.out 📋 Mathlib.CategoryTheory.Limits.Shapes.FiniteProducts
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} [self : CategoryTheory.Limits.HasFiniteCoproducts C] (n : ℕ) : CategoryTheory.Limits.HasColimitsOfShape (CategoryTheory.Discrete (Fin n)) C - CategoryTheory.Limits.reflectsFiniteCoproductsOfReflectsIsomorphisms 📋 Mathlib.CategoryTheory.Limits.Preserves.Finite
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) [F.ReflectsIsomorphisms] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.PreservesFiniteCoproducts F] : CategoryTheory.Limits.ReflectsFiniteCoproducts F - CategoryTheory.Limits.hasFiniteCoproducts_of_hasFiniteBiproducts 📋 Mathlib.CategoryTheory.Limits.Shapes.Biproducts
(C : Type uC) [CategoryTheory.Category.{uC', uC} C] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasFiniteBiproducts C] : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.Limits.HasFiniteBiproducts.of_hasFiniteCoproducts 📋 Mathlib.CategoryTheory.Preadditive.Biproducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Limits.HasFiniteBiproducts C - CategoryTheory.Over.instHasFiniteCoproducts 📋 Mathlib.CategoryTheory.Limits.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Limits.HasFiniteCoproducts (CategoryTheory.Over X) - CategoryTheory.hasFiniteCoproducts_of_has_binary_and_initial 📋 Mathlib.CategoryTheory.Limits.Constructions.FiniteProductsOfBinaryProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasBinaryCoproducts C] [CategoryTheory.Limits.HasInitial C] : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.preservesFiniteCoproductsOfPreservesBinaryAndInitial 📋 Mathlib.CategoryTheory.Limits.Constructions.FiniteProductsOfBinaryProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete CategoryTheory.Limits.WalkingPair) F] [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) F] [CategoryTheory.Limits.HasFiniteCoproducts C] (J : Type u_1) [Finite J] : CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete J) F - CategoryTheory.preservesShape_fin_of_preserves_binary_and_initial 📋 Mathlib.CategoryTheory.Limits.Constructions.FiniteProductsOfBinaryProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete CategoryTheory.Limits.WalkingPair) F] [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) F] [CategoryTheory.Limits.HasFiniteCoproducts C] (n : ℕ) : CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete (Fin n)) F - CategoryTheory.PreservesFiniteCoproducts.of_preserves_binary_and_initial 📋 Mathlib.CategoryTheory.Limits.Constructions.FiniteProductsOfBinaryProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete CategoryTheory.Limits.WalkingPair) F] [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) F] [CategoryTheory.Limits.HasFiniteCoproducts C] (J : Type u_1) [Finite J] : CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete J) F - CategoryTheory.preserves_fin_of_preserves_binary_and_initial 📋 Mathlib.CategoryTheory.Limits.Constructions.FiniteProductsOfBinaryProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete CategoryTheory.Limits.WalkingPair) F] [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) F] [CategoryTheory.Limits.HasFiniteCoproducts C] (n : ℕ) (f : Fin n → C) : CategoryTheory.Limits.PreservesColimit (CategoryTheory.Discrete.functor f) F - CategoryTheory.Limits.hasFiniteColimits_of_hasCoequalizers_and_finite_coproducts 📋 Mathlib.CategoryTheory.Limits.Constructions.LimitsOfProductsAndEqualizers
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasCoequalizers C] : CategoryTheory.Limits.HasFiniteColimits C - CategoryTheory.Limits.preservesFiniteColimits_of_preservesCoequalizers_and_finiteCoproducts 📋 Mathlib.CategoryTheory.Limits.Constructions.LimitsOfProductsAndEqualizers
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Limits.HasCoequalizers C] [CategoryTheory.Limits.HasFiniteCoproducts C] (G : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesColimitsOfShape CategoryTheory.Limits.WalkingParallelPair G] [CategoryTheory.Limits.PreservesFiniteCoproducts G] : CategoryTheory.Limits.PreservesFiniteColimits G - CategoryTheory.Limits.createsFiniteColimitsOfCreatesCoequalizersAndFiniteCoproducts 📋 Mathlib.CategoryTheory.Limits.Constructions.LimitsOfProductsAndEqualizers
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Limits.HasCoequalizers D] [CategoryTheory.Limits.HasFiniteCoproducts D] (G : CategoryTheory.Functor C D) [G.ReflectsIsomorphisms] [CategoryTheory.CreatesColimitsOfShape CategoryTheory.Limits.WalkingParallelPair G] [CategoryTheory.Limits.CreatesFiniteCoproducts G] : CategoryTheory.Limits.CreatesFiniteColimits G - CategoryTheory.NormalEpiCategory.hasCoequalizers 📋 Mathlib.CategoryTheory.Limits.Shapes.NormalMono.Equalizers
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasCokernels C] [CategoryTheory.IsNormalEpiCategory C] : CategoryTheory.Limits.HasCoequalizers C - CategoryTheory.NormalEpiCategory.hasColimit_parallelPair 📋 Mathlib.CategoryTheory.Limits.Shapes.NormalMono.Equalizers
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasCokernels C] [CategoryTheory.IsNormalEpiCategory C] {X Y : C} (f g : X ⟶ Y) : CategoryTheory.Limits.HasColimit (CategoryTheory.Limits.parallelPair f g) - CategoryTheory.NormalEpiCategory.pushout_of_epi 📋 Mathlib.CategoryTheory.Limits.Shapes.NormalMono.Equalizers
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasCokernels C] [CategoryTheory.IsNormalEpiCategory C] {X Y Z : C} (a : X ⟶ Y) (b : X ⟶ Z) [CategoryTheory.Epi a] [CategoryTheory.Epi b] : CategoryTheory.Limits.HasColimit (CategoryTheory.Limits.span a b) - CategoryTheory.NormalEpiCategory.preservesMonomorphisms_of_preservesKernels 📋 Mathlib.CategoryTheory.Limits.Shapes.NormalMono.Equalizers
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasCokernels C] [CategoryTheory.IsNormalEpiCategory C] [CategoryTheory.Limits.HasZeroObject C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] [CategoryTheory.Limits.HasZeroMorphisms D] [CategoryTheory.Limits.HasZeroObject D] (F : CategoryTheory.Functor D C) [F.PreservesZeroMorphisms] [∀ {X Y : D} (f : X ⟶ Y), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.parallelPair f 0) F] : F.PreservesMonomorphisms - CategoryTheory.NormalEpiCategory.mono_of_cancel_zero 📋 Mathlib.CategoryTheory.Limits.Shapes.NormalMono.Equalizers
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasCokernels C] [CategoryTheory.IsNormalEpiCategory C] [CategoryTheory.Limits.HasZeroObject C] {X Y : C} (f : X ⟶ Y) (hf : ∀ (Z : C) (g : Z ⟶ X), CategoryTheory.CategoryStruct.comp g f = 0 → g = 0) : CategoryTheory.Mono f - CategoryTheory.NormalEpiCategory.mono_of_zero_kernel 📋 Mathlib.CategoryTheory.Limits.Shapes.NormalMono.Equalizers
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasCokernels C] [CategoryTheory.IsNormalEpiCategory C] {X Y : C} (f : X ⟶ Y) (Z : C) (l : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.KernelFork.ofι 0 ⋯)) : CategoryTheory.Mono f - CategoryTheory.NonPreadditiveAbelian.has_finite_coproducts 📋 Mathlib.CategoryTheory.Abelian.NonPreadditive
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} [self : CategoryTheory.NonPreadditiveAbelian C] : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.NonPreadditiveAbelian.mk 📋 Mathlib.CategoryTheory.Abelian.NonPreadditive
{C : Type u} [CategoryTheory.Category.{v, u} C] [toHasZeroMorphisms : CategoryTheory.Limits.HasZeroMorphisms C] [toIsNormalMonoCategory : CategoryTheory.IsNormalMonoCategory C] [toIsNormalEpiCategory : CategoryTheory.IsNormalEpiCategory C] [has_zero_object : CategoryTheory.Limits.HasZeroObject C] [has_kernels : CategoryTheory.Limits.HasKernels C] [has_cokernels : CategoryTheory.Limits.HasCokernels C] [has_finite_products : CategoryTheory.Limits.HasFiniteProducts C] [has_finite_coproducts : CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.NonPreadditiveAbelian C - CategoryTheory.Functor.preservesFiniteColimits_of_preservesCokernels 📋 Mathlib.CategoryTheory.Preadditive.LeftExact
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Preadditive C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor C D) [F.PreservesZeroMorphisms] [CategoryTheory.Limits.HasBinaryBiproducts C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasCoequalizers C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.Limits.HasZeroObject D] [∀ {X Y : C} (f : X ⟶ Y), CategoryTheory.Limits.PreservesColimit (CategoryTheory.Limits.parallelPair f 0) F] : CategoryTheory.Limits.PreservesFiniteColimits F - CategoryTheory.Functor.preservesFiniteColimits_of_preservesHomology 📋 Mathlib.Algebra.Homology.ShortComplex.ExactFunctor
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor C D) [F.Additive] [F.PreservesHomology] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasCokernels C] : CategoryTheory.Limits.PreservesFiniteColimits F - CategoryTheory.Limits.instHasFiniteCoproductsFunctor 📋 Mathlib.CategoryTheory.Limits.FunctorCategory.Finite
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {K : Type u_2} [CategoryTheory.Category.{v_2, u_2} K] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Limits.HasFiniteCoproducts (CategoryTheory.Functor K C) - CategoryTheory.Limits.hasFiniteCoproducts_of_opposite 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Products
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Limits.HasFiniteProducts Cᵒᵖ] : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.Limits.hasFiniteCoproducts_opposite 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Products
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Limits.HasFiniteProducts C] : CategoryTheory.Limits.HasFiniteCoproducts Cᵒᵖ - CategoryTheory.Limits.hasFiniteProducts_of_opposite 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Products
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Limits.HasFiniteCoproducts Cᵒᵖ] : CategoryTheory.Limits.HasFiniteProducts C - CategoryTheory.Limits.hasFiniteProducts_opposite 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Products
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Limits.HasFiniteProducts Cᵒᵖ - CategoryTheory.Limits.hasCoproducts_of_finite_and_filtered 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasFilteredColimitsOfSize.{w, w, v, u} C] : CategoryTheory.Limits.HasCoproducts C - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetObj 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] (F : CategoryTheory.Functor (CategoryTheory.Discrete α) C) : CategoryTheory.Functor (Finset (CategoryTheory.Discrete α)) C - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimitCocone 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasColimitsOfShape (Finset (CategoryTheory.Discrete α)) C] (F : CategoryTheory.Functor (CategoryTheory.Discrete α) C) : CategoryTheory.Limits.ColimitCocone F - CategoryTheory.Limits.CoproductsFromFiniteFiltered.finiteSubcoproductsCocone 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] (f : α → C) [CategoryTheory.Limits.HasCoproduct f] : CategoryTheory.Limits.Cocone (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetObj (CategoryTheory.Discrete.functor f)) - CategoryTheory.Limits.CoproductsFromFiniteFiltered.finiteSubcoproductsCocone_pt 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] (f : α → C) [CategoryTheory.Limits.HasCoproduct f] : (CategoryTheory.Limits.CoproductsFromFiniteFiltered.finiteSubcoproductsCocone f).pt = ∐ f - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinset 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
(C : Type u) [CategoryTheory.Category.{v, u} C] (α : Type w) [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Functor (CategoryTheory.Functor (CategoryTheory.Discrete α) C) (CategoryTheory.Functor (Finset (CategoryTheory.Discrete α)) C) - CategoryTheory.Limits.CoproductsFromFiniteFiltered.isColimitFiniteSubproductsCocone 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] (f : α → C) [CategoryTheory.Limits.HasColimitsOfShape (Finset (CategoryTheory.Discrete α)) C] [CategoryTheory.Limits.HasCoproduct f] : CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.CoproductsFromFiniteFiltered.finiteSubcoproductsCocone f) - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimitCocone_cocone_pt 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasColimitsOfShape (Finset (CategoryTheory.Discrete α)) C] (F : CategoryTheory.Functor (CategoryTheory.Discrete α) C) : (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimitCocone F).cocone.pt = CategoryTheory.Limits.colimit (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetObj F) - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetObj_obj 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] (F : CategoryTheory.Functor (CategoryTheory.Discrete α) C) (s : Finset (CategoryTheory.Discrete α)) : (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetObj F).obj s = ∐ fun x => F.obj ↑x - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimIso 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasColimitsOfShape (Finset (CategoryTheory.Discrete α)) C] [CategoryTheory.Limits.HasColimitsOfShape (CategoryTheory.Discrete α) C] : (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinset C α).comp CategoryTheory.Limits.colim ≅ CategoryTheory.Limits.colim - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinset_obj_obj 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
(C : Type u) [CategoryTheory.Category.{v, u} C] (α : Type w) [CategoryTheory.Limits.HasFiniteCoproducts C] (F : CategoryTheory.Functor (CategoryTheory.Discrete α) C) (s : Finset (CategoryTheory.Discrete α)) : ((CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinset C α).obj F).obj s = ∐ fun x => F.obj ↑x - CategoryTheory.Limits.CoproductsFromFiniteFiltered.finiteSubcoproductsCocone_ι_app 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] (f : α → C) [CategoryTheory.Limits.HasCoproduct f] (S : Finset (CategoryTheory.Discrete α)) : (CategoryTheory.Limits.CoproductsFromFiniteFiltered.finiteSubcoproductsCocone f).ι.app S = CategoryTheory.Limits.Sigma.desc fun s => CategoryTheory.Limits.Sigma.ι f (↑s).as - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinset_map_app 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
(C : Type u) [CategoryTheory.Category.{v, u} C] (α : Type w) [CategoryTheory.Limits.HasFiniteCoproducts C] {X✝ Y✝ : CategoryTheory.Functor (CategoryTheory.Discrete α) C} (β : X✝ ⟶ Y✝) (x✝ : Finset (CategoryTheory.Discrete α)) : ((CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinset C α).map β).app x✝ = CategoryTheory.Limits.Sigma.map fun x => β.app ↑x - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimitCocone_cocone_ι_app 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasColimitsOfShape (Finset (CategoryTheory.Discrete α)) C] (F : CategoryTheory.Functor (CategoryTheory.Discrete α) C) (j : CategoryTheory.Discrete α) : (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimitCocone F).cocone.ι.app j = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (fun x => F.obj ↑x) ⟨j, ⋯⟩) (CategoryTheory.Limits.colimit.ι (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetObj F) {j}) - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetObj_map 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] (F : CategoryTheory.Functor (CategoryTheory.Discrete α) C) {x✝ Y : Finset (CategoryTheory.Discrete α)} (h : x✝ ⟶ Y) : (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetObj F).map h = CategoryTheory.Limits.Sigma.desc fun y => CategoryTheory.Limits.Sigma.ι (fun x => F.obj ↑x) ⟨↑y, ⋯⟩ - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinset_obj_map 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
(C : Type u) [CategoryTheory.Category.{v, u} C] (α : Type w) [CategoryTheory.Limits.HasFiniteCoproducts C] (F : CategoryTheory.Functor (CategoryTheory.Discrete α) C) {x✝ Y : Finset (CategoryTheory.Discrete α)} (h : x✝ ⟶ Y) : ((CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinset C α).obj F).map h = CategoryTheory.Limits.Sigma.desc fun y => CategoryTheory.Limits.Sigma.ι (fun x => F.obj ↑x) ⟨↑y, ⋯⟩ - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetEvaluationIso 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] (I : Finset (CategoryTheory.Discrete α)) : (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinset C α).comp ((CategoryTheory.evaluation (Finset (CategoryTheory.Discrete α)) C).obj I) ≅ ((CategoryTheory.Functor.whiskeringLeft (CategoryTheory.Discrete ↥I) (CategoryTheory.Discrete α) C).obj (CategoryTheory.Discrete.functor fun x => ↑x)).comp CategoryTheory.Limits.colim - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimIso_aux 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasColimitsOfShape (Finset (CategoryTheory.Discrete α)) C] [CategoryTheory.Limits.HasColimitsOfShape (CategoryTheory.Discrete α) C] (F : CategoryTheory.Functor (CategoryTheory.Discrete α) C) {J : Finset (CategoryTheory.Discrete α)} (j : ↥J) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (fun x => F.obj ↑x) j) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetObj F) J) (CategoryTheory.Limits.colimit.isoColimitCocone (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimitCocone F)).inv) = CategoryTheory.Limits.colimit.ι F ↑j - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimIso_aux_assoc 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasColimitsOfShape (Finset (CategoryTheory.Discrete α)) C] [CategoryTheory.Limits.HasColimitsOfShape (CategoryTheory.Discrete α) C] (F : CategoryTheory.Functor (CategoryTheory.Discrete α) C) {J : Finset (CategoryTheory.Discrete α)} (j : ↥J) {Z : C} (h : CategoryTheory.Limits.colimit F ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (fun x => F.obj ↑x) j) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetObj F) J) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.isoColimitCocone (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimitCocone F)).inv h)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι F ↑j) h - CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimitCocone_isColimit_desc 📋 Mathlib.CategoryTheory.Limits.Constructions.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] {α : Type w} [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasColimitsOfShape (Finset (CategoryTheory.Discrete α)) C] (F : CategoryTheory.Functor (CategoryTheory.Discrete α) C) (s : CategoryTheory.Limits.Cocone F) : (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetColimitCocone F).isColimit.desc s = CategoryTheory.Limits.colimit.desc (CategoryTheory.Limits.CoproductsFromFiniteFiltered.liftToFinsetObj F) { pt := s.pt, ι := { app := fun x => CategoryTheory.Limits.Sigma.desc fun x_1 => s.ι.app ↑x_1, naturality := ⋯ } } - CategoryTheory.Limits.hasFiniteCoproducts_of_hasCountableCoproducts 📋 Mathlib.CategoryTheory.Limits.Shapes.Countable
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCountableCoproducts C] : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.Pretriangulated.instHasFiniteCoproducts 📋 Mathlib.CategoryTheory.Triangulated.Pretriangulated
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.HasShift C ℤ] [CategoryTheory.Preadditive C] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [hC : CategoryTheory.Pretriangulated C] : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.ObjectProperty.instHasFiniteCoproductsFullSubcategoryOfIsClosedUnderFiniteCoproducts 📋 Mathlib.CategoryTheory.ObjectProperty.FiniteProducts
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P : CategoryTheory.ObjectProperty C) [CategoryTheory.Limits.HasFiniteCoproducts C] [P.IsClosedUnderFiniteCoproducts] : CategoryTheory.Limits.HasFiniteCoproducts P.FullSubcategory - CategoryTheory.ObjectProperty.IsClosedUnderFiniteCoproducts.mk' 📋 Mathlib.CategoryTheory.ObjectProperty.FiniteProducts
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {P : CategoryTheory.ObjectProperty C} [CategoryTheory.Limits.HasFiniteCoproducts C] [P.IsClosedUnderColimitsOfShape (CategoryTheory.Discrete PEmpty.{1})] [P.IsClosedUnderBinaryCoproducts] : P.IsClosedUnderFiniteCoproducts - CategoryTheory.Sheaf.instHasFiniteCoproducts 📋 Mathlib.CategoryTheory.Sites.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {D : Type w} [CategoryTheory.Category.{w', w} D] [CategoryTheory.HasWeakSheafify J D] [CategoryTheory.Limits.HasFiniteCoproducts D] : CategoryTheory.Limits.HasFiniteCoproducts (CategoryTheory.Sheaf J D) - CategoryTheory.isVanKampenColimit_extendCofan 📋 Mathlib.CategoryTheory.Limits.VanKampen
{C : Type u} [CategoryTheory.Category.{v, u} C] {n : ℕ} (f : Fin (n + 1) → C) {c₁ : CategoryTheory.Limits.Cofan fun i => f i.succ} {c₂ : CategoryTheory.Limits.BinaryCofan (f 0) c₁.pt} (t₁ : CategoryTheory.IsVanKampenColimit c₁) (t₂ : CategoryTheory.IsVanKampenColimit c₂) [∀ {Z : C} (i : Z ⟶ c₂.pt), CategoryTheory.Limits.HasPullback c₂.inr i] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.IsVanKampenColimit (CategoryTheory.extendCofan c₁ c₂) - CategoryTheory.FinitaryExtensive.hasFiniteCoproducts 📋 Mathlib.CategoryTheory.Extensive
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} [self : CategoryTheory.FinitaryExtensive C] : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.FinitaryPreExtensive.hasFiniteCoproducts 📋 Mathlib.CategoryTheory.Extensive
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} [self : CategoryTheory.FinitaryPreExtensive C] : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.finitaryExtensive_of_preserves_and_reflects_isomorphism 📋 Mathlib.CategoryTheory.Extensive
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u''} [CategoryTheory.Category.{v'', u''} D] (F : CategoryTheory.Functor C D) [CategoryTheory.FinitaryExtensive D] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasPullbacks C] [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete CategoryTheory.Limits.WalkingPair) F] [F.ReflectsIsomorphisms] : CategoryTheory.FinitaryExtensive C - CategoryTheory.FinitaryExtensive.mk 📋 Mathlib.CategoryTheory.Extensive
{C : Type u} [CategoryTheory.Category.{v, u} C] [hasFiniteCoproducts : CategoryTheory.Limits.HasFiniteCoproducts C] [hasPullbacksOfInclusions : CategoryTheory.HasPullbacksOfInclusions C] (van_kampen' : ∀ {X Y : C} (c : CategoryTheory.Limits.BinaryCofan X Y) (a : CategoryTheory.Limits.IsColimit c), CategoryTheory.IsVanKampenColimit c) : CategoryTheory.FinitaryExtensive C - CategoryTheory.FinitaryPreExtensive.mk 📋 Mathlib.CategoryTheory.Extensive
{C : Type u} [CategoryTheory.Category.{v, u} C] [hasFiniteCoproducts : CategoryTheory.Limits.HasFiniteCoproducts C] [hasPullbacksOfInclusions : CategoryTheory.HasPullbacksOfInclusions C] (universal' : ∀ {X Y : C} (c : CategoryTheory.Limits.BinaryCofan X Y) (a : CategoryTheory.Limits.IsColimit c), CategoryTheory.IsUniversalColimit c) : CategoryTheory.FinitaryPreExtensive C - CategoryTheory.finitaryExtensive_iff_of_isTerminal 📋 Mathlib.CategoryTheory.Extensive
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.HasPullbacksOfInclusions C] (T : C) (HT : CategoryTheory.Limits.IsTerminal T) (c₀ : CategoryTheory.Limits.BinaryCofan T T) (hc₀ : CategoryTheory.Limits.IsColimit c₀) : CategoryTheory.FinitaryExtensive C ↔ CategoryTheory.IsVanKampenColimit c₀ - CategoryTheory.finitaryExtensive_of_preserves_and_reflects 📋 Mathlib.CategoryTheory.Extensive
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u''} [CategoryTheory.Category.{v'', u''} D] (F : CategoryTheory.Functor C D) [CategoryTheory.FinitaryExtensive D] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.HasPullbacksOfInclusions C] [CategoryTheory.PreservesPullbacksOfInclusions F] [CategoryTheory.Limits.ReflectsLimitsOfShape CategoryTheory.Limits.WalkingCospan F] [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete CategoryTheory.Limits.WalkingPair) F] [CategoryTheory.Limits.ReflectsColimitsOfShape (CategoryTheory.Discrete CategoryTheory.Limits.WalkingPair) F] : CategoryTheory.FinitaryExtensive C - CategoryTheory.finitaryExtensive_of_reflective 📋 Mathlib.CategoryTheory.Extensive
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u''} [CategoryTheory.Category.{v'', u''} D] [CategoryTheory.Limits.HasFiniteCoproducts D] [CategoryTheory.HasPullbacksOfInclusions D] [CategoryTheory.FinitaryExtensive C] {Gl : CategoryTheory.Functor C D} {Gr : CategoryTheory.Functor D C} (adj : Gl ⊣ Gr) [Gr.Full] [Gr.Faithful] [∀ (X : D) (Y : C) (f : X ⟶ Gl.obj Y), CategoryTheory.Limits.HasPullback (Gr.map f) (adj.unit.app Y)] [∀ (X : D) (Y : C) (f : X ⟶ Gl.obj Y), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (Gr.map f) (adj.unit.app Y)) Gl] [CategoryTheory.PreservesPullbacksOfInclusions Gl] : CategoryTheory.FinitaryExtensive D - AlgebraicGeometry.instHasFiniteCoproductsScheme 📋 Mathlib.AlgebraicGeometry.Limits
: CategoryTheory.Limits.HasFiniteCoproducts AlgebraicGeometry.Scheme - AlgebraicGeometry.instHasFiniteCoproductsOverSchemeTopMorphismProperty 📋 Mathlib.AlgebraicGeometry.LimitsOver
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) [AlgebraicGeometry.IsZariskiLocalAtSource P] {S : AlgebraicGeometry.Scheme} : CategoryTheory.Limits.HasFiniteCoproducts (P.Over ⊤ S) - AlgebraicGeometry.instHasFiniteCoproductsCostructuredArrowOppositeCommRingCatSchemeTopMorphismPropertySpec 📋 Mathlib.AlgebraicGeometry.LimitsOver
{S : AlgebraicGeometry.Scheme} {P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [AlgebraicGeometry.IsZariskiLocalAtSource P] : CategoryTheory.Limits.HasFiniteCoproducts (P.CostructuredArrow ⊤ AlgebraicGeometry.Scheme.Spec S) - AlgebraicTopology.DoldKan.Γ₀.obj 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) : CategoryTheory.SimplicialObject C - AlgebraicTopology.DoldKan.Γ₀.Obj.obj₂ 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) (Δ : SimplexCategoryᵒᵖ) [CategoryTheory.Limits.HasFiniteCoproducts C] : C - AlgebraicTopology.DoldKan.Γ₀.splitting 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) : (AlgebraicTopology.DoldKan.Γ₀.obj K).Splitting - AlgebraicTopology.DoldKan.Γ₀.obj_obj 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) (Δ : SimplexCategoryᵒᵖ) : (AlgebraicTopology.DoldKan.Γ₀.obj K).obj Δ = AlgebraicTopology.DoldKan.Γ₀.Obj.obj₂ K Δ - AlgebraicTopology.DoldKan.Γ₀.Obj.map 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) {Δ' Δ : SimplexCategoryᵒᵖ} (θ : Δ ⟶ Δ') : AlgebraicTopology.DoldKan.Γ₀.Obj.obj₂ K Δ ⟶ AlgebraicTopology.DoldKan.Γ₀.Obj.obj₂ K Δ' - AlgebraicTopology.DoldKan.Γ₀' 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Functor (ChainComplex C ℕ) (CategoryTheory.SimplicialObject.Split C) - AlgebraicTopology.DoldKan.Γ₀ 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Functor (ChainComplex C ℕ) (CategoryTheory.SimplicialObject C) - AlgebraicTopology.DoldKan.Γ₀.obj_map 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) {X✝ Y✝ : SimplexCategoryᵒᵖ} (θ : X✝ ⟶ Y✝) : (AlgebraicTopology.DoldKan.Γ₀.obj K).map θ = AlgebraicTopology.DoldKan.Γ₀.Obj.map K θ - AlgebraicTopology.DoldKan.Γ₀'_obj 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) : AlgebraicTopology.DoldKan.Γ₀'.obj K = CategoryTheory.SimplicialObject.Split.mk' (AlgebraicTopology.DoldKan.Γ₀.splitting K) - AlgebraicTopology.DoldKan.Γ₀_obj_obj 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : ChainComplex C ℕ) (Δ : SimplexCategoryᵒᵖ) : (AlgebraicTopology.DoldKan.Γ₀.obj X).obj Δ = AlgebraicTopology.DoldKan.Γ₀.Obj.obj₂ X Δ - AlgebraicTopology.DoldKan.Γ₂ 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Functor (CategoryTheory.Idempotents.Karoubi (ChainComplex C ℕ)) (CategoryTheory.Idempotents.Karoubi (CategoryTheory.SimplicialObject C)) - AlgebraicTopology.DoldKan.Γ₀_obj_map 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : ChainComplex C ℕ) {X✝ Y✝ : SimplexCategoryᵒᵖ} (θ : X✝ ⟶ Y✝) : (AlgebraicTopology.DoldKan.Γ₀.obj X).map θ = AlgebraicTopology.DoldKan.Γ₀.Obj.map X θ - AlgebraicTopology.DoldKan.Γ₀.map 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] {K K' : ChainComplex C ℕ} (f : K ⟶ K') : AlgebraicTopology.DoldKan.Γ₀.obj K ⟶ AlgebraicTopology.DoldKan.Γ₀.obj K' - AlgebraicTopology.DoldKan.HigherFacesVanish.on_Γ₀_summand_id 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) (n : ℕ) : AlgebraicTopology.DoldKan.HigherFacesVanish (n + 1) (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op { len := n + 1 })).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n + 1 }))) - AlgebraicTopology.DoldKan.Γ₂_obj_X_obj 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (P : CategoryTheory.Idempotents.Karoubi (ChainComplex C ℕ)) (Δ : SimplexCategoryᵒᵖ) : (AlgebraicTopology.DoldKan.Γ₂.obj P).X.obj Δ = AlgebraicTopology.DoldKan.Γ₀.Obj.obj₂ P.X Δ - AlgebraicTopology.DoldKan.Γ₀'_map_F 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] {K K' : ChainComplex C ℕ} (f : K ⟶ K') : (AlgebraicTopology.DoldKan.Γ₀'.map f).F = AlgebraicTopology.DoldKan.Γ₀.map f - AlgebraicTopology.DoldKan.Γ₀'_map_f 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] {K K' : ChainComplex C ℕ} (f : K ⟶ K') (i : ℕ) : (AlgebraicTopology.DoldKan.Γ₀'.map f).f i = f.f i - AlgebraicTopology.DoldKan.Γ₀.Obj.map_epi_on_summand_id 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategory} (e : Δ' ⟶ Δ) [CategoryTheory.Epi e] : CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op Δ)).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op Δ))) ((AlgebraicTopology.DoldKan.Γ₀.obj K).map e.op) = ((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op Δ')).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.mk e) - AlgebraicTopology.DoldKan.Γ₂_obj_X_map 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (P : CategoryTheory.Idempotents.Karoubi (ChainComplex C ℕ)) {X✝ Y✝ : SimplexCategoryᵒᵖ} (θ : X✝ ⟶ Y✝) : (AlgebraicTopology.DoldKan.Γ₂.obj P).X.map θ = AlgebraicTopology.DoldKan.Γ₀.Obj.map P.X θ - AlgebraicTopology.DoldKan.PInfty_on_Γ₀_splitting_summand_eq_self 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) {n : ℕ} : CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op { len := n })).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n }))) (AlgebraicTopology.DoldKan.PInfty.f n) = ((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op { len := n })).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n })) - AlgebraicTopology.DoldKan.Γ₀.Obj.map_epi_on_summand_id_assoc 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategory} (e : Δ' ⟶ Δ) [CategoryTheory.Epi e] {Z : C} (h : (AlgebraicTopology.DoldKan.Γ₀.obj K).obj (Opposite.op Δ') ⟶ Z) : CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op Δ)).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op Δ))) (CategoryTheory.CategoryStruct.comp ((AlgebraicTopology.DoldKan.Γ₀.obj K).map e.op) h) = CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op Δ')).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.mk e)) h - AlgebraicTopology.DoldKan.Γ₀.Obj.mapMono_on_summand_id 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategory} (i : Δ' ⟶ Δ) [CategoryTheory.Mono i] : CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op Δ)).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op Δ))) ((AlgebraicTopology.DoldKan.Γ₀.obj K).map i.op) = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.Obj.Termwise.mapMono K i) (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op Δ')).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op Δ'))) - AlgebraicTopology.DoldKan.Γ₀.map_app 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] {K K' : ChainComplex C ℕ} (f : K ⟶ K') (Δ : SimplexCategoryᵒᵖ) : (AlgebraicTopology.DoldKan.Γ₀.map f).app Δ = (AlgebraicTopology.DoldKan.Γ₀.splitting K).desc Δ fun A => CategoryTheory.CategoryStruct.comp (f.f (Opposite.unop A.fst).len) (((AlgebraicTopology.DoldKan.Γ₀.splitting K').cofan Δ).inj A) - AlgebraicTopology.DoldKan.Γ₀.Obj.mapMono_on_summand_id_assoc 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategory} (i : Δ' ⟶ Δ) [CategoryTheory.Mono i] {Z : C} (h : (AlgebraicTopology.DoldKan.Γ₀.obj K).obj (Opposite.op Δ') ⟶ Z) : CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op Δ)).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op Δ))) (CategoryTheory.CategoryStruct.comp ((AlgebraicTopology.DoldKan.Γ₀.obj K).map i.op) h) = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.Obj.Termwise.mapMono K i) (CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op Δ')).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op Δ'))) h) - AlgebraicTopology.DoldKan.PInfty_on_Γ₀_splitting_summand_eq_self_assoc 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) {n : ℕ} {Z : C} (h : (AlgebraicTopology.AlternatingFaceMapComplex.obj (AlgebraicTopology.DoldKan.Γ₀.obj K)).X n ⟶ Z) : CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op { len := n })).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n }))) (CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.PInfty.f n) h) = CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan (Opposite.op { len := n })).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n }))) h - AlgebraicTopology.DoldKan.Γ₀_map_app 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] {X✝ Y✝ : ChainComplex C ℕ} (f : X✝ ⟶ Y✝) (Δ : SimplexCategoryᵒᵖ) : (AlgebraicTopology.DoldKan.Γ₀.map f).app Δ = (AlgebraicTopology.DoldKan.Γ₀.splitting X✝).desc Δ fun A => CategoryTheory.CategoryStruct.comp (f.f (Opposite.unop A.fst).len) (((AlgebraicTopology.DoldKan.Γ₀.splitting Y✝).cofan Δ).inj A) - AlgebraicTopology.DoldKan.Γ₀.Obj.map_on_summand₀ 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) {θ : Δ ⟶ Δ'} {Δ'' : SimplexCategory} {e : Opposite.unop Δ' ⟶ Δ''} {i : Δ'' ⟶ Opposite.unop A.fst} [CategoryTheory.Epi e] [CategoryTheory.Mono i] (fac : CategoryTheory.CategoryStruct.comp e i = CategoryTheory.CategoryStruct.comp θ.unop A.e) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (AlgebraicTopology.DoldKan.Γ₀.Obj.summand K Δ) A) (AlgebraicTopology.DoldKan.Γ₀.Obj.map K θ) = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.Obj.Termwise.mapMono K i) (CategoryTheory.Limits.Sigma.ι (AlgebraicTopology.DoldKan.Γ₀.Obj.summand K Δ') (CategoryTheory.SimplicialObject.Splitting.IndexSet.mk e)) - AlgebraicTopology.DoldKan.Γ₀.Obj.map_on_summand₀_assoc 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) {θ : Δ ⟶ Δ'} {Δ'' : SimplexCategory} {e : Opposite.unop Δ' ⟶ Δ''} {i : Δ'' ⟶ Opposite.unop A.fst} [CategoryTheory.Epi e] [CategoryTheory.Mono i] (fac : CategoryTheory.CategoryStruct.comp e i = CategoryTheory.CategoryStruct.comp θ.unop A.e) {Z : C} (h : AlgebraicTopology.DoldKan.Γ₀.Obj.obj₂ K Δ' ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (AlgebraicTopology.DoldKan.Γ₀.Obj.summand K Δ) A) (AlgebraicTopology.DoldKan.Γ₀.Obj.map K θ)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.Obj.Termwise.mapMono K i) (CategoryTheory.Limits.Sigma.ι (AlgebraicTopology.DoldKan.Γ₀.Obj.summand K Δ') (CategoryTheory.SimplicialObject.Splitting.IndexSet.mk e))) h - AlgebraicTopology.DoldKan.Γ₀.Obj.map_on_summand 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) (θ : Δ ⟶ Δ') {Δ'' : SimplexCategory} {e : Opposite.unop Δ' ⟶ Δ''} {i : Δ'' ⟶ Opposite.unop A.fst} [CategoryTheory.Epi e] [CategoryTheory.Mono i] (fac : CategoryTheory.CategoryStruct.comp e i = CategoryTheory.CategoryStruct.comp θ.unop A.e) : CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan Δ).inj A) ((AlgebraicTopology.DoldKan.Γ₀.obj K).map θ) = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.Obj.Termwise.mapMono K i) (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan Δ').inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.mk e)) - AlgebraicTopology.DoldKan.Γ₀.Obj.map_on_summand_assoc 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) (θ : Δ ⟶ Δ') {Δ'' : SimplexCategory} {e : Opposite.unop Δ' ⟶ Δ''} {i : Δ'' ⟶ Opposite.unop A.fst} [CategoryTheory.Epi e] [CategoryTheory.Mono i] (fac : CategoryTheory.CategoryStruct.comp e i = CategoryTheory.CategoryStruct.comp θ.unop A.e) {Z : C} (h : (AlgebraicTopology.DoldKan.Γ₀.obj K).obj Δ' ⟶ Z) : CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan Δ).inj A) (CategoryTheory.CategoryStruct.comp ((AlgebraicTopology.DoldKan.Γ₀.obj K).map θ) h) = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.Obj.Termwise.mapMono K i) (CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan Δ').inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.mk e)) h) - AlgebraicTopology.DoldKan.Γ₀.Obj.map_on_summand₀' 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) (θ : Δ ⟶ Δ') : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (AlgebraicTopology.DoldKan.Γ₀.Obj.summand K Δ) A) (AlgebraicTopology.DoldKan.Γ₀.Obj.map K θ) = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.Obj.Termwise.mapMono K (CategoryTheory.Limits.image.ι (CategoryTheory.CategoryStruct.comp θ.unop A.e))) (CategoryTheory.Limits.Sigma.ι (AlgebraicTopology.DoldKan.Γ₀.Obj.summand K Δ') (A.pull θ)) - AlgebraicTopology.DoldKan.Γ₀.Obj.map_on_summand' 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) (θ : Δ ⟶ Δ') : CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan Δ).inj A) ((AlgebraicTopology.DoldKan.Γ₀.obj K).map θ) = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.Obj.Termwise.mapMono K (CategoryTheory.Limits.image.ι (CategoryTheory.CategoryStruct.comp θ.unop A.e))) (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan Δ').inj (A.pull θ)) - AlgebraicTopology.DoldKan.Γ₀.Obj.map_on_summand'_assoc 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) (θ : Δ ⟶ Δ') {Z : C} (h : (AlgebraicTopology.DoldKan.Γ₀.obj K).obj Δ' ⟶ Z) : CategoryTheory.CategoryStruct.comp (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan Δ).inj A) (CategoryTheory.CategoryStruct.comp ((AlgebraicTopology.DoldKan.Γ₀.obj K).map θ) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.Obj.Termwise.mapMono K (CategoryTheory.Limits.image.ι (CategoryTheory.CategoryStruct.comp θ.unop A.e))) (((AlgebraicTopology.DoldKan.Γ₀.splitting K).cofan Δ').inj (A.pull θ))) h - AlgebraicTopology.DoldKan.Γ₀.Obj.map_on_summand₀'_assoc 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) [CategoryTheory.Limits.HasFiniteCoproducts C] {Δ Δ' : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) (θ : Δ ⟶ Δ') {Z : C} (h : AlgebraicTopology.DoldKan.Γ₀.Obj.obj₂ K Δ' ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (AlgebraicTopology.DoldKan.Γ₀.Obj.summand K Δ) A) (CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.Obj.map K θ) h) = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.Obj.Termwise.mapMono K (CategoryTheory.Limits.image.ι (CategoryTheory.CategoryStruct.comp θ.unop A.e))) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (AlgebraicTopology.DoldKan.Γ₀.Obj.summand K Δ') (A.pull θ)) h) - AlgebraicTopology.DoldKan.Γ₂_obj_p_app 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (P : CategoryTheory.Idempotents.Karoubi (ChainComplex C ℕ)) (Δ : SimplexCategoryᵒᵖ) : (AlgebraicTopology.DoldKan.Γ₂.obj P).p.app Δ = (AlgebraicTopology.DoldKan.Γ₀.splitting P.X).desc Δ fun A => CategoryTheory.CategoryStruct.comp (P.p.f (Opposite.unop A.fst).len) (((AlgebraicTopology.DoldKan.Γ₀.splitting P.X).cofan Δ).inj A) - AlgebraicTopology.DoldKan.Γ₂_map_f_app 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] {X✝ Y✝ : CategoryTheory.Idempotents.Karoubi (ChainComplex C ℕ)} (f : X✝ ⟶ Y✝) (Δ : SimplexCategoryᵒᵖ) : (AlgebraicTopology.DoldKan.Γ₂.map f).f.app Δ = (AlgebraicTopology.DoldKan.Γ₀.splitting X✝.X).desc Δ fun A => CategoryTheory.CategoryStruct.comp (f.f.f (Opposite.unop A.fst).len) (((AlgebraicTopology.DoldKan.Γ₀.splitting Y✝.X).cofan Δ).inj A) - AlgebraicTopology.DoldKan.Γ₀NondegComplexIso 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) : (AlgebraicTopology.DoldKan.Γ₀.splitting K).nondegComplex ≅ K - AlgebraicTopology.DoldKan.Γ₀NondegComplexIso_hom_f 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) (i : ℕ) : (AlgebraicTopology.DoldKan.Γ₀NondegComplexIso K).hom.f i = CategoryTheory.CategoryStruct.id ((AlgebraicTopology.DoldKan.Γ₀.splitting K).N i) - AlgebraicTopology.DoldKan.Γ₀NondegComplexIso_inv_f 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) (i : ℕ) : (AlgebraicTopology.DoldKan.Γ₀NondegComplexIso K).inv.f i = CategoryTheory.CategoryStruct.id ((AlgebraicTopology.DoldKan.Γ₀.splitting K).N i) - AlgebraicTopology.DoldKan.Γ₀'CompNondegComplexFunctor 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : AlgebraicTopology.DoldKan.Γ₀'.comp CategoryTheory.SimplicialObject.Split.nondegComplexFunctor ≅ CategoryTheory.Functor.id (ChainComplex C ℕ) - AlgebraicTopology.DoldKan.N₁Γ₀ 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : AlgebraicTopology.DoldKan.Γ₀.comp AlgebraicTopology.DoldKan.N₁ ≅ CategoryTheory.Idempotents.toKaroubi (ChainComplex C ℕ) - AlgebraicTopology.DoldKan.N₂Γ₂ 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : AlgebraicTopology.DoldKan.Γ₂.comp AlgebraicTopology.DoldKan.N₂ ≅ CategoryTheory.Functor.id (CategoryTheory.Idempotents.Karoubi (ChainComplex C ℕ)) - AlgebraicTopology.DoldKan.N₂Γ₂ToKaroubiIso 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : (CategoryTheory.Idempotents.toKaroubi (ChainComplex C ℕ)).comp (AlgebraicTopology.DoldKan.Γ₂.comp AlgebraicTopology.DoldKan.N₂) ≅ AlgebraicTopology.DoldKan.Γ₀.comp AlgebraicTopology.DoldKan.N₁ - AlgebraicTopology.DoldKan.N₁Γ₀_app 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) : AlgebraicTopology.DoldKan.N₁Γ₀.app K = (AlgebraicTopology.DoldKan.Γ₀.splitting K).toKaroubiNondegComplexIsoN₁.symm ≪≫ (CategoryTheory.Idempotents.toKaroubi (ChainComplex C ℕ)).mapIso (AlgebraicTopology.DoldKan.Γ₀NondegComplexIso K) - AlgebraicTopology.DoldKan.N₁Γ₀_hom_app 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) : AlgebraicTopology.DoldKan.N₁Γ₀.hom.app K = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₀.splitting K).toKaroubiNondegComplexIsoN₁.inv ((CategoryTheory.Idempotents.toKaroubi (ChainComplex C ℕ)).map (AlgebraicTopology.DoldKan.Γ₀NondegComplexIso K).hom) - AlgebraicTopology.DoldKan.N₁Γ₀_inv_app 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) : AlgebraicTopology.DoldKan.N₁Γ₀.inv.app K = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Idempotents.toKaroubi (ChainComplex C ℕ)).map (AlgebraicTopology.DoldKan.Γ₀NondegComplexIso K).inv) (AlgebraicTopology.DoldKan.Γ₀.splitting K).toKaroubiNondegComplexIsoN₁.hom - AlgebraicTopology.DoldKan.N₁Γ₀_hom_app_f_f 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) (n : ℕ) : (AlgebraicTopology.DoldKan.N₁Γ₀.hom.app K).f.f n = (AlgebraicTopology.DoldKan.Γ₀.splitting K).toKaroubiNondegComplexIsoN₁.inv.f.f n - AlgebraicTopology.DoldKan.N₁Γ₀_inv_app_f_f 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) (n : ℕ) : (AlgebraicTopology.DoldKan.N₁Γ₀.inv.app K).f.f n = (AlgebraicTopology.DoldKan.Γ₀.splitting K).toKaroubiNondegComplexIsoN₁.hom.f.f n - AlgebraicTopology.DoldKan.N₂Γ₂ToKaroubiIso_inv_app 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : ChainComplex C ℕ) : (AlgebraicTopology.DoldKan.N₂Γ₂ToKaroubiIso.inv.app X).f = AlgebraicTopology.DoldKan.PInfty - AlgebraicTopology.DoldKan.N₂Γ₂ToKaroubiIso_hom_app 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : ChainComplex C ℕ) : (AlgebraicTopology.DoldKan.N₂Γ₂ToKaroubiIso.hom.app X).f = AlgebraicTopology.DoldKan.PInfty - AlgebraicTopology.DoldKan.N₂Γ₂_inv_app_f_f 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : CategoryTheory.Idempotents.Karoubi (ChainComplex C ℕ)) (n : ℕ) : (AlgebraicTopology.DoldKan.N₂Γ₂.inv.app X).f.f n = CategoryTheory.CategoryStruct.comp (X.p.f n) (((AlgebraicTopology.DoldKan.Γ₀.splitting X.X).cofan (Opposite.op { len := n })).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n }))) - AlgebraicTopology.DoldKan.whiskerLeft_toKaroubi_N₂Γ₂_hom 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : (CategoryTheory.Idempotents.toKaroubi (ChainComplex C ℕ)).whiskerLeft AlgebraicTopology.DoldKan.N₂Γ₂.hom = CategoryTheory.CategoryStruct.comp AlgebraicTopology.DoldKan.N₂Γ₂ToKaroubiIso.hom AlgebraicTopology.DoldKan.N₁Γ₀.hom - AlgebraicTopology.DoldKan.N₂Γ₂_compatible_with_N₁Γ₀ 📋 Mathlib.AlgebraicTopology.DoldKan.GammaCompN
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (K : ChainComplex C ℕ) : AlgebraicTopology.DoldKan.N₂Γ₂.hom.app ((CategoryTheory.Idempotents.toKaroubi (ChainComplex C ℕ)).obj K) = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.N₂Γ₂ToKaroubiIso.hom.app K) (AlgebraicTopology.DoldKan.N₁Γ₀.hom.app K) - AlgebraicTopology.DoldKan.Γ₂N₁ 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Idempotents.toKaroubi (CategoryTheory.SimplicialObject C) ≅ AlgebraicTopology.DoldKan.N₁.comp AlgebraicTopology.DoldKan.Γ₂ - AlgebraicTopology.DoldKan.instIsIsoFunctorSimplicialObjectKaroubiNatTrans 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.IsIso AlgebraicTopology.DoldKan.Γ₂N₁.natTrans - AlgebraicTopology.DoldKan.Γ₂N₂ 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Functor.id (CategoryTheory.Idempotents.Karoubi (CategoryTheory.SimplicialObject C)) ≅ AlgebraicTopology.DoldKan.N₂.comp AlgebraicTopology.DoldKan.Γ₂ - AlgebraicTopology.DoldKan.instIsIsoFunctorKaroubiSimplicialObjectNatTrans 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.IsIso AlgebraicTopology.DoldKan.Γ₂N₂.natTrans - AlgebraicTopology.DoldKan.Γ₂N₁.natTrans 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : AlgebraicTopology.DoldKan.N₁.comp AlgebraicTopology.DoldKan.Γ₂ ⟶ CategoryTheory.Idempotents.toKaroubi (CategoryTheory.SimplicialObject C) - AlgebraicTopology.DoldKan.Γ₂N₂.natTrans 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : AlgebraicTopology.DoldKan.N₂.comp AlgebraicTopology.DoldKan.Γ₂ ⟶ CategoryTheory.Functor.id (CategoryTheory.Idempotents.Karoubi (CategoryTheory.SimplicialObject C)) - AlgebraicTopology.DoldKan.Γ₂N₂ToKaroubiIso 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : (CategoryTheory.Idempotents.toKaroubi (CategoryTheory.SimplicialObject C)).comp (AlgebraicTopology.DoldKan.N₂.comp AlgebraicTopology.DoldKan.Γ₂) ≅ AlgebraicTopology.DoldKan.N₁.comp AlgebraicTopology.DoldKan.Γ₂ - AlgebraicTopology.DoldKan.Γ₂N₁_inv 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : AlgebraicTopology.DoldKan.Γ₂N₁.inv = AlgebraicTopology.DoldKan.Γ₂N₁.natTrans - AlgebraicTopology.DoldKan.Γ₂N₂_inv 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : AlgebraicTopology.DoldKan.Γ₂N₂.inv = AlgebraicTopology.DoldKan.Γ₂N₂.natTrans - AlgebraicTopology.DoldKan.Γ₂N₁.natTrans_app_f_app 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : CategoryTheory.SimplicialObject C) (Δ : SimplexCategoryᵒᵖ) : (AlgebraicTopology.DoldKan.Γ₂N₁.natTrans.app X).f.app Δ = (AlgebraicTopology.DoldKan.Γ₀.splitting (AlgebraicTopology.AlternatingFaceMapComplex.obj X)).desc Δ fun A => CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.PInfty.f (Opposite.unop A.fst).len) (X.map A.e.op) - AlgebraicTopology.DoldKan.Γ₂N₂ToKaroubiIso_hom_app 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : CategoryTheory.SimplicialObject C) : AlgebraicTopology.DoldKan.Γ₂N₂ToKaroubiIso.hom.app X = AlgebraicTopology.DoldKan.Γ₂.map (AlgebraicTopology.DoldKan.toKaroubiCompN₂IsoN₁.hom.app X) - AlgebraicTopology.DoldKan.Γ₂N₂ToKaroubiIso_inv_app 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : CategoryTheory.SimplicialObject C) : AlgebraicTopology.DoldKan.Γ₂N₂ToKaroubiIso.inv.app X = AlgebraicTopology.DoldKan.Γ₂.map (AlgebraicTopology.DoldKan.toKaroubiCompN₂IsoN₁.inv.app X) - AlgebraicTopology.DoldKan.compatibility_Γ₂N₁_Γ₂N₂_natTrans 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : CategoryTheory.SimplicialObject C) : AlgebraicTopology.DoldKan.Γ₂N₁.natTrans.app X = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.Γ₂N₂ToKaroubiIso.app X).inv (AlgebraicTopology.DoldKan.Γ₂N₂.natTrans.app ((CategoryTheory.Idempotents.toKaroubi (CategoryTheory.SimplicialObject C)).obj X)) - AlgebraicTopology.DoldKan.Γ₂N₂.natTrans_app_f_app 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (P : CategoryTheory.Idempotents.Karoubi (CategoryTheory.SimplicialObject C)) : AlgebraicTopology.DoldKan.Γ₂N₂.natTrans.app P = CategoryTheory.CategoryStruct.comp ((AlgebraicTopology.DoldKan.N₂.comp AlgebraicTopology.DoldKan.Γ₂).map P.decompId_i) (CategoryTheory.CategoryStruct.comp ((CategoryTheory.CategoryStruct.comp AlgebraicTopology.DoldKan.Γ₂N₂ToKaroubiIso.hom AlgebraicTopology.DoldKan.Γ₂N₁.natTrans).app P.X) P.decompId_p) - AlgebraicTopology.DoldKan.identity_N₂_objectwise 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] (P : CategoryTheory.Idempotents.Karoubi (CategoryTheory.SimplicialObject C)) : CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.N₂Γ₂.inv.app (AlgebraicTopology.DoldKan.N₂.obj P)) (AlgebraicTopology.DoldKan.N₂.map (AlgebraicTopology.DoldKan.Γ₂N₂.natTrans.app P)) = CategoryTheory.CategoryStruct.id (AlgebraicTopology.DoldKan.N₂.obj P) - AlgebraicTopology.DoldKan.identity_N₂ 📋 Mathlib.AlgebraicTopology.DoldKan.NCompGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.id AlgebraicTopology.DoldKan.N₂ ◫ AlgebraicTopology.DoldKan.N₂Γ₂.inv) (CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.N₂.associator AlgebraicTopology.DoldKan.Γ₂ AlgebraicTopology.DoldKan.N₂).inv (AlgebraicTopology.DoldKan.Γ₂N₂.natTrans ◫ CategoryTheory.CategoryStruct.id AlgebraicTopology.DoldKan.N₂)) = CategoryTheory.CategoryStruct.id AlgebraicTopology.DoldKan.N₂ - CategoryTheory.Preadditive.DoldKan.equivalence 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalenceAdditive
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Idempotents.Karoubi (CategoryTheory.SimplicialObject C) ≌ CategoryTheory.Idempotents.Karoubi (ChainComplex C ℕ) - CategoryTheory.Preadditive.DoldKan.Γ 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalenceAdditive
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Functor (CategoryTheory.Idempotents.Karoubi (ChainComplex C ℕ)) (CategoryTheory.Idempotents.Karoubi (CategoryTheory.SimplicialObject C)) - CategoryTheory.Preadditive.DoldKan.equivalence_functor 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalenceAdditive
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Preadditive.DoldKan.equivalence.functor = CategoryTheory.Preadditive.DoldKan.N - CategoryTheory.Preadditive.DoldKan.equivalence_inverse 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalenceAdditive
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Preadditive.DoldKan.equivalence.inverse = CategoryTheory.Preadditive.DoldKan.Γ - CategoryTheory.Preadditive.DoldKan.equivalence_unitIso 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalenceAdditive
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Preadditive.DoldKan.equivalence.unitIso = AlgebraicTopology.DoldKan.Γ₂N₂ - CategoryTheory.Preadditive.DoldKan.equivalence_counitIso 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalenceAdditive
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Preadditive.DoldKan.equivalence.counitIso = AlgebraicTopology.DoldKan.N₂Γ₂ - CategoryTheory.Idempotents.DoldKan.N 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Functor (CategoryTheory.SimplicialObject C) (ChainComplex C ℕ) - CategoryTheory.Idempotents.DoldKan.equivalence 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.SimplicialObject C ≌ ChainComplex C ℕ - CategoryTheory.Idempotents.DoldKan.Γ 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Functor (ChainComplex C ℕ) (CategoryTheory.SimplicialObject C) - CategoryTheory.Idempotents.DoldKan.Γ_obj_obj 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : ChainComplex C ℕ) (Δ : SimplexCategoryᵒᵖ) : (CategoryTheory.Idempotents.DoldKan.Γ.obj X).obj Δ = AlgebraicTopology.DoldKan.Γ₀.Obj.obj₂ X Δ - CategoryTheory.Idempotents.DoldKan.equivalence_functor 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Idempotents.DoldKan.equivalence.functor = CategoryTheory.Idempotents.DoldKan.N - CategoryTheory.Idempotents.DoldKan.equivalence_inverse 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Idempotents.DoldKan.equivalence.inverse = CategoryTheory.Idempotents.DoldKan.Γ - CategoryTheory.Idempotents.DoldKan.ε 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Functor.id (CategoryTheory.SimplicialObject C) ≅ CategoryTheory.Idempotents.DoldKan.N.comp CategoryTheory.Idempotents.DoldKan.Γ - CategoryTheory.Idempotents.DoldKan.Γ_obj_map 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : ChainComplex C ℕ) {X✝ Y✝ : SimplexCategoryᵒᵖ} (θ : X✝ ⟶ Y✝) : (CategoryTheory.Idempotents.DoldKan.Γ.obj X).map θ = AlgebraicTopology.DoldKan.Γ₀.Obj.map X θ - CategoryTheory.Idempotents.DoldKan.equivalence_unitIso 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Idempotents.DoldKan.equivalence.unitIso = CategoryTheory.Idempotents.DoldKan.ε - CategoryTheory.Idempotents.DoldKan.η 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Idempotents.DoldKan.Γ.comp CategoryTheory.Idempotents.DoldKan.N ≅ CategoryTheory.Functor.id (ChainComplex C ℕ) - CategoryTheory.Idempotents.DoldKan.N_obj 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : CategoryTheory.SimplicialObject C) : CategoryTheory.Idempotents.DoldKan.N.obj X = (CategoryTheory.Idempotents.toKaroubiEquivalence (ChainComplex C ℕ)).inverse.obj (AlgebraicTopology.DoldKan.N₁.obj X) - CategoryTheory.Idempotents.DoldKan.isoN₁ 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : (CategoryTheory.Idempotents.toKaroubiEquivalence (CategoryTheory.SimplicialObject C)).functor.comp CategoryTheory.Preadditive.DoldKan.equivalence.functor ≅ AlgebraicTopology.DoldKan.N₁ - CategoryTheory.Idempotents.DoldKan.equivalence_counitIso 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Idempotents.DoldKan.equivalence.counitIso = CategoryTheory.Idempotents.DoldKan.η - CategoryTheory.Idempotents.DoldKan.hε 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : AlgebraicTopology.DoldKan.Compatibility.υ CategoryTheory.Idempotents.DoldKan.isoN₁ = AlgebraicTopology.DoldKan.Γ₂N₁ - CategoryTheory.Idempotents.DoldKan.Γ_map_app 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] {X✝ Y✝ : ChainComplex C ℕ} (f : X✝ ⟶ Y✝) (Δ : SimplexCategoryᵒᵖ) : (CategoryTheory.Idempotents.DoldKan.Γ.map f).app Δ = (AlgebraicTopology.DoldKan.Γ₀.splitting X✝).desc Δ fun A => CategoryTheory.CategoryStruct.comp (f.f (Opposite.unop A.fst).len) (((AlgebraicTopology.DoldKan.Γ₀.splitting Y✝).cofan Δ).inj A) - CategoryTheory.Idempotents.DoldKan.isoΓ₀ 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : (CategoryTheory.Idempotents.toKaroubiEquivalence (ChainComplex C ℕ)).functor.comp CategoryTheory.Preadditive.DoldKan.equivalence.inverse ≅ CategoryTheory.Idempotents.DoldKan.Γ.comp (CategoryTheory.Idempotents.toKaroubiEquivalence (CategoryTheory.SimplicialObject C)).functor - CategoryTheory.Idempotents.DoldKan.N_map 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] {X✝ Y✝ : CategoryTheory.SimplicialObject C} (f : X✝ ⟶ Y✝) : CategoryTheory.Idempotents.DoldKan.N.map f = (CategoryTheory.Idempotents.toKaroubiEquivalence (ChainComplex C ℕ)).inverse.map (AlgebraicTopology.DoldKan.N₁.map f) - CategoryTheory.Idempotents.DoldKan.hη 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] : AlgebraicTopology.DoldKan.Compatibility.τ₀ = AlgebraicTopology.DoldKan.Compatibility.τ₁ CategoryTheory.Idempotents.DoldKan.isoN₁ CategoryTheory.Idempotents.DoldKan.isoΓ₀ AlgebraicTopology.DoldKan.N₁Γ₀ - CategoryTheory.Idempotents.DoldKan.isoN₁_hom_app_f 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : CategoryTheory.SimplicialObject C) : (CategoryTheory.Idempotents.DoldKan.isoN₁.hom.app X).f = AlgebraicTopology.DoldKan.PInfty - CategoryTheory.Idempotents.DoldKan.N₂_map_isoΓ₀_hom_app_f 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : ChainComplex C ℕ) : (AlgebraicTopology.DoldKan.N₂.map (CategoryTheory.Idempotents.DoldKan.isoΓ₀.hom.app X)).f = AlgebraicTopology.DoldKan.PInfty - CategoryTheory.Idempotents.DoldKan.η_hom_app_f 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : ChainComplex C ℕ) (i : ℕ) : (CategoryTheory.Idempotents.DoldKan.η.hom.app X).f i = CategoryTheory.CategoryStruct.comp (((CategoryTheory.Idempotents.toKaroubiEquivalence (ChainComplex C ℕ)).inverse.map (AlgebraicTopology.DoldKan.N₁Γ₀.hom.app X)).f i) (((CategoryTheory.Idempotents.toKaroubiEquivalence (ChainComplex C ℕ)).unitIso.inv.app X).f i) - CategoryTheory.Idempotents.DoldKan.η_inv_app_f 📋 Mathlib.AlgebraicTopology.DoldKan.EquivalencePseudoabelian
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.IsIdempotentComplete C] [CategoryTheory.Limits.HasFiniteCoproducts C] (X : ChainComplex C ℕ) (i : ℕ) : (CategoryTheory.Idempotents.DoldKan.η.inv.app X).f i = CategoryTheory.CategoryStruct.comp (((CategoryTheory.Idempotents.toKaroubiEquivalence (ChainComplex C ℕ)).unitIso.hom.app X).f i) (((CategoryTheory.Idempotents.toKaroubiEquivalence (ChainComplex C ℕ)).inverse.map (AlgebraicTopology.DoldKan.N₁Γ₀.inv.app X)).f i) - CategoryTheory.instHasCoproductsIndOfHasFiniteCoproducts 📋 Mathlib.CategoryTheory.Limits.Indization.Category
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Limits.HasCoproducts (CategoryTheory.Ind C) - CategoryTheory.Limits.CoproductsFromFiniteFiltered.finiteSubcoproductsCocone_ι_app_eq_sum 📋 Mathlib.CategoryTheory.Preadditive.LiftToFinset
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasFiniteCoproducts C] {α : Type w} [DecidableEq α] (f : α → C) [CategoryTheory.Limits.HasCoproduct f] (S : Finset (CategoryTheory.Discrete α)) : (CategoryTheory.Limits.CoproductsFromFiniteFiltered.finiteSubcoproductsCocone f).ι.app S = ∑ a ∈ S.attach, CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.π (fun a => f (↑a).as) a) (CategoryTheory.Limits.Sigma.ι f (↑a).as) - CategoryTheory.ObjectProperty.preservesMonomorphisms_ι_of_isNormalEpiCategory 📋 Mathlib.CategoryTheory.Abelian.Subcategory
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P : CategoryTheory.ObjectProperty C) [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasFiniteCoproducts C] [CategoryTheory.Limits.HasKernels C] [CategoryTheory.Limits.HasCokernels C] [CategoryTheory.IsNormalEpiCategory C] [CategoryTheory.Limits.HasZeroObject C] [P.ContainsZero] [P.IsClosedUnderKernels] : P.ι.PreservesMonomorphisms - Action.instHasFiniteCoproducts 📋 Mathlib.CategoryTheory.Action.Limits
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {G : Type u_2} [Monoid G] [CategoryTheory.Limits.HasFiniteCoproducts V] : CategoryTheory.Limits.HasFiniteCoproducts (Action V G) - CategoryTheory.PreGaloisCategory.hasFiniteCoproducts 📋 Mathlib.CategoryTheory.Galois.Basic
{C : Type u₁} {inst✝ : CategoryTheory.Category.{u₂, u₁} C} [self : CategoryTheory.PreGaloisCategory C] : CategoryTheory.Limits.HasFiniteCoproducts C - CategoryTheory.PreGaloisCategory.mk 📋 Mathlib.CategoryTheory.Galois.Basic
{C : Type u₁} [CategoryTheory.Category.{u₂, u₁} C] (hasTerminal : CategoryTheory.Limits.HasTerminal C := by infer_instance) (hasPullbacks : CategoryTheory.Limits.HasPullbacks C := by infer_instance) (hasFiniteCoproducts : CategoryTheory.Limits.HasFiniteCoproducts C := by infer_instance) (hasQuotientsByFiniteGroups : ∀ (G : Type u₂) [inst : Group G] [Finite G], CategoryTheory.Limits.HasColimitsOfShape (CategoryTheory.SingleObj G) C := by infer_instance) (monoInducesIsoOnDirectSummand : ∀ {X Y : C} (i : X ⟶ Y) [CategoryTheory.Mono i], ∃ Z u, Nonempty (CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.BinaryCofan.mk i u))) : CategoryTheory.PreGaloisCategory C - CategoryTheory.instPreregularOfPrecoherentOfHasFiniteCoproducts 📋 Mathlib.CategoryTheory.Sites.Coherent.Comparison
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Precoherent C] [CategoryTheory.Limits.HasFiniteCoproducts C] : CategoryTheory.Preregular C - CompHausLike.instHasFiniteCoproductsOfHasExplicitFiniteCoproducts 📋 Mathlib.Topology.Category.CompHausLike.Limits
{P : TopCat → Prop} [CompHausLike.HasExplicitFiniteCoproducts P] : CategoryTheory.Limits.HasFiniteCoproducts (CompHausLike P)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c