Three questions about linear algebra

Artusartos
Messages
236
Reaction score
0
There is a theorem in our textbook that says:

Every abelian group G is a Z-module. Moreover, the Z-module structure
on G is unique: for n ∈ Z and g ∈ G, ng is the n-th power of g in the group structure of G. (Thus, if n > 0, ng = g + · · · + g, the sum of n copies of g.) Finally, every group homomorphism between abelian groups is a Z-module homomorphism.

My questions:

a) "Finally, every group homomorphism between abelian groups is a Z-module homomorphism."...what's the difference between saying that something is a Z-module homomorphism or just any homomorphism?

b) So, in order to show that any abelian group is a Z-module, we show:

(m + n)a = ma + na
m(a + b) = ma + mb
(mn)a = m(na)
1a = a

For some reason, I can't see where the "abelian" property is being used when showing that an abelian group is a Z-module.

c) Let f : A → B be a ring homomorphism. Then B is a left A-module
via a · b = f(a)b.

So when they say a · b = f(a)b, are they assuming that f(a)b is in B?

Thanks in advance
 
Physics news on Phys.org
Artusartos said:
There is a theorem in our textbook that says:

Every abelian group G is a Z-module. Moreover, the Z-module structure
on G is unique: for n ∈ Z and g ∈ G, ng is the n-th power of g in the group structure of G. (Thus, if n > 0, ng = g + · · · + g, the sum of n copies of g.) Finally, every group homomorphism between abelian groups is a Z-module homomorphism.

My questions:

a) "Finally, every group homomorphism between abelian groups is a Z-module homomorphism."...what's the difference between saying that something is a Z-module homomorphism or just any homomorphism?
A "group homorphism" preserves the properties of the group: f(a+ b)= f(a)+ f(b) and f(-a)= -f(a). Saying that it is also a "Z-module homomorphism" means it also preserves the Z-module property: the properties shown in (b), below.

b) So, in order to show that any abelian group is a Z-module, we show:

(m + n)a = ma + na
m(a + b) = ma + mb
(mn)a = m(na)
1a = a

For some reason, I can't see where the "abelian" property is being used when showing that an abelian group is a Z-module.
Look at m(a+ b)= ma+ mb. With m= 2, say, that says (a+ b)+ (a+ b)= (a+ a)+ (b+ b). That requires commutativity.

c) Let f : A → B be a ring homomorphism. Then B is a left A-module
via a · b = f(a)b.

So when they say a · b = f(a)b, are they assuming that f(a)b is in B?
I wouldn't use the word "assume". We are told that "f: A→B". That means that, for every a in A, f(a) is in B.

Thanks in advance
 
HallsofIvy said:
A "group homorphism" preserves the properties of the group: f(a+ b)= f(a)+ f(b) and f(-a)= -f(a). Saying that it is also a "Z-module homomorphism" means it also preserves the Z-module property: the properties shown in (b), below.


Look at m(a+ b)= ma+ mb. With m= 2, say, that says (a+ b)+ (a+ b)= (a+ a)+ (b+ b). That requires commutativity.


I wouldn't use the word "assume". We are told that "f: A→B". That means that, for every a in A, f(a) is in B.

Thanks a lot...

I have one more question if you don't mind...

Let f_i : M_i → N be A-module homomorphisms for 1 ≤ i ≤ k. Then
there is a unique A-module homomorphism f : M_1 ⊕· · ·⊕M_k → N such that f ◦ \eta_i = f_i for 1 ≤ i ≤ n. Explicitly,
f(m_1, . . . ,m_k) = f_1(m_1) + · · · + f_k(m_k)

Where \eta_i : M_i → M_1 ⊕· · ·⊕M_k

I understand what the theorem says...but then it says that (the theorem) explicitely means:
f(m_1, . . . ,m_k) = f_1(m_1) + · · · + f_k(m_k)

I have trouble connecting this to what it said in the theorem. In other words, the theorem says f ◦ \eta_i = f_i. So where exactly is the composite in f(m_1, . . . ,m_k) = f_1(m_1) + · · · + f_k(m_k)?

In other words, how is the theorem "explicitely" being shown in

f(m_1, . . . ,m_k) = f_1(m_1) + · · · + f_k(m_k) ?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top