Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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 Hom complex of two two-term complexes

Example

Let C∙=D∙ be the two-term identity complex 0→Z→1ZZ→0. Then Hom⁡‾(C,D)1≅Z,Hom⁡‾(C,D)0≅Z2,Hom⁡‾(C,D)−1≅Z, with differentials ∂1(m)=(m,m),∂0(a,b)=b−a.

Facts & Assumptions

Given: The two-term identity complex C∙=D∙ in Ab.

[L1]

The Hom complex in degree r consists of families un:Cn→Dn+r with differential (∂u)n=dn+run−(−1)run−1dn (The Hom complex of chain complexes).

[L2]

Degree-0 cycles in the Hom complex are exactly chain maps (Zero cocycles in the Hom complex are chain maps).

[L3]

Ab is an abelian category (Abelian groups form an abelian category).

Verification

technique · direct
1.1L1L3givenalgebra

A degree-1 map has only one possible nonzero component u0:Z→Z, so it is determined by an integer m. A degree-0 map has components u1,u0, hence is determined by (a,b)∈Z2, and a degree −1 map is determined by u1:Z→Z.

2.1L1L2step 1.1algebra∎

Substituting these components into [L1] gives ∂1(m)=(m,m),∂0(a,b)=b−a. Therefore ker⁡(∂0)={(a,a)}, exactly the degree-0 chain maps from [L2].

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