Talk:Free abelian group

Free abelian group has been listed as one of the Mathematics good articles under the good article criteria. If you can improve it further, please do so. If it no longer meets these criteria, you can reassess it.
Review: January 3, 2022. (Reviewed version).

More care needed with terminology

The article presents this theorem toward the end:

"Theorem: Let F be a free abelian group generated by the set and let be a subgroup. Then G is free."

Ordinarily the terminology used would be no problem. But because of the warning earlier in the article in the "Terminology" section:

"Note that a free abelian group is not the same as a free group that is abelian; a free abelian group is not necessarily a free group. In fact the only free groups that are abelian are those having an empty basis (rank 0, giving the trivial group) or having just 1 element in the basis (rank 1, giving the infinite cyclic group). Other abelian groups are not "free groups" because in free groups ab must be different from ba if a and b are different elements of the basis."

the use of the word "free" in the theorem is likely to be quite confusing to beginners. I would strongly suggest using consistent terminology throughout the article.

Also, the warning given above could be worded so as to be less confusing: Just state the simpler fact:

"A free abelian group is not a free group except in the two special cases mentioned, since a free group on more than one generator is not abelian".

[Note: The software is not giving me any window in which to enter an edit summary.]Daqu (talk) 22:20, 11 February 2009 (UTC)[reply]

I fixed the statement of the theorem. Using the standard abbreviation of "free" for "free abelian" in the proof seems fine, but was a little confusing in the statement itself. I'm not sure how to improve the terminology warning. The article itself is somewhat boring and unbalanced. Presumably when it is rebalanced the terminology section's content will be more carefully integrated into the article as a whole. Right now it is just another trivia statement that could be included in the numbered list under Properties.

When you create a new section, the edit summary will just be the section heading, which is a good edit summary in most cases (including this one). JackSchmidt (talk) 22:44, 11 February 2009 (UTC)[reply]

Thanks for your comment. Normally I would not mind seeing "free" used to mean "free abelian" if the context makes this clear. But that struck me as unwise in an article that also uses "free" to mean just plain "free" (even emphasizing the distinction).Daqu (talk) 06:52, 16 February 2009 (UTC)[reply]

Definition???

This article, as it currently stands, lacks a formal definition. It jumps straight from 'example' to 'properties'. The lead has a single-sentence informal definition. I mean, I can guess, but it would be nice to have the explicit axioms... linas (talk) 16:44, 2 September 2012 (UTC)[reply]

Free-abelian groups

Although "free abelian groups" is a quite standard terminology for this kind of groups, it is misleading (not every free abelian group is free and abelian, in fact only exceptional cases are). I suggest naming them "free-abelian groups" which is much more precise ("free-abelianicity" is the true defining property of them) and supposes a very minimal change (in mnemotechnical terms). (Suitangi (talk) 08:18, 10 September 2012 (UTC))[reply]

Subgroup Closure

This proof is a horrible mess, and not very informative. In the finitely-generated case, it is easy (since a subgroup of a finitely generated free abelian group is finitely generated and torsion-free, and hence free abelian). Does anyone object to stating the complete result, but only proving the f.g. case? 71.227.119.236 (talk) 17:33, 2 April 2013 (UTC)[reply]

This section was tagged as too technical, and I agree. In order to handle it, I removed the overly formal "theorem-proof" part of the section, leaving only the statement of the result, and I added a sentence about the relation between this fact and the fact that the infinite cyclic group only has infinite cyclic subgroups (diff). However, TakuyaMurata (talk · contribs) disagreed, restored the section to the way it was previously (with the technical proof and without my new sentence), and removed the "technical" tag. Perhaps we could have some more discussion about what to do here? Because I don't think leaving it as it is works very well, but getting into an edit war without forming a consensus is also a bad idea. —David Eppstein (talk) 15:24, 28 November 2013 (UTC)[reply]

I restored the proof since (a) it is not an "original research", or least doesn't seem to be, and (b) generally speaking, removing materials to make things less technical is a bad ideal. A "non-topological proof" is always very messy, as I understand, and at least the proof shows how messy it can get. (Sorry, I didn't notice the new sentence, I'm restoring it right now.) -- Taku (talk) 16:22, 28 November 2013 (UTC)[reply]

