Addition principle 2026-10-14
The rule of sum counts alternatives in disjoint finite sets by adding their sizes. For a disjoint union , each element belongs to exactly one alternative, so . Overlapping alternatives require accounting for repeated elements, as in the inclusion-exclusion principle. The groups indexed by first-return position in the Catalan recurrence are disjoint alternatives.
Axiomatic specification 2026-10-31
Describe operations through laws relating their observable results, without selecting an internal representation. For an abstract data type, the laws must state the operation domains and error results as well as ordinary cases. A disjoint union can distinguish a successful value from an error with the same textual spelling.
Restriction of differential forms to the finitely many open and closed components gives an isomorphism of cochain complexes . Piecewise forms glue because there are no overlaps, and the exterior derivative acts componentwise. Taking the quotient of closed differential forms by exact differential forms proves the displayed de Rham cohomology isomorphism. For an infinite disjoint union, forms and cohomology give products instead.
Disjoint observation windows Created 2026-10-14 Updated 2026-11-05
Observation windows are measurable sets used to count points of a point process. They are pairwise disjoint when for every . Half-open intervals such as and meet at a boundary without sharing any point, whereas the closed intervals and both contain one. A disjoint union makes window counts additive; it does not make their random variables independent.
Monotonicity of a measure 2026-10-31
For measurable sets , the disjoint union and finite additivity give . This uses nonnegativity and is valid with infinite values; it does not subtract infinities. Monotonicity of a measure implies that increasing measurable sets have nondecreasing measures, but the equality of their limit with the measure of their union uses the stronger axiom of countable additivity.
For a connected intersection of a closed filter base, the filter-base property implies the finite intersection property. Compactness, in its closed-set formulation, therefore gives . It is closed in , hence compact.
Suppose additionally that each base member is connected but is disconnected. Write with disjoint nonempty closed subsets of . They are compact, hence closed in the Hausdorff space . Normality of a compact Hausdorff space gives disjoint open sets containing , respectively. The compact set misses . For every some misses , so the open sets cover . A finite subcover gives . Choose inside this finite intersection. If is empty, choose any base member instead.
Since contains , it meets both and ; but it lies in their disjoint union. These two relatively open nonempty pieces disconnect , a contradiction. Thus the intersection is nonempty and connected. Compactness is used to pass from an infinite exclusion condition to a single base member.
König's theorem for cardinal numbers states that, for a set-indexed family with at every index,
Here the sum is the cardinality of a disjoint union and the product is the cardinality of a Cartesian product. Work in ZFC. Choose disjoint sets of sizes and sets of sizes . For any function , its th coordinate values on form a subset of of cardinality at most . Choose outside that subset, using choice. Then cannot equal for any : if , its th coordinate was specifically excluded. Thus there is no surjection from the disjoint union onto the product.
Cardinal comparability under choice now implies the displayed strict inequality. Empty index set gives directly; empty individual cause no difficulty, since the corresponding coordinate excludes an empty image. This is the cardinal diagonal theorem, rather than the finitely branching tree result also bearing König's name.
Hartogs theorem says that for every set there is a least ordinal for which no injection exists. This does not require the axiom of choice. Form the set of well-orderings of subsets of . It can be defined by the axiom schema of specification inside
recording a subset and its well-order. Each member of has a unique ordinal order type. Axiom schema of replacement is used to collect those order types into a set
Every member of an ordinal in is the order type of an initial segment of the corresponding well-ordering, so also belongs to . Thus is a transitive set of ordinals and is itself an ordinal. An ordinal belongs to exactly when it injects into : use a bijection to a well-ordered subset in one direction, and transport the ordinal order along the injection in the other. If injected into , this characterization would give , impossible for an ordinal. All smaller ordinals lie in and do inject into . Therefore . Apart from the standard order-type theorem, the explicit collection of all order types is the Axiom schema of replacement step; no axiom of choice of a representative ordering for each type is needed.
Zorn's lemma states that a nonempty partially ordered set in which every chain has an upper bound has a maximal element. Use the Hartogs bound on partial ordinal injections to obtain a set-sized partially ordered set. Consider the partial injections into whose domains are ordinals. Hartogs theorem bounds every such domain strictly below . Their graphs of a function therefore form a set
obtained by the axiom schema of specification from . Order by extension. It is nonempty because it contains the empty function. A chain has as an upper bound the union of its graphs of a function: extension makes this a function, injectivity is preserved, and its domain is an union of ordinals and hence an ordinal. Its range is contained in , so Hartogs theorem forces its domain to be strictly below ; thus it belongs to . The empty chain also has the empty function as an upper bound.
By Zorn's lemma choose a maximal . If an element lay outside its range, appending would give a larger injection on . Such an injection itself guarantees by Hartogs theorem, so it is a legitimate member of , contradicting maximality in a partially ordered set. Therefore is surjective, and
For this single extension one only selects an element of one specified nonempty set; no additional simultaneous choices are hidden in the argument. Zorn's lemma is the form of the axiom of choice used to obtain maximality in a partially ordered set.
Finally work with cardinals, represented by initial ordinals, and put . It is infinite by hypothesis. Nonzeroness of each factor gives an injection of the larger cardinal into the Cartesian product by holding a coordinate of the other fixed. The supplied infinite-ordinal square result gives . Hence
For the sum, use disjoint union:
The last injection exists because is infinite and contains two distinct elements. Cantor-Schröder-Bernstein theorem turns both pairs of bounds into equalities, proving
These final operations are cardinal sum and multiplication, measuring disjoint unions and Cartesian products. They are not the noncommutative ordinal arithmetic considered in question 5.
Let be the infinite initial ordinal of the given ordinal. A successor adds only one point, so : one can absorb the additional point by shifting the initial copy of and fixing the rest.
The successor construction from part (a) partitions the new range into the old range, a new row of size , and a new column of size . By hypothesis each part has cardinality at most , and the old range already has cardinality .
A finite disjoint union of copies of a well-orderable infinite cardinal has that same cardinality without invoking the square theorem being proved. Explicitly, write each uniquely as with . Interleave three copies by
This stays below because an infinite initial ordinal is a limit ordinal and is closed under finite successor steps below it. It is injective by uniqueness of the quotient and finite remainder. The reverse injection is immediate, so the Cantor-Schröder-Bernstein theorem proves the finite-union claim.
Applying that bound to the three range pieces yields
Only the well-orderability of ordinals, not a choice principle for arbitrary families of sets, was used.
A finite CW complex can be defined without assuming separation properties in advance. Start with a finite discrete set . Inductively form from by identifying each boundary point with its image under a continuous attaching map . Only finitely many disks are attached in total, and for some finite . The interiors of the disks are its cells. Its weak topology of a CW complex is the final topology of the characteristic maps: a subset is closed exactly when its inverse image in every characteristic disk is closed. In this finite construction it is the topology obtained by the successive quotients. Closure-finiteness is automatic because there are only finitely many cells.
Here is a direct proof of both requested topological properties, without presupposing that arbitrary attaching maps give a triangulable space. Suppose the compact previous stage embeds by , and attach one -cell, . Extend the boundary coordinate map radially by
It is continuous at zero because the image of the sphere is bounded. Map the two pieces into by
At these agree with the attaching identification. They therefore induce a continuous map on the quotient. Its restriction to the old stage is injective. An interior point has positive last coordinate , and the preceding coordinate block recovers by division by . Hence it cannot coincide with an old point or another interior point. The induced map is injective.
The quotient is compact, being the image of a compact disjoint union. A continuous injection into Euclidean space is Hausdorff, by inverse images of disjoint separating neighborhoods; it is also a homeomorphism onto its image because closed subsets of the compact source have compact, hence closed, images in the Hausdorff target. Finite discrete embeds in , and induction over the finite list of cells proves is Hausdorff and its weak topology is exactly an induced Euclidean subspace topology. This is Euclidean embedding by finite cell attachment; no optimal ambient dimension is needed.
For Real projective space, filter by . The complement of in is an affine -cell. A characteristic disk is a hemisphere of , whose boundary is attached by the antipodal quotient . Thus there is one cell in every dimension .
The incidence number is the sum of the two sheet contributions. Fixing the orientation of one sheet gives degree one; the other differs by the antipodal map on , whose degree is . Consequently the cellular homology of real projective space has
Taking kernels modulo images gives, for ,
Over , multiplication by two is invertible, so
Over , every differential vanishes, giving for , and zero otherwise. For the space is a point and only degree-zero homology is present, with the chosen coefficient group.
For the Category of sets, take the monoidal tensor product to be the Cartesian product, , with unit a singleton . On morphisms use . Define the associator by and the unitors by and . These are natural isomorphisms, with inverses obtained by rebracketing or adjoining . Both paths in the pentagon send to , and both paths in the triangle send to . This proves the axioms elementwise.
There is a second structure: use disjoint union and unit . Define the associator by preserving each element and its summand while changing the nested tags, and define the unitors by removing the empty summand. These are natural and invertible. In the pentagon, either path takes an element in any of the four summands to that same element in the same summand of ; the triangle removes an empty intermediate summand on either path. Thus both axioms hold.
These product and coproduct monoidal structures on sets have different units, and , which are not isomorphic. They are even inequivalent as monoidal categories: an equivalence of the underlying Category of sets preserves terminal objects, so it cannot take the singleton unit of the product structure to the empty unit of the coproduct structure. Hence the monoidal structure on sets is not unique.
Working with a small category (or in a fixed ambient universe), for a categorical presheaf and fixed , apply the categorical coend construction to . It is the quotient of the disjoint union of pairs by the relations
Define . It respects every relation because . Define . Then . Conversely the relation with gives , so is the identity morphism. Therefore
For , restriction on the categorical coend sends to , and . A natural transformation likewise acts on the second coordinate and commutes with . Thus the density formula for presheaves is a natural isomorphism, not just a family of unrelated bijections.
The two components of a disjoint union are open and closed. Restriction therefore gives an isomorphism
Its inverse assigns the first form on and the second on ; it is smooth because there are no overlaps on which compatibility must be imposed. The exterior derivative is local, so this is an isomorphism of cochain complexes.
A form on is a closed differential form exactly when both restrictions are closed. It is an exact differential form exactly when both restrictions are exact: primitives on and join into a global primitive. Taking the quotient therefore yields the de Rham cohomology of a finite disjoint union:
The same argument covers degree zero, with the space of degree-minus-one forms taken to be zero.
The given homeomorphisms and homotopy invariance of homology give
because , while is path connected and is the disjoint union of two copies of . Hence
The degree-one and degree-zero part of the Mayer–Vietoris sequence is therefore
Taking the rank of an abelian group throughout this short exact sequence gives
so . Since the zeroth homology group is freely generated by the path components,
The inductive definition of ordinal addition is
for a limit ordinal .
The synthetic definition takes the order type of the disjoint union of a copy of followed by a copy of : every point of the first copy precedes every point of the second, and each copy retains its original total order.
Fix and use transfinite induction on . The synthetic sum with the empty order is . Appending a greatest element produces the successor ordinal rule. At a limit ordinal , the second copy is the union of its initial segments of types , so the whole order has type
. Thus the synthetic operation satisfies the inductive recursion; uniqueness in transfinite recursion proves the definitions equivalent.
Part (b) proves one implication. Conversely, assume in ZF that
for every infinite cardinal . Let be any set and let be its Hartogs ordinal. Finite is already well-orderable, so suppose is infinite and form the disjoint union
By hypothesis, is bijective with . Since injects into , we obtain
Apply part (c), with and . It gives either an injection or a surjection . The first alternative contradicts Hartogs theorem. In the second, every fiber is a nonempty set of ordinals and therefore has a least member. The map
is an injection of into the ordinal and pulls its well-order back to . Thus every set is well-orderable, so the well-ordering theorem gives the axiom of choice. This proves the Tarski cardinal-square theorem.
False, with “disjoint union” understood as a topological disjoint union. Take the rational numbers with the usual subspace topology from the real line.
Every connected subset of has at most one point. Indeed, if it contained , choose an irrational number . The two relatively open sets
partition and separate any subset containing both and . Hence the connected components of are singletons.
If a topological disjoint union of nonempty connected spaces were homeomorphic to , the image of each summand would be connected, hence a singleton. Every summand would therefore be a one-point topological space. Their topological disjoint union is a discrete space, since each summand is open. But is not a discrete space: for each , the distinct rational numbers approach , so is not an isolated point. This is a contradiction. The set decomposition into connected components always exists; giving those pieces the topological disjoint union topology need not recover the original topology.
An abstract simplicial complex consists of a set of vertices of a simplicial complex and a family of finite nonempty subsets of , called abstract simplexes, such that every singleton belongs to and every nonempty subset of a member of also belongs to . One may include the empty set as an additional face by convention. A member with vertices is a -simplex; its nonempty subsets are its faces of a simplex.
The geometric realization has the following explicit description using a barycentric coordinate system:
Here the support is . Each gives a standard geometric simplex
with its usual Euclidean topology. Common faces of a simplex are identified using the same barycentric coordinate system.
Precisely, the topology on is defined by declaring closed if and only if is closed in for every . Equivalently, use the quotient topology on the disjoint union of all the standard geometric simplexes, identifying identical points of common faces of a simplex. For a finite simplicial complex, this agrees with the subspace topology in . For an infinite simplicial complex, the stated rule specifies the realization topology without presuming a finite-dimensional ambient space.
Use tagged disjoint unions for results that can contain either a value or an error message. This avoids ambiguity even if the item set itself contains the string Empty queue. The operation signatures are
Here is a singleton, expressing that create takes no meaningful argument. Write successful results as and , and errors as and for . Returning an error is not returning a queue, so its result must not be silently passed to another queue operation.