100% found this document useful (11 votes)
14K views4 pages

Functions: B Such That (X, Y) F: A

1. A function is a relation where each element of the domain (set A) is uniquely mapped to an element of the codomain (set B). The domain is the set of inputs, codomain is the set of possible outputs, and the range is the set of actual outputs. 2. There are several types of functions including one-to-one (injective), onto (surjective), and bijective (both one-to-one and onto). Properties like composition and inverses are defined for different function types. 3. Common functions and their domains/ranges are presented, including polynomials, trigonometric, exponential, logarithmic and other standard functions. Properties like evenness, odd

Uploaded by

eamcetmaterials
Copyright
© Attribution Non-Commercial (BY-NC)
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
100% found this document useful (11 votes)
14K views4 pages

Functions: B Such That (X, Y) F: A

1. A function is a relation where each element of the domain (set A) is uniquely mapped to an element of the codomain (set B). The domain is the set of inputs, codomain is the set of possible outputs, and the range is the set of actual outputs. 2. There are several types of functions including one-to-one (injective), onto (surjective), and bijective (both one-to-one and onto). Properties like composition and inverses are defined for different function types. 3. Common functions and their domains/ranges are presented, including polynomials, trigonometric, exponential, logarithmic and other standard functions. Properties like evenness, odd

Uploaded by

eamcetmaterials
Copyright
© Attribution Non-Commercial (BY-NC)
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
You are on page 1/ 4

Powered by www.myengg.

com

1. FUNCTIONS
Synopsis :
1. A relation f from a set A into a set B is said to be a function or mapping from A into B if for each x
∈ A there exists a unique y∈ B such that (x, y) ∈ f. It is denoted by f : A → B.
2. If f : A → B is a function, then A is called domain, B is called codomain and f (A) = {f (x) : x ∈ A}
is called range of f.
3. If A, B are two finite sets, then the number of functions that can be defined from A in to B is n
(B)n(A).
4. A function f : A → B is said to be one one function or injection from A into B if different elements
in A have different f – images in B.
5. If f : A → B is one one and A, B are finite then n(A) ≤ n(B).
6. If A, B are two finite sets, then the number of one one functions that can be defined from A into B
is n(B)Pn(A) .
7. A function f A → B is said to be onto function or subjection from A onto B if f (A) = B. i.e., range
= codomain.
8. A function f : A → B is onto if y ∈ B ⇒ ∃ x ∈ A ∋ f (x) = y.
9. If A, B are two finite sets and f : A → B is onto then n (B) ≤ n (A)
10 If A, B are two finite sets and n (B) = 2, then the number of onto functions that can be defined
from A onto B is 2n(A) – 2.
11. A function f : A → B is said to be one one onto function or bijection from A onto B if f : A → B is
both one one function and onto function.
12. If A, B are two finite sets and f : A → B is a bijection, then n(A) = n(B).
13. If A, B are two finite sets and n(A) = n(B), then the number of bijections that can be defined from
A onto B is n(A)!.
14. If f : A → B, g : B → C are two functions then the function go f : A → C defined (go f) (x) = g[f
(x)], ∀ x ∈ A is called composite function of f and g.
15. If f : A → B, g : B → C are two one one functions then go f : A → C is also one one.
16. If f : A → B, g : B → C are two onto functions then go f : A → C is also onto.
17. If f : A → B, g : B → C are two one one onto functions then gof : A → C is also one one onto.
18. If A is a set, then the function Ι on A defined by I(x) = x, ∀ x ∈ A, is called Identity function on A.
It is denoted by ΙA.
19. If f : A → B and IA, IB are identity functions on A, B respectively then foΙA = ΙBof = f.
20. If f : A → B is bijection, then the inverse relation f –1 from B into A is also a bijection.
21. If f : A → B is a bijection, then the function
f–1 : B → A defined by f−1 (y) = x if f (x) = y, ∀ y ∈ B is called inverse function of f.
22. If f : A → B, g : B → C are two bisections then (gof)−1 = f–1 og−1

Powered by www.myengg.com
Powered by www.myengg.com