I agree with IP user and David: As far as I know, this proof (in the case of non finitely generated groups) is useful only to prove the theorem and is not really of encyclopedic interest. A reference would suffice. On the other hand, surprisingly, the article does not mention the full theorem in the case of finitely generated groups: given a subgroup of a finitely generated free Abelian group, there is a basis

e_{1},\ldots ,e_{n}

of the larger group and integers

d_{1}|d_{2}|\cdots |d_{k}

(each integer divides the next one) such that

d_{1}e_{1},\ldots ,d_{k}e_{k}

is a basis of the smaller group. Moreover Smith normal form, provides both a constructible proof of this theorem and a practical way to compute a basis of the subgroup. All of this is widely used in crystallography and computer algebra (linear algebra over the integers). Also recent results show that the computational complexity of this computation is of the same order as the complexity of the computation of a determinant. IMO, the proof in the non finitely generated case should be removed, and the proof in the finitely generated case should be replaced by expanding the above brief summary of the subject. D.Lazard (talk) 17:17, 28 November 2013 (UTC)[reply]

Ok. D. Lazard is very persuasive (as usual?). I like a newer version. While I don't think the proof put before was bad, it was not particularly good either, so I'm fine. -- Taku (talk) 00:37, 29 November 2013 (UTC)[reply]

I am an encyclopedia reader and I find proofs (or proof outlines) of difficult theorems something that spices up the articles, i.e. proofs makes them interesting. I could argue that this makes the presence of the full proof being of "encyclopedic interest". I'm trying here to say that the "not of encyclopedic interest"-argument means little, because it can be made to mean anything. Pure difficulty (technicality) of a proof doesn't render it (in my mind) as not being of interest. In the present case, finite versus infinite, makes it interesting, not only technical.

The formerly present proof is admittedly messy (all the inline LaTex), but it could surely be fixed and transformed into a fairly short proof outline. YohanN7 (talk) 16:44, 29 November 2013 (UTC)[reply]

For the same reasons as stated above, a proof of the finite case (though simple) would not be of "encyclopedic interest" because it isn't interesting by any measure - except for those active or learning in the field. True, those would be encyclopedia readers too, but belonging to an inherently limited group, not the group of random, generally curious, readers.YohanN7 (talk) 18:37, 29 November 2013 (UTC)[reply]

Actually, I think the finite case is much more interesting. I think it's the part of the proof where all the interesting ideas occur. Amplifying the argument to the infinite case feels to me like a rather standard application of Zorn's lemma: Define a structure that represents a partial solution, order those structures, use Zorn's lemma to find a maximal element, and prove that a maximal element must be the entire object. The only step that is not exactly the same as in all other Zorn's lemma arguments is the last, and all of the insight needed to do that step already occurs in the finite case. Ozob (talk) 03:11, 30 November 2013 (UTC)[reply]

See, there is a skeleton of a proof outline. YohanN7 (talk) 10:00, 30 November 2013 (UTC)[reply]

Lang (who we are citing for the Zorn-based proof) seems to agree with you. He gives the finitely generated proof in the main text and then says that the general case (in an appendix) is basically the same thing using transfinite induction. —David Eppstein (talk) 03:53, 30 November 2013 (UTC)[reply]

But a "standard application" is of encyclopedic nature since, well, "standard". We shouldn't say "this is standard/usual so we skip it" since that kind of defeats the purpose of this encyclopedia. It is important not to hide the technical nature. -- Taku (talk) 04:26, 30 November 2013 (UTC)[reply]

I blatantly agree. YohanN7 (talk) 10:00, 30 November 2013 (UTC)[reply]

To me, calling something "standard" suggests that it is less interesting, not more. It says that someone who understands the ideas involved in similar proofs will see how to arrange the same ideas to produce a proof of the result of interest. Of the four steps in my proof sketch above, I would call the first three standard. Someone who has experience with Zorn's lemma arguments will find those steps familiar, straightforward, maybe even trivial. The relevant details might be interesting to someone who is unfamiliar or unpracticed with Zorn's lemma, but because they are standard, they are not of interest in an article that is not about Zorn's lemma. Since Wikipedia is an encyclopedia, not a textbook, Wikipedia should not include parts of arguments that do not improve the reader's insight, and that means that it should not include arguments that are standard (except in an article about a standard argument which is of encyclopedic interest, like the pigeonhole principle). Ozob (talk) 05:00, 1 December 2013 (UTC)[reply]

Every free abelian group is just isomorphic to some (possibly infinite) direct sum of Zs? Mention this earlier!

