1 Basic concepts

A subset is one of the most fundamental relations in set theory. It expresses that the elements of one set are all contained within another set. This idea is used throughout mathematics to organize collections, compare objects, and define more complex structures.

1.1 Definition

A set A is a subset of a set B if every element of A is also an element of B. In symbols, A ⊆ B means that whenever x belongs to A, x also belongs to B. This definition allows one set to be viewed as contained within another without requiring the two sets to be identical.

1.2 Membership and containment

Subset relations are based on membership. If an object is in the smaller collection, it must also be in the larger one. Containment in this sense is not about physical inclusion, but about shared elements. Thus, one set may be fully contained in another even if it has fewer elements or no visible structural similarity.

1.3 Notation

Mathematicians use standard symbols to express subset relations clearly and compactly. These symbols help distinguish ordinary inclusion from stricter forms of inclusion.

1.3.1 Subset notation

The notation A ⊆ B indicates that A is a subset of B. Some texts also use A ⊂ B for subset relations, though this symbol is sometimes reserved for proper subsets. Because usage varies, definitions are often stated explicitly to avoid ambiguity.

1.3.2 Proper subset notation

A proper subset is a subset that is not equal to the set that contains it. It is commonly written as A ⊂ B or A ⊊ B, depending on convention. In a proper subset relation, every element of A is in B, but B has at least one element not in A.

1.4 Examples

If A = {1, 2} and B = {1, 2, 3}, then A ⊆ B. If C = {a, b} and D = {b, a}, then C and D are subsets of each other because they contain exactly the same elements. The empty set is also a subset of every set, since it has no elements that could violate the condition.

2 Types of subsets

Subsets can be classified according to whether they are equal to the larger set, strictly smaller than it, or empty. These distinctions are useful in proofs and in describing set structures precisely.

2.1 Proper subsets

A proper subset contains some, but not all, of the elements of the larger set. For example, {2, 4} is a proper subset of {1, 2, 3, 4}. Proper subset relations are important when comparing sizes and identifying smaller constituent parts of a set.

2.2 Improper subsets

An improper subset is a subset that is equal to the set itself. Every set is an improper subset of itself, because all of its elements are certainly contained within it. Some authors avoid this term and instead simply note that a set is a subset of itself.

2.3 Empty set as a subset

The empty set, written ∅ or {}, is a subset of every set. This follows directly from the definition: there is no element in the empty set that could fail to belong to the larger set. The empty set is therefore a universal example of a subset relation.

2.4 Universal subset relationships

If a universal set is specified within a given context, every set under discussion is considered a subset of it. This allows set relations to be studied within a fixed domain. In such settings, the universal set provides the broadest collection against which other sets are compared.

3 Properties

Subset relations have several basic logical properties. These properties make them resemble other mathematical order relations and support many standard proofs.

3.1 Reflexivity

Every set is a subset of itself. If A is any set, then A ⊆ A because each element of A is automatically an element of A. This property is called reflexivity.

3.2 Transitivity

Subset relations are transitive. If A ⊆ B and B ⊆ C, then A ⊆ C. In other words, if all elements of A lie in B and all elements of B lie in C, then all elements of A lie in C as well.

3.3 Antisymmetry

If A ⊆ B and B ⊆ A, then A and B have exactly the same elements. In standard set theory, this means A = B. This property is known as antisymmetry and distinguishes subset relations from merely overlapping relationships.

3.4 Subset relations with equality

Equality of sets can be characterized through mutual inclusion. Two sets are equal precisely when each is a subset of the other. This principle is widely used in proofs, especially when showing that two collections described differently are actually the same set.

4 Operations involving subsets

Subset relations interact naturally with basic set operations. These operations can preserve inclusion, alter it, or be used to construct new sets from existing ones.

4.1 Union and intersection

If A ⊆ B, then A ∪ C is contained in B ∪ C for any set C. Likewise, A ∩ C is contained in B ∩ C. These relationships show that subset inclusion behaves well under union and intersection.

4.2 Difference and complement

Set difference can remove elements from a subset or from the larger set. If A ⊆ B, then B \ A consists of elements in B that are not in A. The complement of a set depends on the chosen universal set, and if A ⊆ B, then the complement of B is contained in the complement of A within that same universal domain.

4.3 Cartesian products

If A ⊆ B, then A × C is a subset of B × C for any set C. Each ordered pair from A × C also appears in B × C because its first component belongs to B. A similar statement holds when the inclusion is on the second factor.

4.4 Subset closure under operations

Certain families of sets are closed under operations such as union, intersection, or complement. This means applying the operation to sets in the family produces another set in the same family. Subset relations are often used to describe and verify such closure properties.

Several important set-theoretic ideas are closely connected to subsets. These concepts extend or organize the notion of inclusion in different ways.

5.1 Superset

A superset is a set that contains another set as a subset. If A ⊆ B, then B is a superset of A. The terms subset and superset describe the same relationship from opposite directions.

5.2 Power set

The power set of a set is the set of all its subsets. If a set has n elements, its power set has 2^n elements. Power sets are central in combinatorics, logic, and the foundations of mathematics.

5.3 Set inclusion

Set inclusion is the broader relation that describes one set lying within another. Subset notation is the standard way of expressing inclusion. In many contexts, inclusion is treated as a partial order on sets.

5.4 Partitions of a set

A partition divides a set into nonempty subsets that do not overlap and together cover the whole set. Each part of a partition is a subset of the original set. Partitions are used to organize sets into disjoint components and are important in many areas of mathematics.

6 Use in logic and mathematics

Subset concepts appear in logic, proof theory, algebra, topology, and many other fields. They provide a common language for describing conditions, structures, and relationships among mathematical objects.

6.1 Predicate logic interpretation

In predicate logic, a subset relation can be expressed using implication. Saying A ⊆ B is equivalent to saying that for every x, if x is in A then x is in B. This logical form makes subset statements easy to incorporate into formal reasoning.

6.2 Set-theoretic proofs

Subset arguments are often used to prove equality of sets. A common method is to show A ⊆ B and B ⊆ A separately. This approach is especially useful when dealing with unions, intersections, and algebraic identities involving sets.

6.3 Relations and functions

Relations and functions are frequently defined using sets of ordered pairs, and subset language helps describe their domains, codomains, and graphs. Many properties of relations, such as reflexivity or transitivity, are stated in terms of subsets of Cartesian products. Functions too can be compared by checking whether one graph is contained in another.

6.4 Applications in mathematics

Subset reasoning appears throughout mathematics. In algebra, it helps describe subgroups, subspaces, and subrings. In topology, open and closed sets are organized by inclusion. In probability and analysis, subsets are used to define events, measurable sets, and intervals, making the concept essential across the discipline.