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.
Downward-closed intersections of primary components are intrinsic
Statement
Assume the Axiom of Choice.
Let be a Noetherian commutative ring, let be a finitely generated left -module, and let
be a minimal primary decomposition with each -primary for a prime ideal . Let be downward-closed under inclusion. Then
depends only on and on , not on the chosen minimal decomposition. When , the empty intersection is interpreted as .
Facts & Assumptions
Given: The Axiom of Choice, a Noetherian commutative ring , a finitely generated left -module , a submodule , and a minimal primary decomposition with each -primary for a prime ideal .
In the Noetherian finite-module setting, a minimal primary decomposition whose component radicals are prime has radical set (The radicals in a minimal primary decomposition are intrinsic).
Assuming the Axiom of Choice, in the Noetherian finite-module setting, localizing a primary component away from its prime radical keeps it, while localizing at a set meeting its radical turns it into the whole localized module (Localisation of a primary submodule either stays primary or becomes the whole module).
In the Noetherian finite-module setting, a primary component with prime radical is recovered by contracting its localization at a multiplicative set disjoint from that radical (A primary component is recovered by contracting its localization away from the radical).
Localisation commutes with finite intersections of submodules (Localisation commutes with finite intersections of submodules).
If an ideal is contained in a finite union of prime ideals, then it lies in one of them (An ideal contained in a finite union of prime ideals lies in one of them).
For a multiplicative subset , the canonical localization map is , (Localisation of a module at a multiplicative subset).
Proof
Let be downward-closed, and set Because the members of are prime, is multiplicative. If , then by definition. If and , then , so [L5] forces for some . Since by [L1] and is downward-closed, this would imply , a contradiction. Hence
By [L4], For , step 1.1 and [L2] say that remains a proper localized primary component. For , step 1.1 and [L2] give . Therefore When , the right-hand side is the empty intersection , which matches the fact that and hence .
Let be the canonical map of [L6]. Contracting the equality of step 2.1 back to gives because inverse image commutes with intersections. For every , step 1.1 and [L3] identify with . Hence
The left-hand side of step 3.1 depends only on and the set , hence only on and on . By [L1], any other minimal primary decomposition has the same associated-prime set, so it yields the same and therefore the same intersection.
Thus the intersection of the primary components indexed by any downward-closed subset of is intrinsic.
Depends on
- The Axiom of Choice
- Localisation of a module at a multiplicative subset
- The radicals in a minimal primary decomposition are intrinsic
- Localisation of a primary submodule either stays primary or becomes the whole module
- A primary component is recovered by contracting its localization away from the radical
- Localisation commutes with finite intersections of submodules
- An ideal contained in a finite union of prime ideals lies in one of them
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
19 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., Theorem (18.25) (standard reference, not scraped)
- J. S. Milne, A Primer of Commutative Algebra, v4.03, Theorem 19.10 and isolated-component discussion (standard reference, not scraped)