A definable class bijection of a model's universe changes membership as displayed. Images and inverse images of sets under remain sets by the Axiom schema of replacement. The new extension of is the old set . Thus the representative of any desired extension is . Extensionality follows from bijectivity; separation and replacement translate to old definable formulas; pairs, unions and power sets have explicit representatives. Infinity follows by iterating the new empty set and successor. Foundation need not survive: interchanging and makes the old empty set a Quine atom. A full such permutation of a model of choice still satisfies choice; failure of choice requires an additional symmetry restriction.
A Quine atom is a set whose sole member is itself. It violates the Axiom of foundation while respecting the axiom of extensionality. Swapping pairwise distinct old objects with their singletons in a Rieger-Bernays permutation model supplies many Quine atoms, provided those transpositions have disjoint supports. For example, the old ordinals and their singletons are disjoint families.
Start with distinct formal atoms with membership extensions . Recursively adjoin a unique representative of every subset of a previous stage, except that uses the atom already present. Define membership by these extensions. Each set-sized collection of objects has bounded construction rank, so it has a representative at a later stage. This gives full extensionality, unlike adjoining an ordinary singleton distinct from a Quine atom. Definable subsets and ranges, unions and power sets are set-sized collections in the ambient model and hence have representatives. The pure finite hierarchy supplies infinity. Every permutation of the atoms extends recursively; hereditary finite support restriction gives the hereditarily finite-supported Quine-atom model, whose two-element atom subsets have no choice function.
Build the cumulative universe over an infinite set of Quine atoms, and extend every permutation of recursively to its other sets. An object has finite support if every permutation fixing that finite subset of fixes the object. Retain objects whose members, recursively away from the atomic self-loops, also have finite support. Parameters and domains give finite supports for definable subsets and functional ranges; the collection of all retained subsets of a retained set is again supported. These observations verify separation, replacement and power set, and the pure natural-number hierarchy gives infinity. There is no choice function on the two-element subsets of : swap two atoms outside its supposed finite support, fixing their unordered pair but interchanging either possible selected member.

Articles by others on the same topic (0)

There are currently no matching articles.