We start the proof with an auxiliary lemma.
Proof. For the reverse implication we note that if
,
,
has no zero in
and equality (
3) holds then it is clear that the rational function
is a periodic solution of system (
1).
For the direct implication we note that if
is a periodic solution of system (
1) then
for
. Let
. Then
Note that
is irreducible, so there exists a polynomial
so that
Since the highest degree in
y in the left-hand side is 3 and the highest degree in
y in
is 1 we get that the highest degree in
y in
is 2 and so it can be written as
, where
. Comparing the coefficients of
,
,
and
in (
4) we get
From the first relation we get that
. This implies that
is a constant that we denote by
c, that is,
. If
then
. This is not possible and so
. Moreover,
is a periodic solution, then
. From the second relation we get that
and from the fourth relation we obtain
. Substituting them in the third relation we get (
3) and the direct inclusion is proved. □
Assume that Equation (
1) has two rational limit cycles,
and
with
. Denote by
, i.e., the maximum common divisor of the polynomials
and
, and consequently
with
and
. Note that in view of the above observation we must have that
for some
.
Proof. Note that in view of (
6) we have
and so
which gives
that is
Therefore
for some
.
If
then we get
The first factor in (
11) cannot cancel with the second factor of (
11) and this gives a contradiction because
is a polynomial. So, we must have
. Then we make the Euclidean division and we get
where
. Therefore we have
The first factor in (
12) cannot cancel with the second factor of (
12) and this gives a contradiction because
is a polynomial. So, we must have
. Now we write
. Then
Assume first that
is not-square free. Using the affine transformation
with
(if necessary) we can write
where
and
. Moreover,
because
and
are coprime. If we develop
in simple fractions of
x we obtain
where
is a polynomial with
and
for
. Note that
. Integrating, we get
The first exponential factor cannot cancel with any part of the second exponential factor and we get to a contradiction with the fact that
is a polynomial. So,
is square-free. Then we have that
Therefore,
where
is square-free and so
and
are coprime. Hence
and
. From (
10) and (
14) we have
Since
must be a polynomial, it follows that
can be one. Hence,
On the other hand, doing a change of variables of the form
where
, the Abel Equation (
1) becomes
Since
, then
. In what follows we shall work with the Abel Equation (
16).
Repeating the previous computations starting with the Abel Equation (
16) we will arrive to Equation (
15) which now writes
because
and only can be one. This concludes the proof of the lemma. □
Proof of Theorem 2. Assume that Equation (
1) has three rational limit cycles,
and
and
with
. Denote by
,
and
. In view of Lemma 2 we have
for some polynomials
and constants
(we recall that the polynomials
,
in (
18) need not be the same as the ones in (
17). In fact, the polynomial
in Equation (
17) will be
,
and
in formula (
18) (or other polynomials that will appear in the paper) and polynomials
and
in formula (
17) will be
,
and
in formula (
18) (or other forms that will appear along the paper, when appropriate). Hence, we get
and so
We consider two situations.
Case 1. and
are coprime.
Note that from (18) we have that , and then from (19) we getIn particular there exists so that Therefore from (18) we get We consider two subcases.
Subcase
: Assume that
and
are coprime.
Then the maximum common divisor between and is . Indeed, we will show thatare coprime. Note that if is a zero of then we have that but . Moreover, if is a solution of then but . Therefore, using and from (17) and (20) we can write and from and we can write which is not possible because .
Subcase
: Assume that
and
are not coprime.
Writewhere and . ThenWe first note that the maximum common divisor between and is . To do so, we will show that are coprime. If is a zero of then but . Since and are coprime, we get that , and then . Moreover, if then . So and are coprime.
From , , (17) and (20) we get Note that from , , (17) and (20) we have Comparing (21) with (22) we obtain which is not possible because the left-hand side of this equality has less degree than the right-hand side and and (otherwise would be constant a contradiction). In short, Case 1 is not possible.
Case 2. and
are not coprime
We writewith and .We consider two different subcases.
Subcase : . So and .
We also consider two cases
:
. From (7) we have and so . ThenNote that taking we can write From , , (17) and (20) we get and from , , (17) and (20) we obtain We consider two cases: if
then we write where . Integrating we get where κ is the constant of integration. Note that the first factor in (23) cannot cancel with the second factor of (23) and this gives a contradiction because and are polynomials. So, we must have that . Then we introduce the notation Let and write , . Then if is not square-free with an affine change of variables we can write with . Moreover, because and are coprime. Therefore, if we develop in simple fractions of x we obtain where is a polynomial with and for . Note that . Integrating we get where κ is the constant of integration. The first exponential factor cannot cancel with any part of the second exponential factor and we get to a contradiction with the fact that is a polynomial. So, is square-free. Then we have that where is square-free and so and are coprime. Hence and . From (10) and (25) we have Solving this last linear equation we getwhere is the constant of integration. Since must be a polynomial if we write so that and then proceeding as above we get that and must be square-free and thenyielding and . Hence, Note that if then which yields . Since we must haveand sowhich is not possible. In short, and Doing the rescaling , we can assume that the constant .
Note that and are coprime. Indeed it follows from (27) that if is such that then (since ) we getand so but then again from (27) we would have and which is not possible. So, and are coprime. Then, it follows from Note that and are coprime. Indeed it follows from (27) that if is such that then (since ) we getand so but then again from (27) we would have and which is not possible. So, and are coprime. Then, it follows from the first and third relation in (28) (using (26)) impliesand from the second and third relation in (28) that However, then it follows from (29) and (30) that that is , which is not possible. In short this case is not possible.
:
. Since we have and . From (19) we getand soSince we get . In short We consider two cases:
:
and
are coprime
. In this case the maximum common divisor between and is and so from (17) we getand sothat iswhich is not possible because the left-hand side of the above expression has less degree than the right-hand side and and .:
and
are not coprime
. In this case we writewith with . ThenThis is not possible because the left hand side has less degree than the right hand side and . In summary, Subcase is not possible.
Subcase
:
. We have and . ThenIn particular there exists so thatand sowhich yields . Therefore, from in (7) we getand so We consider two cases.
:
and
are coprime
. We haveand sowhich yieldsThis is not possible because the right hand side has less degree than the left hand side and .
:
and
are not coprime
. We writewhere with . Note thatThis is not possible because the right hand side has less degree than the left hand side and . So subcase is not possible.
In short we have proved that there are at most two rational limit cycles when . This completes the proof of the theorem. □
Now we provide an Abel Equation (
1) with two rational limit cycles. Take