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

Extending a partial comparison map by one degree

Statement

Let u:AB be a morphism, and let PA and QB be projective resolutions. Suppose morphisms f0,,fn have already been chosen so that the augmentation condition holds and the chain-map squares commute through degree n. Then there exists fn+1:Pn+1Qn+1 making the next square commute as well.

Facts & Assumptions

Given: Projective resolutions PA and QB, a morphism u:AB, and a partial comparison map through degree n.

[L1]

A projective resolution is exact, so at degree n its cycle object is the image of the next differential (Projective resolutions in an abelian category).

[L2]

The nth cycle object is the kernel of the degree-n differential (Cycle and boundary subobjects of a complex).

[L3]

Projective objects lift across epimorphisms (Projective object).

Proof

technique · direct
1.1

If n=0, the augmentation identity gives εQf0d1P=uεPd1P=0, so f0d1P lands in ker(εQ)=Z0(Q). If n>0, the previous squares commute and dnQfndn+1P=fn1dnPdn+1P=0, so again fndn+1P lands in Zn(Q)=ker(dnQ) by [L2]. Exactness of Q at degree n makes the canonical map Qn+1Zn(Q) epic by [L1].

L1L2givenalgebra
2.1

The object Pn+1 is projective, so [L3] lifts fndn+1P:Pn+1Zn(Q) across the epimorphism Qn+1Zn(Q). Writing the lift as fn+1 gives dn+1Qfn+1=fndn+1P, so the partial comparison map extends by one degree.

L3step 1.1construct

Depends on

Used by

Dependency tree · two levels

12 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