TheoremStatement: Literature-sourcedProof: 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 left or right exact functor between abelian categories is automatically additive

Statement

Let $F : A \to B$ be a functor between abelian categories. If $F$ is left exact or right exact, then $F$ is additive.

Facts & Assumptions

Given: A functor $F : A \to B$ between abelian categories.

[L1]

Left exact means preserving finite limits, and right exact means preserving finite colimits (Left exact and right exact functors).

[L2]

Abelian categories are additive (Abelian category).

[L3]

A functor between additive categories is additive exactly when it preserves finite biproducts (A functor between additive categories is additive exactly when it preserves finite biproducts).

Proof

technique · direct

1.1L1L2L3

If $F$ is left exact, then by [L1] it preserves the zero object and binary products. In an additive category, products are biproducts by [L2], so $F$ preserves finite biproducts.

1.2L1L2L3

If $F$ is right exact, then by [L1] it preserves the zero object and binary coproducts. Again [L2] identifies those with finite biproducts, so $F$ preserves finite biproducts.

2.1L3step 1.1step 1.2∎

In either case, [L3] applies and shows that $F$ is additive.

Depends on

Used by

Dependency tree · two levels

10 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

The Stacks Project, Section 12.7, Lemma 12.7.2(1) (standard reference, not scraped)