Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-26 (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.

auslander buchsbaum syzygy projective dimension

Statement

Let 0→K→F0→M→0 be the initial minimal presentation of a nonzero finite module over a nonzero Noetherian local ring. If 0<n=pd⁡M<∞, then K≠0 and pd⁡K=n−1.

Facts & Assumptions

Given: The initial minimal presentation in the Statement, with F0 finite free and 0<n=pd⁡RM<∞.

[F1]

Finite projective dimension n supplies a projective resolution of length n (Projective dimension of an object).

[F2]

For two projective presentations of the same module, their kernels satisfy K⊕P′≅K′⊕P (Schanuel's lemma in an abelian category).

[F3]

Finite modules over a Noetherian ring are Noetherian, so their submodules are finitely generated (Finitely generated modules over a left Noetherian ring are Noetherian, Noetherian modules: every submodule is finitely generated).

Proof

1.1F1F3givenchoosealgebra

If K=0, the given presentation identifies M with the free module F0, contradicting n>0. Thus K≠0. Fix a length-n projective resolution of M supplied by [F1]. Starting with the given F0→M, form its first n projective presentations by taking finite free surjections onto the successive kernels. Each kernel is finite by [F3]. Only finitely many choices are made, so no axiom of choice is needed. Write Kn for the final kernel; when n=1 it is K.

2.1F2step 1.1algebra

Compare these n presentations with the fixed length-n resolution using [F2]. At the first stage the two kernels become isomorphic after adding the other presentation's projective term. Present these stabilized kernels at the next stage by adding identity presentations on those projective summands, and apply [F2] again. Induction through the finite n stages gives Kn⊕A≅Pn⊕B, where Pn is the terminal projective of the length-n resolution and A,B are finite direct sums of its projective terms and the constructed finite free terms. Hence Kn is a direct summand of a projective module and is projective. Truncating the constructed sequence therefore gives a length-(n−1) projective resolution of K. Thus pd⁡RK≤n−1.

3.1F1step 1.1step 2.1algebra∎

If n≥2 and pd⁡RK≤n−2, splicing such a shorter resolution with 0→K→F0→M→0 gives a resolution of M of length at most n−1, contradicting [F1] and pd⁡RM=n. For n=1, step 2.1 already makes K projective, so its projective dimension is zero. In every case K≠0 and pd⁡RK=n−1.

Depends on

Used by

Dependency tree · two levels

16 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