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 — Examples
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
- 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
- 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
- Subobject Lattices Generators and the Grothendieck Axioms
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Universal Properties, Representables and the Yoneda Lemma
2 · Summary
These examples keep the A-page abstractions visible. The two subobject-lattice examples show both sides of the modularity story: a tame divisor lattice for and the diamond already present in . The module examples spell out the Galois connection, composition-factor bookkeeping, the generator role of the ring itself, and the AB5 lattice identity on an explicit directed chain.
The counterexample on finite abelian groups isolates a separate warning. An abelian category can be perfectly concrete and still have no nonzero projective objects at all, so "has a generator", "has enough projectives", and "projective generator" are genuinely different hypotheses.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The subobject lattice of a cyclic group of order twelve
Example
For the cyclic group , subgroups correspond to divisors of . The meet of two subgroups is their intersection, corresponding to the gcd of the two orders, and the join is their sum, corresponding to the lcm. In particular this subobject lattice is distributive, unlike the witness on the A page.
Facts & Assumptions
Given: The cyclic group .
Subobjects of an abelian-category object form a lattice (The subobjects of an object in an abelian category form a lattice).
Such lattices are modular (The subobject lattice of an abelian category is modular).
Verification
For each divisor of , the cyclic group has a unique subgroup of order , namely . So the subgroup lattice is the divisor lattice of with elements of orders . The meet is intersection, hence gcd of orders, and the join is subgroup sum, hence lcm of orders.
The divisor lattice of a single integer is distributive, so this example is more rigid than the modular-only situation of [L2]. It therefore illustrates that modularity does not force every concrete subobject lattice to look like the example.
The subobject lattice of a two-dimensional vector space over F_2 is the diamond M_3
Example
Let . Its subspaces are , the three lines through the origin, and itself. So the subobject lattice of in is exactly the diamond .
Facts & Assumptions
Given: The vector space .
Subobjects form a lattice in every abelian category (The subobjects of an object in an abelian category form a lattice).
The A-page counterexample identifies the same diamond pattern as non-distributive (A subobject lattice of an abelian category need not be distributive).
Verification
Over , the nonzero vectors of are , , and , and each spans a distinct one-dimensional subspace. Any two distinct lines meet only in , and because they are not equal each pair spans all of . So the subspace lattice has exactly the five elements , the three lines, and .
This is the same five-element diamond described in [L2]. Hence the subobject lattice of a very familiar module can already be modular without being distributive.
Images and preimages of submodules form a concrete Galois connection
Example
Let be reduction modulo . Then direct images and inverse images of submodules are the familiar image and preimage operations on subgroups, and they satisfy the Galois-connection inequality .
Facts & Assumptions
Given: The homomorphism .
Direct and inverse images form a Galois connection (Direct and inverse image of subobjects form a Galois connection).
Inverse images preserve meets and direct images preserve joins (Inverse image preserves meets and direct image preserves joins).
Kernels and ordinary images are the special cases of inverse and direct images (Kernel and image are the inverse and direct images along a morphism).
Verification
For the subgroup , the direct image is . For the subgroup , the inverse image is . Also [L3] identifies and .
Thus and are the same true statement in this example, exactly as [L1] predicts. Likewise [L2] is visible here: the meet of with pulls back to , and the join of with pushes forward to .
Two composition series of Z/12 refine to the same simple factors
Example
In the -module , the chains
are two composition series. Their successive factors are and , so the same simple factors occur up to permutation.
Facts & Assumptions
Given: The module .
The butterfly lemma is the cell-by-cell quotient comparison behind refinements (Zassenhaus butterfly lemma in an abelian category).
Any two finite subobject chains admit equivalent refinements (Schreier refinement theorem in an abelian category).
Jordan-Holder identifies the factor multiset up to permutation (Jordan-Holder theorem in an abelian category).
Verification
The subgroup has order and has order , while has order . Likewise has order , has order , and the top quotient is again order . So both displayed chains are composition series.
The two series already display the same three simple factors up to permutation, which is the conclusion predicted abstractly by [L2] and [L3]. This is the concrete module calculation that the categorical refinement theorems package.
The ring R is a generator of R-Mod
Example
For any ring and left -module , a homomorphism is determined by the image of . So the canonical coproduct of one copy of for each element of maps onto , which is the concrete generator criterion.
Facts & Assumptions
Given: A ring and a left -module .
The canonical coproduct map criterion characterizes generators in AB3 (The cancellation and epimorphism descriptions of a generator agree).
Module categories are Grothendieck categories, hence in particular have such a generator (Module categories are Grothendieck categories).
Verification
Every module homomorphism is determined by , and every element defines a homomorphism . Therefore the canonical map that sends the -indexed basis vector to is surjective.
By [L1], this surjectivity is exactly the generator property for , and [L2] records the same conclusion abstractly at the category level.
The abelian category of finite abelian groups has no nonzero projective object
Statement refuted
Every abelian category has a nonzero projective object.
Facts & Assumptions
Given: The abelian category of finite abelian groups.
Projective objects are exactly those for which every epimorphism onto them splits (Projective object characterisations).
Enough projectives would require, in particular, some nonzero projective object (A category with enough projectives and with enough injectives).
Counterexample
The category is abelian: kernels, cokernels, and finite biproducts of homomorphisms of finite abelian groups are again finite abelian groups. Let be a nonzero finite abelian group, and fix a prime for which has a nonzero -primary quotient. Among all cyclic quotients of of the form , choose one with maximal , say .
Let be the canonical quotient map. If were projective, [L1] would lift to with . Since is surjective, so is . Thus would be a quotient of , contradicting maximality of . Therefore no nonzero object of is projective. So is an abelian category with no nonzero projective object.
A directed union of subgroups distributes over intersection with a fixed subgroup
Example
Let , let , and let . Then is directed, , and
This is the AB5 lattice identity in a concrete module calculation.
Facts & Assumptions
Given: The subgroup chain and the fixed subgroup displayed in the statement.
AB5 is the directed-join distributivity law for subobjects (The axioms AB5 and AB5*).
Module categories are Grothendieck, hence satisfy AB5 (Module categories are Grothendieck categories).
Verification
The subgroups are directed by inclusion and their union is all of , since every element of has finite support. Also for , because those are exactly the generators of lying in the first coordinates.
Taking the union of the intersections from step 1.1 recovers all of , so This is precisely the AB5 identity [L1], exactly as the abstract theorem [L2] predicts for module categories.
The finite abelian group Z/12 has length three
Example
The abelian group has finite length . For the subobject , one has and , so the additivity formula reads .
Facts & Assumptions
Given: The abelian group and its subgroup .
Jordan-Holder makes the length independent of the chosen composition series (Jordan-Holder theorem in an abelian category).
Finite length and length are the notions of Object of finite length.
Length is additive along a subobject (Length is additive along a subobject).
Verification
The chain is a composition series of , so has finite length and by [L1] and [L2]. The subgroup has composition series , so , while has length .
The numerical identity becomes in this case, exactly as [L3] asserts.
Sources
- Daniel Murfet, Abelian Categories, Section 4.2
- Saunders Mac Lane, Categories for the Working Mathematician, Section VIII.3
- Pavel Etingof, Shlomo Gelaki, Dmitri Nikshych, and Victor Ostrik, Tensor Categories, Section 1.5
- Alexandre Grothendieck, Sur quelques points d'algèbre homologique, Barr translation, Section 1.9
- Charles A. Weibel, An Introduction to Homological Algebra, Appendix A.4
- Alexandre Grothendieck, Sur quelques points d'algèbre homologique, Barr translation, Section 1.5