edited by
927 views
0 votes
0 votes

Let $f : A \rightarrow B$ be a bijection and let $E,F$ be subjects of $A$, Now, we consider the following statements about the function $f :$
$P : f(E \cup F) = f (E) \cup f(F)$
$Q : f(E \cap F) = f (E) \cap f(F)$
Which of the following is TRUE about $P$ and $Q$ ?

$(1)$  Only $P$ is correct
$(2)$  Only $Q$ is correct
$(3)$  Both $P$ and $Q$ are correct
$(4)$  None of $P$ and $Q$ is correct

 


I thought $Q$ is true, but answer is both true. Is both true because of bijective function or ans given incorrect?

edited by

1 Answer

Best answer
1 votes
1 votes

Ans-->3

It is always better to solve these types of question by a test case.

Bijection means Function which is both 1 to 1 as well as onto that is each element of the domain must map with a single element of the co-domain.

Say we have a set A = {1,2,3,4} & set B ={W,X,Y,Z} and the mapping be {1-> W, 2-> X, 3->Y,4->Z }

let E = {1,2} and F={2,3}

Now , f{EUF} = f{1,2,3} = {w,x,y} and similarly f{E} U f{F} = {W,X} U {X,Y} = {W,X,Y}

        f{E ∩ F} = f{2} = {x} and similarly f{E}  ∩ f{F} = {W,X}  ∩ {X,Y} = X

So both are true

PS--> if it was given only a function but not a bijection then Q would have never been true..! Then only P should be true,this can be proved in the same way as above

Refer--> https://gateoverflow.in/721/gate2001-2-3.

selected by

Related questions

1 votes
1 votes
1 answer
3
srestha asked Mar 28, 2019
344 views
If G be connected planar graph with 12 vertices of deg 4 each. In how many regions can this planar graph be partitioned?
1 votes
1 votes
0 answers
4
srestha asked May 24, 2019
1,303 views
$1)$How circular queue can be implemented?$2)$ For which data structure circular queue cannot be implemented?$(A)$Array $(B)$ Singly Linked List $(C)$ Doubly Linked List...