Alphabeta Math
LemmaStatement: AI-adaptedProof: 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 dual-basis isomorphism for a finitely generated projective bimodule

Statement

Let B and A be unital rings and let P be a (B,A)-bimodule that is finitely generated and projective as a left B-module. Then P∨=Hom⁡B(P,B) is an (A,B)-bimodule under (aφ)(p)=φ(pa) and (φb)(p)=φ(p)b, and the evaluation map ev⁡:Hom⁡B(P,B)⊗BY⟶Hom⁡B(P,Y),φ⊗y⟼(p↦φ(p)y), is an isomorphism of abelian groups. It is natural in the left B-module Y and is an isomorphism of left A-modules when both sides carry the actions induced by (aφ)(p)=φ(pa) and (aψ)(p)=ψ(pa). If pi∈P and φi∈Hom⁡B(P,B) form a dual basis with p=∑iφi(p)pi for all p, then the inverse is h↦∑iφi⊗h(pi). In particular, if P is a left B-module and Y ranges over left B-modules, then Hom⁡B(P,−)≅Hom⁡B(P,B)⊗B− naturally. No commutativity is assumed and no choice is used.

Facts & Assumptions

Given: Unital rings B and A, a (B,A)-bimodule P that is finitely generated and projective as a left B-module, and P∨=Hom⁡B(P,B).

[F1]

A (B,A)-bimodule is a left B-module and a right A-module whose actions commute: (bp)a=b(pa) ((S,R)-bimodules and commuting left and right scalar actions).

[F2]

For left R-modules M,N the set Hom⁡R(M,N) is an abelian group under pointwise addition, and pre- and postcomposition with module maps are additive (The abelian group Hom⁡R(M,N) and maps induced by pre- and postcomposition).

[F3]

A left B-module is finitely generated when it is generated by a finite subset, and the generated submodule of a subset is the set of its finite B-linear combinations (Generated submodule, cyclic and finitely generated modules, module basis and free module, The submodule generated by a subset consists of the finite R-linear combinations of that subset).

[F4]

A projective module P has the lifting property for epimorphisms: every surjective module map onto P admits a section (Projective modules and the lifting property; the lifting property applied to the identity of P produces the section).

[F5]

A family of maps out of the summands of a direct sum extends uniquely to a map out of the direct sum, and an element of a direct sum is the finite sum of its coordinate inclusions (The direct sum of an indexed family of modules, Universal property of a direct sum of modules).

[F6]

A balanced pairing on M×N into an abelian group induces a unique group homomorphism out of the tensor product, and an elementary-tensor formula descends exactly when its pairing is balanced (Universal property of the tensor product for balanced maps into abelian groups, A formula on elementary tensors defines a homomorphism exactly when its underlying pairing is balanced).

[F7]

If SMR is an (S,R)-bimodule and N is a left R-module, then M⊗RN carries a unique left S-module structure with s(m⊗n)=(sm)⊗n (A commuting outer scalar action descends to a tensor product).

[F8]

Module maps g:N→N′ induce 1⊗g on tensor products, compatibly with identities and composition (Module homomorphisms induce tensor-product homomorphisms functorially).

Proof

technique · direct
1.1F1F2givenalgebra

(P∨ is an (A,B)-bimodule.) For a∈A and φ∈P∨, the prescription (aφ)(p):=φ(pa) is additive in p because the right A-action and φ are additive, and it is left B-linear because P is a bimodule and φ is left B-linear: (aφ)(bp)=φ((bp)a)=φ(b(pa))=bφ(pa)=b(aφ)(p). For b∈B the prescription (φb)(p):=φ(p)b is additive and left B-linear because (φb)(b′p)=φ(b′p)b=(b′φ(p))b=b′(φ(p)b). The module laws for a↦aφ and b↦φb follow from the ring laws of A and B and the module laws of P, and the two actions commute, (aφ)b=a(φb), because both sides send p to φ(pa)b; hence P∨ is an (A,B)-bimodule.

1.2F3F4F5givenconstruct

(Existence of a dual basis.) Since P is finitely generated, it has a finite generating set x1,…,xn by [F3]; the maps βi:B→P, b↦bxi, are left B-linear, so the universal property of the direct sum Bn gives a unique left B-linear q:Bn→P with q ȷi=βi. This q is surjective: every p∈P is a finite B-linear combination ∑irixi by [F3], and ∑irixi=q(∑iȷi(ri)). By [F4] the epimorphism q onto the projective module P has a section s:P→Bn with qs=1P; write πi:Bn→B for the coordinate projections. Setting pi:=xi and φi:=πi∘s gives left B-linear maps φi:P→B, and for every p the description of elements of a direct sum [F5] gives s(p)=∑iȷi(πi(s(p))), so p=qs(p)=∑iπi(s(p)) qȷi(1)=∑iφi(p) pi. Only finitely many objects are selected inside the given finite generating set, so no choice principle is used.

