News for hackers. Stuff that matters.
Re:Math Bite: Irrationality of √m (1999) by contravariant on Wednesday December 23, 2015 @09:36AM (#10783454)
>> The really interesting thing about this proof is that it doesn't use divisibility, just mathematical induction in its "Z is well-ordered" form.

>That's quite a bold statement. It would mean that this proof should generalize to other well-ordered sets that do not provide any notion of divisibility.

It doesn't, for the somewhat obvious reason that divisibility makes sense in any set that has a notion of 'multiplication'. The proof itself doesn't use any statements of the form 'x is divisible by y' though, not even implicitly as far as I can tell.

Even fraction laws don't really count as 'using' divisibility. Since fractions can be defined in a way that doesn't directly use divisibility (although the concepts are obviously related).

Being well ordered is a far more restrictive property than 'having a notion of divisibility'.

> Moreover, these fractions are not even fractions in Z, but in R, or at least in Z[sqrt(m)]. So there's still a lot of specialized structure involved in this proof.

According to the proof the fractions are in Q not R.

Re:Math Bite: Irrationality of √m (1999) by vog on Wednesday December 23, 2015 @05:42PM (#10786097)
> According to the proof the fractions are in Q not R.

That's a circular argument. During the proof this is not given, only after the proof.

Re:Math Bite: Irrationality of √m (1999) by contravariant on Wednesday December 23, 2015 @06:19PM (#10786245)
During the proof it is assumed, this assumption leads to a contradiction, hence the assumption 'sqrt(m) is in Q' is false.

The reason this is not a circular argument is that they don't assume the thing they're trying to prove, but rather it's negation.

Re:Math Bite: Irrationality of √m (1999) by vog on Thursday December 24, 2015 @07:50AM (#10787999)
You are right. My bad.