Documentation

Mathlib.AlgebraicTopology.SimplicialSet.Homotopy

Simplicial homotopies #

In this file, we define the notion of homotopy (SSet.Homotopy) between morphisms f : X ⟶ Y and g : X ⟶ Y of simplicial sets: it involves a morphism X ⊗ Δ[1] ⟶ Y inducing both f and g. (This definition is a particular case of SSet.RelativeMorphism.Homotopy that is defined in the file Mathlib/AlgebraicTopology/SimplicialSet/RelativeMorphism.lean). We show that from H : SSet.Homotopy f g, we can obtain a combinatorial homotopy SimplicialObject.Homotopy f g (where the data involve a family of maps X _⦋n⦌ → Y _⦋n + 1⦌ for all n : ℕ and i : Fin (n + 1).)

Morphisms relatively to the subcomplexes of X and Y identify to morphisms X ⟶ Y.

Instances For
    def SSet.Homotopy {X Y : SSet} (f g : X Y) :

    The type of homotopies between morphisms X ⟶ Y of simplicial sets. The data consists of a morphism h : X ⊗ Δ[1] ⟶ Y which induces both f and g, see the lemmas SSet.Homotopy.h₀ and SSet.Homotopy.h₁.

    Instances For

      If H : Homotopy f g is a homotopy between morphisms of simplicial sets f : X ⟶ Y and g : X ⟶ Y (i.e. H.h is a morphism X ⊗ Δ[1] ⟶ Y inducing f and g), then this is the corresponding (combinatorial) homotopy of morphisms of simplicial objects between f and g.

      Instances For