# Does every Abelian finite group have a linearly independent generator?

Does every Abelian finite group have a linearly independent generator?

Here is my solution:

Let G be a Abelian finite group. Assume $\mbox{ord}(G)=n$, then exists $x_1, x_2, \ldots, x_n\in G$ such that $$G = \langle x_1\rangle \oplus \langle x_2\rangle \oplus \cdots \oplus \langle x_n\rangle$$

So $S = \{x_1, \ldots, x_n\}$ is a linearly independent generator of $G.$

However, $\mathbb{Z}/n$ group is Abelian finite but it has not linearly independent generator. Because $n\neq 0$ and $n\overline{a} = \overline{na} = \overline{n}\overline{a} = \overline{0}, \forall \overline{a}\in \mathbb{Z}/n.$

I have dont nothing wrong? Can you expalin for me? Thank you very much!

• If by "$x_1, \dots, x_n$ are linearly independant" you mean $\forall (a_1, \dots, a_n) \in \mathbb Z^n, \sum a_ix_i = 0 \Rightarrow a_i = 0$ you see that this is wrong by considering $\mathbb Z/n \mathbb Z$ as you did. – user171326 Dec 14 '16 at 13:54
• In fact, you can notice that $nx = 0$ for any $x \in G$, where $n$ is the order of $G$. Thus there is never linearly independant element in a finite abelian group $G$. – user171326 Dec 14 '16 at 13:55
• @ N.H. We know that $S = \{x_1, \ldots, x_n\}\subseteq G$ is linearly independent generator if and only if $$S = \langle x_1\rangle \oplus \cdots \oplus \langle x_n\rangle$$ and if $G$ is a Abelian group finite then $G$ has a decomposition direct sum of every cyclics subgroup. Hence, set $S = \{x_1, \ldots, x_n\}$ is a linearly independent generator of $G$ I have dont nothing wrong? – lony Dec 14 '16 at 14:15
• Well, your "if and only if" characterization of linearly independence is just incorrect, then. – Dustan Levenstein Dec 14 '16 at 14:22
• @ Dustan Levenstein. Yes! $\langle S\rangle = \langle x_1\rangle \oplus \cdots \oplus \langle x_n\rangle$ – lony Dec 14 '16 at 14:29

As already explained, 'linearly independent' doesn't make sense in this context. However, there is still a sense of mutual independence, in that generators $x_1$, ..., $x_n$ can be chosen, with G isomorphic to the direct product of the cyclic groups generated by them, such that the intersection of any two such cyclic groups contains only the identity element. Then it is possible to prove that the vector ($m_1$, $m_2$, ... $m_n$) represents the identity of G exactly when $m_1$ is a multiple of the order of $x_1$, $m_2$ of $x_2$, ..., $m_n$ of $x_n$ - i.e if you limit the possible values of $m_1$ to { 0, 1, ..., ord($x_1$) - 1 }, etc, then $m_1$ must be 0, etc.
• @ PMar. We know that $S = \{x_1, \ldots, x_n\}\subseteq G$ is linearly independent generator if and only if $$\langle S\rangle = \langle x_1\rangle \oplus \cdots \oplus \langle x_n\rangle$$ and if $G$ is a Abelian group finite then $G$ has a decomposition direct sum of every cyclics subgroup. Hence, set $S = \{x_1, \ldots, x_n\}$ is a linearly independent generator of $G$ I have dont nothing wrong? – lony Dec 14 '16 at 14:23
• @Iony I would object to the phrase 'G has a decomposition direct sum of every cyclics subgroup', in that the word every is not correct. Consider the group $Z_p$ x $Z_p$ (p prime) - this group has (p+1) cyclic subgroups of order p, but representing it as a product requires only two of those subgroups. – PMar Dec 14 '16 at 15:18
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://math.stackexchange.com/questions/2058490/does-every-abelian-finite-group-have-a-linearly-independent-generator", "fetch_time": 1568687430000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2019-39/segments/1568514573011.59/warc/CC-MAIN-20190917020816-20190917042816-00305.warc.gz", "warc_record_offset": 583684571, "warc_record_length": 31607, "token_count": 1075, "char_count": 3325, "score": 3.5625, "int_score": 4, "crawl": "CC-MAIN-2019-39", "snapshot_type": "latest", "language": "en", "language_score": 0.8124562501907349, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00009-of-00064.parquet"}