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


Groups > comp.soft-sys.math.mathematica > #5479

Re: Re: simplification

From Andrzej Kozlowski <akoz@mimuw.edu.pl>
Newsgroups comp.soft-sys.math.mathematica
Subject Re: Re: simplification
Date 2011-10-07 08:54 +0000
Organization Steven M. Christensen and Associates, Inc and MathTensor, Inc.
Message-ID <j6menj$7e1$1@smc.vnet.net> (permalink)
References <j6e693$kef$1@smc.vnet.net> <201110050801.EAA07025@smc.vnet.net>

Show all headers | View raw


On 5 Oct 2011, at 10:01, Peter Pein wrote:

> Am 04.10.2011 07:40, schrieb dimitris:
>> Hello.
>>
>> Let
>>
>> o1 = 1 + Sqrt[15 + 2*Sqrt[35] + 2*Sqrt[6*(6 + Sqrt[35])]];
>> o2 = 1 + Sqrt[3] + Sqrt[5] + Sqrt[7];
>>
>> o1 is equal to o2.
>>
>> o1 == o2 // FullSimplify
>> True
>>
>> The question is how to make Mathematica to simplify o1 to o2.
>>
>> Thanks
>> Dimitris
>>
>
> With a lot of luck:
>
> In[1]:= o1 = 1 + Sqrt[15 + 2*Sqrt[35] + 2*Sqrt[6*(6 + Sqrt[35])]];
>  ext = Block[{x, poly = RootReduce[o1][[1]]},
>   Sqrt[Cases[Union @@ Divisors[Abs[CoefficientList[poly[x], x]]],
>     1 | _?PrimeQ, 1]]]
>  o2 = ((Rest[#1] / First[#1]) . ext & )[
>        FindIntegerNullVector[Prepend[ext, -o1]]]
>
> Out[3]= {1, Sqrt[2], Sqrt[3], Sqrt[5], Sqrt[7], Sqrt[19], Sqrt[31]}
>
> Out[4]= 1 + Sqrt[3] + Sqrt[5] + Sqrt[7]
>
> :-)
>

Neat, but from the Mathematical point of view the question was posed 
"the wrong way round" in that o1 is mathematically "simpler" than 1 + 
Sqrt[3] + Sqrt[5] + Sqrt[7], since it is already expressed in terms of 
its minimal polynomial. Hence this is the "natural" or "easy" way to go:

ToRadicals[RootReduce[1 + Sqrt[3] + Sqrt[5] + Sqrt[7]]]

1 + Sqrt[15 + 2*Sqrt[35] + 2*Sqrt[6*(6 + Sqrt[35])]]

in other words, the algebraic "simplification" in this case is exactly 
the opposite of, what might be called, the visual one.


There is no natural or unique way to "decompose" algebraic numbers that 
are already reduced into sums etc, of "simpler" summands or factors etc. 
Of course, if we already know an integer basis for an algebraic number 
field containing an algebraic number, than there are ways of expressing 
it in terms of this basis - and this method is an example.

Andrzej Kozlowski




Back to comp.soft-sys.math.mathematica | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

simplification dimitris <dimmechan@yahoo.com> - 2011-10-04 05:40 +0000
  Re: simplification "Dr. Wolfgang Hintze" <weh@snafu.de> - 2011-10-05 08:01 +0000
  Re: simplification Peter Pein <petsie@dordos.net> - 2011-10-05 08:10 +0000
    Re: simplification "Dr. Wolfgang Hintze" <weh@snafu.de> - 2011-10-06 08:42 +0000
  Re:  Re: simplification DrMajorBob <btreat1@austin.rr.com> - 2011-10-06 08:30 +0000
  Re:  Re: simplification Andrzej Kozlowski <akoz@mimuw.edu.pl> - 2011-10-07 08:54 +0000
  Re:  Re: simplification Andrzej Kozlowski <akoz@mimuw.edu.pl> - 2011-10-07 09:03 +0000
  Re:  Re: simplification Andrzej Kozlowski <akoz@mimuw.edu.pl> - 2011-10-07 09:06 +0000
  Re: find two numbers a,b, such that a+b=5432 & LCM[a,b]=223020 Andrzej Kozlowski <akoz@mimuw.edu.pl> - 2011-10-16 20:47 +0000
  Re: find two numbers a,b, such that a+b=5432 & LCM[a,b]=223020 "Harvey P. Dale" <hpd1@nyu.edu> - 2011-10-17 12:10 +0000
  Re: find two numbers a,b, such that a+b=5432 & LCM[a,b]=223020 Andrzej Kozlowski <akoz@mimuw.edu.pl> - 2011-10-17 12:12 +0000
  Re: find two numbers a,b, such that a+b=5432 & LCM[a,b]=223020 Andrzej Kozlowski <akoz@mimuw.edu.pl> - 2011-10-18 11:40 +0000

csiph-web