Alphabeta Math
False statementConstruction: AI-adaptedVerification: 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.

FALSE: mapping cone is a functor on the homotopy category with no extra data

Statement

Mapping cone defines a functor on the homotopy category with no extra choices.

Facts & Assumptions

Given: The zero map 0:C∙→D∙, where C∙ is the stalk complex Z[0] and D∙ is the stalk complex Z[1].

[A1]

The statement refuted is: mapping cone defines a functor on the homotopy category with no extra choices.

[L1]

Chain homotopies of maps can alter the induced upper-triangular cone map (A chain homotopy).

[L2]

Strict functoriality is proved only on the arrow category of chain maps (Mapping cone is functorial on the arrow category of complexes).

Refutation

technique · direct
1.1A1L1givenalgebra

The identity square on the zero map admits two homotopies between the two zero composites: the zero homotopy and the degree-one map t0=1Z. They induce two cone endomorphisms of Cone⁡(0)=Z[1]⊕Z[1], namely the identity matrix and (1101).

2.1A1L2step 1.1algebra∎

This cone complex has zero differential, so two endomorphisms are homotopic only when they are equal. The two matrices from step 1.1 are distinct, so a homotopy-category morphism does not determine a unique cone morphism without extra data. Therefore [A1] is false, and [L2] records the correct strict functoriality level.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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