Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #11596 > unrolled thread

Re: Command Possible?

Started byRalph Dratman <ralph.dratman@gmail.com>
First post2012-09-03 07:01 +0000
Last post2012-09-06 08:13 +0000
Articles 2 — 2 participants

Back to article view | Back to comp.soft-sys.math.mathematica

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.


Contents

  Re: Command Possible? Ralph Dratman <ralph.dratman@gmail.com> - 2012-09-03 07:01 +0000
    Re: Command Possible? magma <maderri2@gmail.com> - 2012-09-06 08:13 +0000

#11596 — Re: Command Possible?

FromRalph Dratman <ralph.dratman@gmail.com>
Date2012-09-03 07:01 +0000
SubjectRe: Command Possible?
Message-ID<k21kjc$9vs$1@smc.vnet.net>
It always seems to me that everything depends on what sort of proof you
want. Mathematica doubtless knows how to classify the square root of a
non-square integer as irrational, but I very much doubt it uses anything
like the kind of logic people prefer to associate with elementary proofs of
important ideas.

Mathematica presumably takes advantage of a large number of accepted
theorems. So the proof that the square root of 2 is irrational would likely
amount to the use of a method which has, at some point in the past,
directly or indirectly, been proved to properly classify various kinds of
numbers as rational or irrational, as well as algebraic, transcendental,
algorithmic or whatever other categories might be relevant to a particular
task.

I have read that Russell and Whitehead's Principia Mathematica occupies
itself for a thousand pages to prove that 1+1=2 (see, eg.,
http://blog.plover.com/math/PM.html). Few people want to see a proof at
that level of detail. Published proofs rely on the Peano axioms and some
well-studied results to which they lead. Yet apparently it is not possible
to prove that the axioms are consistent. That does not represent any sort
of practical problem, but it supports the notion that in proving things,
you have to decide where to call a halt.

Doing so involves a set of aesthetic choices. You say you just want a
proof, but actually you are asking the computer (or rather, the programmer)
to produce a kind of artwork. The results are likely to disappoint.

Ralph Dratman



On Sat, Sep 1, 2012 at 2:28 AM, amzoti <amzoti@gmail.com> wrote:

> Hello,
>
> I have always been curious if Mathematica has ever considered a Prove
> command?
>
> The reason one could ask such is question is simple, who would have ever
> thought that CASs would get to where they are in such a relatively short
> period of time.
>
> Certainly, this is a tall order, but the richness we already see in
> Mathematica leads one to believe that this can be a new area for CAS
> development.
>
> Some easy examples could be Prove[ Sqrt[2], Irrational], Prove[ Exp[x],
> Transcendental], Prove[Sum[i, {i, 1, n}]== n(n+1)/2]...
>
> Certainly, there would be many limitations with proofs in some branches of
> Mathematics. I suppose getting to meatier proofs is problematic in itself,
> but maybe a certain rigor in defining the problem can be mapped out that
> follows how we set problems up today (as there is a pretty consistent way
> to specifying problems that most mathematicians adhere to).
>
> Anyway, why has this not been attempted (as a comparison, I have seen like
> DC Proof)? In the end, maybe it is just not a goal for a CAS.
>
> Thanks for your time.
>
>
>

[toc] | [next] | [standalone]


#11628

Frommagma <maderri2@gmail.com>
Date2012-09-06 08:13 +0000
Message-ID<k29m00$a8c$1@smc.vnet.net>
In reply to#11596
> I have read that Russell and Whitehead's Principia Mathematica occupies
> itself for a thousand pages to prove that 1+1=2 (see, eg.,http://blog.plover.com/math/PM.html).

Pfew.. that nothing! Stephen Wolfram in 2002 published a 1300 page
tome "A new kind of science" trying to prove...hem...what was it that
he tried to prove? :-)

I am joking of course! The NKS book is fantastic and well worth
studying. You can now read it online for free, but I still enjoy my
splendidly crafted printed version.

Also, the Principia is indeed a large 3 volume opus, but the 1+1=2
proof is relatively short as you can see here:

http://en.wikipedia.org/wiki/Principia_Mathematica#Quotations

The proof in Theorema that 1+1=2 is fully automatic (once you write
the axioms of arithmetic), is short and quite readable.

[toc] | [prev] | [standalone]


Back to top | Article view | comp.soft-sys.math.mathematica


csiph-web