1 Definition and notation

An arbitrary union is the union of a collection of sets whose members are indexed by a set, often called an index set. Instead of combining only two sets at a time, the construction allows a finite, countable, or even uncountable family of sets to be merged into one set. The resulting set contains exactly those elements that belong to at least one set in the family.

This notion extends the familiar binary union and is fundamental in set theory and discrete mathematics. It is especially useful when describing families of sets, coverings, and constructions that naturally involve many sets at once.

1.1 Indexed families of sets

An indexed family of sets is a collection written as {A_i} or {A_i : i ∈ I}, where I is the index set and each A_i is a set. The index does not need to be a number; it may be any set used to label the members of the family.

Indexed families provide a precise way to speak about collections whose size may vary. They also help distinguish between the sets themselves and the labels used to organize them.

1.2 Union over a collection of sets

The union of an indexed family {A_i : i ∈ I} is the set of all elements that appear in at least one of the sets A_i. This is written as the union over the index set I. The idea is the same as the union of two sets, but applied to any number of sets in the family.

1.2.1 Set-builder notation

In set-builder form, the arbitrary union of a family {A_i : i ∈ I} can be expressed as the set of all x such that x belongs to A_i for some i in I. This notation emphasizes the membership condition rather than the indexing scheme.

1.2.2 Indexed notation

A common notation for arbitrary union is

⋃_{i ∈ I} A_i.

This compact form is widely used in mathematics because it clearly indicates both the family and the index set. When the index set is understood from context, the subscript may be omitted in informal writing.

1.3 Membership criterion

An element x belongs to the union ⋃_{i ∈ I} A_i if and only if x ∈ A_i for at least one i ∈ I. This criterion is the defining property of arbitrary union and is often used directly in proofs.

Equivalently, x is in the union precisely when there exists an index i in I such that x is a member of A_i. This existential form is especially convenient in logic and set-theoretic arguments.

2 Basic properties

Arbitrary unions preserve many of the structural features of ordinary set union. They behave predictably with respect to inclusion, redundancy, and repeated sets in the family. Many standard rules for finite unions extend naturally to indexed unions.

2.1 Commutative and associative behavior

For finite collections, union is commutative and associative, meaning the order of the sets does not affect the result. In an arbitrary union, the order of indexing is likewise irrelevant, since the union depends only on which sets are included in the family, not on the sequence in which they are listed.

When a family is reindexed by a bijection, the union remains unchanged. This reflects the fact that arbitrary union is determined by the collection of sets rather than by the labels attached to them.

2.2 Idempotence and redundancy

If a set appears more than once in an indexed family, repeated occurrences do not alter the union. Likewise, adding a set that is already contained in the union of the others does not change the result.

This redundancy property makes arbitrary unions insensitive to duplicates. It is one reason unions are useful in set systems, where different descriptions may lead to the same combined set.

2.3 Relations to subset inclusion

The union of a family is always at least as large as each member of the family in the sense of inclusion. If A_i is one of the sets in the collection, then A_i is a subset of the union ⋃_{i ∈ I} A_i.

2.3.1 Monotonicity

If A_i ⊆ B_i for every index i in I, then

⋃_{i ∈ I} A_i ⊆ ⋃_{i ∈ I} B_i.

This monotonicity property says that enlarging each set in a family can only enlarge, or at worst preserve, the union. It is a standard tool for comparing set constructions.

2.3.2 Containment in the ambient universe

When all sets A_i are subsets of a fixed universe U, their union is also a subset of U. Thus arbitrary unions remain within the same ambient space as long as each component set does.

This fact is frequently used in discrete mathematics, where all sets under discussion are often understood to lie inside a common universal set.

3 Examples

Examples clarify how arbitrary unions behave in finite and infinite settings. They also show the difference between a nonempty family and the special case of an empty index set.

3.1 Finite arbitrary unions

If I = {1, 2, 3} and A_1 = {1, 2}, A_2 = {2, 4}, and A_3 = {3, 4}, then

⋃_{i ∈ I} A_i = {1, 2, 3, 4}.

