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.

The functor M⊗A− is additive, right exact, and preserves direct sums over an arbitrary unital ring

Statement

Let A be a unital ring and M a right A-module. Then the functor TM=M⊗A−:A-Mod→Ab is additive, preserves cokernels (so it is right exact: every exact sequence X→fY→gZ→0 of left A-modules induces an exact sequence M⊗AX→1⊗fM⊗AY→1⊗gM⊗AZ→0), and preserves arbitrary direct sums: the natural map ⨁i∈I(M⊗AXi)→M⊗A(⨁i∈IXi) induced by the coordinate inclusions is an isomorphism, including I=∅. If M is a (B,A)-bimodule then TM takes values in left B-modules and all the displayed maps are B-linear. No commutativity of A or B is assumed and no choice is used.

Facts & Assumptions

Given: A unital ring A, a right A-module M, a family (Xi)i∈I of left A-modules, parallel left A-linear maps u,v:X→Y, an exact sequence X→fY→gZ→0 of left A-modules, and, for the final claim, a (B,A)-bimodule structure on M.

[F1]

The universal balanced map τ(m,x)=m⊗x is balanced, and every balanced map b:M×X→W into an abelian group has a unique factorization b=b‾∘τ with b‾(m⊗x)=b(m,x) (Universal property of the tensor product for balanced maps into abelian groups).

[F2]

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

[F3]

Every element of M⊗AX is a finite sum of elementary tensors, and m⊗(n+n′)=m⊗n+m⊗n′, (m+m′)⊗n=m⊗n+m′⊗n, (ma)⊗n=m⊗(an), 0⊗n=0=m⊗0 (The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums). Consequently a homomorphism out of M⊗AX is determined by its values on elementary tensors.

[F4]

Elements of ⨁i∈IXi are finitely supported families, the coordinate inclusions ȷi:Xi→⨁jXj place the input in coordinate i and zero elsewhere, and for I=∅ the direct sum is the zero module (The direct sum of an indexed family of modules).

[F5]

For every family of maps ui:Xi→N there is a unique u:⨁iXi→N with u∘ȷi=ui, given by u((xi))=∑iui(xi) over the finite support, and for I=∅ it is the unique map 0→N (Universal property of a direct sum of modules). Two homomorphisms out of a direct sum are equal as soon as they agree after composing with every ȷi.

[F6]

Exactness of X→fY→gZ→0 means ker⁡g=im⁡f and that g is surjective (Exact sequences and short exact sequences of modules).

[F7]

The kernel of g is {y:g(y)=0}, the image of f is {f(x)}, and the cokernel of a map is the quotient by its image (Module homomorphism and isomorphism, kernel, image and cokernel).

[F8]

If M is a (B,A)-bimodule then M⊗AX carries a left B-module structure with b(m⊗x)=(bm)⊗x, and the actions of M commute: b(ma)=(bm)a (A commuting outer scalar action descends to a tensor product, (S,R)-bimodules and commuting left and right scalar actions).

Proof

technique · direct
1.1F1F2F3

Additivity: for parallel maps u,v:X→Y and every elementary tensor, (1⊗(u+v))(m⊗x)=m⊗(u+v)(x)=m⊗u(x)+m⊗v(x)=(1⊗u)(m⊗x)+(1⊗v)(m⊗x); both sides are homomorphisms out of M⊗AX, so they are equal by [F3]. Hence TM preserves addition of morphisms and is additive.

1.2F2F4F5

Direct sums, first map: by [F5] the maps 1M⊗ȷi:M⊗AXi→M⊗A(⨁jXj) induce a unique homomorphism Φ:⨁i∈I(M⊗AXi)→M⊗A(⨁i∈IXi) whose composite with the coordinate inclusion ȷi′:M⊗AXi→⨁i(M⊗AXi) is 1M⊗ȷi for every i.

1.3F1F3F4

Direct sums, inverse: the pairing b(m,(xi)i):=(m⊗xi)i is well defined and balanced because the family (xi) has finite support, addition is coordinatewise, and b(ma,(xi))=(ma⊗xi)i=(m⊗(axi))i=b(m,a(xi)); by [F1] it induces Ψ:M⊗A(⨁iXi)→⨁i(M⊗AXi) with Ψ(m⊗(xi)i)=(m⊗xi)i.

1.4F2F3F6

Cokernels, surjectivity and composite: 1⊗g is surjective, since every element of M⊗AZ is a finite sum of elementary tensors m⊗z and z=g(y) for some y by [F6], so it is the image of ∑m⊗y. Also (1⊗g)∘(1⊗f)=1⊗(g∘f)=1⊗0=0, because g∘f=0 by [F6] and a homomorphism out of M⊗AX vanishing on every elementary tensor is zero by [F3].

1.5F1F2F3F6F7

Cokernels, universal property: let W be an abelian group and v:M⊗AY→W a homomorphism with v∘(1⊗f)=0. For z∈Z choose y∈Y with g(y)=z and set c(m,z):=v(m⊗y). If y′ is another lift then y−y′=f(x) for some x∈X by [F6] and [F7], so m⊗y−m⊗y′=m⊗f(x)=(1⊗f)(m⊗x) by [F2] and [F3], whence v(m⊗y)=v(m⊗y′): the map c is well defined. It is balanced, being additive in each variable with c(ma,z)=v(ma⊗y)=v(m⊗(ay))=c(m,az), so by [F1] it induces a unique homomorphism w:M⊗AZ→W with w(m⊗z)=v(m⊗y); then w∘(1⊗g)=v, since both sides send m⊗y to v(m⊗y), and any w′ with w′∘(1⊗g)=v satisfies w′(m⊗z)=w′(m⊗g(y))=v(m⊗y), so w′=w by [F3].

2.1F2F5F8step 1.2step 1.3

Bimodules: if M is a (B,A)-bimodule, then M⊗AX is a left B-module with b(m⊗x)=(bm)⊗x by [F8], and every map considered above is B-linear: the induced tensor maps by (1⊗f)(b(m⊗x))=(bm)⊗f(x)=b(m⊗f(x)), and Φ,Ψ because their defining pairings and families are B-linear in m and B-linearity is checked on the generating elementary tensors and coordinate inclusions.

2.2F1F2F3F4F5step 1.2step 1.3

The maps Φ and Ψ are mutually inverse. First, Ψ∘Φ fixed on the generators ȷi(m⊗xi) of the direct sum equals ȷi(m⊗xi), since Φ(ȷi(m⊗xi))=(1⊗ȷi)(m⊗xi)=m⊗ȷi(xi) and then Ψ(m⊗ȷi(xi))=(m⊗xi)i=ȷi(m⊗xi); by [F5] this forces Ψ∘Φ=id⁡. Second, Φ∘Ψ and the identity agree on every elementary tensor m⊗(xi)i, where Ψ gives the finitely supported family (m⊗xi)i, Φ sends it to ∑i(1⊗ȷi)(m⊗xi)=∑im⊗ȷi(xi)=m⊗∑iȷi(xi)=m⊗(xi)i, and ∑iȷi(xi)=(xi); by [F3] this forces Φ∘Ψ=id⁡. If I=∅, then ⨁iXi=0 by [F4], and M⊗A0=0: the balanced map τ:M×0→M⊗A0 is zero by [F3], so the identity and the zero endomorphism of M⊗A0, which both compose with τ to τ, are equal by uniqueness in [F1]; the comparison map 0→M⊗A0 is then an isomorphism.

3.1F6step 1.1step 1.4step 1.5step 2.1step 2.2∎

Assembling: TM is additive by step 1.1, preserves cokernels by steps 1.4 and 1.5 (so it carries the given exact sequence to the exact sequence with kernel im⁡(1⊗f) and surjective 1⊗g, which is right exactness in the stated sequence form), and preserves arbitrary direct sums including the empty one by step 2.2; in the bimodule case step 2.1 shows that TM takes values in left B-modules and that all displayed maps are B-linear. No element of an auxiliary family is chosen globally, so no choice is used.

Depends on

Used by

Dependency tree · two levels

21 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