How do we formalize the following:For all natural Nos :

  • Thread starter Thread starter solakis
  • Start date Start date
  • Tags Tags
    Natural
solakis
Messages
19
Reaction score
0
How do we formalize the following:

For all natural Nos : n^2 is even\Rightarrow n is even
 
Physics news on Phys.org


Here's one way:

(\forall n \in \mathbb{N})[((\exists p \in \mathbb{N})[n^2=2p])\Rightarrow((\exists q\in \mathbb{N})[n=2q])].

Here's another:

\left \{ n \in \mathbb{N} \; | \; (\exists p \in \mathbb{N})[n^2 = 2p] \right \} \subseteq \left \{ n \in \mathbb{N} \; | \; (\exists q \in \mathbb{N})[n=2q] \right \}.

The symbol \mathbb{N}, like the name "the natural numbers", is ambiguous, so you might want to specify whether you mean the positive integers, \mathbb{N}_1=\mathbb{Z}_+ = \left \{ 1,2,3,... \right \}, or the non-negative integers, \mathbb{N}_0 =\mathbb{Z}_+ \cup \left \{ 0 \right \}=0,1,2,3,....
 


Rasalhague said:
Here's one way:

(\forall n \in \mathbb{N})[((\exists p \in \mathbb{N})[n^2=2p])\Rightarrow((\exists q\in \mathbb{N})[n=2q])].

Here's another:

\left \{ n \in \mathbb{N} \; | \; (\exists p \in \mathbb{N})[n^2 = 2p] \right \} \subseteq \left \{ n \in \mathbb{N} \; | \; (\exists q \in \mathbb{N})[n=2q] \right \}.

The symbol \mathbb{N}, like the name "the natural numbers", is ambiguous, so you might want to specify whether you mean the positive integers, \mathbb{N}_1=\mathbb{Z}_+ = \left \{ 1,2,3,... \right \}, or the non-negative integers, \mathbb{N}_0 =\mathbb{Z}_+ \cup \left \{ 0 \right \}=0,1,2,3,....


Thank you ,i think the first formula is the more suitable to use in formalized mathematics.

The question now is how do we prove this formula in formalized mathematics
 


1. \enspace (\exists p \in \mathbb{N}_0)[n^2 = 2p]

\Rightarrow ((\exists a \in \mathbb{N}_0)[n=2a]) \vee ((\exists b \in \mathbb{N}_0)[n=2b+1]).

2. \enspace (\exists b \in \mathbb{N}_0)[n=2b+1])

\Rightarrow (\exists q \in \mathbb{N}_0)[n^2=(2b+1)^2=4b^2+4b+1=2q+1]

\Rightarrow \neg (\exists p \in \mathbb{N}_0)[n^2 = 2p].

3. \enspace\therefore ((\exists p \in \mathbb{N}_0)[n^2 = 2p]) \Rightarrow (\exists a \in \mathbb{N}_0)[n=2a] \enspace\enspace \blacksquare

Or, to see the argument clearer, let A = (\exists a \in \mathbb{N}_0)[n=2a] and let B = (\exists b \in \mathbb{N}_0)[n=2b+1], and suppose (\exists p \in \mathbb{N}_0)[n^2 = 2p]. Then A \vee B. But \neg B. So A.
 


Rasalhague said:
1. \enspace (\exists p \in \mathbb{N}_0)[n^2 = 2p]

\Rightarrow ((\exists a \in \mathbb{N}_0)[n=2a]) \vee ((\exists b \in \mathbb{N}_0)[n=2b+1]).

2. \enspace (\exists b \in \mathbb{N}_0)[n=2b+1])

\Rightarrow (\exists q \in \mathbb{N}_0)[n^2=(2b+1)^2=4b^2+4b+1=2q+1]

\Rightarrow \neg (\exists p \in \mathbb{N}_0)[n^2 = 2p].

3. \enspace\therefore ((\exists p \in \mathbb{N}_0)[n^2 = 2p]) \Rightarrow (\exists a \in \mathbb{N}_0)[n=2a] \enspace\enspace \blacksquare

Or, to see the argument clearer, let A = (\exists a \in \mathbb{N}_0)[n=2a] and let B = (\exists b \in \mathbb{N}_0)[n=2b+1], and suppose (\exists p \in \mathbb{N}_0)[n^2 = 2p]. Then A \vee B. But \neg B. So A.

I think to change the variables inside the existential quantifier without dropping it first it is not allowed by logic.

Also it becomes confusing and impossible to follow.

I also wander is necessarily a formalized proof also a formal one??

Or to put in a better way is it possible to have a proof like the one above ,where one uses only formulas , without mentioning the laws of logic and the theorems upon which these laws act to give us the formalized conclusions of the above proof??
 


Simple answer: I don't know. I'm curious. I hope someone better informed can give say more about this. Seems like it would at least be a good idea to make explicit which statements and which rules of inference are used in each line; so, we could append to the final line: / 1,2,DS. (Disjunctive syllogism.) I could be mistaken but here is what looks like an example of someone using formal and formalized as synonyms: http://arxiv.org/abs/math/0410224

A problem with my proof as it stands: a full, formal proof would have to justify the assumption that natural numbers are odd or even but not both.

I don't see what the problem is with substitution. Maybe you could elaborate?
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Back
Top