Loogle!
Result
Found 125 declarations mentioning CategoryTheory.MorphismProperty.monomorphisms.
- CategoryTheory.MorphismProperty.monomorphisms 📋 Mathlib.CategoryTheory.MorphismProperty.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] : CategoryTheory.MorphismProperty C - CategoryTheory.MorphismProperty.RespectsIso.monomorphisms 📋 Mathlib.CategoryTheory.MorphismProperty.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] : (CategoryTheory.MorphismProperty.monomorphisms C).RespectsIso - CategoryTheory.MorphismProperty.monomorphisms.infer_property 📋 Mathlib.CategoryTheory.MorphismProperty.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X ⟶ Y) [hf : CategoryTheory.Mono f] : CategoryTheory.MorphismProperty.monomorphisms C f - CategoryTheory.MorphismProperty.monomorphisms.iff 📋 Mathlib.CategoryTheory.MorphismProperty.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X ⟶ Y) : CategoryTheory.MorphismProperty.monomorphisms C f ↔ CategoryTheory.Mono f - CategoryTheory.Limits.functorialEpiMonoFactorizationData 📋 Mathlib.CategoryTheory.Limits.Shapes.Images
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasStrongEpiMonoFactorisations C] : (CategoryTheory.MorphismProperty.epimorphisms C).FunctorialFactorizationData (CategoryTheory.MorphismProperty.monomorphisms C) - CategoryTheory.MorphismProperty.IsMultiplicative.instMonomorphisms 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] : (CategoryTheory.MorphismProperty.monomorphisms C).IsMultiplicative - CategoryTheory.ConcreteCategory.injective_eq_monomorphisms 📋 Mathlib.CategoryTheory.ConcreteCategory.EpiMono
(C : Type u) [CategoryTheory.Category.{v, u} C] {FC : C → C → Type u_1} {CC : C → Type w} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [CategoryTheory.ConcreteCategory C FC] [(CategoryTheory.forget C).PreservesMonomorphisms] : CategoryTheory.MorphismProperty.injective C = CategoryTheory.MorphismProperty.monomorphisms C - CategoryTheory.ConcreteCategory.injective_eq_monomorphisms_iff 📋 Mathlib.CategoryTheory.ConcreteCategory.EpiMono
(C : Type u) [CategoryTheory.Category.{v, u} C] {FC : C → C → Type u_1} {CC : C → Type w} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [CategoryTheory.ConcreteCategory C FC] : CategoryTheory.MorphismProperty.injective C = CategoryTheory.MorphismProperty.monomorphisms C ↔ (CategoryTheory.forget C).PreservesMonomorphisms - CategoryTheory.ConcreteCategory.injective_le_monomorphisms 📋 Mathlib.CategoryTheory.ConcreteCategory.EpiMono
(C : Type u) [CategoryTheory.Category.{v, u} C] {FC : C → C → Type u_1} {CC : C → Type w} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [CategoryTheory.ConcreteCategory C FC] : CategoryTheory.MorphismProperty.injective C ≤ CategoryTheory.MorphismProperty.monomorphisms C - CategoryTheory.MorphismProperty.IsStableUnderBaseChange.monomorphisms 📋 Mathlib.CategoryTheory.MorphismProperty.Limits
(C : Type u) [CategoryTheory.Category.{v, u} C] : (CategoryTheory.MorphismProperty.monomorphisms C).IsStableUnderBaseChange - CategoryTheory.MorphismProperty.IsStableUnderBaseChange.hasOfPostcompProperty_monomorphisms 📋 Mathlib.CategoryTheory.MorphismProperty.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.MorphismProperty C} [P.IsStableUnderBaseChange] : P.HasOfPostcompProperty (CategoryTheory.MorphismProperty.monomorphisms C) - CategoryTheory.MorphismProperty.diagonal_isomorphisms 📋 Mathlib.CategoryTheory.MorphismProperty.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] : (CategoryTheory.MorphismProperty.isomorphisms C).diagonal = CategoryTheory.MorphismProperty.monomorphisms C - CategoryTheory.MorphismProperty.instMonoMapOfIsStableUnderCoproductsOfShapeMonomorphisms 📋 Mathlib.CategoryTheory.MorphismProperty.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : Type u_1) [(CategoryTheory.MorphismProperty.monomorphisms C).IsStableUnderCoproductsOfShape J] {X₁ X₂ : J → C} (f : (j : J) → X₁ j ⟶ X₂ j) [CategoryTheory.Limits.HasCoproduct X₁] [CategoryTheory.Limits.HasCoproduct X₂] [∀ (j : J), CategoryTheory.Mono (f j)] : CategoryTheory.Mono (CategoryTheory.Limits.Sigma.map f) - CategoryTheory.MorphismProperty.IsStableUnderRetracts.monomorphisms 📋 Mathlib.CategoryTheory.MorphismProperty.Retract
{C : Type u} [CategoryTheory.Category.{v, u} C] : (CategoryTheory.MorphismProperty.monomorphisms C).IsStableUnderRetracts - CategoryTheory.injective_iff_rlp_monomorphisms_of_isZero 📋 Mathlib.CategoryTheory.Preadditive.Injective.LiftingProperties
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasZeroMorphisms C] {I Z : C} (p : I ⟶ Z) (hZ : CategoryTheory.Limits.IsZero Z) : CategoryTheory.Injective I ↔ (CategoryTheory.MorphismProperty.monomorphisms C).rlp p - CategoryTheory.injective_iff_rlp_monomorphisms_zero 📋 Mathlib.CategoryTheory.Preadditive.Injective.LiftingProperties
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasZeroObject C] (I : C) : CategoryTheory.Injective I ↔ (CategoryTheory.MorphismProperty.monomorphisms C).rlp 0 - AlgebraicGeometry.IsOpenImmersion.le_monomorphisms 📋 Mathlib.AlgebraicGeometry.OpenImmersion
: AlgebraicGeometry.IsOpenImmersion ≤ CategoryTheory.MorphismProperty.monomorphisms AlgebraicGeometry.Scheme - AlgebraicGeometry.instIsZariskiLocalAtTargetMonomorphismsScheme 📋 Mathlib.AlgebraicGeometry.Morphisms.IsIso
: AlgebraicGeometry.IsZariskiLocalAtTarget (CategoryTheory.MorphismProperty.monomorphisms AlgebraicGeometry.Scheme) - AlgebraicGeometry.IsClosedImmersion.eq_isFinite_inf_mono 📋 Mathlib.AlgebraicGeometry.Morphisms.Finite
: @AlgebraicGeometry.IsClosedImmersion = @AlgebraicGeometry.IsFinite ⊓ CategoryTheory.MorphismProperty.monomorphisms AlgebraicGeometry.Scheme - AlgebraicGeometry.IsClosedImmersion.eq_proper_inf_monomorphisms 📋 Mathlib.AlgebraicGeometry.ZariskisMainTheorem
: @AlgebraicGeometry.IsClosedImmersion = @AlgebraicGeometry.IsProper ⊓ CategoryTheory.MorphismProperty.monomorphisms AlgebraicGeometry.Scheme - CategoryTheory.Abelian.instIsStableUnderCobaseChangeMonomorphisms 📋 Mathlib.CategoryTheory.Abelian.CommSq
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] : (CategoryTheory.MorphismProperty.monomorphisms C).IsStableUnderCobaseChange - CategoryTheory.MorphismProperty.instIsStableUnderCoproductsMonomorphismsOfAB4OfSize 📋 Mathlib.CategoryTheory.Abelian.GrothendieckAxioms.Colim
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.AB4OfSize.{u', v, u} C] : CategoryTheory.MorphismProperty.IsStableUnderCoproducts.{u', v, u} (CategoryTheory.MorphismProperty.monomorphisms C) - CategoryTheory.MorphismProperty.instIsStableUnderFilteredColimitsMonomorphismsOfAB5OfSize 📋 Mathlib.CategoryTheory.Abelian.GrothendieckAxioms.Colim
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasFilteredColimitsOfSize.{v', u', v, u} C] [CategoryTheory.AB5OfSize.{v', u', v, u} C] : CategoryTheory.MorphismProperty.IsStableUnderFilteredColimits.{v', u', v, u} (CategoryTheory.MorphismProperty.monomorphisms C) - CategoryTheory.MorphismProperty.isStableUnderColimitsOfShape_monomorphisms 📋 Mathlib.CategoryTheory.Abelian.GrothendieckAxioms.Colim
(C : Type u) [CategoryTheory.Category.{v, u} C] (J : Type u') [CategoryTheory.Category.{v', u'} J] [CategoryTheory.Limits.HasColimitsOfShape J C] [CategoryTheory.Limits.colim.PreservesMonomorphisms] : (CategoryTheory.MorphismProperty.monomorphisms C).IsStableUnderColimitsOfShape J - CategoryTheory.IsGrothendieckAbelian.instIsStableUnderTransfiniteCompositionMonomorphisms 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Monomorphisms
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : (CategoryTheory.MorphismProperty.monomorphisms C).IsStableUnderTransfiniteComposition - CategoryTheory.IsGrothendieckAbelian.instHasFunctorialFactorizationMonomorphismsRlp 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : (CategoryTheory.MorphismProperty.monomorphisms C).HasFunctorialFactorization (CategoryTheory.MorphismProperty.monomorphisms C).rlp - CategoryTheory.IsGrothendieckAbelian.llp_rlp_monomorphisms 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (hG : CategoryTheory.IsSeparator G) : (CategoryTheory.MorphismProperty.monomorphisms C).rlp.llp = CategoryTheory.MorphismProperty.monomorphisms C - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms_rlp 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (hG : CategoryTheory.IsSeparator G) : (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms G).rlp = (CategoryTheory.MorphismProperty.monomorphisms C).rlp - CategoryTheory.IsGrothendieckAbelian.monoMapFactorizationDataRlp 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X Y : C} (f : X ⟶ Y) : (CategoryTheory.MorphismProperty.monomorphisms C).MapFactorizationData (CategoryTheory.MorphismProperty.monomorphisms C).rlp f - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms_le_monomorphisms 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : C) : CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms G ≤ CategoryTheory.MorphismProperty.monomorphisms C - CategoryTheory.IsGrothendieckAbelian.instMonoIMonomorphismsRlpMonoMapFactorizationDataRlp 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X Y : C} (f : X ⟶ Y) : CategoryTheory.Mono (CategoryTheory.IsGrothendieckAbelian.monoMapFactorizationDataRlp f).i - CategoryTheory.IsGrothendieckAbelian.instInjectiveZMonomorphismsRlpMonoMapFactorizationDataRlpOfNatHom 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} : CategoryTheory.Injective (CategoryTheory.IsGrothendieckAbelian.monoMapFactorizationDataRlp 0).Z - CategoryTheory.MorphismProperty.presheaf_mono_of_le 📋 Mathlib.CategoryTheory.MorphismProperty.Representable
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {P : CategoryTheory.MorphismProperty C} {G : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (hP : P ≤ CategoryTheory.MorphismProperty.monomorphisms C) {X : C} {f : CategoryTheory.yoneda.obj X ⟶ G} (hf : P.presheaf f) : CategoryTheory.Mono f - CategoryTheory.MorphismProperty.presheaf_monomorphisms_le_monomorphisms 📋 Mathlib.CategoryTheory.MorphismProperty.Representable
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : (CategoryTheory.MorphismProperty.monomorphisms C).presheaf ≤ CategoryTheory.MorphismProperty.monomorphisms (CategoryTheory.Functor Cᵒᵖ (Type v₁)) - CategoryTheory.MorphismProperty.isIso_fst'_self 📋 Mathlib.CategoryTheory.MorphismProperty.Representable
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {P : CategoryTheory.MorphismProperty C} {G : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (hP : P ≤ CategoryTheory.MorphismProperty.monomorphisms C) {X : C} {f : CategoryTheory.yoneda.obj X ⟶ G} (hf : P.presheaf f) : CategoryTheory.IsIso (⋯.fst' f) - CategoryTheory.MorphismProperty.fst'_self_eq_snd 📋 Mathlib.CategoryTheory.MorphismProperty.Representable
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {P : CategoryTheory.MorphismProperty C} {G : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (hP : P ≤ CategoryTheory.MorphismProperty.monomorphisms C) {X : C} {f : CategoryTheory.yoneda.obj X ⟶ G} (hf : P.presheaf f) : ⋯.fst' f = ⋯.snd f - CategoryTheory.MorphismProperty.instIsStableUnderCoproductsFunctorMonomorphismsOfHasCoproductsOfHasPullbacks 📋 Mathlib.CategoryTheory.MorphismProperty.FunctorCategory
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : Type u'') [CategoryTheory.Category.{v'', u''} J] [CategoryTheory.MorphismProperty.IsStableUnderCoproducts.{u', v, u} (CategoryTheory.MorphismProperty.monomorphisms C)] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.HasPullbacks C] : CategoryTheory.MorphismProperty.IsStableUnderCoproducts.{u', max u'' v, max (max (max u u'') v) v''} (CategoryTheory.MorphismProperty.monomorphisms (CategoryTheory.Functor J C)) - CategoryTheory.MorphismProperty.instIsStableUnderCoproductsOfShapeFunctorMonomorphismsOfHasCoproductsOfShapeOfHasPullbacks 📋 Mathlib.CategoryTheory.MorphismProperty.FunctorCategory
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : Type u'') [CategoryTheory.Category.{v'', u''} J] (K' : Type u') [(CategoryTheory.MorphismProperty.monomorphisms C).IsStableUnderCoproductsOfShape K'] [CategoryTheory.Limits.HasCoproductsOfShape K' C] [CategoryTheory.Limits.HasPullbacks C] : (CategoryTheory.MorphismProperty.monomorphisms (CategoryTheory.Functor J C)).IsStableUnderCoproductsOfShape K' - CategoryTheory.MorphismProperty.functorCategory_monomorphisms 📋 Mathlib.CategoryTheory.MorphismProperty.FunctorCategory
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : Type u'') [CategoryTheory.Category.{v'', u''} J] [CategoryTheory.Limits.HasPullbacks C] : (CategoryTheory.MorphismProperty.monomorphisms C).functorCategory J = CategoryTheory.MorphismProperty.monomorphisms (CategoryTheory.Functor J C) - CategoryTheory.MorphismProperty.instIsStableUnderTransfiniteCompositionOfShapeFunctorMonomorphismsOfHasPullbacksOfHasIterationOfShape 📋 Mathlib.CategoryTheory.MorphismProperty.FunctorCategory
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : Type u'') [CategoryTheory.Category.{v'', u''} J] (K : Type u') [LinearOrder K] [SuccOrder K] [OrderBot K] [WellFoundedLT K] [(CategoryTheory.MorphismProperty.monomorphisms C).IsStableUnderTransfiniteCompositionOfShape K] [CategoryTheory.Limits.HasPullbacks C] [CategoryTheory.Limits.HasIterationOfShape K C] : (CategoryTheory.MorphismProperty.monomorphisms (CategoryTheory.Functor J C)).IsStableUnderTransfiniteCompositionOfShape K - CategoryTheory.Types.instIsStableUnderCobaseChangeMonomorphismsType 📋 Mathlib.CategoryTheory.Types.Monomorphisms
: (CategoryTheory.MorphismProperty.monomorphisms (Type u)).IsStableUnderCobaseChange - CategoryTheory.Types.instIsStableUnderCoproductsMonomorphismsType 📋 Mathlib.CategoryTheory.Types.Monomorphisms
: CategoryTheory.MorphismProperty.IsStableUnderCoproducts.{u_1, u, u + 1} (CategoryTheory.MorphismProperty.monomorphisms (Type u)) - CategoryTheory.Types.instIsStableUnderFilteredColimitsMonomorphismsType 📋 Mathlib.CategoryTheory.Types.Monomorphisms
: CategoryTheory.MorphismProperty.IsStableUnderFilteredColimits.{v', u', u, u + 1} (CategoryTheory.MorphismProperty.monomorphisms (Type u)) - CategoryTheory.Types.instIsStableUnderCoproductsOfShapeMonomorphismsType 📋 Mathlib.CategoryTheory.Types.Monomorphisms
(T : Type u') : (CategoryTheory.MorphismProperty.monomorphisms (Type u)).IsStableUnderCoproductsOfShape T - SSet.modelCategoryQuillen.cofibrations_eq 📋 Mathlib.AlgebraicTopology.SimplicialSet.CategoryWithFibrations
: HomotopicalAlgebra.cofibrations SSet = CategoryTheory.MorphismProperty.monomorphisms SSet - SSet.rlp_monomorphisms 📋 Mathlib.AlgebraicTopology.SimplicialSet.CategoryWithFibrations
: (CategoryTheory.MorphismProperty.monomorphisms SSet).rlp = SSet.modelCategoryQuillen.I.rlp - SSet.modelCategoryQuillen.I_le_monomorphisms 📋 Mathlib.AlgebraicTopology.SimplicialSet.CategoryWithFibrations
: SSet.modelCategoryQuillen.I ≤ CategoryTheory.MorphismProperty.monomorphisms SSet - SSet.modelCategoryQuillen.J_le_monomorphisms 📋 Mathlib.AlgebraicTopology.SimplicialSet.CategoryWithFibrations
: SSet.modelCategoryQuillen.J ≤ CategoryTheory.MorphismProperty.monomorphisms SSet - SSet.innerHornInclusions_le_monomorphisms 📋 Mathlib.AlgebraicTopology.Quasicategory.InnerFibration
: SSet.innerHornInclusions ≤ CategoryTheory.MorphismProperty.monomorphisms SSet - SSet.toPairFunctor 📋 Mathlib.AlgebraicTopology.SimplicialSet.SSetPair
: CategoryTheory.Functor SSet SSetPair - SSet.toPairFunctor_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.SSetPair
(X : SSet) : SSet.toPairFunctor.obj X = X.pair - SSet.Subcomplex.toPairFunctor 📋 Mathlib.AlgebraicTopology.SimplicialSet.SSetPair
(X : SSet) : CategoryTheory.Functor X.Subcomplex SSetPair - SSetPair.forget 📋 Mathlib.AlgebraicTopology.SimplicialSet.SSetPair
: CategoryTheory.Functor SSetPair (CategoryTheory.Arrow SSet) - SSet.Subcomplex.toPairFunctor_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.SSetPair
(X : SSet) (A : X.Subcomplex) : (SSet.Subcomplex.toPairFunctor X).obj A = A.pair - SSet.Subcomplex.toPairFunctor_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.SSetPair
(X : SSet) {X✝ Y✝ : X.Subcomplex} (f : X✝ ⟶ Y✝) : (SSet.Subcomplex.toPairFunctor X).map f = SSetPair.homMk (SSet.Subcomplex.homOfLE ⋯) (CategoryTheory.CategoryStruct.id X✝.pair.right) ⋯ - SSetPair.instMonoSSetHom 📋 Mathlib.AlgebraicTopology.SimplicialSet.SSetPair
(P : SSetPair) : CategoryTheory.Mono P.hom - SSet.toPairFunctor_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.SSetPair
{X✝ Y✝ : SSet} (f : X✝ ⟶ Y✝) : SSet.toPairFunctor.map f = SSetPair.homMk (SSet.Subcomplex.lift (CategoryTheory.CategoryStruct.comp ⊥.ι f) ⋯) f ⋯ - SSetPair.homMk 📋 Mathlib.AlgebraicTopology.SimplicialSet.SSetPair
{X Y : SSetPair} (left : X.left ⟶ Y.left) (right : X.right ⟶ Y.right) (w : CategoryTheory.CategoryStruct.comp left Y.hom = CategoryTheory.CategoryStruct.comp X.hom right := by cat_disch) : X ⟶ Y - SSetPair.homologyFunctor 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) [CategoryTheory.CategoryWithHomology C] (n : ℕ) : CategoryTheory.Functor SSetPair C - SSetPair.homologyFunctor_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) [CategoryTheory.CategoryWithHomology C] (n : ℕ) (P : SSetPair) : (SSetPair.homologyFunctor R n).obj P = P.homology R n - SSetPair.homologyMap 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] {P P' : SSetPair} (f : P ⟶ P') (R : C) [CategoryTheory.CategoryWithHomology C] (n : ℕ) : P.homology R n ⟶ P'.homology R n - SSetPair.homologyπ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) [CategoryTheory.CategoryWithHomology C] (n : ℕ) : P.right.homology R n ⟶ P.homology R n - SSetPair.homologyMap_id 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) [CategoryTheory.CategoryWithHomology C] (n : ℕ) : SSetPair.homologyMap (CategoryTheory.CategoryStruct.id P) R n = CategoryTheory.CategoryStruct.id (P.homology R n) - SSetPair.homologyδ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Limits.HasCoproducts A] [CategoryTheory.Abelian A] (P : SSetPair) (R : A) (n m : ℕ) (h : m + 1 = n := by lia) : P.homology R n ⟶ P.left.homology R m - SSetPair.instEpiHomologyπOfNatNat 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Limits.HasCoproducts A] [CategoryTheory.Abelian A] (P : SSetPair) (R : A) : CategoryTheory.Epi (P.homologyπ R 0) - SSetPair.instEpiChainComplexNatChainComplexπ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) : CategoryTheory.Epi (P.chainComplexπ R) - SSetPair.chainComplexMap 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] {P P' : SSetPair} (f : P ⟶ P') (R : C) : P.chainComplex R ⟶ P'.chainComplex R - SSetPair.chainComplexπ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) : P.right.chainComplex R ⟶ P.chainComplex R - SSetPair.homologyFunctor_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) [CategoryTheory.CategoryWithHomology C] (n : ℕ) {X✝ Y✝ : SSetPair} (f : X✝ ⟶ Y✝) : (SSetPair.homologyFunctor R n).map f = SSetPair.homologyMap f R n - SSetPair.chainComplexFunctor 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] : CategoryTheory.Functor C (CategoryTheory.Functor SSetPair (ChainComplex C ℕ)) - SSetPair.chainComplexFunctorLeft 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] : CategoryTheory.Functor C (CategoryTheory.Functor SSetPair (ChainComplex C ℕ)) - SSetPair.chainComplexFunctorRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] : CategoryTheory.Functor C (CategoryTheory.Functor SSetPair (ChainComplex C ℕ)) - SSetPair.isIso_chainComplexπ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) [P.left.HasDimensionLT 0] : CategoryTheory.IsIso (P.chainComplexπ R) - SSetPair.homology_exact₃ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Limits.HasCoproducts A] [CategoryTheory.Abelian A] (P : SSetPair) (R : A) (n m : ℕ) (h : m + 1 = n := by lia) : { X₁ := P.right.homology R n, X₂ := P.homology R n, X₃ := P.left.homology R m, f := P.homologyπ R n, g := P.homologyδ R n m h, zero := ⋯ }.Exact - SSetPair.instEpiFNatChainComplexπ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) (n : ℕ) : CategoryTheory.Epi ((P.chainComplexπ R).f n) - SSetPair.homologyMap_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] {P P' P'' : SSetPair} (f : P ⟶ P') (g : P' ⟶ P'') (R : C) [CategoryTheory.CategoryWithHomology C] (n : ℕ) : SSetPair.homologyMap (CategoryTheory.CategoryStruct.comp f g) R n = CategoryTheory.CategoryStruct.comp (SSetPair.homologyMap f R n) (SSetPair.homologyMap g R n) - SSetPair.homologyMap_comp_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] {P P' P'' : SSetPair} (f : P ⟶ P') (g : P' ⟶ P'') (R : C) [CategoryTheory.CategoryWithHomology C] (n : ℕ) {Z : C} (h : P''.homology R n ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSetPair.homologyMap (CategoryTheory.CategoryStruct.comp f g) R n) h = CategoryTheory.CategoryStruct.comp (SSetPair.homologyMap f R n) (CategoryTheory.CategoryStruct.comp (SSetPair.homologyMap g R n) h) - SSetPair.isZero_chainComplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) [CategoryTheory.IsIso P.hom] : CategoryTheory.Limits.IsZero (P.chainComplex R) - SSetPair.instEpiFunctorChainComplexNatChainComplexFunctorπ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] : CategoryTheory.Epi (SSetPair.chainComplexFunctorπ C) - SSetPair.instMonoFunctorChainComplexNatChainComplexFunctorLeftToRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] : CategoryTheory.Mono (SSetPair.chainComplexFunctorLeftToRight C) - SSetPair.instMonoChainComplexNatChainComplexMapHomSSet 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) : CategoryTheory.Mono (SSet.chainComplexMap P.hom R) - SSetPair.homology_exact₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Limits.HasCoproducts A] [CategoryTheory.Abelian A] (P : SSetPair) (R : A) (n m : ℕ) (h : m + 1 = n := by lia) : { X₁ := P.homology R n, X₂ := P.left.homology R m, X₃ := ((CategoryTheory.Functor.id SSet).obj P.right).homology R m, f := P.homologyδ R n m h, g := SSet.homologyMap P.hom R m, zero := ⋯ }.Exact - SSetPair.cokernelCoforkChainComplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) : CategoryTheory.Limits.CokernelCofork (SSet.chainComplexMap P.hom R) - SSetPair.homology_exact₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Limits.HasCoproducts A] [CategoryTheory.Abelian A] (P : SSetPair) (R : A) (n : ℕ) : { X₁ := ((CategoryTheory.Functor.id SSet).obj P.left).homology R n, X₂ := ((CategoryTheory.Functor.id SSet).obj P.right).homology R n, X₃ := P.homology R n, f := SSet.homologyMap P.hom R n, g := P.homologyπ R n, zero := ⋯ }.Exact - SSetPair.cokernelCoforkChainComplexFunctorLeftToRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] : CategoryTheory.Limits.CokernelCofork (SSetPair.chainComplexFunctorLeftToRight C) - SSetPair.instHasCokernelFunctorChainComplexNatChainComplexFunctorLeftToRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] : CategoryTheory.Limits.HasCokernel (SSetPair.chainComplexFunctorLeftToRight C) - SSetPair.instMonoFNatChainComplexMapHomSSet 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) (n : ℕ) : CategoryTheory.Mono ((SSet.chainComplexMap P.hom R).f n) - SSetPair.cokernelCoforkChainComplexX 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) (n : ℕ) : CategoryTheory.Limits.CokernelCofork ((SSet.chainComplexMap P.hom R).f n) - SSetPair.instHasCokernelFNatChainComplexMapHomSSet 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) (n : ℕ) : CategoryTheory.Limits.HasCokernel ((SSet.chainComplexMap P.hom R).f n) - SSetPair.chainComplexFunctorLeftToRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] : SSetPair.chainComplexFunctorLeft C ⟶ SSetPair.chainComplexFunctorRight C - SSetPair.chainComplexFunctorπ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] : SSetPair.chainComplexFunctorRight C ⟶ SSetPair.chainComplexFunctor C - SSetPair.instMonoFunctorChainComplexNatAppChainComplexFunctorLeftToRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) : CategoryTheory.Mono ((SSetPair.chainComplexFunctorLeftToRight C).app R) - SSetPair.instHasCokernelFunctorChainComplexNatAppChainComplexFunctorLeftToRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) : CategoryTheory.Limits.HasCokernel ((SSetPair.chainComplexFunctorLeftToRight C).app R) - SSetPair.homologyMap_hom_homologyπ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) [CategoryTheory.CategoryWithHomology C] (n : ℕ) : CategoryTheory.CategoryStruct.comp (SSet.homologyMap P.hom R n) (P.homologyπ R n) = 0 - SSetPair.homologyδ_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Limits.HasCoproducts A] [CategoryTheory.Abelian A] (P : SSetPair) (R : A) (n m : ℕ) (h : m + 1 = n := by lia) : CategoryTheory.CategoryStruct.comp (P.homologyδ R n m h) (SSet.homologyMap P.hom R m) = 0 - SSetPair.comp_homologyδ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Limits.HasCoproducts A] [CategoryTheory.Abelian A] (P : SSetPair) (R : A) (n m : ℕ) (h : m + 1 = n := by lia) : CategoryTheory.CategoryStruct.comp (P.homologyπ R n) (P.homologyδ R n m h) = 0 - SSetPair.chainComplex_condition 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) : CategoryTheory.CategoryStruct.comp (SSet.chainComplexMap P.hom R) (P.chainComplexπ R) = 0 - SSetPair.homologyMap_hom_homologyπ_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) [CategoryTheory.CategoryWithHomology C] (n : ℕ) {Z : C} (h : P.homology R n ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.homologyMap P.hom R n) (CategoryTheory.CategoryStruct.comp (P.homologyπ R n) h) = CategoryTheory.CategoryStruct.comp 0 h - SSetPair.homologyδ_comp_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Limits.HasCoproducts A] [CategoryTheory.Abelian A] (P : SSetPair) (R : A) (n m : ℕ) (h : m + 1 = n := by lia) {Z : A} (h✝ : P.right.homology R m ⟶ Z) : CategoryTheory.CategoryStruct.comp (P.homologyδ R n m h) (CategoryTheory.CategoryStruct.comp (SSet.homologyMap P.hom R m) h✝) = CategoryTheory.CategoryStruct.comp 0 h✝ - SSetPair.comp_homologyδ_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Limits.HasCoproducts A] [CategoryTheory.Abelian A] (P : SSetPair) (R : A) (n m : ℕ) (h : m + 1 = n := by lia) {Z : A} (h✝ : P.left.homology R m ⟶ Z) : CategoryTheory.CategoryStruct.comp (P.homologyπ R n) (CategoryTheory.CategoryStruct.comp (P.homologyδ R n m h) h✝) = CategoryTheory.CategoryStruct.comp 0 h✝ - SSetPair.instPreservesColimitChainComplexNatWalkingParallelPairParallelPairChainComplexMapHomSSetOfNatHomChainComplexObjIdLeftRightEvalDown 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) (n : ℕ) : CategoryTheory.Limits.PreservesColimit (CategoryTheory.Limits.parallelPair (SSet.chainComplexMap P.hom R) 0) (HomologicalComplex.eval C (ComplexShape.down ℕ) n) - SSetPair.isColimitCokernelCoforkChainComplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) : CategoryTheory.Limits.IsColimit (P.cokernelCoforkChainComplex R) - SSetPair.chainComplex_condition_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) {Z : ChainComplex C ℕ} (h : P.chainComplex R ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.chainComplexMap P.hom R) (CategoryTheory.CategoryStruct.comp (P.chainComplexπ R) h) = CategoryTheory.CategoryStruct.comp 0 h - SSetPair.instMonoChainComplexNatAppFunctorChainComplexFunctorLeftToRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) : CategoryTheory.Mono (((SSetPair.chainComplexFunctorLeftToRight C).app R).app P) - SSetPair.instHasCokernelChainComplexNatAppFunctorChainComplexFunctorLeftToRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) : CategoryTheory.Limits.HasCokernel (((SSetPair.chainComplexFunctorLeftToRight C).app R).app P) - SSetPair.chainComplex_condition_f 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) (n : ℕ) : CategoryTheory.CategoryStruct.comp ((SSet.chainComplexMap P.hom R).f n) ((P.chainComplexπ R).f n) = 0 - SSetPair.isColimitCokernelCoforkChainComplexX 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) (n : ℕ) : CategoryTheory.Limits.IsColimit (P.cokernelCoforkChainComplexX R n) - SSetPair.chainComplex_condition_f_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (P : SSetPair) (R : C) (n : ℕ) {Z : C} (h : (P.chainComplex R).X n ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.chainComplexMap P.hom R).f n) (CategoryTheory.CategoryStruct.comp ((P.chainComplexπ R).f n) h) = CategoryTheory.CategoryStruct.comp 0 h - SSetPair.instMonoFNatAppChainComplexFunctorChainComplexFunctorLeftToRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) (n : ℕ) : CategoryTheory.Mono ((((SSetPair.chainComplexFunctorLeftToRight C).app R).app P).f n) - SSetPair.instHasCokernelFNatAppChainComplexFunctorChainComplexFunctorLeftToRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) (n : ℕ) : CategoryTheory.Limits.HasCokernel ((((SSetPair.chainComplexFunctorLeftToRight C).app R).app P).f n) - SSetPair.isColimitCokernelCoforkChainComplexFunctorLeftToRight 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] : CategoryTheory.Limits.IsColimit (SSetPair.cokernelCoforkChainComplexFunctorLeftToRight C) - SSetPair.instPreservesColimitChainComplexNatWalkingParallelPairParallelPairAppFunctorChainComplexFunctorLeftToRightOfNatHomObjChainComplexFunctorLeftChainComplexFunctorRightEvalDown 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) (n : ℕ) : CategoryTheory.Limits.PreservesColimit (CategoryTheory.Limits.parallelPair (((SSetPair.chainComplexFunctorLeftToRight C).app R).app P) 0) (HomologicalComplex.eval C (ComplexShape.down ℕ) n) - SSetPair.chainComplexFunctor_condition 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] : CategoryTheory.CategoryStruct.comp (SSetPair.chainComplexFunctorLeftToRight C) (SSetPair.chainComplexFunctorπ C) = 0 - SSetPair.instPreservesColimitFunctorChainComplexNatWalkingParallelPairParallelPairAppChainComplexFunctorLeftToRightOfNatHomObjChainComplexFunctorLeftChainComplexFunctorRightEvaluation 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) : CategoryTheory.Limits.PreservesColimit (CategoryTheory.Limits.parallelPair ((SSetPair.chainComplexFunctorLeftToRight C).app R) 0) ((CategoryTheory.evaluation SSetPair (ChainComplex C ℕ)).obj P) - SSetPair.instPreservesColimitFunctorChainComplexNatWalkingParallelPairParallelPairChainComplexFunctorLeftToRightOfNatHomChainComplexFunctorLeftChainComplexFunctorRightObjEvaluation 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) : CategoryTheory.Limits.PreservesColimit (CategoryTheory.Limits.parallelPair (SSetPair.chainComplexFunctorLeftToRight C) 0) ((CategoryTheory.evaluation C (CategoryTheory.Functor SSetPair (ChainComplex C ℕ))).obj R) - SSetPair.instPreservesColimitFunctorChainComplexNatWalkingParallelPairCompParallelPairChainComplexFunctorLeftToRightOfNatHomChainComplexFunctorLeftChainComplexFunctorRightObjEvaluation 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) : CategoryTheory.Limits.PreservesColimit ((CategoryTheory.Limits.parallelPair (SSetPair.chainComplexFunctorLeftToRight C) 0).comp ((CategoryTheory.evaluation C (CategoryTheory.Functor SSetPair (ChainComplex C ℕ))).obj R)) ((CategoryTheory.evaluation SSetPair (ChainComplex C ℕ)).obj P) - SSetPair.instPreservesColimitChainComplexNatWalkingParallelPairCompFunctorParallelPairChainComplexFunctorLeftToRightOfNatHomChainComplexFunctorLeftChainComplexFunctorRightObjEvaluationEvalDown 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) (n : ℕ) : CategoryTheory.Limits.PreservesColimit ((CategoryTheory.Limits.parallelPair (SSetPair.chainComplexFunctorLeftToRight C) 0).comp (((CategoryTheory.evaluation C (CategoryTheory.Functor SSetPair (ChainComplex C ℕ))).obj R).comp ((CategoryTheory.evaluation SSetPair (ChainComplex C ℕ)).obj P))) (HomologicalComplex.eval C (ComplexShape.down ℕ) n) - SSetPair.chainComplexFunctor_condition_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] {Z : CategoryTheory.Functor C (CategoryTheory.Functor SSetPair (ChainComplex C ℕ))} (h : SSetPair.chainComplexFunctor C ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSetPair.chainComplexFunctorLeftToRight C) (CategoryTheory.CategoryStruct.comp (SSetPair.chainComplexFunctorπ C) h) = CategoryTheory.CategoryStruct.comp 0 h - SSetPair.instPreservesColimitFunctorChainComplexNatWalkingParallelPairParallelPairChainComplexFunctorLeftToRightOfNatHomChainComplexFunctorLeftChainComplexFunctorRightCompObjEvaluationEvalDown 📋 Mathlib.AlgebraicTopology.SimplicialSet.Homology.Relative
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Preadditive C] (R : C) (P : SSetPair) (n : ℕ) : CategoryTheory.Limits.PreservesColimit (CategoryTheory.Limits.parallelPair (SSetPair.chainComplexFunctorLeftToRight C) 0) (((CategoryTheory.evaluation C (CategoryTheory.Functor SSetPair (ChainComplex C ℕ))).obj R).comp (((CategoryTheory.evaluation SSetPair (ChainComplex C ℕ)).obj P).comp (HomologicalComplex.eval C (ComplexShape.down ℕ) n))) - SSet.instIsStableUnderCobaseChangeMonomorphisms 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monomorphisms
: (CategoryTheory.MorphismProperty.monomorphisms SSet).IsStableUnderCobaseChange - SSet.instIsStableUnderFilteredColimitsMonomorphisms 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monomorphisms
: CategoryTheory.MorphismProperty.IsStableUnderFilteredColimits.{u, u, u, u + 1} (CategoryTheory.MorphismProperty.monomorphisms SSet) - SSet.instIsStableUnderCoproductsMonomorphismsOfHasCoproductsType 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monomorphisms
[CategoryTheory.Limits.HasCoproducts (Type u)] : CategoryTheory.MorphismProperty.IsStableUnderCoproducts.{v', u, u + 1} (CategoryTheory.MorphismProperty.monomorphisms SSet) - CategoryTheory.ObjectProperty.monomorphisms_le_monoModSerre 📋 Mathlib.CategoryTheory.Abelian.SerreClass.MorphismProperty
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] (P : CategoryTheory.ObjectProperty C) [P.IsSerreClass] : CategoryTheory.MorphismProperty.monomorphisms C ≤ P.monoModSerre - CategoryTheory.ObjectProperty.SerreClassLocalization.inverseImage_monomorphisms 📋 Mathlib.CategoryTheory.Abelian.SerreClass.Localization
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] (L : CategoryTheory.Functor C D) (P : CategoryTheory.ObjectProperty C) [P.IsSerreClass] [L.IsLocalization P.isoModSerre] [CategoryTheory.Preadditive D] [L.Additive] : (CategoryTheory.MorphismProperty.monomorphisms D).inverseImage L = P.monoModSerre - CategoryTheory.isCardinalPure_le_monomorphisms 📋 Mathlib.CategoryTheory.Presentable.CardinalPure
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalAccessibleCategory C κ] : CategoryTheory.isCardinalPure C κ ≤ CategoryTheory.MorphismProperty.monomorphisms C
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