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

Hom functors on a preadditive category are left exact

Statement

Let C be a preadditive category and A an object of C. Then the covariant hom-functor C(A,−):C→Ab and the contravariant hom-functor C(−,A):Cop→Ab preserve every existing finite limit. In particular, they are left exact.

Facts & Assumptions

Given: A preadditive category C and an object A.

[L1]

In a preadditive category, the hom-functors take values in abelian groups (The hom-bifunctor of a preadditive category takes values in abelian groups).

[L2]

Every covariantly representable functor to Set preserves all existing small limits (Every covariantly representable functor to Set preserves all existing small limits).

[L3]

The opposite of a preadditive category is preadditive (The opposite of a preadditive category is preadditive).

Proof

technique · direct
1.1L1L2

The underlying Set-valued functor of C(A,−) is covariantly representable, so [L2] says it preserves every existing small limit and hence every existing finite limit. By [L1], its values and structure maps already lie in Ab, so this is exactly left exactness as an Ab-valued functor.

1.2L1L2L3

By [L3], the opposite category Cop is again preadditive. The contravariant hom-functor C(−,A) is the covariantly representable functor Cop(A,−), so [L2] applied in Cop gives the same finite-limit preservation there. Again [L1] says its values lie in Ab.

2.1step 1.1step 1.2∎

Therefore both hom-functors are left exact. This is the representable-functor theorem applied once in C and once in Cop, with no separate elementwise exactness computation.

Depends on

Used by

Dependency tree · two levels

12 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