Blog Archive

Friday, March 8, 2024

Introduction to tensor 1: Basic property of tensor product

Balanced_product_and_Bilinear_map (1)

If you don't know what is R− module, then just consider the R or C− vector space.

We will introduce two versions of the tensor product, and we will have more interest in the bilinear tensor.

The blog does not involve any commutative diagrams, readers should draw them by their hands.

 

Balanced product and Bilinear map

Balanced product

Definition 1.1

Let R be a ring, consider the module MR,RN and abelian group (A,+), if a map

(1)B:M×N→A

satisfies the following conditions, we will call B balanced product.

†. B(x+x′,y)=B(x,y)+B(x′,y),B(x,y+y′)=B(x,y)+B(y,y′)

†.B(xr,y)=B(x,ry)

Where x,x′∈M,y,y′∈N,r∈R.

Proposition 1.2

All the balanced product B:M×N→A form an abelian group A.

Proof.

Let B,B′∈A, (B+B′)(x+x′,y)=B(x+x′,y)+B(x+x′,y)=B(x,y)+B(x′,y)+B′(x,y)+B′(x′,y)

Using the fact that A is an abelian group we get

(2)B(x,y)+B(x′,y)+B′(x,y)+B′(x′,y)=(B+B′)(x,y)+(B+B′)(x′,y)

Similarly for the y side.

To see (B+B)′(xr,y)=(B+B′)(x,ry)

(3)(B+B)′(xr,y)=B(xr,y)+B′(rx,y)=B(x,ry)+B′(x,ry)=(B+B′)(x,ry)

It is easy to see that nB∈A. ◻

The balanced product gives us a functor Bal(M×N:−):Ab→Ab

For the morphism, Let f:A→A′ be a group homomorphism, then

(4)Bal(M×N:f)=f∗,f∗(B)=f∘B=B′

Here Bal(M×N:∗) define a new category.

The object is balanced map M×N→A. Morphism is f∗.

Example of balanced map.

Let T be a self-adjoint linear map over a R vector space V. Let R[T] act on V, we get a R[T]− module.

Let p(T)∈R[T], p(T)∗=p(T∗)=p(T). Then the inner product ⟨−,−⟩ is a balanced product over the R[T]− module.

Since

(5)⟨p(T)v,w⟩=⟨v,p(T)w⟩

Bilinear map

Definition 1.3

Let R be a commutative ring, consider three R− modules M,N,A.

If a map B:M×N→A satisefies the following conditions:

†. B(x+x′,y)=B(x,y)+B(x′,y),B(x,y+y′)=B(x,y)+B(x,y′)

†. B(rx,y)=B(x,ry)=rB(x,y)

Then we call B a bilinear map.

Proposition 1.4. All the bilinear map from M×N→A , Bil(M×N,A) is a R−module.

Proof. Same things as balanced map.

Proposition 1.5. Bil(M×N,−):R− module to R− module is a functor.

Proof. same.

Tensor product for balanced map

Definition 2.1.

The tensor product M×N⟶M⊗RN is the initial object of this category.

Sometimes we will omit the arrow ⟶ and R, just say that M⊗N is the tensor product.

Remark.

The sturcture of M⊗N is not funny. We always need to consider the arrow when we deal with the property of tensor product.

Proposition 2.2 For any MR,RN, M⊗N exsist.

Let us consider the free Z− module over M×N, i.e. F

The elements

(6)(x+x′,y)−(x,y)−(x′,y)(x,y+y′)−(x,y)−(x,y′)(xr,y)−(x,ry)

will generate a sub Z− module I.

The map

(7)M×N⟶FI

satisfies the universal property of M×N⟶M⊗N.

Since B is a balanced map if and only if B vanish at I.

Tensor product for bilinear map

Proposition 2.3. Bil(M×N,∗) define a category. Here the object is M×N→A, morphism is f∗

Definition 2.4. Tensor product of M,N is the initial object in Bil(M×N,∗).

Proposition 2.5. Tensor product of M,N exists for any R− module.

Proof. Consider the free R module of M×N , F and consider the submodule generated by

(8)(x+x′,y)−(x,y)−(x′,y)(x,y+y′)−(x,y)−(x,y′)(rx,y)−r(x,y),(x,ry)−r(x,y)

That is, I.

Then F/I satisfies the universal property of the tensor product.

Since B is bilinear if and only if B vanishing at I.

Bifunctor

Let C,D be two categories , bifunctor is a functor (−)⊗(−):C×C→D.

In particular, we are interested in the case D=C.

Example. 3.1

Let C be a category that finite product/coproduct exists. Then (−)×(−):C×C→C is a bifunctor.

For example, let Prop be the category of propositional logic,

The object is the proposition and the morphism is ⟹.

Then ∧,∨ are bifunctors. ∧:(p,q)→p∧q,∨:(p,q)→p∨q

For the morphism, ∧(p⟹p′,q⟹q′):=p∧q⟹p′∧q′

Similarly, ∨(p⟹p′,q⟹q′):=p∨q⟹p′∨q′.

Consider the groupoid of Prop, the De Morgan Law is a Natural isomorphism between ∧ and ∨.

Readers could generalise it to lattice. For example, the divisor of n, n↓, and consider gcd,lcm.

Now let C be the category of R-module, where R∈CRing.

Proposition 3.2

The product and tensor product define two bifunctors in R−Mod.

×:(M,N)→M×N,(φ,ψ)→φ×ψ.

(9)⊗:(M,N)→M⊗N,(φ,ψ)→(φ⊗ψ)

Proposition 3.3

Then the balanced/bilinear map

(10)M×N⟶M⊗N

Define a natural transformation η:(−)×(−)⟶(−)⊗(−).

Proof.

Consider φ:M⟶M′,ψ:N⟶N′.

Then B:M×N⟶M′×N′⟶M′⊗N′, B(m,n)=φ(m)⊗ψ(n) is a balanced/bilinear map.

By universal property of tensor product, ∃!φ⊗ψ:(M×N→M⊗N)⟶(M×N→M′⊗N′) makes the diagram commute. ◻

The diagram commute tell us that φ⊗ψ(m⊗n)=φ(m)⊗ψ(n).

Hence (φ⊗ψ)∘(φ′⊗ψ′)=(φ∘φ′⊗ψ∘ψ′).

Tensor-Hom adjoint for bilinear map

Lemma 4.1 Let N be a R-module, then (−)⊗N:R−Mod→R−Mod is a functor.

Proof. It follows from ⊗ is a bifunctor directly.

Proposition. 4.2

(11)HomR−Mod(M⊗N,K)≅HomR−Mod(M,HomR−Mod(N,K))

Proof.

Define ϕ:HomR−Mod(M⊗N,K)⟶HomR−Mod(M,HomR−Mod(N,K))

For any f:M⊗N→K, and x∈M, ϕ(f)(x):=f(x⊗n). Here f(x⊗n):N→K and ϕ(f)(x):M→(N→K).

Firstly we need to prove that ϕ(f)(x) is a module homomorphism N→K.

(12)f(x⊗(n+n′))=f(x⊗n+x⊗n′)=f(x⊗n)+f(x⊗n′)
(13)f(x⊗(rn))=f(r(x⊗n))=rf(x⊗n)

Now we need to check that ϕ:ϕ:HomR−Mod(M⊗N,K)⟶HomR−Mod(M,HomR−Mod(N,K)) is a R− module homomorphism.

(14)ϕ(f+g)(x)(n(=(f+g)(x⊗n)=f(x⊗n)+g(x⊗n)=ϕ(f)(x)(n)+ϕ(g)(x)(n)
(15)ϕ(rf)(x)(n)=(rf)(x⊗n)=rf(x⊗n)=rϕ(f)(x)(n)

Then we need to check that ϕ is bijective.

Let ϕ(f)≠ϕ(g), then ∃x,f(x⊗n)≠g(x⊗n), hence f≠g.

To see it is surjective, let h∈HomR−Mod(M,HomAb(N,K)),

Observe that h is bilinear map since h is a R− mod homomorphism and h(x) is a R− module homomorphism.

(16)h(x+x′)(n)=h(x)(n)+h(x′)(n),h(x)(n+n′)=h(x)(n)+h(x)(n′)
(17)h(rx)(n)=rh(x)(n)=h(x)(rn)

By the universal property of tensor product,

(18)∃!f,f(x⊗n)=h(x)(n)
(19)ϕ(f)=f(x⊗−)=h(x)(−)◻

Tensor product as operation

We would like to prove the following result:

(20)(M⊗N)⊗P≅M⊗(N⊗P),M⊗N≅N⊗M,(⨁i∈IMi)⊗N=⨁i∈IMi⊗N,R⊗M≅M

The assotiative law and commutative law leaves to reader.

For the third one, the left adjoint preserves colimit.

For the last one,

(22)R⊗M→M:r⊗m,M→R⊗M:m→1⊗m

Zero divisor

Proposition.5.2View Z/mZ,Z/nZ as two Z− module, if gcd(m,n)=1, then Z/mZ⊗Z/nZ=0

Since mZ+nZ=Z,(by the lattice anti isomorphism is PID ) there exists t,s∈Z,tm+sn=1

Hence ∀a⊗b∈Z/mZ⊗Z/nZ

a⊗b=(tm+sn)a⊗b=t(ma)⊗b+s(a⊗nb)=0⊗b+a⊗0=(0×0)⊗b+a⊗(0×0)=0+0=0

 

No comments:

Post a Comment

Popular Posts