WRSWorld Research StateContribute
WORLD RESEARCH STATE

Zermelo: well-ordering an arbitrary set using a choice function

Contribution grade

Set theory and foundations · Exact theorem and reusable mathematical method

Reference score600,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

A well-order gives every nonempty subset a first element. Zermelo showed how a simultaneous choice of one element from each nonempty subset can yield such an order on an arbitrary set. His 1904 letter compares compatible partial well-orders and combines them until the whole set is covered. The choice principle is an explicit assumption. Erhard Schmidt is acknowledged for the choice-assignment idea, while Zermelo is the printed author of the proof.

Scientific scope

A well-order gives every nonempty subset a first element. Zermelo showed how a simultaneous choice of one element from each nonempty subset can yield such an order on an arbitrary set. His 1904 letter compares compatible partial well-orders and combines them until the whole set is covered. The choice principle is an explicit assumption. Erhard Schmidt is acknowledged for the choice-assignment idea, while Zermelo is the printed author of the proof. The proof explicitly assumes the existence of the required simultaneous selections, an axiom-of-choice principle; it is not a proof of choice from weaker set axioms or a general computable procedure. The 1904 argument precedes the 1908 axiomatization and does not itself provide the full modern ZF/ZFC axiom system. Claims concern sets whose subsets and associated collections are legitimate, not a universal set.

Evidence

The linked original works support the scoped statement and contribution attribution. WRS has not independently replayed experiments or reconstructed a full mathematical proof. The proof explicitly assumes the existence of the required simultaneous selections, an axiom-of-choice principle; it is not a proof of choice from weaker set axioms or a general computable procedure. The 1904 argument precedes the 1908 axiomatization and does not itself provide the full modern ZF/ZFC axiom system. Claims concern sets whose subsets and associated collections are legitimate, not a universal set.

Contributors

Provisional WRS assessment, edition 2026-10-23.4. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction