A Probabilistic Approach of the Poincaré-Bendixon Problem in Rd

Abstract

We present how a probabilistic model can describe the asymptotic behavior of the iterations, with applications for ODE and approach of the Poincaré- Bendixon’s problem in Rd.

Share and Cite:

Cirier, G. (2022) A Probabilistic Approach of the Poincaré-Bendixon Problem in Rd. Advances in Pure Mathematics, 12, 724-741. doi: 10.4236/apm.2022.1212055.

1. Introduction

Let f a function which applies a set C d in itself. We iterate f indefinitely. Sometimes, the process converges to some fixed point or to some cycle. But, in many cases, it is quite impossible to know, after a long time, the position of the iteration f ( n ) .

One of the best deterministic method to study the asymptotic behavior of the iteration is to linearize f . It consists to find a function φ such as: φ f = λ φ where λ is linear.

When this linearization is possible, φ f ( n ) = λ n φ and we obtain asymptotic cases, which are the generalization of the unidimensional cases | λ | > , = , < 1 . But, we meet some well-known difficulties: the function φ is solution of a functional equation; the basins of attraction around each fixed point of f may have fuzzy frontiers… If λ p = 1 , we have other difficulties called resonance in d . It is often a good approach near each fixed point. But, in many cases, we don’t know to treat mathematically the problem.

So, it seems very important to understand what happens when we iterate f indefinitely, especially if the set C d is bounded when f applies C in itself. In this case, a probabilistic approach with invariant measures gives other information. It is the object of this paper which is the synthesis of a long work: some demonstrations, as the one of the proposition in Section 4.4, can be found in previous articles or book [1].

2. The Perron-Frobenius’s Measure

Let P a measure on a measurable set C d and f a measurable function. We note P f = P f 1 the transform of P by f . We define the f -invariant measure P of Perron-Frobenius as in [2]:

P is invariant under f if, for all borelian set B, P verifies the Perron-Frobeniuss equation (PF):

P f ( B ) = P f 1 ( B ) = P ( B )

This measure P remains invariant when we iterate the measurable function f . Under very general conditions, the solution of this equation is unique.

This measure presents the same difficulties as we have seen with linearization methods for f : we will see that it depends of the fixed points and we meet the resonance’s problems, but it gives us many information about the areas where the iteration belongs more frequently. This information is asymptotic when n but doesn’t give us any result about the transient steps of null measure.

This invariant measure is generally difficult to study. For instance, in the very simple case where f is invertible, its density p verifies the functional equation:

p = p f = | f 1 | p f 1

This is very complicated to solve. If f is not invertible, it is more difficult.

2.1. The Fourier-Laplace’s Transform

Here, we seek an analytic approach of the f -invariant measure with the Fourier-Laplace’s transform. We use the known property of this measure: for all positive P-measurable function g, we have the formula [2]:

g f ( x ) d P ( x ) = g ( x ) d P ( x ) .

For g ( x ) = e y x , we write the Fourier-Laplace’s transform ϕ ( y ) = L ( e y X ) = E ( e y X ) with the series ϕ ( y ) = Σ n b n y n and ϕ f ( y ) = L ( e y f ( X ) ) . If the measure is invariant:

ϕ ( y ) = ϕ f ( y )

Here, y d or d . If y = i t , we have the characteristic function of the measure P.

Hypothesis

All along the paper, we suppose that the set C d is bounded. f applies C in C and f is at least C .

Anymore, the series ϕ ( y ) = Σ n b n y n is convergent because it is bounded by an exponential series with the diameter of C.

We translate the distribution with a small fixed vector a d , X X + a .

So: ϕ ( y , a ) = E ( e y ( X + a ) )

by f -transform: ϕ ( y , a ) ϕ f ( y , a ) = E ( e y f ( X + a ) ) .

If the measure is invariant: ϕ ( y , a ) = ϕ f ( y , a ) .

Proposition:

The resolving equation Ra of PF is: θ f ( y , a ) = ϕ ( y , a ) ϕ f ( y , a ) = 0 .

If f is a C -function, then, for a C and y :

θ f ( y , a ) = Σ n b n n ( e y a e y f ( a ) ) / a n = 0 .

Let e n ( y , a ) = n ( e y a e y f ( a ) ) / a n be the gap of order n:

θ f ( y , a ) = Σ n b n e n ( y , a ) = 0

At a = 0 : θ f ( y ) = Σ n b n e n ( y , 0 ) 0 .

As θ f ( y , a ) 0 is an identity, p q θ f ( y , a ) / y p a q 0 for all p and q.

■ If the random variable X C d has a measure P with density p ( x ) , the translated random variable X + a has the same translated density. Using the convergent series: ϕ ( y ) = Σ n b n y n , we have for all small translation a C d of the random vector X, the translated density:

p ( x a ) = L 1 ( e t a ϕ ( t ) ) = L 1 ( Σ n b n t n e t a ) .

So, we can write p ( x a ) as a distribution in the sense of Schwartz:

p ( x a ) = Σ n b n n δ ( x a ) / a n .

As E ( e y ( X + a ) ) = Σ n b n y n e y a = Σ n b n n e y a / a n .

And E ( e y f ( X + a ) ) = e y f ( x + a ) d P ( x ) = e y f ( x ) p ( x a ) d x

E ( e y f ( X + a ) ) = Σ n b n n ( e y f ( x ) δ ( x a ) d x ) / a n

E ( e y f ( X + a ) ) = Σ n b n n e y f ( a ) / a n .

By difference, we get: θ f ( y , a ) = E ( e y ( X + a ) ) E ( e y f ( X + a ) ) = 0 . ■

Remarks

- We observe that n ( e y f ( a ) ) / a n = H n ( y , a ) e y f ( a ) where H n ( y , a ) is a Bell-polynomial in y with degree n. We can note the gap:

