Definitions [3]
Definition: Function
f: X → Y is a function if each element of X is associated with a unique element of Y
Definition: Domain & Codomain
- Domain (X): Set of all input values
- Codomain (Y): Set of all possible outputs
Definition: Range
- Range: Set of actual output values of f
- Range ⊆ Codomain
Theorems and Laws [1]
Prove that the greatest integer function f : R → R, given by f(x) = [x], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal to x.
f : R → R, given by f(x) = [x]
It is seen that f(1.2) = [1.2] = 1 and f(1.9) = [1.9] = 1.
∴ f(1.2) = f(1.9), but 1.2 ≠ 1.9.
∴ f is not one-one.
Now, consider 0.7 ∈ R.
It is known that f(x) = [x] is always an integer. Thus, there does not exist any element x ∈ R such that f(x) = 0.7.
∴ f is not onto.
Hence, the greatest integer function is neither one-one nor onto.
Key Points
Key Points: Types of Functions
| Type of Function | Condition | Key Idea |
|---|---|---|
| One-One (Injective) | f(x₁) = f(x₂) ⇒ x₁ = x₂ | Different inputs → different outputs |
| Onto (Surjective) | Range = Codomain | Every element of the codomain is mapped |
| Into Function | Range ⊂ Codomain | Some elements of the codomain are not mapped |
| Many-One Function | x₁ ≠ x₂ but f(x₁) = f(x₂) | Different inputs → same output |
| Bijective Function | One-one + Onto | Perfect mapping (1-1 and onto) |
Key Points: Algebra of Functions
| Operation | Result | Domain |
|---|---|---|
| Addition | (f + g)(x) = f(x) + g(x), ∀ x ∈ D₁ ∩ D₂ | D₁ ∩ D₂ |
| Subtraction | (f − g)(x) = f(x) − g(x), ∀ x ∈ D₁ ∩ D₂ | D₁ ∩ D₂ |
| Multiplication | (fg)(x) = f(x) · g(x), ∀ x ∈ D₁ ∩ D₂ | D₁ ∩ D₂ |
| Quotient | \[\frac{f}{g}(x)=\frac{f(x)}{g(x)}\], ∀ x ∈ D₁ ∩ D₂ (g(x) ≠ 0) | D₁ ∩ D₂ − {x : g(x) = 0} |
| Multiplication by a scalar | (cf)(x) = cf(x), ∀ x ∈ D₁ | D₁ |
