Find a direct summand of a finite abelian group

TopCat
Messages
55
Reaction score
0

Homework Statement



If G is a finite abelian group, and x is an element of maximal order, then <x> is a direct summand of G.

Homework Equations


The Attempt at a Solution



I claim that the hypothesis implies that A = G\<x> \bigcup {e} is a subgroup of G. If so, then since G = < <x> \bigcup A>, and <x> \bigcap A = <e>, that G = <x> \oplus A.

Pf of claim: A is obviously associative, has an identity by definition, and since <x> is a group, b \in A \Rightarrow b^-1 \in A. I'm struggling to show that A is closed.

I feel the key is that I must show that if a,b \in G, and \existsx such that ab \in <x>, then \existsy\inG such that a,b \in <y>. Then the maximality of |x| will require y=x, whence A is closed. But I need a nudge here. I just can't get a rigorous proof of this.
 
Physics news on Phys.org
I think that what you're trying to prove is false. That is: (G\setminus &lt;x&gt;) \cup \{e\} is not a subgroup.
 
Since G is finite abelian, G \cong \sum \textbf{Z}_{p_{i}^{n_i}}. If |x| has maximal order, then isn't A just removing one of the direct summands, so that, say, A \cong \sum &lt;e&gt; \oplus \textbf{Z}_{p_{i}^{n_i}}, with i \geq 2, which is a subgroup?
 
Last edited:
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top