e n ( y , a ) = n ( e y a e y f ( a ) ) / a n = y n e y a H n ( y , a ) e y f ( a )

And: e n ( y , 0 ) = y n H n ( y ) is a polynomial in y with degree n.

- We obtain ϕ f ( y ) by putting H n ( y ) instead of y n in the series of ϕ ( y ) = Σ n b n y n .

- We study the problem near a fixed point 0 of f : f ( 0 ) = 0 , then: ϕ f ( 0 ) = ϕ ( 0 ) = 1 , and: b 0 = 1 . But, the other b n are unknown.

2.2. Consequences

The general solution of the linear equation θ f ( y ) = 0 has the form b φ ( y ) where b is an arbitrary constant real. So, we can write ϕ ( y ) = 1 + b φ ( y ) with the arbitrary constant b. It means that ϕ ( y ) = 1 , for all φ ( y ) = 0 . We have a lattice distribution of probability for φ ( y ) = 0 .

The solution of the Perron-Frobenius’s equation is a particular case of the equation θ f ( y ) = 0 .

First, we show the effect of an iteration on e n ( y , 0 ) = 0 and on θ f ( y , 0 ) = 0 .

Proposition

Iteration a l f l ( a ) acts as a derivation on θ f ( y , 0 ) = 0 and on e n ( y , 0 ) = 0 or on H n ( y , 0 ) = 0 in the sense:

a l f l ( a ) θ f ( y , 0 ) θ f ( y , a ) / a l | a = 0

and e n ( y , 0 ) = 0 e n + 1 l ( y , 0 )

f ( n ) f ( n + 1 ) induces e n ( y , 0 ) e n + 1 ( y , 0 ) or H n ( y , 0 ) H n + 1 ( y , 0 ) .

By induction, all the coordinates of n N d in e n ( y , 0 ) are: n 1 = = n l = = n d .

■ The demonstration in [1] is based on the mean’s formula for a 0 .

For example, we study the impact of a l f l ( a ) on D = θ f ( y , a l ¯ , f l ( a ) ) .

As θ f ( y , a l ¯ , a l ) = 0 :

D = θ f ( y , a l ¯ , f l ( a ) ) θ f ( y , a l ¯ , a l )

So: D = ( f l ( a ) a l ) ( θ f ( y , a l ¯ , a l + r ( ( f l ( a ) a l ) ) ) / a l )

When a 0 f l ( a ) a l ~ a l ( λ l 1 )

D ~ a l ( λ l 1 ) ( θ f ( y , 0 ) / a l )

Then, if we iterate f , that means a f ( a ) , we obtain:

D ~ l = 1 l = d a l ( λ l 1 ) ( θ f ( y , 0 ) / a ) .

If this quantity is null for all a, then θ f ( y , 0 ) / a = 0 . For similar raisons, if e n ( y , a ) = 0 , then: e n ( y , f l ( a ) ) ~ a l ( λ l 1 ) e n ( y , 0 ) / a l . ■

3. Solution of the Resolvent R0

Now, we choose a sufficiently large index n N d , with n = n 1 = = n l = = n d

Lemma

For a fixed b n 0 , under non-resonance conditions, if a solution of θ n ( y ) = Σ m n b m e m ( y ) = 0 exists, the zeros of e n ( y ) are zeros of θ n ( y ) .

■ The solution of this equation is obtained as the following:

We choose a sufficiently large index n N d such as: φ n ( y ) φ ( y ) uniformly.

Then: θ n f ( y ) = Σ m n b m e m ( y ) verifies uniformly:

| θ n f ( y ) θ f ( y ) | < ϵ .

As θ f ( y ) = 0 , we search an approximation θ n ( y ) = 0 , and estimators b m such as we have:

θ n ( y ) = Σ m n b m e m ( y ) = 0 .

- For y = 0 : b 0 = 1 . As θ n ( y ) is a polynomial, the condition θ n ( y ) = 0 implies ether all the coefficients of θ n ( y ) are null or the solution is valid only for the y verifying θ n ( y ) = 0 . But, as the term of highest degree of θ n ( y ) is: ( 1 λ n ) b n y n , we must have, under non-resonance conditions and for all b n 0 , e n ( y ) = 0 . (Because all the other gaps e m ( y ) have a lower total degree for all m < n ).

Then, zeros of e n ( y ) are zeros of θ n ( y ) . ■

Theorem

Under the non-resonance condition, we can find a unique convergent solution of θ n ( y ) = Σ m n b m e m ( y ) = 0 , up to an arbitrary constant b:

ϕ n ( y ) = 1 b e n ( y ) .

We obtain a lattice distribution defined by the zeros of e n ( y ) .

In the repellent case where λ n 1 , we have:

ϕ n ( y ) ~ 1 b H n ( y ) .

Then, the distribution of the real zeros of the polynomials H n ( y ) gives the distribution of the Perron-Frobeniuss measure when n .

We obtain a lattice distribution defined by the zeros of H n ( y ) .

■ We note the polynomials ϕ n ( y ) = 1 + Σ 0 < m n b m y m = 1 + b n φ n ( y ) .

and ϕ f n ( y ) = 1 + Σ 0 < m n b m H m ( y )

So: θ n ( y ) = ϕ n ( y ) ϕ f n ( y ) .

- We search a solution under the condition e n ( y ) = 0 .

1) Now, for all y verifying e n ( y ) = 0 , can we find a solution of θ n ( y ) = 0 ?

For all m < n , we note:

A n 1 ( y ) = Σ m < n b m e m ( y ) = θ n ( y ) b n e n ( y ) .

If θ n ( y ) = 0 : A n 1 ( y ) = Σ m < n b m e m ( y ) = b n e n ( y ) = ( 1 λ n ) b n y n b n Σ 0 < k < n h n k y k

