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.
Finite direct sums preserve and reflect Noetherian and Artinian conditions
Statement
A finite direct sum is Noetherian if and only if every summand is Noetherian, and it is Artinian if and only if every summand is Artinian. The empty direct sum is included. See Noetherian and Artinian conditions are each exact in short exact sequences.
Facts & Assumptions
Given: The hypotheses and objects in the Statement.
In a short exact sequence , the module is Noetherian if and only if and are Noetherian; the same equivalence holds with “Artinian” in place of “Noetherian”. (Noetherian and Artinian conditions are each exact in short exact sequences).
Let be a unital ring and a family of left -modules (def-left-and-right-modules). Their direct product is the module with coordinatewise operations. The support of is , and the direct sum is the submodule (def-submodule). (The direct sum of an indexed family of modules).
Proof
Induct on the number of summands using the split short exact sequence for a binary direct sum.
Reflection follows because every summand is a submodule and a quotient.
Both extremes of the induction are admitted. The empty direct sum is the zero module, whose only chains of submodules are constant, so it satisfies both conditions while the "every summand" side is vacuously true; a single summand makes the direct sum that summand, so the equivalence is an identity and supplies the base of the induction in step 1.1. This proves the stated claim.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 22 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
- William Crawley-Boevey, Noncommutative Algebra, Chapter 1 Sections 1.1-1.9 (standard reference, not scraped)