Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

How do I see that there is a group of an arbitrary cardinality? Is this also true for abelian groups? Also, given a commutative ring $R\neq 0$ how do I see that there is an $R$-module of arbitrary cardinality? I'm sure I saw this result somewhere but I can't seem to find it anywhere (books, google,...) Thanks!

share|improve this question
3  
When $\kappa$ is an infinite cardinal, what is the cardinality of a $\mathbb{Q}$-vector space of dimension $\kappa$? –  Robin Chapman Jul 18 '10 at 15:06
2  
In addition to Robin's suggestion, you can consider the polynomial ring in $\kappa$ variables (for an infinite cardinal $\kappa$) over a given commutative ring. –  Asaf Karagila Jul 18 '10 at 15:19
1  
Continuing with this Socratic approach, is there a countable $\mathbb{R}$-vector space? –  Donu Arapura Jul 18 '10 at 15:20
    
@Donu: There can't be a countable $\mathbb{R}$-vector space, as any real vector space would have a surjective map onto $\mathbb{R}$, therefore would be of greater-or-equal cardinality, which is $2^{\aleph_0}$ which in turn is strictly greater than $\aleph_0$ and therefore uncountable. –  Asaf Karagila Jul 18 '10 at 15:26
1  
I guess I should have said cardinality equal to $\aleph_0$ in my original comment. I think Asaf caught my meaning. In my second comment that should read "look at the third question". It appears that I can't count finite sets either. –  Donu Arapura Jul 18 '10 at 15:53
show 5 more comments

2 Answers 2

up vote 7 down vote accepted

For any algebraic theory that is expressible in first order logic in a countable language, and this includes groups, rings, fields, partial orders, lattices, etc. etc., then the basic fact is expressed by the Lowenheim-Skolem theorem, which asserts that if the theory has an infinite model, then it has models of every infinite cardinality. In general, one gets models of the theory of every cardinality above the size of the language (and this covers your $R$-module case).

One needs the Axiom of Choice to prove this, however, and this use is necessary, since the Axiom of Choice is equivalent to the assertion that every set carries a group structure, as explained in the answer to this MO question.

share|improve this answer
    
Does the theory of $R$-modules get a constant per ring element? –  Mariano Suárez-Alvarez Jul 18 '10 at 15:14
    
@Mariano: More precisely, one unary function per ring element. –  François G. Dorais Jul 18 '10 at 15:15
    
Ah, ok. And the ring operations are codified by axioms, I guess, –  Mariano Suárez-Alvarez Jul 18 '10 at 15:41
    
The Lowenheim-Skolem theorem, as described above, is also called the Lowenheim-Skolem-Tarski theorem by some. –  Péter Komjáth Jul 18 '10 at 17:54
    
I suppose that one can reconcile this answer with the comments above concerning $\mathbb{R}$-vector spaces by observing that it would require an uncountable language: one constant (= 0-ary function surely) per real number. Would there be modification of Lowenhweim-Skolem for such uncountable languages? –  Donu Arapura Jul 19 '10 at 15:03
show 1 more comment

I just wanted to point out that I don't think that the Axiom of Choice is necessary to construct arbitrarily large groups. Can't you for each set $X$ take the collection of all formal (finite) linear combinations of elements of $X$ over the rationals, which then becomes a $\mathbb Q$-vector space of dimension the size of $X$?
Note that without AC we probably don't know that (in the case that $X$ is infinite) there is a bijection between $X$ and this vector space.

share|improve this answer
    
Or one can also just use large permutation groups. –  Joel David Hamkins Jan 19 '12 at 1:10
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.