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.
Baer's criterion for injective modules
Statement
Assume the Axiom of Choice. A left -module is injective if and only if every homomorphism from a left ideal extends to a homomorphism .
The forward implication is choice-free. The converse uses AC through Zorn's lemma.
Facts & Assumptions
Given: A unital ring and a left -module .
Injectivity is extension of homomorphisms along every module monomorphism (Injective modules and the extension property).
Under AC, every nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma, The Axiom of Choice).
Proof
If is injective, apply [F1] to the inclusion of any left ideal to extend each to .
Conversely, assume the ideal-extension condition. Given a submodule and a homomorphism , let be the poset of extensions with , ordered by further extension. It is nonempty because .
The union of a chain of compatible extensions is a submodule and carries the unique map agreeing with every map in the chain, so it is an upper bound. By [L1], choose a maximal extension .
If , choose and put , a left ideal. The map , , is -linear and by hypothesis extends to . Put .
Define by . If , then , so and ; hence the formula is well defined. It is linear and extends .
Since , the domain strictly contains , contradicting maximality. Thus , so extends to and is injective by [F1].
Steps 1.1 and 5.1 prove both directions, with Zorn used only in the converse.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 21 results over 6 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)