Where all the coefficients of e m ( y ) = y m H m ( y ) are known because H m ( y ) = Σ 0 < k m h m k y k is defined by the coefficients of the Bell’s polynomials.

So, we study in A n 1 ( y ) all the terms of y m with degree m < n :

A n 1 ( y ) = Σ m < n b m ( y m Σ 0 < k m h m k y k ) = b n Σ 0 < k < n h n k y k

for a fixed arbitrarily b n = b n 0 .

2) We obtain a finite triangular system of linear equations: it can be solved step by step and we can identify in a unique way all the unknown coefficients b m in function of the fixed b n and the coefficients h m k of H m ( y ) = Σ 0 < k m h m k y k with m n N d .

3) This solution is unique for all b n = b n 0 arbitrarily fixed, near to the solution of θ f ( y ) = 0 , as the b m converge to the b m . So, we have constructed the polynomials ϕ n ( y ) 1 and ϕ f n ( y ) 1 and we can write ϕ n ( y ) = 1 + b n φ n ( y ) where b n is arbitrary. That means ϕ n ( y ) = 1 when φ n ( y ) = 0 ; then, we can choose now φ n ( y ) = e n ( y ) . ■

Different cases can happen according to λ n 1 or λ n 1 .

If all the coordinates of | λ | are less than 1, the process converges to the fixed point.

If some of them are less than 1, but others are greater than 1, we have a hyperbolic situation under no resonance conditions.

When y n λ n y n , we can write for large n:

ϕ n ( y ) ~ 1 b H n ( y ) . ■

And now we have to study the zeros of H n ( y ) .

Remark (demonstration in [1])

Under the condition that the set C is rectangular, if q ( y ) is the density of real zeros of H n ( y ) when n , then the invariant density p ( x ) of the Perron-Frobenius’s measure is:

p ( x ) = ( x ) q ( x ) / x .

4. Study of the Zeros of H n ( y ) in the Repellent Case

We suppose f is C , without resonance, and C d bounded. The problem is reduced to find the asymptotic distribution of the zeros of H n ( y ) in the repellent case. Here, the distribution of the f -invariant measure P is given in general by the distribution of the real zeros of H n 1 ( y ) when n .

4.1. The Plancherel-Rotach’s Method

We will see soon that all the real zeros of H n ( y ) are distinct when the steepest descent’s method [3] can be applied to H n ( y ) and we get an estimation of the asymptotic distribution of these real zeros.

- First, we use the steepest descent’s method as Plancherel and Rotach do [4]. We recall that the polynomial:

H n 1 ( y ) = e y f ( a ) n e y f ( a ) / a n | a = 0 = n e y f ( a ) / a n | a = 0

can be represented by the Cauchy’s integral:

H n 1 ( y ) = K Γ e y f ( a ) a n d a = K Γ e y f ( a ) n ln a d a

where Γ is a closed polydisk around the fixed point 0 of f , a d , K is a finite non-null function, without importance in the context [3]. We take n = n 1 = n l = n d .

We note the integrand n γ ( a ) = y f ( a ) n ln a

And we call γ ( a ) the Plancherel-Rotachs function.

- Second, with Plancherel and Rotach, we use the steepest descent’s method. We search the critical point of γ ( a ) . Under the numerous conditions of the general position, the critical point a c maximizing e n γ ( a ) gives the solution. The critical point a c is defined by the equation:

n γ ( a ) / a = y f ( a ) / a n / a = 0 .

(A sufficient condition to get this maximum is that the hessian matrix of γ ( a ) , which is Hermitian, is definite negative at a c ). Let s = y / n with s l = y l / n , then:

γ ( a ) / a = s f ( a ) / a 1 / a = 0 .

The critical point must be isolated from the other critical points and at a finite distance. Some coordinates of a c can be real, the others are complex. Then:

H n 1 ( y ) = K ( exp ( γ ( a c ) ) exp ( γ ( a c ¯ ) ) ) .

( a c ¯ is the conjugate of a c ). We notice that K or the real part e ( γ ) of γ ( a ) cannot annul H n 1 ( y ) , but, among the solutions, we have to choose ( γ ) maximum. Then, only the imaginary part m ( γ ) of γ ( a ) can nullify H n 1 ( y ) .

Proposition

Under the conditions of the general position, the critical point a c of the PR-function γ ( a ) gives the real zeros of H n ( y ) . For all complex coordinates a of a c :

n m ( γ ) = m ( y f ( a ) n ln a ) = k π .

As each iteration f l acts as a derivation on H n 1 ( y ) , we see:

n m ( γ l ( a ) ) = m ( s l f l ( a ) ln a l ) = π k l / n .

We obtain asymptotically m ( γ l ( a ) ) π κ l when n .

The k l / n κ l [ 0 , 1 ] have an identic independent uniform distribution on [ 0 , 1 ] .

In the unidimensional case, the repartition of the zeros is:

q ( s ) d s = m ( f ( a ) ) d s / π .

■ We can tie these distributions of the PF-equation to each fixed point f ( 0 ) = 0 . Then, we have local solutions. All these distributions can be masked in various situations. The principle of the maximum of the real part e ( γ ) of γ ( a ) provides a method to define the fuzzy frontiers of the different domains of attraction.

As everybody knows, the steepest descent’s method is difficult to use, but it indicates a very large variety of behaviors [3].

In the case of unidimensional function, the repartition of the zeros verifies:

m ( γ ( a ) ) = κ π with γ / a = 0

So: q ( s ) d s = Prob { 1 zero ( s , s + d s ) } = d κ

q ( s ) d s = m ( d γ / d s ) d s / π = m ( f ( a ) ) d s / π

Because: d γ / d s = γ / s + γ / a a / s = f ( a ) . ■

Remark

