0% found this document useful (0 votes)
7 views18 pages

Understanding One-One and Onto Mappings

The document discusses mathematical concepts related to functions, including one-one (injective) and onto (surjective) mappings. It presents various equations and conditions for determining the nature of these mappings. Additionally, it includes examples and problems related to finding domains and codomains of functions.

Uploaded by

dbnaima07
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views18 pages

Understanding One-One and Onto Mappings

The document discusses mathematical concepts related to functions, including one-one (injective) and onto (surjective) mappings. It presents various equations and conditions for determining the nature of these mappings. Additionally, it includes examples and problems related to finding domains and codomains of functions.

Uploaded by

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

MALDING

og -g
Y

o &
-
>
a
o

&
-
Y

Domain codomain Domain Codomain .

One-one mapping + Onto One-one mappingo into


or
injective or surjective

-
·

Gard
--
Codomain
point Domain

Ed denotes t Many -
one mapping of Onto
circuncentre Find

i -
-
1) :

and #GO Ac
= &

L -
&
Domain codrain.

one many one


+ into
- > many -

not one one

not outo--to .

mapping
F one-one

⑨ O - ()
B
A
Domain Codomain

finl =
fig , nilmain

y(any)
=
=

+
+37(3)
eg flu) :i and fu = + 1
>D
>
-
let , u,%

and f(xi) = fine)

= up+ x ,
+y = xz+
ux()
=> u ? 12
- +
u, -
uz =0
.


-
= (x x2) (x
,
-

, +22 + 1) =0
.

C
= Wuz I

# not one

o
f
f(x) : N > N and f(u) v+ n + 1
EN
-
=

x,

(x 42) ,
-
= O -
U1 22 = 0
-

2nd
-
X

iii
21 12 is a Us

·
ad Y f(u)
=

~
= 0

x = H1 U2 , 13 --
,

M
:
flu) R and fin = 1
It vez
2 ,, M2 ER (Domain)

fini) f(z) =

#
=
E Coni]
2
1 + 4,
SORE

(
=> (1 + y , 22 = 22 + uix)

= (1-42) + front) (21


-

u2) = 0 .

(logtann)
-I
(m uz) (1 uz) =0
=
=
) -
-
y, .

x1 = U2 u1 =
z
Not one an
-

② fi + R given by fin)
=
x ,, 22 ER (Dan]

fini) =
finz)
the was
Find
-
Z (i) flus
minstea
=
Cotras ,

cross
Sinn
& ,

32
- SuXQ 3HIU
+ 32 , = + 342
(i) gin) =
max

any a
-

-
3x , 42 (nn uz)-

+3 (nuz) + q(n - uz)(un +2) =0


.

(x, uz)
-

(9 u1 + 94 + 3 -
34 , 42) O
= -

H, =
u2 x1
= -

Y = 2 (2) + n
.
89 y = (x) + 2n

& !Do B,
2x + x
>
-

y = 2(x) + x =
-
2n + u

I O
-

not one-one
-
-G
-
O

E
=
&30
x + 24
,
uso
09 y =
(x) + 2x =
-
u + 24940 .

x , x10

Once ↑

-
-
O
05
-

- R+R
Ob y = x(x)
>
-

Hu=Xu v

E Find Domain [01)


-

** Ina -

y x(x)
= =

E22 , 230

-22gU10
one-o
-
-
*
#
On
Scan Find for which
y : a
,

4 f(x) is one one

- O
-
e

-n
to Do ( 8) , .

o
+
2x2

2+ 4
value of P for which fin) u3-222
Que Find all =

-
Putt is one-one .

-
> ?
fin)
2
= u -
2n -
Pu + 1

f'(u) = 3 -
42 -
P

DLO .

=> (a) -
9 .
3 .

(p)10 .

=> 12P1 -16

- to -]
,

--

Oul
-
: [0 x)
,
>
R
-

--
one/NOT
n n
e - .
fin)= -
one

en + en
>
-

en (en) (e e lezent -

(en+ eny2
=

(tent(ezn-en)
G
Find race of gas

=>
-
te g(m) =
Sin(in)
trulting

O for
even
-
T

G enti
flu)--
ear Eur R
#
Onl
- S
f(n) = Con-2PU I
fiR+R
Find
is

P
one-one

f(u) O Sinn-2p7 0

O
=

-
-

2 P 7- Since

O
2P C 1
f'(u)
-

-
Sinn-2P/0 .

PL-
=

-
2P) -
Since

ERG

<
-

rus
th -
-

Find
Sinn-1
-

+ -

Siru
- +h

z]u(t 0)
y=
Sirn-Sinn
(a ,
-
, ·

me
Qu
. f(u) =

E mx-1 -UX0

this
= - =
-
.1
2
= -

my0
0

1
.
-
10 1)
,

No offundin
--
⑨ * (Dm]
B/codua)
v
No of fundin = qP
No of one one fundin =

So
if pyq

Ap
XP
I
ayzyz
-

You might also like