Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedprecheck passaudited 2026-08-27
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.

A zero kernel does not force monicity in a merely semiadditive category

Statement refuted

Refuted claim: in every semiadditive category, a morphism with zero kernel is monic.

The witness is the morphism q:N{0,a} in the semiadditive category CMon of commutative monoids, where a+a=a and q(0)=0, q(n)=a for n>0.

Facts & Assumptions

Given: The category CMon and the morphism q:N{0,a}.

[L1]

A semiadditive category is one with finite biproducts (Semiadditive category).

Counterexample

technique · direct
1.1

For commutative monoids M and N, the Cartesian product M×N is also their coproduct: if f:MP and g:NP are homomorphisms, then h(m,n):=f(m)+g(n) is a homomorphism M×NP, and it is the unique one with h(m,0)=f(m) and h(0,n)=g(n) because every (m,n) equals (m,0)+(0,n). Hence finite products and finite coproducts in CMon agree, so [L1] shows that CMon is semiadditive.

givenL1construct
1.2

Let s,t:NN be the monoid homomorphisms s(n)=n and t(n)=2n. They are distinct, but qs=qt because both send every positive integer to a and 0 to 0. Hence q is not monic.

given
2.1

The equalizer of q and the zero map N{0,a} consists only of 0, because q(n)=0 holds exactly for n=0. So the kernel of q is zero.

givenstep 1.1
3.1

Thus a zero kernel does not force monicity once one weakens preadditivity to mere semiadditivity.

step 1.1step 1.2step 2.1

Depends on

Used by

Dependency tree · two levels

4 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