If the n l are not equal, we take μ = n 1 + + n l + + n d , and we fix: z l = n l / μ . Then, if y l = n l s l = μ z l s l and n l ln a l = μ z l ln a l , the Plancherel-Rotach’s function is:

μ γ ( a ) = μ Σ l z l ( s l f l ( a ) ln a l ) = μ Σ l z l γ l ( a )

If n = n 1 = = n l = = n d , we have: z l = 1 .

4.2. Real or Imaginary Coordinates of the Solutions

The reality or the imaginary of the coordinates of a c may vary with the orientation of y. The right framework to analyze this question seems to be the Morse’s theory.

4.3. Examples

- Let the logistic map [4]: f ( a ) = λ a a 2 / 2 ; and γ ( a ) = s ( λ a a 2 / 2 ) ln a ;

γ / a = s ( λ a a 2 ) 1 = 0

we put λ s = 2 cos ϑ , we have: 2 cos ϑ a s s a 2 1 = 0 with roots: a s = e ± i ϑ

and: m ( f ( a ) ) = m ( λ a a 2 / 2 ) = sin 2 ϑ / s .

q ( s ) d s = m ( f ( a ) ) d s / π = ( 1 cos 2 ϑ ) d ϑ / π

So: q ( s ) = ( λ / 2 π ) 1 / s λ 2 / 4 .

If we put t = cos ϑ = λ s 2

Then t follows: W ( t ) d t = ( 2 / π ) 1 t 2 d t .

We recover directly a well-known result: Let H n ( y , a ) = n ( e y ( λ a a 2 / 2 ) ) / a n

where e y ( λ a a 2 / 2 ) is (with easy transformations) like the generatrix function e ( 2 t a a 2 ) of the Hermite polynomials H n ( t ) . The law of the zeros of H n ( x ) is known as the semi-circular Wigner’s law: W ( t ) d t = ( 2 / π ) 1 t 2 d t .

- Then, the density of the logistic corresponding to q(s) is:

p ( s ) = s d q / d s = s ( 2 / π ) d ( λ 4 s 1 s λ 2 4 ) / d s

p ( s ) = λ / ( 2 π 4 s s 2 λ 2 ) .

We deduce that the density of the logistic map follows a Beta (1/2, 1/2) low in a more general situation than in the Ulam-Von Neumann’s case [5].

- The map a 1 = λ a + a 2 2 , for λ > 1 . We have neglected this important case in

our previous papers. In general, this iteration tends to infinite. The corresponding Hermite polynomials H n ( x ) are always positive except if x = 0 for the odd index n. It seems that this iteration can serve as a parameter in multidimensional case. So, we will say that “ x = 0 half the time” and arbitrary for even indexes n.

- m-Hermitian case: f ( a ) = λ a a m / m .

The Plancherel-Rotach’s function is: γ ( a ) = s ( λ a a m / m ) ln a .

With the critical point a defined by the trinomial equation:

d γ ( a ) / d a = s ( λ a a m ) 1 = 0

studied by H. Fell.

Consequence

We take now a quadratic function f in d with f ( 0 ) = 0 . We write the PR function γ ( a ) for every fixed point 0 of f ( a ) :

f ( a ) = λ a + Q a 2 / 2

the hessian of sQ is symmetric. For all s such as sQ is non-degenerate, it exists an orthogonal transformation T: a = T u , with: T s Q T = D , the diagonal matrix of eigenvalues of sQ and:

ln a = l = 1 l = d ln a l = ln l = 1 l = d a l = ln Vol ( a ) = ln Vol ( u ) = ln l = 1 l = d u l = ln u = l = 1 l = d ln u l .

Because the volume Vol ( a ) = Vol ( u ) is invariant under an orthogonal transformation.

We note D l = K l 2 if l = 1 , , p and D l = K l 2 / 2 if l = p + 1 , , d .

Then, the P.R. function γ ( a ) becomes:

γ ( u ) = s f ( T u ) ln T u = s λ T u + D u 2 / 2 ln u = l = 1 l = d Λ l u l + l = 1 l = p K l 2 u l 2 / 2 l = p + 1 l = d K l 2 u l 2 / 2 l = 1 l = d ln u l = l = 1 l = p ( Λ l u l + K l 2 u l 2 / 2 ln u l ) + l = p + 1 l = d ( Λ l u l K l 2 / 2 u l 2 ln u l )

where Λ u = s λ T u .

If we note: γ + ( u l ) = Λ l u l + K l 2 u l 2 / 2 ln u l

and γ ( u l ) = Λ l u l K l 2 u l 2 / 2 ln u l

So: γ ( u ) = l = 1 l = p γ + ( u l ) + l = p + 1 l = d γ ( u l ) .

And, applying the logistic calculus to each γ + ( u l ) and γ ( u l ) , we obtain p conditions Λ l u l = 0 half the time and d-p random independent variables following a Beta (1/2, 1/2) low. But, we may have other fixed points: a ( 1 λ ) = Q a 2 .

Remark

- We can extend these results to a C function f with the Morse-Palais Lemma as in [6], (p.174 et seq.), if the hessian is definite.

5. A differential Equation as a Repellent Iteration

We consider ordinary differential equation [1]:

d a / d t = F ( a )

where a C d or d , t + , F ( a ) is a C -application of a C in C. The domain C is supposed bounded. The problem is to find a function a ( t ) verifying this equation with an initial condition: a ( t 0 ) = a 0 .

We use the theorical solution of Caratheodory a ( t ) for t > t 0 :

a ( t ) = a 0 + t 0 t F ( a ( u ) ) d u = a 0 + S ( a 0 , a ( t ) ) .

The differential iteration

We associate the differential iteration f ( a ) belonging in the bounded domain C:

f ( a ) = a + δ F ( a )

where δ = t / n is the path. When we iterate n times, we have:

a n = f ( n ) ( a ( t 0 ) ) .

