Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Bounded above complexes admit projective replacements

Statement

If A has enough projectives and Xn=0 for n>b, there is a termwise epic quasi-isomorphism p:PX with each Pn projective and Pn=0 for n>b. Assume DC for the successive objectwise choices, or supply the successive projective epimorphisms. If only Hn(X)=0 for n>b, a quasi-isomorphism with this upper bound still exists, without the termwise-epic assertion.

Facts & Assumptions

Given: If A has enough projectives and Xn=0 for n>b, there is a termwise epic quasi-isomorphism p:PX with each Pn projective and Pn=0 for n>b. Assume DC for the successive objectwise choices, or supply the successive projective epimorphisms. If only Hn(X)=0 for n>b, a quasi-isomorphism with this upper bound still exists, without the termwise-epic assertion.

[F1]

Enough projectives means every object is a quotient of a projective (A category with enough projectives and with enough injectives).

[F2]

The pullback of an epimorphism in an abelian category is an epimorphism (The pullback of an epimorphism is an epimorphism).

[F3]
[F4]

Upper canonical truncation preserves cohomology through its cut and kills higher cohomology (Canonical truncation is a complex and has the claimed cohomology).

Proof

1.1

Start with Pj=0 for j>b; this includes X=0. At stage n maintain the complex and map in degrees jn, epic terms, an epimorphism Zn(P)Zn(X), and cohomology isomorphisms above n. The initial stage n=b+1 has these properties.

givenalgebra
2.1

Form E=Xn1×Zn(X)Zn(P), where Xn1Zn(X) is its differential. Choose a projective epimorphism Pn1E. Its two components define pn1 and dPn1, giving pndPn1=dXn1pn1 and dPndPn1=0. The projection EXn1 is epic by pullback stability, hence so is pn1.

F1F2step 1.1
3.1

The subobject of E with second coordinate zero is Zn1(X); its inverse image in Pn1 is exactly Zn1(P). Pullback stability therefore makes the map on cycles epic. Moreover the image of dPn1 is precisely the inverse image of Bn(X) inside Zn(P): this follows by pulling the epimorphism Xn1Bn(X) back along Zn(P)Zn(X). Consequently Hn(P)Hn(X) is an isomorphism. Higher degrees stay fixed.

F2step 2.1algebra
4.1

These stages have extensions at every step. For a definable class of possible object choices, first make a set of admissible partial constructions: starting with the initial node, bound ranks of extensions of each node by the least rank with an extension, use Replacement to bound these ranks over each set of nodes, and take all extensions within that bound. The union over the countably many stages is a set with an entire extension relation. DC gives a branch, or supplied epimorphisms give it directly. Every degree stabilizes after finitely many stages and step 3.1 proves that the resulting map is a quasi-isomorphism. This is objectwise existence, not a class-indexed replacement assignment.

F3step 2.1step 3.1
5.1

Under a cohomological upper bound, first replace X by τbX. Its natural map to X is a quasi-isomorphism; compose with the construction above. The kernel term at the cut explains why the composite need not be epic onto Xb.

F4step 4.1

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