Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-23 (gpt-6-sol)
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 R be Noetherian, let M be finite, and let I lie in the Jacobson radical. Then depth⁡I(M)=inf⁡{i≥0:Ext⁡Ri(R/I,M)≠0}, where the infimum of the empty set is ∞.

Facts & Assumptions

Given: The Axiom of Choice and the ring, module, and ideal in the statement.

[F1]

Nakayama's lemma gives IM=M⇒M=0 for finite M and I⊆J(R) (Assuming the Axiom of Choice, Nakayama's lemma). Degree-zero Ext is (0:MI) (Ext degree zero identifies ideal-annihilated elements).

[L1]

When M≠0 and IM≠M, the regular-element criterion and finite prime avoidance give an M-regular x∈I if no associated prime of M contains I (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

technique · direct
1.1F1given

If IM=M, [F1] makes M=0. Its depth is infinite by definition and every displayed Ext group vanishes. Hence assume M≠0 and IM≠M. Write Ei(T)=Ext⁡Ri(R/I,T) and d=inf⁡{i:Ei(M)≠0}. If d=0, a nonzero element of E0(M)=(0:MI) is killed by every x∈I, so no M-regular element exists in I and depth is zero.

1.2F1L1

Suppose d>0, allowing d=∞. Then E0(M)=0. If an associated prime p=Ann⁡R(m) contained I, its nonzero associated element m would belong to (0:MI), a contradiction. By [L1], choose an M-regular x∈I and put Q=M/xM≠0. Applying E∗(−) to 0→M→xM→Q→0, multiplication by x on each Ei(M) is zero because x annihilates R/I. Thus 0→Ei(M)→Ei(Q)→Ei+1(M)→0 is exact for every i≥0. If d<∞, the first nonzero degree for Q is d−1; if d=∞, every Ei(Q) vanishes.

2.1step 1.1step 1.2∎

Induct on finite d. The case d=0 is step 1.1. For d>0, step 1.2 and induction give an M/xM-regular sequence of length d−1, so prepending x gives an M-regular sequence of length d. Conversely, for any M-regular first element y∈I, the same argument gives first nonzero Ext degree d−1 on M/yM; induction bounds every sequence beginning with y by d. Therefore depth⁡I(M)=d. If d=∞, 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

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