Mathematica Stack Exchange is a question and answer site for users of Mathematica. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Since the emphasis of this question is on finding a workaround, I decided to post this question with an emphasis on the explanation of the behavior of Mathematica.

The Bessel function satisfies the following identity:

$$J_{-n}(z)=(-1)^n J_n(z),\qquad n\in\mathbb Z$$


In[2]:= FullSimplify[(-1)^n*BesselJ[n, z] == BesselJ[-n, z], n ∈ Integers]
Out[2]= True


In[3]:= FullSimplify[(-1)^n*BesselJ[n, z] - BesselJ[-n, z], n ∈ Integers]
Out[3]= -BesselJ[-n, z] + (-1)^n BesselJ[n, z]    (*result expected : 0*)

doesn't work as expected.

Some workarounds were suggested in the previous question, such as using ToString as the ComplexityFunction (in this answer):

FullSimplify[(-1)^n*BesselJ[n, z] - BesselJ[-n, z],  n ∈ Integers, 
             ComplexityFunction -> (StringLength @ ToString @ # &)]

My question is: Why FullSimplify with no specified option value for ComplexityFunction (thus using the default LeafCount) doesn't simplify $J_{-n}(z) - (-1)^n J_n(z)$ to zero (with $n\in\mathbb Z$)?

share|improve this question
up vote 2 down vote accepted

The problem is that though FullSimplify does its best to find as simple form as possible in a reasonable time, it's not smart enough to handle all possible cases (and, actually, that would be an undecidable problem in general).

But your indentity seems to be well-known and compelling, so I would recommend to send it as a suggestion to

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.