Diaconescu's theorem¶
The constructive-logic result that a sufficiently strong axiom of choice entails the law of excluded middle.
Core Idea¶
The proof builds sets whose equality depends on an arbitrary proposition, applies choice to a surjection or family and uses extensional equality of chosen representatives to decide that proposition. Choice selects representatives from proposition-dependent overlapping subsets; decidable equality of a small ambient object converts the selection into either the proposition or its negation. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
Diaconescu's theorem belongs to constructive set theory and is useful where the analyst can specify the typed constructive set theory carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the constructive foundation and exact choice principle, arbitrary proposition, proposition-dependent sets or epimorphism, selected section, extensionality and separation assumptions and derivation of excluded middle are explicit. The scope is broad within that domain but bounded by the need for the constructive foundation and exact choice principle, arbitrary proposition, proposition-dependent sets or epimorphism, selected section, extensionality and separation assumptions and derivation of excluded middle are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the constructive foundation and exact choice principle, arbitrary proposition, proposition-dependent sets or epimorphism, selected section, extensionality and separation assumptions and derivation of excluded middle are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Diaconescu's theorem can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Diaconescu's theorem. Diaconescu's theorem compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed constructive set theory carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the constructive foundation and exact choice principle, arbitrary proposition, proposition-dependent sets or epimorphism, selected section, extensionality and separation assumptions and derivation of excluded middle are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of constructive set theory because they reuse the typed constructive set theory carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, Choice selects representatives from proposition-dependent overlapping subsets; decidable equality of a small ambient object converts the selection into either the proposition or its negation., and type the carrier, state every parameter and convention in the definition, test that the constructive foundation and exact choice principle, arbitrary proposition, proposition-dependent sets or epimorphism, selected section, extensionality and separation assumptions and derivation of excluded middle are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Diaconescu's theorem Domain-specific
Parents (1) — more general patterns this builds on
-
Diaconescu's theorem is a kind of Constraint Prime
The proposed strict upward parent is
prime:constraint.
Hierarchy path (1) — routes to 1 parentless root
- Diaconescu's theorem → Constraint
Neighborhood in Abstraction Space¶
Diaconescu's theorem sits in a crowded region of the domain-specific corpus (23rd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Set Theory & Constructive Foundations (15 abstractions)
Nearest neighbors
- Inhabited set — 0.93
- Transfinite number — 0.92
- Partition of a set — 0.91
- Vitali set — 0.91
- Symmetric difference — 0.90
Computed from structural-signature embeddings · 2026-09-08