Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-28
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.

Filtered vector spaces can be additive with kernels and cokernels without being abelian

Statement refuted

Every additive category with all kernels and cokernels is abelian.

Facts & Assumptions

Given: A field k.

[L1]

An abelian category is in particular additive and requires the canonical coimage-to-image map to be an isomorphism (Additive category, Abelian category).

Counterexample

1.1

Let Fk be the category whose objects are Z-filtered k-vector spaces (V,FV) and whose morphisms preserve the filtrations. Pointwise addition on linear maps and direct sums with Fi(VW)=FiVFiW make Fk additive, and kernels and cokernels are computed on the underlying linear map with the induced and quotient filtrations.

L1
2.1

Take V=W=k with FiV=k for i<0 and FiV=0 for i0, while FiW=k for i0 and FiW=0 for i>0. The identity linear map ι:VW preserves filtrations, has zero kernel and zero cokernel, so coim(ι)=V and im(ι)=W. But ι is not an isomorphism in Fk, because its inverse does not preserve F0. Hence the canonical map coim(ι)im(ι) is not an isomorphism, so Fk is not abelian.

L1step 1.1

Depends on

Used by

Dependency tree · two levels

7 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