Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Finite module duality is exact with commuting bimodule actions

Statement

Throughout, a bimodule over k-algebras means a k-vector space with k-bilinear commuting actions and agreeing scalar actions: (c1B)m=m(c1A)=cm for c∈k in a (B,A)-bimodule. This compatibility is an additional requirement beyond the ring-bimodule definition (S,R)-bimodules and commuting left and right scalar actions.

Let A be a finite-dimensional unital algebra over a field k, and let A-mod denote the category of finite-dimensional left A-modules with A-linear maps. For such a module X put X∗=Hom⁡k(X,k)=L(X,k) with the right A-action (λ⋅a)(x)=λ(ax), equivalently the left Aop-action a⋅λ:=λ⋅a; for an A-linear u:X→Y put u∗(λ)=λ∘u for λ∈Y∗. Then:

(i) (−)∗ is a contravariant k-linear functor from A-mod to the category of finite-dimensional left Aop-modules, and the evaluation ev⁡X:X→X∗∗, ev⁡X(x)(λ)=λ(x), is a natural isomorphism, so (−)∗ is a contravariant equivalence;

(ii) (−)∗ is exact, carrying every short exact sequence 0→X→iY→qZ→0 of finite-dimensional left A-modules to the short exact sequence 0→Z∗→q∗Y∗→i∗X∗→0;

(iii) if B is a unital k-algebra and X is a finite-dimensional (A,B)-bimodule, then X∗ is a (B,A)-bimodule under the commuting actions (b⋅λ)(x)=λ(xb) and (λ⋅a)(x)=λ(ax), and duality is a contravariant equivalence between the categories of finite-dimensional (A,B)-bimodules and finite-dimensional (B,A)-bimodules, with the k-linear maps that are simultaneously A-linear and B-linear as morphisms.

No choice is used.

Facts & Assumptions

Given: The agreeing scalar convention above, a field k, a finite-dimensional unital k-algebra A, and the category A-mod of finite-dimensional left A-modules. For part (iii), a unital k-algebra B and a finite-dimensional (A,B)-bimodule X.

[F1]

For a k-vector space V, the algebraic dual V∗=L(V,k) is the space of linear functionals with pointwise addition and scalar multiplication (Linear functionals and the algebraic dual V∗=L(V,F), The space L(V,W) of linear maps with pointwise addition and scalar multiplication).

[F2]

If (v1,…,vn) is an ordered basis of a finite-dimensional k-vector space V, the coordinate functionals vi∗(vj)=δij form a basis of V∗, so dim⁡kV∗=dim⁡kV (The dual family (b∗)b∈B associated to a Hamel basis B, defined by b∗(c)=δbc, The dual family of a finite basis is a basis of the dual space, with the same dimension).

[F3]

A right R-module is the same data as a left Rop-module, and a left R-module is the same data as a right Rop-module (Unital left and right modules over a ring; unqualified module means left module, The opposite ring Rop).

[L1]

Hom-groups are abelian groups under pointwise operations, composition is additive and k-bilinear, and identity maps are two-sided units (The abelian group Hom⁡R(M,N) and maps induced by pre- and postcomposition, k-linear categories and k-linear functors).

[L2]

Rank-nullity: a k-linear map T:U→W with U finite-dimensional satisfies dim⁡kU=dim⁡k(ker⁡T)+dim⁡k(im⁡T) (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

[L3]

In a short exact sequence 0→X→iY→qZ→0 of modules, i is injective, q is surjective, and im⁡i=ker⁡q (Exact sequences and short exact sequences of modules).

[L4]

Every linearly independent finite family in a finite-dimensional k-vector space is contained in a basis of that space, and no choice principle is used (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

[L6]

In an (S,R)-bimodule N the two actions commute: (sn)r=s(nr) for all s∈S, n∈N, r∈R ((S,R)-bimodules and commuting left and right scalar actions).

Proof

technique · direct
1.1F1F2F3givenalgebra

For λ∈X∗ and a∈A define λ⋅a by (λ⋅a)(x)=λ(ax); this is k-linear in x because x↦ax is k-linear and λ is, and the right-module axioms hold: (λ+μ)⋅a=λ⋅a+μ⋅a and λ⋅(a+a′)=λ⋅a+λ⋅a′ by linearity of λ and additivity of the action of A, while (λ⋅a)⋅a′=λ⋅(aa′) because both sides send x to λ(a(a′x)), and λ⋅1=λ. Hence X∗ is a right A-module, equivalently by [F3] a left Aop-module, and [F2] gives dim⁡kX∗=dim⁡kX<∞, so X∗ is a finite-dimensional left Aop-module.

1.2F1L1algebra

For A-linear u:X→Y the map u∗:Y∗→X∗, u∗(λ)=λ∘u, is k-linear, since composition with the k-linear u is additive and k-homogeneous by [L1]; moreover (1X)∗=1X∗ and (v∘u)∗=u∗∘v∗ for composable A-linear maps, while u↦u∗ is additive and k-homogeneous, because (u+v)∗(λ)=λ∘(u+v)=λ∘u+λ∘v and (cu)∗=c u∗ for c∈k by [L1].

1.3F1L3algebra

Let 0→X→iY→qZ→0 be a short exact sequence of finite-dimensional left A-modules. Then i∗∘q∗=0, since (i∗∘q∗)(λ)=i∗(λ∘q)=λ∘q∘i and q∘i=0 by [L3]; and q∗ is injective, since if q∗(λ)=λ∘q=0 then λ vanishes on im⁡q=Z by surjectivity of q from [L3], so λ=0. Thus 0→Z∗→q∗Y∗→i∗X∗ is exact at Z∗ and a complex at Y∗.

1.4F2L3L4L5chooseconstructalgebra

The map i∗ is surjective: let (x1,…,xm) be an ordered basis of the finite-dimensional space X; since i is injective by [L3], the images i(x1),…,i(xm) are linearly independent and by [L4] are contained in an ordered basis (y1,…,yn) of Y with yj=i(xj) for j≤m; let (y1∗,…,yn∗) be its dual basis of Y∗ by [F2]. Given λ=∑j≤mcjxj∗ in X∗ with the dual basis (xj∗) of [F2], put μ=∑j≤mcjyj∗∈Y∗; then i∗(μ)(xr)=μ(i(xr))=μ(yr)=cr=λ(xr) for every r≤m, so i∗(μ)=λ by [L5]. Hence im⁡i∗=X∗.

2.1F1F3L6algebra

For an (A,B)-bimodule X define (b⋅λ)(x)=λ(xb) and (λ⋅a)(x)=λ(ax) for a∈A, b∈B, λ∈X∗, x∈X; as in step 1.1 both are k-linear functionals and the module axioms hold for the left B- and right A-actions, so X∗ is at once a left B-module and a right A-module. The two actions commute: ((b⋅λ)⋅a)(x)=(b⋅λ)(ax)=λ((ax)b)=λ(a(xb))=(λ⋅a)(xb)=(b⋅(λ⋅a))(x), using the bimodule identity (ax)b=a(xb) of [L6]; hence X∗ is a (B,A)-bimodule.

2.2L2L3algebra

In the situation of step 1.3, dim⁡kY=dim⁡kX+dim⁡kZ: rank-nullity [L2] applied to the k-linear q gives dim⁡kY=dim⁡k(ker⁡q)+dim⁡k(im⁡q), and ker⁡q=im⁡i with i injective and q surjective by [L3], so dim⁡k(ker⁡q)=dim⁡kX and dim⁡k(im⁡q)=dim⁡kZ.

2.3step 1.1step 1.2algebra

The map u∗ is Aop-linear: for λ∈Y∗ and a∈A, u∗(λ⋅a)(x)=(λ⋅a)(u(x))=λ(au(x))=λ(u(ax))=(u∗λ)(ax)=(u∗(λ)⋅a)(x) for all x, using the action of step 1.1 and A-linearity of u. Consequently, with step 1.1 for objects and step 1.2 for the morphism assignment, identities, composition and k-linearity on hom-spaces, (−)∗ is a contravariant k-linear functor from A-mod to finite-dimensional left Aop-modules.

2.4F2step 1.1choosealgebra

Applying step 1.1 with the unital algebra Aop in place of A, the dual X∗∗ of the finite-dimensional left Aop-module X∗ is a finite-dimensional left (Aop)op=A-module, and ev⁡X:X→X∗∗, ev⁡X(x)(λ)=λ(x), is k-linear; it is A-linear because ev⁡X(ax)(λ)=λ(ax)=(λ⋅a)(x)=ev⁡X(x)(λ⋅a)=(a⋅ev⁡X(x))(λ) for the left action on X∗∗ induced by step 1.1. Choosing an ordered basis (x1,…,xm) of X with dual basis (x1∗,…,xm∗) of X∗, the dual family (ε1,…,εm) of (x1∗,…,xm∗) is a basis of X∗∗ by [F2], and ev⁡X(xi)(xj∗)=δij=εi(xj∗) for all i,j; hence ev⁡X(∑iaixi)=∑iaiεi, which is zero only for the zero combination and realizes every element of X∗∗, so ev⁡X is a k-linear isomorphism.

3.1F2L2step 1.3step 1.4step 2.2algebra

By rank-nullity [L2] applied to i∗ and q∗, and [F2] together with steps 1.3, 1.4 and 2.2: dim⁡k(ker⁡i∗)=dim⁡kY∗−dim⁡k(im⁡i∗)=dim⁡kY−dim⁡kX, while dim⁡k(im⁡q∗)=dim⁡kZ∗−dim⁡k(ker⁡q∗)=dim⁡kZ; hence by step 2.2 both quantities equal dim⁡kZ.

3.2step 1.2step 2.1algebra

A map u:X→Y of (A,B)-bimodules, that is u(axb)=a u(x) b for all a∈A, b∈B, x∈X, has u∗ a map of (B,A)-bimodules: u∗(b⋅λ)(x)=(b⋅λ)(u(x))=λ(u(x)b)=λ(u(xb))=(u∗λ)(xb)=(b⋅(u∗λ))(x) and u∗(λ⋅a)(x)=(λ⋅a)(u(x))=λ(au(x))=λ(u(ax))=(u∗λ)(ax)=((u∗λ)⋅a)(x) for all x, using the actions of step 2.1; with step 1.2 the assignment is functorial on the bimodule categories.

3.3step 1.2step 2.3step 2.4algebra

For A-linear u:X→Y, x∈X and λ∈Y∗ one has (u∗∗∘ev⁡X)(x)(λ)=ev⁡X(x)(u∗λ)=u∗(λ)(x)=λ(u(x))=ev⁡Y(u(x))(λ), so ev⁡Y∘u=u∗∗∘ev⁡X, where u∗∗=(u∗)∗ is the map of step 2.3; hence the isomorphisms ev⁡X of step 2.4 form a natural isomorphism 1⇒(−)∗∗. Therefore (−)∗ is a contravariant equivalence of categories with quasi-inverse (−)∗, since both composites are (−)∗∗ and are naturally isomorphic to the identities, which proves (i).

4.1step 1.3step 3.1algebra

In the situation of step 1.3, im⁡q∗⊆ker⁡i∗ because i∗∘q∗=0, and by step 3.1 both are k-subspaces of Y∗ of dimension dim⁡kZ; since a subspace of the same finite dimension equals the whole space, im⁡q∗=ker⁡i∗. With step 1.3 the dual sequence 0→Z∗→q∗Y∗→i∗X∗→0 is exact, which proves (ii).

4.2step 2.1step 2.4step 3.2step 3.3algebra

For an (A,B)-bimodule X the evaluation of step 2.4 is also B-linear on the right: ev⁡X(xb)(λ)=λ(xb)=(b⋅λ)(x)=ev⁡X(x)(b⋅λ)=(ev⁡X(x)⋅b)(λ) for all b∈B, λ∈X∗, where the right B-action on X∗∗ is the one induced by the left B-action on X∗ of step 2.1; so ev⁡X is a map of (A,B)-bimodules, and it is natural in the bimodule variable by the computation of step 3.3 applied to bimodule maps. By steps 3.2 and 3.3 the restriction of (−)∗ to finite-dimensional bimodules is a contravariant equivalence between finite-dimensional (A,B)-bimodules and finite-dimensional (B,A)-bimodules with quasi-inverse (−)∗, which proves (iii).

5.1step 1.4step 2.4step 4.1step 3.3step 4.2given∎

Steps 3.3, 4.1 and 4.2 prove (i), (ii) and (iii) respectively. The only choices made are finite bases, dual bases and basis extensions in finite-dimensional spaces, supplied without any choice principle by [F2] and [L4], so no choice is used.

Depends on

Used by

Dependency tree · two levels

71 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