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.
Subobject Lattices Generators and the Grothendieck Axioms
1 · Prerequisites
- Abelian Categories
- Adjunctions Units and Counits
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Chains, Antichains, Sperner and Dilworth
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- 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
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits and Colimits
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- 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
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Universal Properties, Representables and the Yoneda Lemma
2 · Summary
This page is where the abelian-category block starts behaving like homological
algebra rather than like category-theoretic infrastructure. Subobjects become a
modular lattice, quotient calculus turns that lattice into the second
isomorphism theorem and the butterfly/Jordan-Holder spine, and generators turn
size questions from MA-2 into concrete hypotheses one can actually verify.
The Grothendieck axioms are stated here in their primitive lattice form, on purpose. Exact filtered colimits and their duals are later reformulations, not the starting point. The page also keeps the projective/injective interface as lean as possible: enough projectives for module categories is established now, while the deeper enough-injectives theorem for general Grothendieck categories is left to later work.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Modular lattice
Definition
A lattice (Lattices, distributive lattices, and order ideals) is modular when for every with one has
The hypothesis is part of the law. Without it, the displayed identity need not hold.
The join of two subobjects in an abelian category
Definition
Let and represent two subobjects of an object in an abelian category. Because finite biproducts exist (An abelian category has all finite limits and all finite colimits), there is a unique morphism
whose composites with the two biproduct injections are and .
The join of the two subobjects is the subobject of represented by the image inclusion of in the sense of Image and coimage in a category with kernels and cokernels. It is denoted
The well-definedness obligation on representatives is discharged by The join of two subobjects is their least upper bound ↗.
The join of two subobjects is their least upper bound
Statement
Let and be subobjects of an object in an abelian category. Then the subobject of The join of two subobjects in an abelian category is the least upper bound of and in the subobject order of .
Facts & Assumptions
Given: Monomorphisms and representing the two subobjects.
The join is the image of the induced map (The join of two subobjects in an abelian category).
The image of a morphism is the least subobject through which that morphism factors (The image is the least subobject through which a morphism factors).
A subobject inequality is exactly factorization of representatives (Subobjects and quotient objects form oppositely oriented partially ordered collections).
Proof
Let be the image inclusion of . Since and for the biproduct injections, the factorization of through makes both and factor through . Thus and , so is an upper bound of the two subobjects.
Let be any common upper bound. Then and for suitable and . By the universal property of , the induced map satisfies . Now [L2] says that the image inclusion factors through every monomorphism through which factors, so .
Step 1.1 gives that is an upper bound, and step 1.2 gives that it lies below every upper bound. By [L3], this is exactly the least-upper-bound claim.
The meet of two subobjects is their pullback
Statement
Let and be subobjects of an object in an abelian category, represented by monomorphisms and . Then the meet in the subobject order is represented by the pullback of and .
Facts & Assumptions
Given: Monomorphisms and .
Pullbacks are defined by their commutative square and universal property (Pullbacks and pushouts as limits and colimits of cospans and spans).
A pullback of a monomorphism is a monomorphism (A pullback of a monomorphism is a monomorphism, and a pushout of an epimorphism is an epimorphism).
Subobject inequalities are factorization relations between representatives (Subobjects and quotient objects form oppositely oriented partially ordered collections).
Proof
Form a pullback square tikzcd P \arrow[r, "q"] \arrow[d, "p"'] & C \arrow[d, "c"] \\ B \arrow[r, "b"'] & A. By [L2], the pullback leg is monic, so the composite is monic as well. Because factors through both and , it is a lower bound of the two subobjects.
Let be any lower bound. Then for some and . By the pullback universal property [L1], there is a unique with and . Therefore , so factors through . Hence .
Steps 1.1 and 1.2 show that is a lower bound above every other lower bound. By [L3], the pullback subobject is exactly .
The subobjects of an object in an abelian category form a lattice
Statement
For every object of an abelian category, the subobjects of form a bounded lattice. The meet is pullback, the join is the image construction of The join of two subobjects in an abelian category, the bottom element is the zero subobject, and the top element is .
Facts & Assumptions
Given: An object in an abelian category.
Any two subobjects of admit a least upper bound (The join of two subobjects is their least upper bound).
Any two subobjects of admit a greatest lower bound (The meet of two subobjects is their pullback).
Subobjects are mutual-factorization classes of monomorphisms into (Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms).
An abelian category has a zero object, hence zero morphisms (Abelian category).
Proof
By [L1] and [L2], every pair of subobjects of has a join and a meet. That gives the binary lattice operations.
By [L4], the unique map exists. It is monic because every two maps into are equal, so by [L3] it represents a subobject of . Every monomorphism into factors through , and factors through every monomorphism into , so these classes are respectively the top and bottom elements.
Steps 1.1 and 1.2 prove that the subobjects of form a bounded lattice.
The subobject lattice of an abelian category is modular
Statement
For every object in an abelian category, the lattice of subobjects of is modular.
Facts & Assumptions
Given: An object in an abelian category.
A modular lattice is one satisfying (Modular lattice).
The subobjects of form a lattice (The subobjects of an object in an abelian category form a lattice).
Quotienting by the kernel identifies a morphism with its image (First isomorphism theorem in an abelian category).
Quotienting nested subobjects satisfies the third isomorphism theorem (Third isomorphism theorem in an abelian category).
In an abelian category, a morphism that is both monic and epic is an isomorphism (An abelian category is balanced).
The join of two subobjects is the image of the induced map from their biproduct (The join of two subobjects in an abelian category).
The meet of two subobjects is represented by their pullback (The meet of two subobjects is their pullback).
Proof
Consider any lattice in which comparable complements of a fixed element coincide in every interval. Let and put Then by monotonicity.
Fix an interval of subobjects of , and write with quotient map . If is any intermediate subobject, let be its quotient map. Because , the composite kills , so it factors through as a map . Define to be the kernel subobject of .
Both and are complements of in the interval : one has , and gives , while and give . By step 1.1, the interval hypothesis forces . Therefore the modular-law identity of [L1] holds.
Conversely, if with quotient map , define to be the kernel subobject of in . Then . If lies in the interval, the equality gives . If , the morphism is epic, so its image is all of ; by [L3], Under this identification, is a cokernel of , so . Thus and are inverse bijections between and the subobject lattice of .
If in the interval, then factors through , so kills . Hence . The same argument applied to shows that is an order isomorphism from onto .
By step 3.1, it is enough to prove the comparable-complements property in . Let , and let be two complements of . Write for the quotient map.
Because , the pullback description [L7] makes the kernel of the restricted map trivial. Because , the canonical map has image by [L6], so composing with shows that is epic. By [L5], is an isomorphism. The same argument shows that is an isomorphism. Let represent the comparison . Then , so is an isomorphism. Therefore and represent the same subobject of .
Step 5.1 proves that every interval in the subobject lattice has the comparable-complements property, and step 2.1 shows that this property implies the modular law of [L1]. With [L2], this proves that the subobject lattice of is modular.
The published subgroup modular law is the instance
The subgroup modular law already published as Dedekind's modular law for subgroup products is the concrete group-theoretic instance of the categorical modularity theorem. Item The subobject lattice of an abelian category is modular is the abstract statement: in its subobjects are subgroups, and the modular-law identity becomes exactly Dedekind's law.
Second isomorphism theorem in an abelian category
Statement
Let and be subobjects of an object in an abelian category. Then there is a canonical isomorphism
Facts & Assumptions
Given: Subobjects and .
The join is the image of the induced map (The join of two subobjects in an abelian category).
The meet is represented by the pullback of and (The meet of two subobjects is their pullback).
A morphism modulo its kernel is canonically isomorphic to its image (First isomorphism theorem in an abelian category).
Proof
Let be the quotient map. Consider the composite . By [L2], a morphism into is killed by exactly when its composite into factors through , which is exactly the pullback condition defining . So .
By [L3], step 1.1 gives a canonical isomorphism The map kills , so its restriction to the join factors through the quotient . Conversely, every summand used in the defining map lands in after composing with , because the -summand dies. Hence is exactly the image of in , namely .
Combining steps 1.1 and 2.1 yields the canonical isomorphism .
Direct and inverse image of a subobject
Definition
Let be a morphism in an abelian category.
If represents a subobject of , its direct image along is the subobject of represented by the image inclusion of the composite
It is denoted .
If represents a subobject of , its inverse image along is the subobject of represented by the pullback of along (Pullbacks and pushouts as limits and colimits of cospans and spans). It is denoted .
The representative-independence of these assignments is discharged by Direct and inverse image of subobjects form a Galois connection ↗.
Direct and inverse image of subobjects form a Galois connection
Statement
Let be a morphism in an abelian category. Then the direct-image map
and the inverse-image map
form a Galois connection:
Facts & Assumptions
Given: A morphism and subobjects , .
Direct image and inverse image are defined by image factorization and pullback respectively (Direct and inverse image of a subobject).
A Galois connection between preorders is exactly a pair of monotone maps satisfying the displayed biconditional (Galois connection between preorders).
The image of a morphism is the least subobject through which that morphism factors (The image is the least subobject through which a morphism factors).
Proof
Assume . By [L1], the composite factors through the subobject . The pullback defining therefore gives a factorization of through , so .
Assume . Composing with the pullback leg shows that the composite factors through . By [L3], the image is the least subobject of with that property, so .
Steps 1.1 and 1.2 prove the displayed biconditional, which is exactly the Galois-connection condition of [L2].
Inverse image preserves meets and direct image preserves joins
Statement
Let be a morphism in an abelian category. Then for subobjects and one has
Facts & Assumptions
Given: A morphism and the displayed subobjects.
The subobject maps and form a Galois connection (Direct and inverse image of subobjects form a Galois connection).
Subobjects form lattices, so meets and joins are characterized by their order universal properties (The subobjects of an object in an abelian category form a lattice).
Proof
For any subobject , By [L2], this says that is the meet of and .
For any subobject , Again [L2] identifies this with the universal property of the join .
Steps 1.1 and 1.2 are exactly the two displayed identities.
Kernel and image are the inverse and direct images along a morphism
Statement
Let be a morphism in an abelian category.
- The inverse image of the zero subobject of along is .
- The direct image of the identity subobject of along is .
Facts & Assumptions
Given: A morphism .
Inverse image is defined by pullback and direct image by ordinary image factorization (Direct and inverse image of a subobject).
A subobject is represented by a monomorphism; in particular and represent the zero and total subobjects (Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms).
The ordinary image of a morphism is defined as the kernel of a cokernel (Image and coimage in a category with kernels and cokernels).
Proof
Pulling back the zero subobject along produces exactly the kernel square of , so by [L1] and [L2] the inverse image is .
The direct image of the identity subobject is, by [L1], the image of the composite , which is just the image of in the sense of [L3].
Therefore kernels and images are exactly inverse and direct images along the morphism .
Simple object
Definition
An object of an abelian category is simple when and its only subobjects are the zero subobject and (Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms).
Equivalently, has no proper nonzero subobject.
Composition series and composition factors of an object
Definition
A composition series of an object in an abelian category is a finite strict chain of subobjects
such that every quotient object is simple (Simple object, The quotient of an object by a subobject).
The simple quotient objects are the composition factors of the series.
Zassenhaus butterfly lemma in an abelian category
Statement
Let and be subobjects of an object in an abelian category. Then there is a canonical isomorphism
Facts & Assumptions
Given: Subobjects and of an object .
The subobject lattice of is modular (The subobject lattice of an abelian category is modular).
For subobjects of a common object, one has (Second isomorphism theorem in an abelian category).
Nested quotients satisfy the third isomorphism theorem (Third isomorphism theorem in an abelian category).
Proof
Put , , and . Since , the second isomorphism theorem [L2] applied to and inside gives By modularity [L1] inside the interval below , So the left quotient is canonically isomorphic to .
Similarly, since , the second isomorphism theorem [L2] applied to and inside gives Again modularity yields So the right quotient is also canonically isomorphic to .
The two quotients in steps 1.1 and 1.2 are canonically isomorphic to the same quotient of , hence to each other. The nested-quotient compatibility of [L3] identifies these isomorphisms with the displayed butterfly quotient comparison.
Schreier refinement theorem in an abelian category
Statement
Let
be finite chains of subobjects in an abelian category. Then they admit refinements whose successive quotient objects can be paired up up to isomorphism.
Facts & Assumptions
Given: The two finite subobject chains displayed in the statement.
A refinement is obtained by inserting intermediate subobjects, and two finite chains are equivalent when their nonzero successive quotient objects can be paired up up to isomorphism.
Each cell in the refinement grid is governed by the butterfly lemma (Zassenhaus butterfly lemma in an abelian category).
Proof
For and , define Then and , while for every . Concatenating the chains over gives a refinement of the -chain. Define symmetrically; concatenating those chains refines the -chain.
For every cell , apply [L1] to the pairs and . It gives a canonical isomorphism So the successive quotients of the two refinements are paired by the same grid.
Some adjacent terms may coincide, producing zero successive quotients. By [F1], deleting those repetitions leaves equivalent refinements, and the quotient pairing from step 2.1 survives on every nonzero factor. Hence the original two chains admit equivalent refinements.
Jordan-Holder theorem in an abelian category
Statement
If an object in an abelian category has two composition series, then the two series have the same length and the same composition factors up to permutation and isomorphism.
Facts & Assumptions
Given: Two composition series of the same object .
A composition series is a finite strict subobject chain with simple successive quotients (Composition series and composition factors of an object, Simple object).
Any two finite subobject chains admit equivalent refinements (Schreier refinement theorem in an abelian category).
Proof
By [L2], the two composition series admit equivalent refinements.
A composition series has no proper refinement. Indeed, if , then the quotient map carries to a nonzero proper subobject of the simple object , contradicting [L1]. So any refinement of a composition series differs from it only by repeated adjacent terms.
Delete repeated adjacent terms from the equivalent refinements of step 1.1. By step 1.2 this recovers the original two composition series, and the quotient pairing survives. Therefore the original series have the same number of factors, and a permutation matches their factors up to isomorphism.
Object of finite length
Definition
An object of an abelian category has finite length when it admits a composition series in the sense of Composition series and composition factors of an object.
Its length is the number of successive simple factors in any composition series. The Jordan-Hölder theorem Jordan-Holder theorem in an abelian category makes this number independent of the chosen series.
Length is additive along a subobject
Statement
Let be a subobject in an abelian category. If any two of the objects , , and have finite length, then so does the third, and whenever all three do one has
Facts & Assumptions
Given: A subobject .
Finite length means admitting a composition series, and length is the common number of factors in such a series (Object of finite length).
Jordan-Hölder makes the factor count independent of the chosen composition series (Jordan-Holder theorem in an abelian category).
The second isomorphism theorem identifies the factors that arise from pulling a chain across a quotient or intersecting with a subobject (Second isomorphism theorem in an abelian category).
Proof
Assume and have finite length. Choose composition series Let be the quotient map and put . Then and [L3] identifies each quotient with . So is a composition series of . Therefore has finite length and .
Assume now that has finite length, with composition series Intersecting with gives an increasing chain and quotienting by gives an increasing chain in . By [L3], each successive factor in either chain is a subquotient of a simple factor , hence is either or simple. Deleting repeated adjacent terms therefore yields composition series of and of .
Step 1.1 proves the extension direction and the displayed additive formula. Step 1.2 proves that finite length passes to subobjects and quotients. The number in the formula is independent of the chosen composition series by [L2].
Objects of finite length form an abelian subcategory
Statement
In an abelian category, the full subcategory whose objects have finite length is an abelian subcategory.
Facts & Assumptions
Given: An abelian category .
Finite length is the property defined in Object of finite length.
Finite length is stable under passing to subobjects and quotients, and is additive across a subobject (Length is additive along a subobject).
A full subcategory is abelian precisely when it is closed under kernels, cokernels, and finite biproducts computed in the ambient abelian category (Abelian subcategory and exact embedding).
Proof
Let be a morphism between finite-length objects. Since and , [L2] makes both and finite length. The quotient is then finite length by [L2], so the cokernel of is finite length as well.
If and have finite length, then the inclusion has quotient . Applying [L2] to that inclusion shows that has finite length. So the finite-length objects are closed under finite biproducts.
Steps 1.1 and 1.2 are exactly the kernel, cokernel, and finite-biproduct closures required by [L3]. Therefore the full subcategory of finite-length objects is an abelian subcategory.
The published abelian-group composition-series development is the instance
When restricted to abelian groups, the published group-theory items The Zassenhaus butterfly lemma, The Schreier refinement theorem, The Jordan–Hölder theorem for groups, and Composition series, composition factors, and composition length are the special cases of the categorical results on this page when the ambient abelian category is and subobjects are subgroups. For arbitrary nonabelian groups the comparison does not apply: is not an abelian category, normality is a genuine extra condition, and nonabelian simple factors lie outside . The present page therefore abstracts precisely the abelian-group restriction, not the full published group theorems.
Generator and cogenerator of a category
Definition
An object of a category is a generator when the singleton set is separating in the sense of Separating and coseparating sets of objects.
Dually, an object is a cogenerator when is coseparating.
The axioms AB3 and AB3*
Definition
An abelian category satisfies AB3 when it has all small coproducts, and it satisfies AB3* when it has all small products (Finite, small, and large limits and colimits; complete and cocomplete categories).
Because an abelian category already has cokernels and kernels, the criterion A category is complete exactly when it has all small products and equalizers, and cocomplete exactly when it has all small coproducts and coequalizers identifies AB3 with cocompleteness and AB3* with completeness inside the abelian setting.
The cancellation and epimorphism descriptions of a generator agree
Statement
Let be a locally small abelian category satisfying AB3, and let be an object of . Then the following are equivalent:
- is a generator.
- The representable functor is faithful.
- For every object , the canonical morphism is an epimorphism.
Facts & Assumptions
Given: A locally small abelian category satisfying AB3 and an object .
A generator is exactly a one-object separating set (Generator and cogenerator of a category).
AB3 supplies the small coproducts indexed by hom-sets (The axioms AB3 and AB3*).
In a locally small category, a separating set is equivalently a jointly faithful family of representables (In a locally small category, separating and coseparating sets are equivalently jointly faithful families of representables).
Proof
By [L1] and [L3], condition 1 is equivalent to condition 2: the singleton is separating exactly when the one-member family is faithful.
Assume condition 2, and fix an object . By [L2], form the canonical map whose -th coproduct injection is sent to . Let be its cokernel. If , faithfulness of gives some with . But is one of the coproduct components of , so because , a contradiction. Hence , and therefore is epic. So condition 2 implies condition 3.
Assume condition 3. If are distinct, then . Apply condition 3 to : if for every , then , and since is epic that would force . So some satisfies , equivalently . Thus separates maps, hence is a generator by [L1]. Therefore condition 3 implies condition 1.
Steps 1.1, 1.2, and 2.1 prove the equivalence of the three descriptions.
An AB3 locally small abelian category with a generator is well-powered
Statement
Every locally small abelian category satisfying AB3 and having a generator is well-powered.
Facts & Assumptions
Given: A locally small abelian category satisfying AB3 and a generator .
In AB3, the canonical coproduct map from copies of a generator onto an object is epic (The cancellation and epimorphism descriptions of a generator agree).
Well-powered means that each object admits a set of monomorphisms representing all of its subobject classes (Well-powered and co-well-powered categories, and supplied well-powerings).
A generator is an object in the sense of Generator and cogenerator of a category.
Proof
Fix an object . For each subobject , let be the subset of those maps that factor through . Because is locally small, is a set, so its power set is a set as well.
For each subset , use AB3 and [L1] to form the canonical map and let be its image. If is any subobject, then [L1] applied to gives an epic canonical map Composing with produces exactly the family of maps in , so the image of the resulting composite is . Hence represents the same subobject as .
The set of monomorphisms therefore contains a representative of every subobject class of . By [L2], is well-powered.
Generator, separator, and the three inequivalent-looking definitions
The library defined a separating set on the adjoint-functor page and uses generator here for the one-object version. Grothendieck and the Stacks Project phrase the notion by canonical epimorphisms from coproducts of copies of the object, while Freyd phrases it by faithfulness of . Item The cancellation and epimorphism descriptions of a generator agree shows that these are equivalent in the cocomplete abelian setting; the three definitions are not the same sentence, which is why the page records the terminology rather than silently treating one as notation for another.
A cocomplete locally small abelian category with a generator supplies the category-side SAFT hypotheses dually
Statement
Let be a cocomplete locally small abelian category with a generator. Then is well-powered and co-well-powered. In the opposite category , the object is coseparating. If a supplied well-powering of is given, taking cokernels supplies a co-well-powering of , equivalently a supplied well-powering of . Thus supplies the category-side data in the supplied-well-powering branch of the objectwise special adjoint functor theorem. The target-category and continuity hypotheses remain hypotheses on the particular functor to which that theorem is applied.
Facts & Assumptions
Given: A cocomplete locally small abelian category with a generator .
Such a category is well-powered (An AB3 locally small abelian category with a generator is well-powered).
The supplied-well-powering branch of objectwise SAFT requires a complete locally small domain with a supplied small coseparating set and a supplied well-powering; the target must be locally small and the functor must preserve all small limits. (Special adjoint functor theorem, objectwise form with explicit intersection smallness or preservation data)
In an abelian category, subobjects and quotient objects correspond by kernel and cokernel (Kernel and cokernel are mutually inverse order-preserving correspondences between subobjects and quotient objects).
A generator is a separating object (Generator and cogenerator of a category).
The opposite of an abelian category is abelian. (The opposite of an abelian category is abelian)
Proof
By [L1], every object of has a set of representative monomorphisms for its subobject classes. By [L3], taking cokernels transfers these to representative epimorphisms for all quotient-object classes. Thus is both well-powered and co-well-powered.
By [L5], is abelian, and cocompleteness of becomes completeness of . Local smallness is unchanged. The separating property of from [L4] becomes the coseparating property in the opposite category.
A supplied well-powering of gives a supplied family of representative monomorphisms. Applying cokernels objectwise using [L3] gives a supplied co-well-powering of , which is a supplied well-powering of . Hence the domain-side hypotheses in branch 1 of [L2] hold for .
Therefore the category supplies exactly the stated dual SAFT data. As [L2] requires, any application must still provide a locally small target and a functor preserving all small limits; those are not consequences of the present category-level hypotheses.
A generator detects comparison of subobjects
Statement
Let be a generator of an abelian category, and let be subobjects. Then
Facts & Assumptions
Given: A generator and subobjects , represented by monomorphisms and .
A generator separates distinct morphisms by precomposition (Generator and cogenerator of a category).
The meet is represented by the pullback of and (The meet of two subobjects is their pullback).
In an abelian category, a morphism that is both monic and epic is an isomorphism (An abelian category is balanced).
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).
Abelian categories have cokernels (Abelian category).
Proof
If , then any map factoring through also factors through by composition.
To prove the converse, assume . By [L2], let be the pullback subobject of and . If were epic, then [L3] would make it an isomorphism, forcing to factor through . So is not epic.
Let be a cokernel of , which exists by [L5]. Since is not epic, [L4] implies .
The morphisms and are therefore distinct, so [L1] gives some with . If factored through , the pullback property in [L2] would force to factor through , hence , impossible. Thus factors through but not through .
Step 1.1 proves the forward implication, and steps 1.2, 2.1, and 3.1 prove the contrapositive of the reverse implication. Therefore exactly when every morphism factoring through also factors through .
The axioms AB4 and AB4*
Definition
An abelian category satisfies AB4 when it satisfies AB3 and every small coproduct of monomorphisms is again a monomorphism.
Dually, it satisfies AB4* when it satisfies AB3* and every small product of epimorphisms is again an epimorphism.
The axioms AB5 and AB5*
Definition
First fix the small-family operations used below. In an AB3 abelian category, the join of a small family is the image of the induced morphism
In an AB3* abelian category, let be the quotient maps (The quotient of an object by a subobject). The meet of the family is the kernel of the induced morphism
These constructions have the claimed order properties. Indeed, each component factors through the image of , while any common upper bound receives the coproduct map; image minimality (The image is the least subobject through which a morphism factors) therefore makes that image the least upper bound. Dually, the displayed kernel lies in every because is the kernel of (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel), and every common lower bound is killed by every , hence by the product map, so it factors through the displayed kernel. Thus that kernel is the greatest lower bound. For a two-member family these constructions agree with the binary operations of The subobjects of an object in an abelian category form a lattice. The empty join is and the empty meet is .
An abelian category satisfies AB5 when it satisfies AB3 and for every small directed family of subobjects of an object and every subobject one has
It satisfies AB5* when it satisfies AB3* and for every small decreasing family of subobjects of an object and every subobject one has
The joins and meets in these formulas are the small-family constructions above.
AB5 implies AB4
Statement
Every abelian category satisfying AB5 also satisfies AB4.
Facts & Assumptions
Given: An abelian category satisfying AB5.
AB5 is the directed-join distributivity law together with AB3 (The axioms AB5 and AB5*).
AB4 is the assertion that small coproducts of monomorphisms are monic (The axioms AB4 and AB4*).
Proof
Let be a small family of monomorphisms, and let be the induced coproduct map, which exists by the AB3 part of [L1]. Let be its kernel. For each finite subset , let be the finite partial sum of the summands with indices in . Because finite coproducts in an abelian category are biproducts, the restriction of to is a finite direct sum of monomorphisms and is therefore monic. Hence for every finite .
The family is directed and has join . Applying the AB5 identity [L1] with the fixed subobject gives So the kernel of is zero, and therefore is monic. By [L2], this is exactly AB4.
Grothendieck category
Definition
A Grothendieck category is an abelian category that satisfies AB5 and has a generator (The axioms AB5 and AB5*, Generator and cogenerator of a category).
Module categories are Grothendieck categories
Statement
For every ring , the category of left -modules is a Grothendieck category.
Facts & Assumptions
Given: A ring .
The category is complete and cocomplete (For every ring R, the category R-Mod is complete and cocomplete).
In an AB3 category, an object is a generator exactly when the canonical coproduct map from its copies onto every object is epic (The cancellation and epimorphism descriptions of a generator agree).
Equality in filtered colimits of sets is eventually witnessed at one common stage (Two representatives in a filtered colimit of sets are equal exactly when they become equal at one common later stage).
For a left -module , every module map is determined by the image of , and every element defines such a map by .
Proof
By [L1], the category has all small coproducts, so it satisfies AB3. For any left -module , the bijection [F1] identifies the canonical coproduct with a copy of for each element of , and the canonical map to sends the basis vector indexed by to . It is therefore surjective, hence epic. By [L2], is a generator.
Let be a directed family of submodules of a module , and let . The join is the union , because directedness makes finite sums of elements land in one later stage. Thus every element of already lies in some , and the reverse inclusion is immediate. So This is exactly AB5. The eventual-equality principle [L3] is the set-level form behind the same filtered-colimit exactness statement.
Step 1.1 gives a generator and step 1.2 gives AB5. Therefore is a Grothendieck category by Grothendieck category.
Assuming the Axiom of Choice, abelian groups satisfy AB4*
Statement
Assume the Axiom of Choice. Then the abelian category satisfies AB4*.
Facts & Assumptions
Given: The Axiom of Choice and a small family of epimorphisms of abelian groups .
AB4* means that small products of epimorphisms remain epimorphic (The axioms AB4 and AB4*).
The Axiom of Choice gives a choice function for every family of nonempty sets (The Axiom of Choice).
In , epimorphisms are exactly surjective homomorphisms.
Proof
Let . By [F1], each is surjective, so every fibre is nonempty. By [L2], choose with for every index . Then satisfies So is surjective, hence epic in .
This is exactly the AB4* condition of [L1]. Therefore, assuming the Axiom of Choice, satisfies AB4*.
A nonzero abelian category cannot satisfy both AB5 and AB5*
Statement
If an abelian category satisfies both AB5 and AB5*, then it is the zero category. Equivalently, no nonzero abelian category satisfies both axioms.
Facts & Assumptions
Given: An abelian category satisfying both AB5 and AB5*.
AB5 and AB5* are the directed-join and decreasing-meet distributivity laws of The axioms AB5 and AB5*.
An abelian category has zero objects, kernels, cokernels, and finite biproducts (Abelian category).
Proof
Suppose is a nonzero object. Let and , which exist by the AB3 and AB3* parts of [L1]. Let be the canonical map. For each , let be the tail subobject . Then is decreasing, because the product projections jointly detect morphisms, and because the finite head together with the tail generates all of . Applying AB5* to the family and the subobject gives .
For each , let be the finite partial sum . The family is directed and has join . Transport the product diagonal across the isomorphism from step 1.1, and let be its image. The diagonal is monic because each product projection composed with it is , so . But for every one has : a map factoring through both and has zero -st coproduct projection because it factors through , while through that same projection is the factor map itself, so the map is zero.
Applying AB5 to the directed family and the fixed subobject gives contradicting step 2.1. Therefore no nonzero object exists, so is the zero category.
Step 3.1 proves that satisfying both AB5 and AB5* forces the category to be zero, which is the contrapositive form of the theorem's second sentence.
Projective object
Definition
An object of an abelian category is projective when for every epimorphism and every morphism , there exists a morphism with
The lift need not be unique.
Projective object characterisations
Statement
For an object of an abelian category, the following are equivalent:
- is projective.
- For every short exact sequence the induced sequence is exact.
- Every epimorphism splits.
Facts & Assumptions
Given: An object in an abelian category.
Projectivity is the lifting property against epimorphisms (Projective object).
In an abelian category, the pullback of an epimorphism is an epimorphism (The pullback of an epimorphism is an epimorphism).
For every short exact sequence, the functor is left exact; projectivity is exactly the extra surjectivity at the right-hand end.
Proof
Assume is projective. Then [L1] gives a lift of every map across every epimorphism , so the last map in condition 2 is surjective. Together with the left exactness in [F1], this proves condition 2.
Condition 2 clearly implies condition 1, because surjectivity of for every short exact sequence is exactly the lifting property [L1].
If is projective and is epic, apply [L1] to . A lift with is a section, so splits.
Assume condition 3. Given an epimorphism and a map , form the pullback of along . By [L2], its projection to is epic, so condition 3 makes it split. Composing such a section with the other pullback leg gives a lift of across . Thus is projective.
Steps 1.1 and 1.2 prove , and steps 1.3 and 1.4 prove . Hence all three conditions are equivalent.
Injective object
Definition
An object of an abelian category is injective when for every monomorphism and every morphism , there exists a morphism with
The extension need not be unique.
Injective object characterisations
Statement
For an object of an abelian category, the following are equivalent:
- is injective.
- For every short exact sequence the induced sequence is exact.
- Every monomorphism splits.
Facts & Assumptions
Given: An object in an abelian category.
The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).
Projective objects are characterized by exactness of Hom and by splitting of epimorphisms onto them (Projective object characterisations).
Injectivity is the dual lifting property (Injective object).
Proof
By [L1], the opposite category is abelian. In that opposite category, the object is projective exactly when it is injective in , because monomorphisms and epimorphisms are exchanged.
Apply the projective characterization [L2] to inside . The exactness statement there becomes exactness of on short exact sequences in , and splitting of an epimorphism onto in the opposite category is splitting of a monomorphism out of in .
Therefore conditions 1, 2, and 3 are equivalent in .
A coproduct of projectives is projective and a product of injectives is injective
Statement
Assume an abelian category satisfies AB3 and AB3*.
- Every finite coproduct of projective objects is projective, and every finite product of injective objects is injective.
- For an arbitrary small family, the same conclusion holds provided one may choose one lift or one extension for each index in each lifting problem; in particular it holds under the Axiom of Choice.
Facts & Assumptions
Given: An abelian category satisfying AB3 and AB3*, and small families of projective objects and of injective objects.
AB3 and AB3* supply the required coproducts and products (The axioms AB3 and AB3*).
Projective objects are characterized by the lifting property against epimorphisms, and injective objects dually by the extension property against monomorphisms (Projective object characterisations, Injective object characterisations).
Proof
By [L1], let . Given an epimorphism and a morphism , write on the coproduct summands. Because each is projective, [L2] gives a lift of . For a finite family these lifts are chosen explicitly; for an arbitrary small family they are exactly the stated choice-dependent data. The coproduct universal property then assembles the into a lift , so is projective.
The injective claim is dual. By [L1], let . Given a monomorphism and a morphism , write . Each injective object admits an extension by [L2]. The product universal property assembles them into extending . So is injective.
Steps 1.1 and 1.2 prove the finite case without extra choice and the arbitrary small-family case with the stated choice boundary.
A direct summand of a projective is projective
Statement
Every direct summand of a projective object in an abelian category is projective.
Facts & Assumptions
Given: A projective object with a decomposition .
Projective objects are exactly those with the lifting property against epimorphisms (Projective object characterisations).
Proof
Let be epic and let be any morphism. Write and for the split inclusion and retraction, so . The composite lifts across by [L1] to a map .
Put . Then So has the lifting property against every epimorphism, hence is projective by [L1].
A category with enough projectives and with enough injectives
Definition
An abelian category has enough projectives when every object admits an epimorphism with projective (Projective object).
It has enough injectives when every object admits a monomorphism with injective (Injective object).
Module categories have enough projectives
Statement
Assume the Axiom of Choice. For every ring , the abelian category has enough projectives.
Facts & Assumptions
Given: A ring .
Every left -module is a quotient of a free left -module (Every module is a quotient of a free module).
Under the Axiom of Choice, free modules are projective (Equivalent characterizations of projective modules).
Having enough projectives means admitting a projective epimorphism onto every object (A category with enough projectives and with enough injectives).
Proof
Let be a left -module. By [L1], the canonical free module admits a surjection .
Under the Axiom of Choice, [L2] makes projective. So admits a projective epimorphism from step 1.1.
Since was arbitrary, [L3] shows that has enough projectives.
Module categories have enough injectives is already published
The module-specific injective theory is already published as Module categories have enough injectives and Baer's criterion for injective modules. The present page only records the general ambient definition A category with enough projectives and with enough injectives and does not claim the deeper theorem that every Grothendieck category has enough injectives.
A projective generator detects isomorphisms
Statement
Let be a projective generator of an abelian category. If
is an isomorphism for a morphism , then is an isomorphism.
Facts & Assumptions
Given: A projective generator and a morphism .
Projectivity makes exact on short exact sequences (Projective object characterisations).
A generator is equivalently an object whose canonical coproduct maps are epic (The cancellation and epimorphism descriptions of a generator agree).
Proof
Apply [L1] to the short exact sequences and . Since is an isomorphism, the first sequence forces and the second forces .
Let be any object with . By [L2], the canonical map is epic. But the indexing set is empty, so this is the zero map . An epic zero map forces . Applying this to the objects in step 1.1 gives .
Therefore is both monic and epic, hence an isomorphism in an abelian category.
5 · Examples, counterexamples and false statements
A subobject lattice of an abelian category need not be distributive
Statement refuted
Every subobject lattice of an object in an abelian category is distributive.
Facts & Assumptions
Given: The abelian group .
Subobject lattices in an abelian category are modular (The subobject lattice of an abelian category is modular).
A lattice is distributive when meet distributes over join (Lattices, distributive lattices, and order ideals).
Counterexample
The nonzero proper subgroups of are exactly the three one-dimensional subspaces For , the intersection is , and . So the subobject lattice of is the diamond .
Now while Hence the distributive law of [L2] fails in this subobject lattice. By [L1], the example is modular but not distributive.
Abelian groups do not satisfy AB5*
Statement refuted
The abelian category satisfies AB5*.
Facts & Assumptions
Given: The abelian group , the tail subgroups , and the direct sum .
AB5* is the decreasing-family identity (The axioms AB5 and AB5*).
Counterexample
The family is decreasing, and because a sequence whose every coordinate eventually vanishes from the front has all coordinates zero. Also , since the constant sequence lies in but not in the direct sum .
For every , the subgroup is all of : given , write where has the same first coordinates as and all later coordinates , while has first coordinates and later coordinates equal to those of . Then and . Hence So the AB5* identity [L1] fails in .
The opposite of abelian groups does not satisfy AB5
Statement refuted
The opposite category satisfies AB5.
Facts & Assumptions
Given: The abelian category .
The category does not satisfy AB5* (Abelian groups do not satisfy AB5*).
The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).
Counterexample
By [L2], the opposite category is again abelian. Passing to the opposite exchanges joins with meets and AB5 with AB5*.
If satisfied AB5, then would satisfy AB5*. This contradicts [L1]. Therefore does not satisfy AB5.
FALSE: every subobject lattice in an abelian category is distributive
Statement
Every subobject lattice in an abelian category is distributive.
Facts & Assumptions
Given: The object in .
The subobject lattice of this object is a concrete modular but non-distributive diamond (A subobject lattice of an abelian category need not be distributive).
Refutation
The example [L1] exhibits an object of an abelian category whose subobject lattice is not distributive.
Therefore the universal statement is false. In particular, modularity of subobject lattices does not imply distributivity.
FALSE: every abelian category has a generator
Statement
Every abelian category has a generator.
Facts & Assumptions
Given: The abelian category of finite abelian groups.
A generator must separate distinct morphisms by precomposition (Generator and cogenerator of a category).
An abelian category is a category with the usual additive exact structure (Abelian category).
Refutation
The category is abelian: kernels, cokernels, and finite biproducts of morphisms of finite abelian groups are again finite abelian groups. So [L2] applies to it.
Let be any finite abelian group. Choose a prime not dividing the exponent of . Then every homomorphism is zero. Hence the identity map and the zero map of cannot be separated by precomposition with any map from , so is not a generator by [L1]. Since was arbitrary, has no generator.
Thus not every abelian category has a generator.
FALSE: every object of an abelian category has a composition series
Statement
Every object of an abelian category has a composition series.
Facts & Assumptions
Given: The abelian group .
A composition series is a finite strict chain with simple successive quotients (Composition series and composition factors of an object).
Finite-length objects are exactly those admitting composition series (Object of finite length).
Refutation
Every nonzero subgroup of is of the form , hence is isomorphic to . So if a composition series existed, the first nonzero term would satisfy , and the first quotient would not be simple. This contradicts [L1].
Therefore has no composition series, so by [L2] it is not of finite length. The universal statement is false even in .
FALSE under the Axiom of Choice: AB4 implies AB5
Statement
Assume the Axiom of Choice. Then AB4 implies AB5.
Facts & Assumptions
Given: The Axiom of Choice and the opposite category .
The Axiom of Choice (The Axiom of Choice).
The category does not satisfy AB5 (The opposite of abelian groups does not satisfy AB5).
AB4 is the coproduct-monomorphism axiom (The axioms AB4 and AB4*).
Assuming the Axiom of Choice, satisfies AB4* (Assuming the Axiom of Choice, abelian groups satisfy AB4*).
The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).
Refutation
By [L4], the opposite category is abelian. Passing to the opposite exchanges AB4 with AB4*, so [L3] implies that satisfies AB4 in the sense of [L2].
But [L1] shows that does not satisfy AB5. So, even under [A1], AB4 does not imply AB5.
FALSE: a generator is automatically projective
Statement
A generator is the same thing as a projective generator.
Facts & Assumptions
Given: The abelian group for a prime .
Generators are defined by separation of morphisms (Generator and cogenerator of a category).
Direct summands of projectives are projective (A direct summand of a projective is projective).
Projective objects are the lifting objects of Projective object.
Refutation
The summand is a generator of , so is also a generator: precompose with the inclusion and then use the generator property of .
If were projective, then its direct summand would be projective by [L2]. But the quotient map does not split, so does not have the lifting property [L3]. Therefore is a generator that is not projective.
FALSE: Jordan-Holder needs finiteness only of the ambient category
Statement
The Jordan-Holder theorem needs a finiteness hypothesis only on the ambient category, not on the object.
Facts & Assumptions
Given: The abelian category and the objects and .
Jordan-Holder compares composition series of a single object (Jordan-Holder theorem in an abelian category).
Finite length is an objectwise condition (Object of finite length).
Refutation
The object has finite length, while by the previous false statement witness has no composition series and so is not of finite length. Both live in the same abelian category .
Therefore the relevant finiteness hypothesis is on the object whose composition series are being compared, not on the category alone. That is exactly how [L1] and [L2] are stated, so the displayed statement is false.
Sources
- Daniel Murfet, Abelian Categories, Section 4.1
- Daniel Murfet, Abelian Categories, Section 4.2
- Daniel Murfet, Abelian Categories, Proposition 73 and Corollary 72
- Saunders Mac Lane, Categories for the Working Mathematician, Section VIII.3
- Saunders Mac Lane, Categories for the Working Mathematician, Section V.7
- Pavel Etingof, Shlomo Gelaki, Dmitri Nikshych, and Victor Ostrik, Tensor Categories, Section 1.5
- Pavel Etingof, Shlomo Gelaki, Dmitri Nikshych, and Victor Ostrik, Tensor Categories, Definition 1.5.5
- Alexandre Grothendieck, Sur quelques points d'algèbre homologique, Barr translation, Section 1.9
- The Stacks Project, Tag 079B
- Charles A. Weibel, An Introduction to Homological Algebra, Appendix A.4
- Alexandre Grothendieck, Sur quelques points d'algèbre homologique, Barr translation, Proposition 1.9.1
- Carlos E. Parra, Manuel Saorin, and Simone Virili, Section 2.1 and Lemma 2.7
- Carlos E. Parra, Manuel Saorin, and Simone Virili, Lemma 2.7(2)
- Adnan Hashim Abdulwahid, Definitions 1.38 and 1.39
- Peter Freyd, Abelian Categories, Section 3.3
- Peter Freyd, Abelian Categories, Proposition 3.35
- Alexandre Grothendieck, Sur quelques points d'algèbre homologique, Barr translation, Section 1.5
- Charles A. Weibel, An Introduction to Homological Algebra, Exercise A.4.6
- Daniel Murfet, Abelian Categories, Section 2.3
- Alexandre Grothendieck, Sur quelques points d'algèbre homologique, Barr translation, Section 1.5 and 1.9
- Charles A. Weibel, An Introduction to Homological Algebra, Theorem 2.6.15 and Appendix A.4
- Charles A. Weibel, An Introduction to Homological Algebra, Exercise A.4.7
- Pavel Etingof, Shlomo Gelaki, Dmitri Nikshych, and Victor Ostrik, Tensor Categories, Definition 1.6.5
- Pavel Etingof, Shlomo Gelaki, Dmitri Nikshych, and Victor Ostrik, Tensor Categories, Section 1.6
- A. Kleshchev, Lectures on Abstract Algebra for Graduate Students, Sections 3.14 and 3.15