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.

Tensor-Hom adjunction for bimodules over arbitrary unital rings

Statement

Let A and B be unital rings, let M be a (B,A)-bimodule, let X be a left A-module and let Y be a left B-module. Then Hom⁡B(M,Y) is a left A-module under

(aφ)(m)=φ(ma),

and currying

Θ:Hom⁡B(M⊗AX,Y)→Hom⁡A(X,Hom⁡B(M,Y)),Θ(F)(x)=[m↦F(m⊗x)],

is a bijection, natural in X and Y, whose inverse sends φ to the B-linear map determined on elementary tensors by Ψ(φ)(m⊗x)=φ(x)(m). The unit ηX:X→Hom⁡B(M,M⊗AX), ηX(x)(m)=m⊗x, and counit εY:M⊗AHom⁡B(M,Y)→Y, εY(m⊗φ)=φ(m), satisfy the triangle identities of Adjunction by unit, counit, and the triangle identities. Consequently TM=M⊗A− is left adjoint to Hom⁡B(M,−). No commutativity is assumed and no choice is used.

Facts & Assumptions

Given: Unital rings A,B, a (B,A)-bimodule M, a left A-module X and a left B-module Y.

[F1]

Module laws: m(a+a′)=ma+ma′, (ma)a′=m(aa′), m1=m for the right A-module M, and dually for left modules over A and B (Unital left and right modules over a ring; unqualified module means left module).

[F2]

In a (B,A)-bimodule the two actions commute: b(ma)=(bm)a for all b∈B, m∈M, a∈A ((S,R)-bimodules and commuting left and right scalar actions).

[F3]

Hom⁡B(M,Y) is an abelian group under pointwise addition, and postcomposition and precomposition by module maps are group homomorphisms (The abelian group Hom⁡R(M,N) and maps induced by pre- and postcomposition).

[F4]

An A-balanced map b:M×X→Z is additive in each variable and satisfies b(ma,x)=b(m,ax) (Balanced maps from a right module and a left module, and bilinear maps over a commutative ring).

[F5]

Every balanced map M×X→Z into an abelian group factors uniquely as b‾∘τ through the universal balanced map τ(m,x)=m⊗x (Universal property of the tensor product for balanced maps into abelian groups).

[F6]

For a (B,A)-bimodule M and a left A-module X there is a unique left B-module structure on M⊗AX with b(m⊗x)=(bm)⊗x (A commuting outer scalar action descends to a tensor product).

[F7]

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

[F8]

An adjunction F⊣G is a unit and counit satisfying the triangle identities (Adjunction by unit, counit, and the triangle identities).

Proof

technique · direct
1.1F1F2F3

For a∈A and φ∈Hom⁡B(M,Y) the map m↦φ(ma) is additive and B-linear, since φ(b(ma))=φ((bm)a)=b φ(ma) by [F2] and B-linearity of φ. Hence (aφ)(m):=φ(ma) defines an element of Hom⁡B(M,Y), and the resulting action satisfies the left A-module axioms, inherited pointwise from the right A-module laws of M and the group structure of Hom⁡B(M,Y): (a+a′)φ=aφ+a′φ, (aa′)φ=a(a′φ), 1φ=φ and a(φ+ψ)=aφ+aψ.

1.2F1F3F6

For F∈Hom⁡B(M⊗AX,Y) set Θ(F)(x)(m):=F(m⊗x). For fixed x the map m↦F(m⊗x) is additive and B-linear, because b(m⊗x)=(bm)⊗x by [F6] and F is B-linear, so Θ(F)(x)∈Hom⁡B(M,Y); moreover Θ(F)(x+x′)=Θ(F)(x)+Θ(F)(x′) and Θ(F)(ax)=a Θ(F)(x) because m⊗(ax)=(ma)⊗x, so Θ(F)∈Hom⁡A(X,Hom⁡B(M,Y)), and Θ is additive.

2.1F1F3F4F5F6step 1.1

For φ∈Hom⁡A(X,Hom⁡B(M,Y)) the pairing u(m,x):=φ(x)(m) is balanced: it is additive in each variable, and u(ma,x)=φ(x)(ma)=(aφ(x))(m)=φ(ax)(m)=u(m,ax) by step 1.1 and A-linearity of φ. By [F5] it induces a unique group homomorphism Ψ(φ):M⊗AX→Y with Ψ(φ)(m⊗x)=φ(x)(m), and Ψ(φ) is B-linear because Ψ(φ)(b(m⊗x))=φ(x)(bm)=b(φ(x)(m)) by [F6] and B-linearity of each φ(x).

2.2F3F7step 1.2

Naturality: for A-linear g:X′→X one has Θ(F∘(1M⊗g))(x′)(m)=F(m⊗g(x′))=Θ(F)(g(x′))(m), so Θ is natural in X; for B-linear h:Y→Y′ one has Θ(h∘F)(x)(m)=h(F(m⊗x))=h∗(Θ(F)(x))(m), so Θ is natural in Y.

3.1F5step 1.2step 2.1

Θ and Ψ are mutually inverse: Θ(Ψ(φ))(x)(m)=Ψ(φ)(m⊗x)=φ(x)(m), and Ψ(Θ(F)) agrees with F on every elementary tensor, so the two B-linear maps are equal by the uniqueness clause of [F5].

4.1F5F7step 1.2step 2.1step 3.1

Put ηX:=Θ(1M⊗AX), so ηX(x)(m)=m⊗x, and εY:=Ψ(1Hom⁡B(M,Y)), so εY(m⊗φ)=φ(m). The triangle identities hold: εM⊗AX∘(1M⊗ηX) and 1M⊗AX agree on every elementary tensor, since εM⊗AX(m⊗ηX(x))=ηX(x)(m)=m⊗x; and Hom⁡B(M,εY)∘ηHom⁡B(M,Y) and the identity agree on every φ, since εY(m⊗φ)=φ(m) for all m.

5.1F8step 4.1∎

By step 4.1 the functors TM=M⊗A− and Hom⁡B(M,−) carry a unit and counit satisfying the triangle identities, so TM is left adjoint to Hom⁡B(M,−) in the sense of [F8].

Depends on

Used by

Dependency tree · two levels

19 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