A) Zermelo–Fraenkel set theory including the axiom of choice B) Zermelo–Fraenkel set theory without choice C) Peano arithmetic D) Intuitionistic set theory
A) I must be a finite set B) There is no specific constraint given for I C) I must be a well-ordered set D) I must be a countable set
A) A_i < B_i B) A_i = B_i C) A_i ≤ B_i D) A_i > B_i
A) A is a subset of B B) There is a bijection between A and B C) B is a subset of A D) There is no function from A onto B and B is nonempty
A) By assuming the product is infinite B) By proving the index set is finite C) By definition of the summation D) Using the axiom of choice and the fact that factors are nonempty
A) That the function is bijective B) That the function is not surjective C) That the function is injective D) That the function is constant
A) An element a_i in A_i B) The product of all B_i C) An element b_i in B_i not in the image of A_i D) The union of all A_i
A) The identity function B) The summation over I C) The projection to B_i D) The product over I
A) Because A_i is empty B) Because the function f is surjective C) Because each component does not match the image of f D) Because the product is empty
A) f is a constant function B) the product is equal to the sum C) f does not map the disjoint union of A_i onto the product of B_i D) f is injective
A) κ > κcf(κ) B) κ ≤ κcf(κ) C) κ < κcf(κ) D) κ = κcf(κ)
A) Zorn's lemma B) Well-ordering theorem C) Easton's theorem D) Cantor's theorem
A) The sum is less than κ B) The sum is greater than κ C) The sum equals κ D) The sum is undefined
A) Kőnig's theorem B) Easton's theorem C) Schröder-Bernstein theorem D) Cantor's theorem
A) κ ≤ cf(λ^κ) B) κ = cf(λ^κ) C) κ > cf(λ^κ) D) κ < cf(λ^κ)
A) μ > μ B) μ = 0 C) μ < μ D) μ is empty
A) κ > 2^κ B) κ = 2^κ C) κ < 2^κ D) κ + 1 = 2^κ
A) It remains unproven B) Much earlier C) At the same time D) Much later |