Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06
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.

Projective dimension at most n iff higher Ext vanishes

Statement

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 n≥0. The following are equivalent:

  1. pd⁡(M)≤n;
  2. Ext⁡k(M,N)=0 for every object N and every k>n;
  3. Ext⁡n+1(M,N)=0 for every object N.

Facts & Assumptions

Given: The stated category and resolution data, an object M, and n∈N0.

[L1]

For r≥1, projective dimension at most r is equivalent to projectivity of the rth syzygy (Projective dimension at most n iff the nth syzygy is projective).

[L2]

First-variable dimension shifting identifies the positive-degree Ext of a syzygy with the corresponding higher Ext of the original object (Ext dimension shifting in the first variable).

[L3]

Positive Ext out of a projective object vanishes (Positive projective-resolution Ext vanishes on a projective first variable).

[L4]

Direct summands of projective objects are projective (Projective object characterisations).

[L5]

Projective-resolution Ext is the cohomology of the associated Hom complex (Ext via a projective resolution of the first variable).

Proof

technique · direct
1.1L1L2L3givenalgebra

Assume pd⁡(M)≤n. If n=0, then M is projective and positive Ext vanishes by [L3]. If n≥1, [L1] makes the nth syzygy projective, and repeated [L2] identifies every Ext⁡k(M,N) with k>n with a positive-degree Ext group out of that syzygy, which vanishes by [L3]. Thus (1) implies (2), and (2) implies (3) by taking k=n+1.

2.1L1L2L4L5givenstep 1.1algebra∎

Conversely, assume (3). For n≥1, [L2] gives Ext⁡1(ΩnM,N)=0 for every N; for n=0, read Ω0M here as M. To see directly that an object X with Ext⁡1(X,−)=0 is projective, take the first stage 0→K→iP0→X→0 of a projective resolution and factor d1:P1→P0 as P1→πK→iP0. The map π is a cocycle representing the identity of K in the usual cokernel description of Ext⁡1(X,K). By [L5] and the assumed vanishing, π=rd1=riπ for some r:P0→K. Since π is epic, ri=1K, so the sequence splits and [L4] makes X projective. Apply this to X=ΩnM (or X=M when n=0), and use [L1] when n≥1, to prove pd⁡(M)≤n.

Depends on

Used by

Dependency tree · two levels

22 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