Isn't it true that "G is a free abelian group" is simply equivalent to "G is isomorphic to some direct sum of Zs"?

It seems true, due to the fact of having a basis. Yet I can't quite tell from the article. If it is true, this should be mentioned early and often, in my opinion in the very first sentence of the article! It's preposterous that it wouldn't be mentioned earlier, making readers think this is a far more difficult concept than it really is.

Wolfram MathWorld's page here: http://mathworld.wolfram.com/FreeAbelianGroup.html seems to mention this up front except it says direct product instead of direct sum, which is not the same, and seems not true, so now I'm a bit confused about their page. Cstanford.math (talk) 00:33, 4 September 2018 (UTC)[reply]

It is true, and stated explicitly in the "Direct sums, direct products, and trivial group" section. It's not in the lead, because the relevant part of the lead (its third paragraph) is oriented around what the elements are, not what the whole group is, and if you expanded what the elements of a direct sum are you would get something more or less the same as what's already there. —David Eppstein (talk) 01:27, 4 September 2018 (UTC)[reply]

Definition

To editor David Eppstein: Thank you for trying to improve this article, in particular by adding a definition. Unfortunately, the definition that you added is incorrect in the sense that it differs from the usual one. In short, you define a free abelian group essentially as the pair of an abelian group and a basis of it, while the standard definition is to be an abelian group such that a basis exists. The main drawback of your definition is that, with it, if you change of basis, you change the abelian group. So, the assertion that a free abelian group may have more than one basis becomes wrong (by the way, a free abelian group has always more than one basis).

Also, please, avoid also to define algebraic structures as tuples: if you define an (abelian) group as a pair of a set and an operation, then many common formulations and formulas become incorrect (for example, $x\in G$ would be formally wrong, as a pair is not a set). The standard (and less technical) way is to define a group as a set equipped with an operation. This makes also easier to consider several structures on the same set, such as in the case of a ring (a ring is an abelian group under addition and a monoid under multiplication). D.Lazard (talk) 10:41, 28 December 2021 (UTC)[reply]

What does "equipped with" mean, formally, except that you have a tuple specifying how it is equipped? I note that the pair (set,operation) appear prominently in the first paragraph of the definition section of abelian group. I take your point about existence of a basis vs specification of a basis, though (much like the usual distinction between vector spaces specified abstractly vs specified as coefficients for a specific basis). —David Eppstein (talk) 16:11, 28 December 2021 (UTC)[reply]

GA Review

This review is transcluded from Talk:Free abelian group/GA1. The edit link for this section can be used to add comments to the review.

Reviewer: Urve (talk · contribs) 04:31, 2 January 2022 (UTC)[reply]

Hello there. I will be taking a look at the article. In your comments, you said that someone with familiarity would be helpful - I took a few graduate classes on algebra, and from a broad look, the article seems appropriate for those who entering the subject one level below. I'll take a closer look and offer my comments below soon - and if you disagree with anything I say, feel free to say so. Urve (talk) 04:31, 2 January 2022 (UTC)[reply]

I've been watching some of the work on the article for a few days, so I'm glad you nominated it for GA status. My comments below, which you are free to disagree with. As long as I can understand your thought process, I think it's all good.

The last few days were just a little more polishing before I finalized the nomination; most of my edits to this article were much earlier (beginning in 2013 after a couple smaller edits earlier). —David Eppstein (talk) 06:44, 3 January 2022 (UTC)[reply]

