How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The disjoint union (coproduct) with the final topology of the canonical injections: a set is open exactly when each of its traces is
Definition
The underlying set. Let be a set and let be a set for each . The disjoint union is
whose elements are the pairs with and . For the -th canonical injection is
The construction is what makes the word "disjoint" honest. Each is injective (Injection, surjection, bijection), since forces ; the images are pairwise disjoint, since the second coordinate determines ; and their union is the whole set. So no assumption that the are disjoint as sets is needed, and none is made: the tag separates the copies even when for .
The trace of a subset. For and write
the trace of on the -th summand. A subset is determined by its family of traces, since .
The topology. Now let each carry a topology (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). The disjoint union topology (also coproduct topology, or topological sum) on is the final topology of the family (The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology), that is
a set is open exactly when each of its traces is open. That this is a topology is discharged in The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology, where the final topology of any family is verified to satisfy (T1), (T2) and (T3); nothing further is needed here.
Closed sets, dually. is closed exactly when every trace is closed in . Indeed the trace operation commutes with complementation, , so is closed if and only if the complement is open if and only if every is open.
Each summand sits inside as a clopen subspace. The set has traces at and elsewhere, both open and both closed, so it is clopen in the union. Its subspace topology (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace) is carried across by from , and is an embedding (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological); both statements are proved in the next item rather than assumed here.
Degenerate cases. For the disjoint union is the empty set with its only topology. For a one-element set the map is a bijection carrying to , so the construction returns the one summand up to homeomorphism and changes nothing.
Remarks
-
Why the tag is part of the element. Writing as the plain union would collapse points that happen to be shared between two summands, and the two canonical injections would then fail to be injective. Building the tag into the element makes the injectivity, the disjointness and the description "a set is open when each trace is open" true by construction rather than by hypothesis.
-
This is the exact dual of the product. The product is an initial topology of maps out of it, the coproduct a final topology of maps into it; the product has the characteristic property for maps into it, the coproduct the characteristic property for maps out of it. Both are instances of The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology and the next item reads the corresponding half of Characteristic properties: a map into a space with the initial topology is continuous iff every composite with the defining family is, a map out of a space with the final topology is continuous iff every composite with the defining family is, and the two topologies are respectively the coarsest and the finest making that family continuous.
-
Nothing here is finite. The index set is arbitrary and no choice principle is involved: the injections are given by an explicit formula and the topology is described by a condition on all traces at once, with no selection anywhere.
Depends on
- The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace
- Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological
- Injection, surjection, bijection
Used by
- Two copies of ℝ glued along ℝ ∖ {0} give a non-Hausdorff quotient of a metrizable space, by an open quotient map Counterexample
- The adjunction space Y ∪_f X glued along a continuous map, and, for a nonempty space, the cone and the suspension as quotients of X × [0,1] Definition
- FALSE: a quotient of a Hausdorff space is Hausdorff False statement
- What the theory of these constructions still owes at this point in the reading order: preservation of quotient maps under products, separation beyond Hausdorff, and the invariants that tell the glued spaces apart Remark
- A map out of a disjoint union is continuous iff each of its restrictions is; the canonical injections are open and closed embeddings; and each summand is clopen in the union Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 31 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Disjoint union (topology) (Wikipedia) (standard reference, not scraped)
- Coproduct (Wikipedia) (standard reference, not scraped)
- J. Munkres, Topology, 2nd ed., §22 (standard reference, not scraped)