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.
Equivalent characterizations of injective modules
Statement
For a left -module , the following are equivalent:
- is injective;
- every short exact sequence splits;
- takes every short exact sequence to a short exact sequence.
These equivalences use no choice principle.
Facts & Assumptions
Given: A left -module .
Injectivity is the extension property along every module monomorphism (Injective modules and the extension property).
A short exact sequence splits exactly when its monomorphism has a retraction (The splitting lemma for short exact sequences of modules).
Applying to an exact sequence gives an exact sequence (Covariant and contravariant are left exact).
Quotient modules have the usual coset operations (Quotient module with scalar multiplication on additive cosets).
Proof
If is injective and is short exact, extend along using [F1]. The extension is a retraction, so [L1] makes the sequence split.
Conversely, assume every short exact sequence beginning in splits. Given a monomorphism and , let and .
If is injective, every map extends across the monomorphism in a short exact sequence , so the final precomposition map in [L2] is surjective; hence is exact.
Conversely, if takes short exact sequences to short exact sequences, apply it to . Surjectivity of extends every across , so [F1] makes injective.
The map , , is injective: if , injectivity of gives and . Hence is short exact and splits by hypothesis; let retract .
Define by . In , , so . Thus is injective by [F1].
Steps 1.1, 1.2, 2.1, and 3.1 prove , while steps 1.3 and 1.4 prove .
Depends on
Used by
- Every short exact sequence of modules splits False statement
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 27 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- A. Kleshchev, Lectures on Abstract Algebra for Graduate Students, sections 3.6, 3.14, and 3.15 (standard reference, not scraped)
- The Stacks Project, Algebra (standard reference, not scraped)
- P. Hekmati, Homological Algebra, section 3.1 (standard reference, not scraped)