Can You Determine the Order of (a,b) in A x B?

  • Context: Undergrad 
  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
Click For Summary
SUMMARY

The order of the element ##(a,b)## in the direct product of groups ##A \times B## is determined by the least common multiple of the orders of the individual elements ##a## and ##b##. Specifically, if ##|(a,b)| = n##, then it can be shown that ##(a,b)^n = (a^n, b^n)##, leading to the conclusion that ##n = \operatorname{lcm}(|a|, |b|)##. To rigorously establish this, one must demonstrate that ##(ab)^{\operatorname{lcm}(|a|, |b|)} = (1_A, 1_B)##, confirming both necessity and sufficiency of the condition.

PREREQUISITES
  • Understanding of group theory concepts, specifically direct products of groups.
  • Familiarity with the concept of order of an element in a group.
  • Knowledge of least common multiples (lcm) in the context of integers.
  • Ability to manipulate and interpret mathematical notation and expressions.
NEXT STEPS
  • Study the properties of direct products in group theory.
  • Learn about the order of elements in finite groups.
  • Explore proofs involving least common multiples in algebraic structures.
  • Investigate the implications of commutativity in group operations.
USEFUL FOR

Mathematicians, particularly those specializing in abstract algebra, students studying group theory, and anyone interested in understanding the structure of direct products of groups.

Mr Davis 97
Messages
1,461
Reaction score
44
I want to show the order of ##(a,b) \in A \times B##, where ##A## and ##B## are arbitrary groups.
So, let, ##|(a,b)| = n##. Then ##(a,b)^n = [(a,1_B)(1_A, b)]^n = (a,1_B)^n(1_A, b)^n##, since ##(a,1_B)## and ##(1_A, b)## commute. Then ##(a,b)^n = (a^n,1_B)(1_A, b^n) = (a^n,b^n)##. From this, it seems pretty clear that ##n = lcm (|a|, |b|)##, however, I don't really how to rigorously show this, or whether what I've said is good enough.
 
Physics news on Phys.org
Mr Davis 97 said:
I want to show the order of ##(a,b) \in A \times B##, where ##A## and ##B## are arbitrary groups.
So, let, ##|(a,b)| = n##. Then ##(a,b)^n = [(a,1_B)(1_A, b)]^n = (a,1_B)^n(1_A, b)^n##, since ##(a,1_B)## and ##(1_A, b)## commute. Then ##(a,b)^n = (a^n,1_B)(1_A, b^n) = (a^n,b^n)##. From this, it seems pretty clear that ##n = lcm (|a|, |b|)##, however, I don't really how to rigorously show this, or whether what I've said is good enough.
I think it is o.k.

If you want to be clearer and detailed, you could have written some more steps. E.g. ##(a^n,b^n)=(1_A,1_B)## implies ##|a| \,|\, n## and ##|b| \,|\, n## what you basically have shown. Now $$n=|ab| =\operatorname{min} \{\,n\,:\,(ab)^n=(1_A,1_B)\,\} \stackrel{(*)}{=} \operatorname{min}\{\,n\,:\,|a|\,|\,n\,\wedge \,|b|\,|\,n\,\}=\operatorname{lcm}\{\,|a|,|b|\,\}$$ To be even more rigorous at ##(*)##, you should have started with the fact that ##(ab)^{ \operatorname{lcm} \{\,|a|,|b|\,\} } = (1_A,1_B) ## which is needed for the equation, since you only have shown the necessity ##"\subseteq"## of this condition and not that it is sufficient ##"\supseteq"##, too.

So it all comes down to the question what you consider to be obvious and what not.
 
  • Like
Likes   Reactions: Mr Davis 97

Similar threads

  • · Replies 33 ·
2
Replies
33
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 33 ·
2
Replies
33
Views
5K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K