András Hajnal 2026-11-05
András Hajnal was a mathematician working in set theory and combinatorics. He served as director of DIMACS and later as a Rutgers mathematics professor before returning to Hungary after retirement.[ref]
One result bearing his name, proved with Paul Erdős, says that every infinite set admits an omega-Jónsson function: a colouring of its countably infinite subsets by its elements such that every subset of the same cardinality still sees every colour. Assuming the axiom of choice, even restricting to a large subset cannot simplify this colouring by omitting a colour. This illustrates the negative side of infinite partition relations, complementing Ramsey theory results that force homogeneous subsets.[ref]
Figure 1.
András Hajnal, Rutgers memorial portrait
.
Andrés Caicedo 2026-11-05
Andrés Caicedo is the mathematician specializing in set theory identified as Andrés Eduardo Caicedo on his author homepage.[ref] His published teaching notes develop infinite partition relations, including omega-Jónsson functions and their relationship to colourings of countably infinite subsets.[ref]
For an infinite set , an omega-Jónsson function has the form , and every with satisfies . Thus a large restriction still produces every colour. His notes present a proof of existence assuming the axiom of choice, explicitly attributing the theorem and the simplified proof to their discoverers. This is a concrete example of the interaction between cardinal arithmetic and infinite combinatorics.
Figure 1.
Andrés Eduardo Caicedo, Ann Arbor, June 2015; photograph by Juli Pinsak
.
Andrés E. Caicedo 2026-11-05
Andrés E. Caicedo works on set theory. His author homepage identifies the specialization, while his teaching archive develops cardinal arithmetic and elementary embeddings.[ref]
His cardinal-arithmetic lectures explain restrictions on elementary embeddings into transitive targets. A fixed point above the critical point can have an image that the target itself does not contain, a phenomenon proved using coding and combinatorial set theory. The example illustrates why an embedding's behavior on ordinals cannot be inferred from ordinary inclusion alone.[ref]
Critical point of an elementary embedding Created 2026-09-24 Updated 2026-11-05
For an elementary embedding between suitable transitive models of set theory, its critical point of an elementary embedding is the least ordinal with , provided such an ordinal exists. Since preserves ordinal order and fixes every , one has .
In the large-cardinal setting with inaccessible and transitive, the embedding fixes every element of the full ambient rank . One way to see the required size control is that is inaccessible in the domain: each lower-rank set has size less than , so an enumeration of length below is fixed pointwise once its values are fixed. Induction on rank then fixes all of .
The reference to the full rank domain matters. An arbitrary inner model may omit ambient sets of rank below , so a claim that its embedding fixes every ambient member of would not even be defined on those omitted sets.
Elementary embedding Created 2026-09-24 Updated 2026-11-05
An elementary embedding between first-order structures preserves and reflects every first-order formula with parameters: for every finite tuple from ,
In particular it is injective, by applying the condition to equality, and its image is an elementary substructure of . An elementary inclusion is the defining map of an elementary extension.
For example, the rational order is an elementary substructure of the real order in the language containing only , by quantifier elimination for dense linear orders without endpoints. Elementarity is stronger than preserving just the atomic relations. For embeddings between suitable transitive models of set theory, one can additionally ask which ordinals are moved; the least moved ordinal, when there is one, is the critical point of an elementary embedding. This ordinal notion is not part of the definition for arbitrary structures.
Forcing Created 2026-09-24 Updated 2026-11-05
Forcing constructs a generic extension of a model of a first-order theory of set theory from a partially ordered set in . A condition specifies partial information about a new object; in the standard order, means that specifies stronger information. A generic filter meets every dense subset of a forcing order belonging to . The elements of are obtained by evaluating forcing names from using .
For Cohen forcing, conditions are finite partial functions from to . Their union is a new binary sequence. Dense requirements make the sequence total and ensure that it differs from each old binary sequence. When is a countable transitive model, one can enumerate its dense sets externally and successively choose stronger conditions meeting them. This construction is conditional on having such a model; consistency of ZFC alone does not assert the existence of a countable transitive model.
The forcing theorem makes this method useful for proofs: the forcing relation is definable in the ground model, and truth in the generic extension is witnessed by a condition in the generic filter.
Foundations of mathematics Created 2026-09-24 Updated 2026-10-13
Foundations of mathematics asks what our objects mean, what we assume about them, and why an argument establishes its conclusion. Set theory gives a common language for collections and functions; mathematical logic makes the structure of statements and deductions precise. A mathematical definition fixes a meaning, an axiom supplies an assumption, and a mathematical proof explains what follows. Separating these roles makes results reusable: once the group axioms are enough for a conclusion, that conclusion applies to every group, regardless of how its members are represented.
The assumptions can change the answer to a familiar calculation. Over the real numbers, factors as , so is zero or one. The same reasoning holds in any integral domain, because a product can be zero only when a factor is zero. In the ring of integers modulo six, however, and : there are four solutions, represented by . The extra solutions are idempotents, and the failed step involves zero divisors. Writing the domain is part of explaining the answer.
This precision also reveals surprising possibilities. A two-dimensional grid of natural numbers is a countable set, while all infinite binary sequences form an uncountable set. The Cantor pairing function supplies a complete enumeration of the first; Cantor's diagonal argument defeats every proposed enumeration of the second. Both arguments are short, yet distinguish two sizes of infinity. The subject's appeal is this ability to turn a vague question into one whose assumptions, construction, and limits can all be inspected.
Large cardinal Created 2026-09-24 Updated 2026-11-05
A large cardinal is an infinite cardinal number satisfying a strong additional property, such as inaccessibility, weak compactness, or carrying a highly complete measure. The phrase names a family of axioms rather than one numerical size threshold.
For example, a strongly inaccessible cardinal is an uncountable regular strong limit cardinal, whereas a measurable cardinal carries a nonprincipal highly complete ultrafilter. Their significance is structural: they support strong reflection and compactness principles and organize consistency strengths in set theory. Merely taking a larger successor cardinal does not ensure any of these properties.
Basic-option schedule. The central description gives indicative choices including algebraic topology, category theory, information theory and quantum processes and computation; annual availability follows the handbook. 2026–27 handbook. Advanced-option schedule. Indicative choices include algebraic geometry, automata, logic and games, and axiomatic set theory. At least five lecture courses are required overall. Compulsory dissertation on a topic related to the taught material, undertaken in Trinity term and the summer.
Ordered pair Created 2026-09-24 Updated 2026-11-05
An ordered pair records two elements together with their positions. Its defining equality rule is exactly when and . Thus , and repeated entries such as are allowed.
The Cartesian product consists of the ordered pairs with first entry in and second entry in . A function can be represented by a set of such pairs with exactly one output for each input. In set theory, a Kuratowski ordered pair realizes the equality rule using ordinary sets.
This University of Oxford Part C paper is cross-listed for Mathematics, Mathematics and Computer Science, and Mathematics and Philosophy. Section A concerns topology, and section B concerns set theory. [ref] The archive contains the complete editable four-page transcription, with the source closure bars checked against the scan. Bounded official-source searches found no advertised answers to this exact paper. All source leaves and unnumbered preliminary tasks are covered below.
Source release: Oxford examination archive release thread, Part C bundle pages 305–308. This combined PDF covers both topology and set theory. The cover cross-lists Mathematics, Mathematics and Computer Science, and Mathematics and Philosophy, all Part C, Monday 7 June 2010, 2.30pm–5.30pm.
Answer availability checked on 28 October 2026: bounded official Oxford searches by exact year, paper label and both course names found no advertised exact-paper answers. The official syllabus for the 2010 examination identifies the combined unit. No later answer-release policy was assumed applicable.
This University of Oxford Part B paper is cross-listed for Mathematics, Mathematics and Computer Science, Mathematics and Philosophy, and Mathematics and Statistics. Section A concerns mathematical logic and section B concerns set theory. [ref] The archive contains a complete editable five-page transcription. Bounded official-source searches found no advertised answers to this exact paper. All 29 source leaves and the attached unnumbered tasks are covered below. In Q7(v), the convergence condition is retained exactly as printed, without adding absolute-value bars.
This University of Oxford Part B paper is cross-listed for Mathematics, Mathematics and Computer Science, Mathematics and Philosophy, and Mathematics and Statistics. It contains mathematical logic in section A and set theory in section B. [ref] The archive contains the full editable five-page transcription. Bounded official-source searches found no advertised answers for this exact 2008 paper. All source leaves are solved below, including all five optional arguments in A1(e) and the unnumbered preliminary tasks in B5, B6 and B7.
Work in a ground first-order model of set theory satisfying ZF, and let be a definable bijection of its universe, whose inverse is also definable. Write and replace membership by
In this Rieger-Bernays permutation model, an object having prescribed extension is represented by . The Axiom schema of replacement in the ground model guarantees that images of sets under and are sets. The axiom of extensionality follows from injectivity of ; the new empty set is , and the new pair of is .
For the Axiom of union and Axiom of power set, representatives are respectively
Indeed, is an -subset of exactly when . Translate every first-order formula by replacing membership with membership in . Ground separation then forms each desired subextension of , and ground replacement forms each functional image; applying supplies its representative. To verify the axiom of infinity, define by ground recursion
Then is an -inductive set. Thus every ZF axiom except possibly the Axiom of foundation survives.
Interchange two distinct objects and , fixing everything else. Then , so is a Quine atom: internally . The nonempty set has no member disjoint from itself, violating the Axiom of foundation. The original membership model satisfies that axiom. Foundation is therefore relatively independent of the other ZF axioms.
A full Rieger-Bernays permutation model of a choice model still satisfies the axiom of choice: choose an old member of each nonempty extension and encode the resulting choice graph with the new ordered-pair operations. To obtain failure of choice, an additional restriction by symmetries is necessary.
Start instead with ZFC and use the definable permutation interchanging every with . These transpositions are disjoint and produce an infinite set of Quine atoms. Inside the resulting membership model build the cumulative universe over , closing at successive stages under sets of previously constructed objects, represented by . Atomic objects are kept as the designated base objects; for . Every permutation of extends recursively to an automorphism of this universe, with the atomic self-loops fixed by the recursive convention.
An object has finite support if every permutation fixing some finite pointwise fixes it. Retain the objects which have finite support and whose members recursively also have finite support, interpreting the atomic self-loops as the base case. This is the hereditarily finite-supported Quine-atom model. It is transitive for the new membership relation. Extensionality is inherited. Pairs and unions have supports contained in the union of the finitely many relevant supports. For a supported set , the collection of all retained subsets of is a ground set, by the full model's power set axiom, and is fixed by every permutation fixing a support of . Its members are retained, so this collection supplies the internal power set. A first-order formula with retained parameters is invariant under their common stabilizer. Consequently its definable subset of , and the range of a functional relation on , have that same finite support; ground separation and replacement first ensure that they are sets. The pure natural-number hierarchy supplies infinity. These arguments verify all of ZF except Axiom of foundation, which fails at the Quine atoms.
The family of all two-element subsets is retained and has empty support. If it had a retained choice function , choose two distinct Quine atoms outside a finite support of . The transposition of fixes and fixes the unordered pair , but moves either possible value . This is impossible. Thus ZF without Foundation has both choice models and models in which Choice fails, relative to the usual consistency assumption. The construction also explains why twisting membership alone was insufficient.
Skolem's paradox is the apparent conflict between a countable model of a sufficiently strong set theory and that model's theorem asserting the existence of uncountable sets. Downward Löwenheim-Skolem theorem gives a countable elementary model whenever an appropriate infinite model exists; internally the same model still proves, for example, that its real-number set is uncountable.
The two uses of “countable” quantify over different collections of functions. Externally the whole model, and therefore the elements it regards as members of its real-number set, can be enumerated. Internally a set is countable only if an enumerating function exists among the sets of the model. The external enumeration need not be an element of the model.
Thus there is no contradiction: the model's assertion is that no function it contains is the required enumeration. Cantor's theorem remains valid inside the model. The model need not be transitive or have the actual standard natural numbers for this explanation; the essential issue is the restriction of internal quantifiers to its own domain.
Rank function of a partially ordered set Created 2026-10-20 Updated 2026-11-05
A rank function of a partially ordered set assigns an integer to each element so that whenever covers . In a finite ranked partially ordered set with minimal elements normalized to zero, is the length of every saturated chain from a minimal element to .
For subsets ordered by inclusion, cardinality is a rank function of a partially ordered set. For a chain , the normalized ranks are . An order with two saturated chains of unequal lengths between the same endpoints cannot have a rank function of a partially ordered set, because the required increments would assign conflicting values. This notion is distinct from the rank of a set in cumulative set theory.
Skolem's paradox 2026-10-31
A countable model of set theory can internally assert that an uncountable set exists. There is no contradiction because “there is a bijection” ranges only over functions in the model. An external enumeration of its domain need not itself be an element of that domain. Löwenheim-Skolem theorem controls external cardinality; Cantor's theorem remains valid for the sets and functions that the model contains.
A standard model of set theory interprets membership by the ambient membership relation restricted to its domain. A transitive model additionally has a transitive set or class as its domain. Standardness alone does not impose transitivity.