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

Left derived maps preserve identities

Statement

Assume the Axiom of Dependent Choice.

Let P be a supplied projective resolution datum on a class D and F:AB an additive functor between abelian categories. For every object AD and every nZ, LnPF(1A)=1LnPF(A).

Facts & Assumptions

Given: An object AD and an integer n.

[L1]

The map LnPF(1A) is defined from any comparison lift of the identity on the chosen resolution of A (The left derived map relative to supplied resolution data).

[L2]

Any comparison map lifting 1A is homotopic to the identity chain map (Comparison of the identity is homotopic to the identity).

[L3]

Homology sends the identity chain map to the identity and respects composition (Homology respects identities and composition).

Proof

technique · direct
1.1

Let 1~ be any comparison lift of 1A used in [L1]. By [L2], 1~ is homotopic to the identity chain map on the chosen projective resolution of A.

L1L2given
2.1

Applying F preserves that homotopy relation as in the construction of the left derived map, so the induced map on homology agrees with the map from the identity chain map. By [L3], that latter map is 1LnPF(A). Therefore LnPF(1A)=1LnPF(A).

L3step 1.1algebra

Depends on

Used by

Dependency tree · two levels

10 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