Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-07
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.

Cone triangles satisfy the octahedral axiom

Statement

The distinguished cone triangles in K(A) satisfy TR4.

Facts & Assumptions

Given: Composable chain maps C∙→fD∙→gE∙.

Proof

1.1given

Let α:Cone⁡(f)⟶Cone⁡(gf),β:Cone⁡(gf)⟶Cone⁡(g) be the cone maps induced by the squares (1C,g) and (f,1E). In the coordinates of The three-cone calculation for a composite chain map, write an element of Cone⁡(α) as (e,c,d,c′) and define r(e,c,d,c′)=(e,d+f(c)),s(e,d)=(e,0,d,0). The displayed cone-differential calculation in that lemma shows that r and s are chain maps, rs=1, and sr≃1: under its isomorphism Θ, r is projection off the contractible Cone⁡(1C[1]) summand and s is inclusion of the Cone⁡(g) summand.

2.1step 1.1algebra

If jα and qα are the canonical maps in the standard cone triangle of α, then the formulas give rjα=β,qαs=jf[1]∘qg. Indeed, jα(e,c)=(e,c,0,0) and β(e,c)=(e,f(c)), while qα(e,c,d,c′)=(d,c′) and jf[1]qg(e,d)=(d,0).

3.1step 1.1step 2.1given∎

Thus the standard distinguished cone triangle of α is isomorphic in K(A) to Cone⁡(f)→αCone⁡(gf)→βCone⁡(g)→jf[1]∘qgCone⁡(f)[1]. The definitions of α and β make the other two faces the required morphisms of cone triangles, and the displayed final map is precisely the typed fourth arrow in TR4.

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