MHB If X is a subset of G such that xy = yx for all x, y in X, then <X> is Abelian.

  • Thread starter Thread starter oblixps
  • Start date Start date
oblixps
Messages
35
Reaction score
0
If \(X\) is a subset of \(G\) such that \(xy = yx\) for all \(x,y\in X\), then \(<X>\) is Abelian.

I'm trying to understand the proof to the above statement in my book. This may be trivial but for some reason I am not seeing it.

It starts with saying X \subset C_{G}(X) by the hypothesis and since C_{G}(X) is a subgroup, we must have &lt;X&gt; \subset C_{G}(X) and so X \subset C_{G}(&lt;X&gt;). Then, just as above we have &lt;X&gt; \subset C_{G}(&lt;X&gt;) and so <X> is abelian as desired.

i didn't understand how the book went from saying &lt;X&gt; \subset C_{G}(X) and concluding that X \subset C_{G}(&lt;X&gt;). it seems to me that X \subset C_{G}(&lt;X&gt;) is clear from the hypothesis and i don't see why it was even needed to show that &lt;X&gt; \subset C_{G}(X).

am i missing something here?
 
Last edited by a moderator:
Physics news on Phys.org
Re: if X is a subset of G such that xy = yx for all x, y in X, then <X> is abelian.

oblixps said:
i'm trying to understand the proof in my book. this may be trivial but for some reason i am not seeing it.

It starts with saying X \subset C_{G}(X) by the hypothesis and since C_{G}(X) is a subgroup, we must have &lt;X&gt; \subset C_{G}(X) and so X \subset C_{G}(&lt;X&gt;). Then, just as above we have &lt;X&gt; \subset C_{G}(&lt;X&gt;) and so <X> is abelian as desired.

i didn't understand how the book went from saying &lt;X&gt; \subset C_{G}(X) and concluding that X \subset C_{G}(&lt;X&gt;). it seems to me that X \subset C_{G}(&lt;X&gt;) is clear from the hypothesis and i don't see why it was even needed to show that &lt;X&gt; \subset C_{G}(X).

am i missing something here?
The statement $Y\subset C_{G}(Z)$ means that $yz=zy$ for all $y$ in $Y$ and all $z$ in $Z$. That latter statement is completely symmetric in $Y$ and $Z$. It follows that $Y\subset C_{G}(Z)\;\Longleftrightarrow Z\subset C_{G}(Y).$

When you say "$X \subset C_{G}(<X>)$ is clear from the hypothesis", I think you are just saying that the equivalence $<X>\subset C_{G}(X)\;\Longleftrightarrow X\subset C_{G}(<X>)$ is obvious to you.
 
it seems to me that all that is really being said here, is that if an element of G commutes with every element of a generating set S, for a subgroup H (that is H = <S>) it commutes with all of H.

so if every element of S commutes with every other, then H is abelian.

that is: it suffices to check if the set of generators is commutative, rather than the whole subgroup (perhaps a substantially savings of effort).
 
Maybe it will help to point out that there are two equivalent ways to define <S>, where S is a subset of some group.

1 (constructive definition). <S> consists of all products (of arbitrary length) formed from elements of S and their inverses.

2 (existential definition). <S> is the smallest subgroup containing S.

In this thread, you are told that each pair $x$, $y$, of elements of S commute with each other. If you are thinking in terms of definition 1., then to prove that <S> is abelian you only need to check that $x$ commutes with $y^{-1}$ (which is easy), and it's then kind of obvious that each pair of elements of <S> commute with each other.

But when giving formal proofs in group theory, it is usually more satisfactory to use definition 2., and that is what is done in the proof at the start of this thread. It is based on the fact that $C_G(S)$ is a subgroup which contains S, and therefore contains <S>.
 
Last edited:
i concur that in formal proofs, centralizers are a more elegant tool than explicit constructions (which can get messy, and hard to notate).

my comments were to show why this should be an "easy" proof, nothing is at all wrong with the proof or the method.
 
thanks for all your comments!

i realize that this problem could of been done easily using the constructive definition, but I wanted to understand how to use the fact that the centralizer was a subgroup. I was initially confused about the jump the author made, but as Opalg pointed out, it was just a matter of realizing that the 2 inclusions were symmetric.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
2
Views
2K
Replies
18
Views
2K
Replies
16
Views
2K
Replies
0
Views
406
Replies
3
Views
444
Replies
7
Views
2K
Replies
5
Views
2K
Replies
1
Views
1K
Replies
2
Views
1K
Back
Top