Processing math: 100%

Sunday, 13 January 2008

set theory - Does every non-empty set admit a group structure (in ZF)?

You cannot in general put a group structure on a set. There is a model of ZF with a set A that has no infinite countable subset and cannot be partitioned into finite sets; such a set has no group structure.



See e.g at http://groups.google.com/group/sci.math/msg/06eba700dfacb6ed




Sketch of proof that in standard Cohen model the set A=an:ninomega of adjoined Cohen reals cannot be partitioned into finite sets:



Let mathbbP=Fn(omegatimesomega,2) which is the poset we force with. The model is the symmetric submodel whose permutation group on mathbbP is all permutations of the form pi(p)(pi(m),n)=p(m,n) where pi varies over all permutations of omega, (that is we are extending each pi to a permutation of mathbbP which I also refer to as pi) and the relevant filter is generated by all the finite support subgroups.



Suppose for contradiction that pVdash"bigcupiinIdotAi=A is a partition into finite pieces"; let E (a finite set) be the support of this partition. Take some ai0notinE and extend p to a q such that qVdashai0,ldotsain is the piece of the partition containing ai0". Then pick some j which is not in E nor the domain of q nor equal to any of the ai0,ldotsail. If pi is a permutation fixing E and each of ai1,ldotsain and sending ai0 to aj, it follows that pi(q)Vdash"aj,ai1,ldotsain is the piece of the partition containing a_j". But also q and pi(q) are compatible and here we run into trouble, because q forces that ai0 and ai1 are in the same piece of the partition, and pi(q) forces that this is not the case (and they are talking about the same partition we started with because pi fixes E). Contradiction.

No comments:

Post a Comment