Alphabeta Math
TheoremStatement: 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 between tensor functors are bimodule maps

Statement

Let A,B be unital rings and let M,M′ be (B,A)-bimodules ((S,R)-bimodules and commuting left and right scalar actions), with tensor functors TM=M⊗A− and TM′=M′⊗A−. Under the tensor-unit isomorphisms ρM:M⊗AA→M and ρM′:M′⊗AA→M′ of The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M, every natural transformation η:TM⇒TM′ corresponds to the B-linear map

f=ρM′∘ηA∘ρM−1:M⟶M′,f(m)=ρM′(ηA(m⊗1)),

which satisfies f(ma)=f(m)a for all a∈A, i.e. is a (B,A)-bimodule map, and then ηX=f⊗1X for every left A-module X. Conversely every bimodule map f:M→M′ yields a natural transformation with components f⊗1X. The two assignments are inverse bijections Nat⁡(TM,TM′)≅Hom⁡B-A(M,M′), compatible with addition, identities, and vertical composition. No commutativity and no choice are used. Here Nat⁡(TM,TM′) uses bimodule maps as set codes for the component families, not those proper-class families as elements of a set.

Facts & Assumptions

Given: Unital rings A,B, (B,A)-bimodules M,M′, a left A-module X, and a natural transformation η:TM⇒TM′.

[F1]

The tensor-unit map ρN:N⊗AA→N, ρN(n⊗a)=na, is an isomorphism with inverse n↦n⊗1 and respects every displayed outer module structure (The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M).

[F2]

If M is a (B,A)-bimodule and X a left A-module, then M⊗AX is a left B-module with b(m⊗x)=(bm)⊗x, so TM,TM′ take values in B-Mod (A commuting outer scalar action descends to a tensor product).

[F3]

A (B,A)-bimodule has commuting left B-action and right A-action; a (B,A)-bimodule map is a map that is both B-linear and A-linear ((S,R)-bimodules and commuting left and right scalar actions).

[F4]

Naturality of η: for every left A-linear u:X→Y one has (1M′⊗u)∘ηX=ηY∘(1M⊗u) (Natural transformation and its components).

[F5]

Module maps induce tensor maps with (f⊗g)(m⊗x)=f(m)⊗g(x), functorially: id⁡⊗id⁡=id⁡ and (f′∘f)⊗(g′∘g)=(f′⊗g′)∘(f⊗g) (Module homomorphisms induce tensor-product homomorphisms functorially).

[F6]

Vertical composition is componentwise, (ξ∘η)X=ξX∘ηX (Identity natural transformation and vertical composition).

[F7]

For left R-modules, Hom⁡R is an abelian group under pointwise addition, with postcomposition and precomposition homomorphisms (The abelian group Hom⁡R(M,N) and maps induced by pre- and postcomposition).

Proof

technique · direct
1.1F1F2F3F4

Define f:=ρM′∘ηA∘ρM−1, so f(m)=ρM′(ηA(m⊗1)) by [F1]. Then f is B-linear, as a composite of the B-linear maps ρM−1, ηA (a morphism in B-Mod by [F2] and [F4]) and ρM′, which respect the outer structures by [F1]. Moreover f(ma)=f(m)a for all a∈A: naturality at the left A-linear map ra:A→A, ra(x)=xa, reads ηA∘(1M⊗ra)=(1M′⊗ra)∘ηA, and ma⊗1=(1M⊗ra)(m⊗1); evaluating there and using that ρM′ is A-linear, so that ρM′((1M′⊗ra)(y))=ρM′(y)a, gives f(ma)=ρM′(ηA(m⊗1))a=f(m)a. By [F3] the map f is a (B,A)-bimodule map.

1.2F2F3F4F5

Conversely, let f:M→M′ be a (B,A)-bimodule map and put ηX:=f⊗1X:M⊗AX→M′⊗AX by [F5]. Each ηX is B-linear, since ηX(b(m⊗x))=f(bm)⊗x=b(f(m)⊗x), and the family is natural: for u:X→Y functoriality in [F5] gives (f⊗1Y)∘(1M⊗u)=f⊗u=(1M′⊗u)∘(f⊗1X).

2.1F1F4F5step 1.1

Let η be natural with associated f from step 1.1. Naturality at ℓx:A→X, ℓx(a)=ax, gives ηX∘(1M⊗ℓx)=(1M′⊗ℓx)∘ηA; evaluated at m⊗1 the left side is ηX(m⊗x), while the right side is (1M′⊗ℓx)(f(m)⊗1)=f(m)⊗x, using f(m)=ρM′(ηA(m⊗1)) and ρM′−1(f(m))=f(m)⊗1 from [F1]. Both ηX and f⊗1X are homomorphisms agreeing on every elementary tensor, so ηX=f⊗1X; in particular η is determined by f.

3.1F1F3F5step 1.1step 1.2step 2.1

The assignments are inverse: starting from a bimodule map f, the transformation of step 1.2 has associated map f′=ρM′∘(f⊗1A)∘ρM−1, and f′(m)=ρM′(f(m)⊗1)=f(m) by [F1] and [F5]; starting from η, its associated f satisfies f⊗1X=ηX for all X by step 2.1. Hence η↦f is a bijection onto the set of (B,A)-bimodule maps.

4.1F5F6F7step 1.1step 2.1step 3.1

Compatibility: sums of natural transformations, defined componentwise, are natural, and fη+η′=fη+fη′ because ρM′ and η↦ηA are additive; conversely sums of bimodule maps are bimodule maps and (f+f′)⊗1X=f⊗1X+f′⊗1X by [F5] and agreement on elementary tensors. The identity 1TM corresponds to 1M in both directions, since ρM(m⊗1)=m and 1M⊗1X=id⁡ by [F5]. Vertical composition corresponds to composition: by [F6] and step 2.1, for ξ:TM′⇒TM′′ with associated g one has (ξ∘η)A(m⊗1)=ξA(f(m)⊗1)=g(f(m))⊗1, so ξ∘η is associated with g∘f, while (g⊗1X)∘(f⊗1X)=(g∘f)⊗1X by [F5]; by [F7] these operations are the additions and compositions on the two Hom-groups.

5.1step 1.1step 1.2step 2.1step 3.1step 4.1∎

Steps 1.1-3.1 establish the bijection Nat⁡(TM,TM′)≅Hom⁡B-A(M,M′) with ηX=f⊗1X, and step 4.1 shows it is compatible with addition, identities and vertical composition. Nothing was chosen, and no commutativity was used.

Depends on

Used by

Dependency tree · two levels

13 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