How to prove a function is an injection (Screencast 6.3.2)

preview_player
Показать описание
This video discusses four strategies for proving that a function is injective: direct proof, proof using the contrapositive, proof by contradiction, and proof by exhaustion.
Рекомендации по теме
Комментарии
Автор

This is the clearest video to show the proof of injective. I learn a lot!

vincentliang
Автор

As relative newbee to Discrete Maths, your video 'hit it out of the park'. *Really* well explained!

ronglass
Автор

Please prove this theorem before 8 oct
A set X is countable if and only if there exist an injective function from X to set of nature numbers N

liaqatbhinder
Автор

Thank you so much for this video! Extremely helpful!

RahulSingh-vohx
Автор

Why is the second proof valid and not the first? Shouldn't you have to prove that the log function is injective too?

jorgemontes
Автор

these strategies are completely ineffective for complex equations and polynominials.

Caulyns
Автор

is it possible to show that a function f is injective if f is not defined (i.e f : X → Y, but there is no formula that defines f )

allymatabane
Автор

Why in the contrapositive and contradiction was it necessary to take the natural logs of e^x1 and e^2 to show that x1 and x2 were equal? If the e's raised to a power are equal would not the powers they were raised to also have to be equal?

cmcoopermd
Автор

Very good tutor. except that you speak fast :)

clemiboi
Автор

I think it's good he speak fast, otherwise I'd be bored watching.

SimpleCookiee