Question

Let f : R → R + be defined by the formula f(x) = 10^2−x ....

Let f : R → R + be defined by the formula f(x) = 10^2−x . Show that f is injective and surjective, and find the formula for f −1 (x).

Suppose f : A → B and g : B → A. Prove that if f is injective and f ◦ g = iB, then g = f −1 .

Homework Answers

Answer #1

2. f(x) = 102-x

So, f(x) = f(y) implies, 102-x = 102-y

So, 2 - x = 2 - y

So, x = y

Hence, f is injective.

Also, let, y belongs to the co-domain R+, so, y > 0.

Then, f(x) = y implies, 102-x = y

So, 2 - x = log10 y. (Since, y > 0)

So, x = 2 - log10 y belongs to R, such that, f(x) = y

So, f is surjective.

&, f -1(x) = 2 - log10 x

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let f : R − {−1} →R be defined by f(x)=2x/(x+1). (a)Prove that f is injective....
Let f : R − {−1} →R be defined by f(x)=2x/(x+1). (a)Prove that f is injective. (b)Show that f is not surjective.
Let X, Y and Z be sets. Let f : X → Y and g :...
Let X, Y and Z be sets. Let f : X → Y and g : Y → Z functions. (a) (3 Pts.) Show that if g ◦ f is an injective function, then f is an injective function. (b) (2 Pts.) Find examples of sets X, Y and Z and functions f : X → Y and g : Y → Z such that g ◦ f is injective but g is not injective. (c) (3 Pts.) Show that...
Is the function f : R → R defined by f(x) = x 3 − x...
Is the function f : R → R defined by f(x) = x 3 − x injective, surjective, bijective or none of these? Thank you!
Let f : A → B and g : B → C. For each statement below...
Let f : A → B and g : B → C. For each statement below either prove it or construct f, g, A, B, C which show that the statement is false. (a) If g ◦ f is surjective, then g is surjective. (b) If g ◦ f is surjective, then f is surjective. (c) If g ◦ f is injective, then f and g are injective
8.4: Let f : X → Y and g : Y→ Z be maps. Prove that...
8.4: Let f : X → Y and g : Y→ Z be maps. Prove that if composition g o f is surjective then g is surjective. 8.5: Let f : X → Y and g : Y→ Z be bijections. Prove that if composition g o f is bijective then f is bijective. 8.6: Let f : X → Y and g : Y→ Z be maps. Prove that if composition g o f is bijective then f is...
Prove that f : R → R where f(x) = |x| is neither injective nor surjective.
Prove that f : R → R where f(x) = |x| is neither injective nor surjective.
Let f:A→B and g:B→C be maps. Prove that if g◦f is a bijection, then f is...
Let f:A→B and g:B→C be maps. Prove that if g◦f is a bijection, then f is injective and g is surjective.*You may not use, without proof, the result that if g◦f is surjective then g is surjective, and if g◦f is injective then f is injective. In fact, doing so would result in circular logic.
Let f : R → R be defined by f(x) = x^3 + 3x, for all...
Let f : R → R be defined by f(x) = x^3 + 3x, for all x. (i) Prove that if y > 0, then there is a solution x to the equation f(x) = y, for some x > 0. Conclude that f(R) = R. (ii) Prove that the function f : R → R is strictly monotone. (iii) By (i)–(ii), denote the inverse function (f ^−1)' : R → R. Explain why the derivative of the inverse function,...
2. Define a function f : Z → Z × Z by f(x) = (x 2...
2. Define a function f : Z → Z × Z by f(x) = (x 2 , −x). (a) Find f(1), f(−7), and f(0). (b) Is f injective (one-to-one)? If so, prove it; if not, disprove with a counterexample. (c) Is f surjective (onto)? If so, prove it; if not, disprove with a counterexample.
Let f : [0,∞) → [0,∞) be defined by, f(x) := √ x for all x...
Let f : [0,∞) → [0,∞) be defined by, f(x) := √ x for all x ∈ [0,∞), g : [0,∞) → R be defined by, g(x) := √ x for all x ∈ [0,∞) and h : [0,∞) → [0,∞) be defined by h(x) := x 2 for each x ∈ [0,∞). For each of the following (i) state whether the function is defined - if it is then; (ii) state its domain; (iii) state its codomain; (iv) state...