1. a) Let A = {2n|n ∈ ℤ} (ie, A is the set of even numbers) and define function f: ℝ → {0,1}, where f(x) = XA(x) That is, f is the characteristic function of set A; it maps elements of the domain that are in set A (ie, those that are even integers) to 1 and all other elements of the domain to 0.
By demonstrating a counter-example, show that the function f is not injective (not one-to-one).
b) By demonstrating a counter-example, show that the function f: ℕ → ℕ, where f(x) = X2 + 4, is not surjective (not onto).
c) Prove that function f : ℝ → ℝ, where f(x) = 5x+ 2, is injective (one-to-one).
d) (10 pts.)
Prove that function f: ℝ → ℤ, where f(x) = ⌊x− 4⌋, (note the use of the floor function) is surjective (onto).
2) Prove that function f:[0, ∞) → [0, ∞) where f(x) = 2x2 , is a bijection ( (first, prove that it is oneto-one—injective; then prove that it is onto—surjective).
We need at least 10 more requests to produce the answer.
0 / 10 have requested this problem solution
The more requests, the faster the answer.
1)Complete each of the following statements using the words “greater than”, “less than” or “equal to” a) The cardinality of the even numbers is _________________ the cardinality of the natural numbers. b) The cardinality of the natural numbers is _________________ the cardinality of the positive rational numbers. c) The cardinality of the natural numbers is _________________ the cardinality of the rational numbers. d) The cardinality of the real numbers is _________________ the cardinality of the natural numbers. e) The cardinality...
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...
4. Let A be a non-empty set and f: A- A be a function. (a) Prove that f has a left inverse in FA if and only if f is injective (one-to-one) (b) Prove that, if f is injective but not surjective (which means that the set A is infinite), then f has at least two different left inverses.
6. Given a finite set A, denote IA] as a nurnber of elements in A. Let f : X → Y be a function with |XI, Yl< oo, i.e. X, Y are finite sets. Prove the following statements a) IXIS IYİ if f is injective. b) IY1S 1X1 if f is surjective. 6. Given a finite set A, denote IA] as a nurnber of elements in A. Let f : X → Y be a function with |XI, Yl
Let X be a set with an equivalence relation ∼. Let f : X/ ∼→ Y be a function with domain as the quotient set X/ ∼ and codomain as some set Y . We define a function ˜f, called the lift of f, as follows: ˜f : X → Y, x 7→ f([x]). We define a function Φ : F(X/ ∼, Y ) → F(X, Y ), f 7→ ˜f. (1) Is Φ injective? Give a proof or a...
Answer the questions in the space provided below. 1. The definition of a function f: X + Y is as a certain subset of the product X x Y. Let f: N + N be the function defined by the equation f(n) = n2. For each pair (x, y) listed below, determine whether or not (x,y) ef. a) (2,4) b) (5, 23) c) (1,1) d) (-3,9) 2. For each function defined below, state whether it is injective (one-to-one) and whether...
Question 1: Let R be the set of real numbers and let 2R be the set of all subsets of the real numbers. Prove that 2 cannot be in one-to-one correspondence with R. Proof: Suppose 2 is in one-to-one correspondence with R. Then by definition of one- to-one correspondence there is a 1-to-1 and onto function B:R 2. Therefore, for each x in R, ?(x) is a function from R to {0, 1]. Moreover, since ? is onto, for every...
Short Answer Prove the statement For any real number x, [[x]]=[x] TTT Arial 3 (12pt) - T - = - = - S es Path:p Words:0 QUESTION 13 For the functions below, indicate whether the function is: Onto One-to-one Bijection Example one-to-one not the function f is one-to-one f: {0, 1}+{0, 1}. The output of f is obtained by taking the input string and reversing the bits. For example f(011) = 110. For the functions below, indicate whether the function...
l maps is a quotient map. 4, Let ( X,T ) be a topological space, let Y be a nonempty set, let f be a function that maps X onto Y, let U be the quotient topology on induced by f, and let (Z, V) be a topological space. Prove that a function g:Y Z is continuous if and only if go f XZ is continuous. l maps is a quotient map. 4, Let ( X,T ) be a topological...
Please answer this question and it’s subparts 3. (25 points) Part I11: Functions a. (7 pts) Consider functions f and g with the same domain X and co-domain Y, eg, f : X → Y and gX -Y. Must it be true that fng is a function? Why or why not? glx) b. (4 pts) Draw an arrow diagram for a function that is injective but not surjective. ほ, v/ c. (15 pts) Let S be the set of all...