1.3F1F2givenalgebra

(The evaluation pairing is balanced.) For fixed y∈Y the map φ↦(p↦φ(p)y) is additive by [F2], and for fixed φ the map y↦(p↦φ(p)y) is additive; the pairing (φ,y)↦(p↦φ(p)y) from P∨×Y to Hom⁡B(P,Y) is therefore additive in each variable. It is B-balanced because (φb)(p)y=φ(p)by=φ(p)(by) for b∈B: forming (φb,y) and (φ,by) gives the same map P→Y.

2.1F6F8F2step 1.3

(The evaluation map exists and is natural.) By the universal property of the tensor product [F6], the balanced pairing of step 1.3 induces a unique group homomorphism ev⁡:P∨⊗BY→Hom⁡B(P,Y) with ev⁡(φ⊗y)=(p↦φ(p)y). For a left B-module map g:Y→Y′, the composites ev⁡Y′∘(1⊗g) and g∗∘ev⁡Y are group homomorphisms that agree on every elementary tensor φ⊗y, both sending it to (p↦φ(p)g(y)) by [F8] and [F2]; since the elementary tensors generate the tensor product additively, the two maps are equal, which is naturality in Y.

2.2F2step 1.2givenconstruct

(A candidate inverse from the dual basis.) Fix the dual basis pi,φi of step 1.2 and define δ:Hom⁡B(P,Y)→P∨⊗BY by δ(h):=∑iφi⊗h(pi); this is a finite sum, and it is additive in h because each evaluation h↦h(pi) and the tensor product are additive.

3.1F2F6step 1.2step 2.1step 2.2algebra

(The two composites are identities.) For h∈Hom⁡B(P,Y), applying ev⁡ to δ(h) gives the map p↦∑iφi(p)h(pi), which equals h(p) because h is left B-linear and p=∑iφi(p)pi; hence ev⁡∘δ=1. For an elementary tensor, δ(ev⁡(φ⊗y))=∑iφi⊗φ(pi)y. The element ∑iφiφ(pi) of P∨ equals φ, since for every p one has (∑iφiφ(pi))(p)=∑iφi(p)φ(pi)=φ(∑iφi(p)pi)=φ(p) by left B-linearity of φ and the dual-basis formula; hence ∑iφi⊗φ(pi)y=(∑iφiφ(pi))⊗y=φ⊗y, so δ∘ev⁡ is the identity on elementary tensors and therefore on all of P∨⊗BY. Thus ev⁡ is a bijection with inverse δ, and it is in particular an isomorphism of abelian groups.

3.2F7F2step 1.1step 2.1algebra

(A-linearity.) On P∨⊗BY the left A-action a(φ⊗y)=(aφ)⊗y is the one of [F7] for the (A,B)-bimodule P∨ of step 1.1, and on Hom⁡B(P,Y) we use (aψ)(p)=ψ(pa), which is again a left B-linear map by the same bimodule computation as in step 1.1. For a∈A and φ⊗y, ev⁡(a(φ⊗y)) sends p to (aφ)(p)y=φ(pa)y, and aev⁡(φ⊗y) sends p to ev⁡(φ⊗y)(pa)=φ(pa)y; the two sides agree on elementary tensors and hence everywhere, so ev⁡ is left A-linear.

4.1step 1.1step 1.2step 1.3step 2.1step 2.2step 3.1step 3.2∎

Steps 1.1-1.3 and 2.1 construct the (A,B)-bimodule P∨ and the natural evaluation map, steps 2.2 and 3.1 show it is an isomorphism with the stated inverse built from any dual basis, and step 3.2 upgrades it to a left A-module isomorphism. Retaining only the group structures, steps 2.1 and 3.1 give the natural isomorphism Hom⁡B(P,−)≅Hom⁡B(P,B)⊗B− of the final sentence: neither the existence of the dual basis nor the two composite computations uses the A-action, so for a left B-module P finitely generated and projective the result applies with any right A-structure on P or with none. The only selections made lie inside the finite data of a generating set and a section, so no choice principle is used.

Depends on

Used by

Dependency tree · two levels

28 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