OAI/Algebra/Finitistic/Rectification/TotalInterchange.lean
12 declarations, 0 contain sorry, 0 declared as axioms
- abbrev
OAI.LittleFinitistic.RectificationTotal.mapComplexline 12 - def
OAI.LittleFinitistic.RectificationTotal.coneInterchangeline 17Source documentation
The canonical additive comparison for one cone.
def coneInterchange (q : A ⟶ B) : (mapComplex F).obj (mappingCone q) ≅ mappingCone ((mapComplex F).map q) := …Mentions: OAI.LittleFinitistic.RectificationTotal.mapComplex
- theorem
OAI.LittleFinitistic.RectificationTotal.coneInterchange_inv_inlline 22 - theorem
OAI.LittleFinitistic.RectificationTotal.coneInterchange_inv_inrline 28 - theorem
OAI.LittleFinitistic.RectificationTotal.coneInterchange_hom_inlline 34 - theorem
OAI.LittleFinitistic.RectificationTotal.coneInterchange_hom_inrline 41 - def
OAI.LittleFinitistic.RectificationTotal.mapNullHomotopyline 52Source documentation
Apply the functor to the supplied null-homotopy, transporting only functorial composition and zero equalities.
def mapNullHomotopy : Homotopy ((mapComplex F).map q ≫ (mapComplex F).map p) 0 := …
Mentions: OAI.LittleFinitistic.RectificationTotal.mapComplex
- theorem
OAI.LittleFinitistic.RectificationTotal.mapNullHomotopy_homline 56 - theorem
OAI.LittleFinitistic.RectificationTotal.rectifyingMap_interchange_invline 61Source documentation
Mapping the rectifying map agrees with rectifying the mapped data.
theorem rectifyingMap_interchange_inv : (coneInterchange F q).inv ≫ (mapComplex F).map (rectifyingMap p q h) = rectifyingMap ((mapComplex F).map p) ((mapComplex F).map q) (mapNullHomotopy F p q h) := by …Mentions: OAI.LittleFinitistic.RectificationTotal.coneInterchange, OAI.LittleFinitistic.RectificationTotal.mapComplex, OAI.LittleFinitistic.RectificationTotal.rectifyingMap, OAI.LittleFinitistic.RectificationTotal.mapNullHomotopy
- theorem
OAI.LittleFinitistic.RectificationTotal.rectifyingMap_interchangeline 76 - def
OAI.LittleFinitistic.RectificationTotal.totalInterchangeline 84Source documentation
Arbitrary additive functors commute with the actual iterated-cone total.
def totalInterchange : (mapComplex F).obj (total p q h) ≅ total ((mapComplex F).map p) ((mapComplex F).map q) (mapNullHomotopy F p q h) := …Mentions: OAI.LittleFinitistic.RectificationTotal.mapComplex, OAI.LittleFinitistic.RectificationTotal.total, OAI.LittleFinitistic.RectificationTotal.mapNullHomotopy
- theorem
OAI.LittleFinitistic.RectificationTotal.inclusion_totalInterchangeline 93Source documentation
The original zero-column inclusion is carried to the original inclusion.
theorem inclusion_totalInterchange : (mapComplex F).map (inclusion p q h) ≫ (totalInterchange F p q h).hom = inclusion ((mapComplex F).map p) ((mapComplex F).map q) (mapNullHomotopy F p q h) := by …Mentions: OAI.LittleFinitistic.RectificationTotal.mapComplex, OAI.LittleFinitistic.RectificationTotal.inclusion, OAI.LittleFinitistic.RectificationTotal.totalInterchange, OAI.LittleFinitistic.RectificationTotal.mapNullHomotopy