Proving the Inclusion of Elements of Finite Commutative p-Groups in A(p)

In summary, the problem states that A is composed of two finite commutative groups, A(p) and A', where the order of A' is not divisible by the prime p. It needs to be proven that all elements of A with orders of p^k, where k is greater than or equal to 0, belong to A(p). To prove this, it is shown that if an element (a1, a2) in A has order p^k, then a2 must also have order p^m, which is a contradiction if a2 is not equal to the identity element e2.
  • #1
jimmycricket
116
2

Homework Statement



Let [itex]A = A(p)\times A'[/itex] where [itex]A(p)[/itex] is a finite commutative p-group (i.e the group has order [itex]p^a[/itex] for [itex]p[/itex] prime and [itex]a>0[/itex]) and [itex]A'[/itex] is a finite commutative group whose order is not divisible by [itex]p[/itex].
Prove that all elements of [itex]A[/itex] of orders [itex]p^k, k\geq0[/itex] belong to [itex]A(p)[/itex]


The Attempt at a Solution


I don't know where to begin with this. I am quite sure that if the order of [itex]A'[/itex] is not divisible by [itex]p[/itex] then the order of any element of [itex]A'[/itex] is not divisible by [itex]p^k[/itex]. Is this usefull or not?
 
Physics news on Phys.org
  • #2
Let ##e_1, e_2## denote the identities of ##A(p)## and ##A'## respectively.

If ##(a_1, a_2) \in A##, ##(a_1, a_2) = (e_1, e_2)## iff ##a_1 = e_1## and ##a_2 = e_2##.

Suppose ##(a_1, a_2)## has order ##p^k## for some ##k > 0##. Then it must be that

##a_1^{p^k} = e_1## and ##a_2^{p^k} = e_2##.

But then the order of ##a_2## divides ##p^k##. So the order of ##a_2## is ##p^m## for some m. This is a problem if ##a_2 \neq e_2##.

Note that in the statement of the problem, they regard ##A(p)## as a subgroup of ##A##. But to be proper, ##A(p)## is isomorphic to the subgroup ##A(p) \times \{e_2 \}##.
 
  • Like
Likes 1 person
  • #3
Also, in group theory, people tend to stay away from using the word commutative. Instead you should use abelian. The reason for this is that it is nice to have separate words for commuting in multiplication and commuting in addition when you get to ring theory.
 
  • Like
Likes 1 person

FAQ: Proving the Inclusion of Elements of Finite Commutative p-Groups in A(p)

What is a finite commutative p group?

A finite commutative p group is a group with a finite number of elements where the order (number of elements) of each element is a power of a prime number, p. Additionally, this group is commutative, meaning that the order in which the elements are multiplied does not affect the result.

How do you determine the order of a finite commutative p group?

The order of a finite commutative p group can be determined by taking the product of the orders of each element in the group. This is because the order of each element must be a power of p, so the order of the entire group will also be a power of p.

Can a finite commutative p group have more than one generator?

Yes, a finite commutative p group can have more than one generator. In fact, every element in the group can be a generator, as long as it has an order that is relatively prime to the order of the group. This means that the element's order shares no common factors with the group's order.

How does the structure of a finite commutative p group compare to that of a non-commutative group?

The structure of a finite commutative p group is simpler than that of a non-commutative group. This is because in a non-commutative group, the order of the elements and the order in which they are multiplied can affect the result. In a finite commutative p group, the order of the elements does not affect the result, making it easier to understand and manipulate.

What is an example of a real-world application of finite commutative p groups?

Finite commutative p groups have various applications in cryptography, specifically in the field of public-key cryptography. They are used to create secure algorithms for encryption and digital signatures, such as the Diffie-Hellman key exchange and the RSA algorithm.

Back
Top