Disjoint union¶

Version: v1 · 2026-09-08 · History
Prime #: 1512
Aliases: Discriminated 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.^[n1]

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. A case does not qualify merely because an observer can describe it using the word disjoint union; the constitutive relation must be present in the carrier.

The load-bearing invariant is that an indexed family of source collections, a result carrier, one injective embedding per source, pairwise disjoint images and coverage of the result by those images. Carrier, relation, invariant, admissible variation and collapse condition must all be typed. This blocks migration from an exact mathematical or empirical claim into a loose metaphor.^[1]

Across substrates, notation and evidence change while the role graph remains. The analyst first identifies what can vary, then identifies the organization that survives those variations, then tests a nearby counterexample. This conserved decision sequence is the basis for Prime status.^[2]

The strict residual is provenance-preserving union, distinct from ordinary union that merges equal members, Cartesian product, concatenation dependent on order or arbitrary partitioning without source embeddings. It is broader than one technique that recognizes or controls the structure and narrower than an unqualified claim of order, resemblance or usefulness. A reference-grade use therefore states both the positive test and the nearest boundary.

Structural Signature¶

Typed carrier: the objects, states, events or observations on which the claimed organization exists.
Granularity: the spatial, temporal, logical or institutional scale at which elements and relations are individuated.
Constitutive relation: a repeatable, invariant or organizing relation that does more work than the shared label.
Observation map: a declared way of measuring or representing the carrier without confusing the representation with the thing.
Admissible variation: transformations or perturbations that preserve identity and reveal which features are incidental.
Invariant: a relation or diagnostic that remains stable across those variations.
Boundary counterexample: a neighboring case with superficial similarity but without the constitutive relation.
Evidence path: proof, measurement, repeated observation or traceable interpretation supporting the claim.
Uncertainty: sensitivity to noise, sampling, resolution, model choice and observer expectation.
Collapse test: a change that removes the invariant and therefore destroys the identity.
Transfer mapping: literal occupants for every role in a second substrate, not a metaphorical reuse of vocabulary.
Use separation: discovery, prediction, control and communication are consequences or applications, not the identity itself.

What It Is Not¶

It is not ordinary union when sources overlap.
It is not a Cartesian product of simultaneous choices.
It is not necessarily ordered concatenation.
It is not merely declaring sources disjoint without constructing distinguishable embeddings.
It is not one canonical example. An example demonstrates the abstraction but cannot define the whole class.
It is not a detector or recognition algorithm. A fallible method can identify the structure, but method and target remain distinct.
It is not a convenient label for anything organized. The constitutive relation and collapse test must be stated.
It is not proof of causation. Stable structure can arise from several mechanisms, confounding or selection.
It is not observer-free by stipulation. Measurement scale and representation can create or erase apparent structure.
It is not universal sameness. Variation is expected, but only within a declared identity-preserving class.
It is not value or desirability. A harmful, accidental or meaningless case can satisfy the structural test.
It is not a promise of prediction. Recognition can be retrospective or descriptive when dynamics remain uncertain.

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. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.

types. The carrier is two data types. The identity test is that construct left and right variants. 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 pattern matching recovers source type. 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. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.

graphs. The carrier is disjoint vertex sets. The identity test is that tag vertices and retain internal edges. 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 components remain separate. 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. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.

events. The carrier is records from multiple sources. The identity test is that attach source identifiers before pooling. 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 duplicate payloads remain distinguishable. 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. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.

category theory. The carrier is objects in a coproduct-admitting category. The identity test is that use canonical injections. 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 maps out are determined componentwise. 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. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.

probability. The carrier is alternative sample spaces. The identity test is that tag outcomes by experiment. 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 outcome identity includes experimental source. 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. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.

Across these substrates the workflow is conserved. Define the carrier and scale; state the relation; identify transformations that should preserve it; choose a diagnostic; test positive and negative cases; estimate sensitivity; and separate recognition from causal explanation or intervention. The workflow makes Disjoint union portable without flattening each domain's evidence obligations.

The strongest test is residual substitution. Replace the source-domain nouns with typed roles and ask whether a second field can fill every role without changing the operation. If only the word survives, transfer is metaphorical. If carrier, relation, invariant, perturbation and collapse test survive, the Prime has literal reach. This requirement protects the encyclopedia from promoting fashionable vocabulary merely because it appears in many fields.

Scale is constitutive. A relation can be stable at one grain and disappear at another. Aggregation may manufacture regularity; high resolution may fragment a robust macroscopic object into irrelevant detail. Claims should therefore bind scale and observation window to the identity while preserving a route for comparing scales. The abstraction is not whatever remains under every imaginable magnification.

