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.
A redundant four-term decomposition cleans up to
Example
In , the ideal
cleans up to the minimal decomposition
Facts & Assumptions
Given: The polynomial ring and the displayed decomposition of .
A finite primary decomposition can be stripped of redundant components (A finite primary decomposition can be stripped of redundant components).
In a finite primary decomposition of a submodule of a finitely generated module over a Noetherian commutative ring, equal-radical primary components can be combined into one primary component (Equal-radical primary components can be combined).
Verification
The ideal is prime because . The quotients and are local rings whose maximal ideals are square-zero, so every zero divisor is nilpotent. Hence and are -primary, while is -primary. Thus the displayed intersection is a primary decomposition.
Since , the factor is redundant, and the repeated copy of is redundant as well. Fact [L1] therefore cleans the four-term intersection down to
The two surviving radicals are and , already distinct. If one first combines the two equal-radical components and , [L2] replaces them by their intersection, which is again . Hence both cleanup orders lead to the same two-term presentation.
Finally, because an element in the intersection has the form with . The decomposition is irredundant: and . Together with the distinct radicals, this proves minimality.
This example isolates the two routine cleanup moves in a primary decomposition: deletion of redundant components and combination of equal radicals.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 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
- A. Altman and S. Kleiman, A Term of Commutative Algebra, 13th ed., §18 (standard reference, not scraped)
- J. S. Milne, A Primer of Commutative Algebra, v4.03, §19 (standard reference, not scraped)