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.

Canonical free presentations force the comparison to be an isomorphism

Statement

Let A,B be unital rings and let F:A-Mod→B-Mod be additive, right exact, and coproduct-preserving; put M=F(A) with the (B,A)-bimodule structure of F(A) is a (B,A)-bimodule for every additive functor F. Then the canonical comparison τ:M⊗A−⇒F of The canonical comparison to the tensor functor of F(A) is balanced and natural is a natural isomorphism. Consequently F is naturally isomorphic to the tensor functor TF(A). No commutativity and no choice are used.

Facts & Assumptions

Given: Unital rings A,B, an additive, right exact, coproduct-preserving functor F:A-Mod→B-Mod, the (B,A)-bimodule M=F(A), and a left A-module X.

[F1]

The canonical comparison τX:M⊗AX→F(X) satisfies τX(m⊗x)=F(ℓx)(m) for ℓx(a)=ax, each τX is B-linear, and τ is natural: F(u)∘τX=τY∘(1M⊗u) (The canonical comparison to the tensor functor of F(A) is balanced and natural).

[F2]

The formula ma=F(ra)(m) with ra(x)=xa makes M a (B,A)-bimodule (F(A) is a (B,A)-bimodule for every additive functor F).

[F3]

ρM:M⊗AA→M, ρM(m⊗a)=ma, is a group isomorphism (The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M).

[F4]

TM=M⊗A− is additive, right exact, preserves arbitrary direct sums including the empty one, and its induced maps are B-linear when M is a (B,A)-bimodule (The functor M⊗A− is additive, right exact, and preserves direct sums over an arbitrary unital ring).

[F5]

For an additive module functor, right exactness together with coproduct preservation is equivalent to preservation of cokernels and arbitrary direct sums (An additive module functor is cocontinuous exactly when it is right exact and preserves coproducts).

[F6]

The free module A(X) admits the canonical surjection qX:A(X)→X with qX(ex)=x, and A(K) denotes the free module on the underlying set of a module K (Every module is a quotient of a free module).

[F7]

A cokernel of f:A→B is a map q:B→coker⁡(f) with qf=0 such that every h with hf=0 factors uniquely as h=h‾∘q (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).

[F8]

The direct sum is the coproduct with coordinate inclusions, a map out of a coproduct is uniquely determined by its components, and the empty direct sum is the zero module (The direct sum of an indexed family of modules, Universal property of a direct sum of modules).

[F9]

Exactness of A(K)→dA(X)→qX→0 means im⁡d=ker⁡q and surjectivity of q (Exact sequences and short exact sequences of modules).

[F10]

Module maps induce tensor maps functorially: (1⊗v)∘(1⊗u)=1⊗(v∘u), and (1⊗u)(m⊗x)=m⊗u(x) (Module homomorphisms induce tensor-product homomorphisms functorially).

Proof

technique · direct
1.1F1F2F3

At A: since ℓa=ra, step [F1] and [F2] give τA(m⊗a)=F(ℓa)(m)=ma=ρM(m⊗a); by [F3] the map τA=ρM is an isomorphism.

1.2F4F5F8

Coproduct preservation: by [F5] the hypotheses make F preserve cokernels and arbitrary direct sums, and TM preserves arbitrary direct sums by [F4]. Hence for any family (Yi) the object F(⨁iYi) with the maps F(ȷi) is a coproduct of the family (F(Yi)), and M⊗A(⨁iYi) with the maps 1M⊗ȷi is a coproduct of the family (M⊗AYi).

1.3F6F9

Presentation: put KX=ker⁡qX for the canonical surjection qX:A(X)→X of [F6], let qX′:A(KX)→KX be the canonical surjection of [F6] for KX, and let dX:A(KX)→A(X) be qX′ followed by the inclusion KX↪A(X). Then im⁡dX=KX=ker⁡qX and qX is surjective, so A(KX)→dXA(X)→qXX→0 is exact.

2.1F1F8step 1.1step 1.2

Free modules: let I be a set with coordinate inclusions ιi:A→A(I). Naturality [F1] gives F(ιi)∘τA=τA(I)∘(1M⊗ιi) for every i. By step 1.2 the 1M⊗ιi exhibit M⊗AA(I) as a coproduct of copies of M⊗AA and the F(ιi) exhibit F(A(I)) as a coproduct of copies of M; comparing components shows that under these identifications τA(I) is the coproduct of the maps τA, namely ⨁iτA. A coproduct of isomorphisms is an isomorphism, its inverse being the map induced by the inverses of the components via [F8]; since τA is an isomorphism by step 1.1, so is τA(I), including I=∅.

2.2F1F4F5F7step 1.3

Induced map at X: by right exactness [F4, F5] the maps 1M⊗qX and F(qX) are cokernels of 1M⊗dX and F(dX) respectively. Naturality [F1] gives τA(X)∘(1M⊗dX)=F(dX)∘τA(KX), so F(qX)∘τA(X) kills im⁡(1M⊗dX); by the cokernel universal property [F7] there is a unique map τX:M⊗AX→F(X) with τX∘(1M⊗qX)=F(qX)∘τA(X).

3.1F1F7F10step 2.1step 2.2

Inverse at X: since (1M⊗qX)∘(1M⊗dX)=1M⊗(qX∘dX)=0 by [F10] and step 1.3, and τA(X)−1∘F(dX)=(1M⊗dX)∘τA(KX)−1 by naturality [F1] and the invertibility of step 2.1, the composite (1M⊗qX)∘τA(X)−1 kills im⁡F(dX); by [F7] there is a unique map σX:F(X)→M⊗AX with σX∘F(qX)=(1M⊗qX)∘τA(X)−1. Then σX∘τX and the identity agree after composition with the cokernel map 1M⊗qX, and τX∘σX and the identity agree after composition with the cokernel map F(qX); uniqueness in [F7] makes both composites the identity, so τX is an isomorphism.

4.1F1step 1.1step 2.1step 3.1∎

Steps 1.1, 2.1 and 3.1 show that every component of the natural transformation τ is an isomorphism, so τ:M⊗A−⇒F is a natural isomorphism and F≅TF(A); the comparison was constructed before any presentation of X was chosen, and no element of an auxiliary set is selected, so no presentation independence argument and no choice are needed.

Depends on

Used by

Dependency tree · two levels

35 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