(a) Make a list of all the injective maps
Show that none is bijective. (This constitutes a direct proof that a set
(b) How many injective maps
are there? (You can see why one would not wish to try to prove directly that there is no bijective correspondence between these sets.)
Want to see the full answer?
Check out a sample textbook solutionChapter 1 Solutions
Topology
- Let be a relation defined on the set of all integers by if and only if sum of and is odd. Decide whether or not is an equivalence relation. Justify your decision.arrow_forward13. Consider the set of all nonempty subsets of . Determine whether the given relation on is reflexive, symmetric or transitive. Justify your answers. a. if and only if is subset of . b. if and only if is a proper subset of . c. if and only if and have the same number of elements.arrow_forward21. A relation on a nonempty set is called irreflexive if for all. Which of the relations in Exercise 2 are irreflexive? 2. In each of the following parts, a relation is defined on the set of all integers. Determine in each case whether or not is reflexive, symmetric, or transitive. Justify your answers. a. if and only if b. if and only if c. if and only if for some in . d. if and only if e. if and only if f. if and only if g. if and only if h. if and only if i. if and only if j. if and only if. k. if and only if.arrow_forward
- Elements Of Modern AlgebraAlgebraISBN:9781285463230Author:Gilbert, Linda, JimmiePublisher:Cengage Learning,