Quantifiers solution writing

56 Views Asked by At

For a problem such as:$$\forall k\in\mathbb{N},\exists j\in \mathbb{Z},k=j+1.$$I can immediately see that this is false as it does not hold for all $k$, for instance when $j=-10$, $k$ becomes negative and that is not a natural number. However how do I write like a proper explanation on my answers if this was to be answered in an exam?

1

There are 1 best solutions below

0
On BEST ANSWER

Lets assume $k \in \mathbb{N}$. We know that $\forall k \in \mathbb{N}, k - 1 \in \mathbb{Z}$, so:

Take $j = k - 1$

$$ k = j + 1 \iff k = (k-1) + 1 \iff k = k - 1 + 1 \iff k = k $$


By induction (seems overkill though), take $j = k - 1 \in \mathbb{Z}$.

Base case, $k=0$:

$$ 0 = (0 - 1) + 1 \iff 0 = 0 $$

Inductive step:

Assuming $k = n$, and that $n = (n - 1) + 1$ holds, we want to check if $n + 1 = ((n+1) -1) + 1$ holds

$$ n + 1 = ((n+1) -1) + 1 \iff n + 1 = (n + 1 -1) + 1 \iff n + 1 = n + 1 $$

Since both the base case and the inductive step are true, then the original statement holds for every natural number $k$.