Q as Module over Z: Proving Unfinite Generating Ability

  • Context: Graduate 
  • Thread starter Thread starter sab47
  • Start date Start date
  • Tags Tags
    module
Click For Summary

Discussion Overview

The discussion revolves around the concept of finitely generated modules, specifically addressing whether the set of real numbers (R) is finitely generated as a module over the set of rational numbers (Q). Participants explore the implications of this property and seek a rigorous proof or understanding of the underlying concepts.

Discussion Character

  • Exploratory
  • Technical explanation
  • Conceptual clarification
  • Debate/contested
  • Homework-related

Main Points Raised

  • One participant expresses difficulty in finding a rigorous proof that R is not finitely generated over Q and considers using a counterexample approach similar to a previous case involving Q over Z.
  • Another participant questions the meaning of finding a counterexample in this context.
  • A participant explains their previous reasoning for Q not being finitely generated over Z, suggesting that if a finite set generates Q, one can find an element in Z that cannot be generated by that set.
  • Some participants note that the number of elements in a finitely generated module over Q is limited and contrasts this with the uncountable nature of R.
  • There is a suggestion that understanding concepts of countability and cardinality may be necessary to grasp the problem fully.
  • A later reply emphasizes that a finitely generated module over Q has the same cardinality as Q, which is less than that of R.
  • One participant advises learning basic set theory and concepts like cardinalities, the Schröder-Bernstein theorem, and Zorn's lemma as prerequisites for studying modules and rings.

Areas of Agreement / Disagreement

Participants express varying levels of understanding regarding the concepts of finitely generated modules and cardinality. There is no consensus on a specific proof or method to demonstrate that R is not finitely generated over Q, and multiple viewpoints on the approach to the problem are present.

Contextual Notes

Participants mention the importance of cardinality and set theory, indicating that some foundational knowledge may be missing or unclear, which affects the discussion's progression.

sab47
Messages
7
Reaction score
0
Hey guys,

I'm self-teaching maths to preper myself for the next term of uni, so I'm reading this book on abstract algebra, and somewhere it says that R (the set of real numbers) is not finitely generated as a module over Q (set of rational numbers). Now, I can see that it's not, but i can't think of a rigorous proof for it. I thought maybe i hould just find a countr example like i did in a different case (Q is not finitely ggenerated over Z) but I'm prety bad at these counter examples! lol. Can anyone help me make sense of this? cause i prefer to understand everything before i continue to the next part.
 
Physics news on Phys.org
What would it mean to find a counterexample here?
 
DeadWolfe said:
What would it mean to find a counterexample here?

there was a similar statement which said Q is not finitely generated over Z. So what I did with that was i said if we assume q1,...,qn generate Q. Then take a z in Z which is coprime with the denominator of all members of the generatind set (i.e coprime with all qi) then 1/z cannot be generated by this set q1,...,qn . so Q is not finitely generated.

So this is what I meant by a counter example, finding something like 1/z above, which can't be generated by the generating set. Pehaps counter example isn't the best way to put it!
 
for R over Q, merely the number of elements suffices.
 
mathwonk said:
for R over Q, merely the number of elements suffices.

number of elements? how do you mean?
 
How many elements can a finitely-generated module over Q possibly have? How many elements does R have?
 
AKG said:
How many elements can a finitely-generated module over Q possibly have? How many elements does R have?

Should I somehow show that any finitely generated set over Q has finite number of elements? Sorry to be so slow, like I said I'm self teaching these things. There must be a theorem or something about number of elements of finitely generated modules which I've forgotten!
 
sab47 said:
Should I somehow show that any finitely generated set over Q has finite number of elements?

No, of course not. Q is finitely generated over itself, how many elements does it have? What if F is a finitely generated free module over Q? How many elements does it have? Can this help us solve the more general problem?
 
Last edited:
do you know about countable, uncountable? this theory was introduced by cantor some 100 years ago.
 
  • #10
mathwonk said:
do you know about countable, uncountable? this theory was introduced by cantor some 100 years ago.

Not so much, no. I've just heard of it. But I'll look into it.
 
  • #11
the point is a finitely generated module iover Q has the same number of elements as Q, while that is less than the number of elements of R.
 
  • #12
I suggest you learn some basic set theory before going too deep into algebra. Knowledge of cardinalities, the schroder-bernstein theorem and Zorn's lemma are all pretty important prerequisites for studying modules and rings properly.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 10 ·
Replies
10
Views
7K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 8 ·
Replies
8
Views
7K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 17 ·
Replies
17
Views
7K
  • · Replies 10 ·
Replies
10
Views
9K