Purchase Solution

Providing Proof about Functions

Not what you're looking for?

Ask Custom Question

Let f: X--> Y and g: Y-->Z be functions. Show that if g o f is injective, then f must be injective. Is it true that g must also be injective? Show that if g o f is surjective, then g must be surjective. Is it true that f must also be surjective?

Purchase this Solution

Solution Summary

This solution helps with proof about functions.

Solution Preview

Recall that a function f:X-->Y is called injective, if for any elements x and x' from X, the equality f(x)=f(x') implies that x=x'. f is called surjective if for any element y from Y there exists an element x from X such that f(x)=y.

Let gf: X-->Z be injective, and let x, x' be elements of X such that ...

Purchase this Solution


Free BrainMass Quizzes
Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Probability Quiz

Some questions on probability

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.