Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

The abelian category of finite abelian groups has no nonzero projective object

Statement refuted

Every abelian category has a nonzero projective object.

Facts & Assumptions

Given: The abelian category FinAb of finite abelian groups.

[L1]

Projective objects are exactly those for which every epimorphism onto them splits (Projective object characterisations).

[L2]

Enough projectives would require, in particular, some nonzero projective object (A category with enough projectives and with enough injectives).

Counterexample

1.1L2choose

The category FinAb is abelian: kernels, cokernels, and finite biproducts of homomorphisms of finite abelian groups are again finite abelian groups. Let P be a nonzero finite abelian group, and fix a prime p for which P has a nonzero p-primary quotient. Among all cyclic quotients of P of the form Z/pm, choose one with maximal m, say u:P↠Z/pm.

2.1L1step 1.1∎

Let q:Z/pm+1↠Z/pm be the canonical quotient map. If P were projective, [L1] would lift u to g:P→Z/pm+1 with qg=u. Since u is surjective, so is g. Thus Z/pm+1 would be a quotient of P, contradicting maximality of m. Therefore no nonzero object of FinAb is projective. So FinAb is an abelian category with no nonzero projective object.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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