Uncertainty is also structural. Sparse data, measurement error, preprocessing and model choice can generate false positives. Confirmation should include alternative representations and held-out observations where feasible. Mathematical examples replace sampling uncertainty with convention and proof obligations, but still require precise carrier and equivalence.

Finally, use does not define identity. A structure may enable compression, explanation, prediction, aesthetic effect or control. Those payoffs motivate attention, yet a case can qualify without delivering every payoff. Conversely, an intervention may work for reasons unrelated to the claimed structure. The Prime records what the thing is before cataloging what agents do with it.

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.

Names often mix target, representation and process. The target is the organization in the carrier. A diagram, equation, category or narrative is a representation. Detection, classification, design and control are processes. The three can be tightly coupled, but merging them creates collision with neighboring encyclopedia nodes.

Identity needs both intension and extension. The intensional test states an indexed family of source collections, a result carrier, one injective embedding per source, pairwise disjoint images and coverage of the result by those images. The extension supplies diverse positive cases and instructive failures. Neither one list of examples nor one elegant definition is enough when conventions and measurement enter the boundary.

A claim should also state whether it is exact, statistical, approximate or interpretive. Exact identities require proof. Statistical identities require uncertainty and a null comparison. Interpretive identities require traceable evidence and alternative readings. The structural frame supports all four without pretending their warrants are interchangeable.

Ambiguity is resolved by the nearest-confusable test. If a candidate can be fully explained by recognition, resemblance, control, representation or one domain-specific subtype, it should route there. Disjoint union remains only when provenance-preserving union, distinct from ordinary union that merges equal members, Cartesian product, concatenation dependent on order or arbitrary partitioning without source embeddings survives that subtraction.

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. This lowers cognitive and computational load without asserting that internal variation is absent. Chunk boundaries must be reopened when transfer or failure depends on hidden detail.

It localizes disagreement. Analysts can dispute carrier boundaries, scale, relation, tolerance, evidence or causal explanation separately rather than arguing over the label as a whole. This is especially valuable where one field uses an exact definition and another uses probabilistic recognition.

It guides search by privileging transformations and counterexamples. Instead of collecting only more positive instances, the analyst asks which changes preserve identity and which destroy it. That experiment reveals the core faster than surface enumeration and reduces confirmation bias.

The primary compression hazard is false invariance. Preprocessing, selection and aggregation can make unrelated cases look stable. A reference-grade account reports what was normalized, which alternatives were tried and where the abstraction stops paying rent. Complexity is managed by controlled omission, not by hiding residuals.

Abstract Reasoning¶

Type the carrier and explain why its elements are individuated at the selected scale.
Separate the target structure from the notation, image, model or story used to display it.
State the constitutive relation as an equation, rule, repeatability condition or traceable interpretive criterion.
List transformations expected to preserve identity and justify why they are incidental.
Choose at least one positive diagnostic and one collapse test.
Construct a nearest counterexample that preserves surface similarity while removing the invariant.
Test sensitivity to scale, observation window, noise, sampling and representation choice.
Distinguish exact, approximate, statistical and interpretive claims and apply the matching evidence standard.
Map every structural role into a second unrelated substrate to test literal transfer.
Subtract neighboring processes such as recognition, completion, design or control and identify the remaining residual.
Separate descriptive identity from causal origin and from practical exploitation.
Record uncertainty, conventions and known failure domains so downstream users can rematch the claim.

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.

A second error is process substitution. A detector, classifier or design recipe can be reused while its target changes. That is method transfer, not necessarily transfer of Disjoint union. Conversely, the same structure can be discovered by unrelated methods. The encyclopedia node concerns the conserved target relation.

Knowledge transfer improves when negative cases travel too. For every source example, construct a target case with similar components but without an indexed family of source collections, a result carrier, one injective embedding per source, pairwise disjoint images and coverage of the result by those images. If analysts cannot articulate the failure, the mapping is too loose. Counterexamples prevent the Prime from expanding into a synonym for organization.

Transfer should preserve uncertainty. An exact theorem cannot make an empirical target exact, and an interpretive source does not remove target measurement requirements. What transfers is the decision architecture; warrants remain native to their domains.

The practical payoff is a reusable audit sequence. Teams can compare apparently different phenomena by the same typed questions, discover when a domain-specific subtype is sufficient, and route residuals without duplicating nodes. The result is cross-domain leverage with explicit limits rather than an analogy catalog.

Examples¶

