GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
94 views
Which of the following statement/s representing One-to-One Function.

S1; ∀a∀b(f (a) = f (b) → a = b)

S2: ∀a∀b( a ≠ b→f (a) ≠ f (b) )

S3:  ∀a∀b(a = b → f (a) = f (b)),

S4:  ∀a∀b(f (a) ≠ f (b) → a ≠ b)
asked in Mathematical Logic by Boss (9.5k points)   | 94 views
I think all are representing one-to-one function.

1 Answer

+4 votes

From the definition of one one function :

 The function f is injective(synonym of one-one) if and only if for all a and b in A, if f(a) = f(b), then a = b; that is, f(a) = f(b) implies a = b.  Equivalently, if a ≠ b, then f(a) ≠ f(b).

So if we represent them in logic form , we get S1 is immediate logical translation of an statement..And since implication represented by S1 is true , so is its contrapositive which is represented by S2 ..

So S1 and S2 are valid logical propositions regarding one one functions..

answered by Veteran (59.6k points)  
Why $S_3$ is false?
@habib thnx for rply
can u plzz tell me what is wrong in S3 and S4. ??
This is just the mathematical definition of one one function which is one way implication..

And we know converse of one way implication is not necessarily true..
@Habib. every statement is half correct . It has to be:

(a=b) ==> f(a)=f(b)    ^  (a$\neq$b) ==> f(a)$\neq$f(b)

Else, I can have one-many functions as well.
Top Users Jan 2017
  1. Debashish Deka

    8322 Points

  2. sudsho

    5166 Points

  3. Habibkhan

    4718 Points

  4. Vijay Thakur

    4468 Points

  5. Bikram

    4420 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4072 Points

  8. santhoshdevulapally

    3732 Points

  9. Sushant Gokhale

    3514 Points

  10. GateSet

    3336 Points

Monthly Topper: Rs. 500 gift card

19,156 questions
24,065 answers
52,872 comments
20,288 users