This is simply the union of three sets. Finite arbitrary unions agree with the usual finite union operation.

3.2 Infinite arbitrary unions

Consider the family A_n = {1, 2, ..., n} for n ∈ ℕ. Then

⋃_{n ∈ ℕ} A_n = {1, 2, 3, ...}.

Here the union combines infinitely many finite sets into a single infinite set. Such examples are common in discrete mathematics and show how arbitrary unions can build larger structures from smaller ones.

3.3 Empty family and degenerate cases

If the index set is empty, then there are no sets to combine. By convention, the union of the empty family is the empty set.

This convention is compatible with standard set-theoretic identities and makes formulas involving arbitrary unions behave uniformly, even when a family has no members.

4 Connections to other set operations

Arbitrary unions are paired naturally with arbitrary intersections and satisfy several important identities. These relationships generalize familiar laws from elementary set operations.

4.1 Arbitrary intersections

An arbitrary intersection is defined similarly to arbitrary union, but an element must belong to every set in the family rather than at least one. For a family {A_i : i ∈ I}, the intersection is written as

⋂_{i ∈ I} A_i.

While unions gather elements from any member set, intersections retain only the elements shared by all members.

4.2 De Morgan-style laws

Arbitrary unions and intersections are linked by generalized De Morgan laws. If U is a universal set and A_i ⊆ U for all i ∈ I, then the complement of the union satisfies

U \ (⋃_{i ∈ I} A_i) = ⋂_{i ∈ I} (U \ A_i).

This identity expresses the idea that an element fails to lie in the union exactly when it fails to lie in each set of the family.

4.3 Distributive laws

Unions distribute over intersections in generalized form, and intersections distribute over unions. For instance, for a set B and family {A_i : i ∈ I},

B ∩ (⋃_{i ∈ I} A_i) = ⋃_{i ∈ I} (B ∩ A_i).

Such formulas are useful in simplifying set expressions and in proving identities involving families of sets.

5 Applications in discrete mathematics

Arbitrary unions appear throughout discrete mathematics whenever a problem involves collections of objects indexed by a set. They provide a compact way to describe aggregations, partitions, and coverings.

5.1 Set systems and combinatorics

In combinatorics, families of subsets are often studied as set systems. Arbitrary unions help describe the total collection of elements represented by a system, as well as the interaction among its members.

They are also used in counting arguments, where the union of many sets may represent all objects satisfying at least one of several conditions.

5.2 Coverings and unions of collections

A family {A_i : i ∈ I} is said to cover a set X if X is contained in the union of the family. This makes arbitrary union central to the language of coverings.

Coverings are important in many discrete settings, including graph theory, counting problems, and algorithm design, where a collection of sets may represent available choices, resources, or states.

5.3 Logic and proof methods

The membership criterion for arbitrary union corresponds closely to existential quantification in logic. A proof that an element lies in a union typically shows that there exists an index i for which the element belongs to A_i.

This connection makes arbitrary unions useful in formal proofs, especially when translating set statements into logical statements. It also supports induction and contradiction arguments involving families of sets.

Several related constructions refine or extend the idea of arbitrary union. These variants often appear in specialized branches of mathematics but rely on the same basic principle of combining many sets or structures.

6.1 Union of pairwise disjoint sets

If the sets in a family are pairwise disjoint, then each element of the union belongs to exactly one member of the family. In that case, the union is especially easy to interpret, since the combined set is formed without overlap.

Disjoint unions are often used when one wants to preserve information about which component a given element came from.

6.2 Unions in topology and algebra

In topology, unions of open sets are open, and arbitrary unions play a central role in defining topological spaces. In algebra, unions may appear in constructions involving substructures, although closure under union depends on the context.

These uses show that the concept extends beyond elementary set theory and serves as a basic organizing principle in several areas of mathematics.

6.3 Union of indexed relations or structures

The idea of taking a union of indexed objects is not limited to sets alone. One may also form unions of relations, graphs, or other structures when the underlying objects are sets of ordered pairs or similar collections.

In such cases, the union is taken elementwise: an ordered pair or object belongs to the combined structure if it appears in at least one member of the family.