Disjoint union¶
Core Idea¶
Disjoint union is the cross-domain aggregation operation that forms one carrier from many carriers without losing provenance, by embedding each source into a separate labeled component. The abstraction is not exhausted by its familiar source-domain notation. Its autonomous core is provenance-preserving union, distinct from ordinary union that merges equal members, Cartesian product, concatenation dependent on order or arbitrary partitioning without source embeddings.
The operative mechanism is this: Each element x of source A_i is paired with its index i, the tagged pairs are collected and the canonical injections map each source into a component whose images are pairwise disjoint and jointly exhaustive. The mechanism separates identity from observation.
Broad Use¶
sets. The carrier is overlapping sets A and B. The identity test is that tag elements by A or B. This is a literal instantiation rather than decorative analogy because the carrier, observable organization, conserved relation, variation class, and failure test retain the same roles. The domain accent is shared values appear as two distinct members. A responsible analysis states scale, observation window, representation and noise model before claiming the structure, then distinguishes the structure itself from the process used to discover, stabilize or exploit it. Removing the constitutive relation must make the classification fail; otherwise the label is only topical resemblance.
Clarity¶
A clear Disjoint union claim can be rewritten as a testable sentence: on carrier C at scale S, relation R holds within tolerance T, remains under transformations V, and fails for counterexample K. This grammar exposes missing components and prevents a noun from standing in for an argument.
Manages Complexity¶
Disjoint union manages complexity by replacing an unstructured inventory with a small set of relations that survive relevant variation. Compression becomes legitimate when the retained relation supports reconstruction, comparison or reliable discrimination and the discarded details are declared incidental for the task.
The abstraction also supports chunking. Once an organized unit is established, reasoning can treat it as one object while retaining an audit trail to its elements.
Abstract Reasoning¶
- Type the carrier and explain why its elements are individuated at the selected scale. 2. Separate the target structure from the notation, image, model or story used to display it. 3. State the constitutive relation as an equation, rule, repeatability condition or traceable interpretive criterion. 4. List transformations expected to preserve identity and justify why they are incidental. 5. Choose at least one positive diagnostic and one collapse test.
Knowledge Transfer¶
Transfer begins from the role graph, not the name. Preserve carrier, relation, invariant, admissible variation, diagnostic and collapse test; then substitute domain occupants. A successful mapping explains how the target case would be recognized and how it would fail.
The most common transfer error is feature substitution. One field may represent the structure visually, another algebraically and another behaviorally. The visible features are not the invariant. Transfer must identify the relation those features evidence and state the target domain's measurement or proof obligations.
Relationships to Other Abstractions¶
Current abstraction Disjoint union Prime
Parents (1) — more general patterns this builds on
-
Disjoint union is a kind of Aggregation Prime
The accepted reference-grade review places Disjoint union under Aggregation because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
Hierarchy path (1) — routes to 1 parentless root
- Disjoint union → Aggregation → Micro Macro Linkage