Advanced Search
All Posts : Applications, Examples and Libraries

Acceptable Maple solution?

vv 11935 Maple
April 07 2016
0

In a recent post, the following inequality was proved with Maple:



(a,b,c,d >= 0).

Here is another direct proof attempt.

f:=(a+b+c+d)^2*(a*b+a*c+a*d+b*c+b*d+c*d)^2-144*(a^2+b^2+c^2+d^2)*a*b*c*d:
g:=expand(eval(f,d=1)):
s:=minimize(g, [a=0..infinity,b=0..infinity,c=0..infinity]):
length(s);   # huge
        304856
map(evalf@evalf[500],s);

map(evalf@evalf[1000],s);


So, Maple returns the expression

min(0,r1,r2,r3)

where r1,r2,r3 are huge expressions containing RootOfs. In order to evaluate them, several hundreds of digits are needed.
The solution seems to be correct, but the question is: may we (mathematically) accept it? What do you think?

 

Please Wait...