MathGroup Archive 2005

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

Search the Archive

Re: Bug in Reduce?


Kennedy wrote:

>The source of this apparent bug could be my misunderstanding of the middle, 
>"vars" parameter of Reduce, but it sure seems like the following output 
>indicates that  c  must be  0  for my two equations to be satisfied, when in 
>fact if  a  and  b  are both  0,  c  does not need to be  0.
>
>Regards,
>Jack
>
>In[1]:=
>Reduce[{a c - b d == 0, a d + b c == 0}, {a, b, c, d}, Reals] // 
>FullSimplify
>
>Out[1]=
>c == 0 && (d == 0 || (a == 0 && b == 0))
>
>(version 5.1 for Windows) 
>
>  
>
I get a more richer solution when I used assumptions (c notequal 0) and 
simplify
Clear[a, b, c, d]
expr1 = {a*c - b*d == 0, a*d + b*c == 0}
$Assumptions = {c � 0, a ϵ
Reals, b ϵ Reals, cϵ Reals, d ϵ Reals, c ϵ Reals}
s1 = Reduce[expr1, {a, b, c, d}] // Simplify

 >>(a == 0 && (b == 0 || (c == 0 && d == 0))) || ((b*c)/a + d == 0 && a 
!= 0 && (b == (-I)*a || b == I*a)) ||
(c == 0 && d == 0 && a^2 + b^2 != 0)

Hope this helps

If there are some ineligible characters those are meant to be element 
Esc Shift+1=Esc

-- 
Pratik Desai
Graduate Student
UMBC
Department of Mechanical Engineering
Phone: 410 455 8134



  • Prev by Date: Re: Complete solution to a modular System of equations
  • Next by Date: Re: Complete solution to a modular System of equations
  • Previous by thread: Re: Bug in Reduce?
  • Next by thread: Re: Simplify and Noncommutativity