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.
Depth at a prime is bounded by local support dimension
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be Noetherian, let be finite, and let . Then
Facts & Assumptions
Given: The Axiom of Choice; is a nonzero finite module over the Noetherian local ring .
A finite module has support , and under Choice a radical ideal is the intersection of its containing primes (For a finite module, support is the set of primes containing the annihilator, The radical of an ideal is the intersection of the prime ideals containing it).
In a Noetherian ring under the assumed AC, the radical of an ideal is the finite intersection of its minimal primes (A radical ideal in a Noetherian ring is a finite intersection of minimal primes).
Under AC, Nakayama shows that a nonzero finite local module remains nonzero after quotienting by an ideal in its maximal ideal (Assuming the Axiom of Choice, Nakayama's lemma).
The dimension of a nonzero finite local module is finite and equals the least length of a tuple in the maximal ideal making its quotient finite length (For a finite module, the dimension is the least size of an ideal of definition, and such tuples are systems of parameters).
Depth is the supremum of lengths of regular sequences in the maximal ideal, and each successive quotient of such a sequence is nonzero (Depth with respect to an ideal, Regular Sequence On A Module).
Proof
Put . Let be a nonzero finite -module and let lie in the maximal ideal and act injectively on . By [L3], . Localization and [L3] give : outside the quotient is zero, while at a support prime containing its localized nonzero finite module cannot equal its -multiple.
Let be minimal in . By [L1], it is minimal over . In the only support prime of is ; [L1] therefore makes . This maximal ideal is finitely generated, so some power annihilates . If , a power of multiplication by would be zero on the nonzero module , contradicting injectivity after localization. Hence no minimal support prime contains .
Take any strict chain in . Since contains , the finite minimal-prime decomposition [L2] gives a minimal support prime . Because but by step 2.1, this inclusion is strict. Prepending gives a chain of length in . Thus .
Conversely, by [L4] choose a parameter tuple of length for . Prepend . The resulting quotient of is the same finite-length module, so [L4] gives . Together with step 3.1, this shows that quotienting by an -regular element in the maximal ideal lowers support dimension by exactly one.
Starting with , take any regular sequence of length in the maximal ideal. Its successive quotients are nonzero by [L5], so step 4.1 applies times and shows . Taking the supremum over all regular sequences, exactly as depth is defined in [L5], proves the inequality. If the dimension is zero, only the empty regular sequence can occur, and both sides are zero.
Depends on
- The Axiom of Choice
- Depth with respect to an ideal
- Regular Sequence On A Module
- For a finite module, the dimension is the least size of an ideal of definition, and such tuples are systems of parameters
- For a finite module, support is the set of primes containing the annihilator
- The radical of an ideal is the intersection of the prime ideals containing it
- A radical ideal in a Noetherian ring is a finite intersection of minimal primes
- Assuming the Axiom of Choice, Nakayama's lemma
Used by
Dependency tree · two levels
25 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
- Depth and Cohen--Macaulay modules source treatment (standard reference, not scraped)