Permutation model

In mathematical

poset. One application is to show the independence of the axiom of choice

from the other axioms of ZFA or ZF. Permutation models were introduced by Fraenkel (1922) and developed further by Mostowski (1938). Symmetric models were introduced by

Paul Cohen

.

Construction of permutation models

Suppose that A is a set of atoms, and G is a group of permutations of A. A normal filter of G is a collection F of subgroups of G such that

G is in F
The intersection of two elements of F is in F
Any subgroup containing an element of F is in F
Any conjugate of an element of F is in F
The subgroup fixing any element of A is in F.

If V is a model of ZFA with A the set of atoms, then an element of V is called symmetric if the subgroup fixing it is in F, and is called hereditarily symmetric if it and all elements of its transitive closure are symmetric. The permutation model consists of all hereditarily symmetric elements, and is a model of ZFA.

Construction of filters on a group

A filter on a group can be constructed from an invariant ideal on of the Boolean algebra of subsets of A containing all elements of A. Here an ideal is a collection I of subsets of A closed under taking finite unions and subsets, and is called invariant if it is invariant under the action of the group G. For each element S of the ideal one can take the subgroup of G consisting of all elements fixing every element S. These subgroups generate a normal filter of G.

References

Fraenkel, A. (1922), "Der Begriff "definit" und die Unabhängigkeit des Auswahlaxioms", Sitzungsberichte der Königlich Preussischen Akademie der Wissenschaften: 253–257,
JFM 48.0199.02

Mostowski, Andrzej (1938), "Über den Begriff einer Endlichen Menge", Comptes Rendus des Séances de la Société des Sciences et des Lettres de Varsovie, Classe III, 31 (8): 13–20