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