The method gives the solution a n by iterating n times f ( a ) from a starting point a ( t 0 ) with the path δ = t / n and this solution a n a ( t ) when n :

For n > p : a n = f ( n ) ( a 0 ) = a ( t 0 ) + δ ( p = 0 p = n 1 F ( a p ) ) a n = a ( t 0 ) + δ S n ( a 0 ) .

Then, when n : lim n f ( n ) ( a 0 ) = a ( t ) = a 0 + t 0 t F ( a ( u ) ) d u

with δ S n ( a 0 ) S ( a ( t ) , a 0 ) = t 0 t F ( a ( u ) ) d u .

The fixed points of a differential iteration are the zeros α of F: F ( α ) = 0 .

5.1. The Invariant Measure of a Differential Iteration

Now, we submit a probabilistic version of the Poincaré-Bendixon’s problem in d .

Proposition

Under the previous hypothesis, all the non-null measures verify:

E ( 0 1 y S ( a 0 , X ( t ) ) e y X + v y S ( a 0 X ( t ) ) d v ) = 0 .

Then, we have asymptotic random cycles around each fixed point. For all these cycles, the times of return in each very small borelian set around a point of a cycle are constant in probability. Along each cycle, the conditional probability has a constant density.

■ With f ( a ) = a + δ F ( a ) for every measurable function F. Then, for a n = f ( n ) ( a 0 ) = a ( t 0 ) + δ ( p = 0 p = n 1 F ( a p ) ) with δ = t / n , we must have the resolving equation in the neighborhood each fixed point for one or n iterations:

ϕ ( y ) = E ( e y X ) = E ( e y f ( X ) ) = E ( e y f ( n ) ( X ) ) .

That means, especially for f ( n ) :

θ n f ( y ) = E ( e y X e y f ( n ) ( X ) ) = E ( e y X ( 1 e y δ S n ( a 0 , X ) ) ) = 0

As: δ S n ( a 0 ) t 0 t F ( a ( u ) ) d u = S ( a 0 , a ( t ) ) .

By continuity:

θ n f ( y ) E ( e y X ( 1 e y S ( a 0 , X ( t ) ) ) ) = E ( 0 1 d ( e y X + v y S ( X ( t ) ) ) / d v d v ) = 0

But θ f ( y ) = E ( e y X e y f ( n ) ( X ) ) E ( e y X e y ( X ( t ) ) ) = 0 .

In consequence, if E ( 0 1 ( d ( e y X + v y S ( X ( t ) ) ) / d v ) d v ) = 0 , we have non-null measures verifying θ f ( y ) = 0 , y . In other words, a ( t ) = a ( t 0 ) for the invariant non-null measure and some t 0 . Under this condition, the asymptotic behavior is random periodic cycles with an unknown almost period T = t t 0 .

But, when we have many fixed points, the complete solution is more difficult because we meet some problems with domains of domination (see Section 4) and transitions from a domain of a fixed point to an another. ■

Remarks

- Theoretically, if we know the probability’s measure, we can define some statistics (mean, standard deviation…).

- We can try to extend these results to PDE equations and obtain other new results, as in the following:

Let the PDE: a / u = F ( a )

Where a C d or d , u p with d > p .

After transformation of the PDE into iterations, suppose that one can use the Caratheodory’s solution for the PDE:

a ( u ) = a ( u 0 ) + F ( a ( v ) ) d v .

And we see that the only asymptotic solutions for a non-null measure are periodic cycles with the unknown almost period T = u u 0 .

5.2. Examples

1) Suppose that F has a hessian definite negative, then, when δ 0 , it is easy to verify that the critical point verifies: a y = 1 , with an approximation of

H n ( y ) = n y F ( a ) e y a + v y δ f ( a ) / a n | a = 0 for δ 0 .

The critical point a c is real and we don’t have a probabilistic solution.

2) Suppose we have a linearity in b: Let a = ( a , b ) with a d and b .

We write: d a / d t = F ( a ) as: with F ( a ) = ( f ( a ) b + g ( a ) , h ( a ) b + k ( a ) )

d a / d t = f ( a ) b + g ( a ) ; d b / d t = h ( a ) b + k ( a )

where: g ( 0 ) = k ( 0 ) = 0 in order to have F ( 0 ) = 0 .

We write the Plancherel-Rotach’s function with then y = ( y , z ) , y d and z

n γ ( a ) = y ( a + δ ( f ( a ) b + g ( a ) ) ) + z ( b + δ ( h ( a ) b + k ( a ) ) )

Putting z = δ z and b = δ b such as z b = z b for δ > 0 , we obtain when δ 0 :

n γ ( a ) y ( a + f ( a ) b ) + z b n ln b n ln a

Where a = ( a , b ) (The change b = δ b doesn’t modify the equation θ f ( y ) = 0 ). And the critical point is defined by:

γ / b = y f ( a ) b + z b n = 0

γ / a = y a + y b f ( a ) / a n = 0

So: y a ( y f ( a ) + z ) + n y f ( a ) / a n ( y f ( a ) + z ) = 0 .

The imaginary critical points give the distribution of the cycles. Under general conditions, this distribution doesn’t depend on g ( a ) , h ( a ) , k ( a ) but only on f ( a ) .

6. Critical frequencies

Asymptotically, we have random cycles. Let a ( t ) be a point on a such asymptotic cycle and a very small invariant borelian around this point. So, we have many large times to return in this borelian. In the differential iteration, we have many and large τ = ( t + k T ) / n which give the same a ( t ) where T is a random quasi-period [6].

Proposition

When the number of iterations n and if the la hessian of yF is definite negative, the approximation with defines s = y / n in function of the critical point a :

s + t s F ( a ) / a 1 / a = 0

where 1 / a = ( 1 / a l , l = 1 , 2 , , d ) .

