Injective Function: Proving Correctness with Singlets ##S## and ##T## in ##X##

  • Thread starter pepos04
  • Start date
  • Tags
    Function
  • #1
pepos04
41
0
Homework Statement
Hi. Given a function ##f## from ##X## to ##Y##, an exercise asked me to establish whether, given two subsets of ##X## (for example ##T## and ##S##), therefore ##f (T \cap S) = f (T) \cap f (S)##, if and only if ##f## is injective.
Relevant Equations
\
I operated by placing ##S## and ##T## to two singlets belonging to ##X## and therefore established that for ##T, S \in X##, therefore ##f (T) = f (S) \implies S = T##, consequentially: $$f (T \cap S ) = f (T \cap T) = f (T) \cap f (T) = f (T) \cap f (S)$$. I would like to know if my procedure is correct and if there are still any shortcomings. Thank you.
 
Physics news on Phys.org
  • #2
pepos04 said:
Homework Statement: Hi. Given a function ##f## from ##X## to ##Y##, an exercise asked me to establish whether, given two subsets of ##X## (for example ##T## and ##S##), therefore ##f (T \cap S) = f (T) \cap f (S)##, if and only if ##f## is injective.
I’m no mathematician but am wondering if you have stated the question completely and correctly.

As I understand it, the argument of a function must be an element of a set. So writing expressions such as ##f (T \cap S)## or ##f (S)## seems wrong and ambiguous.

Also, if ##S## and ##T## are singleton sets, I would have thought this would need to be explicitly stated in the question. It doesn't seem like an assumption you should need to make yourself for the question to make sense.
 
  • #3
pepos04 said:
Homework Statement: Hi. Given a function ##f## from ##X## to ##Y##, an exercise asked me to establish whether, given two subsets of ##X## (for example ##T## and ##S##), therefore ##f (T \cap S) = f (T) \cap f (S)##, if and only if ##f## is injective.
Relevant Equations: \

I operated by placing ##S## and ##T## to two singlets belonging to ##X## and therefore established that for ##T, S \in X##, therefore ##f (T) = f (S) \implies S = T##,

This is a statement that [itex]f[/itex] is injective. Is that the direction of the equivalence you are attempting to prove? If so, please state that expressly.

If [itex]T[/itex] is a singleton subset of [itex]X[/itex], then it is incorrect to say that [itex]T \in X[/itex]. If [itex]T = \{t\}[/itex] then [itex]t \in X[/itex] and [itex]T \subset X[/itex]. But you don't have to name singleton sets; instead name the elements inside them (ideally as [itex]x[/itex] and [itex]y[/itex]) since the definition of injectivity of [itex]f[/itex] is stated in terms of individual elements of [itex]X[/itex].

If you are assuming that [itex]f[/itex] is injective, then your aim is to prove a statement about arbitrary subsets of [itex]X[/itex]. Better to start with the assumption that they are indeed arbitrary, rather than singletons.

I would start by showing that if [itex]f[/itex] is injective, then for all [itex]x \in X[/itex] and all [itex]T \subset X[/itex] we have [itex]f(x) \in f(T)[/itex] if and only if [itex]x \in T[/itex].
 
  • Like
Likes PeroK and FactChecker
  • #4
Steve4Physics said:
I’m no mathematician but am wondering if you have stated the question completely and correctly.

As I understand it, the argument of a function must be an element of a set. So writing expressions such as ##f (T \cap S)## or ##f (S)## seems wrong and ambiguous.

By definition, if [itex]f: X \to Y[/itex] then for [itex]T \subset X[/itex], [tex]f(T) \equiv \{ f(x) : x \in T \} \subset Y[/tex] and for [itex]W \subset Y[/itex], [tex]
f^{-1}(W) \equiv \{x \in X: f(x) \in W \} \subset X[/tex] where the latter is well-defined even if [itex]f[/itex] is not itself invertible.
 
  • Like
  • Informative
Likes PeroK and Steve4Physics
  • #5
pasmith said:
By definition, if [itex]f: X \to Y[/itex] then for [itex]T \subset X[/itex], [tex]f(T) \equiv \{ f(x) : x \in T \} \subset Y[/tex] and for [itex]W \subset Y[/itex], [tex]
f^{-1}(W) \equiv \{x \in X: f(x) \in W \} \subset X[/tex] where the latter is well-defined even if [itex]f[/itex] is not itself invertible.
Thanks. I didn't know that.
 
  • #6
The text asks me: given a function ##f## from ##X## in ##Y##, prove that for every pair ##S, T## of subsets of ##X##, equality ##f(S \cap T) = f(S) \cap f(T)## holds if and only if the function ##f## is injective.
 
