How are inverse images used to prove set inclusions?

AI Thread Summary
Inverse images are essential in proving set inclusions, specifically through the properties of functions. The discussion focuses on proving two key inclusions: f −1(f(A)) ⊇ A and f(f −1(B)) ⊆ B. To demonstrate the first inclusion, the cases of A being empty or non-empty are considered, leading to the conclusion that for any element x in A, it must also be in f −1(f(A)). The second inclusion is established by showing that if x is in A, then it is also in B through the properties of the function and its inverse. Understanding these proofs is crucial for grasping foundational concepts in analysis.
drmarchjune
Messages
1
Reaction score
0
I am studying the very first chapter of analysis, but can't quite get through this problem:

Prove f −1(f(A)) ⊇ A
Prove f(f −1(B)) ⊆ B
 
Physics news on Phys.org
How did you begin the problem?
For A \subseteq f^{-1}( f(A)), consider two cases.
case 1:A = \emptyset
case 2: A \neq \emptyset
 
in general , to prove that A\subseteq B , we prove

\forall x[x\in A\Rightarrow x\in B]


and to prove this ,you let x be arbitrary. since we have an implication inside the square bracket, we assume antecedent , and set out to prove consequent . So assume
x\in A
 
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