15
$\begingroup$

Is it mathematically acceptable to use Prove if $n^2$ is even, then $n$ is even. to conclude since 2 is even then $\sqrt 2$ is even? Further more using that result to also conclude that $\sqrt [n]{2}$ is even for all n?

Similar argument for odd numbers should give $\sqrt[n]{k}$ is even or odd when k is even odd.

My question is does any of above has been considered under a more formal subject or it is a correct/nonsensical observation ?

$\endgroup$
8
  • 12
    $\begingroup$ I interpret this question as stating "Could I extend the notion of even number to $\sqrt 2$ and moreover any real number $x$ such that $x^2\in\mathbb Z$ and $2\mid x^2$?" Could you confirm whether this interpretation is correct? I have not found any contradictions in defining this rather useless extension. $\endgroup$ Commented Jun 6, 2013 at 12:29
  • 3
    $\begingroup$ @Arjang: It would seem more natural that you edit your own question yourself. $\endgroup$ Commented Jun 6, 2013 at 13:57
  • 9
    $\begingroup$ I vote against closing this question. $\endgroup$
    – MJD
    Commented Jun 6, 2013 at 15:02
  • 12
    $\begingroup$ If you define even as not an odd integer then $\sqrt{\text{bicycle} + \text{fish}}$ is also even. $\endgroup$
    – Kaz
    Commented Jun 7, 2013 at 4:48
  • 2
    $\begingroup$ @Kaz : I just realised that is the problem with defining things as not something! With the same definition $\sqrt {bicycle+fish}$ is also odd because it is NOT even, hence when something is both even and odd it does not fit with the idea of mutually exclusive equivalence classes. $\endgroup$
    – jimjim
    Commented Jun 9, 2013 at 10:25

4 Answers 4

26
$\begingroup$

Yes, essentially analogous arguments work to extend the notion of parity from the ring of integers to many rings of algebraic integers such as $\,\Bbb Z[\sqrt[n]{k}].\ $

The key ideas are: one can apply parity arguments in any ring that has $\ \mathbb Z/2\ $ as an image, e.g. the ring of all rationals with odd denominator, or the Gaussian integers $\rm\:\mathbb Z[{\it i}\,],\:$ where the image $\rm\ \mathbb Z[{\it i}\,]/(2,{\it i}-\!1) \cong \mathbb Z/2\ $ yields the natural parity definition that $\rm\ a\!+\!b\,{\it i}\ $ is even iff $\rm\ a\equiv b\ \ (mod\ 2),\ $ i.e. $ $ if $\rm\ a+b\,{\it i}\ $ maps to $\:0\:$ via the above isomorphism, which maps $\rm\ 2\to 0,\ i\to 1\:$.

Generally, it is easy to show that if $\rm\:2\nmid f(x)\in \Bbb Z[x]\setminus \Bbb Z\:$ then the number of ways to define parity in the ring $\rm\ \mathbb Z[w] \cong \mathbb Z[x]/(f(x))\ $ is given by the number of roots of $\rm\: f(x)\: $ modulo $2\:.\ $ For suppose there exists a homomorphism $\rm\ h\, :\, \mathbb Z[w]\to \mathbb Z/2.\:$ Then $\rm\:w\:$ must map to a root of $\rm\:f(x)\:$ in $\rm\ \mathbb Z/2.\ $ Thus if $\rm\ f(0)\equiv 0\ (mod\ 2)\ $ then $\rm\: \mathbb Z[w]/(2,w) \cong \mathbb Z[x]/(2,x,f(x)) \cong \mathbb Z/2\ $ by $\rm\: x\mid f(x)\ (mod\ 2),\, $ and $\rm\, \!f(1)\equiv 0\ (mod\ 2) $ $\Rightarrow$ $\rm \mathbb Z[w]/(2,w\!-\!1) \cong \mathbb Z[x]/(2,x\!-\!1,f(x)) \cong \mathbb Z/2\, $ by $\rm\, x\!-\!1\,|\, f(x)\ (mod\ 2). $

