Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 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.

FALSE: every abelian category is equivalent to a module category

Statement

Every abelian category is equivalent to a category of modules.

Facts & Assumptions

Given: A field F and the full subcategory FinVectF of finite-dimensional F-vector spaces.

[L1]

Module categories are abelian (Modules over a ring form an abelian category).

[L2]

Every module category has all small coproducts (For every ring R, the category R-Mod is complete and cocomplete).

Refutation

1.1L1

The category FinVectF is abelian: kernels, cokernels, images, coimages, and finite direct sums of linear maps between finite-dimensional vector spaces stay finite-dimensional, so the abelian-category structure of VectF restricts to this full subcategory.

2.1L2step 1.1∎

The countable coproduct of countably many copies of the one-dimensional space F does not exist in FinVectF, because its usual direct sum is infinite-dimensional. But [L2] says every module category has all small coproducts. Since equivalences preserve which small coproducts exist, FinVectF cannot be equivalent to any module category. Therefore the universal statement is false.

Depends on

Used by

Nothing in the library uses this result yet.

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