Documentation

Mathlib.AlgebraicTopology.Reedy.Basic

Reedy categories #

In this file, we introduce the definition of a Reedy structure on a category C equipped with two classes of morphisms W₁ and W₂ (these are sometimes denoted C₋ and C₊ in the literature).

TODO #

References #

A Reedy structure on a category C equipped with two multiplicative classes of morphisms W₁ and W₂ consists of the data of a degree map for objects deg : C → α, where α is a well ordered type. The first two axioms lt₁ and lt₂ express the behaviour of the degree with respect to morphisms in W₁ (resp. W₂) that are not identities, and the last axiom says that any morphism can be factored in a unique way as a morphism in W₁ followed by a morphism in W₂.

Instances For

    The opposite of a Reedy structure.

    Equations
    Instances For
      theorem HomotopicalAlgebra.ReedyStructure.le₁ {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W₁ W₂ : CategoryTheory.MorphismProperty C} [W₁.IsMultiplicative] [W₂.IsMultiplicative] {α : Type u_2} [LinearOrder α] [OrderBot α] [SuccOrder α] [WellFoundedLT α] (r : ReedyStructure W₁ W₂ α) {X Y : C} (f : X Y) (hf : W₁ f) :
      r.deg Y r.deg X
      theorem HomotopicalAlgebra.ReedyStructure.le₂ {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W₁ W₂ : CategoryTheory.MorphismProperty C} [W₁.IsMultiplicative] [W₂.IsMultiplicative] {α : Type u_2} [LinearOrder α] [OrderBot α] [SuccOrder α] [WellFoundedLT α] (r : ReedyStructure W₁ W₂ α) {X Y : C} (f : X Y) (hf : W₂ f) :
      r.deg X r.deg Y
      noncomputable def HomotopicalAlgebra.ReedyStructure.mapFactorizationData {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W₁ W₂ : CategoryTheory.MorphismProperty C} [W₁.IsMultiplicative] [W₂.IsMultiplicative] {α : Type u_2} [LinearOrder α] [OrderBot α] [SuccOrder α] [WellFoundedLT α] (r : ReedyStructure W₁ W₂ α) {X Y : C} (f : X Y) :

      The Reedy factorization of a morphism f : X ⟶ Y as a morphism in W₁ followed by a morphism in W₂.

      Equations
      Instances For
        theorem HomotopicalAlgebra.ReedyStructure.unique_obj {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W₁ W₂ : CategoryTheory.MorphismProperty C} [W₁.IsMultiplicative] [W₂.IsMultiplicative] {α : Type u_2} [LinearOrder α] [OrderBot α] [SuccOrder α] [WellFoundedLT α] (r : ReedyStructure W₁ W₂ α) {X Y : C} {f : X Y} (fac fac' : W₁.MapFactorizationData W₂ f) :
        fac.Z = fac'.Z
        noncomputable def HomotopicalAlgebra.ReedyStructure.degHom {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W₁ W₂ : CategoryTheory.MorphismProperty C} [W₁.IsMultiplicative] [W₂.IsMultiplicative] {α : Type u_2} [LinearOrder α] [OrderBot α] [SuccOrder α] [WellFoundedLT α] (r : ReedyStructure W₁ W₂ α) {X Y : C} (f : X Y) :
        α

        The degree of a morphisms for a Reedy structure. It is defined as the degree of the intermediate object in the Reedy factorization, but it is also the smallest degree of an intermediate object in a factorization, see the lemma degHom_le.

        Equations
        Instances For
          theorem HomotopicalAlgebra.ReedyStructure.degHom_eq {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W₁ W₂ : CategoryTheory.MorphismProperty C} [W₁.IsMultiplicative] [W₂.IsMultiplicative] {α : Type u_2} [LinearOrder α] [OrderBot α] [SuccOrder α] [WellFoundedLT α] (r : ReedyStructure W₁ W₂ α) {X Y : C} {f : X Y} (h : W₁.MapFactorizationData W₂ f) :
          r.degHom f = r.deg h.Z
          theorem HomotopicalAlgebra.ReedyStructure.exists_fac {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W₁ W₂ : CategoryTheory.MorphismProperty C} [W₁.IsMultiplicative] [W₂.IsMultiplicative] {α : Type u_2} [LinearOrder α] [OrderBot α] [SuccOrder α] [WellFoundedLT α] (r : ReedyStructure W₁ W₂ α) {X Y : C} (f : X Y) :
          ∃ (Z : C) (a : X Z) (b : Z Y), W₁ a W₂ b CategoryTheory.CategoryStruct.comp a b = f r.degHom f = r.deg Z