Just to be clear, I don't think the uncited paragraphs in "Definition and examples" problematic: They are common knowledge for who we are writing to. That may be a problem for DYK, though.
- This may be too technical an article to be a good candidate for DYK in any case, so I wasn't planning on nominating it and am not too concerned about their stronger sourcing requirements, as long as the sourcing is good enough for GA standards. I added some sources for the definition of free abelian groups; however the definition of abelian groups themselves is still unsourced. —David Eppstein (talk) 05:52, 3 January 2022 (UTC)[reply]
This is just a thought, and not a suggestion that I've thought through very deeply. It may be useful for "in the corresponding polynomial, or vice versa" to demonstrate how isomorphisms are generally verified. Because we can do both of these mappings, it is isomorphic - but the general point is not really that there is just one map, right? Maybe "in the corresponding polynomial, and vice versa" would be helpful for illustration.
- Ok, I added an example here, and a not-very-technical explanation of why this mapping is an isomorphism. —David Eppstein (talk) 06:06, 3 January 2022 (UTC)[reply]
"More generally the direct product of any finite number of free abelian groups is free abelian" - it might (I'm unsure) be useful to give a link to mathematical induction here, to give an idea for how the result is reached... perhaps something like "More generally, the direct product of any finite number of free abelian groups can be shown to be free abelian through mathematical induction"
- Is induction really necessary? Just take the disjoint union of the bases. Why do you need to do it one step at a time? —David Eppstein (talk) 21:04, 2 January 2022 (UTC)[reply]
"it is a quotient of the free abelian group over" - we link quotient in the lead but not here - do you think that would be helpful? It is linked in the "Rank" section, but "overlinking" in the body can be useful when terms are not yet fully understood by the reader
- Ok, re-linked. —David Eppstein (talk) 06:34, 3 January 2022 (UTC)[reply]
"Again, this is a group invariant" - this seems somewhat informal. Leaving it at "This is a group invariant" is probably enough - it's important enough to say again, but whether we need to stress its importance is not clear ... to me (your opinion welcome)
- Ok, reworded. —David Eppstein (talk) 21:04, 2 January 2022 (UTC)[reply]
A minor point, but MOS:SAID has some useful instruction about the word claimed, as in "Solomon Lefschetz and Irving Kaplansky have claimed that ...". My immediate reaction was what the MOS guidance says - that their statements are not reasonable or based in evidence. I think we can easily say "have said" here, unless Kaplansky gives a reason to doubt it. (I don't have access to Kaplansky to check, so I leave it to you.)
- Changed from "claimed" to "argue". The point of the wording was that this is really a statement of opinion rather than mathematical fact. —David Eppstein (talk) 21:04, 2 January 2022 (UTC)[reply]
What do you mean by "that solves the problem"?
- I meant that meets the conditions stated earlier in the same paragraph, but I tightened the wording to remove this. —David Eppstein (talk) 21:04, 2 January 2022 (UTC)[reply]
"no group element (non-identity)" - I think it would be clearer if it were "no (non-identity) group element", but this may be an intentional choice.
- I agree; reordered. I don't think the parens are necessary. —David Eppstein (talk) 05:31, 3 January 2022 (UTC)[reply]
Something feels off to me about "beyond having zero sum of multiplicities", but I'm not sure what it is. Maybe a zero sum? Or can we say something like "beyond having its multiplicities add to zero"?
- Rewrote to use a simple conjunction ("must have multiplicities summing to zero, and meet certain additional constraints") rather than trying to compare the two kinds of constraints using "beyond". —David Eppstein (talk) 06:28, 3 January 2022 (UTC)[reply]

For the formalities,

Well-written: Yes, with some suggestions above
Verifiable: Yes, with why I don't find the uncited text problematic above; reliable sources; no original research that I can see; no copyvio (Earwig's picks up nothing worrying)
Broad: Yes
Neutral: Yes
Stable: Yes - there is some talk page discussion about how best to present the material, but there's not ongoing substantial changes or disputes
On images: They are good; illustrative; the rationales for use are clear; captions are useful. Regarding the image File:Lattice in R2.svg - I like where this is. You may also consider moving it down in the section to be closer to the information relating to lattices.
The lead is well-written and gives a good overview for the subject.

As an aside, I find the citations to specific exercises amusing. Not because they're a problem, but because this is perhaps the only field we can do that sort of thing :) Hungerford was what we used for some classes, solid book.

I'll leave it here, and if I think of anything more, I'll add some comments. I think it's clearly at GA level, but I hope my feedback can improve the article, or if I'm off with my comments, I hope I can understand better your choices. Urve (talk) 05:34, 2 January 2022 (UTC)[reply]

Thanks for the review! I'll try addressing your comments individually over the next few days as I find time. —David Eppstein (talk) 07:51, 2 January 2022 (UTC)[reply]

@Urve: Ok, I think I've responded to everything; please take another look. —David Eppstein (talk) 06:34, 3 January 2022 (UTC)[reply]

Thanks so much. Re the induction thing: I just thought it would be a nice pointer - students will probably come across the article and wonder how that's done, but I'm sure they're able to recognize it, and it's not important to include. It's been a while since I taught algebra, but that was the approached we used - but no big deal. Just a thought.

I'll promote this shortly. Congratulations. Urve (talk) 07:07, 3 January 2022 (UTC)[reply]