Group structure and the axiom of choice

In mathematics a group is a set together with a binary operation on the set called multiplication that obeys the group axioms. The axiom of choice is an axiom of ZFC set theory which in one form states that every set can be wellordered.

Ernst Zermelo in 1904 proved the wellordering theorem using what was to become known as the axiom of choice.

In ZF set theory, i.e. ZFC without the axiom of choice, the following statements are equivalent:

  • For every nonempty set X there exists a binary operation • such that (X, •) is a group.[1]
  • The axiom of choice is true.

A group structure implies the axiom of choice

In this section it is assumed that every set X can be endowed with a group structure (X, •).

Let X be a set. Let ℵ(X) be the Hartogs number of X. This is the least cardinal number such that there is no injection from ℵ(X) into X. It exists without the assumption of the axiom of choice. Assume here for technical simplicity of proof that X has no ordinal. Let • denote multiplication in the group (X ∪ ℵ(X), •).

For any x ∈ X there is an α ∈ ℵ(X) such that x • α ∈ ℵ(X). Suppose not. Then there is an y ∈ X such that y • α ∈ X for all α ∈ ℵ(X). But by elementary group theory, the y • α are all different as α ranges over ℵ(X) (i). Thus such a y gives an injection from ℵ(X) into X. This is impossible since ℵ(X) is a cardinal such that no injection into X exists.

Now define a map j of X into ℵ(X) × ℵ(X) endowed with the lexicographical wellordering by sending x ∈ X to the least (α, β) ∈ ℵ(X) × ℵ(X) such that x • α = β. By the above reasoning the map j exists and is unique since least elements of subsets of wellordered sets are unique. It is, by elementary group theory, injective.

Finally, define a wellordering on X by x < y if j(x) < j(y). It follows that every set X can be wellordered and thus that the axiom of choice is true.[2][3]

For the crucial property expressed in (i) above to hold, and hence the whole proof, it is sufficient for X to be a cancellative magma, e.g. a quasigroup.[4] The cancellation property is enough to ensure that the y • α are all different.

The axiom of choice implies a group structure

Any nonempty finite set has a group structure as a cyclic group generated by any element. Under the assumption of the axiom of choice, every infinite set X is equipotent with a unique cardinal number |X| which equals an aleph. Using the axiom of choice, one can show that for any family S of sets |⋃S| ≤ |S| × sup { |s| : s ∈ S} (A).[5] Moreover, by Tarski's theorem on choice, another equivalent of the axiom of choice, |X|n = |X| for all finite n (B).

Let X be an infinite set and let F denote the set of all finite subsets of X. There is a natural multiplication • on F.[6] For f, g ∈ F, let f • g = f Δ g, where Δ denotes the symmetric difference. This turns (F, •) into a group with the empty set, Ø, being the identity and every element being its own inverse; f Δ f = Ø. The associative property, i.e. (f Δ g) Δ h = f Δ (g Δ h) is verified using basic properties of union and set difference. Thus F is a group with multiplication Δ.

Any set that can be put into bijection with a group becomes a group via the bijection. It will be shown that |X| = |F|, and hence a one-to-one correspondence between X and the group (F, •) exists. For n = 0,1,2, ..., let Fn be the subset of F consisting of all subsets of cardinality exactly n. Then F is the disjoint union of the Fn. The number of subsets of X of cardinality n is at most |X|n because every subset with n elements is an element of the n-fold cartesian product Xn of X. So |Fn| ≤ |X|n = |X| for all n (C) by (B).

Putting these results together it is seen that |F| = |⋃n ∈ ωFn| ≤ ℵ0 · |X| = |X| by (A) and (C). Also, |F| ≥ |X|, since F contains all singletons. Thus, |X| ≤ |F| and |F| ≤ |X|, so, by the Schröder–Bernstein theorem, |F| = |X|. This means precisely that there is a bijection j between X and F. Finally, for x, y ∈ X define x • y = j−1(j(x) Δ j(y)). This turns (X, •) into a group. Hence every set admits a group structure.

A ZF set with no group structure

There are models of ZF in which the axiom of choice fails.[7] In such a model, there are sets that cannot be well-ordered (call these "non-wellorderable" sets). Let X be any such set. Now consider the set Y = X ∪ ℵ(X). If Y were to have a group structure, then, by the construction in first section, X can be well-ordered. This contradiction shows that there is no group structure on the set Y.

If a set is such that it cannot be endowed with a group structure, then it is necessarily non-wellorderable. Otherwise the construction in the second section does yield a group structure. However these properties are not equivalent. Namely, it is possible for sets which cannot be well-ordered to have a group structure.

For example, if is any set, then has a group structure, with symmetric difference as the group operation. Of course, if cannot be well-ordered, then neither can . One interesting example of sets which cannot carry a group structure is from sets with the following two properties:

  1. is an infinite Dedekind-finite set. In other words, has no countably infinite subset.
  2. If is partitioned into finite sets, then all but finitely many of them are singletons.

To see that the combination of these two cannot admit a group structure, note that given any permutation of such set must have only finite orbits, and almost all of them are necessarily singletons which implies that most elements are not moved by the permutation. Now consider the permutations given by , for which is not the neutral element, there are infinitely many such that , so at least one of them is not the neutral element either. Multiplying by gives that is in fact the identity element which is a contradiction.

The existence of such a set is consistent, for example given in Cohen's first model.[8] Surprisingly, however, being an infinite Dedekind-finite set is not enough to rule out a group structure, as it is consistent that there are infinite Dedekind-finite sets with Dedekind-finite power sets.[9]

Notes
  1. A cancellative binary operation suffices, i.e. such that (X, •) is a cancellative magma. See below.
  2. Hajnal & Kertész 1972
  3. Rubin & Rubin 1985, p. 111
  4. Hajnal & Kertész 1972
  5. Jech 2002, Lemma 5.2
  6. Adkins & Weintraub 1992
  7. Cohen 1966
  8. Dougherty, Randall (February 1, 2003). "sci.math "Group structure on any set"".
  9. Karagila, Asaf (August 26, 2014). "Exponentiation and Dedekind-finite cardinals". MathOverflow.

References
  • Hajnal, A.; Kertész, A. (1972). "Some new algebraic equivalents of the axiom of choice". Publ. Math. Debrecen. 19: 339–340.CS1 maint: ref=harv (link)
  • Rubin, Herman; Rubin, Jean E. (July 1985). Equivalents of the Axiom of Choice II. North Holland/Elsevier. ISBN 0-444-87708-8.CS1 maint: ref=harv (link)
  • Jech, Thomas (2002). Set theory, third millennium edition (revised and expanded). Springer. ISBN 3-540-44085-2.CS1 maint: ref=harv (link)
  • Cohen, Paul J. (1966). Set theory and the Continuum Hypothesis. Benjamin, New York.CS1 maint: ref=harv (link)
  • Adkins; Weintraub (1992). Algebra. Graduate Texts in Mathematics. 136. Springer.CS1 maint: ref=harv (link)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.