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.
Over a PID, injective modules are exactly divisible modules
Statement
Assume the Axiom of Choice through Baer's criterion. Over a principal ideal domain , a module is injective if and only if it is divisible. In particular, an abelian group is an injective -module if and only if it is divisible.
The implication from injective to divisible is choice-free; the converse inherits the Zorn-lemma use in Baer's criterion.
Facts & Assumptions
Given: A principal ideal domain and an -module .
Divisibility means that for every and , some satisfies (Divisible modules over an integral domain).
Every ideal of a PID is principal, and a PID is an integral domain (Principal ideal domain).
Under AC, a module is injective exactly when maps from left ideals extend to (Baer's criterion for injective modules).
Proof
Suppose is injective. For and , define by . This is well defined because is a domain, and injectivity extends it to .
Conversely, suppose is divisible and let be a homomorphism from an ideal. By [F2], . If , and the zero map extends ; if , put and choose with by [F1].
With , one has , so is divisible by [F1].
The homomorphism defined by satisfies , so it extends . Baer's criterion [L1] therefore makes injective.
Steps 1.1 and 2.1 prove that injective modules are divisible, while steps 1.2 and 2.2 prove that divisible modules are injective. Since is a PID and its modules are abelian groups, the specialization follows.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 23 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)