If s a is a particular solution and if s is an eigenvector of F ( a ) / a for the eigenvalue 1/t, the general solution is disjunctive:

s = s a if t 1 / λ a or s = s if t 1 / λ a .

The eigenvalue 1/t can be interpreted as a critical asymptotic frequency.

■ Contrary to the previous Section 5, we don’t write the critical point a as a function of s, but s as a function of a . For fixed a on an asymptotic cycle, we recognize the linear affine equation of s depending on the parameter t. We have to find a particular solution s a :

s a + t s a F ( a ) / a 1 / a = 0 .

Formally: s a = ( I d + t F ( a ) / a ) 1 ( 1 / a ) .

This solution s a is valid for all t 1 / λ a where λ a is eigenvalue of F ( a ) / a at the critical point a. If t 1 / λ a , s a is a particular solution of the equation and the general solution will be s = s a + s , then:

s a + s + t ( s a + s ) F ( a ) / a 1 / a = 0

And: s = t s F ( a ) / a .

As t 1 / λ a , s = 0 . The general solution is disjunctive and shows a discontinuity at the eigenvalues λ a . ■

Remark: calculation of s a

s a is obtained with ( I d + τ F ( a ) / a ) 1 for all τ 1 / λ a which doesn’t belong to the spectrum of F ( a ) / a with the series development of τ .

Remark: the Fredholm alternative

Here, we have the Fredholm alternative: either we have s a for all τ 1 / λ a or s for τ 1 / λ a > 0 . Suppose we start with 0 < τ < 1 / λ a , but τ is increasing: what happens when τ 1 / λ a ? What is the physical interpretation? Can we connect this phenomenon to some physical constants or boundaries?

7. Case Where the Hessian Is Degenerated: The Lorenz’s Equation

Generally, the hessian is not definite negative. The Lorenz’s equation [7] is a particularly important example because the differential iteration can be broken down into three independent iterations which have a remarkable feature: a partial linearity; an iteration with a negative hessian which induces a probabilistic solution and another with a positive hessian. It is an ideal example to clarify the previous results.

However, as there is an interpenetration of the distributions related to each fixed point, the connection between the various results remains delicate. The probabilistic presentation seems to be the least bad: it gives the probability of presence except at the places where the domination changes; in this case, we go from a basin to an another.

7.1. The Iteration at Its Repellent Fixed Points

The vectors of this equation are written in bold notations:

d a / d t = F ( a ) where a = ( a , b , c ) :

d a / d t = σ ( b a )

d b / d t = ρ a b a c

d c / d t = β c + a b .

The differential equation applies a bounded set C in itself for δ > t > 0 (the phenomenon is occurring between a cold sphere at −50˚ and hot sphere, the earth, at +15˚ as the terrestrial atmosphere is modelled by Lorenz).

The differential iteration a 1 = f ( a ) associated with a given path δ = t / n is:

a 1 = a + δ σ ( b a )

b 1 = b + δ ( ρ a b a c )

c 1 = c + δ ( β c + a b ) .

This iteration is quadratic, but has a linearity in a .

We recall the known results concerning the fixed points:

The fixed points are zeros of F ( a ) = 0 . If ρ > 1 and α = β ( ρ 1 ) , it exists three fixed points: the point 0 = ( 0 , 0 , 0 ) , and two others symmetric with respect to the axis of c:

α + = ( α , α , α 2 / β ) and α = ( α , α , α 2 / β ) .

At 0, the eigenvalue’s equation λ of the linear part is:

( β + λ ) [ ( σ + λ ) ( 1 + λ ) σ ρ ] = 0 ,

But, at α + or at α :

λ ( β + λ ) ( 1 + σ + λ ) α 2 ( 2 σ + λ ) = 0

Coefficients β , σ , ρ are such as these three fixed points are repellent; that means we have to study the distributions around each fixed point. We don’t speak here about attractive cycles, resonances, and some particular values of the parameters, etc. It remains many points to clarify.

7.2. Analysis of the Hessian

Projecting f ( a ) onto an axis y = ( x , y , z ) , we write:

y f ( a ) = L ( a ) + δ Q ( a )

where L ( a ) is linear for a :

L ( a ) = x ( a + δ σ ( b a ) ) + y ( b + δ ( ρ a b ) ) + z c ( 1 δ β )

L ( a ) = a L 1 + b L 2 + c L 3

with: L 1 = x ( 1 δ σ ) + δ ρ y

L 2 = δ σ x + y ( 1 δ )

L 3 = z ( 1 δ β )

and Q ( a ) is quadratic: Q ( a ) = ( z b y c ) a .

The hessian Q ( a ) is degenerated and not definite negative. But, Q doesn’t change when we translate the origin from a fixed point to an another.

First, we examine the matrix of Q ( a ) :

Q = [ 0 z y z 0 0 y 0 0 ]

Let μ = y 2 + z 2 the positive eigenvalue of the characteristic equation of Q:

μ ( μ 2 y 2 z 2 ) = 0

The matrix of the eigenvectors T is orthogonal and constant for all a .

T = 1 μ 2 [ 0 μ μ y 2 z z _ z 2 y y ]

Corresponding to the diagonal matrix of the eigenvectors: Λ = [ 0 0 0 0 μ 0 _ 0 0 μ ] .

7.3. Change of Basis Near 0

- We calculate in the basis of eigenvectors directly with the Hermite’s polynomials. As T is orthogonal, the transposed T’ is also its inverse: T = T 1 .

Then, the application u = T a with u = ( u , v , w ) transforms:

y f ( a ) G ( u ) = y f ( T u )

Q ( a ) Q ( T u ) = δ μ ( w 2 v 2 )

L ( a ) L T u .

Now, in the basis u , the function y f ( T u ) = G ( u ) is factorized into three independent functions:

G ( u ) = g 1 ( u ) + g 2 ( v ) + g 3 ( w )

