Counting Subgroups

Algebra Level 5

The collection G G of all integers in [ 1 , 4036 ] [1, 4036] that are coprime to 4036 4036 form a group under multiplication modulo 4036 4036 . As an example, the product of 7 7 and 1007 1007 in G G is 3013 3013 , since 7 × 1007 3013 ( m o d 4036 ) 7 \times 1007 \equiv 3013 \pmod{4036} .

How many subgroups does G G have?


The answer is 84.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Mark Hennings
May 14, 2018

Since 4036 = 2 2 × 1009 4036 = 2^2 \times 1009 , the ring Z 4036 \mathbb{Z}_{4036} is isomorphic to the direct product of rings Z 4 × Z 1009 \mathbb{Z}_4 \times \mathbb{Z}_{1009} , and hence the group of units G = Z 4036 × G = \mathbb{Z}_{4036}^\times is isomorphic to the direct product of cyclic groups Z 4 × × Z 1009 × C 2 × C 1008 \mathbb{Z}_4^\times \times \mathbb{Z}_{1009}^\times \; \equiv \; C_2 \times C_{1008} Let us determine the number of subgroups of C 2 × C N C_2 \times C_N . Suppose that C 2 C_2 is generated by a a . Let f : C 2 × C N C N f:C_2 \times C_N \to C_N be the projection homomorphism. If H H is a subgroup of C 2 × C N C_2 \times C_N , then f ( H ) f(H) is a subgroup of C N C_N , and so is cyclic, generated by some c C N c \in C_N . Let S = { x C 2 ( x , c ) H } S = \{x \in C_2 \,|\, (x,c) \in H\} . There are 3 cases to consider:

  • If S = { e } S = \{e\} , then H = { e } × f ( H ) H = \{e\}\times f(H) .
  • If S = C 2 S = C_2 , then H = C 2 × f ( H ) H = C_2 \times f(H) .
  • If S = { a } S = \{a\} , suppose that o ( c ) o(c ) was odd. Then ( a , e ) = ( a , c ) o ( c ) H (a,e) \; = \; (a,c)^{o(c )} \in H , which would imply that ( e , c ) = ( a , e ) ( a , c ) H (e,c) = (a,e)(a,c) \in H , and hence e S e \in S . Thus, in this case, we must have o ( c ) o( c) being even, in which case it follows that H H is the cyclic group generated by ( a , c ) (a,c) .

We deduce that C 2 × C N C_2 \times C_N has two subgroups for each subgroup of C N C_N of odd order, and three subgroups for each subgroup of C N C_N of even order. Now C N C_N contains one subgroup for each positive divisor of N N . Thus if we write N = 2 u M N = 2^u M where u 0 u \ge 0 is an integer and M M is an odd integer, then C 2 × C N C_2 \times C_N possesses 3 σ 0 ( N ) σ 0 ( M ) 3\sigma_0(N) - \sigma_0(M) subgroups, where σ 0 ( n ) \sigma_0(n) is the number of positive integer divisors of n n .

Finally, since 1008 = 2 4 × 3 2 × 7 1008 = 2^4 \times 3^2 \times 7 we deduce that G = Z 4036 × G = \mathbb{Z}_{4036}^\times has 3 × σ 0 ( 1008 ) σ 0 ( 63 ) = 3 ( 5 × 3 × 2 ) ( 3 × 2 ) = 84 3 \times \sigma_0(1008) - \sigma_0(63) \; = \; 3(5\times3\times2) - (3\times2) \; = \; 84 subgroups.

That tensor product on the first line of your solution is probably a typo, no?

Is there a formula for the number of subgroups of C 2 × G C_2 \times G based on the number of subgroups of G , G, where G G is an abelian group?

Patrick Corn - 3 years ago

Log in to reply

I'm not sure that there is a formula. There is Goursat's Theorem, which says there is a 1-1 correspondence between subgroups of the direct product G 1 × G 2 G_1 \times G_2 and triples ( G 1 / N 1 , G 2 / N 2 , φ ) \big(G_1/N_1,G_2/N_2,\varphi\big) , where G 1 / N 1 G_1/N_1 and G 2 / N 2 G_2/N_2 are quotient groups and φ : G 1 / N 1 G 2 / N 2 \varphi:G_1/N_1 \to G_2/N_2 is an isomorphism.

Mark Hennings - 3 years ago

I didn't know the definition of subgroup. But I have another solution in more familiar way. I found that a subgroup H H can contain either only three terms { 1 , a , b 1,a,b } or H = G H=G .

The three termed group easily makes the sense that a × b = 1 ( m o d 4036 ) a×b=1(mod4036) .

And a × b = 1 ( m o d 4036 ) a×b=1(mod 4036) for 0 < a , b < 4036 0<a,b<4036 for a , b a,b co-prime to 4036 4036 in 1007 1007 ways and 1 more way for H = G H=G . So, total 1008 1008 ways. I have got this using Python.

There is total 2015 C 2 = 2029105 2015C2=2029105 ways to make that three termed group. And 1007 2029105 = 1 2015 \frac{1007}{2029105}=\frac{1}{2015} . Exactly the ratio of that number and number of total residues. For modulo 3 the ratio comes 1009 × 2 2015 × 2014 \frac{1009×2}{2015×2014} .

If I am doing mistake somewhere please help in recognizing that.

Alapan Das - 1 year, 7 months ago

Log in to reply

Since the group is isomorphic to C 2 × C 1008 C_2 \times C_{1008} , it has a subgroup of order 2 2 and a subgroup of order 1008 1008 . You seem to be saying that the only subgroups of G G either are equal to G G or else have order 3 3 , which is false. For that matter, { 1 } \{1\} is a subgroup of order 1 1 , which is another group your thinking misses.

You are saying that the subgroup H H has three elements, if it is not equal to G G . This would mean that H H was cyclic of order 3 3 , and hence that there was an element x H x \in H of order 3 3 , so that H = { 1 , x , x 2 } H = \{ 1,x,x^2\} . There is only one such group, namely { 1 , 3401 , 3661 } \{1,3401,3661\} .

Mark Hennings - 1 year, 7 months ago

Oh. I didn't know that the a × a a×a multiplication was also included. Thank you sir.

Alapan Das - 1 year, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...