Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

A coproduct of projectives is projective and a product of injectives is injective

Statement

Assume an abelian category satisfies AB3 and AB3*.

  1. Every finite coproduct of projective objects is projective, and every finite product of injective objects is injective.
  2. For an arbitrary small family, the same conclusion holds provided one may choose one lift or one extension for each index in each lifting problem; in particular it holds under the Axiom of Choice.

Facts & Assumptions

Given: An abelian category satisfying AB3 and AB3*, and small families (Pi) of projective objects and (Ii) of injective objects.

[L1]

AB3 and AB3* supply the required coproducts and products (The axioms AB3 and AB3*).

[L2]

Projective objects are characterized by the lifting property against epimorphisms, and injective objects dually by the extension property against monomorphisms (Projective object characterisations, Injective object characterisations).

Proof

technique · direct
1.1L1L2chooseconstruct

By [L1], let P=∐iPi. Given an epimorphism q:E↠M and a morphism f:P→M, write fi=fιi on the coproduct summands. Because each Pi is projective, [L2] gives a lift f~i:Pi→E of fi. For a finite family these lifts are chosen explicitly; for an arbitrary small family they are exactly the stated choice-dependent data. The coproduct universal property then assembles the f~i into a lift f~:P→E, so P is projective.

1.2L1L2chooseconstruct

The injective claim is dual. By [L1], let I=∏iIi. Given a monomorphism m:M↣E and a morphism f:M→I, write fi=πif. Each injective object Ii admits an extension f~i:E→Ii by [L2]. The product universal property assembles them into f~:E→I extending f. So I is injective.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 prove the finite case without extra choice and the arbitrary small-family case with the stated choice boundary.

Depends on

Used by

Dependency tree · two levels

9 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