91Ó°ÊÓ

Set theory is the foundation of modern mathematics. A **set** is a collection of distinct objects, considered as an object in its own right. Sets are usually denoted by curly braces. For example, the set of natural numbers is written as \(\forall n \in \mathbb{N}\). A **subset** is a set contained within another set. For instance, if Set A = \{1, 2, 3\} and Set B = \{1, 2\}, then Set B is a subset of Set A, written as B \subseteq A. Beyond subsets, here are some fundamental principles of set theory:

• **Union**: Combines all elements of the sets involved, denoted as \A \cup B\
• **Intersection**: The common elements between sets, denoted as \A \cap B\
• **Difference**: Elements in one set but not in another, denoted as \A - B\
• **Complement**: All elements not in a given set, relative to a universal set, denoted as \A'\

Understanding these concepts is key to comprehending more complex mathematical ideas.
Remember, in the context of **relations and functions,** sets of ordered pairs (like teacher-student pairs) must be interpreted carefully to determine domain and codomain attributes.

To grasp relations and functions, understanding **domain** and **codomain** is essential. The domain refers to the set of 'input' values, while the codomain refers to the set of all possible 'output' values. For example, if we have a relation where teachers are paired with students, the domain is the set of teacher names and the codomain is the set of student names.
You can think of it this way:

• **Domain**: All names of the teachers in the school.
• **Codomain**: All names of the students in their classes.

For a relation to be a function, every element in the domain must map to exactly one element in the codomain. In our example, if each teacher can have multiple students, but each student belongs to only one teacher, the set forms a relation but not a function.
In notation, if a relaion exists, for every x in the domain, there is an associated y in the codomain, written as \(x, y\). However, if the same x maps to different y values, it's not a function.

Relations can be categorized based on certain properties. Here are the key types:

• **Reflexive Relation**: Every element maps to itself. For example, in a set A = \{a, b, c\}, a reflexive relation would include \(a, a\), \(b, b\), and \(c, c\).
• **Symmetric Relation**: If \(a, b\) is in the relation, then \(b, a\) must also be in the relation. For instance, if \(x, y\) is in the set, then \(y, x\) should also be present.
• **Transitive Relation**: If \(a, b\) and \(b, c\) are in the relation, then \(a, c\) must also be in the relation. An example set could be: \(a, b\), \(b, c\), leading to \(a, c\).
• **Anti-symmetric Relation**: If \(a, b\) and \(b, a\) both are in a relation, then \a\ must be equal to \b\.

A **function** is a special type of relation that is both univalent and well-defined. Each element in the domain relates to exactly one element in the codomain.
In our exercise’s context:

• **Relation**: A teacher can have multiple students.
• **Not a Function**: A student cannot have multiple teachers.

Understanding these differences helps to categorize better and solve mathematical problems efficiently.