Alphabeta Math
LemmaStatement: 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.

Maximal regular sequences have a common Ext length

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let R be Noetherian, let M≠0 be finite, and let I lie in the Jacobson radical with IM≠M. Every maximal M-regular sequence in I has length min⁡{i≥0:Ext⁡Ri(R/I,M)≠0}, so all such sequences have the same length.

Facts & Assumptions

Given: The Axiom of Choice, the data in the statement, and a maximal M-regular sequence x=(x1,…,xr) in I.

[F1]

An M-regular sequence has each multiplication map injective and a nonzero terminal quotient (Regular Sequence On A Module). Under AC, Nakayama makes IQ≠Q for a nonzero finite quotient Q when I is in the Jacobson radical (Assuming the Axiom of Choice, Nakayama's lemma).

[L1]

Under AC, a maximal regular sequence with IQ≠Q stops at an associated prime containing I (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).

[L2]

Degree-zero Ext is Hom⁡R(R/I,Q)≅(0:QI) (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

technique · direct
1.1F1L1L2

Put Mj=M/(x1,…,xj)M for 0≤j≤r, so M0=M and Q=Mr. By [F1], Q is nonzero and finite, and IQ≠Q. Maximality and [L1] give a prime p∈Ass⁡R(Q) containing I. By the definition in [L1], some nonzero q∈Q has Ann⁡R(q)=p, hence Iq=0. Therefore E0(Q):=Ext⁡R0(R/I,Q)≅(0:QI) is nonzero.

1.2F1L2

For 1≤j≤r, regularity gives 0→Mj−1→xjMj−1→Mj→0. Write Ei(T)=Ext⁡Ri(R/I,T). Since xj∈I annihilates R/I, multiplication by xj on every Ei(Mj−1) is zero. The long exact sequence of [L2] therefore yields, for each i≥0, a short exact sequence 0→Ei(Mj−1)→Ei(Mj)→Ei+1(Mj−1)→0. Moreover E0(Mj−1)=(0:Mj−1I)=0: an I-annihilated element is killed by the injective multiplication map xj.

2.1step 1.1step 1.2∎

Suppose the first nonzero Ei(Mj) occurs in degree dj. Starting with E0(Mj−1)=0, the sequences in step 1.2 show inductively that Ei(Mj−1)=0 for 0≤i≤dj, and at i=dj give Edj+1(Mj−1)≅Edj(Mj)≠0. Thus the first nonzero degree rises by one when moving backwards across xj. Step 1.1 gives dr=0; repeating this finite argument for j=r,r−1,…,1 gives d0=r. 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