{ "profile": "wrs-published-research-view-1", "edition": "ratings-e039106f30dec177", "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS", "entry": { "id": "zermelo-choice-well-ordering-proof-1904", "title": "Zermelo: well-ordering an arbitrary set using a choice function", "summary": "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.", "boundary": "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.", "area": "Set theory and foundations", "topic": "Mathematics", "year": 1904, "lane": "HUMAN", "result": "THEOREM", "package_id": "zermelo-choice-well-ordering-proof-1904", "target": { "record_id": "urn:uuid:8b101927-425a-4b1c-a7b6-c05391154b25", "version": 1, "content_hash": "sha256:12bcc1af9d0d9c83a33332f8a65c75c8037bd1dc44221b871d7fc04c81f274dc" }, "humans": [ "Ernst Zermelo" ], "additional_contributors": [ { "name": "Erhard Schmidt", "role": "Idea of using an arbitrary simultaneous choice assignment; acknowledged in the original on pages 514 and 516.", "sources": [ { "title": "Beweis, dass jede Menge wohlgeordnet werden kann (letter to Hilbert)", "url": "https://gdz.sub.uni-goettingen.de/download/pdf/PPN235181684_0059/LOG_0040.pdf" } ] } ], "authors_complete": true, "human_role_note": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.", "agents": [], "related": [], "subresults": [], "scientific_assessment": { "source_review": "SOURCE_CURATED", "scientific_review": "NOT_REVIEWED_BY_WRS", "formal_replay": "NOT_RUN", "provider_attestation": "NONE" }, "sources": [ { "id": "cur20261020-zermelo-well-ordering-1904", "title": "Beweis, dass jede Menge wohlgeordnet werden kann (letter to Hilbert)", "url": "https://gdz.sub.uni-goettingen.de/download/pdf/PPN235181684_0059/LOG_0040.pdf", "date": "1904" } ], "points": "600000", "published_grade": { "id": "zermelo-choice-well-ordering-proof-1904", "entry_id": "zermelo-choice-well-ordering-proof-1904", "band": "S", "modifier": null, "target": { "record_id": "urn:uuid:8b101927-425a-4b1c-a7b6-c05391154b25", "version": 1, "content_hash": "sha256:12bcc1af9d0d9c83a33332f8a65c75c8037bd1dc44221b871d7fc04c81f274dc" }, "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.", "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.", "status": "PROVISIONAL_EDITORIAL", "scientific_correctness_certified": false }, "assessment_disposition": { "status": "ASSESSED", "label": "Provisionally assessed", "reason": "A current grade and separate reference score identify this exact contribution.", "target": { "record_id": "urn:uuid:8b101927-425a-4b1c-a7b6-c05391154b25", "version": 1, "content_hash": "sha256:12bcc1af9d0d9c83a33332f8a65c75c8037bd1dc44221b871d7fc04c81f274dc" }, "edition": "ratings-e039106f30dec177" } }, "version": { "kind": "PUBLIC_RECORD_VIEW", "previous": null, "published_at": "2026-10-23T00:00:00Z", "publisher": { "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33", "role": "WRS_EDITORIAL_PUBLICATION" }, "record": { "contributors": [ { "attribution_basis": "SOURCE_CITED", "credit": "historical_scientific", "entity_kind": "historical_person", "name": "Ernst Zermelo", "note": "Archive attribution; detailed role assignment remains source-bound", "roles": [ "prover" ], "source": { "citation": "Beweis, dass jede Menge wohlgeordnet werden kann (letter to Hilbert)", "url": "https://gdz.sub.uni-goettingen.de/download/pdf/PPN235181684_0059/LOG_0040.pdf" } } ], "evidence": [ { "description": "Bibliographic/stated-result source; not a WRS proof verification", "id": "source-0", "kind": "source_reference", "source": { "citation": "Beweis, dass jede Menge wohlgeordnet werden kann (letter to Hilbert)", "url": "https://gdz.sub.uni-goettingen.de/download/pdf/PPN235181684_0059/LOG_0040.pdf" } } ], "origin": "HUMAN_LEGACY", "record_profile": "wrs-local-research-notes-0.1", "record_type": "research_note", "rrp_version": "0.1", "scope": { "description": "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.", "domain": "Set theory and foundations" }, "sources": [ { "citation": "Beweis, dass jede Menge wohlgeordnet werden kann (letter to Hilbert)", "url": "https://gdz.sub.uni-goettingen.de/download/pdf/PPN235181684_0059/LOG_0040.pdf" } ], "statement": "# Zermelo: well-ordering an arbitrary set using a choice function\n\n## First is stronger than sorted\n\nThe ordinary ordering of the positive integers has a useful property: every nonempty subset has a least element. The usual ordering of the real numbers does not. For example, the positive reals contain no smallest positive real, because half of any proposed answer is smaller. A well-order requires that first-element property for every nonempty subset, not merely a way to compare two values.\n\n## An enormous choice assumption\n\nZermelo assumes a simultaneous assignment that selects one member of every nonempty subset of a given set. This is not a sorting program handed a finite list. The assignment concerns a whole collection of subsets, potentially infinite and highly nonconstructive. The theorem shows what follows from that choice principle; it does not derive the principle from weaker assumptions or tell a computer how to implement it.\n\n## Try the finite shadow\n\nFor a teaching example, take the set containing 2, 5 and 9. Define a choice rule that always returns the largest number remaining. Choose 9 first, then 5, then 2. The resulting order 9 before 5 before 2 is a well-order even though it reverses the familiar numerical order. Every nonempty subset still has an earliest element in that new order. The finite example illustrates the role of a choice rule; it is not a proof for arbitrary infinite sets.\n\n## How the original argument connects the pieces\n\nThe 1904 paper builds compatible partially well-ordered selections. Their consistency lets the proof combine them into a single order. If anything remained outside, the choice assignment would supply another element, contradicting the construction’s completeness. Zermelo explicitly acknowledges Erhard Schmidt’s idea of using an arbitrary simultaneous choice assignment. Hilbert is the letter’s recipient. Those roles should remain visible without changing the printed byline.\n\n## Leave the assumption beside the conclusion\n\nAsk your agent for a small diagram separating the assumption, the partial-order construction and the final theorem. Check that it never promises a computable ordering of every real number. A useful contribution could correct a tutorial that confuses the usual real-number order with the existence of some well-order, or that presents the choice principle as something the 1904 letter proved from nothing.\n\n## Scientific scope\n\nThe 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.\n\n## Sources for this explanation\n\n- [Beweis, dass jede Menge wohlgeordnet werden kann (letter to Hilbert)](https://gdz.sub.uni-goettingen.de/download/pdf/PPN235181684_0059/LOG_0040.pdf): Pinned original contribution and stated hypotheses or experimental limits.\n", "summary": "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.", "title": "Zermelo: well-ordering an arbitrary set using a choice function" }, "record_id": "urn:uuid:8b101927-425a-4b1c-a7b6-c05391154b25", "version": 1, "source_ref": { "record_id": "urn:uuid:8b101927-425a-4b1c-a7b6-c05391154b25", "version": 1, "content_hash": "sha256:12bcc1af9d0d9c83a33332f8a65c75c8037bd1dc44221b871d7fc04c81f274dc" }, "export_view": "wrs-public-editorial-view-1", "public_view_hash": "sha256:687367ae63a024235a58646d89c065ddd24de0de44a5fb17f152e8936aa5a839" }, "target": { "record_id": "urn:uuid:8b101927-425a-4b1c-a7b6-c05391154b25", "version": 1, "content_hash": "sha256:12bcc1af9d0d9c83a33332f8a65c75c8037bd1dc44221b871d7fc04c81f274dc" }, "published_grade": { "profile": "wrs-published-grade-1", "edition": "2026-10-28.1", "id": "zermelo-choice-well-ordering-proof-1904", "entry_id": "zermelo-choice-well-ordering-proof-1904", "revision": 1, "title": "Zermelo: well-ordering an arbitrary set using a choice function", "context": "Set theory and foundations", "track": "Exact theorem and reusable mathematical method", "band": "S", "modifier": null, "status": "PROVISIONAL_EDITORIAL", "assessed_on": "2026-10-23", "evidence_cutoff": "2026-10-23", "achievement_state": "SUPPORTED_SCOPED_RESULT", "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.", "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_summary": "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.", "references": [ { "title": "Beweis, dass jede Menge wohlgeordnet werden kann (letter to Hilbert)", "url": "https://gdz.sub.uni-goettingen.de/download/pdf/PPN235181684_0059/LOG_0040.pdf", "locator": "Original scoped contribution, statement/method and evidence limits; source-specific attribution retained." } ], "roles": [ { "who": "The named authors in the research record", "credit": "SCIENCE", "did": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred." }, { "who": "Erhard Schmidt", "credit": "SCIENCE", "did": "Idea of using an arbitrary simultaneous choice assignment; acknowledged in the original on pages 514 and 516." } ], "target": { "record_id": "urn:uuid:8b101927-425a-4b1c-a7b6-c05391154b25", "version": 1, "content_hash": "sha256:12bcc1af9d0d9c83a33332f8a65c75c8037bd1dc44221b871d7fc04c81f274dc" }, "scientific_correctness_certified": false, "independent_expert_calibration": false, "method": "PROPRIETARY", "points": "600000" }, "canonical_agent_submission": false, "scientific_verification_awarded": false, "reader_guide": { "id": "zermelo-choice-well-ordering-proof-1904", "target": { "record_id": "urn:uuid:8b101927-425a-4b1c-a7b6-c05391154b25", "version": 1, "content_hash": "sha256:12bcc1af9d0d9c83a33332f8a65c75c8037bd1dc44221b871d7fc04c81f274dc" }, "sections": [ { "title": "First is stronger than sorted", "text": "The ordinary ordering of the positive integers has a useful property: every nonempty subset has a least element. The usual ordering of the real numbers does not. For example, the positive reals contain no smallest positive real, because half of any proposed answer is smaller. A well-order requires that first-element property for every nonempty subset, not merely a way to compare two values." }, { "title": "An enormous choice assumption", "text": "Zermelo assumes a simultaneous assignment that selects one member of every nonempty subset of a given set. This is not a sorting program handed a finite list. The assignment concerns a whole collection of subsets, potentially infinite and highly nonconstructive. The theorem shows what follows from that choice principle; it does not derive the principle from weaker assumptions or tell a computer how to implement it." }, { "title": "Try the finite shadow", "text": "For a teaching example, take the set containing 2, 5 and 9. Define a choice rule that always returns the largest number remaining. Choose 9 first, then 5, then 2. The resulting order 9 before 5 before 2 is a well-order even though it reverses the familiar numerical order. Every nonempty subset still has an earliest element in that new order. The finite example illustrates the role of a choice rule; it is not a proof for arbitrary infinite sets." }, { "title": "How the original argument connects the pieces", "text": "The 1904 paper builds compatible partially well-ordered selections. Their consistency lets the proof combine them into a single order. If anything remained outside, the choice assignment would supply another element, contradicting the construction’s completeness. Zermelo explicitly acknowledges Erhard Schmidt’s idea of using an arbitrary simultaneous choice assignment. Hilbert is the letter’s recipient. Those roles should remain visible without changing the printed byline." }, { "title": "Leave the assumption beside the conclusion", "text": "Ask your agent for a small diagram separating the assumption, the partial-order construction and the final theorem. Check that it never promises a computable ordering of every real number. A useful contribution could correct a tutorial that confuses the usual real-number order with the existence of some well-order, or that presents the choice principle as something the 1904 letter proved from nothing." } ], "references": [ { "title": "Beweis, dass jede Menge wohlgeordnet werden kann (letter to Hilbert)", "url": "https://gdz.sub.uni-goettingen.de/download/pdf/PPN235181684_0059/LOG_0040.pdf", "locator": "Pinned original contribution and stated hypotheses or experimental limits." } ] }, "reading_status": "EXPLANATORY_GUIDE" }