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 canonical comparison to the tensor functor of F(A) is balanced and natural

Statement

Let A,B be unital rings, let F:A-Mod→B-Mod be additive, and let M=F(A) carry the (B,A)-bimodule structure of F(A) is a (B,A)-bimodule for every additive functor F. For x∈X let ℓx:A→X, ℓx(a)=ax. Then

βX:M×X→F(X),βX(m,x)=F(ℓx)(m),

is balanced (Balanced maps from a right module and a left module, and bilinear maps over a commutative ring) and B-linear in m, so it induces a unique group homomorphism

τX:M⊗AX→F(X),τX(m⊗x)=F(ℓx)(m),

and each τX is B-linear. Moreover τ:M⊗A−⇒F is natural: F(u)∘τX=τY∘(1M⊗u) for every left A-linear u:X→Y (Natural transformation and its components). The construction of τ chooses no presentation of X and no elements.

Facts & Assumptions

Given: Unital rings A, B, an additive functor F:A-Mod→B-Mod, the (B,A)-bimodule M=F(A) with ma=F(ra)(m) for ra(x)=xa, a left A-module X, and x,x′∈X, a∈A, m∈M, b∈B.

[F1]

Left A-modules satisfy the module axioms, and right multiplication ra(x)=xa is an endomorphism of the left A-module A (Unital left and right modules over a ring; unqualified module means left module).

[F2]

The formula ma=F(ra)(m) makes M=F(A) a (B,A)-bimodule, so the right A-action and the left B-action are defined and commute: b(ma)=(bm)a (F(A) is a (B,A)-bimodule for every additive functor F).

[F3]

A balanced map M×X→W into an abelian group is additive in each variable and satisfies c(ma,x)=c(m,ax) (Balanced maps from a right module and a left module, and bilinear maps over a commutative ring).

[F4]

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

[F5]

If M is a (B,A)-bimodule, then M⊗AX carries a left B-module structure with b(m⊗x)=(bm)⊗x (A commuting outer scalar action descends to a tensor product).

[F6]

A natural transformation α:F⇒G is a family of components satisfying G(u)∘αX=αY∘F(u) for every u:X→Y (Natural transformation and its components).

[F7]

Module maps induce tensor maps with (1M⊗u)(m⊗x)=m⊗u(x), functorially (Module homomorphisms induce tensor-product homomorphisms functorially).

Proof

technique · direct
1.1F1

For each x∈X the map ℓx:A→X, ℓx(a)=ax, is left A-linear, since (a+a′)x=ax+a′x and (ca)x=c(ax); moreover ℓx+x′=ℓx+ℓx′ and ℓax=ℓx∘ra, because ℓax(c)=(ca)x=c(ax)=(ℓx∘ra)(c).

2.1F1F2F3step 1.1

The pairing βX(m,x)=F(ℓx)(m) is well defined because F(ℓx):M→F(X) is a B-module homomorphism; it is additive in m and B-linear in m because F(ℓx) is, and additive in x because F(ℓx+x′)=F(ℓx)+F(ℓx′) by additivity of F and step 1.1. It is balanced: βX(ma,x)=F(ℓx)(ma)=F(ℓx)(F(ra)(m))=F(ℓx∘ra)(m)=F(ℓax)(m)=βX(m,ax) by step 1.1, [F2] and functoriality.

3.1F4F5step 2.1

By [F4] the balanced pairing βX induces a unique group homomorphism τX:M⊗AX→F(X) with τX(m⊗x)=F(ℓx)(m). It is B-linear: by [F5] the left B-action on M⊗AX satisfies b(m⊗x)=(bm)⊗x, and τX(b(m⊗x))=F(ℓx)(bm)=b F(ℓx)(m)=b τX(m⊗x), because F(ℓx) is B-linear and elementary tensors generate; both sides are additive in the tensor variable, so equality on elementary tensors suffices.

4.1F6F7step 3.1

Naturality: for left A-linear u:X→Y one has u∘ℓx=ℓu(x), since u(ax)=a u(x), hence F(u)∘F(ℓx)=F(ℓu(x)) by functoriality. Evaluating at m and using [F7] gives F(u)(τX(m⊗x))=F(ℓu(x))(m)=τY(m⊗u(x))=τY((1M⊗u)(m⊗x)); both sides are additive in the tensor variable and agree on elementary tensors, so F(u)∘τX=τY∘(1M⊗u).

5.1F6step 3.1step 4.1∎

Steps 3.1 and 4.1 show that the components τX are B-linear maps assembling into a natural transformation τ:M⊗A−⇒F with τX(m⊗x)=F(ℓx)(m); the formulas used only the given element x and the module A, never a presentation of X, and no element of an auxiliary set is selected, so no presentation and no choice are involved.

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