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

The idempotent completion of the matrix category gives the finitely generated projective modules

Example

For a commutative ring R, the matrix functor extends to a fully faithful functor K:Kar(MatR)R-Mod whose essential image is exactly the finitely generated projective R-modules.

Facts & Assumptions

Given: A commutative ring R.

[L1]

The matrix category is equivalent to the finitely generated free R-modules (The matrix category is fully faithful in modules and, with chosen bases, equivalent to finite free modules).

[L3]

Finite free modules are projective without any choice principle, and projective means having the lifting property against surjections (Free modules are projective, with the exact choice boundary, Projective modules and the lifting property).

[L4]

A functor is fully faithful when it induces a bijection on every hom-set, and its essential image consists of the objects isomorphic to objects in its image (Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors).

Verification

technique · direct
1.1

For an object (n,e), define its splitting module Pe:=im(e:RnRn). [L1, L2, construct] By [L1], e is an idempotent endomorphism of Rn. Let ie:PeRn be inclusion, and let pe:RnPe be e with codomain restricted to its image. Then iepe=e and peie=1Pe, so these maps give an actual splitting in R-Mod.

L1L2algebra
2.1

The module Pe is finitely generated and projective. [L3, step 1.1] Since Rn is projective by [L3], composing any lifting problem for Pe with pe and then restricting the resulting lift along ie proves that Pe is projective. It is finitely generated because the images under pe of the standard generators of Rn generate it.

L3step 1.1
2.2

The object assignment (n,e)Pe and restriction on morphisms define a functor K. [L1, L2, step 1.1, construct] If u:(n,e)(m,f) is a Karoubi morphism, [L2] gives fue=u, equivalently fu=u=ue. Hence u maps Pe into Pf; define K(u):=uPe:PePf. Restrictions preserve identities and composition, so this defines a functor.

L1L2step 1.1
3.1

The functor K is fully faithful. [L1, L2, L4, step 1.1, step 2.2, algebra] For objects (n,e) and (m,f), the map on hom-sets in step 2.2 is bijective. Indeed, for any homomorphism h:PePf, the composite u:=ifhpe:RnRm corresponds by [L1] to a matrix and satisfies fue=u, so it is a Karoubi morphism whose restriction is h. Conversely, ue=u forces every Karoubi morphism to equal if(uPe)pe, proving uniqueness. Thus K is fully faithful by [L4].

L1L2L4step 1.1step 2.2algebra
3.2

Every finitely generated projective R-module lies in the essential image of K. [L2, L3, step 1.1, step 2.2] Indeed, let P be a finitely generated projective module. A finite generating set gives a surjection q:RnP. Projectivity from [L3] supplies a section s:PRn with qs=1P. Then e:=sq is idempotent, and q restricts to an isomorphism PeP with inverse s. Hence every finitely generated projective module lies in the essential image of K.

L2L3step 1.1step 2.2
4.1

Step 2.1 and step 3.2 identify the essential image, and step 3.1 proves full faithfulness; hence the stated claim holds.

L4step 2.1step 3.1step 3.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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