Suppose is a subset of the cartesian product of a finite set and uncountable set, anuBis the product two countably infinite sets.What can you say about|A∩B|? What can you say about|P(A∪B)|?
Case 1:
Let A= R × { 1 } i.e. A is Cartesian product of an uncountable set R with a finite set { 1 }. Then A is also an uncountable set. Now we again let B = N × N ,where N is set of natural number therefore B is countably infinite set. Thus here we find that
A B = N ×{ 1} which is countably infinite set more clear it is similar to N ,set of natural numbers. Therefore cardinality of  A B is same as cardinality of N means countably infinite. Also ( A U B)= R × { 1 } which is similar to R therefore it's cardinality will be same as R or power set of natural number ,i .e. uncountable set.Hence
| A B | = Aliph naught {countably infinite set }
|P(A B)| = c ,where c is continum which denotes cardinality of P(N).
Case2:
Let A = Qc × { 1} ,i.e. A is product of an uncountable set with a countable set and also let B =N × N, i.e.
B is producproductwo countably infinite set. Therefore we get (A B ) is empty set and ( A U B ) is again uncountable set whoes cardinality is similar to power set of Natural numbers P(N) i. e.
|A B| = 0.
|P(A U B)| = c ,where c is continum which denotes the cardinality of P(N).
Thus from above two cases we can conclude that the set A B is either countably infinite or countably finite but power set of ( A U B ) is always uncountable set
Suppose is a subset of the cartesian product of a finite set and uncountable set, anuBis...
Prove that a subset of a countably infinite set is finite or countably infinite.
Is the set NU (T, e,i) counta ble? Select one a. uncountable b. finite c. countably infinite
From the class Introduction to Abstract Algebra on the section of countable and uncountable sets 3. Let X and Y be two nonempty finite sets. Let F(X, Y) denote the set of all function from X to Y. Is this set finite, countably infinite, or uncountable? Prove your answer
b and c please explian thx i post the question from the book Let 2 be a non-empty set. Let Fo be the collection of all subsets such that either A or AC is finite. (a) Show that Fo is a field. Define for E e Fo the set function P by ¡f E is finite, 0, if E is finite 1, if Ec is finite. P(h-10, (b) If is countably infinite, show P is finitely additive but not-additive. (c)...
The set of all functions from the integers to the set {true, false} Select one: a. countably infinite b. uncountable c. finite
Prove that a disjoint union of any finite set and any countably infinite set is countably infinite. Proof: Suppose A is any finite set, B is any countably infinite set, and A and B are disjoint. By definition of disjoint, A ∩ B = ∅ Then h is one-to-one because f and g are one-to one and A ∩ B = 0. Further, h is onto because f and g are onto and given any element x in A ∪...
Question 7 Classify each of the following sets as finite, countable infinite, or uncountable (no proof is necessary): A=0 B = {2 ER: 0 < x < 0.0001} C=0 D=N E = {R} F= {n EN:n <9000} G=Z/5Z H = P(N) I= {n €Z:n > 50 J=Z Bonus: Give an example of a set with larger cardinality then any of the above sets.
Hint: Use the fundamental theorem of arithmetic. 15. Theorem 14.5 implies that Nx N is countably infinite. Construct an alternate proof of this fact by showing that the function ф : N x N 2n-1(2m-1) is bijective. N defined as ф(m,n) It is also true that the Cartesian product of two countably infinite sets is itself countably infinite, as our next theorem states. Theorem 14.5 If A and B are both countably infinite, then so is A x B. Proof....
For metric spaces (X, dx) and (Y, dy) consider their Cartesian product Z-X (p18). Show that the following constructions both give metris on the product (a) Define di : Z × c, d))-dr(a, c) + dy(b, d) for (a, b), (c, d) e X x Y (b) Define (lo : Z × Z → R by writing do ((a, b), (c, d))-maux {dx (a, c), dy(b, d)) for (a, b), (c, d) E X × Y Answer the following: (c)...
1.2.15. Suppose S is an uncountable set. Is it possible that P({s}) = 0 for every single s ∈ S? Why or why not?