prove that the group U(n^2 -1) is not cyclic

In summary, the conversation discusses a proof for the group U(n^2 - 1) not being cyclic for any integer n greater than 2. The conversation also mentions using the Chinese Remainder Theorem to prove this, but the person is not familiar with it yet. They also discuss the isomorphism of U(ab) and U(a) x U(b) when gcd(a,b) = 1. Overall, the conversation is about different methods for proving that U(n^2 - 1) is not cyclic.
  • #1
2e4L
4
0
Sorry if I formatted this thread incorrectly as its my first post ^^

Homework Statement



For every integer n greater than 2, prove that the group U(n^2 - 1) is not cyclic.


Homework Equations





The Attempt at a Solution



I've done a problem proving that U(2^n) is not cyclic when n >3, but I'm failing to make a parallel.

How does one find the order of (n^2 -1)? Is this information even needed to solve this problem?
 
Physics news on Phys.org
  • #2
you might want to prove some easier things first:

suppose 8|k, that is:

k = 2tm, where t ≥ 3.

then φ(k) = φ(2t)φ(m), so

U(k) ≅ U(2t) x U(m).

use this to show U(k) cannot be cyclic, as it has a non-cyclic subgroup.

now, consider even n and odd n for n2-1 separately.
 
  • #3
Deveno said:
you might want to prove some easier things first:

suppose 8|k, that is:

k = 2tm, where t ≥ 3.

then φ(k) = φ(2t)φ(m), so

U(k) ≅ U(2t) x U(m).

use this to show U(k) cannot be cyclic, as it has a non-cyclic subgroup.

now, consider even n and odd n for n2-1 separately.

I have learned that property of Euler's totient function, but not the one about U(ab) = U(a) x U(b). I've come across it online, but have yet to use it in class.

Is there another method?
 
  • #4
U(ab) isn't always isomorphic to U(a) x U(b).

for example U(4) is cyclic of order 2, but U(2) x U(2) has but a single element: (1,1).

it IS true, if a and b are co-prime.

this is actually a consequence of the chinese remainder theorem:

if gcd(m,n) = 1, then [a]mn→([a]m,[a]n) is a group isomorphism of (Zmn,+) with (Zm,+) x (Zn,+).

it's easy to check that [a]mn→([a]m,[a]n) is a ring homomorphism as well, hence Zmn and Zm x Zn have isomorphic groups of units (when...gcd(m,n) = 1. this is key).

i find it odd, that you wouldn't use this result, since it builds on the result of your previous problem.
 
  • #5
Deveno said:
U(ab) isn't always isomorphic to U(a) x U(b).

for example U(4) is cyclic of order 2, but U(2) x U(2) has but a single element: (1,1).

it IS true, if a and b are co-prime.

this is actually a consequence of the chinese remainder theorem:

if gcd(m,n) = 1, then [a]mn→([a]m,[a]n) is a group isomorphism of (Zmn,+) with (Zm,+) x (Zn,+).

it's easy to check that [a]mn→([a]m,[a]n) is a ring homomorphism as well, hence Zmn and Zm x Zn have isomorphic groups of units (when...gcd(m,n) = 1. this is key).

i find it odd, that you wouldn't use this result, since it builds on the result of your previous problem.

It may be because it's still fairly early in the course. I learned the Chinese Remainder Theorem in a number theory class, but have yet to encounter it in my current one. We are going to study rings after the upcoming exam.

The previous problem was in a different chapter of the text I believe. This question is supposed to be a "review."
 

FAQ: prove that the group U(n^2 -1) is not cyclic

What is the definition of a cyclic group?

A cyclic group is a group in which every element can be generated by a single element, called a generator, through repeated multiplication or exponentiation.

What is the definition of the group U(n^2 -1)?

The group U(n^2 -1) is the group of units (elements with multiplicative inverses) in the ring of integers modulo n^2 -1. This group contains all numbers relatively prime to n^2 -1.

How can I prove that the group U(n^2 -1) is not cyclic?

To prove that a group is not cyclic, we need to show that there does not exist a single element that can generate all other elements. In the case of U(n^2 -1), we can show that there are elements that cannot be generated by any other element in the group, thus proving that the group is not cyclic.

Can you provide an example of an element in U(n^2 -1) that cannot be generated by any other element?

Yes, for example, in the group U(7^2 -1), the element 8 is relatively prime to 7^2 -1 and cannot be generated by any other element in the group.

What implications does the group U(n^2 -1) not being cyclic have?

If the group U(n^2 -1) is not cyclic, it means that there is no efficient way to generate all elements in the group using a single element. This has implications in number theory and cryptography, where the properties of cyclic groups are often utilized.

Back
Top