In mathematics, a set is simply a collection of distinct objects. These objects, called elements or members, can be anything: numbers, letters, people, or even other sets. The key is that each element is unique, and the order of elements doesn't matter.

We usually write sets by listing their elements inside curly braces {}. For example, if we have a set $A$ containing the first five positive integers, we would write it like this:

To say that 3 is an element of set $A$, we use the symbol $\in$. So, we can write $3 \in A$. To say that 6 is not an element of $A$, we write $6 \notin A$.

Sets can be big or small. A finite set is one where you can count all the elements, even if the number is very large. The set of students in a classroom is a finite set. An infinite set, as you might guess, has an unlimited number of elements. The set of all integers is infinite because you can keep counting forever.

Sometimes, one set is completely contained within another. This is called a subset. If every element of set $B$ is also an element of set $A$, then $B$ is a subset of $A$. We use the symbol $\subseteq$ to show this relationship.

For example, if $A = \{1, 2, 3, 4, 5\}$ and $B = \{2, 4\}$, then $B$ is a subset of $A$ because both 2 and 4 are in $A$.

There's also a special set called the empty set, which contains no elements at all. It's represented by the symbol $\emptyset$ or just {}. The empty set is a subset of every set.

Just like we can add or subtract numbers, we can perform operations on sets to combine them or find out what they have in common. These operations are fundamental in fields like database queries and computer logic.

The symbol for union is $\cup$. If we have set $A = \{1, 2, 3\}$ and set $B = \{3, 4, 5\}$, their union is:

Notice that the element 3, which is in both sets, appears only once in the union. Remember, sets only contain distinct elements.

The symbol for intersection is $\cap$. Using the same sets $A$ and $B$ from before:

The only element they share is 3.

Next up is the difference. The difference of set $A$ and set $B$, written $A - B$, is the set of elements that are in $A$ but not in $B$. Think of it as taking everything in $A$ and removing whatever is also in $B$.

The order matters here! The difference $B - A$ would be the elements in $B$ but not in $A$:

Finally, we have the complement. The complement of a set $A$, written as $A'$, contains everything that is not in $A$. To define this, we need to know the universal set ($U$), which is the set of all possible elements for the context we are considering. For example, if we're talking about numbers, the universal set might be all integers.

If our universal set is $U = \{1, 2, 3, 4, 5, 6\}$ and $A = \{1, 2, 3\}$, then the complement of $A$ is:

The last concept we'll cover is the Cartesian product. This operation creates a new set from two existing sets by forming all possible ordered pairs. The first element of the pair comes from the first set, and the second element comes from the second set.

The symbol for the Cartesian product is $\times$. Let's take set $A = \{1, 2\}$ and set $B = \{a, b, c\}$. Their Cartesian product is:

The result is a set of ordered pairs. Unlike elements within a set, the order inside these pairs matters. The pair $(1, a)$ is different from $(a, 1)$. This concept is crucial for understanding relationships and functions in mathematics and computer science.

Now that you have the basics of sets, let's test your knowledge.

These building blocks, from simple collections to complex operations, form a language that helps describe the logical structures at the heart of computer science and mathematics.