Set Theory By Naylor and Sell Homework Problems

fabbi007
Messages
19
Reaction score
0

Homework Statement



I am trying understand the approach to the problems given in the following textbook. Linear Operator Theory in Engineering and Science (Applied Mathematical Sciences) (Volume 0) [Paperback]
Arch W. Naylor (Author), George R. Sell (Author). Pages 12-29. There are excercise problems for which I need approach. Please let me know if anyone has a good understanding of them. Appreciate your response.

Homework Equations





The Attempt at a Solution

 
Physics news on Phys.org
Speaking for myself, I don't have this book. If you have questions about one of the problems, post it here, along with your attempt at a solution.
 
Is Card (N even)< Card (N)? Where N even is set of all even Natural numbers, N is set of all Natural numbers.

Hint: use the mapping from
N even to N is given by n-->n
a. Show examples of this mapping from
N even to N.

b. Is the mapping above onto? One-to-one?

My try at this question:

Since the mapping is n-->n it is the range of this mapping function is a proper subset of N hence the card (N even) <card (N) because there is one to one mapping and the N even maps into N.

Examples above mapping. 2->2, 4->4, 8->8, 268->268... Hence card(N even)< Card
 
How about this mapping:
2 --> 1
4 --> 2
6 --> 3
8 --> 4
.
.
.
2k --> k
This mapping is 1-to-1 and onto. What does that say about the cardinality of the two sets?
 
Mark44 said:
How about this mapping:
2 --> 1
4 --> 2
6 --> 3
8 --> 4
.
.
.
2k --> k
This mapping is 1-to-1 and onto. What does that say about the cardinality of the two sets?

They are equal!
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top