with: g 1 ( u ) = l 1 u ; g 2 ( v ) = l 2 v δ μ v 2 ; g 3 ( w ) = l 3 w + δ μ w 2 .

Where: l 1 = ( δ σ x + y ( 1 δ ) + z ( 1 δ β ) ) / 2

l 2 = ( x δ σ x + δ ρ y ) y / μ ( δ σ x + y ( 1 δ ) z ( 1 δ β ) ) z / μ 2

l 3 = ( x δ σ x + δ ρ y ) z / μ ( δ σ x + y ( 1 δ ) z ( 1 δ β ) ) y / μ 2

- To calculate l 1 , l 2 et l 3 , we form:

L ( a ) = a ( x δ σ x + δ ρ y ) + b ( δ σ x + y ( 1 δ ) ) + z c ( 1 δ β )

with: L 1 = x ( 1 δ σ ) + δ ρ y ; L 2 = δ σ x + y ( 1 δ ) ; L 3 = z ( 1 δ β )

Then: l u = ( l 1 , l 2 , l 3 ) u = L T u = ( L 1 , L 2 , L 3 ) 1 μ 2 [ 0 y 2 z 2 μ z y μ z y ] u .

- We get 3 independent iterations:

. the first iteration g 1 is linear;

. the second g 2 is a random iteration;

. the third g 3 remains positive, except if l 3 = 0 half the time.

- Let the resolving gap e n ( y ) = ( n ( e y f ( a ) ) / a n ) δ | a = 0 = 0

For t δ , putting a = T u , we have:

e n ( u ) = T n ( n ( e y f ( T u ) ) / u n ) δ | u = 0 = 0

n ( e y f ( T u ) ) / u n = n ( e g 1 ( u ) ) / u n n ( e g 2 ( v ) ) / v n n ( e g 3 ( w ) ) / w n .

This gives: n ( e g 1 ( u ) ) / u n = l 1 n e g 1 ( u )

n ( e g 2 ( v ) ) / v n = H n ( g 2 ( v ) ) e g 2 ( v )

n ( e g 3 ( w ) ) / w n = H n ( g 3 ( w ) ) e g 3 ( w )

And: e n ( u ) = l 1 n H n ( g 2 ( v ) ) H n ( g 3 ( w ) ) ( e y f ( T u ) ) δ | u = 0 = 0 .

Proposition

The solution around the fixed point 0 consists of the intersection of the family of random surfaces defined by:

l 2 / 2 μ l o w β ( 1 / 2 , 1 / 2 )

with the surfaces σ x y z β = 0 and ( σ x + ρ y ) z + ( σ x y + z β ) y / 2 = 0 .

■ With the same calculations of encodings and interchanging the derivations, we have:

l 1 n / δ = 0 ; H n ( g 2 ( v ) ) / δ = 0 ; H n ( g 3 ( w ) ) / δ = 0

We study separately the three expressions:

- First: l 1 n / δ = n ( l 1 / δ ) l 1 n 1 = 0 .

Either l 1 / δ = σ x y z β = 0 , or: l 1 ~ ( y + z ) / 2 = 0

- Second: the polynomial H n ( g 3 ( w ) ) when w = 0 is a Hermite’s polynomial H n ( x ) where x is x = i l 3 / ( 2 δ μ ) . This polynomial i n H n ( i l 3 / ( 2 δ μ ) ) is always positive half the time. In a general way:

H n ( x ) / δ = n H n 1 ( x ) x / δ = 0 . So: d ( l 3 / 2 δ μ ) / d δ = 0 ,

And l 3 ~ ( x z 2 + ( y z ) y ) / μ 2 = 0 half the time.

- Third: in the case of H n ( g 2 ( w ) ) , in addition to the solution l 2 = 0 , we have to find the possible invariant distribution of H n ( l 2 / ( 2 δ μ ) ) = 0 .

Let the integrand of n γ ( w ) = g 2 ( w ) n ln w .

When δ 0 , l 2 ~ ( x y 2 + ( y z ) z ) / 2 μ with μ = y 2 + z 2 .

By normalization of the coordinates x = ( x , y , z ) = δ n s = ( δ n r , δ n s , δ n t ) , we obtain:

l 2 ~ n δ ( r s 2 + ( s t ) t ) / 2 ( s 2 + t 2 ) 1 2 = n δ l 2 ( s )

δ μ = n δ 2 ( s 2 + t 2 ) 1 / 2 = n δ 2 μ ( s )

n γ ( v ) = n ( δ l 2 ( s ) v μ ( s ) ( δ v ) 2 ln δ v + ln δ )

Putting δ v = v , we have: n γ ( v ) = n ( l 2 ( s ) v μ ( s ) v 2 ln v ) .

We search the critical point: d γ ( v ) / d v = l 2 ( s ) 2 μ ( s ) v 1 / v = 0

The imaginary roots are: v ( s ) = l 2 ( s ) / 4 μ ( s ) ± i 1 / 2 μ ( s ) l 2 ( s ) 2 / 16 μ ( s ) 2 .

Under the condition: l 2 ( s ) 2 < 8 μ ( s ) :

l 3 ~ ( r t 2 + ( s t ) s ) / μ ( s ) 2 = 0 half the time,

Implies: l 2 ( s ) = ( s t ) 2 / 2 ( s 2 + t 2 ) 1 / 2

The condition becomes: ( s t ) 4 / ( s 2 + t 2 ) 3 / 2 < 16

l 1 = 0 implies s + t = 0 , then: s < 8 .

In any case, we observe that the conditions l 3 = l 1 = 0 allow us to express r et t depending on s and we can write that the density of zeros of s is now:

q ( s ) d s = Prob ( 1zerobetween s , s + d s ) = | m f ( v ( s ) ) | d s / π

