Basic Fraenkel permutation model 2026-10-14
Start with a well-founded universe of sets over an infinite set of urelements. The full symmetric group of acts recursively on sets. Retain the objects all of whose descendants have a finite support in a permutation action. This class satisfies set-extensionality, foundation, infinity, pairing, union, separation, replacement and its internal power set axiom. A definable functional image has the finite union of the supports of its domain and parameters as a support; uniqueness makes the image invariant. The family of two-element subsets of has no choice function: a transposition of two atoms outside the function's finite support fixes their pair and moves either possible choice. For untyped membership with extensionality merely restricted to nonempty objects, atoms are also vacuous subsets; add all atoms to each internal power-set object.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 26 8 Solution Created 2026-10-03 Updated 2026-10-14
Write for ZF with the Axiom of foundation omitted. Independence is a relative-consistency assertion: from a model of ZFC we construct models of , both with and without axiom of choice. A model of ZFC itself supplies the positive cases.
First use a Rieger-Bernays permutation model. Inside the starting model choose a definable class bijection and put exactly when . The new extension of is the old set , so any prescribed set of new members has representative . We verify the axioms rather than treating the change of membership as automatically harmless.
The axiom of extensionality follows from injectivity of . The new empty set is and a pair with members is . The union of a new set is represented byA new subset of means . Hence the new power set of is represented byThese are sets by the original power-set and replacement axioms. Translate each formula by replacing membership with . The original separation axiom extracts the required subset of , and replacement collects the range of a definable functional relation on ; applying gives their new representatives. Thus the full Axiom schema of replacement and separation schemes survive.
For axiom of infinity, start at , iterate the new successor along the old , and take a new set representing this range. It contains the new empty set and is closed under the new successor. Finally, the old axiom of choice well-orders each old extension . Encode that relation using new ordered pairs and its new set representative. All subsets of the extension are represented in the new model, so this is genuinely a new well-order. Thus choice survives the full membership permutation.
Now transpose the old and and fix every other object. The old empty set satisfies , so its sole new member is itself: it is a Quine atom. The nonempty new set has no member disjoint from it, violating foundation. This gives . Together with the starting model, this proves independence of foundation.
For failure of choice, a membership permutation alone is insufficient, as the verification above shows. Add a symmetry restriction. Choose distinct old objects for and let simultaneously swap with , fixing all other objects. The two families are disjoint, so this is a class bijection. Each is now a Quine atom. Write for the new set having precisely these atoms as members.
Every permutation of the atoms extends to an automorphism of the new universe, fixing its pure well-founded part. To construct it, send the atoms according to the prescribed permutation and, for any other object , take the unique object whose new members are the images of its new members. This recursion is well founded away from the atomic self-loops: every other membership step decreases old rank, including the steps from the transposed singletons to their old extensions. Thus all the required automorphisms exist.
An object is supported by a finite set if every atom permutation fixing pointwise fixes it. Let consist of objects that have finite support in a permutation action and all of whose new membership descendants also have finite support in a permutation action. This is the hereditarily finite-supported Quine-atom model. The atoms belong to , as does itself. We check that restricting to preserves .
Extensionality is inherited because every member of an object of is again in . Empty sets, pairs and unions have supports obtained by taking finite unions of the supports of their parameters, and their descendants are already supported. The pure natural numbers and their set are fixed by every atom permutation, giving infinity. For separation, permutations fixing the domain and formula parameters preserve the defined subset, which therefore has their common finite support in a permutation action. For replacement, translate the relativized formula into the original universe and use original replacement to collect its unique values. Every value lies in , and the range is invariant under the same finite support in a permutation action. Finally, the collection of all -subsets of an object is a subcollection of its full new power set, hence is a set in the original universe. Every permutation fixing a support of permutes these supported subsets, so this collection is supported; its members and their descendants lie in . This verifies the internal power-set axiom. These arguments handle the full schemes with arbitrary finite tuples of parameters.
There is no choice function on the two-element subsets of in . Suppose were one and had finite support in a permutation action . Choose distinct atoms . The transposition exchanging them fixes and the unordered pair , but exchanges its two possible selected values. Thusis impossible. The family of all such pairs belongs to : it is invariant under every atom permutation and each pair has finite support in a permutation action. Therefore ; it still contains the self-membered atoms, so it also fails foundation. We have provedThe positive-choice permutation model and this negative-choice symmetry model establish independence of choice from . These constructions can be carried out internally in any starting model; no assumption of a transitive set model is needed.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 25 2 Solution Created 2026-10-03 Updated 2026-10-14
The Rieger-Bernays permutation model changes membership, not the underlying domain. In a model of ZF, let be a definable class bijection, with parameters allowed, and defineEvery old set is the new extension of precisely the object . Translation of formulas replaces each membership assertion by this definable relation. Both images and inverse images of old sets under are sets by replacement.
Here are the axiom checks. Extensionality follows because equal new extensions mean and hence . The new empty set is and the new pair is . For an object , new union and power set have representativesThese formulas verify the actual new membership conditions. A definable subset of the new extension is an old set by separation after translation, and its representative gives new separation. Similarly, a functional new formula on that extension has an old set as range by replacement; apply to its range. For infinity, iterate the new successor operationstarting from the new empty set. Old recursion and replacement collect its finite iterates into a set , and is a new inductive set. Thus all axioms of ZF except possibly foundation hold.
Now swap the old objects and and fix everything else. The old object then satisfies , and its entire new extension is . It is a Quine atom, so foundation fails. Taking to be the identity gives the original model where foundation holds. Foundation is independent of the other ZF axioms, relative to consistency of ZF.
A full permutation of a model of choice does not destroy choice. Given a new family of nonempty new sets, old choice selects an element of each old extension ; replacement converts its graph into new ordered-pair coding. Thus simply repeating the preceding unrestricted permutation construction would not prove independence of choice. The extension needed is the hereditarily finite-supported Quine-atom model.
Start with a model of ZFC and simultaneously swap with for all . These transpositions have disjoint supports: none of these infinite ordinals is a singleton, and the ordinals and their singletons are separately distinct. Put , whose members now have new extensions . Build the universe over these Quine atoms by allowing arbitrary new sets of previously constructed objects at each successor stage, and taking unions at limit stages. More explicitly, begin with , putand take the union over all ordinals. The singleton with sole member is already , as extensionality requires; it is not added as a different atom or set. Every other object's membership has a well-founded construction rank once these designated atomic self-loops are treated as rank-zero leaves.
Every permutation of extends to an automorphism of this universe: on atoms use , and on every non-atomic object recurse byThe inverse permutation gives its inverse, and the formula preserves . Call an object supported by a finite when every permutation fixing pointwise fixes that object. Retain only objects which are supported and all of whose members are hereditarily supported; the recursion here again stops at atoms, whose support is their singleton. Denote this class by .
We verify that is a model of ZF without foundation. It is membership-closed and hence retains extensionality. Pairing uses the union of the two parameter supports, and union uses the support of its input. For separation, use the finite union of the supports of the domain and all parameters: permutations fixing them preserve satisfaction in , so they fix the defined subset. Every member remains hereditary. For replacement, the same support fixes the image of a definable functional relation; its elements already lie in by the internal range condition, and old replacement supplies the underlying set of them. These assertions are legitimate class translations because construction ranks, supports and hereditary support are definable in the starting model.
For power set, start with the set of all new subsets of a supported set and retain exactly those lying in . The resulting collection is fixed by every permutation fixing the original set's support: the action preserves hereditary support and permutes its subsets. Every retained member is hereditary, so this is the internal power set. The empty set and the pure finite and infinite natural-number hierarchy have empty support, yielding infinity. The new pairing, union and comprehension representatives discussed above therefore remain inside . Foundation still fails because all the Quine atoms are in .
The set itself has empty support and hereditary members. So does the family of its two-element subsets, each of which has a finite support in a permutation action. If this family had a choice function , let be a finite support in a permutation action of , and choose distinct . The transposition of fixes and the unordered pair , but interchanges either possible chosen value . It cannot fix the function graph, contradicting its support. Thus choice fails in .
The unrestricted permutation model over the same initial ZFC model satisfies choice and fails foundation, whereas its hereditarily supported submodel fails both. Hence choice is independent of ZF with foundation omitted. These are relative-consistency constructions, not an assertion that ZF proves its own consistency. Starting with ZFC is harmless for the usual consistency comparison with ZF, by the constructible-universe relative-consistency theorem.