Is it possible to generalize it?

  • Context: Graduate 
  • Thread starter Thread starter sukyung
  • Start date Start date
Click For Summary
SUMMARY

The discussion confirms that the number of homomorphisms from the cyclic group Z_n to Z_m can be expressed as gcd(n, m). This conclusion is supported by examples, such as the two homomorphisms from Z_4 to Z_2 and the single trivial homomorphism from Z_12 to Z_5. The discussion establishes that the homomorphisms form a cyclic group isomorphic to Z_{(n,m)}, where the order of the group is determined by the greatest common divisor of n and m.

PREREQUISITES
  • Understanding of cyclic groups and their properties
  • Knowledge of homomorphisms in group theory
  • Familiarity with the concept of greatest common divisor (gcd)
  • Basic knowledge of mathematical notation and group isomorphism
NEXT STEPS
  • Study the properties of cyclic groups in abstract algebra
  • Learn about homomorphisms and their applications in group theory
  • Explore the concept of isomorphism in more depth
  • Investigate the role of gcd in number theory and its implications in group structures
USEFUL FOR

Mathematicians, students of abstract algebra, and anyone interested in group theory and its applications in mathematics.

sukyung
Messages
3
Reaction score
0
Denote Z_n=(0.1.2...n-1)

Then could I generalize the number of homomorphism H:Z_n -> Z_m as

gcd(n, m)=#(H:Z_n -> Z_m) ?

(Don't consider the case H:Z -> Z)

For example #(H: Z_4 -> Z_2)=2
#(H: Z_12 -> Z_5)= 1 (obviously the trivial one)
 
Physics news on Phys.org
Yes, and in fact Hom_\mathbb{Z}(Z_n,Z_m) \cong Z_{(n,m)}, that is, the homomorphisms from Z_n to Z_m form a cyclic group of order gcd(n,m).
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 17 ·
Replies
17
Views
7K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 26 ·
Replies
26
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
678
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 12 ·
Replies
12
Views
763
  • · Replies 4 ·
Replies
4
Views
2K