Aleph-one-Suslin decomposition into analytic sets Created 2026-09-28 Updated 2026-11-05
In ZFC, every -Suslin set is a union of many analytic sets. A branch through a representing tree uses a countable sequence of countable ordinals. That sequence is bounded below , so restrict the labels successively below .
Each restricted label set is countable and can be encoded by natural numbers; its projection is therefore an analytic set. The union of these projections is the original set. This is the case of Successor-Suslin decomposition. The proof explicitly uses the uncountable cofinality of and countable recoding, hypotheses that need care without the axiom of choice.
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]
https://www.math.rutgers.edu/people/department-directory/detail/343-in-memoriam/2066-hajnal-andras. Institutional memorial, 1931–2016 and career
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]
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]
https://websites.umich.edu/~caicedo/. Author homepage, mathematical identity
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.
Andrés Eduardo Caicedo, Ann Arbor, June 2015; photograph by Juli Pinsak
. Axiom of countable choice Created 2026-10-07 Updated 2026-10-14
The axiom of countable choice allows one to choose an element from each member of a countable family of nonempty sets. It is a restricted form of the axiom of choice. In the usual proof that a countable union of countable sets is countable, it suffices to choose one enumerating injection for each set; if those enumerations are already supplied, that proof requires no further choice.
Axiom schema of collection Created 2026-10-14 Updated 2026-10-31
For each formula, if every member of a domain set has a witness, a set contains witnesses for all those members. It permits extra members and does not require unique witnesses. For hereditarily countable sets, use ambient axiom of choice to select one internal witness for each member of the countable domain, and use countable-subset closure to keep the resulting witness set internal.
Boolean prime ideal theorem Created 2026-10-14 Updated 2026-10-31
Every proper lattice ideal of a Boolean algebra extends to a prime lattice ideal. More generally, an ideal disjoint from a lattice filter extends to a prime ideal still disjoint from that filter. This Boolean case of the Stone prime filter theorem is equivalent to the ultrafilter lemma over Zermelo–Fraenkel set theory and is weaker than the axiom of choice.
Cantor-Schröder-Bernstein theorem Created 2026-09-24 Updated 2026-10-18
For arbitrary sets and , the precise equivalence isThe reverse direction uses the bijection and its inverse function. Neither set is assumed to be a subset of the other: the hypothesis concerns functions, rather than containments. The forward direction holds in ZF without the axiom of choice.[ref]
Cantor-Schroeder-Bernstein Theorem by Paul Garrett. Paul Garrett, Cantor-Schroeder-Bernstein Theorem, p. 1, theorem and paragraph explicitly excluding the axiom of choice
This makes cardinality comparison an antisymmetric relation: if each set is no larger than the other in the sense of an injection, they have equal cardinality. It also gives a practical strategy: build two convenient injections and let the theorem supply the bijection. The Injection-chain proof of the Cantor-Schröder-Bernstein theorem explains how to combine them without losing an output or pairing two inputs with the same output.
Cardinalhood is Pi-one definable 2026-10-06
An ordinal is a cardinal number precisely when no smaller ordinal has a bijection onto it. Ordinalhood and the graph predicate for a bijection are bounded formulas in set theory, so is a Pi-one formula modulo ZF. This does not assert that every set can be assigned an ordinal cardinal without the axiom of choice.
Cardinality Created 2026-10-03 Updated 2026-10-14
The cardinality of a set expresses its size up to bijection. Two sets have the same cardinality exactly when a bijection pairs their members. For a finite set, cardinality is the ordinary number of set elements. In the presence of the axiom of choice, every set can be assigned the least ordinal in its bijection class as its cardinal number.
An injective function shows that is no larger than : different members of receive different partners in . If there are injections in both directions, the Cantor-Schröder-Bernstein theorem supplies a bijection. Infinite cardinality records this pairing structure rather than a geometric dimension or density. That is why a line of natural numbers and a grid of natural-number pairs can have the same size, while an interval of real numbers has larger cardinality.
For an infinite well-orderable cardinal number , each strict total order is a subset of , giving at most possibilities by the square of an infinite cardinal. For a lower bound, order two-element blocks by the ordinal index and independently reverse each block according to a subset of . Transport along . Distinct subsets give distinct orders. The usual axiom of choice development supplies these product identities; for well-orderable cardinals they are already provable in ZF.
Cardinal number Created 2026-09-24 Updated 2026-11-05
A cardinal number records the size of a set up to bijection. Two sets have the same cardinality exactly when such a bijection exists. Finite cardinals are ; the least infinite one is , the size of the natural numbers.
With the axiom of choice, every set can be well-ordered, and its cardinal is represented by the least ordinal in its bijection class, an initial ordinal. Infinite size does not behave like finite counting: the even natural numbers and all natural numbers have equal cardinality via . This notion is distinct from the order type recorded by an ordinal.
Cardinal product 2026-10-31
The cardinal product is the cardinality of the set of functions on the index set with at every coordinate. The empty product is one, because it contains the empty function. A zero factor makes a nonempty-index product zero. In ZFC, a family of nonzero cardinals has nonzero product by the axiom of choice.
With the axiom of choice, enumerate both players' binary-move strategies in an infinite game in length . Each strategy admits compatible plays. At stage , reserve a fresh play following I's strategy as a loss for I, and a fresh play following II's strategy as a win for I. Avoid all previously reserved plays, which number less than . The collection of the second reservations is a payoff set against which neither player has a winning strategy in an infinite game. This uses no regularity assumption on .
In a real normed vector space with a specified countable dense subset, a bounded linear functional on any vector subspace admits a norm-preserving extension without the axiom of choice. Add the dense vectors one at a time using the supremum endpoint in the one-dimensional dominated extension of a real linear functional. This makes the recursion deterministic. Extend from the resulting dense subspace by continuity, using the least index in the dense list which approximates a given vector to within .
Choice preservation by well-ordered names 2026-10-06
If the ground model has axiom of choice, well-order the set of subnames appearing in a forcing name for an arbitrary extension set. Evaluate those activated by the generic filter. Each element of the extension set has a least preimage index; ordering by these indices well-orders the set. Only ground choice and the ZF part of the forcing theorem are needed.
Cofinality of a power-set cardinal 2026-10-31
For an infinite cardinal number , use cardinal arithmetic with the axiom of choice. If had cofinality , choose cofinal ordinals , . Their cardinalities satisfy . The König theorem for cardinal numbers gives , a contradiction.
If some is not injective, extend two distinct equal-image elements to tuples using common choices at all other coordinates; the product is not injective. If some is not surjective, extend a missing target element to a tuple; the product is not surjective. The axiom of choice supplies these extensions. Thus the set-product functor reflects isomorphisms between families whose coordinates are all nonempty.
Every inner model of ZF contains the ambient constructible universe . By induction, : at successor stages, satisfaction in the same set structure and definability with parameters are absolute; at limits both constructions take the same union. Thus, if the ambient universe satisfies , its only inner model of ZF is itself, and it satisfies the axiom of choice. A procedure that must produce a choice-failing inner model from every model of ZF is therefore impossible. This does not assert that arbitrary inner models of arbitrary choice universes satisfy choice; the obstruction concerns a uniform construction.
Coproducts of projective objects are projective Created 2026-10-06 Updated 2026-10-14
A set-indexed coproduct in a category of projective objects in a category is projective. Restrict a map out of the coproduct to each summand, lift each restriction through the given epimorphism, and assemble the lifts by the coproduct universal property. Choosing an arbitrary family of lifts uses the usual axiom of choice. The empty coproduct, an initial object, is projective as well.
This concerns arbitrary compact spaces, with no Hausdorff restriction. For nonempty sets , adjoin a distinguished point and use the four-open-set topology . Each resulting space is compact without choice. The product has the canonical all-infinity point. The closed coordinate conditions have the finite intersection property, since finite choice is provable without the axiom of choice. If the countable product is compact, their intersection is nonempty, and any point in it supplies a choice function.

