Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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:MM be a homomorphism of right R-modules and g:NN a homomorphism of left R-modules. There is a unique group homomorphism

fg:MRNMRN

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

idMidN=idMRN

and

(ff)(gg)=(fg)(fg).

Facts & Assumptions

Given: Homomorphisms f:MM of right R-modules and g:NN of left R-modules.

[L1]

A balanced map M×NA into an abelian group extends uniquely to a group homomorphism MRNA (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.1

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.

givenL2algebra
2.1

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

step 1.1L1
3.1

The maps idMidN and idMRN agree on every elementary tensor, so uniqueness in [L1] makes them equal.

step 2.1L1
3.2

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

step 2.1L1
4.1

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

step 2.1step 3.1step 3.2

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 25 results over 10 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources