91Ó°ÊÓ

In set theory, well-formed formulae are expressions that are properly constructed using sets and operators. Just like in arithmetic, where you must follow certain rules to correctly build an equation, set theory requires you to follow specific syntax rules to create understandable and correct set expressions.

For instance, if you have two sets, A and B, and you want to express their union, you would write \((A \cup B)\). This is a well-formed formula because it correctly combines the sets using the union operator.

Well-formed formulae can include one or more sets and can use unary or binary operators to combine them. It is important to use parentheses to clarify the order of operations, just like in algebra. For example, to show the union of three sets, A, B, and C, you could write \(((A \cup B) \cup C)\). This ensures that the union of A and B is calculated first, then united with C.

Variables in set theory play a crucial role by representing sets. For example, if you see a letter like A, B, or C, it usually stands in for a set with specific elements.

These variables allow us to write general expressions and manipulate sets without specifying all the elements inside them. It's similar to algebra where 'x' and 'y' represent numbers. For instance:

• A could represent {1, 2, 3}
• B could represent {2, 3, 4}

By using variables, we can create and solve complex set expressions more efficiently. For example, we might want to find the union, intersection, or difference between these sets using their respective variables.

When you see \(A \cup B\), it tells you to combine all elements from both sets A and B. This resulting set contains all unique elements from both sets. Working with variables allows for more abstract thinking and simplifies the learning and application of set theory.

Operators in set theory are symbols that denote operations to be performed on sets. They are divided into unary and binary operators.

**Unary Operators:**
Unary operators apply to one set. The most common unary operator in set theory is the complement, denoted by \(^-\) or \(\backslash\). For a set A, the complement \(^-A\) represents all elements not in A. It's like saying 'everything outside of A'.

• If A = {1, 2, 3}, then \(^-A\) might be {4, 5, 6, ...} if our universal set includes all positive numbers.

**Binary Operators:**
Binary operators require two sets to perform an operation. The primary binary operators in set theory are union (\(\cup\)), intersection (\(\cap\)), and set difference (\(-\)).

• Union \((A \cup B)\): Combines all elements from sets A and B. If A = {1, 2, 3} and B = {3, 4, 5}, then \(A \cup B\) = {1, 2, 3, 4, 5}.
• Intersection \((A \cap B)\): Includes only the elements that are in both sets. Using the same sets A and B, \(A \cap B\) = {3}.
• Set Difference \((A - B)\): Includes elements in set A but not in set B. From our examples, \(A - B\) = {1, 2}.

Understanding how to use these operators is key to forming well-structured and meaningful expressions in set theory.