Abstract/Discrete/Algebraic Mathematics.

  • Thread starter Thread starter hugo28
  • Start date Start date
  • Tags Tags
    Mathematics
AI Thread Summary
If f: X → Y is one-to-one, it can be proven that f^-1(f(A)) is a subset of A for any subset A of X. The proof begins by assuming x is in f^-1(f(A)), which implies f(x) is in f(A), leading to the conclusion that there exists an x' in A such that f(x) = f(x'). Since f is one-to-one, this means x must equal x', confirming x is in A. Additionally, it is noted that for any function f, A is always a subset of f^-1(f(A)), and if f^-1(f(A)) is a subset of A for every A, then f is confirmed to be one-to-one. This establishes a clear relationship between the properties of functions and their inverses in set theory.
hugo28
Messages
7
Reaction score
0
Show/Prove that if f: X → Y is one-to-one on X, and A subset of X, then f^-1(f(A))<= subset A.

If you wouldn’t mind, please check whether I did it correctly. Thanks in advance.

Suppose x Є A
Then, f(x) Є f(A)
By image function y =f(x)
Thus, y = f(x) Є f(A)
And by inverse image, f^-1(y) = f-1(f(x)) Є f^-1(f(A)) <= subset A

Therefore: Є f^-1(f(A)) <= subset A.
 
Last edited:
Physics news on Phys.org
That's right.
 
Your proof doesn't make sense.

You want to prove that f-1(f(A)) ⊆ A.
Thus, suppose x ∈ f-1(f(A)). You want to prove x ∈ A.
Since x ∈ f-1(f(A)), this means f(x) ∈ f(A).
Thus there is some x' ∈ A such that f(x) = f(x').
Since f is one-to-one, we have x = x', and thus x ∈ A.

This is really the only way to prove it.

---

Aside: For any function f: X → Y and any subset A of X, we have A ⊆ f-1(f(A)). This is because for any x ∈ A, f(x) ∈ f(A), so x ∈ f-1(f(A)). Thus, if f is one-to-one, you in fact have f-1(f(A)) = A.

Aside 2: If f: X → Y is a function such that f-1(f(A)) ⊆ A for every subset A of X, then f is one-to-one. Proof: If x, x' ∈ X, let A = {x}. If f(x') = f(x), then f(x') ∈ f(A), so y ∈ f-1(f(A)) ⊆ A. But then x' = x, because A only contains x. Thus:
A function f: X → Y is one-to-one if and only if for every A ⊆ X, f-1(f(A)) ⊆ A.​
 
Last edited:
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top