Algebra - Finding the Order of an Element from the Size if It's Conjugacy Class

  • Context: Graduate 
  • Thread starter Thread starter Szichedelic
  • Start date Start date
  • Tags Tags
    Algebra Class Element
Click For Summary
SUMMARY

The discussion revolves around determining the order of an element x in a group G, given the size of its conjugacy class C(x). It establishes that if |G|=n and |C(x)|=m, then m divides n, leading to the conclusion that the centralizer of x, denoted as Z(x), has an order |Z(x)|=q, where n=mq. Additionally, since |Z(x)| is not equal to n, x is confirmed to be outside the center of G, which implies that the order of the center Z(G) is at most the largest integer less than q-1 that divides n.

PREREQUISITES
  • Understanding of group theory concepts, specifically conjugacy classes
  • Familiarity with centralizers and the center of a group
  • Knowledge of Lagrange's theorem and its implications on group orders
  • Basic problem-solving skills in abstract algebra
NEXT STEPS
  • Study the properties of conjugacy classes in finite groups
  • Explore the relationship between centralizers and conjugacy classes
  • Learn about Lagrange's theorem and its applications in group theory
  • Practice with problems involving the order of elements in groups
USEFUL FOR

Students of abstract algebra, mathematicians focusing on group theory, and anyone interested in deepening their understanding of the structure of groups and their elements.

Szichedelic
Messages
28
Reaction score
0
Sorry about the long title. I recently had a few homework problems which were similar to the title of the post. I struggled a bit with them so I'm trying to find additional problems to work on until I can master these ideas...

Basically, if we have a group G s.t. |G|=n, and we know G has a conjugacy class C(x) s.t. |C(x)|=m, what can we say about the order of the element x? I know we can work with the center. i.e., since m | n, we have that n=mq for some integer q, which imples that the centralizer of x is s.t. |Z(x)|=q (by the counting formula). Moreover, since Z(x) contains the center of G, Z(G), and since |Z(x)|≠n, x is not an element of the center. Hence, Z(G) has an order of at most the largest integer smaller than q-1 which divides n.

Sorry if this is convoluted. I repeat, this isn't a homework problem (anymore) but merely something I'm trying to rectify in my head.
 
Physics news on Phys.org
If anyone can help me find examples to work on, that would be great as well.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 26 ·
Replies
26
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K