That there's a hyperplane $H=\{x\in E:f(x)=\alpha\}$ such that $f(x)\leq\alpha$ for all $x\in A$ and $f(x)\geq\alpha$ for all $x\in B$ if $H$ separates $A$ and $B$.
@Semiclassical is the plan for this question to deduce which identity can be found first to quickly reduce it to 2 characters and then it becomes clearer?
For this question, start with Kenyu being a spy first since the other 2 lead to contradictions. Leaving knave and a knight , we can't let Dueet be a Knave as he would mean he's a spy but he's not...
@TedShifrin Brezis doesn't require it to be continuous in general (but he proves that the hyperplane is closed iff the functional is continuous and always talks about separation by closed hyperplanes of course)
Problem: Let $\{a_n\}$ be some real sequence, and let $s_n := \sum_{k=1}^n a_n$. If $s_{2n}$ and $s_{2n+1}$ converge to the same number, $s_n$ converges. Proof: Given $\epsilon > 0$, we can choose $N \in \Bbb{N}$ such that $|s_{2n}-s| < \epsilon$ and $|s_{2n+1}-s| < \epsilon$ for all $n \ge N$. We want to show that $|s_k - s| < \epsilon$ for all $k \ge N$....Here's where I run into trouble...If $k$ is even, then $k=2n$ for some $n \in \Bbb{N}$; but that doesn't necessarily mean $n \ge N$...
@TedShifrin I don't understand. That's the index I am using to show that $s_n$ converges to $s$; the one I get from the fact that $s_{2n}$ and $s_{2n+1}$ converge to $s$.
Now, we only showed that there exist a hyperplane that doesn't separate them. That wasn't the question. Right? It was to show that there was no hyperplane that separates at all.
That's overkill in the last two problems, since you could deduce it just based on one row (e.g. knight first in the first problem). but it's a good way to organize your info in such deduction problems
@Semiclassical that was what I am about to ask, somehow when proving theorems when u contradict u often the one side and u r forced to deem that side as correct. For this you can stand on the fence and not make a remark rather than say a statement is true or false ...
One way to look at is this problem: Given the premises that have been stated, which (if any) of the statements must be true? You're not concerned about whether they must be false, only whether they could be false.
@Semiclassical so an argument can feel correct, but is not actually correct. Whereas in proofs we are really defining the truth value of the statement as a whole?
Any child loves santa, and therefore any child loves any reindeer. In particular, that child loves Rudolph, who has a red nose (and isn't a clown) and therefore is weird.