(a) Prove that a set Ti is denumeratble if and only if there is a denumerable...
1. Let A -(a, b) a, b Q,a b. Prove that A is denumerable. (You may cite any results from the text.) 2. Let SeRnE N) and define f:N-+S by n)- n + *. Since, by definition, S-f(N), it follows that f is onto (a) Show that f is one-to-one (b) Is S denumerable? Explain 3. Either prove or disprove each of the following. (You may cite any results from the text or other results from this assignment.) (a) If...
Let S be a finite set with cardinality n>0. a. Prove, by constructing a bijection, that the number of subsets of S of size k is equal to the number of subsets of size n- k. Be sure to prove that vour mapping is both injective and surjective. b. Prove, by constructing a bijection, that the number of odd-cardinality subsets of S is equal to the number of even-cardinality subsets of S. Be sure to prove that your mapping is...
Problem 1. Let A be an infinite set such that |Al S INI. Prove A IN (Hint: First prove this for all infinite subsets B CN. Prove the general case by observing there is a bijection between A and some infinite subset of N.) Problem 1. Let A be an infinite set such that |Al S INI. Prove A IN (Hint: First prove this for all infinite subsets B CN. Prove the general case by observing there is a bijection...
. Let C be a collection of open subsets of R. Thus, C is a set whose elements are open subsets of R. Note that C need not be finite, or even countable. (a) Prove that the union U S is also an open subset of R. SEC (b) Assuming C is finite, prove that the intersection n S is an open subset of R. SEC (c) Give an example where C is infinite and n S is not open....
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 ∪...
3. (20 pts) Let ụ be a finite set, and let S = {Si, S , S,n} be a collection of subsets of U. Given an integer k, we want to know if there is a sub-collection of k sets S' C S whose union covers all the elements of U. That is, S k, and Us es SU. Prove that this problem is NP-complete. 992 m SES, si 3. (20 pts) Let ụ be a finite set, and let...
Subject: Proof Writing (functions) In need of help on this proof problem, *Prove the Following:* Here are the definitions that we may need for this problem: 1) Let f: A B be given, Let S and T be subsets of A Show that f(S UT) = f(s) U f(T) Definition 1: A function f from set A to set B (denoted by f: A+B) is a set of ordered Pairs of the form (a,b) where a A and b B...
Set Proof: 1. Prove that if S and T are finite sets with |S| = n and |T| = m, then |S U T| <= (n + m) 2. Prove that finite set S = T if and only if (iff) (S Tc) U (Sc T) = We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this image
5. The Hitting Set Problem (HS) is the following decision problem. Input. A finite set S, a collection (s1, s2,... , sn) of subsets of S, and a positive integer K. Question. Does there exist a subset t of S such that (a) t has exactly K members and (b) for i 1,..., n, sint6For example, suppose S # {1, 2, 3, 4, 5, 6, 7. the collection of subsets is (2.45), (34).(1,35) and K - 2. Then the answer...
Exercise 7.H. 7.Н. Show that every number in the Cantor set has a ternary (-base 3) expan- sion using only the digits 0, 2 7.I. Show that the collection of "right hand" end points in F is denumerable. Show that if all these end points are deleted from F, then what remains can be put onto one-one correspondence with all of [0, 1). Conclude that the set F is not