Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

residue field splits off reduced maximal ideal

Statement

Let (R,m,k) be nonzero Noetherian local and xmm2 a nonzerodivisor. Over S=R/(x) the sequence 0(x)/(xm)m/xmm/(x)0 splits, and (x)/(xm)k. Consequently finite pdRk implies finite pdSk.

Facts & Assumptions

Given: The objects and hypotheses in the statement. We work with the Axiom of Choice; cited dependent-choice and resolution-existence hypotheses are retained.

[F1]

regular element reduction preserves minimal resolution: Let (R,m,k) be nonzero Noetherian local, let M be a nonzero finite module, and let xm be a nonzerodivisor on both R and M. Reducing a minimal free resolution of M modulo x gives a minimal free resolution of M/xM over S=R/(x). Moreover pdS(M/xM)=pdRM, including infinity. For M=0 the zero-complex assertion also holds, with both projective dimensions zero.

[F2]

auslander buchsbaum syzygy projective dimension: Let 0KF0M0 be the initial minimal presentation of a nonzero finite module over a nonzero Noetherian local ring. If 0<n=pdM<, then K0 and pdK=n1.

[F3]

Projective dimension at most n iff higher Ext vanishes: Assume the Axiom of Dependent Choice. In an abelian category with enough projectives and enough injectives, fix supplied projective and injective resolution data on all objects. Let M be an object and n0. The following are equivalent: 1. pd(M)n; 2. Extk(M,N)=0 for every object N and every k>n; 3. Extn+1(M,N)=0 for every object N.

Proof

1.1

The sequence is the quotient sequence for xm(x)m; x kills every term. Multiplication by x identifies R/m with (x)/(xm) because cancellation is valid. Choose a k-linear functional on m/m2 taking the class of x to 1. Composing with m/xmm/m2 gives an S-linear retraction onto k. Thus the sequence splits.

givenalgebra
2.1

If pdRk is finite, it is positive: projectivity of k would split Rk, giving a nontrivial idempotent unless m=0, impossible here. Its first minimal syzygy m therefore has finite projective dimension. The element x acts injectively on this ideal, so reduction gives finite pdS(m/xm). Ext is additive on a finite direct sum, and the Ext criterion shows that its summand k has finite projective dimension.

F2F1F3step 1.1

Depends on

Used by

Dependency tree · two levels

14 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