Let S be the set S = {a, b, c, d} and consider the function f : P(S) → Z given by f(X) = |X| Show that f is not one-to-one by writing down two distinct subsets X, Y ∈ P(S) that satisfy f(X) = f(Y). Write down a subset X that satisfies f(X) = 4 or explain why no such subset X exists. Write down a subset X that satisfies f(X) = 0 or explain why no such subset X exists.

Let S be the set S = {a, b, c, d} and consider the function f : P(S) → Z given by f(X) = |X| Show that f is not one-to-one by writing down two distinct subsets X, Y ∈ P(S) that satisfy f(X) = f(Y). Write down a subset X that satisfies f(X) = 4 or explain why no such subset X exists. Write down a subset X that satisfies f(X) = 0 or explain why no such subset X exists.

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

1. Let f, g : X → R are two measurable functions. Prove that f +g is measurable 2. Let f : X → R are two measurable functions Prove that f is measur- able.
Let A be a nonempty set. Prove that if there is an injective function f :(0,1) -> A, then A is uncountable.
Let f A B be a function. Let X be a subset of A. (a) Verify that X ≤ f−¹(ƒ(X)). (b) Give an example of sets X CA and B, and a function f : A → B such that f−¹(f(X)) £ X. (c) Prove that if f is injective then X = f−¹(ƒ(X)).
State whether each of the following statements is true or false, in either case substantiate/justify. a) Let f : X → Y be a function such that f-1 : Y → X is a closed function, where a closed function maps closed sets into closed sets. Then f is continuous
Let n be a positive integer and let f : [0..n] → [0..n] be an injective function. Define the function g : [0..n] → Z as g(x) = n - (f(x))². Prove that is also injective.
Let f: X → Y. Prove that f is one to one if B = f -1(f(B)) for all B ⊆ X.
Consider the following function: f: Z→ N given by f(x) = (x + 4)² + 5; where, as usual, Z and N, denote the set of all integers and the set of all natural numbers, respectively. You are given that the function f is not an injection. In order to show that f is not an injection, state two distinct elements of the domain of f, denoted by ₁, 2, such that f(x₁) = f(x₂). ● State ₁: • State x₂: You are given that the function f is not a surjection. In order to show that f is not a surjection, state an element of the codomain of f, denoted by y, that is not in the image of f. • State y:
1. Define a function f : Z x Z → Z by f(m, n) = 2n – 4m. (a) Prove that ƒ is not one-to-one. (b) Prove that the range of f is equal to the even numbers. In other words, show rng f = {2k|k E Z}, by using the usual methods for proving an equality of sets.
Let F be a "function" defined on the class of all sets. Then for each ordinal y, there is a unique function h such that 1. dom(h) = y 2. For each a
Let f(z) be an entire function. If |ƒ'(z)| ≤ |z| for all z € C, prove that there exists a, ß E C such that f(z) = a + ßz² for all z E C and |ß| ≤ 1.
Let ℓ be a line and let f : ℓ → R be a function such that PQ = |f(P) - f(Q)| for every P, Q ∈ ℓ. Prove that f is a coordinate function for ℓ.
Let f : A → B be a function between sets A and B. Let X1, X2 ⊆ A and Y1, Y2 ⊆ B. a) Prove that if X1 ⊆ X2, then f(X1) ⊆ f(X2). b) Prove that if Y1 ⊆ Y2, then f -1 (Y1) ⊆ f -1(Y2)