Scribd
Upload
39 views5 pages

F (X F (2) 3 (2) 5 1 F (X F ( 2) 3 ( 2) 5 11: Answer: One-One Function

The document contains 6 questions regarding functions, relations, and set theory. Question 1 defines and tests properties of a function from integers to integers. Question 2 proves two set identities. Question 3 defines cardinality, antisymmetric relations, equivalence relations, relation matrices, and binary relations. Question 4 represents a relation as a matrix. Question 5 explains why two functions from reals to reals are not valid. Question 6 shows that a given relation is an equivalence relation.

Uploaded by

plucky gamester
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
39 views5 pages

F (X F (2) 3 (2) 5 1 F (X F ( 2) 3 ( 2) 5 11: Answer: One-One Function

The document contains 6 questions regarding functions, relations, and set theory. Question 1 defines and tests properties of a function from integers to integers. Question 2 proves two set identities. Question 3 defines cardinality, antisymmetric relations, equivalence relations, relation matrices, and binary relations. Question 4 represents a relation as a matrix. Question 5 explains why two functions from reals to reals are not valid. Question 6 shows that a given relation is an equivalence relation.

Uploaded by

plucky gamester
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Attempt All Questions.

Each Question Carries equal marks

Q1 : Determine whether the function f(x)=3x-5 is:

(1) one-one function


(2) onto function
(3) bijection function from set of integers to set of integers.

Answer:

One-one function:
If the function f:Z→Z is defined by the rule f( x)=3x−5 for all x ∈ Z,
then f is a one-one ( injective) function.
Let x 1 =2 and x 2 =−2, then by definition of f,
f (x 1 )=f (2)=3(2)−5=1
and also,
f (x 2 )=f (−2)=3(−2 )−5=−11
For every element in Z(domain ), there is a distinct element in Z(co-domain).
Hence,
f (x 1 )≠f ( x 2 ) and x1 ≠x 2
and f is a one-one ( injective) function.

Onto function:
If the function f:Z→Z is defined by the rule f( x)=3x−5 for all x ∈ Z,
then f is NOT an onto (surjective) function.
Every element of Z(co-domain)≠f ( x ) for all elements in Z(domain ):
f (x )≠−1, f( x )≠2, f( x )≠3 ...
Co-domain≠Range
Hence,
F is NOT an onto function .

Bijection function:
Function f is one-one but NOT onto and does not set pairing
between the elements of Z(domain ) and Z(co-domain ).
Hence,
f is NOT bijective funtion .
Q 2 : Show that

(i)  A    =A
(ii) A-B=A  B

Answer i

we know that,
' ' ' ' ' '
( A ) = A ⇔( A ) ⊆ A∧( A ) ⊇ A
Let,
' '
x ∈( A )
' ' ' '
x ∉ A [if x ∈ A then x ∉( A ) ]
'
x ∈ A [if x ∉ A then x ∈ A ]
Hence,
( A ' )' ⊆ A−−−−¿ (i )
Conversly suppose that,
x∈A
' '
x ∉ A [if x ∈ A then x ∉ A ]
' ' ' ' '
x ∈( A ) [ if x ∉( A ) then x∈ A ]
Hence,
' '
( A ) ⊇ A−−−−¿ (ii )
' '
From (i) and (ii ), we conclude that ( A ) = A

Answer ii

we know that

' ' '


A−B=A∩B ⇔ A−B ⊆ A∩B ∧ A−B ⊇ A∩B
Let,
x ∈ A−B
x ∈ A∧x∉ B [ By definition of difference sets ]
' '
x ∈ A∧x∈ B [ if x ∈B then x ∉ B ]
' ' '
x ∈ A∩B [ if x ∈ A∧x ∈ B then x∈ A∩B ]
Hence,
'
A−B ⊆ A∩B −−−−¿(i)
Conversly suppose that,
x ∈ A∩B'
' ' '
x ∈ A∧x∈ B [ if x ∉ B then x ∉ A∩B ]
'
x ∈ A∧x∉ B [ if x ∈B then x ∉ B ]
x ∈ A−B [ By definition of difference sets ]
Hence,
'
A−B ⊇ A∩B −−−−¿(ii )
'
From (i) and (ii ), we conclude that A−B= A∩B

Q3. Define the following.


(a) Cardinality of a set
(b) Anti-Symmetric
( c) Equivalence Relation
(d) Relation Matrix
(e) Binary Relation

Answer (a)
Cardinality of a set is the number of elements in a set .
It is represented as |A|=n, where ‘n’ is the number of elements in set A .
For example
A={1,2,3 …100}
Cardinality of A is |A|=1

Answer (b)

A relation R on a set A is called Anti-Symmetric if


xRy and yRx implies x=y ∀ x∈ A and x=y ∀ x ∈ A and ∀ y ∈ A .
For example,
The relation R ={(x,y)→ N|x≤ y} is anti-symmetric since x≤y and y≤x implies x= y .
Answer (c)

A relation on a set that satisfies the three properties of reflexivity, symmetry,


and transitivity is called an equivalence relation .
Let A be a set and R a relation on A . R is an equivalence relation if, and only if, R
is reflexive, symmetric, and transitive .

Answer (d)

A relation R is defined as from set A to set B, then the matrix representation of relation is
M R={1, if (a,b )∈ R∧0, if (a,b)∉ R }

Answer (e)

Any set of order pairs defines a binary relation .


Let A and B are two non-empty sets . A relation R from A to B is a subset of A×B,
i,e, it is a collection of certain ordered pairs . We write aRb to mean (a,b)∈R ⊆ A×B .
Thus for any two sets A and B, the sets φ and A×B are always relations from A to Y. ¿
A relation from A to A is called relation on X .
For example,
R= ¿¿
¿

Q 4 : Let A={1,2,3,4}, B={2,3,4} and R={(a,b): a  A, b  B, a divides b}

Represents R by using Relation Matrix.

Answer:
A={1,2,3,4} and B={2,3,4} and R is the divide relation from A to B: For all (x,y )∈ A×B,
R={(2,2 ),(2,4 ),( 4,4 ),(3,3 )}
Relation Matrix representation of R
2 3 4
MR=
1 0 0 0

2 1 0 1

3 0 1 0

4 0 0 1

Q5 : Why is f not a function from R to R in the following equations.

1
( a) f ( x)  x (b) f ( x)  .
x

Answer(a)

1
If the function f:R →R is defined by the rule f( x )= for all x ∈ R,
x
then f is NOT a function because
f (0)∉R, since anything divided by 0 is undefined .

Answer (b)

If the function f:R →R is defined by the rule f( x)= √ x for all x ∈ R,


then f is NOT a function because
f (4)=√ 4=2 and f (−4)=√−4=2
Two seperate elements of R (domain ) are mapping to same point in R(co-domain ).

Q6 : Let A= {1, 2, 3, 4, 5, 6, 7} and R={(a,b): such that a-b is divisible by 3}


Show that R is Equivalence Relation.

Answer:

A={1,2,3,4,5,6,7}

For reflexive,
every a ∈ A such that a−a is divisible by 3, then (a,a)∈ R
{(1,1),(2,2),(3,3),( 4,4 ),(5,5 ),(6,6),(7,7)}
In all these ordered pairs, (a−a)=0 which is divisble by 3 .
Hence R is reflexive .
For symmetric,
if (a−b)∈ R and (b−a)∈R then (a,b)∈ R
{(1,4),( 4,1),(1,7),(7,1),(2,5),(5,2),(3,6),(6,3),(4,7),(7,4)}
In all these ordered pairs, (a−b) and (b−a) is divisble by 3.
Hence R is reflexive .
For transitive,

if (a,b)∈ R such that (a−b) is divisble by 3.


and ( b,c)∈ R then ( b,c)∈ R such that (b−c ) is divisble by 3.
{(1,4),( 4,1),(1,7),(7,1),( 4,7),(7,4)}
In all these ordered pairs, (a−b) and (b−c) is divisble by 3 so ( a−b) is also divisble by 3 .
Hence R is transitive.

R is reflexive, symmetric and transitive thus R is an equivalence relation .

You might also like