The Dold-Kan equivalence for additive categories.
This file defines Preadditive.DoldKan.equivalence
which is the equivalence
of categories Karoubi (SimplicialObject C) ≌ Karoubi (ChainComplex C ℕ)
.
(See Equivalence.lean
for the general strategy of proof of the Dold-Kan equivalence.)
The functor Karoubi (SimplicialObject C) ⥤ Karoubi (ChainComplex C ℕ)
of
the Dold-Kan equivalence for additive categories.
Instances For
def
CategoryTheory.Preadditive.DoldKan.Γ
{C : Type u_1}
[Category.{u_2, u_1} C]
[Preadditive C]
[Limits.HasFiniteCoproducts C]
:
The inverse functor Karoubi (ChainComplex C ℕ) ⥤ Karoubi (SimplicialObject C)
of
the Dold-Kan equivalence for additive categories.
Instances For
def
CategoryTheory.Preadditive.DoldKan.equivalence
{C : Type u_1}
[Category.{u_2, u_1} C]
[Preadditive C]
[Limits.HasFiniteCoproducts C]
:
The Dold-Kan equivalence Karoubi (SimplicialObject C) ≌ Karoubi (ChainComplex C ℕ)
for additive categories.
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem
CategoryTheory.Preadditive.DoldKan.equivalence_functor
{C : Type u_1}
[Category.{u_2, u_1} C]
[Preadditive C]
[Limits.HasFiniteCoproducts C]
:
equivalence.functor = N
@[simp]
theorem
CategoryTheory.Preadditive.DoldKan.equivalence_unitIso
{C : Type u_1}
[Category.{u_2, u_1} C]
[Preadditive C]
[Limits.HasFiniteCoproducts C]
:
@[simp]
theorem
CategoryTheory.Preadditive.DoldKan.equivalence_inverse
{C : Type u_1}
[Category.{u_2, u_1} C]
[Preadditive C]
[Limits.HasFiniteCoproducts C]
:
equivalence.inverse = Γ
@[simp]
theorem
CategoryTheory.Preadditive.DoldKan.equivalence_counitIso
{C : Type u_1}
[Category.{u_2, u_1} C]
[Preadditive C]
[Limits.HasFiniteCoproducts C]
:
equivalence.counitIso = AlgebraicTopology.DoldKan.N₂Γ₂