1 Basic concept

1.1 Definition

A union is the combination of two or more sets, classes, or collections into a single collection containing every element that belongs to at least one of them. If an object is in any one of the source collections, it is included in the union. This makes union one of the foundational operations for describing membership and aggregation in mathematics.

1.2 Notation

The union of sets is usually written with the symbol ∪. For two sets A and B, the union is written as A ∪ B. When many sets are combined, the symbol may appear with an index or under a summation-like format, such as ⋃i Ai. The notation emphasizes that the result gathers all elements from the specified collections.

1.3 Informal interpretation

Informally, union answers the question “which elements are in at least one of these groups?” It is often described as an “either/or” combination rather than an exclusive choice. If a person belongs to one club, another club, or both, they are included in the union of those clubs. This intuitive meaning makes the idea easy to use in elementary reasoning and classification.

1.4 Examples

If A = {1, 2, 3} and B = {3, 4, 5}, then A ∪ B = {1, 2, 3, 4, 5}. The repeated element 3 appears only once in the result because sets do not count duplicates. In everyday terms, the union collects all distinct items present in either collection.

2 Set-theoretic union

2.1 Binary union

Binary union combines exactly two sets. An element belongs to A ∪ B precisely when it belongs to A or to B. This basic case underlies more elaborate forms of union and is the version most often introduced first in set theory.

2.2 Finite union

A finite union combines a limited number of sets, such as A1 ∪ A2 ∪ ... ∪ An. It can be built by repeated binary union, and the order of grouping does not change the final result. Finite unions are common in proofs, counting arguments, and elementary algebraic manipulations.

2.3 Arbitrary union

An arbitrary union combines any collection of sets, including infinite families. The result contains every element that appears in at least one member of the collection. This broader form is important because many mathematical structures are naturally described by large or unbounded families of sets.

2.3.1 Union over an indexed family

When sets are labeled by an index, the union may be written as ⋃i∈I Ai, where I is an index set. The element condition becomes: x is in the union if x belongs to at least one Ai for some i in I. This notation is especially useful for sequences, families, and parameterized constructions.

2.3.2 Union over a collection of sets

A collection of sets can be treated as a set whose elements are themselves sets. The union of the collection gathers all members of all those sets into one larger set. This viewpoint is common in abstract set theory, where one studies families of sets as mathematical objects in their own right.

2.4 Empty union

The union of an empty collection of sets is typically defined as the empty set. This convention preserves standard identities and keeps union consistent with its role as an aggregating operation. It also ensures that formulas involving arbitrary unions remain well behaved in limiting cases.

3 Properties of union

3.1 Commutativity

Union is commutative: A ∪ B = B ∪ A. The order of the sets does not affect which elements are included. This reflects the idea that a membership claim is enough, regardless of which set supplies it.

3.2 Associativity

Union is associative: (A ∪ B) ∪ C = A ∪ (B ∪ C). Grouping does not matter when multiple sets are combined. As a result, unions of many sets can be written without excessive parentheses.

3.3 Idempotence

Union is idempotent: A ∪ A = A. Combining a set with itself adds nothing new, since every element already appears in the original set. This property distinguishes set union from operations where repeated input changes the result.

3.4 Absorption

Union interacts with intersection through absorption laws such as A ∪ (A ∩ B) = A. Elements already in A are not expanded by adding only those that are also in B. These identities are useful for simplifying expressions in set algebra and logic.

3.5 Identity element

The empty set acts as an identity element for union: A ∪ ∅ = A. Adding no elements leaves a set unchanged. This role parallels the use of zero-like neutral elements in other algebraic systems.

3.6 Distributive laws

Union distributes over intersection in one direction and is distributed over by intersection in the other, depending on the expression. For example, A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C). Such laws support algebraic simplification and help connect set operations to logical formulas.

4 Union in logic and Boolean algebra

4.1 Union as logical disjunction

In logical settings, union corresponds closely to disjunction, or “or.” A statement represented by a union is true when at least one of the constituent conditions is true. This connection makes union a natural operator in Boolean reasoning and symbolic logic.

4.2 Relation to conjunction

Union is paired with conjunction, which corresponds to intersection. While conjunction requires both conditions to hold, union requires only one. Together these operations form a basic framework for combining propositions and describing shared or alternative conditions.

4.3 Complement and De Morgan-style laws

Union interacts with complement through De Morgan-style identities. The complement of a union equals the intersection of the complements, provided the universe of discourse is fixed. These laws are central to simplifying logical expressions and translating between positive and negative conditions.

4.4 Union in propositional interpretations

When propositions are interpreted as sets of possible cases, union represents the cases where at least one proposition holds. This set-based view provides a semantic model for logical formulas. It is often used to clarify the meaning of connectives in formal systems.

5 Union with other set operations

5.1 Intersection

Intersection and union are complementary operations. Their combination can describe shared and total membership at once. In many arguments, intersection isolates common elements while union broadens the scope to include all elements from several sources.

5.2 Difference

Set difference removes elements of one set from another, whereas union adds elements from multiple sets. These operations often appear together when a set is decomposed into overlapping and non-overlapping parts. They provide a flexible toolkit for refining collections.

5.3 Symmetric difference

Symmetric difference includes elements that belong to exactly one of two sets. It differs from union, which includes all elements that belong to either set, including those shared by both. Comparing the two helps distinguish inclusive combination from exclusive selection.

5.4 Subset and superset relations

If A is a subset of B, then A ∪ B = B. In that case, the smaller set contributes nothing beyond what is already present in the larger one. Union therefore offers a convenient way to express containment relationships.

5.5 Set complement

Set complement describes everything outside a set relative to a chosen universe. Union with complements can generate the entire universe, as in A ∪ A^c = U. Such identities are standard in classical set theory and Boolean algebra.

6.1 Union of relations

Relations can be united in the same way as sets, since a relation is itself a set of ordered pairs. The union of two relations contains every pair appearing in either relation. This operation is useful when combining rules, connections, or mappings.

6.2 Union of families of sets

For a family of sets, union collects all elements appearing anywhere in the family. This is different from taking the family itself as an object, because the union flattens the structure. The concept is common in measure theory, topology, and abstract algebra.

6.3 Union in topology

In topology, unions of open sets are open, and arbitrary unions play a central role in defining topological spaces. The ability to combine many open sets while preserving openness is one of the defining features of the subject. Union therefore helps describe neighborhoods, coverings, and continuity.

6.4 Union in formal language theory

In formal language theory, union combines languages by including every string that belongs to at least one of them. This mirrors set union, since languages are modeled as sets of strings. It is widely used in grammar descriptions, automata theory, and regular-expression notation.

7 Variants and special cases

7.1 Disjoint union

A disjoint union combines collections while keeping their elements separated by origin, even if some elements are similar or identical in form. It is often used when the source of each element matters. This variant is important in category theory, topology, and combinatorics.

7.2 Generalized union

Generalized union extends the idea of union to broader contexts, such as collections of structured objects or algebraic systems. The exact meaning depends on the framework, but the core idea remains the gathering of elements or components from multiple sources. It allows union-like reasoning outside ordinary set theory.

7.3 Union of multisets

For multisets, combining collections may preserve multiplicities rather than collapsing duplicates. In such settings, the result can reflect how many times an element appears across inputs. This differs from ordinary set union, where repeated membership is not counted.

7.4 Union in lattices

In lattice theory, union is often mirrored by a join operation. The join represents the least upper bound of elements in an ordered structure. This abstract version captures the same spirit of combining information into a larger whole.

8 Applications

8.1 Mathematical proofs

Union is frequently used in proofs to express that an object belongs to one of several cases. It also supports induction, decomposition, and case analysis. Because of its simple membership rule, it serves as a flexible tool in many branches of mathematics.

8.2 Database queries

In database systems, union combines the results of queries or the rows from compatible tables. It is used to merge records while removing duplicates in standard set-oriented settings. This makes it valuable for reporting, data integration, and query construction.

8.3 Computer science and programming

Union appears in algorithms, type systems, and data manipulation. Programs may use union to merge collections, represent alternatives, or describe values that can come from multiple categories. The operation is especially useful in symbolic computation and formal verification.

8.4 Classification and grouping

Union helps organize items that fit multiple categories by forming a combined category. It can represent broad classes, overlapping groups, or aggregated labels. In practice, this makes it useful for taxonomy, indexing, and descriptive analysis.