Functions
23. If f : A → B, g : B → A are two functions such that go f = IA and fog = IB then f : A →B is a
bijection and f –1 = g.
24. A function f : A → B is said to be a constant function if the range of f contains only one element
i.e., f (x) = k, ∀ x ∈ A where k is a fixed element of B.
25. A function f : A → B is said to be a real variable function if A ⊆ R.
26. A function f : A → B is said to be a real valued function if B ⊆ R.
27. A function f : A → B is said to be a real function if A ⊆ R, B ⊆ R.
28. A function f : A → R is said to be an even function if f(–x) = f (x), ∀ x ∈ A.
29. A function f : A →R is said to be an odd function if f(–x) = –f (x), ∀ x ∈ A.
30. If a ∈ R, a > 0 then the function f; R → R defined as f (x) = ax is called an exponential function.
31. The function f : R → R defined as f (x) = n where n ∈Z such that n ≤ x < n + 1, ∀ x ∈ R is called
step function. It is denoted by f (x) = [x].
32. The domains and ranges of some standard functions are given below

SNO Functions Domain Range

1. ax R (0, ∞)

2. loga x (0, ∞) R

3. [x] R Z

4. x R [0, ∞)

5. x [0, ∞) [0, ∞)

6. sin x R [–1, 1]

7. cos x R [–1, 1]
π
8. tan x R–{(2n+1) : n∈Z} R
2

9. cot x R – [nπ : n ∈ Z} R
π
10. sec x R – {(2n + 1) : n ∈ Z} (– ∞,–1]∪[1, ∞)
2

11. Sin–1 x [–1, 1] [– π/2, π/2]

12. Cos–1 x [–1, 1] [0, π]

13. Tan–1 x R (– π/2, π/2)

14. Cot–1 x R (0, π)

Powered by www.myengg.com
Powered by www.myengg.com

Functions

SNO Functions Domain Range

15. Sec–1 x (– ∞,–1]∪[1, ∞) [0, π/2)∪(π/2, π]

16. Cose–1 x (– ∞,–1]∪[1, ∞) [– π/2, 0)∪(0, π/2]

17. Sinh x x R R

18. Cosh x R [1, ∞)

19. tanh x R (–1, 1)

20. coth x (– ∞, 0) ∪(0, ∞) (– ∞,–1)∪(1, ∞)

21. sech x R (0, 1]

22. cosech x (– ∞, 0)∪(0, ∞) (– ∞, 0)∪(0, ∞)

23. Sinh–1 x R R

24. Cosh–1 x [1, ∞) [0, ∞)

25. Tanh–1 x (–1, 1) R

26. Coth–1x (– ∞, –1)∪(1, ∞) (– ∞, 0)∪(0, ∞)

27. Sech–1 x (0, 1] [0, ∞)

28 Cosech–1x (– ∞, 0)∪(0, ∞) (– ∞, 0)∪(0, ∞)

⎧ 1 if x>0
33. Signum Function : The signum function is defined as sgn f(x) = ⎪⎨ 0 if x =0.
⎪− 1 if x<0

34. f(x) is a polynomial function such that f(x), f ⎛⎜ ⎞⎟ = f ( x ) + f ⎛⎜ ⎞⎟ . Then f(x) = xn + 1 or −xn + 1.
1 1
⎝x⎠ ⎝x⎠
35. f(x) is a function such that f(x + y) = f(x), f(y). Then f(x) = ax.
36. f(x) is a function such that f(xy) = f(x) + f(y). Then f(x) = logax.
37. If f(x + y) = f(x) + f(y) ∀ x, y, then f(n) = nf(1).
ax + b
38. If y = f(x) = , then f(y) = x or (fof)(x) = x.
cx − a
ax + b b − dx
39. If f(x) = , then f−1(x) = − .
cx + d a − cx

40. The range of function f(x) = asinθ + bcosθ + c is ⎡⎢c − a2 + b2 , c + a2 + b2 ⎤⎥ .


⎣ ⎦

41. The range of the function f(x) = a2 − x 2 is [0, a].

Powered by www.myengg.com
Powered by www.myengg.com

Functions
1⎡ ⎛x⎞ ⎤
42. If f(x).f(y)− ⎢f ⎜⎜ ⎟⎟ + f ( xy)⎥ = 0, then f(x) = cos(logx).
2 ⎢⎣ ⎝ y ⎠ ⎥⎦

Powered by www.myengg.com

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy