Documentation

Mathlib.Algebra.Homology.HomologySequence

The homology sequence #

If 0 ⟶ X₁ ⟶ X₂ ⟶ X₃ ⟶ 0 is a short exact sequence in a category of complexes HomologicalComplex C c in an abelian category (i.e. S is a short complex in that category and satisfies hS : S.ShortExact), then whenever i and j are degrees such that hij : c.Rel i j, then there is a long exact sequence : ... ⟶ S.X₁.homology i ⟶ S.X₂.homology i ⟶ S.X₃.homology i ⟶ S.X₁.homology j ⟶ .... The connecting homomorphism S.X₃.homology i ⟶ S.X₁.homology j is hS.δ i j hij, and the exactness is asserted as lemmas hS.homology_exact₁, hS.homology_exact₂ and hS.homology_exact₃.

The proof is based on the snake lemma, similarly as it was originally done in the Liquid Tensor Experiment.

References #

The natural transformation K.opcyclesToCycles i j : K.opcycles i ⟶ K.cycles j for all K : HomologicalComplex C c.

Equations
Instances For

    The diagram K.homology i ⟶ K.opcycles i ⟶ K.cycles j ⟶ K.homology j.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      The diagram K.homology i ⟶ K.opcycles i ⟶ K.cycles j ⟶ K.homology j is exact when c.Rel i j.

      The functor HomologicalComplex C c ⥤ ComposableArrows C 3 that maps K to the diagram K.homology i ⟶ K.opcycles i ⟶ K.cycles j ⟶ K.homology j.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        If X₁ ⟶ X₂ ⟶ X₃ ⟶ 0 is an exact sequence of homological complexes, then X₁.opcycles i ⟶ X₂.opcycles i ⟶ X₃.opcycles i ⟶ 0 is exact. This lemma states the exactness at X₂.opcycles i, while the fact that X₂.opcycles i ⟶ X₃.opcycles i is an epi is an instance.

        If 0 ⟶ X₁ ⟶ X₂ ⟶ X₃ is an exact sequence of homological complex, then 0 ⟶ X₁.cycles i ⟶ X₂.cycles i ⟶ X₃.cycles i is exact. This lemma states the exactness at X₂.cycles i, while the fact that X₁.cycles i ⟶ X₂.cycles i is a mono is an instance.

        Given a short exact short complex S : HomologicalComplex C c, and degrees i and j such that c.Rel i j, this is the snake diagram whose four lines are respectively obtained by applying the functors homologyFunctor C c i, opcyclesFunctor C c i, cyclesFunctor C c j, homologyFunctor C c j to S. Applying the snake lemma to this gives the homology sequence of S.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For

          The connecting homoomorphism S.X₃.homology i ⟶ S.X₁.homology j for a short exact short complex S.

          Equations
          Instances For