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

Multiple choice

Which of the following is a property of the union of two sets?

  1. The union of two sets is always a set

  2. The union of two sets is always larger than either of the two sets

  3. The union of two sets is always smaller than either of the two sets

  4. The union of two sets is always equal to the sum of the two sets
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The union of two sets is always a set, regardless of the nature of the elements in the sets.

Multiple choice

Which of the following is a property of the intersection of two sets?

  1. The intersection of two sets is always a set

  2. The intersection of two sets is always larger than either of the two sets

  3. The intersection of two sets is always smaller than either of the two sets

  4. The intersection of two sets is always equal to the difference of the two sets
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The intersection of two sets is always a set, regardless of the nature of the elements in the sets.

Multiple choice

What is the Axiom of Foundation?

  1. Every non-empty set contains a unique element that is not a member of itself.

  2. There exists a set that contains all sets.

  3. The union of two sets is a set.

  4. The intersection of two sets is a set.
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The Axiom of Foundation is an axiom in set theory that prevents the existence of infinite descending chains of sets, such as (A \in B \in C \in \cdots).

Multiple choice

What is the New Foundations Set Theory?

  1. An axiomatic set theory developed by Willard Van Orman Quine.

  2. An axiomatic set theory developed by John von Neumann.

  3. An axiomatic set theory developed by Kurt Gödel and Paul Bernays.

  4. An axiomatic set theory developed by Ernst Zermelo.
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The New Foundations Set Theory is an axiomatic set theory developed by Willard Van Orman Quine in the 1930s.

Multiple choice

What is the Axiom of Choice?

  1. Every set can be well-ordered.

  2. Every non-empty set contains a unique element that is not a member of itself.

  3. The union of two sets is a set.

  4. The intersection of two sets is a set.
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The Axiom of Choice is an axiom in set theory that states that every set can be well-ordered, meaning that it can be put into a linear order such that every non-empty subset has a least element.

Multiple choice

What is the name of the mathematical theorem that states that for any two sets (A) and (B), the cardinality of their union is at most the sum of their cardinalities?

  1. Cantor-Bernstein-Shroeder Theorem

  2. Schroeder-Bernstein Theorem

  3. Cantor's Theorem

  4. Dedekind-MacNeille Completion Theorem
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Cantor's Theorem establishes that the cardinality of the union of two sets is at most the sum of their cardinalities.

Multiple choice

In a survey, 100 people were asked about their favorite sports. 60 people said they liked soccer, 40 people said they liked basketball, and 20 people said they liked both soccer and basketball. How many people liked only soccer or only basketball?

  1. 60

  2. 80

  3. 100

  4. 120
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Let (S) be the set of people who liked soccer, (B) be the set of people who liked basketball, and (S\cap B) be the set of people who liked both soccer and basketball. Then, by the principle of inclusion-exclusion, the number of people who liked only soccer or only basketball is (|S\cup B| = |S| + |B| - |S\cap B| = 60 + 40 - 20 = 80).

Multiple choice

What is a partition of a set?

  1. A collection of non-empty subsets of a set whose union is the original set.

  2. A division of a set into disjoint subsets.

  3. A collection of subsets of a set whose intersection is empty.

  4. A collection of subsets of a set whose union is the original set and whose intersection is empty.
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

A partition of a set is a collection of non-empty subsets of the set, such that every element of the set belongs to exactly one of the subsets.

Multiple choice

Given a set (S) with (n) elements, how many partitions of (S) are there?

  1. \(n!\)
  2. \(2^n\)
  3. \(n^n\)
  4. \(n\)
Reveal answer Fill a bubble to check yourself
Correct answer
Explanation

The number of partitions of a set with (n) elements is given by the Bell number (B(n)), which can be calculated using the recurrence relation (B(n+1) = \sum_{k=0}^n \binom{n}{k} B(k)) with (B(0) = 1).

Multiple choice

What is the inclusion-exclusion principle?

  1. A method for counting the number of elements in the union of two or more sets.

  2. A method for counting the number of elements in the intersection of two or more sets.

  3. A method for counting the number of elements in the symmetric difference of two or more sets.

  4. A method for counting the number of elements in the complement of a set.
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The inclusion-exclusion principle is a method for counting the number of elements in the union of two or more sets by subtracting the number of elements in the intersections of the sets.

Multiple choice

What is the formula for the inclusion-exclusion principle for (n) sets?

  1. \(|\cup_{i=1}^n A_i| = \sum_{i=1}^n |A_i| - \sum_{i<j}^n |A_i \cap A_j| + \sum_{i<j<k}^n |A_i \cap A_j \cap A_k| - \cdots + (-1)^{n-1} |A_1 \cap A_2 \cap \cdots \cap A_n|\)
  2. \(|\cup_{i=1}^n A_i| = \sum_{i=1}^n |A_i| + \sum_{i<j}^n |A_i \cap A_j| + \sum_{i<j<k}^n |A_i \cap A_j \cap A_k| + \cdots + |A_1 \cap A_2 \cap \cdots \cap A_n|\)
  3. \(|\cup_{i=1}^n A_i| = \sum_{i=1}^n |A_i| - \sum_{i<j}^n |A_i \cap A_j| - \sum_{i<j<k}^n |A_i \cap A_j \cap A_k| - \cdots - |A_1 \cap A_2 \cap \cdots \cap A_n|\)
  4. \(|\cup_{i=1}^n A_i| = \sum_{i=1}^n |A_i| + \sum_{i<j}^n |A_i \cap A_j| - \sum_{i<j<k}^n |A_i \cap A_j \cap A_k| + \cdots + (-1)^{n-1} |A_1 \cap A_2 \cap \cdots \cap A_n|\)
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The formula for the inclusion-exclusion principle for (n) sets is (|\cup_{i=1}^n A_i| = \sum_{i=1}^n |A_i| - \sum_{i

Multiple choice

What is the use of partitions of sets in combinatorics?

  1. To count the number of ways to arrange objects.

  2. To count the number of ways to select objects from a set.

  3. To count the number of ways to distribute objects into groups.

  4. All of the above.
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Partitions of sets are used in combinatorics to count the number of ways to arrange objects, select objects from a set, and distribute objects into groups.

Multiple choice

What is the use of partitions of sets in probability?

  1. To calculate the probability of an event.

  2. To calculate the expected value of a random variable.

  3. To calculate the variance of a random variable.

  4. All of the above.
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Partitions of sets are used in probability to calculate the probability of an event, the expected value of a random variable, and the variance of a random variable.

Multiple choice

What is the axiom of choice?

  1. For any collection of non-empty sets, there exists a function that selects an element from each set

  2. For any collection of non-empty sets, there exists a set that contains exactly one element from each set

  3. For any collection of non-empty sets, there exists a set that contains all of the elements from all of the sets

  4. For any collection of non-empty sets, there exists a set that is disjoint from all of the sets
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The axiom of choice is one of the axioms of Zermelo-Fraenkel set theory. It states that for any collection of non-empty sets, there exists a function that selects an element from each set.

Multiple choice

In set theory, the empty set is denoted by which symbol?

  1. {}

  2. []

  3. ()

  4. ∅
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

The empty set, also known as the null set, is a set with no elements. It is denoted by the symbol ∅.