Relations and Functions Numerical PDF
Uploaded by
amrinaw5al5641eRelations and Functions Numerical PDF
Uploaded by
amrinaw5al5641eCommon questions
Powered by AIA function is onto if every element in the codomain has a pre-image in the domain. For f(x) = x² + 1, the minimum value is 1 (when x = 0), so no values less than 1 in R+ are covered by this function. Thus, there is no input x such that f(x) would result in any positive real number less than 1, demonstrating that f(x) = x² + 1 is not onto .
To determine whether the function f(x) = 2x / (1 + x²) is one-one, we look for distinct x-values that could yield the same result. The nature of the function, being symmetric around the y-axis, suggests multiple x-values (specifically, positive and negative counterparts like x and -x) may yield the same outputs, thus not one-one. For onto, an argument can be made based on output values: y = 2x / (1 + x²) reaches a maximum at x=1, suggesting that not all y-values of R are possible, particularly values outside the range of -1 to 1, rendering it not onto .
To prove f(x) = 2x is one-one, we check that if f(x1) = f(x2), then x1 must equal x2. Since 2x1 = 2x2 implies x1 = x2 directly, the function is injective. To prove it is onto, for every element b in B, there must exist an a in A such that f(a) = b. Here, f: {1, 2, 3, 4} maps to {2, 4, 6, 8}, meaning for every b in B (2, 4, 6, 8), a corresponding a in A exists. Hence, the function is surjective, meeting both criteria of a bijection .
To show that f(x) = (x - 3)/(x - 5) is bijective, demonstrate it's one-one by checking if f(x1) = f(x2) implies x1 = x2. Simplifying \(\frac{x1 - 3}{x1 - 5} = \frac{x2 - 3}{x2 - 5}\) ensures x1 = x2, confirming injectivity. For onto, solve y = (x - 3)/(x - 5) to express x in terms of y, with \(x = \frac{5y - 3}{y - 1}\), which is defined for all y in R excluding 1, showing every y ∈ B is mapped. Both conditions are satisfied; hence, f is bijective .
The function f(x) = x² - 4x + 5 is neither injective nor surjective. A function is injective if every distinct pair of inputs maps to distinct outputs. The quadratic function f(x) fails this test as it is not strictly increasing or decreasing over its entire range, allowing for different x-values to yield the same result. For surjectivity, every real number must be a possible output, but the minimum value of x² - 4x + 5 is 1 at x = 2, meaning that there are no negative real number outputs (for instance), so it is not surjective .
For an equivalence relation R = {(x, y): x = y}, each element in the set forms its own equivalence class, as each element is only equivalent to itself. Therefore, the number of equivalence classes is equal to the number of elements in the set A. Given A = {x: x ∈ Z and 0 ≤ x ≤ 10}, there are 11 elements (ranging from 0 to 10), so there are 11 equivalence classes .
A function is one-one (injective) if different inputs map to different outputs, and it is onto (surjective) if every possible output is mapped to by some input. For f(x) = (5x - 3)/4, we need to show that f(x1) = f(x2) implies x1 = x2 to prove it's one-one. Solving \(\frac{5x1 - 3}{4} = \frac{5x2 - 3}{4}\) implies \(x1 = x2\) since the transformation process is reversible given the linearity of the function, confirming that the function is one-one. To show onto, there must exist an x for every real y such that y = (5x - 3)/4. Solving for x gives x = (4y + 3)/5, which is always a real number, suggesting that f is also onto. Thus, f(x) is both one-one and onto .
A relation R on set A is an equivalence relation if it is reflexive, symmetric, and transitive. For R = {(x, y) : x + y is divisible by 2}, reflexivity is satisfied since x + x = 2x is divisible by 2 for any integer x, meaning (x, x) is in R. Symmetry is satisfied because if (x, y) is in R then x + y is even, and since addition is commutative, y + x is also even, making (y, x) in R. Transitivity holds because if (x, y) and (y, z) are both in R, then both sums are even, hence (x + z) must also be even due to evenness being preserved under addition. Thus, R is an equivalence relation .
For a relation S on R to be reflexive, every element a in the set must satisfy (a, a) ∈ S, meaning a - a + √2 is irrational. However, since this simplifies to √2, an irrational number, S is reflexive. For symmetry, if (a, b) is in S, then a - b + √2 must be irrational; however, for (b, a) to be in S, b - a + √2 must also be irrational, which holds true since the irrationality doesn't change based on order, therefore S is symmetric. Transitivity requires that for any (a, b) and (b, c) in S, (a, c) must also be in S. Since the resulting expressions for each pair maintain irrational sums, S is transitive. Hence, the relation is reflexive, symmetric, and transitive, confirming it's an equivalence relation .
For a relation R to be reflexive, every element should relate to itself; thus, m is always a multiple of m for any m ∈ N, confirming reflexivity. For symmetry, if mRn (m is a multiple of n), then nRm is not generally true (unless m equals n or one of them is a factor of the other), so it's not symmetric. It is transitive if whenever mRn and nRp, then mRp, which is true because if m is a multiple of n, and n a multiple of p, then m is a multiple of p. Thus R is reflexive and transitive, but not symmetric .