I'm trying to understand how to demonstrate that a function is not injective. I know injective means every element in the domain maps to a unique element in the codomain, but how do I prove it's not the case?
6 answers
Giulia
Wed Oct 30 2024
To demonstrate that a function is not injective, a specific criterion must be met.
Rosalia
Wed Oct 30 2024
We need to prove the negation of the statement that for all x and y in the domain A, if x is not equal to y, then f(x) is not equal to f(y).
Valentina
Wed Oct 30 2024
This negation can be expressed as: there exists at least one x in A and at least one y in A such that the condition fails.
Valeria
Wed Oct 30 2024
Specifically, we must find x and y in A where x is not equal to y, but f(x) is equal to f(y).
DaeguDivaDanceQueenElegantStride
Tue Oct 29 2024
This condition directly contradicts the definition of an injective function, which requires distinct inputs to map to distinct outputs.