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.
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].
Depends on
Used by
- Inverse image preserves meets and direct image preserves joins Corollary
- Images and preimages of submodules form a concrete Galois connection Example
Cited to discharge well-definedness by Direct and inverse image of a subobject.
Dependency tree · two levels
11 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
- Saunders Mac Lane, Categories for the Working Mathematician, Section V.7 (standard reference, not scraped)