In sets, start with overlapping sets A and B. Specify the units and transformations under which sameness is being asserted. Demonstrate that tag elements by A or B; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is shared values appear as two distinct members. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.
In types, start with two data types. Specify the units and transformations under which sameness is being asserted. Demonstrate that construct left and right variants; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is pattern matching recovers source type. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.
In graphs, start with disjoint vertex sets. Specify the units and transformations under which sameness is being asserted. Demonstrate that tag vertices and retain internal edges; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is components remain separate. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.
In events, start with records from multiple sources. Specify the units and transformations under which sameness is being asserted. Demonstrate that attach source identifiers before pooling; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is duplicate payloads remain distinguishable. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.
In category theory, start with objects in a coproduct-admitting category. Specify the units and transformations under which sameness is being asserted. Demonstrate that use canonical injections; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is maps out are determined componentwise. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.
In probability, start with alternative sample spaces. Specify the units and transformations under which sameness is being asserted. Demonstrate that tag outcomes by experiment; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is outcome identity includes experimental source. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.

Structural Tensions¶

Invariant versus variation: identity requires stability while meaningful cases retain nontrivial differences.
Discovery versus projection: observers find structure but can also impose it through preprocessing and expectation.
Compression versus residual loss: useful simplification can conceal details that matter under transfer or stress.
Exactness versus tolerance: mathematical and empirical instances use different but explicit thresholds of sameness.
Local versus global: organization at one region or scale may not extend to the whole carrier.
Static versus dynamic: a snapshot may display structure while its persistence or generating process differs.
Description versus explanation: specifying the relation does not alone identify why it exists.
Recognition versus intervention: accurate classification does not guarantee controllability.
Universality versus convention: the role graph transfers while notation and evidence standards remain local.
Robustness versus sensitivity: the abstraction must ignore incidental variation without becoming blind to collapse.

Structural–Framed Character¶

Disjoint union sits at the structural end of the structural–framed spectrum: it combines collections while preserving each member's source through a tag, and that operation is identical across domains.

Terms such as injection, component, and tag state formal roles rather than a field's assumptions. The construction carries no value judgment, originates in set theory, requires no institution or human practice, and is applied by identifying the same source-preserving relation. Overlapping sets retain separate copies of equal elements, sum types distinguish alternatives, merged event streams retain source labels, and alternative probability spaces remain separate components of one combined carrier.

Substrate Independence¶

The substrate-independence score is high because sets, types, graphs, events, category theory, probability all support literal occupants for carrier, relation, invariant, variation and collapse. None supplies a privileged material substrate.

Independence does not mean content-free. The invariant remains an indexed family of source collections, a result carrier, one injective embedding per source, pairwise disjoint images and coverage of the result by those images. A proposed transfer that cannot instantiate that condition fails even if speakers commonly use the same word.

The abstraction spans exact and empirical carriers because its structure concerns relations and invariance, while warrant is typed locally. This is analogous to a mathematical form instantiated by noisy measurements: the target may be approximate without the concept becoming metaphorical.

The boundary is generic order. Not every organized thing is Disjoint union. Prime status depends on an autonomous test, diverse counterexamples and preserved roles. Where a narrower existing Prime fully captures the case, that node should be used instead.

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

Neighborhood in Abstraction Space¶

Disjoint union sits among the more crowded primes in the catalog (2^nd percentile for distinctiveness): several abstractions describe nearly the same structure, so a description that fits it will tend to fit its neighbors too — transporting it usually means disambiguating within this family rather than landing on it exactly.

Family — Algebraic Structure & Set Operations (10 primes)

Nearest neighbors

Sanity check — 0.97
System — 0.97
Input/output — 0.97
Inquiry — 0.97
Information — 0.97

Computed from structural-signature embeddings · 2026-09-10

Not to Be Confused With¶

Union: Ordinary union merges equal elements; disjoint union retains separate tagged occurrences.
Coproduct: Disjoint union realizes the categorical coproduct in sets; coproduct is the broader universal construction.
Sum type: A sum type is the typed-programming realization of tagged alternatives; disjoint union is the general set-level operation.
Cartesian product: Product forms tuples selecting from sources together; disjoint union selects one tagged member from one source.
Partition: A partition decomposes one existing carrier; disjoint union builds a carrier from separately given sources.

The prospective workspace queue contains one strict upward edge to prime:aggregation. No live DAG mutation is authorized.

Solution Archetypes¶

No catalogued solution archetypes reference this prime yet.

Notes¶

[n1] Saunders Mac Lane, Categories for the Working Mathematician, Springer. ↩

References¶

[1] Paul R. Halmos, Naive Set Theory, Springer. registry ↩

[2] Steve Awodey, Category Theory, Oxford University Press. registry ↩