Last edited:
  • #7
I exploited the fact that only with the injectivity of the function could that equality be achieved
 
  • #8
pepos04 said:
Homework Statement: Hi. Given a function ##f## from ##X## to ##Y##, an exercise asked me to establish whether, given two subsets of ##X## (for example ##T## and ##S##), therefore ##f (T \cap S) = f (T) \cap f (S)##, if and only if ##f## is injective.
Relevant Equations: \

I operated by placing ##S## and ##T## to two singlets belonging to ##X## and therefore established that for ##T, S \in X##, therefore ##f (T) = f (S) \implies S = T##, consequentially: $$f (T \cap S ) = f (T \cap T) = f (T) \cap f (T) = f (T) \cap f (S)$$. I would like to know if my procedure is correct and if there are still any shortcomings. Thank you.
This needs a lot of work. A valid proof of this would have several parts and you should be clear in each part, what you are assuming and prove one part at a time.
When proving any "A if and only if B", there are at least two things to prove:
1) If A then B
2) If B then A.
When proving that two sets, C and D, are equal, there are at least two things to prove:
1) ##x \in C, \implies x \in D##
2) ## x \in D \implies x \in C##

So I would expect a proof with several sections. State clearly what is being assumed in each section of the proof and make it clear what the result is.
 
  • Like
Likes PeroK
  • #9
pepos04 said:
The text asks me: given a function ##f## from ##X## in ##Y##, prove that for every pair ##S, T## of subsets of ##X##, equality ##f(S \cap T) = f(S) \cap f(T)## holds if and only if the function ##f## is injective.
The key phrase is 'every pair ##S, T## of subsets'. You could do this...

1) Show that if ##f## is injective, then ##f (T \cap S) = f (T) \cap f (S)## for all possible pairs ##S, T##.

2) Show that if ##f## is not injective, then at least one pair ##S, T## can be chosen such that ##f (T \cap S) \ne f (T) \cap f (S)##. The 'trick' is to make a suitable choice for ##S, T##.
 
  • Like
Likes PeroK
  • #10
This might help the OP, without giving too much away in terms of the solution to this particular problem.

For any subsets, ##T, S##, and any function ##f##, we have:
$$f(T \cap S) \subseteq f(T) \cap f(S)$$Proof:
$$y \in f(T \cap S) \ \Rightarrow \ \exists x \in T \cap S: f(x) = y$$Now
$$x \in T \cap S \ \Rightarrow \ x \in T \ \text{and} \ x \in S$$$$\Rightarrow \ y \in f(T) \ \text{and} \ y \in f(S)$$$$\Rightarrow \ y \in f(T) \cap f(S)$$QED
 

What is an injective function?

An injective function, also known as a one-to-one function, is a function where each element in the domain maps to a distinct element in the codomain. In other words, no two different elements in the domain can map to the same element in the codomain.

How can we prove the correctness of an injective function?

To prove the correctness of an injective function, we can use singlets ##S## and ##T## in the domain ##X##. We can show that for any two elements in ##S## and ##T##, if the function maps them to the same element, then ##S## and ##T## must be the same element.

What is the significance of proving the injectiveness of a function?

Proving that a function is injective is important in various mathematical and computational contexts. It ensures that each input has a unique output, which can be crucial for functions that need to preserve information or avoid conflicts.

Can all functions be injective?

No, not all functions can be injective. Some functions by their nature may map multiple elements in the domain to the same element in the codomain. However, certain restrictions or modifications can sometimes be applied to make a function injective.

How does the concept of singlets ##S## and ##T## help in proving the injectiveness of a function?

The use of singlets ##S## and ##T## allows us to compare the outputs of the function for different inputs. By showing that no two distinct elements in ##S## and ##T## map to the same element, we can demonstrate the injectiveness of the function.

Similar threads

  • Calculus and Beyond Homework Help
Replies
20
Views
2K
  • Calculus and Beyond Homework Help
Replies
9
Views
816
  • Calculus and Beyond Homework Help
Replies
1
Views
463
  • Calculus and Beyond Homework Help
Replies
1
Views
513
  • Calculus and Beyond Homework Help
Replies
2
Views
550
  • Calculus and Beyond Homework Help
Replies
8
Views
626
  • Calculus and Beyond Homework Help
Replies
1
Views
301
  • Calculus and Beyond Homework Help
Replies
1
Views
792
  • Calculus and Beyond Homework Help
Replies
24
Views
807
  • Calculus and Beyond Homework Help
Replies
12
Views
1K
Back
Top