Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Natural transformations of additive cocontinuous module functors are determined at the regular module

Statement

Let A,B be unital rings. The additive cocontinuous functors A-Mod→B-Mod (Additive cocontinuous module functors and their schematic category), satisfy the category laws schematically, with componentwise identities and vertical composition. For each fixed pair F,G, every natural transformation F⇒G is determined by its component at A. The admissible components constitute a subset of Hom⁡B(F(A),G(A)), giving a set of codes Nat⁡(F,G). This is local smallness in the schematic sense of Additive cocontinuous module functors and their schematic category; it does not make proper-class functors or component families into sets. No choice is used.

Facts & Assumptions

Given: Unital rings A and B, additive cocontinuous functors F,G:A-Mod→B-Mod, and a natural transformation η:F⇒G.

[F1]

A functor is additive cocontinuous when it is additive and preserves every small colimit; the categorical notation is schematic under the definable-class convention (Additive cocontinuous module functors and their schematic category).

[F2]

Additivity means that the induced maps on hom-groups are group homomorphisms; in particular the identity functor and composites of additive functors are additive (Additive functor).

[F3]

A natural transformation η:F⇒G satisfies the naturality equation G(u)∘ηX=ηY∘F(u) for every u:X→Y (Natural transformation and its components).

[F4]

Identity transformations are natural, and the vertical composite β∘α of natural transformations is natural (componentwise) and is associative and unital componentwise (Identity natural transformation and vertical composition, Vertical composites of natural transformations satisfy naturality).

[F5]

The free module A(X) on the underlying set of a left A-module X carries the canonical surjection qX:A(X)→X with qX(ex)=x (Every module is a quotient of a free module).

[F6]

A right exact functor between abelian categories preserves epimorphisms (A left exact functor preserves monomorphisms and a right exact functor preserves epimorphisms).

[F7]

A-Mod and B-Mod are abelian categories (Modules over a ring form an abelian category).

[F8]

A functor is right exact when it preserves every finite colimit; a cocontinuous functor preserves all small colimits and therefore every finite colimit (Left exact and right exact functors).

[F9]

The direct sum ⨁i∈IXi is the coproduct of the family with its coordinate inclusions ȷi, and a homomorphism out of it is uniquely determined by its composites with the ȷi (The direct sum of an indexed family of modules, Universal property of a direct sum of modules).

Proof

technique · direct
1.1F1F2

The identity functor 1A-Mod is additive, its induced maps on hom-groups being identity homomorphisms, and it preserves every colimit; hence it is additive cocontinuous.

1.2F1F2

If F:A-Mod→B-Mod and G:B-Mod→C-Mod are additive cocontinuous, then GF is additive, a composite of hom-group homomorphisms being one, and cocontinuous, since for a small diagram D with colimit L the object F(L) is a colimit of F∘D and G(F(L)) is a colimit of G∘F∘D.

1.3F1F3F4

Identity transformations and vertical composites are natural by [F4]. Associativity and the identity laws hold at each component. Thus the categorical operations satisfy their laws for fixed functor and transformation schemas; this does not form a category whose objects are proper classes.

1.4F1F3F9

Free modules: let I be a set and let ιi:A→A(I) be the coordinate inclusions of the free module A(I)=⨁i∈IA, a coproduct of copies of A. Since F and G preserve this coproduct, F(A(I)) with the maps F(ιi):M→F(A(I)), where M=F(A), is a coproduct of copies of M, and by [F9] a map out of F(A(I)) is determined by its composites with the maps F(ιi); the same holds for G(A(I)) with N=G(A). Naturality [F3] gives ηA(I)∘F(ιi)=G(ιi)∘ηA for every i, so ηA(I) is determined by ηA: if ηA=0 then ηA(I)=0.

1.5F5F6F7F8

Epic free covers: the canonical surjection qX:A(X)→X is an epimorphism, since two maps out of X agreeing after composition with qX agree everywhere by surjectivity of qX. Each of F,G is right exact by [F8], and A-Mod, B-Mod are abelian by [F7], so F(qX) and G(qX) are epimorphisms by [F6].

2.1F3step 1.4step 1.5

Suppose ηA=θA for two natural transformations F⇒G. Step 1.4 and naturality at every coordinate inclusion give ηA(X)=θA(X). Naturality at qX then gives ηX∘F(qX)=G(qX)∘ηA(X)=G(qX)∘θA(X)=θX∘F(qX); epicness of F(qX) from step 1.5 yields ηX=θX. Hence the transformations agree at every module.

3.1F1F3F5F9step 1.3step 1.5step 2.1∎

To obtain set codes, fix the defining formulas and parameters for F,G. For h∈Hom⁡B(F(A),G(A)) and a module X, let ph,X:F(A(X))→G(X) be the unique map whose composite with F(ιx) is G(qXιx)h for every x∈X; it exists by coproduct preservation and [F9]. Call h admissible when, for every X, there is a map aX:F(X)→G(X) with aXF(qX)=ph,X, these maps satisfy G(u)aX=aYF(u) for every u:X→Y, and aA=h. The descents are unique by step 1.5, so this is a predicate quantifying only over sets and set-coded module maps, not over class families. Separation gives the set of admissible h. Every natural transformation gives such a code by naturality at qXιx, and each admissible code defines its component family uniquely. Together with steps 1.3 and 2.1 this proves the claimed schematic category laws and local smallness, without applying replacement to proper-class-valued outputs. No choice is used.

Depends on

Used by

Cited to discharge well-definedness by Additive cocontinuous module functors and their schematic category.

Dependency tree · two levels

28 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