In mathematics, a set is a well-defined collection of distinct objects, considered as an object in its own right. Sets are fundamental in various areas of mathematics, and understanding their notation and operations is essential for many topics in discrete structures, logic, and beyond.
The basic idea of a set is to represent a collection of elements (or members). The notation used for sets typically involves curly brackets {}.
Set Builder Notation: Describes a set by stating the properties that its members must satisfy. For example, the set of all even numbers can be written as:
This reads as "the set of all such that is an even number."
Roster or Tabular Notation: In this notation, the set is explicitly listed by its elements. For example:
This means that is the set containing the numbers 1, 2, 3, and 4.
Set Membership: To denote that an element is a member of a set , we use the symbol . If is an element of , we write:
If is not an element of , we write:
Empty Set: The set with no elements is called the empty set, and is denoted by:
Universal Set: The set that contains all possible elements within a particular context or discussion is called the universal set, often denoted by .
Finite Set: A set with a specific number of elements. For example, .
Infinite Set: A set with an infinite number of elements. For example, represents the set of all positive integers.
Subset: A set is a subset of a set if every element of is also an element of . This is denoted as:
If is a subset of , but is not equal to , we write:
Proper Subset: A set is a proper subset of a set if every element of is in , and contains at least one element that is not in . This is denoted as:
Power Set: The power set of a set is the set of all subsets of . It is denoted as:
For example, if , then the power set is:
Universal Set: The universal set is the set that contains all possible elements for a given context. If is a subset of the universal set , then every element in is also in .
The union of two sets and is the set that contains all elements that are in , in , or in both. This is denoted by:
For example, if and , then:
The intersection of two sets and is the set of elements that are common to both and . This is denoted by:
For example, if and , then:
The difference of two sets and (also called the set difference) is the set of elements that are in but not in . This is denoted by:
For example, if and , then:
Similarly, the difference would be .
The complement of a set refers to the elements that are in the universal set but not in . This is denoted by:
For example, if the universal set and , then:
The symmetric difference of two sets and is the set of elements that are in either or , but not in both. It is denoted by:
For example, if and , then:
Venn diagrams are often used to visualize set operations. In a Venn diagram, each set is represented by a circle, and the relationships between the sets (such as union, intersection, and difference) are shown by the overlap or separation of the circles.
| Operation | Symbol | Description | Example |
|---|---|---|---|
| Union | All elements in or (or both) | ||
| Intersection | All elements in both and | ||
| Difference | Elements in , but not in | ||
| Complement | Elements in the universal set but not in | ||
| Symmetric Difference | Elements in or , but not both |
Understanding set notation and set operations is fundamental for working with sets in mathematics. These operations provide powerful tools for manipulating and reasoning about collections of objects. Whether you're performing algebraic manipulations or applying these operations in logic or computer science, they are critical building blocks in discrete mathematics and related fields.
Open this section to load past papers