Let's consider some simple examples. Since $\rm\ x^2\!+1\ $ has the unique root $\rm\ x\equiv 1\ (mod\ 2),\:$ the Gaussian integers $\rm\ \mathbb Z[{\it i}\,]\cong \mathbb Z[x]/(x^2\!+1)\ $ have a unique definition of parity, with $\:i\:$ being odd. Since $\rm\ x^2\!+x+1\ $ has no roots modulo $\: 2,\: $ there is no way to define parity for the Eisenstein integers $\rm\ \mathbb Z[w] \cong \mathbb Z[x]/(x^2\!+x+1).\, $ Indeed since $\rm\ w^3 = 1\ $ we infer that $\rm\: w \equiv 1\ (mod\ 2)\ $ contra $\rm\ w^2\!+w+1 = 0.\ $ On the other hand $\rm\ \mathbb Z[w] \cong \mathbb Z[x]/(x^2\!+x+2)\ $ has two parity structures since both $\:0\:$ and $\rm\:1\:$ are roots of $\rm\ x^2\! + x + 2\ $ modul0 $\rm\:2,\:$ so we can define $\rm\:w\:$ to be either even or odd.

$\endgroup$
15
$\begingroup$

Note that that theorem begins with "Suppose $n$ is an integer, and that $n^2$ is even." So it does not hold when considering $\sqrt{2}$

$\endgroup$
4
  • 2
    $\begingroup$ Please consider the comment of user1. $\endgroup$
    – jimjim
    Commented Jun 6, 2013 at 12:45
  • 4
    $\begingroup$ @Arjang -- That comment may explain your intent. What it does not explain is how you could prove $even(n^2) \implies even(n)$ without the stipulation that n is an integer. If you can only prove this for the case where n is an integer, then, yes, you can extend the definition of even, but, no, the usual definition of even does not apply to $\sqrt 2$. When you extend the definition, you are changing the language and anything which comprises the extended definition becomes an axiom of your new system, whether useful or not. $\endgroup$ Commented Jun 6, 2013 at 18:08
  • 1
    $\begingroup$ ...what Arjang said. $\endgroup$
    – Lucas
    Commented Jun 6, 2013 at 23:16
  • 4
    $\begingroup$ I haven't commented yet since Heath pretty much summed it up. Yes, there are various branches of mathematics in which similar theorems hold and $x^2$ is $P$ implies $x$ is $P$ (the algebraic integers for example) but in my opinion, this is far removed from the ideas of even and odd, which have very specific definitions based on the divides property. The OP asked if $\sqrt{2}$ was even and if you could show it using the stated theorem, to which the answer is a flat out no for the reason stated. Yes, there is plenty of interesting mathematics out there to consider, but I find that unrelated. $\endgroup$
    – john
    Commented Jun 8, 2013 at 2:33
15
$\begingroup$

Other answerers are answering several slightly different interpretations of your question; but taking literally what you asked,

Is it mathematically acceptable to use “Prove if $n^2$ is even, then $n$ is even.” to conclude since 2 is even then $\sqrt 2$ is even?

the answer is a quite interesting “no, but also yes”.

Formally, the answer is definitely no: as @john explained, you can’t use that theorem to conclude what you suggest, since the theorem and proof start by assuming that n is an integer, so $\sqrt{2}$ is not a valid value for $n$.

However, it is excellent and very acceptable mathematical practice to do what you did, and take that theorem as inspiration for considering a new generalisation of the concepts involved. And, as @KeyIdeas describes, this can lead to some very nice theories.

TL;DR: you can’t conclude this from that theorem/proof, but you can certainly be inspired along these lines by them.

$\endgroup$
7
$\begingroup$

The question you linked to starts (quite naturally) with "Suppose $n$ is an integer", which clearly excludes taking $n=\sqrt 2$. Therefore it cannot be used to conclude that $\sqrt2$ is even. Obviously $\sqrt2$ being even is absurd since even numbers in particular have to be integers. I would say your "observation" is sloppy (overlooking the stated conditions) and your following reasoning unfounded (or nonsensical if you prefer).

$\endgroup$
2
  • 1
    $\begingroup$ Please consider the comment of user1. $\endgroup$
    – jimjim
    Commented Jun 6, 2013 at 12:46
  • 1
    $\begingroup$ ...what Arjang said. $\endgroup$
    – Lucas
    Commented Jun 6, 2013 at 23:15

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .