§17 Modules
§17.1 Modules
Just as groups act on sets, rings act on Abelian groups. When a ring acts on an Abelian group, that Abelian group is called a module over the ring.
When a group acts on a set, it must act by bijections, and therefore it must preserve properties such as the cardinality of the set. But when a ring acts on an Abelian group, it respects the additive structure inside the Abelian group. This is condition (1) in the definition below.
In this setting, we will build all the definitions of module algebra in much the same way as we did for groups.
Definition 17.1 Let R R R be a ring and let M M M be an Abelian group. A left action of R R R on M M M is a function
R × M → M , ( r , m ) ↦ r m \begin{aligned}
R\times M&\to M,\\
(r,m)&\mapsto rm
\end{aligned} R × M ( r , m ) → M , ↦ r m
such that for all r , s ∈ R r,s\in R r , s ∈ R and m , m ′ ∈ M m,m^{\prime}\in M m , m ′ ∈ M :
(1) r ( m + m ′ ) = r m + r m ′ r(m+m^{\prime})=rm+rm^{\prime} r ( m + m ′ ) = r m + r m ′ .
(2) ( r + s ) m = r m + s m (r+s)m=rm+sm ( r + s ) m = r m + s m .
(3) s ( r m ) = ( s r ) m s(rm)=(sr)m s ( r m ) = ( sr ) m .
(4) 1 m = m 1m=m 1 m = m .
Once a left action of R R R on M M M is specified, we call M M M a left R R R -module .
Remark Here, “multiplication by r r r ” may be interpreted as scaling by some element of the ring. Thus, a module is a set equipped with addition together with a notion of scaling by r r r .
There is a more concise way to express this. Everything above is equivalent to giving a ring homomorphism
R → E n d ( M ) . R\to\mathrm{End}(M). R → End ( M ) .
A right R R R -module is an Abelian group M M M equipped with a function
satisfying analogues of conditions (1)–(4).
At first, this may seem like a large amount of data, since we are simultaneously dealing with both R R R and M M M .
In practice, however, we usually fix a ring R R R and study only the relationships between different modules M M M .
Exercise Let M M M be a left R R R -module. Then
0 m = m and ( − r ) m = − ( r m ) . 0m=m\quad\text{and}\quad(-r)m=-(rm). 0 m = m and ( − r ) m = − ( r m ) .
Proof: For clarity, write
for the zero element of R R R .
By condition (2),
0 R m = ( 0 R + 0 R ) m = 0 R m + 0 R m . 0_Rm
=
(0_R+0_R)m
=
0_Rm+0_Rm. 0 R m = ( 0 R + 0 R ) m = 0 R m + 0 R m .
Therefore, by the cancellation law,
The 0 0 0 on the left is the additive identity of M M M .
Similarly,
r m + ( − r ) m = ( r − r ) m = 0 R m = 0. rm+(-r)m
=
(r-r)m
=
0_Rm
=
0. r m + ( − r ) m = ( r − r ) m = 0 R m = 0.
Example 17.1
(a) Let
R = R , M = R n , R=\mathbb{R},
\qquad
M=\mathbb{R}^n, R = R , M = R n ,
the n n n -dimensional real vector space.
Define a function
R × M → M , ( t , v ) ↦ t v ⃗ \begin{aligned}
\mathbb{R}\times M&\to M,\\
(t,v)&\mapsto t\vec{v}
\end{aligned} R × M ( t , v ) → M , ↦ t v
by scaling by t t t .
If
v ⃗ = ( v 1 , … , v n ) , \vec{v}
=
(v_1,\ldots,v_n), v = ( v 1 , … , v n ) ,
then
t v ⃗ = ( t v 1 , … , t v n ) . t\vec{v}
=
(tv_1,\ldots,tv_n). t v = ( t v 1 , … , t v n ) .
This satisfies all of the properties above.
(b) Every ring R R R is naturally a left module over itself.
(c) Here is an example that is further removed from the idea of “scaling” and closer to the idea of an “action”.
Let
be the ring of real-coefficient polynomials in the variable t t t .
Choose an
m × m m\times m m × m
matrix T T T , viewed as a linear map
T : R m → R m . T:\mathbb{R}^m\to\mathbb{R}^m. T : R m → R m .
Then
R m \mathbb{R}^m R m
is a left
R [ t ] \mathbb{R}[t] R [ t ] -module
with action defined by
( a 0 + a 1 t + ⋯ + a k t k ) v : = a 0 v + a 1 T ( v ) + ⋯ + a k ( T ∘ ⋯ ∘ T ) ( v ) , (a_0+a_1t+\cdots+a_kt^k)v
:=
a_0v+a_1T(v)+\cdots+a_k(T\circ\cdots\circ T)(v), ( a 0 + a 1 t + ⋯ + a k t k ) v := a 0 v + a 1 T ( v ) + ⋯ + a k ( T ∘ ⋯ ∘ T ) ( v ) ,
where
T ∘ ⋯ ∘ T T\circ\cdots\circ T T ∘ ⋯ ∘ T
denotes T T T composed with itself k k k times.
§17.2 Submodules
Definition 17.2 Let R R R be a ring and let M M M be a left R R R -module.
An Abelian subgroup
M ′ ⊂ M M^{\prime}\subset M M ′ ⊂ M
is called a submodule of M M M if
x ∈ M ′ ⇒ r x ∈ M ′ x\in M^{\prime}
\quad\Rightarrow\quad
rx\in M^{\prime} x ∈ M ′ ⇒ r x ∈ M ′
for all
r ∈ R r\in R r ∈ R .
Example 17.2
(a) If
and
M = R n , M=\mathbb{R}^n, M = R n ,
then a submodule is a subset closed under addition, additive inverses, and scalar multiplication.
This is exactly the same thing as a linear subspace of
R n \mathbb{R}^n R n .
(b) Let R R R be a commutative ring. Then
is an ideal if and only if I I I is a submodule of R R R .
(c) Let
be the
R [ t ] \mathbb{R}[t] R [ t ] -module
defined by a linear transformation
T : R k → R k . T:\mathbb{R}^k\to\mathbb{R}^k. T : R k → R k .
Then a submodule is a linear subspace V V V satisfying
T ( V ) ⊂ V . T(V)\subset V. T ( V ) ⊂ V .
In other words, it is a T T T -invariant subspace.
§17.3 Module Homomorphisms
Definition 17.3 Let M M M and N N N be left R R R -modules.
An R R R -module homomorphism , or R R R -module map , is a function
such that f f f is a group homomorphism and
f ( r x ) = r f ( x ) f(rx)=rf(x) f ( r x ) = r f ( x )
for all
r ∈ R r\in R r ∈ R
and
x ∈ M x\in M x ∈ M .
Definition 17.4 An R R R -module isomorphism is a bijective homomorphism.
Definition 17.5 The kernel and image of an R R R -module homomorphism
are respectively the kernel and image of f f f viewed as a group homomorphism.
Thus
ker ( f ) = { x ∣ f ( x ) = 0 } , \ker(f)
=
\{x\mid f(x)=0\}, ker ( f ) = { x ∣ f ( x ) = 0 } ,
and
i m ( f ) = { y ∈ N ∣ y = f ( x ) , x ∈ M } . \mathrm{im}(f)
=
\{y\in N\mid y=f(x),~x\in M\}. im ( f ) = { y ∈ N ∣ y = f ( x ) , x ∈ M } .
Example 17.3
(a) If
M ≅ R n M\cong\mathbb{R}^n M ≅ R n
and
N ≅ R m N\cong\mathbb{R}^m N ≅ R m
with their usual
R \mathbb{R} R -module structures, then a linear map
is an
R \mathbb{R} R -module homomorphism.
(b) (There is no obvious example corresponding to (b) above.)
(c) Let
be a left module defined by a linear transformation T T T .
Let
be a left module defined by a linear transformation
S : R n → R n . S:\mathbb{R}^n\to\mathbb{R}^n. S : R n → R n .
Then an R R R -module homomorphism is a linear map
f : R m → R n f:\mathbb{R}^m\to\mathbb{R}^n f : R m → R n
with the property
f ( T ( v ) ) = S ( f ( v ) ) . f(T(v))
=
S(f(v)). f ( T ( v )) = S ( f ( v )) .
Definition 17.6 Let M M M and N N N be left R R R -modules. The set of all R R R -module homomorphisms is denoted
H o m R ( M , N ) . \mathrm{Hom}_R(M,N). Hom R ( M , N ) .
Proposition 17.1
H o m R ( M , N ) \mathrm{Hom}_R(M,N) Hom R ( M , N )
is a left R R R -module.
Proof: Definition of scalar multiplication:
For
r ∈ R r\in R r ∈ R
and
f ∈ H o m R ( M , N ) f\in\mathrm{Hom}_R(M,N) f ∈ Hom R ( M , N ) ,
define the scalar multiple
r ⋅ f r\cdot f r ⋅ f
by
( r ⋅ f ) ( m ) = r f ( m ) , ∀ m ∈ M . (r\cdot f)(m)
=
rf(m),
\qquad
\forall m\in M. ( r ⋅ f ) ( m ) = r f ( m ) , ∀ m ∈ M .
Verify that r ⋅ f r\cdot f r ⋅ f is an R R R -module homomorphism:
Additivity:
( r ⋅ f ) ( m 1 + m 2 ) = r f ( m 1 + m 2 ) = r [ f ( m 1 ) + f ( m 2 ) ] = r f ( m 1 ) + r f ( m 2 ) = ( r ⋅ f ) ( m 1 ) + ( r ⋅ f ) ( m 2 ) . \begin{aligned}
(r\cdot f)(m_1+m_2)
&=
rf(m_1+m_2)\\
&=
r[f(m_1)+f(m_2)]\\
&=
rf(m_1)+rf(m_2)\\
&=
(r\cdot f)(m_1)
+
(r\cdot f)(m_2).
\end{aligned} ( r ⋅ f ) ( m 1 + m 2 ) = r f ( m 1 + m 2 ) = r [ f ( m 1 ) + f ( m 2 )] = r f ( m 1 ) + r f ( m 2 ) = ( r ⋅ f ) ( m 1 ) + ( r ⋅ f ) ( m 2 ) .
Thus
r ⋅ f r\cdot f r ⋅ f
is additive.
Compatibility with scalar multiplication:
For all
s ∈ R s\in R s ∈ R
and
m ∈ M m\in M m ∈ M ,
( r ⋅ f ) ( s m ) = r f ( s m ) = r [ s f ( m ) ] = s [ r f ( m ) ] = s ( r ⋅ f ) ( m ) . \begin{align*}
(r\cdot f)(sm)
&=
rf(sm)\\
&=
r[sf(m)]\\
&=
s[rf(m)]
\tag{since $R$ is commutative}\\
&=
s(r\cdot f)(m).
\end{align*} ( r ⋅ f ) ( s m ) = r f ( s m ) = r [ s f ( m )] = s [ r f ( m )] = s ( r ⋅ f ) ( m ) . ( since R is commutative )
Thus
r ⋅ f r\cdot f r ⋅ f
is R R R -linear.
Verify the module axioms:
Distributivity with respect to addition in the ring:
( ( r + s ) ⋅ f ) ( m ) = ( r + s ) f ( m ) = r f ( m ) + s f ( m ) = ( r ⋅ f + s ⋅ f ) ( m ) . \begin{aligned}
((r+s)\cdot f)(m)
&=
(r+s)f(m)\\
&=
rf(m)+sf(m)\\
&=
(r\cdot f+s\cdot f)(m).
\end{aligned} (( r + s ) ⋅ f ) ( m ) = ( r + s ) f ( m ) = r f ( m ) + s f ( m ) = ( r ⋅ f + s ⋅ f ) ( m ) .
Distributivity with respect to addition in the module:
( r ⋅ ( f + g ) ) ( m ) = r ( f + g ) ( m ) = r [ f ( m ) + g ( m ) ] = r f ( m ) + r g ( m ) = ( r ⋅ f ) ( m ) + ( r ⋅ g ) ( m ) . \begin{aligned}
(r\cdot(f+g))(m)
&=
r(f+g)(m)\\
&=
r[f(m)+g(m)]\\
&=
rf(m)+rg(m)\\
&=
(r\cdot f)(m)
+
(r\cdot g)(m).
\end{aligned} ( r ⋅ ( f + g )) ( m ) = r ( f + g ) ( m ) = r [ f ( m ) + g ( m )] = r f ( m ) + r g ( m ) = ( r ⋅ f ) ( m ) + ( r ⋅ g ) ( m ) .
Associativity of scalar multiplication:
( ( r s ) ⋅ f ) ( m ) = ( r s ) f ( m ) = r ( s f ( m ) ) = r ⋅ ( s ⋅ f ) ( m ) . \begin{aligned}
((rs)\cdot f)(m)
&=
(rs)f(m)\\
&=
r(sf(m))\\
&=
r\cdot(s\cdot f)(m).
\end{aligned} (( r s ) ⋅ f ) ( m ) = ( r s ) f ( m ) = r ( s f ( m )) = r ⋅ ( s ⋅ f ) ( m ) .
Identity:
( 1 R ⋅ f ) ( m ) = 1 R f ( m ) = f ( m ) . (1_R\cdot f)(m)
=
1_Rf(m)
=
f(m). ( 1 R ⋅ f ) ( m ) = 1 R f ( m ) = f ( m ) .
Conclusion:
Since all the module axioms are satisfied,
H o m R ( M , N ) \mathrm{Hom}_R(M,N) Hom R ( M , N )
is a left R R R -module under the scalar multiplication defined above.
§17.4 Direct Sums and Free Modules
Definition 17.7 Let M M M and N N N be left R R R -modules.
The direct sum
is defined to be the group
equipped with the R R R -module structure
r ( m , n ) : = ( r m , r n ) . r(m,n)
:=
(rm,rn). r ( m , n ) := ( r m , r n ) .
Proposition 17.2
is an R R R -module.
Proof: We already know that
is an Abelian group.
On the other hand,
1 ( m , n ) : = ( 1 m , 1 n ) = ( m , n ) 1(m,n)
:=
(1m,1n)
=
(m,n) 1 ( m , n ) := ( 1 m , 1 n ) = ( m , n )
because both M M M and N N N are modules.
Moreover,
r ( ( m , n ) + ( m ′ , n ′ ) ) = r ( m + m ′ , n + n ′ ) = ( r ( m + m ′ ) , r ( n + n ′ ) ) = ( r m + r m ′ , r n + r n ′ ) = ( r m , r n ) + ( r m ′ , r n ′ ) = r ( m , n ) + r ( m ′ , n ′ ) . \begin{align*}
r((m,n)+(m^{\prime},n^{\prime}))
&=
r(m+m^{\prime},n+n^{\prime})\\
&=
(r(m+m^{\prime}),
r(n+n^{\prime}))\\
&=
(rm+rm^{\prime},
rn+rn^{\prime})
\tag{3}\\
&=
(rm,rn)
+
(rm^{\prime},rn^{\prime})\\
&=
r(m,n)
+
r(m^{\prime},n^{\prime}).
\end{align*} r (( m , n ) + ( m ′ , n ′ )) = r ( m + m ′ , n + n ′ ) = ( r ( m + m ′ ) , r ( n + n ′ )) = ( r m + r m ′ , r n + r n ′ ) = ( r m , r n ) + ( r m ′ , r n ′ ) = r ( m , n ) + r ( m ′ , n ′ ) . ( 3 )
In (3), we used the fact that both M M M and N N N are left R R R -modules.
Example 17.4 If
and both M M M and N N N are also
R \mathbb{R} R
viewed as modules over themselves, then
R ⊕ R ≅ R × R ≅ R 2 \mathbb{R}\oplus\mathbb{R}
\cong
\mathbb{R}\times\mathbb{R}
\cong
\mathbb{R}^2 R ⊕ R ≅ R × R ≅ R 2
as groups, with the usual scalar multiplication
r ( x 1 , x 2 ) = ( r x 1 , r x 2 ) . r(x_1,x_2)
=
(rx_1,rx_2). r ( x 1 , x 2 ) = ( r x 1 , r x 2 ) .
Remark There is an obvious isomorphism
( M ⊕ N ) ⊕ O ≅ M ⊕ ( N ⊕ O ) , ( m , n , o ) ↦ ( m , n , o ) . (M\oplus N)\oplus O
\cong
M\oplus(N\oplus O),
\quad
(m,n,o)\mapsto(m,n,o). ( M ⊕ N ) ⊕ O ≅ M ⊕ ( N ⊕ O ) , ( m , n , o ) ↦ ( m , n , o ) .
Definition 17.8 Let R R R be a ring. The direct-sum module
R n : = R ⊕ ⋯ ⊕ R R^n
:=
R\oplus\cdots\oplus R R n := R ⊕ ⋯ ⊕ R
is called the free R R R -module of rank n n n .
§17.5 Universal Property of Free Modules
Question: Why is it called a free R R R -module?
Proposition 17.3 Let M M M be an R R R -module.
Any n n n -tuple of elements
x 1 , … , x n ∈ M x_1,\ldots,x_n\in M x 1 , … , x n ∈ M
uniquely determines an R R R -module homomorphism
defined by
( 0 , … , 0 , 1 , 0 , … , 0 ) ↦ x i , (0,\ldots,0,1,0,\ldots,0)
\mapsto
x_i, ( 0 , … , 0 , 1 , 0 , … , 0 ) ↦ x i ,
where the i i i th coordinate is 1 1 1 .
Remark This is the same property as that of a free group on n n n generators: any n n n -tuple of elements of a group G G G uniquely determines a map
Proof: Given
( x 1 , … , x n ) , (x_1,\ldots,x_n), ( x 1 , … , x n ) ,
define
by
X ( a 1 , … , a n ) : = a 1 x 1 + ⋯ + a n x n ∈ M . X(a_1,\ldots,a_n)
:=
a_1x_1+\cdots+a_nx_n
\in M. X ( a 1 , … , a n ) := a 1 x 1 + ⋯ + a n x n ∈ M .
This is a group homomorphism because
X ( ( a 1 , … , a n ) + ( b 1 , … , b n ) ) = ( a 1 + b 1 ) x 1 + ⋯ + ( a n + b n ) x n = ( a 1 x 1 + ⋯ + a n x x ) + ( b 1 x 1 + ⋯ + b n x n ) = X ( a 1 , … , a n ) + X ( b 1 , … , b n ) . \begin{aligned}
X((a_1,\ldots,a_n)+(b_1,\ldots,b_n))
&=
(a_1+b_1)x_1
+\cdots
+
(a_n+b_n)x_n\\
&=
(a_1x_1+\cdots+a_nx_x)
+
(b_1x_1+\cdots+b_nx_n)\\
&=
X(a_1,\ldots,a_n)
+
X(b_1,\ldots,b_n).
\end{aligned} X (( a 1 , … , a n ) + ( b 1 , … , b n )) = ( a 1 + b 1 ) x 1 + ⋯ + ( a n + b n ) x n = ( a 1 x 1 + ⋯ + a n x x ) + ( b 1 x 1 + ⋯ + b n x n ) = X ( a 1 , … , a n ) + X ( b 1 , … , b n ) .
The middle equality uses the fact that M M M is an R R R -module.
It is also an R R R -module homomorphism because
X ( r ( a 1 , … , a n ) ) = X ( ( r a 1 , … , r a n ) ) = ( r a 1 ) x 1 + ⋯ + ( r a n ) x n = r ( a 1 x 1 + ⋯ + a n x n ) = r X ( ( a 1 , … , a n ) ) . \begin{aligned}
X(r(a_1,\ldots,a_n))
&=
X((ra_1,\ldots,ra_n))\\
&=
(ra_1)x_1+\cdots+(ra_n)x_n\\
&=
r(a_1x_1+\cdots+a_nx_n)\\
&=
rX((a_1,\ldots,a_n)).
\end{aligned} X ( r ( a 1 , … , a n )) = X (( r a 1 , … , r a n )) = ( r a 1 ) x 1 + ⋯ + ( r a n ) x n = r ( a 1 x 1 + ⋯ + a n x n ) = r X (( a 1 , … , a n )) .
Again, the penultimate equality uses the fact that M M M is an R R R -module.
§17.6 The Free Module on 0 Generators
Exercise Let M M M be a left R R R -module. Prove that
r 0 M = 0 M , and r ( − x ) = − r x . r0_M=0_M,
\quad\text{and}\quad
r(-x)=-rx. r 0 M = 0 M , and r ( − x ) = − r x .
Proof: An action of R R R on M M M is equivalent to a ring homomorphism
R → E n d ( M ) . R\to\mathrm{End}(M). R → End ( M ) .
In particular, every element
r ∈ R r\in R r ∈ R
determines an Abelian-group homomorphism.
Therefore, scaling by r r r preserves the additive identity and additive inverses of M M M .
If you prefer a more computational proof, observe that
r 0 M + r 0 M = r ( 0 M + 0 M ) = r 0 M . r0_M+r0_M
=
r(0_M+0_M)
=
r0_M. r 0 M + r 0 M = r ( 0 M + 0 M ) = r 0 M .
Therefore, by the cancellation law in the Abelian group, we may subtract
r 0 M r0_M r 0 M
from both sides to obtain
r 0 M = 0 M . r0_M
=
0_M. r 0 M = 0 M .
Hence
r ( − x ) + r x = r ( − x + x ) = r 0 M = 0 M . r(-x)+rx
=
r(-x+x)
=
r0_M
=
0_M. r ( − x ) + r x = r ( − x + x ) = r 0 M = 0 M .
This shows that
r ( − x ) r(-x) r ( − x )
is the additive inverse of
r x rx r x .
Remark We understand
for
n ⩾ 1 n\geqslant1 n ⩾ 1 .
But what about
We should look for an R R R -module
such that there is a bijection
H o m R ( R ⊕ 0 , M ) ≅ M a p Sets ( ∅ , M ) . \mathrm{Hom}_R(R^{\oplus0},M)
\cong
\mathrm{Map}_{\text{Sets}}(\varnothing,M). Hom R ( R ⊕ 0 , M ) ≅ Map Sets ( ∅ , M ) .
But there is a unique function from the empty set to any set.
Therefore, we must find an R R R -module
such that there is exactly one module homomorphism from it to every module M M M .
The unique module with this property is the zero module, i.e. the trivial Abelian group satisfying