The function f : A → B is injective if whenever f (x)= f (y), where x, y € A, then x = y.

Related MCQs

• If |A|=5 and |B|=4, then there exists an injective function f: B→A.
• Let A be a finite set. If f : A → A is injective then it is surjective.
• An argument is valid if, whenever the conclusion is true, thenthe premises are also true.
• Determine the validity of argument given: s1: If I like mathematics then I will study. S2: Either I will study or I will fail. S: If I fail then I do not mlike mathematics.
• Domain and Range of the function Y = –v(–2x + 3) is
• The function f : Z → Z given by f (x)= x +1 is a bijection.
• Which relation is not a function?
• Given the relation D = {(6,4), (8,-1), (x,7), (-3,-6)}. Which of the following values for x will make relation D a function?
• Types of function Mappings are-----
• let A={{a,b}} then aЄ A