Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passaudited 2026-08-31
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.

The quotient of the mapping cylinder by its source is the mapping cone

Statement

Let i:CCyl(f) be the source inclusion of the mapping cylinder. Then the cokernel complex of i is canonically isomorphic to Cone(f).

Facts & Assumptions

Given: A chain map f:CD.

[L1]

The source inclusion is in(x)=(x,0,0) and Cyl(f)n=CnDnCn1 (The mapping cylinder of a chain map).

[L2]

Cokernels of chain maps are computed degreewise (The cokernel of a chain map is computed degreewise).

[L3]

The cone differential is dnCone(f)(y,z)=(dnD(y)+fn1(z),dn1C(z)) (The mapping cone of a chain map).

Proof

technique · direct
1.1

In degree n, [L1] identifies in with the inclusion of the first summand. Therefore [L2] identifies coker(in) with DnCn1 via θn([(x,y,z)]):=(y,z). Under this identification the induced differential is (y,z)(dnD(y)fn1(z),dn1C(z)), which is the cone differential for the chain map f.

L1L2givenconstructalgebra
2.1

The sign map σn:DnCn1DnCn1,σn(y,z):=(y,z) conjugates the differential from step 1.1 to the cone differential of f in [L3]. Hence the cokernel complex is canonically chain-isomorphic to Cone(f).

L3step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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