Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16
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.

Module homomorphisms induce tensor-product homomorphisms functorially

Statement

Let f:M→M′ be a homomorphism of right R-modules and g:N→N′ a homomorphism of left R-modules. There is a unique group homomorphism

f⊗g:M⊗RN⟶M′⊗RN′

such that (f⊗g)(m⊗n)=f(m)⊗g(n). These maps satisfy

id⁡M⊗id⁡N=id⁡M⊗RN

and

(f′∘f)⊗(g′∘g)=(f′⊗g′)∘(f⊗g).

Facts & Assumptions

Given: Homomorphisms f:M→M′ of right R-modules and g:N→N′ of left R-modules.

[L1]

A balanced map M×N→A into an abelian group extends uniquely to a group homomorphism M⊗RN→A (Universal property of the tensor product for balanced maps into abelian groups).

[L2]

A module homomorphism preserves addition and the relevant scalar action (Module homomorphism and isomorphism, kernel, image and cokernel).

Proof

technique · direct
1.1givenL2algebra

The pairing (m,n)↦f(m)⊗g(n) is additive in both variables by [L2], and (f(mr))⊗g(n)=(f(m)r)⊗g(n)=f(m)⊗(rg(n))=f(m)⊗g(rn), so it is balanced.

2.1step 1.1L1

By [L1] the pairing of step 1.1 induces a unique homomorphism f⊗g with the stated formula.

3.1step 2.1L1

The maps id⁡M⊗id⁡N and id⁡M⊗RN agree on every elementary tensor, so uniqueness in [L1] makes them equal.

3.2step 2.1L1

The two sides of the composition formula both send m⊗n to f′(f(m))⊗g′(g(n)), so uniqueness in [L1] makes them equal.

4.1step 2.1step 3.1step 3.2∎

Steps 2.1, 3.1 and 3.2 prove existence, uniqueness, identity preservation, and composition preservation.

Depends on

Used by

Dependency tree · two levels

10 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