proof problemmz
wait how do I replace the $ @wio
Ummm, by hand?
Let \( f: X \rightarrow Y\) and \( E \subseteq Y\) Prove that \( X \backslash \bar f^{-1}(E) \subseteq \bar f^{-1}(Y \backslash E)\)
k .. hold on getting mai attempz
By complement definition, \\ \( X \backslash \bar f^{-1}(E) = [x: x \in X, x \notin f^{-1}(E)]\) \\ There are X elements that don't belong in \(f^{-1}(E)]\) and \(f(x) \notin E\). If \(Y\) elements belong in \(f(x)\), then they must belong to \(f^{-1}(x)\). Therefore, \(x \in f^{-1}(Y \setminus E)\)\\
...
hold on
Consider an element \[x \epsilon X/f^-1(E)\], then x is an element in some set \[N \subseteq X\] since x \[x \notin f^-1(E)\]. This implies that the image under f of an element x must be an element in the compliment of E in Y. Hence, \[x \in f^-1(Y/E)\]
so the element x under the image f must be an element in the compliment of E in Y
Whait a minute, why is it \(\bar f\)? What's the bar for? is \(\bar f^{-1}\) different from \(f^{-1}\)?
blame my book
By definition right? Since Y/E = { y in Y : y not in E}. Yes, what is f bar?
Blame your book? What if you are leaving out something important?
What if \(f^{-1}:Y\to X\) while \(\bar{f}^{-1}:\mathcal P(Y)\to \mathcal P(X)\).
Because that would explain a few things.
Definition 5.3.8 states that we let \(f : X \rightarrow Y\). For each set \(B \in \mathcal P \left({Y}\right),\) define the function \(\bar f^{-1}: \mathcal P \left({Y}\right) \rightarrow \mathcal P \left({X}\right) \) by \(\bar f^{-1}(B) : [ x \in X :f(x) \in B]\)
got it
negation would be we let \(f : X \rightarrow Y\). For each set \(B \in \mathcal P \left({Y}\right),\) define the function \(\bar f^{-1}: \mathcal P \left({Y}\right) \rightarrow \mathcal P \left({X}\right) \) by \(\bar f^{-1}(B) : [ x \notin X :f(x) \notin B]\)
Wait, so \(\bar{f}^{-1}\) is the compliment?
You are confusing me.
argh hhhsdafdslksdjfl;ajflsd;kdslkafjsdl;kfjsdlk I don't know what the heck is going on...
lol
maybe I'll just submit this coo coo ness and get revision feedback...and do it again.. there are unlimited revisions.
but first revision gets some points back.. second afterwards... nada
I want the truth.
s***
Exercise 5.3.11\\ Let \(f: X \rightarrow Y\) and \(E \subseteq Y\) Prove that \(X \backslash \bar f^{-1}(E) \subseteq \bar f^{-1}(Y \backslash E)\)\\ Definition 5.3.8 states that we let \(f : X \rightarrow Y\). For each set \(B \in \mathcal P \left({Y}\right),\) define the function \(\bar f^{-1}: \mathcal P \left({Y}\right) \rightarrow \mathcal P \left({X}\right) \) by \(\bar f^{-1}(B) : [ x \in X :f(x) \in B]\)\\ By complement definition, \\ \(X \backslash \bar f^{-1}(E) = [x: x \in X, x \notin f^{-1}(E)]\) \\ There are X elements that don't belong in \(f^{-1}(E)]\) and \(f(x) \notin E\).\\ If \(Y\) elements belong in \(f(x)\), then they must belong to \(f^{-1}(x)\). Therefore, \(x \in f^{-1}(Y \setminus E)\)\\
that's what I have. my original question was how do I reword this to make it sound better and I saw what rbauer4 and it's kind of what I want to type just couldn't find the right words.
.__________________. @satellite73 helppppppppp :/
Ok hmmmm
what do you mean by X elements? X is already the domain, how can it be a number?
compliment definition
so the x doesn't belong to the inverse of E and f(x) = E
no, \(X\) is a set, not a number.
the set x doesn't belong to E?
No, it doesn't.
Consider if \(Y = \{0,1\}\) and \(E=\{0\} \subseteq Y\)
so it should be written as set x
Then suppose \(X = \{true,false\}\)
Okay, let's just suppose \(B = \bar{f}^{-1}(E)\).
We want to show \(X\setminus B\subseteq \bar{f}^{-1}(Y\setminus E)\)
yeah but there's compliment defintiions happening twice.
so B is gone and the E is out too X subset bar f^-1(y)
\[ \forall x\quad x\in \bar{f}^{-1}(Y\setminus E) \implies x\in X\setminus B \]
mhm
\[ \forall x\quad f(x)\in Y\setminus E \implies x\in X\setminus B \]
f(x) in Y implies that x belongs to X
We can expand the second set difference
\[ \forall x\quad f(x)\in Y\land f(x)\notin E \implies x\in X\land x\notin B \]
We know \(f(x)\in Y\) and \(x\in X\) are true already.... \[ \forall x \quad f(x)\notin E \implies x\notin B \]
Hmmmm \[ \forall x \quad f(x)\notin E \implies x\notin \bar{f}^{-1}(E) \]
Contrapositive \[ \forall x\quad x\in \bar{f}^{-1}(E)\implies f(x)\in E \]
\[ \forall x\quad f(x)\in E\implies f(x) \in E \]
not going there... ... I really like the one for the y the one rbauer posted
Sure, be prepared to be told to rewrite.
even if I do get it right I still need to revise anyway... happened to my previous assignment.
Just pretend to prove it, lol.
da mn ok so what happens if for all x x belonging to e the inverse of e rather.. then the f(x) belongs to e?
AWWWWW! That means f(x) is in E.
are we proving that something isn't a subset to something... ?
element chase ftw
Let \( f: X \rightarrow Y\) and \( E \subseteq Y\) Prove that \( X \setminus \bar f^{-1}(E) \subseteq \bar f^{-1}(Y \setminus E)\) \[ \begin{array}{lcc} & X \setminus \bar {f}^{-1}(E) &\subseteq& \bar f^{-1}(Y \setminus E) \\ \forall x & x\in \bar f^{-1}(Y \setminus E)&\implies & x\in X \setminus \bar {f}^{-1}(E) \\ \forall x & f(x)\in Y \setminus E&\implies & x\in X \setminus \bar {f}^{-1}(E) \\ \forall x & f(x)\in Y \land f(x)\notin E&\implies & x\in X \land x\notin \bar {f}^{-1}(E) \\ \forall x & f(x)\notin E&\implies & x\notin \bar {f}^{-1}(E) \\ \forall x & x\in \bar {f}^{-1}(E) &\implies & f(x)\in E \\ \forall x & f(x)\in E &\implies & f(x)\in E \\ \end{array} \] This to me is a golden proof.
Join our real-time social learning platform and learn together with your friends!