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

auslander buchsbaum formula

Statement

Assume the Axiom of Choice (The Axiom of Choice). For a nonzero finite module M of finite projective dimension over a nonzero Noetherian local ring R, pd⁡RM+depth⁡RM=depth⁡R. Consequently such an M with depth⁡M=depth⁡R is free.

Facts & Assumptions

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

[F1]

auslander buchsbaum base case free module: If a nonzero finite module M over a nonzero Noetherian local ring R has projective dimension zero, then it is finite free of positive rank and depth⁡RM=depth⁡R.

[F2]

auslander buchsbaum projective dimension one: If M is a nonzero finite module of projective dimension one over a nonzero Noetherian local ring R, then depth⁡R≥1 and depth⁡M=depth⁡R−1.

[F3]

auslander buchsbaum syzygy projective dimension: 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.

[F4]

auslander buchsbaum first syzygy depth: In a minimal presentation 0→K→F→M→0 of a nonzero finite module over a nonzero Noetherian local ring, let n=pd⁡M≥2 be finite. If depth⁡K=depth⁡R−(n−1), then depth⁡M=depth⁡K−1.

Proof

1.1F1F2

Induct on n=pd⁡M. For n=0 the module is nonzero finite free and has the ring depth. For n=1 the separate minimal-matrix argument proves the formula.

2.1F3F4step 1.1

For n≥2, take the first syzygy K in a minimal presentation. It is nonzero finite with projective dimension n−1, so the inductive assertion gives depth⁡K=depth⁡R−(n−1). The conditional syzygy-depth lemma then gives depth⁡M=depth⁡R−n. This completes the induction.

3.1F1step 2.1algebra∎

If depth⁡M=depth⁡R, the formula forces projective dimension zero, and the base-case theorem gives freeness. The nonzero and finite-projective-dimension hypotheses are retained throughout.

Depends on

Used by

Dependency tree · two levels

19 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