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.
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.
Depends on
- Modular lattice
- The subobjects of an object in an abelian category form a lattice
- First isomorphism theorem in an abelian category
- Third isomorphism theorem in an abelian category
- An abelian category is balanced
- The join of two subobjects in an abelian category
- The meet of two subobjects is their pullback
Used by
Dependency tree · two levels
22 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Daniel Murfet, Abelian Categories, Proposition 73 and Corollary 72 (standard reference, not scraped)