MathGroup Archive 2009

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Simplifying and Rearranging Expressions

  • To: mathgroup at
  • Subject: [mg96031] Re: Simplifying and Rearranging Expressions
  • From: David Bailey <dave at>
  • Date: Mon, 2 Feb 2009 06:20:34 -0500 (EST)
  • References: <gls1u8$hjl$> <gm3rah$mga$>

John Doty wrote:
> David Park wrote:
>> Nevertheless, even simple rearrangement can be difficult. I sometimes think
>> of it as doing surgery on expressions. I believe it is generally desirable
>> to use Mathematica to rearrange an expression and not retype the expression.
>> Retyping is too error prone.
> In most cases, any description of how to rearrange an expression to a 
> specific form in a CAS will be more complex than a retyped expression. I 
> believe this is a theorem.
> Therefore, in most cases, the easiest way will be to retype. It's not 
> error prone if you check it, e.g.:
> Simplify[ retyped == original ]
Testing successive transformations in this way is useful, but not all 
transformations are exact. Particularly in physics, it is common to take 
a Taylor expansion of part of an expression, or maybe even change 
notation is some subtle way.

David Bailey

  • Prev by Date: Re: Printing (v7)
  • Next by Date: Re: GraphPlot and Feynman graphs
  • Previous by thread: Re: Simplifying and Rearranging Expressions
  • Next by thread: Re: Re: Simplifying and Rearranging Expressions