Imposter

Algebra Level pending

True or False?

\quad There exist functions f : S T f: S \to T and g : T S g: T \to S such that g f = id S g \circ f = \text{id}_{S} but f g id T f \circ g \neq \text{id}_{T} .

True False

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Hobart Pao
Sep 23, 2016

Let S = { 1 , 2 , 3 } S = \{ 1, 2, 3 \} and T = { 4 , 5 , 6 , 7 } T = \{4, 5, 6, 7 \} . We know g f g \circ f is injective by definition, so f f must be injective and g g must be surjective. However, g g doesn't have to be injective.

We can say that f ( 1 ) = 4 , f ( 2 ) = 5 , f ( 3 ) = 6 f(1) = 4, f(2) = 5, f(3) = 6 and g ( 4 ) = 1 , g ( 5 ) = 2 , g ( 6 ) = 3 g(4) = 1, g(5) = 2, g(6) = 3 . As a result, g f = id S g \circ f = \text{id}_{S} because the domain of f f does not give us an input with the image 7 7 . Therefore, when we do g g of output of f f , there's no way to "not get an output". However, if we were to do f g f \circ g , consider g ( 7 ) g(7) , which has no output. f f has no way to deal with g ( 7 ) g (7) (because what is f f of something that is undefined? Undefined.). Therefore, f g f \circ g does not give id T \text{id}_T . Therefore, there do exist functions f f and g g for which the question statement is true.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...