The 3-by-3 lemma for regular Goursat categories (Q1770286)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The 3-by-3 lemma for regular Goursat categories |
scientific article; zbMATH DE number 2153099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 3-by-3 lemma for regular Goursat categories |
scientific article; zbMATH DE number 2153099 |
Statements
The 3-by-3 lemma for regular Goursat categories (English)
0 references
5 April 2005
0 references
A suitable version of the well-known 3-by-3 lemma for abelian categories can be stated, in more general contexts, by replacing short exact sequences with exact forks (defined in terms of kernel pairs and coequalizers). This note is devoted to give a short proof of that lemma in the setting of a regular Goursat category; see [\textit{A. Carboni}, \textit{G. M. Kelly} and \textit{M. C. Pedicchio}, Appl. Categ. Struct. 1, No. 4, 385--421 (1993; Zbl 0799.18002)].
0 references
calculus of relations
0 references
Mal'tsev category
0 references
0.8356033563613892
0 references
0.8295537233352661
0 references
0.7802211046218872
0 references
0.7722501754760742
0 references
