Loogle!
Result
Found 76 declarations mentioning CategoryTheory.SimplicialObject.Splitting.IndexSet.
- CategoryTheory.SimplicialObject.Splitting.IndexSet 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
(Δ : SimplexCategoryᵒᵖ) : Type - CategoryTheory.SimplicialObject.Splitting.IndexSet.id 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
(Δ : SimplexCategoryᵒᵖ) : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ - CategoryTheory.SimplicialObject.Splitting.IndexSet.EqId 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : Prop - CategoryTheory.SimplicialObject.Splitting.IndexSet.instFintype 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} : Fintype (CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) - CategoryTheory.SimplicialObject.Splitting.IndexSet.instInhabited 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
(Δ : SimplexCategoryᵒᵖ) : Inhabited (CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) - CategoryTheory.SimplicialObject.Splitting.summand 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} (N : ℕ → C) (Δ : SimplexCategoryᵒᵖ) (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : C - CategoryTheory.SimplicialObject.Splitting.IndexSet.pull 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) {Δ' : SimplexCategoryᵒᵖ} (θ : Δ ⟶ Δ') : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ' - CategoryTheory.SimplicialObject.Splitting.IndexSet.mk 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ Δ' : SimplexCategory} (f : Δ ⟶ Δ') [CategoryTheory.Epi f] : CategoryTheory.SimplicialObject.Splitting.IndexSet (Opposite.op Δ) - CategoryTheory.SimplicialObject.Splitting.cofan 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) (Δ : SimplexCategoryᵒᵖ) : CategoryTheory.Limits.Cofan (CategoryTheory.SimplicialObject.Splitting.summand s.N Δ) - CategoryTheory.SimplicialObject.Splitting.IndexSet.epiComp 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ₁ Δ₂ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ₁) (p : Δ₁ ⟶ Δ₂) [CategoryTheory.Epi p.unop] : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ₂ - CategoryTheory.SimplicialObject.Splitting.isColimit 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) (Δ : SimplexCategoryᵒᵖ) : CategoryTheory.Limits.IsColimit (s.cofan Δ) - CategoryTheory.SimplicialObject.Splitting.cofan' 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (N : ℕ → C) (X : CategoryTheory.SimplicialObject C) (φ : (n : ℕ) → N n ⟶ X.obj (Opposite.op { len := n })) (Δ : SimplexCategoryᵒᵖ) : CategoryTheory.Limits.Cofan (CategoryTheory.SimplicialObject.Splitting.summand N Δ) - CategoryTheory.SimplicialObject.Splitting.isColimit' 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (self : X.Splitting) (Δ : SimplexCategoryᵒᵖ) : CategoryTheory.Limits.IsColimit (CategoryTheory.SimplicialObject.Splitting.cofan' self.N X self.ι Δ) - CategoryTheory.SimplicialObject.Splitting.IndexSet.eqId_iff_eq 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : A.EqId ↔ A.fst = Δ - CategoryTheory.SimplicialObject.Splitting.IndexSet.instEpiSimplexCategoryE 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : CategoryTheory.Epi A.e - CategoryTheory.SimplicialObject.Splitting.IndexSet.e 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : Opposite.unop Δ ⟶ Opposite.unop A.fst - CategoryTheory.SimplicialObject.Splitting.IndexSet.eqId_iff_len_eq 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : A.EqId ↔ (Opposite.unop A.fst).len = (Opposite.unop Δ).len - CategoryTheory.SimplicialObject.Splitting.IndexSet.eqId_iff_len_le 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : A.EqId ↔ (Opposite.unop Δ).len ≤ (Opposite.unop A.fst).len - CategoryTheory.SimplicialObject.Splitting.mk 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (N : ℕ → C) (ι : (n : ℕ) → N n ⟶ X.obj (Opposite.op { len := n })) (isColimit' : (Δ : SimplexCategoryᵒᵖ) → CategoryTheory.Limits.IsColimit (CategoryTheory.SimplicialObject.Splitting.cofan' N X ι Δ)) : X.Splitting - CategoryTheory.SimplicialObject.Splitting.IndexSet.eqId_iff_mono 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : A.EqId ↔ CategoryTheory.Mono A.e - CategoryTheory.SimplicialObject.Splitting.desc 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) {Z : C} (Δ : SimplexCategoryᵒᵖ) (F : (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) → s.N (Opposite.unop A.fst).len ⟶ Z) : X.obj Δ ⟶ Z - CategoryTheory.SimplicialObject.Splitting.cofan_inj_id 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) (n : ℕ) : (s.cofan (Opposite.op { len := n })).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n })) = s.ι n - CategoryTheory.SimplicialObject.Splitting.IndexSet.epiComp_fst 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ₁ Δ₂ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ₁) (p : Δ₁ ⟶ Δ₂) [CategoryTheory.Epi p.unop] : (A.epiComp p).fst = A.fst - CategoryTheory.SimplicialObject.Splitting.ι_desc 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) {Z : C} (Δ : SimplexCategoryᵒᵖ) (F : (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) → s.N (Opposite.unop A.fst).len ⟶ Z) (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : CategoryTheory.CategoryStruct.comp ((s.cofan Δ).inj A) (s.desc Δ F) = F A - CategoryTheory.SimplicialObject.Split.natTransCofanInj 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] {Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : CategoryTheory.SimplicialObject.Split.evalN C (Opposite.unop A.fst).len ⟶ (CategoryTheory.SimplicialObject.Split.forget C).comp ((CategoryTheory.evaluation SimplexCategoryᵒᵖ C).obj Δ) - CategoryTheory.SimplicialObject.Splitting.cofan_inj_epi_naturality 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) {Δ₁ Δ₂ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ₁) (p : Δ₁ ⟶ Δ₂) [CategoryTheory.Epi p.unop] : CategoryTheory.CategoryStruct.comp ((s.cofan Δ₁).inj A) (X.map p) = (s.cofan Δ₂).inj (A.epiComp p) - CategoryTheory.SimplicialObject.Splitting.hom_ext' 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) {Z : C} {Δ : SimplexCategoryᵒᵖ} (f g : X.obj Δ ⟶ Z) (h : ∀ (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ), CategoryTheory.CategoryStruct.comp ((s.cofan Δ).inj A) f = CategoryTheory.CategoryStruct.comp ((s.cofan Δ).inj A) g) : f = g - CategoryTheory.SimplicialObject.Splitting.ι_desc_assoc 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) {Z : C} (Δ : SimplexCategoryᵒᵖ) (F : (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) → s.N (Opposite.unop A.fst).len ⟶ Z) (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) {Z✝ : C} (h : Z ⟶ Z✝) : CategoryTheory.CategoryStruct.comp ((s.cofan Δ).inj A) (CategoryTheory.CategoryStruct.comp (s.desc Δ F) h) = CategoryTheory.CategoryStruct.comp (F A) h - CategoryTheory.SimplicialObject.Split.natTransCofanInj_app 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] {Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) (S : CategoryTheory.SimplicialObject.Split C) : (CategoryTheory.SimplicialObject.Split.natTransCofanInj C A).app S = (S.s.cofan Δ).inj A - CategoryTheory.SimplicialObject.Splitting.cofan_inj_epi_naturality_assoc 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) {Δ₁ Δ₂ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ₁) (p : Δ₁ ⟶ Δ₂) [CategoryTheory.Epi p.unop] {Z : C} (h : X.obj Δ₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp ((s.cofan Δ₁).inj A) (CategoryTheory.CategoryStruct.comp (X.map p) h) = CategoryTheory.CategoryStruct.comp ((s.cofan Δ₂).inj (A.epiComp p)) h - CategoryTheory.SimplicialObject.Splitting.IndexSet.ext 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A₁ A₂ : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) (h₁ : A₁.fst = A₂.fst) (h₂ : CategoryTheory.CategoryStruct.comp A₁.e (CategoryTheory.eqToHom ⋯) = A₂.e) : A₁ = A₂ - CategoryTheory.SimplicialObject.Splitting.IndexSet.epiComp_snd_coe 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ₁ Δ₂ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ₁) (p : Δ₁ ⟶ Δ₂) [CategoryTheory.Epi p.unop] : ↑(A.epiComp p).snd = CategoryTheory.CategoryStruct.comp p.unop A.e - CategoryTheory.SimplicialObject.Splitting.cofan_inj_eq 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) {Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : (s.cofan Δ).inj A = CategoryTheory.CategoryStruct.comp (s.ι (Opposite.unop A.fst).len) (X.map A.e.op) - CategoryTheory.SimplicialObject.Split.cofan_inj_naturality_symm 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {S₁ S₂ : CategoryTheory.SimplicialObject.Split C} (Φ : S₁ ⟶ S₂) {Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : CategoryTheory.CategoryStruct.comp ((S₁.s.cofan Δ).inj A) (Φ.F.app Δ) = CategoryTheory.CategoryStruct.comp (Φ.f (Opposite.unop A.fst).len) ((S₂.s.cofan Δ).inj A) - CategoryTheory.SimplicialObject.Splitting.cofan_inj_comp_app 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y : CategoryTheory.SimplicialObject C} (s : X.Splitting) (f : X ⟶ Y) {Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : CategoryTheory.CategoryStruct.comp ((s.cofan Δ).inj A) (f.app Δ) = CategoryTheory.CategoryStruct.comp (s.φ f (Opposite.unop A.fst).len) (Y.map A.e.op) - CategoryTheory.SimplicialObject.Splitting.IndexSet.ext' 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : A = ⟨A.fst, ⟨A.e, ⋯⟩⟩ - CategoryTheory.SimplicialObject.Splitting.cofan_inj_eq_assoc 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) {Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) {Z : C} (h : (s.cofan Δ).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((s.cofan Δ).inj A) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (s.ι (Opposite.unop A.fst).len) (X.map A.e.op)) h - CategoryTheory.SimplicialObject.Split.cofan_inj_naturality_symm_assoc 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {S₁ S₂ : CategoryTheory.SimplicialObject.Split C} (Φ : S₁ ⟶ S₂) {Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) {Z : C} (h : S₂.X.obj Δ ⟶ Z) : CategoryTheory.CategoryStruct.comp ((S₁.s.cofan Δ).inj A) (CategoryTheory.CategoryStruct.comp (Φ.F.app Δ) h) = CategoryTheory.CategoryStruct.comp (Φ.f (Opposite.unop A.fst).len) (CategoryTheory.CategoryStruct.comp ((S₂.s.cofan Δ).inj A) h) - CategoryTheory.SimplicialObject.Splitting.IndexSet.fac_pull 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) {Δ' : SimplexCategoryᵒᵖ} (θ : Δ ⟶ Δ') : CategoryTheory.CategoryStruct.comp (A.pull θ).e (CategoryTheory.Limits.image.ι (CategoryTheory.CategoryStruct.comp θ.unop A.e)) = CategoryTheory.CategoryStruct.comp θ.unop A.e - CategoryTheory.SimplicialObject.Splitting.cofan_inj_comp_app_assoc 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y : CategoryTheory.SimplicialObject C} (s : X.Splitting) (f : X ⟶ Y) {Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) {Z : C} (h : Y.obj Δ ⟶ Z) : CategoryTheory.CategoryStruct.comp ((s.cofan Δ).inj A) (CategoryTheory.CategoryStruct.comp (f.app Δ) h) = CategoryTheory.CategoryStruct.comp (s.φ f (Opposite.unop A.fst).len) (CategoryTheory.CategoryStruct.comp (Y.map A.e.op) h) - CategoryTheory.SimplicialObject.Splitting.IndexSet.fac_pull_assoc 📋 Mathlib.AlgebraicTopology.SimplicialObject.Split
{Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) {Δ' : SimplexCategoryᵒᵖ} (θ : Δ ⟶ Δ') {Z : SimplexCategory} (h : Opposite.unop A.fst ⟶ Z) : CategoryTheory.CategoryStruct.comp (A.pull θ).e (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.image.ι (CategoryTheory.CategoryStruct.comp θ.unop A.e)) h) = CategoryTheory.CategoryStruct.comp θ.unop (CategoryTheory.CategoryStruct.comp A.e h) - AlgebraicTopology.DoldKan.Γ₀.Obj.summand 📋 Mathlib.AlgebraicTopology.DoldKan.FunctorGamma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (K : ChainComplex C ℕ) (Δ : SimplexCategoryᵒᵖ) (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : C - 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.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.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) - CategoryTheory.SimplicialObject.Splitting.πSummand 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) [CategoryTheory.Limits.HasZeroMorphisms C] {Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : X.obj Δ ⟶ s.N (Opposite.unop A.fst).len - CategoryTheory.SimplicialObject.Splitting.cofan_inj_πSummand_eq_id 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) [CategoryTheory.Limits.HasZeroMorphisms C] {Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) : CategoryTheory.CategoryStruct.comp ((s.cofan Δ).inj A) (s.πSummand A) = CategoryTheory.CategoryStruct.id (CategoryTheory.SimplicialObject.Splitting.summand s.N Δ A) - CategoryTheory.SimplicialObject.Splitting.cofan_inj_πSummand_eq_id_assoc 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) [CategoryTheory.Limits.HasZeroMorphisms C] {Δ : SimplexCategoryᵒᵖ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) {Z : C} (h : s.N (Opposite.unop A.fst).len ⟶ Z) : CategoryTheory.CategoryStruct.comp ((s.cofan Δ).inj A) (CategoryTheory.CategoryStruct.comp (s.πSummand A) h) = h - CategoryTheory.SimplicialObject.Splitting.decomposition_id 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) [CategoryTheory.Preadditive C] (Δ : SimplexCategoryᵒᵖ) : CategoryTheory.CategoryStruct.id (X.obj Δ) = ∑ A, CategoryTheory.CategoryStruct.comp (s.πSummand A) ((s.cofan Δ).inj A) - CategoryTheory.SimplicialObject.Splitting.cofan_inj_πSummand_eq_zero 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) [CategoryTheory.Limits.HasZeroMorphisms C] {Δ : SimplexCategoryᵒᵖ} (A B : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) (h : B ≠ A) : CategoryTheory.CategoryStruct.comp ((s.cofan Δ).inj A) (s.πSummand B) = 0 - CategoryTheory.SimplicialObject.Splitting.cofan_inj_comp_PInfty_eq_zero 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) {n : ℕ} (A : CategoryTheory.SimplicialObject.Splitting.IndexSet (Opposite.op { len := n })) (hA : ¬A.EqId) : CategoryTheory.CategoryStruct.comp ((s.cofan (Opposite.op { len := n })).inj A) (AlgebraicTopology.DoldKan.PInfty.f n) = 0 - CategoryTheory.SimplicialObject.Splitting.πSummand_comp_cofan_inj_id_comp_PInfty_eq_PInfty 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) [CategoryTheory.Preadditive C] (n : ℕ) : CategoryTheory.CategoryStruct.comp (s.πSummand (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n }))) (CategoryTheory.CategoryStruct.comp ((s.cofan (Opposite.op { len := n })).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n }))) (AlgebraicTopology.DoldKan.PInfty.f n)) = AlgebraicTopology.DoldKan.PInfty.f n - CategoryTheory.SimplicialObject.Splitting.cofan_inj_πSummand_eq_zero_assoc 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) [CategoryTheory.Limits.HasZeroMorphisms C] {Δ : SimplexCategoryᵒᵖ} (A B : CategoryTheory.SimplicialObject.Splitting.IndexSet Δ) (h : B ≠ A) {Z : C} (h✝ : s.N (Opposite.unop B.fst).len ⟶ Z) : CategoryTheory.CategoryStruct.comp ((s.cofan Δ).inj A) (CategoryTheory.CategoryStruct.comp (s.πSummand B) h✝) = CategoryTheory.CategoryStruct.comp 0 h✝ - CategoryTheory.SimplicialObject.Splitting.πSummand_comp_cofan_inj_id_comp_PInfty_eq_PInfty_assoc 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) [CategoryTheory.Preadditive C] (n : ℕ) {Z : C} (h : (AlgebraicTopology.AlternatingFaceMapComplex.obj X).X n ⟶ Z) : CategoryTheory.CategoryStruct.comp (s.πSummand (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n }))) (CategoryTheory.CategoryStruct.comp ((s.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.PInfty.f n) h - CategoryTheory.SimplicialObject.Splitting.ιSummand_comp_d_comp_πSummand_eq_zero 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) [CategoryTheory.Preadditive C] (j k : ℕ) (A : CategoryTheory.SimplicialObject.Splitting.IndexSet (Opposite.op { len := j })) (hA : ¬A.EqId) : CategoryTheory.CategoryStruct.comp ((s.cofan (Opposite.op { len := j })).inj A) (CategoryTheory.CategoryStruct.comp ((AlgebraicTopology.AlternatingFaceMapComplex.obj X).d j k) (s.πSummand (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := k })))) = 0 - CategoryTheory.SimplicialObject.Splitting.toKaroubiNondegComplexIsoN₁_hom_f_f 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : CategoryTheory.SimplicialObject C} (s : X.Splitting) [CategoryTheory.Preadditive C] (n : ℕ) : s.toKaroubiNondegComplexIsoN₁.hom.f.f n = CategoryTheory.CategoryStruct.comp ((s.cofan (Opposite.op { len := n })).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n }))) (AlgebraicTopology.DoldKan.PInfty.f n) - CategoryTheory.SimplicialObject.Split.toKaroubiNondegComplexFunctorIsoN₁_hom_app_f_f 📋 Mathlib.AlgebraicTopology.DoldKan.SplitSimplicialObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (X : CategoryTheory.SimplicialObject.Split C) (n : ℕ) : (CategoryTheory.SimplicialObject.Split.toKaroubiNondegComplexFunctorIsoN₁.hom.app X).f.f n = CategoryTheory.CategoryStruct.comp ((X.s.cofan (Opposite.op { len := n })).inj (CategoryTheory.SimplicialObject.Splitting.IndexSet.id (Opposite.op { len := n }))) (AlgebraicTopology.DoldKan.PInfty.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] (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.Γ₂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) - 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)
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