Mathematics
Set Theory and Relations
368 Questions
Set theory involves the study of collections of objects and includes operations like union, intersection, and finding complements. Questions cover power sets, Cartesian products, and properties of empty sets. This foundational mathematical topic frequently appears in various competitive exams and university entrance tests.
set operationspower setscartesian productsset complementsproperties of empty setsset partitions
Set Theory and Relations Questions
-
A well-defined collection of distinct objects.
-
A group of objects that are related in some way.
-
A list of items.
-
A collection of numbers.
A
Correct answer
Explanation
A set is a collection of distinct objects that are well-defined and have a clear membership criterion.
Which of the following is an example of a set?
-
{1, 2, 3, 4, 5}
-
{a, b, c, d, e}
-
{apple, banana, orange, pear, grape}
-
All of the above
D
Correct answer
Explanation
All of the given options are examples of sets, as they are well-defined collections of distinct objects.
-
A set with no elements.
-
A set with only one element.
-
A set with an infinite number of elements.
-
None of the above
A
Correct answer
Explanation
The empty set is a set that contains no elements. It is denoted by {} or ∅.
What is the union of two sets?
-
The set of all elements that are in either set.
-
The set of all elements that are in both sets.
-
The set of all elements that are not in either set.
-
None of the above
A
Correct answer
Explanation
The union of two sets A and B, denoted by A ∪ B, is the set of all elements that are in A or B or both.
What is the intersection of two sets?
-
The set of all elements that are in either set.
-
The set of all elements that are in both sets.
-
The set of all elements that are not in either set.
-
None of the above
B
Correct answer
Explanation
The intersection of two sets A and B, denoted by A ∩ B, is the set of all elements that are in both A and B.
What is the difference between two sets?
-
The set of all elements that are in the first set but not in the second set.
-
The set of all elements that are in the second set but not in the first set.
-
The set of all elements that are in both sets.
-
None of the above
A
Correct answer
Explanation
The difference between two sets A and B, denoted by A - B, is the set of all elements that are in A but not in B.
What is the complement of a set?
-
The set of all elements that are not in the set.
-
The set of all elements that are in the set.
-
The set of all elements that are both in the set and not in the set.
-
None of the above
A
Correct answer
Explanation
The complement of a set A, denoted by A', is the set of all elements that are not in A.
What is the power set of a set?
-
The set of all subsets of the set.
-
The set of all elements of the set.
-
The set of all complements of the set.
-
None of the above
A
Correct answer
Explanation
The power set of a set A, denoted by P(A), is the set of all subsets of A.
What is the cardinality of a set?
-
The number of elements in the set.
-
The size of the set.
-
The measure of the set.
-
None of the above
A
Correct answer
Explanation
The cardinality of a set A, denoted by |A|, is the number of elements in A.
What is the principle of inclusion-exclusion?
-
A method for counting the number of elements in a union of sets.
-
A method for counting the number of elements in an intersection of sets.
-
A method for counting the number of elements in a difference of sets.
-
None of the above
A
Correct answer
Explanation
The principle of inclusion-exclusion is a method for counting the number of elements in a union of sets by subtracting the number of elements in the intersections of the sets.
What is a partition of a set?
-
A collection of disjoint subsets of a set whose union is the entire set.
-
A collection of overlapping subsets of a set whose union is the entire set.
-
A collection of subsets of a set whose union is not the entire set.
-
None of the above
A
Correct answer
Explanation
A partition of a set A is a collection of disjoint subsets of A whose union is the entire set A.
Let $G$ be a group acting on a set $X$. The number of orbits of $G$ on $X$ is equal to:
-
The number of elements in $G$
-
The number of elements in $X$
-
The number of fixed points of $G$ on $X$
-
The average number of elements in each orbit
D
Correct answer
Explanation
Burnside's Lemma states that the number of orbits of $G$ on $X$ is equal to the average number of elements in each orbit, which is given by the formula $\frac{1}{|G|} \sum_{g \in G} |X^g|$, where $X^g$ is the set of elements in $X$ that are fixed by $g$.
If a group $G$ acts on a set $X$ and every element of $X$ is fixed by every element of $G$, then the number of orbits of $G$ on $X$ is:
B
Correct answer
Explanation
If every element of $X$ is fixed by every element of $G$, then there is only one orbit, which is the entire set $X$.
In set theory, the intersection of two sets (A) and (B) is defined as:
-
\(A \cap B = \{x \in A \mid x \in B\}\)
-
\(A \cap B = \{x \in A \mid x \notin B\}\)
-
\(A \cap B = \{x \in B \mid x \in A\}\)
-
\(A \cap B = \{x \in B \mid x \notin A\}\)
A
Correct answer
Explanation
The intersection of two sets (A) and (B) is the set of all elements that are common to both (A) and (B).
In set theory, the union of two sets (A) and (B) is defined as:
-
\(A \cup B = \{x \in A \mid x \in B\}\)
-
\(A \cup B = \{x \in A \mid x \notin B\}\)
-
\(A \cup B = \{x \in B \mid x \in A\}\)
-
\(A \cup B = \{x \in B \mid x \notin A\}\)
Correct answer
Explanation
The union of two sets (A) and (B) is the set of all elements that are in either (A) or (B) (or both).