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 as the first nonzero Ext degree
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be Noetherian, let be finite, and let lie in the Jacobson radical. Then where the infimum of the empty set is .
Facts & Assumptions
Given: The Axiom of Choice and the ring, module, and ideal in the statement.
Nakayama's lemma gives for finite and (Assuming the Axiom of Choice, Nakayama's lemma). Degree-zero Ext is (Ext degree zero identifies ideal-annihilated elements).
When and , the regular-element criterion and finite prime avoidance give an -regular if no associated prime of contains (A regular element exists by prime avoidance). Short exact sequences give the long exact Ext sequence (The long exact Ext sequence in the second variable).
Proof
If , [F1] makes . Its depth is infinite by definition and every displayed Ext group vanishes. Hence assume and . Write and . If , a nonzero element of is killed by every , so no -regular element exists in and depth is zero.
Suppose , allowing . Then . If an associated prime contained , its nonzero associated element would belong to , a contradiction. By [L1], choose an -regular and put . Applying to , multiplication by on each is zero because annihilates . Thus is exact for every . If , the first nonzero degree for is ; if , every vanishes.
Induct on finite . The case is step 1.1. For , step 1.2 and induction give an -regular sequence of length , so prepending gives an -regular sequence of length . Conversely, for any -regular first element , the same argument gives first nonzero Ext degree on ; induction bounds every sequence beginning with by . Therefore . If , step 1.2 applies successively to every nonzero quotient and keeps all its Ext groups zero; finite induction constructs regular sequences of every length. Their supremum, hence depth, is .
Depends on
Used by
- Depth depends only on the radical of the ideal Corollary
- auslander buchsbaum projective dimension one Lemma
- Completion reflects depth Lemma
- Depth drops by one after quotienting by a regular element Lemma
- The left lower bound in the Depth Lemma Lemma
- The middle lower bound in the Depth Lemma Lemma
- The right lower bound in the Depth Lemma Lemma
- Depth equals the maximal regular-sequence length Theorem
Dependency tree · two levels
17 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)