Muthamil School XII Math Revision 2021
Uploaded by
Jack NelzMuthamil School XII Math Revision 2021
Uploaded by
Jack NelzCommon questions
Powered by AIThere are two possible relations that can be formed from the set A = {1, 2, 3} that are reflexive and symmetric but not transitive, containing the pairs (1, 2) and (1, 3). The required relations must include: (1, 1), (2, 2), (3, 3) for reflexivity; (1, 2), (2, 1), (1, 3), (3, 1) for symmetry; (2, 3) and (3, 2) cannot both simultaneously be present, or the relation would become transitive. Therefore, the relations are {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (1, 3), (3, 1)} and {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (1, 3), (3, 1), (2, 3)} .
The relation R on integers defined by R = {(a, b) | |a² - b²| < 16} is not transitive because, even if |a² - b²| < 16 and |b² - c²| < 16, it does not imply that |a² - c²| < 16. For example, if a = 1, b = 2, and c = 5, then |1² - 2²| = 3, and |2² - 5²| = 21, both of which satisfy the condition separately, but |1² - 5²| = 24 does not satisfy the condition. This illustrates the failure of transitivity because not all pairs that seemingly 'link' through another element fulfill the condition .
The relation R defined on the set of natural numbers N as (a, b) such that a = b - 2 and b > 6 consists of ordered pairs where the second element of each pair is two more than the first element, starting from the minimum value of b, which is 7. Therefore, the set R includes: {(5, 7), (6, 8), (7, 9), ...}. It is not a finite set as long as the condition b > 6 holds, and it can extend infinitely. The relation is neither reflexive nor symmetric nor transitive, primarily due to the constraints on b .
The relation R on the set A = {1, 2, 3} defined by R = {(1, 2)} is neither reflexive, symmetric, nor transitive. It is not reflexive because not every element is related to itself, i.e., (1, 1), (2, 2), and (3, 3) are not in R. It is not symmetric because (2, 1) is not in R despite (1, 2) being in R. It is also not transitive because there is no (2, 3) to accompany (1, 2) for a complete transitive chain. Thus, R does not satisfy any of the three primary properties of equivalence relations .
The number of surjective (onto) functions from a set A with 4 elements to a set B with 2 elements is 14. This calculation involves distributing the elements of A between the two subsets of B such that neither subset is empty. By Stirling numbers of the second kind and the inclusion-exclusion principle, there are two ways each element of A can map to B while ensuring neither subset is empty, resulting in a total of 14 possible surjective functions .
The function f(x) = 3x, where the domain and codomain are both the set of real numbers R, is both one-one and onto. It is one-one because different x-values yield different outputs since the multiplication by a constant non-zero coefficient does not equate different inputs to the same output. It is onto because every real number can be achieved by picking an appropriate real input, confirming that the function covers its codomain comprehensively .
The relation R on the set of all straight lines defined by l1Rl2 if l1 is perpendicular to l2 is symmetric and reflexive, hence it forms an equivalence relation. If l1 is perpendicular to l2, then l2 is also perpendicular to l1, illustrating symmetry. However, reflexivity does not naturally hold for this definition unless you assume that a line can be perpendicular to itself, which typically isn't the case. Thus, it's a misleading reflexivity. However, transitivity does not apply since if l1 is perpendicular to l2 and l2 to l3, it does not imply that l1 is perpendicular to l3. Therefore, R is symmetric but not a full equivalence relation as usual for standard definitions of equivalence in geometry .
The function f(x) = x⁴ is not one-one or onto. It is not one-one because it is an even function; different values of x (e.g., both positive and negative of a number) can yield the same f(x) value, implying multiple x-values map to the same output. It is not onto when considering the real numbers since the image of f(x) = x⁴ cannot produce negative numbers, failing to cover the entire codomain if it is R, the set of all real numbers .
The function f(x) = log(x² + x² + 1) has a domain of all real numbers R because the argument of the logarithm, x² + x² + 1, is always positive and greater than 0 for all real x. Hence, no restrictions are imposed on the input values. The function is neither one-one nor onto when considering the real numbers as codomain because it produces only positive outputs and maps symmetric values (both positive and negative) to the same output. This rules out it being bijective without further constraints on its codomain .
The size of the equivalence class of the element (3, 2) under the relation R on the cartesian product A x A, defined by (a, b) is equivalent to (c, d) if ad = bc, is 5. This includes ordered pairs (a, b) such that the cross-products satisfy the same product equality with (3, 2), specifically including pairs like (3, 2), (6, 4), (9, 6), and so on, considering the set constraints from A .