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.
Maximal regular sequences have a common Ext length
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be Noetherian, let be finite, and let lie in the Jacobson radical with . Every maximal -regular sequence in has length so all such sequences have the same length.
Facts & Assumptions
Given: The Axiom of Choice, the data in the statement, and a maximal -regular sequence in .
An -regular sequence has each multiplication map injective and a nonzero terminal quotient (Regular Sequence On A Module). Under AC, Nakayama makes for a nonzero finite quotient when is in the Jacobson radical (Assuming the Axiom of Choice, Nakayama's lemma).
Under AC, a maximal regular sequence with stops at an associated prime containing (A maximal regular sequence stops at an associated prime). An associated prime is the annihilator of a nonzero module element (Associated primes of a module).
Degree-zero Ext is (Ext degree zero identifies ideal-annihilated elements). A short exact sequence of second-variable modules gives a long exact Ext sequence (The long exact Ext sequence in the second variable).
Proof
Put for , so and . By [F1], is nonzero and finite, and . Maximality and [L1] give a prime containing . By the definition in [L1], some nonzero has , hence . Therefore is nonzero.
For , regularity gives . Write . Since annihilates , multiplication by on every is zero. The long exact sequence of [L2] therefore yields, for each , a short exact sequence . Moreover : an -annihilated element is killed by the injective multiplication map .
Suppose the first nonzero occurs in degree . Starting with , the sequences in step 1.2 show inductively that for , and at give . Thus the first nonzero degree rises by one when moving backwards across . Step 1.1 gives ; repeating this finite argument for gives . Hence the displayed Ext minimum equals the length of every maximal sequence, so all have the same length.
Depends on
Used by
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)