q ( s ) d s = l 2 ( s ) 8 μ ( s ) l 2 ( s ) 2 / 8 π μ ( s ) d s = d κ .

Then, κ follows a uniform low on (0, 1) with: s + t = 0 (or: σ x y z β = 0 ) and: x y 2 + ( y z ) z = 0 .

We also remark that the normalization doesn’t affect the coefficients of the orthogonal matrix:

T ( x , y , z ) = T ( δ n r , n δ s , n δ t ) = T ( r , s , t ) . ■

7.4. Analysis near α + and α

We now verify similar results the two other fixed points α + and α .

We search the distributions around the two other fixed points. To pass from the fixed point 0 to the fixed point α + or α , we have just to put in the iteration instead of a = ( a , b , c ) : a + α + = ( a + α , b + α , c + α 2 / β ) or a α + = ( a α , b α , c + α 2 / β ) .

- Calculation for α +

So, for a + α + = a ; a 1 = a + α + and a 1 = f ( a ) where a 1 = ( a 1 , b 1 , c 1 ) becomes

a 1 = a 1 + α + = f ( a ) = f ( a + α + ) ;

then: a 1 = a + δ F ( a + α + )

As: F ( a ) = ( σ ( b a ) , ( ρ a b a c ) , ( β c + a b ) )

a 1 = f ( a ) becomes for a + α + :

a 1 = a + δ σ ( b a ) = a 1

b 1 = b + δ ( ρ a b a c ) + δ ( α c a α 2 / β ) = b 1 + δ ( α c a α 2 / β )

c 1 = c + δ ( β c + a b ) + δ α ( a + b ) = c 1 + δ α ( a + b )

The projection of f ( a ) on an axis y = ( x , y , z ) can be written:

y f ( a ) = x a 1 + y b 1 + δ y ( α c + a α 2 / β ) + z c 1 + z δ α ( a + b )

y f ( a ) = y f ( a ) + δ ( a ( z α y α 2 / β ) + z α b y α c )

and Q ( a ) is invariant: y f ( a ) = L ( a ) + δ Q ( a )

L ( a ) is linear for a : L ( a ) = L ( a ) + δ ( a ( z α y α 2 / β ) + z α b y α c )

L ( a ) = a L 1 + b L 2 + c L 3

with: L 1 = L 1 + δ ( z α y α 2 / β ) ; L 2 = L 2 + δ z α ; L 3 = L 3 δ y α .

Then T and Λ remain invariant. The following is only a calculus.

We calculate l 1 , l 2 et l 3 , with

L ( a ) = a ( x δ σ x + δ ρ y ) + b ( δ σ x + y ( 1 δ ) ) + z c ( 1 δ β ) :

where L 1 = x ( 1 δ σ ) + δ ρ y ; L 2 = δ σ x + y ( 1 δ ) ; L 3 = z ( 1 δ β )

And: l u = ( l 1 , l 2 , l 3 ) u = L T u = ( L 1 + δ ( z α y α 2 / β ) , L 2 + δ z α , L 3 δ y α ) 1 μ 2 [ 0 y 2 z 2 μ z y μ z y ] .

The results are modified; if l = ( l 1 , l 2 , l 3 ) is related to 0 and l = ( l 1 , l 2 , l 3 ) to α +

l 1 = l 1 + δ α ( z y ) / 2

l 2 = l 2 + δ α ( ( z y α / β ) y 2 z ( z + y ) ) / μ 2

l 3 = l 3 + δ α ( ( z y α / β ) z 2 + y ( z + y ) ) / μ 2

The following calculations remain the same with these modifications.

- Calculation for α

When a becomes a + α the calculation is the same with the coordinates:

a 1 = a + δ σ ( b a ) = a 1

b 1 = b + δ ( ρ a b a c ) + δ ( α c a α 2 / β ) = b 1 + δ ( α c a α 2 / β )

c 1 = c + δ ( β c + a b ) δ α ( a + b ) = c 1 δ α ( a + b ) .

It remains the problems of domination and frontiers between the various distributions attached at each fixed point.

Remark

We have to go back to the original coordinates. And the solution gives only the probabilities of presence...

8. Conclusions

After this study, we can say, under good conditions, that an EDO is deterministic near the origin of the process, but have random or fixed cycles after a very long time.

With this probabilistic method, we obtain some new results, but we meet also many new difficulties due to the particular steepest descent’s method used to study the Plancherel-Rotach’s function. Many things have to be lightened

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1] Cirier, G. (2017) Les itérations polynomiales bornées dans Rd. Editions. Univ. Européenne. Balti. (some demonstrations must be improved).
https://my.editions-ue.com
[2] Lasota, A. and Mackey, M.C. (1991) Chaos, Fractals and Noise. 2nd Edition, Springer-Verlag, Berlin.
[3] Delabaere, E. and Howls, C.J. (2002) Global Asymptotics for Multiple Integrals with Boundaries. Duke Mathematical Journal, 112, 199-264.
https://doi.org/10.1215/S0012-9074-02-11221-6
[4] Plancherel, M. and Rotach, W. (1929) Sur les valeurs asymptotiques des polynômes d’Hermite Hn(x) = (-1)nex2/2dn/dxn(e-x2/2) Commentarii Mathematici Helvetici, 1, 227-254.
https://doi.org/10.1007/BF01208365
[5] Ulam, S.M. and von Neumann, J. (1947) On Combination of Stochastic and Deterministic Processes. Bull, 53, 1120.
[6] Cirier, G. (2021) Asymptotic Frequencies of Bounded Differential Equations. Journal of Mathematics and Statistics, 7, 11.
[7] Lorenz, E.N. (1963) Deterministic Nonperiodic Flow. Journal of the Atmospheric Sciences, 20, 130-141.
https://doi.org/10.1175/1520-0469(1963)020<0130:DNF>2.0.CO;2

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.