How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Abelian Categories
1 · Prerequisites
- Adjunctions Units and Counits
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits and Colimits
- Metric Spaces
- Modules over a Principal Ideal Domain and the Canonical Forms
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Preadditive and Additive Categories and Biproducts
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Sequences and Limits
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Subspaces, Products, and Quotients
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Universal Properties, Representables and the Yoneda Lemma
2 · Summary
This page builds the image and coimage of a morphism before it ever says that the two agree. That ordering is the point: the canonical map is constructed first, and only then made invertible in the definition of an abelian category.
The page then develops the standard structural consequences. The basic ones are balancedness, normality of monomorphisms and epimorphisms, epi-mono factorization, pullbacks of epimorphisms, the quotient and isomorphism theorems, and the exact-functor criteria. It also records Freyd's alternative axiomatisation, but keeps Freyd-Mitchell as a non-load-bearing remark rather than a proof device for later pages.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Normal monomorphisms and conormal epimorphisms
Definition
Let be a monomorphism and let be an epimorphism (Monomorphism and epimorphism by left and right cancellation) in a category with zero morphisms and the relevant kernels or cokernels (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).
The monomorphism is normal when it is a kernel of some morphism out of . Dually, the epimorphism is conormal when it is a cokernel of some morphism into .
So a normal monomorphism is not merely left-cancellable: it is the inclusion of the part of the codomain killed by a specified morphism. A conormal epimorphism is the dual quotient map.
The kernel of a monomorphism is zero and the cokernel of an epimorphism is zero
Statement
Let be a category with a zero object and the needed kernels and cokernels. If is monic and is a kernel of , then is a zero object and is the zero morphism into .
Dually, if is epic and is a cokernel of , then is a zero object and is the zero morphism out of .
Facts & Assumptions
Given: A zero object , a monomorphism with kernel , and an epimorphism with cokernel .
A zero object is both initial and terminal, so there are unique morphisms and for every object (Initial object, terminal object, and zero object).
Monomorphisms are left-cancellable and epimorphisms are right-cancellable (Monomorphism and epimorphism by left and right cancellation).
A kernel of is a morphism with through which every morphism with factors uniquely; a cokernel is dual (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).
Proof
If satisfies , then also , so [L2] gives . Therefore the unique map from [L1] has the kernel universal property for , because every morphism killed by factors uniquely through .
Kernels are unique up to a unique compatible isomorphism, so the displayed kernel is isomorphic to the zero morphism from step 1.1. Hence is a zero object and is the zero map into . The cokernel claim is the formal dual of the same argument with right cancellation in [L2].
The cokernel of the zero map out of the zero object is the target, and dually for kernels
Statement
Let be a zero object in a category with zero morphisms and kernels and cokernels. For every object , the identity is a cokernel of the zero morphism . Dually, is a kernel of the zero morphism .
So and .
Facts & Assumptions
Given: A zero object and an object .
There is a unique morphism and a unique morphism (Initial object, terminal object, and zero object).
A cokernel of is a morphism with through which every morphism annihilating factors uniquely, and a kernel is dual (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).
Proof
Let be the unique map from [L1]. Since every composite equals the unique map , every morphism annihilates . Each such factors uniquely through , namely as . Therefore is a cokernel of .
The dual argument with the unique map shows that is also a kernel of . So both displayed identifications hold up to the unique compatible isomorphism of kernels and cokernels.
Image and coimage in a category with kernels and cokernels
Definition
Let be a morphism in a category with kernels and cokernels (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).
The image of is the kernel of a cokernel of :
The coimage of is the cokernel of a kernel of :
This page uses the object notation and . Their defining arrows are the corresponding kernel and cokernel maps.
A morphism factors uniquely through its coimage
Statement
Let be a morphism in a category with kernels and cokernels. If is a kernel of and is a cokernel of , then there exists a unique morphism with
Facts & Assumptions
Given: A morphism , a kernel of , and a cokernel of .
The coimage of is the cokernel of a kernel of (Image and coimage in a category with kernels and cokernels).
Proof
Because is a kernel of , one has .
The morphism is a cokernel of , so step 1.1 gives a unique with . That is exactly the claimed factorization through the coimage.
A morphism factors uniquely through its image
Statement
Let be a morphism in a category with kernels and cokernels. If is a cokernel of and is a kernel of , then there exists a unique morphism with
Facts & Assumptions
Given: A morphism , a cokernel of , and a kernel of .
The image of is the kernel of a cokernel of (Image and coimage in a category with kernels and cokernels).
Proof
Because is a cokernel of , one has .
The morphism is a kernel of , so step 1.1 gives a unique with . That is the claimed factorization through the image.
The canonical morphism from the coimage to the image exists and is unique
Statement
Let be a morphism in a category with kernels and cokernels. Write for the coimage projection and for the image inclusion. Then there exists a unique morphism
such that
Facts & Assumptions
Given: A morphism , its coimage projection , and its image inclusion .
The morphism factors uniquely through its coimage (A morphism factors uniquely through its coimage).
The morphism factors uniquely through its image (A morphism factors uniquely through its image).
Every coequalizer is epic (Every equalizer is a monomorphism, and every coequalizer is an epimorphism).
Proof
By [L1], there is a unique morphism with . Let be a cokernel of . Then , and [L3] makes epic, so . Because is a kernel of , there is a unique map with .
Composing the identity of step 1.1 with gives , so has the required property. If another map also satisfies , then by the epicity of from [L3], and the uniqueness of the kernel factorization in step 1.1 gives .
The coimage projection is epic and the image inclusion is monic
Statement
For every morphism in a category with kernels and cokernels, the defining map is epic and the defining map is monic.
Facts & Assumptions
Given: A morphism with coimage projection and image inclusion .
The coimage is defined as a cokernel and the image as a kernel (Image and coimage in a category with kernels and cokernels).
Every coequalizer is epic and every equalizer is monic (Every equalizer is a monomorphism, and every coequalizer is an epimorphism).
Proof
By [L1], the map is a cokernel of a kernel of . Therefore [L2] makes epic.
Again by [L1], the map is a kernel of a cokernel of . Therefore [L2] makes monic.
Abelian category
Definition
An abelian category is an additive category (Additive category) in which every morphism has a kernel and a cokernel, and in which for every morphism the canonical comparison morphism
constructed in The canonical morphism from the coimage to the image exists and is unique is an isomorphism.
The first two clauses are Grothendieck's AB1, while the invertibility of the canonical map is this page's working form of AB2.
This page uses Grothendieck's AB1 and AB2 labels, and records the competing conventions
Grothendieck's original Tohoku paper labels the two extra clauses on top of additivity as AB1 and AB2: every morphism has a kernel and a cokernel, and the canonical map is an isomorphism. This page follows that convention.
Two cautions matter because both conventions occur in the modern literature. First, there is no Grothendieck axiom "AB0": additivity is a standing hypothesis, not a numbered clause. Second, Weibel's Appendix A uses the label "AB2" for a different statement, namely that every monomorphism is the kernel of its cokernel. That statement is proved later on this page as Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel.
The Stacks Project avoids the AB labels altogether and writes the same content directly as the definition of an abelian category. That is compatible with this page's choice; it is a notation split, not a mathematical disagreement.
An abelian category is balanced
Statement
If in an abelian category is both monic and epic, then is an isomorphism.
Facts & Assumptions
Given: An abelian category and a morphism that is both monic and epic.
The kernel of a monomorphism is zero, and the cokernel of an epimorphism is zero (The kernel of a monomorphism is zero and the cokernel of an epimorphism is zero).
The cokernel of is , and the kernel of is (The cokernel of the zero map out of the zero object is the target, and dually for kernels).
Every morphism has a canonical factorization (The canonical morphism from the coimage to the image exists and is unique).
In an abelian category the canonical map is an isomorphism (Abelian category).
Proof
Because is monic and epic, [L1] identifies and with zero objects. Hence [L2] gives isomorphisms and for the coimage projection and image inclusion of .
By [L4], the middle map is an isomorphism. Since , step 1.1 shows that is a composite of three isomorphisms, so itself is an isomorphism.
The opposite of an abelian category is abelian
Statement
If is an abelian category, then the opposite category is also abelian.
Facts & Assumptions
Given: An abelian category .
An abelian category is additive and every morphism in it has a kernel and a cokernel (Abelian category).
The opposite of an additive category is additive (Additive categories are closed under passage to the opposite).
Passing to the opposite reverses every morphism while keeping the same objects (Opposite category ).
Proof
By [L1] and [L2], the opposite category is additive. Under [L3], a kernel in becomes a cokernel in , and a cokernel becomes a kernel, so every morphism of also has both.
The image of in the opposite category is the opposite of the coimage of , and the coimage of is the opposite of the image of . Therefore the canonical comparison for is the opposite of the canonical comparison for , which is an isomorphism by [L1]. So satisfies the same AB2 clause and is abelian.
Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel
Statement
In an abelian category, every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel.
Facts & Assumptions
Given: An abelian category and a monomorphism with cokernel .
The kernel of a monomorphism is zero (The kernel of a monomorphism is zero and the cokernel of an epimorphism is zero).
The image and coimage are defined by kernels and cokernels (Image and coimage in a category with kernels and cokernels).
A morphism factors through its image, and the canonical map exists (A morphism factors uniquely through its image, The canonical morphism from the coimage to the image exists and is unique).
In an abelian category the canonical map is an isomorphism (Abelian category).
The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).
Proof
By [L1], the kernel of is zero. Therefore [L2] identifies the coimage projection with an isomorphism.
By definition, the image inclusion is a kernel of the cokernel . Since by [L4], and both and are isomorphisms by step 1.1 and [L5], there is an isomorphism with . So is itself a kernel of up to the unique compatible isomorphism of kernel objects.
By [L6], the opposite of an abelian category is again abelian. Applying step 2.1 there to the opposite of an epimorphism gives that every epimorphism in the original category is the cokernel of its kernel.
Every morphism factors as an epimorphism followed by a monomorphism, uniquely up to unique isomorphism
Statement
Every morphism in an abelian category admits a factorization
with epic and monic. If also with epic and monic, then there is a unique isomorphism such that
Facts & Assumptions
Given: An abelian category and a morphism .
The canonical coimage-to-image map exists (The canonical morphism from the coimage to the image exists and is unique).
The coimage projection is epic and the image inclusion is monic (The coimage projection is epic and the image inclusion is monic).
In an abelian category the canonical coimage-to-image map is an isomorphism (Abelian category).
Abelian categories are balanced (An abelian category is balanced).
Every monomorphism is the kernel of its cokernel (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).
Proof
Let and be the defining maps. By [L1], factors as , and [L2] makes epic and monic. Since is an isomorphism by [L3], the composite is epic, so is an epic-monic factorization.
Suppose also with epic and monic. Then , so , and the epicity of gives . Since is a kernel of its cokernel by [L5], factors uniquely through as . Reversing the roles of and gives for a unique .
From step 2.1 one gets and , so monicity gives and . Thus is an isomorphism. Finally, , and monicity of gives . Any other comparison map with the same property equals by the uniqueness in step 2.1.
The image is the least subobject through which a morphism factors
Statement
Let be a morphism in an abelian category, and let be the image inclusion. Then factors through , and if with monic, then
in the subobject order of .
Facts & Assumptions
Given: An abelian category, a morphism , and a factorization through a monomorphism .
Every morphism factors as an epimorphism followed by a monomorphism (Every morphism factors as an epimorphism followed by a monomorphism, uniquely up to unique isomorphism).
A subobject is a mutual-factorization class of monomorphisms, ordered by factorization (Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms, Subobjects and quotient objects form oppositely oriented partially ordered collections).
Every monomorphism is the kernel of its cokernel (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).
Proof
By [L1], admits an epic-monic factorization , so it factors through its image.
Because , the composite is zero. Using step 1.1, this becomes . Since is epic, . Now [L3] says that is a kernel of , so factors uniquely through .
The factorization in step 2.1 is exactly the order relation from [L2]. Hence the image is the least subobject of through which factors.
In an abelian category, monic means zero kernel and epic means zero cokernel
Statement
For a morphism in an abelian category:
- is monic if and only if its kernel is zero;
- is epic if and only if its cokernel is zero.
Facts & Assumptions
Given: An abelian category and a morphism in it.
An abelian category is additive, hence preadditive and equipped with a zero object (Abelian category).
In a preadditive category with a zero object, a morphism is monic exactly when its kernel is zero (In a preadditive category with a zero object, a morphism is monic exactly when its kernel is zero).
In a preadditive category with a zero object, a morphism is epic exactly when its cokernel is zero (In a preadditive category with a zero object, a morphism is epic exactly when its cokernel is zero).
Proof
The monomorphism claim is exactly [L2], because [L1] supplies the preadditive and zero-object hypotheses that [L2] needs.
The epimorphism claim is exactly [L3], for the same reason.
Freyd's axioms A0, A1, A1*, A2, A2*, A3, and A3* for abelian categories
Definition
Freyd's axiomatisation of an abelian category asks for the following data and properties.
- A0. A zero object exists (Initial object, terminal object, and zero object).
- A1. Every pair of objects has a product.
- A1*. Every pair of objects has a coproduct.
- A2. Every morphism has a kernel (Equalizers and coequalizers as limits and colimits of a parallel pair).
- A2*. Every morphism has a cokernel (Equalizers and coequalizers as limits and colimits of a parallel pair).
- A3. Every monomorphism is a kernel (Monomorphism and epimorphism by left and right cancellation).
- A3*. Every epimorphism is a cokernel.
Unlike the working definition on this page, no additive enrichment is part of the data. Freyd's point is that the additive structure can be recovered from the remaining axioms.
Freyd's axioms force the additive structure and recover the AB2 definition
Statement
If a category satisfies Freyd's axioms A0, A1, A1*, A2, A2*, A3, and A3*, then it is additive. Moreover, for every morphism the canonical map from the coimage to the image is an isomorphism, so the category is abelian in the working sense of Abelian category.
Facts & Assumptions
Given: A category satisfying Freyd's axioms A0, A1, A1*, A2, A2*, A3, and A3*.
Freyd's axioms are the zero-object, binary product, binary coproduct, kernel, cokernel, normal-monic, and conormal-epic clauses listed in Freyd's axioms A0, A1, A1*, A2, A2*, A3, and A3* for abelian categories.
Once one object carries both the product and coproduct structures with the standard zero equations, the canonical comparison is the identity and the object is a biproduct (Biproduct data characterisation without addition).
Finite biproducts give a canonical commutative-monoid enrichment on hom-sets, and [L4] makes that enrichment unique (A category with finite biproducts is enriched in commutative monoids, The commutative-monoid enrichment of a category with finite biproducts is unique).
Earlier on this page, image, coimage, their factorization maps, and the canonical coimage-to-image morphism were constructed from kernels and cokernels (Image and coimage in a category with kernels and cokernels, A morphism factors uniquely through its coimage, A morphism factors uniquely through its image, The canonical morphism from the coimage to the image exists and is unique).
Every coequalizer is epic (Every equalizer is a monomorphism, and every coequalizer is an epimorphism).
Proof
Freyd's axioms already make balanced: if is monic and epic, the normality clause writes as a kernel of some , so ; because is epic, , and the identity is a kernel of , so is isomorphic to .
Let and be the coproduct and product supplied by [L1]. The split epics and are cokernels of the opposite injections because maps out of a coproduct are determined by the injections; dually the split monics and are kernels of the opposite projections because maps into a product are determined by the projections. Therefore the canonical comparison is both monic and epic, so step 1.1 makes it an isomorphism. Thus binary biproducts exist, and together with the zero-object clause this gives finite biproducts.
By [L3], the finite biproducts from step 2.1 give a canonical commutative-monoid law on each hom-set. On , Mitchell's shear is monic and epic by the same kernel-cokernel argument used in step 2.1, hence invertible by step 1.1. Writing , the matrix identity yields in the monoid law of [L3]. For every , the morphism is therefore an additive inverse of , so the hom-monoids are abelian groups. Hence is preadditive, and with finite biproducts it is additive.
Let , let be its kernel, let be the cokernel of , let be the kernel of a cokernel of , and let be the canonical morphism from [L4]. Put . To show that is monic, let satisfy , let be a cokernel of , and write . Since is a composite of cokernels, [L5] makes it epic, so the conormality clause gives some with . Now , so factors through ; hence . Because is a cokernel of , the map factors through as . Since is epic by [L5], , so is monic. Then forces , and is monic.
The dual argument shows that the factorization map is epic: starting from a kernel of a map out of , one passes to the opposite category and repeats step 4.1. Since is monic and is epic by [L5], the equalities and imply that itself is monic and epic. Step 1.1 then makes an isomorphism.
Thus every morphism has kernels and cokernels and an invertible canonical coimage-to-image comparison. Together with the additivity from step 3.1, this is exactly the working abelian definition of Abelian category.
Freyd and Mitchell's characterisation of abelian categories
Statement
For a category , the following are equivalent.
- is abelian in the working sense of Abelian category.
- satisfies Freyd's axioms A0, A1, A1*, A2, A2*, A3, and A3*.
- has a zero object, pullbacks, and pushouts, and every monomorphism is a kernel while every epimorphism is a cokernel.
Facts & Assumptions
Given: A category .
An abelian category is additive, has kernels and cokernels, and has invertible coimage-image comparison maps (Abelian category).
In an abelian category every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).
Freyd's axioms imply the working abelian definition (Freyd's axioms force the additive structure and recover the AB2 definition).
An additive category with all kernels and cokernels has all finite limits and finite colimits (An additive category with all kernels and cokernels has all finite limits and colimits).
Proof
If clause 1 holds, then [L1] gives additivity, kernels, and cokernels. The zero object and binary biproducts in [L1] supply the zero-object, product, and coproduct clauses, while [L2] supplies the normality and conormality clauses. So clause 1 implies clause 2.
Clause 2 implies clause 1 by [L3].
If clause 2 holds, then step 1.2 and [L4] give all finite limits and finite colimits, hence in particular pullbacks and pushouts. So clause 2 implies clause 3. Conversely, if clause 3 holds, then the pullback of is a product of and , the pushout of is a coproduct, the pullback of is a kernel of , and the pushout of is a cokernel of . Together with the stated normal and conormal clauses, that is exactly Freyd's list.
Steps 1.1, 1.2, and 2.1 prove the three-way equivalence.
Additivity can be derived rather than postulated, depending on the axiomatisation
The working definition on this page starts from additivity because it is the cleanest form for later citations. Freyd's axiomatisation goes the other way: the additive structure is a theorem recovered from normality, conormality, products, coproducts, kernels, and cokernels.
That is why items Abelian category, Freyd's axioms A0, A1, A1*, A2, A2*, A3, and A3* for abelian categories, and Freyd's axioms force the additive structure and recover the AB2 definition coexist rather than compete. The first is the library's working interface; the second and third explain why that interface could have been packaged differently without changing the mathematics.
The uniqueness part of the recovered enrichment is already abstracted in The uniqueness of the enrichment is an Eckmann-Hilton phenomenon: once the finite biproduct law exists, there is no second compatible addition to choose.
An abelian category has all finite limits and all finite colimits
Statement
Every abelian category has all finite limits and all finite colimits.
Facts & Assumptions
Given: An abelian category .
An abelian category is additive and every morphism has a kernel and a cokernel (Abelian category).
An additive category with all kernels and cokernels has all finite limits and all finite colimits (An additive category with all kernels and cokernels has all finite limits and colimits).
Proof
By [L1], an abelian category satisfies the hypotheses of [L2].
Therefore [L2] applies directly and yields all finite limits and all finite colimits.
A pullback is the kernel of the difference of the two legs, and dually for pushouts
Statement
Let and be morphisms in an abelian category. Then a pullback of the cospan is a kernel of the difference map
where and are the biproduct projections. Dually, a pushout of is a cokernel of .
Facts & Assumptions
Given: An abelian category and a cospan .
Abelian categories have finite limits and finite colimits (An abelian category has all finite limits and all finite colimits).
On a biproduct the injections and projections satisfy the standard identity-sum relations (On a biproduct, the injections and projections satisfy the identity-sum relation).
In a preadditive category, equalizers are kernels of differences (In a preadditive category, the equalizer of a parallel pair is the kernel of their difference).
An abelian category is additive and therefore preadditive (Abelian category).
Proof
By [L1] there is a product of and , and by [L4] that product is the biproduct . In the preadditive structure of [L4], a morphism satisfies exactly when . So by [L3], a kernel of is an equalizer of the parallel pair .
Giving is the same as giving its two composites to and , and the equality in step 1.1 is exactly the pullback compatibility condition. Therefore the equalizer in step 1.1 is a pullback of and .
Reversing all arrows gives the pushout statement: in an abelian category a pushout is the cokernel of the corresponding difference map.
The pullback of an epimorphism is an epimorphism
Statement
In a pullback square in an abelian category
if is epic, then is epic.
Facts & Assumptions
Given: The displayed pullback square in an abelian category, with epic.
The pullback is the kernel of the difference map on (A pullback is the kernel of the difference of the two legs, and dually for pushouts).
Abelian categories are preadditive with zero morphisms (Abelian category, A preadditive category with a zero object has zero morphisms in the published sense).
In an abelian category, a morphism is epic exactly when its cokernel is zero (In an abelian category, monic means zero kernel and epic means zero cokernel).
In an abelian category every epic morphism is the cokernel of its kernel (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).
Proof
By [L1], there is a monomorphism with , , and the kernel of . Since , the epicity of implies that is epic as well.
Let be a cokernel of . Because is epic by step 1.1, [L4] says that is a cokernel of its kernel . Since , the map kills , so it factors through as . Composing with gives , and since is epic, . Thus , and composing with yields . So has zero cokernel and is epic by [L3].
The pushout of a monomorphism is a monomorphism
Statement
In an abelian category, the pushout of a monomorphism is a monomorphism.
Facts & Assumptions
Given: An abelian category and a pushout square whose left leg is monic.
The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).
In an abelian category, pullbacks of epimorphisms are epimorphisms (The pullback of an epimorphism is an epimorphism).
Proof
Passing to the opposite category turns the given pushout square into a pullback square, and the given monomorphism into an epimorphism. By [L1], the opposite category is still abelian.
Apply [L2] in the opposite category. The opposite of the resulting epimorphism is exactly the pushout leg in the original square, so that leg is monic.
In a pullback square, the induced map on the kernels of the two parallel arrows is an isomorphism
Statement
In a pullback square in an abelian category
the induced morphism from to is an isomorphism.
Facts & Assumptions
Given: The displayed pullback square in an abelian category.
Abelian categories have pullbacks, and the square above is one (Abelian category, A pullback is the kernel of the difference of the two legs, and dually for pushouts).
Proof
Let be a kernel of and let be a kernel of . Since , the kernel property of gives a unique map with .
Because , the pullback universal property gives a unique map with and . Since , the kernel property of gives a unique map with . Then , so by monicity of ; similarly , so by monicity of . Thus is an isomorphism.
A square with monic legs is a pullback exactly when it identifies the source with the intersection subobject
Statement
Consider a commutative square in an abelian category
whose right and bottom legs are monomorphisms. Let be the intersection of the subobjects represented by and . Then the square is a pullback if and only if the induced morphism is an isomorphism.
Facts & Assumptions
Given: The displayed commutative square with monic right and bottom legs.
In an abelian category, pullbacks of cospans exist and are computed by the construction of A pullback is the kernel of the difference of the two legs, and dually for pushouts.
An intersection of two subobjects is their greatest lower bound in the subobject order (Intersection of a supplied family of subobjects as its greatest lower bound, Subobjects and quotient objects form oppositely oriented partially ordered collections).
Proof
By [L1], the pullback of the two monics and exists. Because the square defining is a common lower bound of and , and every other common lower bound factors uniquely through that pullback, [L2] says that represents their intersection subobject.
If the displayed square is a pullback, then its source is another representative of the same greatest lower bound from step 1.1. Therefore the induced morphism is an isomorphism.
Conversely, if the induced map is an isomorphism, then composing the pullback square representing from step 1.1 with that isomorphism yields the displayed square. Pullbackness is invariant under replacing the corner object by an isomorphic one, so the displayed square is a pullback.
Pullback pasting in an abelian category
Statement
Pullback pasting and pullback cancellation hold in every abelian category.
Facts & Assumptions
Given: A diagram of two adjacent commutative squares in an abelian category.
Pullback and pushout pasting hold in every category in which the relevant squares exist (Pullback and pushout pasting, with cancellation of the square adjacent to the outer edge).
Proof
An abelian category is still a category, and the statement only concerns pullback squares that already exist in that ambient category.
Therefore the general theorem [L1] applies verbatim to the abelian setting.
Kernel and cokernel are mutually inverse order-preserving correspondences between subobjects and quotient objects
Statement
Fix an object in an abelian category. Sending a subobject representative to its cokernel class , and sending a quotient representative to its kernel class , defines mutually inverse order-preserving bijections between the subobjects of and the quotient objects of .
Facts & Assumptions
Given: An object in an abelian category.
Subobjects and quotient objects are mutual-factorization classes with the opposite order conventions (Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms, Subobjects and quotient objects form oppositely oriented partially ordered collections).
Mutual factorization is the correct representative-independent equality relation on subobjects and quotient objects (Mutual factorisation is an equivalence relation on monomorphisms into an object and dually on epimorphisms out of it).
Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).
Proof
Let be monic, let be its cokernel, and let be the kernel of . Since , the monomorphism factors through . Conversely, [L3] says that is itself a kernel of , so factors through . Thus . The dual argument shows that for every epic one has .
If , then for some . Since , one has , so the cokernel universal property of makes factor through . By the quotient-order convention in [L1], this is exactly . The kernel assignment preserves the order dually.
Step 1.1 proves that the two assignments are mutually inverse on classes, and step 1.2 proves that both preserve the stated orders. So kernel and cokernel are mutually inverse order isomorphisms between subobjects and quotient objects.
The quotient of an object by a subobject
Definition
Let be a subobject of an object in an abelian category, represented by a monomorphism . The quotient of by is the quotient object represented by the cokernel of :
Because every monomorphism is the kernel of its cokernel (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel), this quotient is the object paired with the given subobject by the kernel-cokernel correspondence. The next item checks that the definition does not depend on the chosen representative of the class .
The quotient by a subobject is independent of the chosen representing monomorphism
Statement
If two monomorphisms and represent the same subobject of , then their cokernels are canonically isomorphic. Hence the notation depends only on the subobject class .
Facts & Assumptions
Given: Two monomorphisms and representing the same subobject.
The quotient by a subobject is defined as the cokernel of a representing monomorphism (The quotient of an object by a subobject).
Representing the same subobject means mutual factorization (Mutual factorisation is an equivalence relation on monomorphisms into an object and dually on epimorphisms out of it).
The cokernel assignment depends only on the subobject class and gives the inverse order-anti-isomorphism to the kernel assignment (Kernel and cokernel are mutually inverse order-preserving correspondences between subobjects and quotient objects).
Proof
By [L2], the condition that and represent the same subobject is exactly . Applying [L3] gives as quotient-object classes.
Equality of quotient-object classes means the two cokernels are joined by a unique compatible isomorphism. By [L1], that is exactly the claim that the quotient is independent of the chosen representing monomorphism.
First isomorphism theorem in an abelian category
Statement
For every morphism in an abelian category, there is a canonical isomorphism
Facts & Assumptions
Given: An abelian category and a morphism .
The quotient by a subobject is the cokernel of a representing monomorphism (The quotient of an object by a subobject, The quotient by a subobject is independent of the chosen representing monomorphism).
The coimage is the cokernel of the kernel, and the image is the kernel of the cokernel (Image and coimage in a category with kernels and cokernels).
The canonical morphism exists (The canonical morphism from the coimage to the image exists and is unique).
In an abelian category that canonical morphism is an isomorphism (Abelian category).
Proof
By [L1] and [L2], the quotient is exactly the coimage of .
The map from step 1.1 to is the canonical coimage-to-image morphism of [L3], and [L4] makes it an isomorphism. Therefore canonically.
Third isomorphism theorem in an abelian category
Statement
Let be subobjects in an abelian category. Then there is a canonical isomorphism
Facts & Assumptions
Given: Subobjects represented by monomorphisms and .
Quotients by subobjects are well defined (The quotient of an object by a subobject, The quotient by a subobject is independent of the chosen representing monomorphism).
The first isomorphism theorem identifies a quotient by a kernel with the image (First isomorphism theorem in an abelian category).
Every coequalizer, hence every cokernel, is epic (Every equalizer is a monomorphism, and every coequalizer is an epimorphism).
Proof
Let and be the quotient maps from [L1]. Since , the morphism kills , so the universal property of gives a unique map with .
The composite kills , since . Conversely, if satisfies , then is killed by , so the cokernel property of makes factor through . Because is monic, factors through . Thus is a kernel of , and [L2] identifies the image of with . Let be the corresponding monic image inclusion. Then , because .
If satisfies , then , so kills . Since is the cokernel of , there is a unique with . Using and the epicity of from [L3], one gets . Thus is the cokernel of , so by [L1] the quotient is canonically .
The quotient by the kernel followed by the image inclusion is the canonical epi-mono factorization
Statement
For a morphism in an abelian category, the factorization
is the canonical epimorphism-monomorphism factorization of .
Facts & Assumptions
Given: An abelian category and a morphism .
The first isomorphism theorem gives a canonical isomorphism (First isomorphism theorem in an abelian category).
Epic-monic factorizations exist and are unique up to unique isomorphism (Every morphism factors as an epimorphism followed by a monomorphism, uniquely up to unique isomorphism).
Proof
By [L1], there is an isomorphism such that the composite of the quotient map , the isomorphism , and the image inclusion equals .
The quotient map is epic and the image inclusion is monic, so step 1.1 is an epic-monic factorization of . By the uniqueness clause in [L2], it is the canonical one.
Exact functor between abelian categories
Definition
Let and be abelian categories. A functor is exact when it is additive (Additive functor) and both left exact and right exact (Left exact and right exact functors).
Thus exactness is a two-sided preservation condition: preserves the finite limits and finite colimits that exist in its source, and it preserves the additive structure carried by the hom-sets.
A left or right exact functor between abelian categories is automatically additive
Statement
Let be a functor between abelian categories. If is left exact or right exact, then is additive.
Facts & Assumptions
Given: A functor between abelian categories.
Left exact means preserving finite limits, and right exact means preserving finite colimits (Left exact and right exact functors).
Abelian categories are additive (Abelian category).
A functor between additive categories is additive exactly when it preserves finite biproducts (A functor between additive categories is additive exactly when it preserves finite biproducts).
Proof
If is left exact, then by [L1] it preserves the zero object and binary products. In an additive category, products are biproducts by [L2], so preserves finite biproducts.
If is right exact, then by [L1] it preserves the zero object and binary coproducts. Again [L2] identifies those with finite biproducts, so preserves finite biproducts.
In either case, [L3] applies and shows that is additive.
Left exactness, right exactness, and exactness are characterized by short exact sequences
Statement
Let be a functor between abelian categories.
- is left exact if and only if for every short exact sequence in , the sequence is exact.
- is right exact if and only if for every short exact sequence in , the sequence is exact.
- is exact if and only if it carries every short exact sequence in to a short exact sequence in .
Facts & Assumptions
Given: A functor between abelian categories.
Left exactness or right exactness already forces additivity (A left or right exact functor between abelian categories is automatically additive).
A functor between additive categories is additive exactly when it preserves finite biproducts (A functor between additive categories is additive exactly when it preserves finite biproducts).
An additive functor is left exact exactly when it preserves kernels (An additive functor is left exact exactly when it preserves kernels).
Abelian categories remain abelian after passing to the opposite (The opposite of an abelian category is abelian).
In an abelian category every monomorphism is the kernel of its cokernel (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).
Proof
If is left exact, then [L1] makes it additive, and [L3] says that it preserves kernels. Therefore whenever is short exact, the map is a kernel of , which is exactly the left-exact short-sequence criterion. The right-exact half is the dual statement applied in opposite categories using [L4].
Conversely, assume carries every short exact sequence to one exact through the middle. Applying that to the two split short exact sequences and shows that is a biproduct of and , so preserves finite biproducts and is additive by [L2]. Now every kernel fits into a short exact sequence by [L5], so the hypothesis makes a kernel. Then [L3] gives left exactness. The right-exact converse is the dual argument in opposite categories using [L4].
Clause 3 is exactly the conjunction of the first two clauses: a short exact sequence stays short exact precisely when the transformed sequence is both left exact and right exact.
An additive functor is exact exactly when it preserves kernels and cokernels
Statement
Let be an additive functor between abelian categories. Then is exact if and only if it preserves kernels and cokernels.
Facts & Assumptions
Given: An additive functor between abelian categories.
An additive functor between additive categories is left exact exactly when it preserves kernels (An additive functor is left exact exactly when it preserves kernels).
The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).
Exact means additive, left exact, and right exact (Exact functor between abelian categories).
Proof
If is exact, then [L3] says it is left exact and right exact. The left-exact half and [L1] show that preserves kernels. Applying the same argument to and using [L2] shows that preserves cokernels as well.
Conversely, assume preserves kernels and cokernels. By [L1], kernel preservation makes left exact. Passing to opposites and using [L2], cokernel preservation makes right exact. Since is additive by hypothesis, [L3] shows that is exact.
A left exact functor preserves monomorphisms and a right exact functor preserves epimorphisms
Statement
A left exact functor between abelian categories preserves monomorphisms, and a right exact functor preserves epimorphisms.
Facts & Assumptions
Given: A functor between abelian categories.
One-sided exactness is characterized by the corresponding short exact sequence test (Left exactness, right exactness, and exactness are characterized by short exact sequences).
In an abelian category, monomorphisms are exactly the zero-kernel maps and epimorphisms are exactly the zero-cokernel maps (In an abelian category, monic means zero kernel and epic means zero cokernel).
Proof
If is monic, then [L2] says is left exact. A left exact functor carries this to another left exact sequence by [L1], so again has zero kernel. By [L2], is monic.
The epimorphism claim is dual: if is epic, then [L2] says is right exact, and a right exact functor carries it to a right exact sequence. Hence the cokernel of is zero, so [L2] makes epic.
An equivalence between abelian categories is exact
Statement
Every equivalence between abelian categories is exact.
Facts & Assumptions
Given: An equivalence between abelian categories.
Equivalences preserve all limits and colimits that exist (Equivalences preserve, reflect, and create limits and colimits in the isomorphism-invariant sense).
Abelian categories are additive (Abelian category).
A functor between additive categories is additive exactly when it preserves finite biproducts (A functor between additive categories is additive exactly when it preserves finite biproducts).
Exact means additive, left exact, and right exact (Left exact and right exact functors, Exact functor between abelian categories).
Proof
By [L1], the functor preserves finite limits and finite colimits. So by [L4] it is left exact and right exact. In particular it preserves finite products and finite coproducts.
Since the source and target are additive by [L2], those finite products and coproducts are finite biproducts. Therefore step 1.1 lets [L3] conclude that is additive. Together with step 1.1, that is exactly the definition of exactness in [L4].
Abelian subcategory and exact embedding
Definition
Let be a full subcategory of an abelian category . The subcategory is an abelian subcategory when for every morphism of its kernel and cokernel computed in again lie in , and when is closed under finite biproducts in .
An exact embedding is a full embedding (Embedding and full embedding of categories) whose essential image is an abelian subcategory and whose underlying functor is additive (Additive functor).
Abelian groups form an abelian category
Statement
The category of abelian groups and homomorphisms is an abelian category.
Facts & Assumptions
Given: The category of abelian groups.
Abelian groups and -modules have the same objects and morphisms (Abelian groups and -modules have the same objects and morphisms).
For every ring , the category is complete and cocomplete (Left modules over a fixed ring and module homomorphisms form the large locally small category , For every ring R, the category R-Mod is complete and cocomplete).
For a module homomorphism, the kernel, image, and cokernel are the usual submodule and quotient constructions (Module homomorphism and isomorphism, kernel, image and cokernel).
The first isomorphism theorem for modules identifies with (First isomorphism theorem for modules: ).
Proof
By [L1], is the same category as . The hom-sets are therefore abelian groups under pointwise addition, and by [L2] finite products and coproducts exist and are the usual direct sums. So is additive.
Again by [L1], kernels and cokernels in are the module kernels and cokernels from [L3]. The coimage of a homomorphism is , its image is the usual image subgroup, and [L4] identifies them canonically. Hence the AB1 and AB2 clauses of Abelian category hold, so is abelian.
Modules over a ring form an abelian category
Statement
For every ring , the category of left -modules is an abelian category.
Facts & Assumptions
Given: A ring .
Left -modules and their homomorphisms form a category (Left modules over a fixed ring and module homomorphisms form the large locally small category ).
The category is complete and cocomplete (For every ring R, the category R-Mod is complete and cocomplete).
Module kernels, images, and cokernels are the usual ones (Module homomorphism and isomorphism, kernel, image and cokernel).
The first isomorphism theorem for modules identifies the coimage with the image (First isomorphism theorem for modules: ).
Proof
The hom-set of module homomorphisms is an abelian group under pointwise addition, and [L2] gives finite products and coproducts, namely the usual direct sums. So is additive.
Every module homomorphism has the kernel and cokernel from [L3], and [L4] identifies with . Thus satisfies the defining AB1 and AB2 clauses of Abelian category, so it is abelian.
Additive functors from a small preadditive category to an abelian category form an abelian category
Statement
If is a small preadditive category and is abelian, then the category of additive functors and natural transformations is abelian.
Facts & Assumptions
Given: A small preadditive category and an abelian category .
Additive functors and natural transformations form a preadditive category (Additive functors and natural transformations form a preadditive category).
The smallness of makes the relevant functor categories locally small (If is small and is locally small then is locally small; if both are small it is small).
Limits and colimits in functor categories are computed pointwise (For small source and index categories, chosen target limits and colimits compute the corresponding functor-category limits and colimits pointwise).
Abelian categories are additive and have pointwise kernels, cokernels, and coimage-image isomorphisms (Abelian category).
Proof
By [L1], the additive functors already form a preadditive category. The zero functor is additive, and binary biproducts are computed pointwise because [L4] gives biproducts in and [L3] computes them pointwise. So the additive functor category is additive.
Let be a natural transformation. By [L3], its kernel and cokernel in the ambient functor category are computed pointwise, and the pointwise constructions lie in . Because is preadditive and are additive, the induced structure maps on those pointwise kernels and cokernels are again additive by uniqueness in the kernel and cokernel universal properties. The canonical coimage-to-image map is likewise computed pointwise and is an isomorphism at each object by [L4]. Therefore the additive functor category satisfies the axioms of an abelian category.
A small product of abelian categories is abelian
Statement
Every set-indexed product of abelian categories is abelian. In particular, the empty product category is abelian.
Facts & Assumptions
Given: A set-indexed family of abelian categories.
A small product of preadditive categories is preadditive (A small product of preadditive categories is preadditive).
Abelian categories are additive and compute kernels, cokernels, and coimage-image comparison maps internally (Abelian category).
Proof
By [L1], the product category is preadditive. If , this product has one object and one morphism, which is simultaneously zero and identity, so it is already an abelian zero category. For nonempty , the zero object, finite biproducts, kernels, cokernels, and canonical coimage-image maps are all computed coordinatewise from the corresponding structures in each factor from [L2].
Therefore the product category is additive and satisfies the AB1 and AB2 clauses coordinatewise. So every small product of abelian categories is abelian.
An abelian category that is a preorder is trivial
Statement
If an abelian category is a preorder, then every object is isomorphic to the zero object. In particular it is equivalent to the terminal one-object category.
Facts & Assumptions
Given: An abelian category that is also a preorder.
In a preorder there is at most one morphism between any two fixed objects (Preorder and monotone map).
Abelian categories have a zero object and are balanced (Abelian category, An abelian category is balanced).
Proof
By [L1], any two parallel morphisms in are automatically equal. So every morphism is monic and epic.
Let be the zero object from [L2]. The unique morphisms and are both monic and epic by step 1.1, hence isomorphisms by [L2]. Therefore every object is isomorphic to , and the category is equivalent to the terminal one-object category.
Freyd-Mitchell gives a fully faithful exact functor from every small abelian category to a module category
Statement
For every small abelian category , there exist a unital ring and a covariant fully faithful exact functor
The result is traditionally called an embedding theorem, but under this library's stricter terminology it supplies a fully faithful exact functor, not necessarily a functor injective on objects. Equivalently, it identifies up to equivalence with its essential image in the module category; it does not assert that is equivalent to the whole module category.
Remarks
This item is recorded rather than proved here. The smallness hypothesis is part of the statement, and the target is a category of unital left modules over a possibly noncommutative ring.
Nothing later in this page depends on this remark. The library uses it only as a statement of scope and as a contrast with the element-free proofs that follow on the exactness and diagram-lemma pages.
The library does not use Freyd-Mitchell to prove the diagram lemmas
Freyd-Mitchell is not the proof device for this library's later diagram lemmas. It applies only to small abelian categories, it is not proved in this batch, and it would make the later exactness pages depend on a metatheorem rather than on the intrinsic abelian arguments built from pullbacks, pushouts, images, and cokernels.
That trade is the wrong one for the library. The member calculus and the diagram-lemma pages stay internal to an arbitrary abelian category, with no smallness side condition and no appeal to an ambient module category.
5 · Examples, counterexamples and false statements
An exact functor need not be faithful
Statement refuted
Every exact functor between abelian categories is faithful.
Facts & Assumptions
Given: Two nonzero abelian categories and , and an object of with .
A finite product of preadditive categories is preadditive (A small product of preadditive categories is preadditive).
Abelian categories are additive and have kernels, cokernels, and coimage-image isomorphisms (Abelian category).
Exact means additive, left exact, and right exact (Exact functor between abelian categories).
Counterexample
The product category is preadditive by [L1], and its zero object, kernels, cokernels, finite biproducts, and canonical coimage-image maps are all computed componentwise from the corresponding structures in the two factors. Since both factors satisfy [L2], the product does too. The projection preserves those componentwise constructions, so it is exact in the sense of [L3].
The endomorphism is nonzero in , but . So is not faithful. Therefore the refuted claim is false.
Filtered vector spaces can be additive with kernels and cokernels without being abelian
Statement refuted
Every additive category with all kernels and cokernels is abelian.
Facts & Assumptions
Given: A field .
An abelian category is in particular additive and requires the canonical coimage-to-image map to be an isomorphism (Additive category, Abelian category).
Counterexample
Let be the category whose objects are -filtered -vector spaces and whose morphisms preserve the filtrations. Pointwise addition on linear maps and direct sums with make additive, and kernels and cokernels are computed on the underlying linear map with the induced and quotient filtrations.
Take with for and for , while for and for . The identity linear map preserves filtrations, has zero kernel and zero cokernel, so and . But is not an isomorphism in , because its inverse does not preserve . Hence the canonical map is not an isomorphism, so is not abelian.
Torsion-free abelian groups do not form an abelian category
Statement refuted
The full subcategory of torsion-free abelian groups is an abelian category.
Facts & Assumptions
Given: The full subcategory of torsion-free abelian groups.
Torsion-free abelian groups form a full subcategory of (Torsion-free abelian groups form a reflective full subcategory of abelian groups, Abelian groups and -modules have the same objects and morphisms).
Abelian categories are balanced (An abelian category is balanced).
Counterexample
In , multiplication by on is monic and epic. Indeed, if for maps into or out of a torsion-free group , then for every , so torsion-freeness forces .
The map is not an isomorphism in , because its inverse would have to send to , which is not an integer. If were abelian, [L2] would force every bimorphism to be an isomorphism. So the subcategory is not abelian.
FALSE: every additive category with all kernels and cokernels is abelian
Statement
Every additive category with all kernels and cokernels is abelian.
Facts & Assumptions
Given: The filtered-vector-space category from Filtered vector spaces can be additive with kernels and cokernels without being abelian.
The filtered-vector-space example is additive and has all kernels and cokernels, but it is not abelian (Filtered vector spaces can be additive with kernels and cokernels without being abelian).
Refutation
The cited category satisfies the hypothesis of the statement: it is additive and has kernels and cokernels.
But [L1] also says that category is not abelian. Therefore the universal statement is false.
FALSE: if coimage and image happen to be isomorphic as objects, then the canonical map is automatically an isomorphism
Statement
If the coimage and image of a morphism are isomorphic as objects, then the canonical map from the coimage to the image is automatically an isomorphism.
Facts & Assumptions
Given: The torsion-free abelian-group subcategory and the morphism .
The torsion-free abelian-group subcategory is not abelian (Torsion-free abelian groups do not form an abelian category).
Every morphism with kernels and cokernels has a canonical map from its coimage to its image (The canonical morphism from the coimage to the image exists and is unique).
The cokernel of is , and dually the kernel of is (The cokernel of the zero map out of the zero object is the target, and dually for kernels).
Refutation
In the torsion-free abelian-group subcategory, the morphism has zero kernel. Its cokernel in that subcategory is also zero, because any homomorphism out of that kills the even subgroup must send to torsion and hence to . Therefore [L3] identifies both and with .
The canonical map of [L2] is still the morphism , which is not an isomorphism. So isomorphism of the endpoint objects does not force the canonical comparison map itself to be invertible.
FALSE: in an abelian category a morphism can be monic and epic without being an isomorphism
Statement
In an abelian category, a morphism can be monic and epic without being an isomorphism.
Facts & Assumptions
Given: An abelian category.
Abelian categories are balanced (An abelian category is balanced).
Refutation
The statement asserts the existence of a bimorphism in an abelian category that is not an isomorphism.
But [L1] says every bimorphism in an abelian category is an isomorphism. So the asserted witness cannot exist, and the statement is false.
FALSE: every abelian category is equivalent to a module category
Statement
Every abelian category is equivalent to a category of modules.
Facts & Assumptions
Given: A field and the full subcategory of finite-dimensional -vector spaces.
Module categories are abelian (Modules over a ring form an abelian category).
Every module category has all small coproducts (For every ring R, the category R-Mod is complete and cocomplete).
Refutation
The category is abelian: kernels, cokernels, images, coimages, and finite direct sums of linear maps between finite-dimensional vector spaces stay finite-dimensional, so the abelian-category structure of restricts to this full subcategory.
The countable coproduct of countably many copies of the one-dimensional space does not exist in , because its usual direct sum is infinite-dimensional. But [L2] says every module category has all small coproducts. Since equivalences preserve which small coproducts exist, cannot be equivalent to any module category. Therefore the universal statement is false.
FALSE: pullbacks preserve epimorphisms in every category with pullbacks
Statement
In every category with pullbacks, the pullback of an epimorphism is again an epimorphism.
Facts & Assumptions
Given: The full subcategory of Hausdorff spaces and continuous maps.
A Hausdorff space is a topological space in which points are separated by disjoint neighbourhoods (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not).
A continuous map into a Hausdorff space is determined by its restriction to any dense subset (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets, Two continuous maps into a Hausdorff space that agree on a dense subset are equal).
The rationals are dense in , and the irrationals are nonempty (Both and are dense in , and every nonempty open subset of is uncountable).
Refutation
Let be the inclusion of the rationals into the real line, regarded as Hausdorff spaces. By [L3], is dense in , so [L2] says that is epic: any two continuous maps out of into a Hausdorff space that agree on are equal.
Choose an irrational point using [L3], and let be the inclusion. The pullback of along is the map , because . Let with the discrete topology, which is Hausdorff by [L1]. The two constant maps are distinct, but their composites with are equal. So the pullback map is not epic, and the universal statement is false.
Sources
- Junhan Tan, The Freyd-Mitchell Embedding Theorem, Definition 2.2
- Saunders Mac Lane, Categories for the Working Mathematician, VIII.3
- Saunders Mac Lane, Categories for the Working Mathematician, VIII.1
- Gautam Tamme, Algebra II Lecture 9
- Gautam Tamme, Algebra II Lecture 9, §9.1
- The Stacks Project, Section 12.3, Definition 12.3.9
- The Stacks Project, Section 12.3, Fact 12.3.11
- Alexandre Grothendieck, Some aspects of homological algebra, §1.4
- The Stacks Project, Section 12.5, Definition 12.5.1
- Gautam Tamme, Algebra II Lecture 9, §9.4
- Charles Weibel, An Introduction to Homological Algebra, Appendix A.4
- The Stacks Project, Section 12.5
- Junhan Tan, The Freyd-Mitchell Embedding Theorem, Theorem 2.4
- The Stacks Project, Section 12.5, Lemma 12.5.2
- The Stacks Project, Section 12.5, Lemma 12.5.4
- Saunders Mac Lane, Categories for the Working Mathematician, Proposition VIII.3.1
- Peter Freyd, Abelian Categories, Chapter 2
- Peter Freyd, Abelian Categories, Theorem 2.39
- Barry Mitchell, Theory of Categories, Proposition 18.4
- Junhan Tan, The Freyd-Mitchell Embedding Theorem, Theorem 2.11
- Barry Mitchell, Theory of Categories, Theorem 20.1
- Junhan Tan, The Freyd-Mitchell Embedding Theorem, §2
- Peter Freyd, Abelian Categories, Appendix
- The Stacks Project, Section 12.5, Lemma 12.5.5
- The Stacks Project, Section 12.5, Lemma 12.5.11
- The Stacks Project, Section 12.5, Lemma 12.5.13
- The Stacks Project, Section 12.5, Lemma 12.5.14
- The Stacks Project, Section 12.5, Lemma 12.5.12
- Junhan Tan, The Freyd-Mitchell Embedding Theorem, Theorem 2.5
- Emily Riehl, Category Theory in Context, Exercise 3.1.vi
- Junhan Tan, The Freyd-Mitchell Embedding Theorem, Theorem 2.3
- Junhan Tan, The Freyd-Mitchell Embedding Theorem, Fact 2.8
- The Stacks Project, Section 12.7
- Gautam Tamme, Algebra II Lecture 10, §10.4
- The Stacks Project, Section 12.7, Lemma 12.7.2(1)
- The Stacks Project, Section 12.7, Lemma 12.7.2(2)-(4)
- The Stacks Project, Section 12.7, Lemma 12.7.2
- Emily Riehl, Category Theory in Context, Lemma 3.4.5 and Definition 3.4.7
- Barry Mitchell, Theory of Categories, Chapter I
- Peter Freyd, Abelian Categories, Chapter 7
- Alexandre Grothendieck, Some aspects of homological algebra, §1.6
- Gautam Tamme, Algebra II Lecture 9, §9.5
- Junhan Tan, The Freyd-Mitchell Embedding Theorem, Theorem 5.1
- Saunders Mac Lane, Categories for the Working Mathematician, I.2 and VIII.3
- Saunders Mac Lane, Categories for the Working Mathematician, I.1 and VIII.3
- Junhan Tan, The Freyd-Mitchell Embedding Theorem, Corollary 7.17
- Peter Freyd, Abelian Categories, Theorem 7.34
- Junhan Tan, The Freyd-Mitchell Embedding Theorem
- The Stacks Project, Section 12.3, Example 12.3.13
- Emily Riehl, Category Theory in Context, Example 4.5.13
- General Topology Notes (UC Riverside)