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.

F(A) is a (B,A)-bimodule for every additive functor F

Statement

Let A and B be unital rings and let F:A-Mod→B-Mod be an additive functor (Additive functor). On the left B-module M=F(A) define, for a∈A and m∈M,

ma:=F(ra)(m),

where ra:A→A, ra(x)=xa, is right multiplication, a left A-linear endomorphism of A. Together with the given left B-action this makes M a (B,A)-bimodule ((S,R)-bimodules and commuting left and right scalar actions): the right A-action satisfies the unit, associativity and distributivity laws of Unital left and right modules over a ring; unqualified module means left module and commutes with the left B-action. No commutativity of the rings is assumed and no choice is used.

Facts & Assumptions

Given: Unital rings A and B, an additive functor F:A-Mod→B-Mod, and the left B-module M=F(A).

[F1]

A right R-module is an abelian group with an action (m,r)↦mr satisfying the right-handed analogues of the left-module axioms, in particular m1=m, (m+m′)a=ma+m′a, m(a+a′)=ma+ma′ and (ma)a′=m(aa′) (Unital left and right modules over a ring; unqualified module means left module). Multiplication in a ring satisfies (cx)a=c(xa) and x(a+a′)=xa+xa′.

[F2]

An additive functor satisfies F(f+g)=Ff+Fg for every parallel pair of morphisms f,g (Additive functor).

[F3]

A functor satisfies F(1X)=1FX and F(g∘f)=Fg∘Ff (Covariant functor, identity functor, composite functor, and contravariant functor).

[F4]

An (S,R)-bimodule is an abelian group that is a left S-module and a right R-module whose two actions commute ((S,R)-bimodules and commuting left and right scalar actions).

Proof

technique · direct
1.1F1F3

For a∈A the map ra:A→A, ra(x)=xa, is a left A-module endomorphism, because ra(x+y)=ra(x)+ra(y) and ra(cx)=(cx)a=c(xa)=c ra(x) by the ring laws. Hence F(ra):M→M is a B-linear, in particular additive, endomorphism, and ma:=F(ra)(m) defines a map M×A→M with (m+m′)a=ma+m′a for all m,m′∈M.

1.2F1F3

Unit law: r1=idA because x1=x, so m1=F(idA)(m)=F(1A)(m)=1M(m)=m for every m∈M.

1.3F1F3

Associativity: raa′=ra′∘ra because x(aa′)=(xa)a′, so functoriality gives F(raa′)=F(ra′)F(ra) and hence m(aa′)=(ma)a′ for all m∈M and a,a′∈A.

1.4F1F2

Additivity in the ring variable: ra+a′=ra+ra′ because x(a+a′)=xa+xa′, and additivity of F gives F(ra+a′)=F(ra)+F(ra′), so m(a+a′)=ma+ma′.

2.1F4givenstep 1.1

Commutation with the left B-action: for b∈B and m∈M we have b(ma)=b(F(ra)(m))=F(ra)(bm)=(bm)a, since the morphism F(ra) of B-Mod is B-linear.

3.1F1F4step 1.1step 1.2step 1.3step 1.4step 2.1∎

Steps 1.1-1.4 make M a right A-module for the assignment (m,a)↦ma, and step 2.1 shows that this right A-action commutes with the given left B-action; by [F4] the abelian group M is a (B,A)-bimodule.

Depends on

Used by

Dependency tree · two levels

9 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