Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-27
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) iXi\bigsqcup_i X_i with the final topology of the canonical injections: a set is open exactly when each of its traces is

Definition

The underlying set. Let II be a set and let XiX_i be a set for each iIi \in I. The disjoint union is

iIXi  :=  iI(Xi×{i}),\bigsqcup_{i \in I} X_i \;:=\; \bigcup_{i \in I} \big(X_i \times \{i\}\big) ,

whose elements are the pairs (x,i)(x, i) with iIi \in I and xXix \in X_i. For jIj \in I the jj-th canonical injection is

κj:XjiIXi,κj(x):=(x,j).\kappa_j : X_j \to \bigsqcup_{i \in I} X_i, \qquad \kappa_j(x) := (x, j).

The construction is what makes the word "disjoint" honest. Each κj\kappa_j is injective (Injection, surjection, bijection), since (x,j)=(x,j)(x,j) = (x',j) forces x=xx = x'; the images κj[Xj]=Xj×{j}\kappa_j[X_j] = X_j \times \{j\} are pairwise disjoint, since the second coordinate determines jj; and their union is the whole set. So no assumption that the XiX_i are disjoint as sets is needed, and none is made: the tag ii separates the copies even when Xi=XiX_i = X_{i'} for iii \ne i'.

The trace of a subset. For UiXiU \subseteq \bigsqcup_i X_i and jIj \in I write

Uj  :=  κj1[U]  =  {xXj:(x,j)U}Xj,U_j \;:=\; \kappa_j^{-1}[U] \;=\; \{\, x \in X_j : (x,j) \in U \,\} \subseteq X_j ,

the trace of UU on the jj-th summand. A subset is determined by its family of traces, since U=iκi[Ui]U = \bigcup_i \kappa_i[U_i].

The topology. Now let each XiX_i carry a topology Ti\mathcal{T}_i (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 iXi\bigsqcup_i X_i is the final topology of the family (κi)iI(\kappa_i)_{i \in I} (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

T  :=  {UiXi  :  UiTi for every iI}:\mathcal{T}^{\sqcup} \;:=\; \Big\{\, U \subseteq \bigsqcup_i X_i \;:\; U_i \in \mathcal{T}_i \text{ for every } i \in I \,\Big\} :

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. FiXiF \subseteq \bigsqcup_i X_i is closed exactly when every trace FiF_i is closed in XiX_i. Indeed the trace operation commutes with complementation, κi1[jXjF]=XiFi\kappa_i^{-1}[\,\bigsqcup_j X_j \setminus F\,] = X_i \setminus F_i, so FF is closed if and only if the complement is open if and only if every XiFiX_i \setminus F_i is open.

Each summand sits inside as a clopen subspace. The set κj[Xj]=Xj×{j}\kappa_j[X_j] = X_j \times \{j\} has traces XjX_j at jj and \varnothing 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 κj\kappa_j from Tj\mathcal{T}_j, and κj\kappa_j 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 I=I = \varnothing the disjoint union is the empty set with its only topology. For II a one-element set the map κ\kappa is a bijection carrying T\mathcal{T} to T\mathcal{T}^{\sqcup}, so the construction returns the one summand up to homeomorphism and changes nothing.

Remarks

Depends on

Used by

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