Next Article in Journal
Frequent Itemset Mining and Multi-Layer Network-Based Analysis of RDF Databases
Next Article in Special Issue
Statistical Tests of Symbolic Dynamics
Previous Article in Journal
Rule-Based EEG Classifier Utilizing Local Entropy of Time–Frequency Distributions
Previous Article in Special Issue
About the Structure of Attractors for a Nonlocal Chafee-Infante Problem
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Full Description of ω-Limit Sets of Cournot Maps Having Non-Empty Interior and Some Economic Applications

by
Antonio Linero-Bas
1,*,† and
María Muñoz-Guillermo
2,†
1
Departamento de Matemáticas, Campus de Espinardo, Universidad de Murcia, 30100 Murcia, Spain
2
Departamento de Matemática Aplicada y Estadística, Universidad Politécnica de Cartagena, Antiguo Hospital de Marina, 30202 Cartagena, Murcia, Spain
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2021, 9(4), 452; https://doi.org/10.3390/math9040452
Submission received: 28 December 2020 / Revised: 11 February 2021 / Accepted: 16 February 2021 / Published: 23 February 2021
(This article belongs to the Special Issue Mathematical Methods on Economic Dynamics)

Abstract

:
Given a continuous Cournot map F ( x , y ) = ( f 2 ( y ) , f 1 ( x ) ) defined from I 2 = [ 0 , 1 ] × [ 0 , 1 ] into itself, we give a full description of its ω -limit sets with non-empty interior. Additionally, we present some partial results for the empty interior case. The distribution of the ω -limits with non-empty interior gives information about the dynamics and the possible outputs of each firm in a Cournot model. We present some economic models to illustrate, with examples, the type of ω -limits that appear.

1. Introduction

Topological structure and classification of ω -limits for general compact metric spaces remain an important problem and, in many aspects, an unknown subject. In order to better understand the main goal pursued in this paper in relation to the description of certain ω -limit sets for Cournot maps, and their presence in the numeric simulations of several economic models, let us first present the needed notions and their associated notation.
Given a compact metric space X, let C ( X , X ) denote the set of continuous maps from X into itself. The interior of a subset Y X is denoted by Int ( Y ) . We say that Y X is a nowhere dense set whenever the interior of its closure is empty. Let φ C ( X , X ) . For n N we put φ n = φ φ n 1 , with φ 0 = Identity . The orbit of a point x X through φ is Orb φ ( x ) = { φ n ( x ) } n = 0 . We say that Y X is n-periodic if φ n ( Y ) = Y and φ k ( Y ) Y for 0 < k < n ; in this case, Orb φ ( Y ) = Y φ ( Y ) φ n 1 ( Y ) is the orbit of Y . If Y = { x } we say that it is a n-periodic point. The period of x is denoted by ord φ ( x ) . When X = I : = [ 0 , 1 ] is the unit interval and Y is a subinterval of I, we have an n-periodic subinterval. If X = I 2 , and Y = J 1 × J 2 , with J i subintervals of I, i = 1 , 2 , we have an n-periodic rectangle.
The set of limit points of Orb φ ( x ) (i.e., its accumulation points or elements y in X, for which there exists an infinite subsequence n 1 < n 2 < < n j < of positive integers such that φ n j ( x ) converges to y), is called the ω-limit set of x by φ , and we denote it by ω φ ( x ) . For any x X , ω φ ( x ) is non-empty, closed and strongly invariant ( φ ( ω φ ( x ) ) = ω φ ( x ) ) (see [1]). Moreover, for any n N
ω φ ( x ) = j = 0 n 1 ω φ n ( φ j ( x ) ) .
We say that φ is transitive if, given two non-empty open sets U , V X , there is n 0 N such that φ n 0 ( U ) V . If there is k 0 N such that φ n ( U ) V for all n k 0 , then φ is called a (topologically) mixing map. Observe that topologically mixing implies transitivity (see [2] for a detailed explanation on properties of these types of maps). Moreover, φ is transitive if and only if there exists a point x X with ω φ ( x ) = X (see [1]).
The pair ( X , φ ) is called a discrete dynamical system. Given such a system, the main objective is to know the asymptotic behavior of the orbits Orb φ ( x ) for all x X and to analyze the topological structure of their ω -limit sets. This is a difficult problem, and we restrict our attention to a particular class of continuous two-dimensional maps.
Given f C ( I , I ) , I = [ 0 , 1 ] , the topological structure of an ω -limit set L of f is well known: either L is a nowhere dense set or L = i = 1 n J i , where J i are non-degenerate closed subintervals of I such that f ( J i ) = J i + 1 ( mod n ) and J i J k = if i k (for a proof, see [1]). Conversely, any set of the above forms can be realized as an ω -limit set for a suitable continuous interval map (see [3] or [4]).
Nevertheless, the description of ω -limit sets for continuous maps f : I n I n , with n 2 , is an open problem. In this direction, only a few results are known (see for instance, [5,6,7,8,9]). It seems to be more reasonable to focus our attention on special classes of two-dimensional continuous maps.
Following [10], we are interested in describing the topological structure of ω -limit sets of a particular class of C ( I 2 , I 2 ) called antitriangular maps or Cournot maps. We say that F C ( I 2 , I 2 ) is an antitriangular map (or Cournot map) if
F ( x , y ) = ( f 2 ( y ) , f 1 ( x ) ) ,
with f i C ( I , I ) , i = 1 , 2 . It is immediate to see that for any n 0 it holds
F 2 n ( x , y ) = ( ( f 2 f 1 ) n ( x ) , ( f 1 f 2 ) n ( y ) ) ,
F 2 n + 1 ( x , y ) = ( ( f 2 ( f 1 f 2 ) n ) ( y ) , ( f 1 ( f 2 f 1 ) n ) ( x ) ) .
The set of antitriangular maps on I 2 will be denoted by C A ( I 2 , I 2 ) .
This type of two-dimensional map appears closely related to an economical process called the Cournot duopoly (see [11]), in which two firms produce an identical good, and in each step they try to obtain the maximum profit according to the decision of the opposite firm in the last step. This economical process has been profusely studied in the literature (for instance, see [12,13,14,15,16,17],...).
The following result gives a description of ω -limit sets of antitriangular maps.
Theorem 1
([10] Theorem 2). Let F C A ( I 2 , I 2 ) and let L = ω F ( x , y ) , ( x , y ) I 2 . Then L can be one of the following types:
1. 
A finite set (periodic orbit).
2. 
An infinite nowhere dense set.
3. 
L is a finite union i = 1 p R i , where R i = I i × J i I 2 are non-degenerate periodic rectangles of F such that R i R j is not a rectangle and Int ( R i ) Int ( R j ) = for 1 i < j p .
But, as it was highlighted in [10], not every distribution of rectangles in the square can be realized as an ω -limit of a suitable antitriangular map. In this paper, our main goal is to give a full description of ω -limit sets with non-empty interior, and consider some questions about ω -limit sets with empty interior.
This paper is organized as follows. After some preliminary results stated in Section 2, we proceed to develop in Section 3 a full description for the ω -limit sets of Cournot maps F ( x , y ) = ( f 2 ( y ) , f 1 ( x ) ) that have a non-empty interior. It is worth mentioning that this study is strongly related to the nature of the ω -limit sets associated with the one-dimensional maps f 2 f 1 and f 1 f 2 , in connection with the property of either being or not being a mixing ω -limit set, see Definition 2. Our analysis will be applied and illustrated with several economic models, such as Puu’s duopoly or Matsumoto-Nonaka’s model, among others, in Section 4. Next, in Section 5, on the one hand we present some examples of ω -limit sets of Cournot maps having empty interior and we show the existence of connected limit sets with empty interior; on the other hand, in the non-empty interior case, we characterize the connected ω -limit sets ω F ( x , y ) of Cournot maps F by the inspection of their canonical projections π j ( ω F ( x , y ) ) , j = 1 , 2 , and the intersection of the limit sets ω F 2 ( x , y ) and ω F 2 ( F ( x , y ) ) . We also state some open problems with the hope of advancing the comprehension of the empty-interior case of Cournot maps.

2. Auxiliary Results

In this section, some auxiliary results are summed up since they will be used later.
Proposition 1
([10] Proposition 7). Let F C A ( I 2 , I 2 ) . The following properties hold for all Z = ( z 1 , z 2 ) I 2 .
1. 
ω F ( Z ) [ ω f 2 f 1 ( z 1 ) × ω f 1 f 2 ( z 2 ) ] [ ω f 2 f 1 ( f 2 ( z 2 ) ) × ω f 1 f 2 ( f 1 ( z 1 ) ) ] .
2. 
π i ( ω F ( Z ) ) = ω f j f i ( z i ) ω f j f i ( f j ( z j ) ) , for i , j { 1 , 2 } , i j .
3. 
f i ( ω f j f i ( z i ) ) = ω f i f j ( f i ( z i ) ) , for i , j { 1 , 2 } , i j .
For the next results, recall that by a bitransitive map f we understand a continuous map for which f and f 2 are transitive.
Lemma 1
([2] Theorem 6.1.1). Let f C ( I , I ) be transitive. Then either f is bitransitive or there is c ( 0 , 1 ) such that f ( [ 0 , c ] ) = [ c , 1 ] , f ( [ c , 1 ] ) = [ 0 , c ] and both f 2 | [ 0 , c ] and f 2 | [ c , 1 ] are bitransitive (clearly the point c is the only fixed point of f).
Lemma 2
([2] Theorem 6.1.2). Let f C ( I , I ) . The following statements are equivalent:
1. 
f is bitransitive.
2. 
f is topologically mixing.
Remark 1.
With respect to the last result, we can stress that in the case of a bitransitive map f : I I (therefore, topologically mixing), if x 0 I verifies that ω f ( x 0 ) = I , then ω f s ( x 0 ) = I for every positive integer s, see ([1], [Prop. 42, Chapter VI]).
The following result allows us to construct ω -limit sets from mixing sets (we will say that an invariant closed set Y X is mixing for a continuous map φ : X X whenever φ | Y is mixing); it can be easily derived from Theorem 6 in [6] where the property is established in the frame of mixing compact ω -limit sets in the Euclidean space R n .
Theorem 2
([6] Theorem 6). Let f , g C ( I , I ) and let x I such that ω f ( x ) is mixing. Then for any y I there are x 1 , y 1 I such that ω f × g ( x 1 , y 1 ) = ω f ( x ) × ω g ( y ) .
The following lemma states the relationship between two ω -limit sets from a continuous map defined in a compact metric space.
Lemma 3
([10] Lemma 3). Let φ C ( X , X ) and suppose that Y and Z are ω-limit sets of φ with non-empty interior. Then Int ( Y ) Int ( Z ) = or Y = Z .
The case in which Int ( Y ) Int ( Z ) = can be even more specific. The following result deals with interval maps having two different ω -limits sets with non-empty interiors sharing periodic points. According to the structure of the ω -limit sets L with non-empty interior, corresponding to interval maps f C ( I , I ) , described in Section 1, we know that L = s = 1 p I s and f ( I s ) = I s + 1 mod ( p ) , s = 1 , , p . Then, we say that L is mixing for f whenever the transitive restricted map f p | I s is topologically mixing for s = 1 , , p . Otherwise, L is said to be no mixing.
Lemma 4.
Let f C ( I , I ) . Let A = i = 1 p I i and B = j = 1 q J j be two different ω-limit sets of f with non-empty interiors. Suppose p q . Suppose A B and Int ( A ) B = . Then, either p = q or p = 2 q , in both cases A is mixing, and the number of connected components of A B is q.
Proof. 
If A B and Int ( A ) B = , then it is easily seen that A and B share endpoints, which are evidently periodic points of f .
Let ( A B ) 1 < . . . < ( A B ) c be the c connected components of A B (given J , K I , J < K means that x < y for all x J , y K ; realize that this number c is finite).
Define
a i = Card ( { 1 j p : I j ( A B ) i } ) , b i = Card ( { 1 t q : J t ( A B ) i } ) .
Obviously, a i 1 = a i 2 , b j 1 = b j 2 for all i 1 , i 2 { 1 , . . . , p } and j 1 , j 2 { 1 , . . . , q } , since f maps connected components on connected components and A , B are periodic sets of f . Moreover, since p q , either a 1 = b 1 or a 1 = b 1 + 1 .
If b 1 2 , it is not restrictive to assume that we have in ( A B ) 1 the disposition I i 1 J j 1 I i 2 J j 2 . . . for some i { 1 , . . . , p } , j { 1 , . . . , q } , = 1 , 2 , Notice that c < p because b 1 2 and q p . Since f maps connected components on connected components, and c is the number of such connected components, we have f c ( ( A B ) 1 ) = ( A B ) 1 . Therefore, being ( A B ) 1 a closed interval, there exists a fixed point x of f c in ( A B ) 1 . Taking into account that b 1 2 (so, min p , q 2 ), we deduce that either x Int ( I i ) or x Int ( J j ) for some = 1 , 2 , Consequently, either f c ( I i ) = I i or f c ( J j ) = J j . The first case is not allowable because A is a p-periodic orbit and c < p ; in the second case, we distinguish two situations: (i) if J j is the endpoint of ( A B ) 1 necessarily f c ( I i ) = I i , a new contradiction; (ii) if J j is not an endpoint of ( A B ) 1 , since b 1 2 we have J j I i J j + 1 , and due to the fact that f c ( J j s ) = J j s for all s, we deduce that f c ( I i ) = I i , which again contradicts that c < p .
Therefore, we have proved that b 1 = 1 . This gives c = q . Notice that the possibility a 1 = b 1 + 1 can occur.
Due to the structure of the connected components ( A B ) 1 , , ( A B ) q mentioned above, observe that f p ( x ) = x for all x A B both if p = q (here ( A B ) s = I i s J j s ) or p = 2 q (where ( A B ) s = I i s J j s I i s + 1 , with I i s J j s I i s + 1 ). This means that each I i has an endpoint as a fixed point of f p . Then Lemma 1 and Lemma 2 imply that A is mixing. □
Remark 2.
Realize that if p = q in the above Lemma 4, we also obtain that B is mixing, but in the case p = 2 q it is not guaranteed that B is mixing, because in this situation we only know that its endpoints are fixed by f 2 q but we have no information about the action of f q on these endpoints.
To describe the ω -limit sets with non-empty interior, we will use the following results, whose proofs can be consulted in [18]. Among them, we include the characterization of finite limit sets, that is, periodic orbits of Cournot maps; in fact, the movement of periodic rectangles realized as ω -limit sets of Cournot maps can be ‘interpreted’ as the evolution of periodic points, and in this sense the distribution of periodic points can show us in some cases the possible way to distribute periodic rectangles.
Lemma 5
([18] Proposition 3.7). Let F C A ( I 2 , I 2 ) . Let M I 2 be a periodic orbit of F and fix ( x , y ) M . Then the following statements are equivalent:
1. 
M Orb f 2 f 1 ( x ) × Orb f 1 f 2 ( y ) .
2. 
M ( Orb f 2 f 1 ( x ) × Orb f 1 f 2 ( f 1 ( x ) ) ) .
3. 
f 1 ( x ) Orb f 1 f 2 ( y ) .
4. 
f 2 ( y ) Orb f 2 f 1 ( x ) .
Lemma 6
([18] Proposition 3.8). Let F C A ( I 2 , I 2 ) . Let M I 2 be a periodic orbit of F with f 2 ( y ) Orb f 2 f 1 ( x ) for all ( x , y ) M . Then there are d , k 1 , k 2 N and there are two finite sets H , V I holding the following properties:
1. 
Card ( M ) = 2 d k 1 k 2 , gcd ( k 1 , k 2 ) = 1 , lcm ( d k 1 , d k 2 ) = Card ( M ) / 2 .
2. 
For all ( x , y ) M , either d k 1 = ord f 2 f 1 ( x ) and d k 2 = ord f 1 f 2 ( y ) , or d k 2 = ord f 2 f 1 ( x ) and d k 1 = ord f 1 f 2 ( y ) .
3. 
Card ( H ) = k 1 , Card ( V ) = k 2 .
4. 
Orb F ( H × V ) = M .
5. 
For i = 1 , 2 , π i ( F j ( H × V ) ) π i ( F ( H × V ) ) = for 0 j < < 2 d .
Theorem 3
([18] Theorem 3.10). Let M = { ( x i , y i ) } i = 1 n be a periodic orbit for F C A ( I 2 , I 2 ) . Then
1. 
If n { 2 } { 2 m + 1 : m N { 0 } } , x i x j and y i y j for i j , i , j { 1 , . . . , n } . See Figure 1.
2. 
If n { 2 m : m N , m 2 } , and M satisfies the equivalent conditions of Lemma 5, for any i { 1 , . . . , n } there are unique j , k { 1 , . . . , n } \ { i } such that x i = x j and y i = y k . See Figure 2.
3. 
If n { 2 m : m N , m 2 } , and M does not satisfy the equivalent conditions of Lemma 5, the distribution of points of M is described by Lemma 6. See Figure 3.

3. Description of the Non-Empty Interior Case

In this section, the starting point for the analysis lies in fixing the type of ω -limit sets obtained in the one-dimensional case ( f 1 f 2 and f 2 f 1 ) and, then, to study the type of ω -limit sets generated in the two-dimensional case for the antitriangular map F ( x , y ) = ( f 2 ( y ) , f 1 ( x ) ) .
Let F C A ( I 2 , I 2 ) be an antitriangular map such that F ( x , y ) = ( f 2 ( y ) , f 1 ( x ) ) where f 1 , f 2 C ( I , I ) . Let L = ω F ( x , y ) be an ω -limit with non empty interior. Then, according to Theorem 1, L = i = 1 k R i , where k is the number of different rectangles in the decomposition. As general observations, we can assume that
ω f 2 f 1 ( x ) = i = 1 p I i = A , ω f 1 f 2 ( f 1 ( x ) ) = i = 1 p f 1 ( I i ) = f 1 ( A ) ,
ω f 1 f 2 ( y ) = j = 1 q J j = B , ω f 2 f 1 ( f 2 ( y ) ) = j = 1 q f 2 ( J j ) = f 2 ( B ) ,
where I i and J j are closed non-degenerate periodic subintervals of f 2 f 1 and f 1 f 2 respectively, with periods p and q, respectively. In our next development, we put I s = f 2 ( J s ) , J t = f 1 ( I t ) , s = 1 , , q , t = 1 , , p . Moreover, by Proposition 1,
L ( A × B ) ( f 2 ( B ) × f 1 ( A ) ) .
Let π 1 and π 2 be the projection maps on the first and second coordinate, respectively. Let J be an interval appearing in A B ; for j = 1 , 2 , we define p j ( J ) = { R L : π j ( R ) = J } the number of rectangles R in L, such that π j ( R ) = J .
In order to simplify the classification of ω -limit sets with non-empty interior, we consider the following definition.
Definition 1.
We say that two ω-limit sets L 1 = i = 1 k 1 R i and L 2 = j = 1 k 2 R ˜ j are equivalent if
1. 
k 1 = k 2 ;
2. 
there exists a permutation σ of k = k 1 = k 2 elements such that π j ( L 1 ) = π j ( L 2 ) and p j ( π j ( R ˜ σ ( i ) ) ) = p j ( π j ( R i ) ) for each j = 1 , 2 and i = 1 , , k .
From now we say that two ω -limit sets are different if they are not equivalent (for an example of equivalent limit sets, see Figure 4).
Finally, we recall the definition of the mixing ω -limit set.
Definition 2.
We say that the ω-limit set A is mixing if ( f 2 f 1 ) p | I i is mixing for all i { 1 , . . . , p } . In other cases, we say that A is no mixing.
In the next development, the strategy followed describing the ω -limit sets with non-empty interiors consists in distinguishing the cases in which A , B are or are not mixing.

3.1. A and B Mixing

Let L = ω F ( x , y ) = i = 1 k R i be defined as before. Let N be : = lcm ( p , q ) . Without loss of generality, rearranging the indexes if necessary, we can assume that
( f 2 f 1 ) r ( I 1 ) = I 1 + r ( mod p ) , for r = 1 , , p ; ( f 1 f 2 ) s ( J 1 ) = J 1 + s ( mod q ) , for s = 1 , , q .
We can distinguish two general subcases:
  • f 1 ( A ) Int ( B ) (or equivalently f 1 ( A ) = B , Lemma 3). Therefore, f 1 ( A ) = B and f 2 ( B ) = A , and there exists a bijective correspondence between the intervals of A and B and, hence, p = q . If p = 1 the distribution is trivial, we only have a unique rectangle R = I 1 × J 1 . For p 2 we reason as follows. Assuming an ordering such that R 1 = I 1 × J 1 , then
    f 1 ( I 1 ) = J t
    for some t { 1 , , p } . In particular, if f 1 ( I 1 ) = J 1 then p 2 ( J 1 ) 2 since p 2 , although it is also possible to find examples for which p 2 ( I 1 ) = 1 . Observe that under the previous assumptions, according to (4) the condition f 1 ( I 1 ) = J t determines the images of all intervals I i and J j for i , j = 1 , , p . In fact, f 1 ( I i ) = J i + t 1 ( mod p ) and f 2 ( J i ) = I i + 2 t ( mod p ) for any i { 1 , p } . Thus, two different distributions (except equivalences) are possible:
    (D1)
    If t 1 , there are k = p = q rectangles and there exists an arrangement of the indexes such that R i = I i × J i for i = 1 , , k . It is clear that p 1 ( I i ) = p 2 ( J i ) = 1 for any i = 1 , , k . See Figure 5.
    (D2)
    If t = 1 , there are k = 2 p = 2 q rectangles and f 1 ( I i ) = J i ( mod p ) and f 2 ( J i ) = I i + 1 ( mod p ) , where p 2 . Also, it is held that p 1 ( I i ) = k p = 2 and p 2 ( J i ) = k p = 2 for i = 1 , p , see Figure 6.
    Observe that if the number of rectangles k is odd, then only Distribution D1 is possible.
  • f 1 ( A ) Int ( B ) = . We define
    B = i = 1 p f 1 ( I i ) = i = 1 p J i and A = i = 1 q f 2 ( J i ) = i = 1 q I i .
    Notice that B = f 1 ( A ) and A = f 2 ( B ) . Moreover, B Int ( B ) = and A Int ( A ) = . In this case, the number of rectangles, k, is always even, in particular k = 2 = 2 lcm ( p , q ) as F 2 r I 1 × J 1 = I 1 + r ( mod p ) × J 1 + r ( mod q ) and F 2 r + 1 I 1 × J 1 = f 2 J 1 + r ( mod q ) × f 1 I 1 + r ( mod p ) = I 1 + r ( mod q ) × J 1 + r ( mod p ) for r { 1 , , } . The ω -limit set L is given by L = L 1 L 2 , with π 1 ( L 1 ) = A , π 2 ( L 1 ) = B , π 1 ( L 2 ) = A , π 2 ( L 2 ) = B , such that Int ( L 1 ) L 2 = . The number of rectangles R i of L 1 is k 1 and the number of rectangles R i of L 2 is k 2 . Observe also that k 1 = k 2 = = lcm ( p , q ) , hence k = 2 · k 1 = 2 · and R i = I i ( mod p ) × J i ( mod q ) , R i = I i ( mod q ) × J i ( mod p ) , i { 1 , , } , with p 1 ( π 1 ( R ) ) = p , p 2 ( π 2 ( R ) ) = q for each R in L 1 and p 1 ( π 1 ( R ) ) = q , p 2 ( π 2 ( R ) ) = p for each R in L 2 . Thus, p 1 ( I i ) = p 2 ( J i ) = p = k 2 p for i { 1 , , p } , and p 2 ( J i ) = p 1 ( I i ) = q = k 2 q for i { 1 , , q } . As we have signaled above, the rectangles of the ω -limit set are described by R i ( mod k ) = I i ( mod p ) × J i ( mod q ) and R i ( mod k ) = I i ( mod q ) × J i ( mod p ) for i = 1 , , k . This case is easily detected when there exists i j such that p 1 ( π 1 ( R i ) ) = p 2 ( π 2 ( R j ) ) p 1 ( π 1 ( R j ) ) = p 2 ( π 2 ( R i ) ) . Additionally, if:
    (D3)
    f 1 ( A ) B = . There are 2 connected components, since the number of connected components of A A is p + q . See Figure 7.
    (D4)
    f 1 ( A ) B . The number of connected components depends on the number of connected components of A A and B B which is less than or equal to p and q, respectively, see Lemma 4. Consequently, rectangles can be disjoint, have a common vertex or two common vertices, see Figure 8, Figure 9, Figure 10 and Figure 11. Notice that the case for two common vertices can only be realized by a unique distribution, given precisely by Figure 10; moreover, observe that R i R j if and only if I i I j and J i J j .

3.2. A Mixing and B No Mixing

Since B is no mixing and by Definition 2, Lemma 1 and Lemma 2, there are closed intervals J i 1 and J i 2 whose intersection is a fixed point of ( f 1 f 2 ) q and such that J i = J i 1 J i 2 , ( f 1 f 2 ) q ( J i 1 ) = J i 2 , ( f 1 f 2 ) q ( J i 2 ) = J i 1 , and ( f 1 f 2 ) 2 q | J i j is mixing on J i j for i = 1 , 2 , , q and j = 1 , 2 . Now, it is not possible that f 1 ( A ) Int ( B ) due to Lemma 3 and the different mixing character of the intervals.
Assume that L = L 1 L 2 and that the rectangles of L 1 and L 2 are of type I i × J j r and type ( I ) j r × J i (with i { 1 , , p } , j { 1 , , q } , r = 1 , 2 ), respectively, where we have implicitly used Proposition 1 as well as the notation
f 1 ( A ) = f 1 i = 1 p I i = i = 1 p f 1 ( I i ) = : i = 1 p J i ,
and
f 2 ( B ) = f 2 i = 1 q J j 1 J j 2 = j = 1 q f 2 ( J j 1 ) f 2 ( J j 2 ) = : j = 1 q ( I ) j 1 ( I ) j 2 .
Next, by assuming that R 1 = I 1 × J 1 1 , we have:
  • If q is odd, = r q , r odd, then ( f 1 f 2 ) r q ( J j s ) = J j t , for all j = 1 , , q and s , t { 1 , 2 } , s t , due to the fact that B is not mixing; then both rectangles I i × J j 1 and I i × J j 2 belong to L 1 (realize that F 2 ( I i × J j 1 ) = ( f 2 f 1 ) ( I i ) × ( f 1 f 2 ) ( J j 1 ) = I i × J j 2 ), that is, I i × J j belongs to L 1 ; similarly, both rectangles ( I ) j 1 × J i and ( I ) j 2 × J i belong to L 2 and, therefore, the distribution of L = L 1 L 2 is reduced to the case A and B mixing with f 1 ( A ) B = (distribution D3).
  • If q is even, = m q , m even, now each rectangle of the ω -limit L is the half part of a rectangle I i × J k or I j × J i , and the number of rectangles of L n is equal to , n = 1 , 2 , so | L | = 2 (notice that, as a consequence of the parity of , F 2 ( I 1 × J 1 1 ) = ( f 2 f 1 ) ( I 1 ) × ( f 1 f 2 ) ( J 1 1 ) = I 1 × J 1 1 and consider that F t ( I 1 × J 1 1 ) { I 1 × J 1 1 , I 1 × J 2 1 } for 0 < t < 2 ).
Thus, we assume that q is even. The number of rectangles of L must be a multiple of 4. Since L 1 has an even number of rectangles, the following cases sum up the possibilities.
(D5)
f 1 ( A ) B = . In this case, the ω -limit is a set L which is the union of L 1 and L 2 both with the same number of rectangles. We also have that L i has an even number of rectangles for i = 1 , 2 . Observe that: p 1 ( π 1 ( R ) ) = p and p 2 ( π 2 ( R ) ) = q for each entire rectangle R having the form I i × J j = I i × J j 1 J j 2 and each projection of a rectangle of L 1 must have a common point with the projection of another rectangle; similarly, p 2 ( π 2 ( R ) ) = p and p 1 ( π 1 ( R ) ) = q for each entire rectangle R L 2 (having the form ( I ) j × ( J ) i = ( I ) j 1 ( I ) j 2 × ( J ) i ) and each projection of a rectangle must have a common point with the projection of another rectangle. See Figure 12.
(D6)
f 1 ( A ) Int ( B ) = and f 1 ( A ) B . By Lemma 4 and Remark 2, we know that each connected component of A f 2 ( B ) has the form I i I i I i + 1 , where I i = [ a i , b i ] , I i = [ b i , a i + i ] , I i + 1 = [ a i + 1 , b i + 1 ] , for some values a i < b i < a i + 1 < b i + 1 . Notice that p = 2 q , = p , q = 2 ; moreover, the number of rectangles in L = L 1 L 2 is just 4 q . Here, the ‘entire’ rectangles R in L 1 have the form I i × J j = I i × J j 1 J j 2 , and we have p 1 ( π 1 ( R ) ) = p = 1 and p 2 ( π 2 ( R ) ) = q = 2 . For rectangles R in L 2 , having type ( I ) i 1 ( I ) i 2 × J j , instead we find p 1 ( π 1 ( R ) ) = q = 2 and p 2 ( π 2 ( R ) ) = p = 1 . See Figure 13.

3.3. A and B No Mixing

Realize that if A and B are no mixing, then f 1 ( A ) and f 2 ( B ) are also no mixing. We can assume that, except for equivalences, there are closed intervals I i 1 and I i 2 , whose intersection is a fixed point of ( f 2 f 1 ) p and such that I i = I i 1 I i 2 , ( f 2 f 1 ) p ( I i 1 ) = I i 2 , ( f 2 f 1 ) p ( I i 2 ) = I i 1 and ( f 2 f 1 ) 2 p | I i j is mixing on I i j for i = 1 , 2 , , p and j = 1 , 2 . A similar situation occurs for B, with J j = J j 1 J j 2 , j = 1 , , q . We also assume that R 1 = I 1 1 × J 1 1 . Let us assume also that I i 1 < I i 2 and J i 1 < J i 2 , where I < J means that x < y for each x I and y J . Now, according to Lemma 4, only the cases f 1 ( A ) B = and f 1 ( A ) Int ( B ) are admissible (notice that the last one is equivalent to f 1 ( A ) = B ). Recall that = lcm ( p , q ) , p and q being the number of intervals in A and B, respectively. Moreover, thanks to the equivalence relation given in Definition 1, we can assume without loss of generality that ( f 2 f 1 ) ( I i ) = I i + 1 ( mod p ) and ( f 1 f 2 ) ( J j ) = J j + 1 ( mod q ) .
  • Case f 1 ( A ) B = . Firstly, we claim that the number of rectangles in the orbit of I 1 × J 1 , Orb F ( I 1 × J 1 ) = { I 1 × J 1 , f 2 ( J 1 ) × f 1 ( I 1 ) , ( f 2 f 1 ) ( I 1 ) × ( f 1 f 2 ) ( J 1 ) , } , is equal to 2 . To see it, let { a } = I 1 1 I 1 2 , { b } = J 1 1 J 1 2 ; we know that a (b) is a periodic point of f 2 f 1 ( f 1 f 2 ) of period p (q). We assert that ( a , b ) is a periodic point of F of period 2 . Let m be the order of ( a , b ) for the map F. Since F 2 ( a , b ) = ( ( f 2 f 1 ) ( a ) , ( f 1 f 2 ) ( b ) ) = ( a , b ) , on the one hand we have m | 2 . Thus, F 2 m ( a , b ) = ( ( f 2 f 1 ) m ( a ) , ( f 1 f 2 ) m ( b ) ) = ( a , b ) ; on the other hand, we also deduce that p | m and q | m , and consequently | m . From the above reasoning, either m = or m = 2 . If it were m = , with even, = 2 2 , then F ( a , b ) = ( ( f 2 f 1 ) 2 ( a ) , ( f 1 f 2 ) 2 ( b ) ) = ( a , b ) and p | 2 , q | 2 , in contradiction with the definition of the lowest common multiple. If it were m = , with odd, = 2 s + 1 , now F 2 s + 1 ( a , b ) = ( a , b ) would give us ( f 2 f 1 ) s ( f 2 ( b ) ) = a , ( f 1 f 2 ) s ( f 1 ( a ) ) = b , so ( a , b ) ( A × B ) ( f 2 ( B ) × f 1 ( A ) ) , that is, a A f 2 ( B ) , contrary to our hypothesis. Therefore, ( a , b ) is F-periodic and its period is 2 . As a consequence, Orb F ( I 1 × J 1 ) has 2 different rectangles (maybe with common vertexes). Since F 2 ( I 1 × J 1 ) = I 1 × J 1 , and is the first time s in which ( f 2 f 1 ) s ( I 1 ) × ( f 1 f 2 ) s ( J 1 ) = I 1 × J 1 , we have that Orb F ( I 1 × J 1 ) has either or 2 elements. But the case is forbidden because then F ( a , b ) = ( a , b ) due to the fact that ( a , b ) , F ( a , b ) , , are the ‘middle points’ of I 1 × J 1 and its respective images. This ends the claim.
    The last claim does not imply necessarily that the number k of rectangles in the ω -limit L = ω F ( x , y ) = Orb F ( I 1 1 × J 1 1 ) must be 2 . It will depend on the parity of k 1 : = p and k 2 : = q . Realize that k 1 and k 2 cannot be even simultaneously, at least some of them are odd.
    If k 1 is odd and k 2 is even (the case k 1 even and k 2 odd is analogous), then F 2 ( I 1 1 × J 1 1 ) = ( f 2 f 1 ) ( I 1 1 ) × ( f 1 f 2 ) ( J 1 1 ) = I 1 2 × J 1 1 , and really we have 2 different rectangles in L because the parts I 1 1 × J 1 1 and I 1 2 × J 1 1 gives rise to the union of I 1 × J 1 1 . The distribution that appears is equal to the case mixing–no mixing previously considered, distribution D5.
    If k 1 and k 2 are both odd integers, then = p k 1 = q k 2 and F 2 ( I 1 1 × J 1 1 ) = ( f 2 f 1 ) ( I 1 1 ) × ( f 1 f 2 ) ( J 1 1 ) = I 1 2 × J 1 2 , and in this case we find 4 different rectangles (notice that F 2 j ( I 1 1 × J 1 1 ) I 1 1 × J 1 1 for j = 1 , , 1 ); moreover, the rectangles in the ω -limit L are distributed in two groups of rectangles, namely L 1 and L 2 , with | L 1 | = | L 2 | = 2 . The distribution of L 2 mimics the distribution of L 1 , shifting the position of the axes. See Figure 14.
    Thus, let us assume k 1 and k 2 are odd numbers. Then, structures that are made up of two rectangles with a common point appear, which allows us to consider different orientations, namely, ( + ) and ( ) see Figure 15.
    For this case, there must coexist these types of structures with both orientations, but, how many of them?
    In order to describe and count the structures with negative orientation, we proceed as follows. Recall that we assume A = i = 1 p I i , B = j = 1 q J j , and both ( f 2 f 1 ) p | I i and ( f 1 f 2 ) q | J j are no mixing. We put I i = I i 1 I i 2 , J j = J j 1 J j 2 , with I i 1 I i 2 , J j 1 J j 2 . Moreover, p q , = lcm ( p , q ) and k 1 = p , k 2 = q are odd integers. If the ω -limit set L is written as L = L 1 L 2 , take into account that we are going to describe the structures with negative orientation in L 1 , for subrectangles contained in bigger rectangles of type I i × J j , and that we start to iterate with the subrectangle I 1 1 × J 1 1 .
    For i = 1 , , p define σ ( j ) { 1 , 2 } as the value for which
    ( f 2 f 1 ) i ( I 1 1 ) = I 1 + i ( mod ( p ) ) σ ( i ) .
    Notice that σ ( p ) = 2 .
    Similarly, for j = 1 , , q , define τ ( j ) { 1 , 2 } to be value holding
    ( f 1 f 2 ) j ( J 1 1 ) = J 1 + j ( mod ( q ) ) τ ( j ) .
    From the mixing property of f 1 f 2 , we have τ ( q ) = 2 . In short,
    1 2 p 1 p σ ( 1 ) σ ( 2 ) σ ( p 1 ) 2 , 1 2 q 1 q τ ( 1 ) τ ( 2 ) τ ( q 1 ) 2 .
    We can extend the definition to two sequences
    σ : N { 1 , 2 } N , τ : N { 1 , 2 } N ,
    in this manner: from the mixing properties of f 2 f 1 and f 1 f 2 , we know, for instance, that ( f 2 f 1 ) p + 1 ( I 1 1 ) = ( f 2 f 1 ) ( I 1 2 ) = I 1 σ ( 1 ) ¯ , where we use the notation r ¯ to denote the value
    r ¯ = 1 + r ( mod ( 2 ) ) { 1 , 2 } ;
    therefore, we can define σ ( p + j ) = σ ( j ) ¯ for j = 1 , , p . Similarly, ( f 2 f 1 ) 2 p + 1 ( I 1 1 ) = ( f 2 f 1 ) ( I 1 1 ) = I 1 σ ( 1 ) , and we can define σ ( 2 p + j ) = σ ( j ) for j = 1 , , p . Thus,
    σ ( n ) = σ ( r ) , if n = ( 2 j ) p + r , for some j 0 , r { 1 , , p } , σ ( r ) ¯ , if n = ( 2 j + 1 ) p + r , for some j 0 , r { 1 , , p } .
    Notice that ( f 2 f 1 ) n ( I 1 1 ) = I 1 + n ( mod ( p ) ) σ ( n ) . Similarly, we extend τ as
    τ ( n ) = σ ( s ) , if n = ( 2 j ) q + s , for some j 0 , s { 1 , , q } , σ ( s ) ¯ , if n = ( 2 j + 1 ) q + s , for some j 0 , s { 1 , , q } .
    Here, ( f 1 f 2 ) n ( I 1 1 ) = I 1 + n ( mod ( q ) ) τ ( n ) .
    Notice that F 2 ( I 1 1 × J 1 1 ) = ( f 2 f 1 ) ( I 1 1 ) × ( f 1 f 2 ) ( J 1 1 ) = I 1 σ ( ) × J 1 τ ( ) , and the same time F 2 ( I 1 1 × J 1 1 ) = ( ( f 2 f 1 ) p ) k 1 ( I 1 1 ) × ( ( f 1 f 2 ) q ) k 2 ( J 1 1 ) = I 1 2 × J 1 2 . This implies that σ ( ) = τ ( ) = 2 because k 1 and k 2 are odd integers, and we can observe that from this point the values of the orbit of I 1 1 × J 1 1 belong to the same structure.
    Notice also that if i { 1 , , } then
    F 2 ( + i ) ( I 1 1 × J 1 1 ) = F 2 i ( I 1 2 × J 1 2 ) = I 1 + i ( mod ( p ) ) σ ( i ) ¯ × J 1 + i ( mod ( q ) ) τ ( i ) ¯ ,
    whenever F 2 i ( I 1 1 × J 1 1 ) = I 1 + i ( mod ( p ) ) σ ( i ) × J 1 + i ( mod ( q ) ) τ ( i ) . As we see, this again guarantees that our extensions, σ , τ : N { 1 , 2 } N are well defined.
    Additionally, in order to check if the structure has positive or negative orientation, it suffices, according to (5), to analyze the pairs ( σ ( i ) , τ ( i ) ) , with i { 1 , , } . To this regard, define
    O ( i ) = ( σ ( i ) , τ ( i ) ) , i = 1 , , .
    If O ( i ) = ( r , r ) for some r { 1 , 2 } , we say that I 1 + i ( mod ( p ) ) σ ( i ) × J 1 + i ( mod ( q ) ) τ ( i ) has positive orientation; if, on the contrary, O ( i ) = ( r , r ¯ ) , for r { 1 , 2 } , we say that the structure has negative orientation.
    Consequently, if we try to count the positive and negative orientations, we only need to see the character of the pairs O ( i ) = ( σ ( i ) , τ ( i ) ) , i = 1 , , .
    For instance, if p = 5 and q = 3 , with
    1 2 3 4 5 1 2 2 1 2 , 1 2 3 2 1 2 ,
    we obtain:
    ( 1 , 1 ) ( σ ( 1 ) , τ ( 1 ) ) = ( 1 , 2 ) ( σ ( 2 ) , τ ( 2 ) ) = ( 2 , 1 ) ( σ ( 3 ) , τ ( 3 ) ) = ( 2 , 2 ) ( σ ( 4 ) , τ ( 1 ) ¯ ) = ( 1 , 1 ) ( σ ( 5 ) , τ ( 2 ) ¯ ) = ( 2 , 2 ) ( σ ( 1 ) ¯ , τ ( 3 ) ¯ ) = ( 2 , 1 ) ( σ ( 2 ) ¯ , τ ( 1 ) ) = ( 1 , 2 ) ( σ ( 3 ) ¯ , τ ( 2 ) ) = ( 1 , 1 ) ( σ ( 4 ) ¯ , τ ( 3 ) ) = ( 2 , 2 ) ( σ ( 5 ) ¯ , τ ( 1 ) ¯ ) = ( 1 , 1 ) ( σ ( 1 ) , τ ( 2 ) ¯ ) = ( 1 , 1 ) ( σ ( 2 ) , τ ( 3 ) ¯ ) = ( 2 , 1 ) ( σ ( 3 ) , τ ( 1 ) ) = ( 2 , 2 ) ( σ ( 4 ) , τ ( 2 ) ) = ( 1 , 1 ) ( σ ( 5 ) , τ ( 3 ) ) = ( 2 , 2 ) ( σ ( 1 ) ¯ , τ ( 1 ) ¯ ) = ( 2 , 2 ) ,
    and from this point we will obtain the opposite orbit to the last = 15 iterates. In this case, the number of negative orientations is 5.
    Once we have described how to count the orientations in L 1 , for the set L 2 that has subrectangles of type ( I ) i ( mod ( q ) ) s × ( J ) i ( mod ( p ) ) t , with s , t { 1 , 2 } , we proceed in a similar way to that described for L 1 . Since we have assumed that f 1 ( I i ) = J i and f 2 ( J i ) = I i , we write f 2 ( J 1 1 ) × f 1 ( I 1 1 ) = ( I ) 1 µ ( 0 ) × ( J ) 1 ρ ( 0 ) , for suitable µ ( 0 ) , ρ ( 0 ) { 1 , 2 } . Now, we have to define µ ( s ) , s = 1 , , q as the value in { 1 , 2 } for which ( f 2 f 1 ) s ( ( I ) 1 µ ( 0 ) ) = ( I ) 1 + s ( mod ( q ) ) µ ( s ) , and, similarly, ρ ( t ) { 1 , 2 } will be characterized by ( f 1 f 2 ) t ( ( J ) 1 ρ ( 0 ) ) = ( J ) 1 + t ( mod ( p ) ) ρ ( t ) , for t = 1 , , p . Notice that µ ( q ) = µ ( 0 ) ¯ and ρ ( p ) = ρ ( 0 ) ¯ . By extending µ and ρ to all positive integers, for counting the negative orientations we will have to pick the pairs ( µ ( i ) , ρ ( i ) ) with µ ( i ) ρ ( i ) , for i = 1 , , .
  • Case f 1 ( A ) Int ( B ) . This means that p = q = , in fact f 1 ( A ) = B and f 2 ( B ) = A . Firstly, let us show that the point ( a , b ) I 1 × J 1 , given by a = I 1 1 I 1 2 , b = J 1 1 J 1 2 , is F-periodic and its (minimal) period m can be or 2 . Indeed, it is clear that F 2 ( a , b ) = ( ( f 2 f 1 ) ( a ) , ( f 1 f 2 ) ( b ) ) = ( a , b ) because a and b are fixed points of ( f 2 f 1 ) and ( f 1 f 2 ) , respectively, as a consequence of the no mixing property satisfied by A and B, and the fact that = p = q . On the other hand, if n < were the order of ( a , b ) , then ( a , b ) = F 2 n ( a , b ) = ( ( f 2 f 1 ) n ( a ) , ( f 1 f 2 ) n ( b ) ) would imply that | n , a contradiction. Therefore, m is either or 2 .
    Consequently, we must distinguish two cases according to whether the order m of the aforementioned F-periodic ( a , b ) is or 2 :
    (i.O)
    If m = , we affirm that the number k of rectangles in L = ω F ( x , y ) is k = , and in fact ω F ( x , y ) is composed of rectangles of type I i × J j . To prove it, recall that we are assuming that ( x , y ) R 1 = I 1 1 × J 1 1 I 1 × J 1 . Notice that F ( a , b ) = ( a , b ) I 1 × J 1 , so F ( I 1 1 × J 1 1 ) = I 1 i × J 1 j for some i , j { 1 , 2 } . If i = j = 1 , then we would have F 2 ( I 1 1 × J 1 1 ) = F ( I 1 1 × J 1 1 ) = I 1 1 × J 1 1 , but at the same time, for the decomposition of A and B obtained for their no mixing property, F 2 ( I 1 1 × J 1 1 ) = ( f 2 f 1 ) ( I 1 1 ) × ( f 1 f 2 ) ( J 1 1 ) = I 1 2 × J 1 2 , it is impossible. If i = j = 2 , now F ( I 1 1 × J 1 1 ) = I 1 2 × J 1 2 and since also F 2 ( I 1 1 × J 1 1 ) = I 1 2 × J 1 2 , we would obtain F s ( I 1 2 × J 1 2 ) = I 1 2 × J 1 2 for all s 1 , a new contradiction (at least, F 2 ( I 1 2 × J 1 2 ) = I 1 1 × J 1 1 ). Therefore, i j , which implies that either F ( I 1 1 × J 1 1 ) = I 1 1 × J 1 2 or F ( I 1 1 × J 1 1 ) = I 1 2 × J 1 1 . For instance, if F ( I 1 1 × J 1 1 ) = I 1 1 × J 1 2 , then F 3 ( I 1 1 × J 1 1 ) = F 2 ( I 1 1 × J 1 2 ) = I 1 2 × J 1 1 , and thus all the rectangle I 1 × J 1 is included in Orb F ( I 1 1 × J 1 1 ) . From here, and taking into account that an entire rectangle only contains at most a unique point of Orb F ( a , b ) , we deduce that | L | = , and ω F ( x , y ) is composed of k = rectangles of type I i × J j . Even more, its distribution follows the pattern of Distribution D1, and with equivalence we can reorder the intervals in such a way that f 1 ( I i ) = J i + 1 ( mod p ) and f 2 ( J i ) = I i + 1 ( mod p ) for i = 1 , , p . See Figure 16.
    Finally, notice that only the case odd is permitted here, since if is even, we would have ( a , b ) = F ( a , b ) and then f 2 f 1 2 ( a ) = a , f 1 f 2 2 ( b ) = b , impossible (realize that a and b are -periodic points of f 2 f 1 and f 1 f 2 , respectively).
    (ii.E)
    If m = 2 , we assert that | L | = 4 and, to be more precise, L = ω F ( x , y ) is composed of 4 rectangles having type I i u , J j v for some i , j { 1 , , 2 } , u , v { 1 , 2 } , such that each of them are included in I i × J j , with a common vertex given by a point of the orbit of ( a , b ) . To prove it, first notice that Orb F ( a , b ) = : { ( x i , y i ) : i = 1 , , 2 } Orb ( f 2 f 1 ) ( a ) × Orb ( f 1 f 2 ) ( b ) , so from Lemma 5 and Theorem 3-(2) we deduce that for any i { 1 , , 2 } there exist r , s { 1 , , 2 } , r s , such that x i = x r , y i = y s . This implies that the F-orbit of ( a , b ) is included in 2 entire rectangles of type I r × J s . On the other hand, F 2 ( I 1 1 × J 1 1 ) = ( f 2 f 1 ) ( I 1 1 ) × ( f 1 f 2 ) ( J 1 1 ) = I 1 2 × J 1 2 , and F j ( I 1 × J 1 ) I 1 × J 1 = for j = 1 , , because F j ( a , b ) ( a , b ) for j { 1 , , } and, according to the distribution provided for Theorem 3 to the orbit of ( a , b ) , each entire rectangle I i × J j only contains at most a unique point of Orb F ( a , b ) . All the above details allow us to conclude that k = | L | = 4 and each rectangle I i × J j containing a point of Orb F ( a , b ) is divided into two different subintervals with disjoint interiors and a point in Orb F ( a , b ) as common vertex, see Figure 17, and therefore we obtain a structure of the type described in Figure 15.
    Observe that if the position of the intervals is shifted, for example if I i 1 > I i 2 , for any i, then the orientation of every structure in the column i changes. This case is the same as that obtained in Distribution D2, but changing the entire rectangle by two subrectangles of the type given in Figure 15.

3.4. The Converse Result for the Non-Empty Interior Case

Until now, we have described the structure of ω -limit sets of Cournot maps with non-empty interior. Of course, given one of these structures L, up to equivalences, it is natural to ask whether it is possible or not to find a Cournot map F and a point ( x , y ) I 2 such that ω F ( x , y ) = L . The answer is the affirmative. The general strategy for this construction relies on the fact that we can take advantage of our knowledge of interval maps f : I I exhibiting union of intervals i = 1 m I i as ω -limit sets for suitable points x I . For instance, for any interval J = [ a , b ] , there is a continuous map f : J J with f ( a ) = a and f ( b ) = b such that f is topologically mixing (see ([1], [p. 162])).
In order to illustrate it, we do the corresponding converse result for Distributions D1 (with k odd), with the hope that the other cases can be managed for the reader without any difficulty.
(D1) Assume that L = i = 1 k ( I i × J i ) , k odd, and I i , J i verify ( D 1 ) , that is:
L = i = 1 k R i = i = 1 k ( I α i × J β i ) , with I α i I α j , J β i J β j , if i j ,
π 1 ( L ) = i = 1 k I α i = A , π 2 ( L ) = i = 1 k J β i = B .
To simplify the notation, let α i = i and β j = j , that is,
A : = i = 1 k π 1 ( R i ) = i = 1 k I i , B : = i = 1 k π 2 ( R i ) = i = 1 k J i .
Write I i = a i ( 1 ) , a i ( 2 ) , J i = b i ( 1 ) , b i ( 2 ) . We then define f 1 C ( I , I ) in such a way that
f 1 ( { a i ( 1 ) , a i ( 2 ) } ) = b i + 1 ( 1 ) , f i a i ( 1 ) + a i ( 2 ) 2 = b i + 1 ( 2 ) ,
and linear in the rest of I i , i = 1 , , k . Also, we define a map f 2 C ( I , I ) holding f 2 ( J i ) = I i + 1 in a linear way (change of variables) for i = 1 , , k . Then, it is straightforward to see that Orb F ( I 1 × J 1 ) = L . Moreover, f 2 f 1 ( I i ) = I i + 2 mod ( k ) , f 1 f 2 ( J i ) = J i + 2 mod ( k ) , i { 1 , , k } . Since k is odd, from the definitions of f j we deduce that f 2 f 1 is mixing on A, f 1 f 2 is mixing on B, and f 1 ( A ) = B , f 2 ( B ) = A . According to Theorem 2, there exists ( x , y ) I 2 such that ω F 2 k ( x , y ) = I 1 . Then ω F ( x , y ) = Orb ( I 1 × J 1 ) = L .

4. Applications to Economic Models

In the seminal paper of Day [19] it was highlighted that complex behavior that can be described as chaotic can emerge from simple economic structures. This fact has had as a consequence for the increasing interest in economic dynamics, which is supported by the large amount of related literature published since then.
In this frame, oligopoly structure plays an important role. The assumption that only a few firms can compete makes sense in some markets in which the goods are perfectly substitutable [20]. In the decision process, each firm adjusts its output (product decision) based on the expectation over the other firm’s output decisions. Under this premise, firms take their decisions simultaneously. In an oligopoly the supply side is (not perfectly) competitive—as we often say “Cournot competition”. A duopoly is an oligopoly in which the number of firms is equal to two. Following Friedman [21], “a duopoly is a market in which two firms sell a product to a large number of consumers. Each consumer is too small to affect the market price for the product, that is, on the buyers’ side, the market is competitive.”
Different theoretical models of duopoly have been considered [21]. In 1838, Cournot [22] proposed a non-collusive duopoly model. In this duopoly model, firms decide their output levels simultaneously, that is, firms compete in quantities and it is assumed that price is given by the market. Moreover, each firm seeks to maximize the profit taking into account the decision of the competitor. Cournot duopoly was considered in [17], where the complexity of the dynamics was established. Later, Dana and Montrucchio [13] gave more details about the dynamical properties of the Cournot model. More recently, Pražák and Kovárník have considered in [15] a nonlinear inverse demand function and have shown bifurcation diagrams of the duopoly model.
Antitriangular maps are closely related to Cournot duopoly models. In this section we deal with the type of ω -limits of several Cournot duopoly models in which dynamics is led by antitriangular maps.
Let us notice the relevance of this topic by highlighting its possible interest in implications for strategic decisions. In this direction, cyclical phenomena have an important role in economics in the analysis of the dynamics and fluctuations of the economic activity in a model. A cycle of length n is the orbit of a periodic point. In the matter at hand, that is, ω -limits of non-empty interior of Cournot maps, the full description of the structure is useful in the sense that it provides information about chaotic orbits (realize that ω -limits with non-empty interior appear when the Cournot map F is chaotic). A cyclical movement appears if, in the definition of cycle, we replace points by rectangles, since in each step the point of the chaotic orbit belongs to the corresponding rectangle and this turns on the fact that in each step we have boundaries (restrictions) for the values of the outputs because the boundaries of the rectangles limit the output values of the production firms when initial conditions have been fixed. In this way, the restriction of the regions of ω -limits in Cournot duopolies plays an important role in the analysis of dynamics. Therefore, the distribution of the ω -limits gives us information about the possible layouts in the rectangles giving the feasible region in which both firms take their output values, the rectangles being covered following a “cyclical process”.

4.1. Puu’s Duopoly

The following duopoly model was proposed by Puu [23]. In this model, the goods produced for both firms are equivalent and the demand function is isoelastic. It is assumed that the price is given by
p = 1 x + y ,
where x and y are the outputs of firms X and Y respectively. The costs are assumed to be linear with the form c 1 ( x ) = c 1 x and c 2 ( y ) = c 2 y , where c 1 and c 2 , the marginal costs, will be the model parameters. Obviously, now profits are given by
Π 1 = x x + y c 1 x ,
Π 2 = y x + y c 2 y .
Considering that the objective of the firms is to maximize their own profits, the equations Π 1 x = 0 and Π 2 y = 0 give us
x = y c 1 y ,
y = x c 2 x .
Finally, the reaction map is
F ( x , y ) = ( f 2 ( y ) , f 1 ( x ) ) = max { y c 1 y , 0 } , max { x c 2 x , 0 } ,
which is an antitriangular map in which has been introduced the max function due to the fact that productions cannot be negative. It is assumed without loss of generality that c 1 c 2 , and we can compute ω -limit sets, see some examples in Figure 18 (we have used the software Mathematica for generating Figure 18, Figure 19, Figure 20, Figure 21, Figure 22 and Figure 23). More details about the dynamics of the model can be found in [24].

4.2. Kopel’s Duopoly

M. Kopel introduced in [14] a general Cournot duopoly model in which two firms, X and Y, plan their productions, x t , y t , at time t, following the system of difference equations:
x t + 1 = max { 0 , ( 1 λ 1 ) x t + λ 1 µ 1 y t ( 1 y t ) } , y t + 1 = max { 0 , ( 1 λ 2 ) y t + λ 2 µ 2 x t ( 1 x t ) } ,
where λ i [ 0 , 1 ] and µ i > 0 for i = 1 , 2 . The positive parameters µ i measure the intensity of the effect that one firm’s action has on the other firm, see also [25] for more details. Then, the two-dimensional map
R λ 1 , λ 2 , µ 1 , µ 2 ( x , y ) : = ( max { 0 , ( 1 λ 1 ) x + λ 1 µ 1 y ( 1 y ) } , max { 0 , ( 1 λ 2 ) y + λ 2 µ 2 x ( 1 x ) } ) ,
describes the simultaneous choices of both firms.
Observe that taking λ 1 = λ 2 = 1 , a Cournot duopoly model is obtained, given as
F ( x , y ) = ( max { 0 , µ 1 y ( 1 y ) } , max { 0 , µ 2 x ( 1 x ) } ) .
In Figure 19, we have shown some ω -limits for the map (7). We have selected some of them. To get it, we have used random initial conditions, with 6 decimal digits by default.

4.3. Matsumoto-Nonaka’s Model

In [26] a two–market model consisting of two firms that produce differentiated goods is introduced, see also [27]. The first firm produces good x in the first market and the second one produces good y in the second market. In this model, different externalities affect the dynamics.
As in the previous subsection, in [26] a more general model is introduced. Nevertheless, we are interested in the particular case in which inverse demand functions are given by
p 1 ( x , y ) = ( α 1 ) 2 x 2 + ( α y ) 2 , p 2 ( x , y ) = 1 y 2 + ( β x ) 2 ,
where p 1 and p 2 are the market prices of goods x and y, respectively, and α [ 1 , 2 ] R and β [ 0 , 2 ] R . Each firm decides future production depending on the other firm’s choice and production externalities. Cost functions are given by
C 1 ( x , y ) = 2 ( α 1 ) α x y , C 2 ( x , y ) = 2 β x y ,
and the profit function of each firm is given by
Π 1 ( x , y ) = p 1 ( x , y ) x C 1 ( x , y ) = ( α 1 ) 2 x 2 + α 2 y 2 x 2 ( α 1 ) α x y , Π 2 ( x , y ) = p 2 ( x , y ) y C 2 ( x , y ) = 1 y 2 + β 2 x 2 y 2 β x y .
As assumed above, each firm tends to maximize its profit. In order to do this the firms can choose their production levels, which would affect to the other firm. The first firm maximizes the profit with respect to x and the same occurs for the second firm with respect to y. The reaction functions of the firms are given by
f α ( y ) = ( α y α + 1 ) 2 , g β ( x ) = ( β x 1 ) 2 .
Now, the function
R α , β ( x , y ) = ( f α ( y ) , g β ( x ) ) = ( ( α y α + 1 ) 2 , ( β x 1 ) 2 ) ,
is the reaction function for the outcome ( x , y ) . The iterations are given by
x t + 1 = f α ( y t ) = ( α y t α + 1 ) 2 , y t + 1 = g β ( x t ) = ( β x t 1 ) 2 ,
that is,
( x t + 1 , y t + 1 ) = F α , β ( x t , y t ) = ( f α ( y t ) , g β ( x t ) ) ,
where α [ 1 , 2 ] R and β [ 0 , 2 ] R . Thus, the reaction map F α , β is a Cournot map from [ 0 , 1 ] × [ 0 , 1 ] into [ 0 , 1 ] × [ 0 , 1 ] . In this situation, we obtain some ω -limits, the results are shown in Figure 20.

4.4. Cournot Duopoly When the Competitors Operate under Capacity Constraints

In [28] A. Norin and T. Puu introduced a Cournot duopoly where the competitors have capacity constraints. The production cost of the firms are given by
T C 1 ( x ) = log 1 x u , T C 2 ( y ) = log 1 y v ,
where u and v denote the capacity limits and x and y denote the supplies of the two competitors. Observe that when x = y = 0 then the total costs are zero and tend to infinity when production approaches capacity limits. The price p is given by p = 1 x + y and the profits are
X ( x , y ) = p · x T C 1 ( x ) = x x + y + log 1 x u , Y ( x , y ) = p · y T C 2 ( y ) = y x + y + log 1 y u .
To maximize the profits (10) we get the following equations
X x ( x , y ) = y ( x + y ) 2 1 u x = 0 , Y y ( x , y ) = x ( x + y ) 2 1 v y = 0 .
From the previous system of Equation (11), solving the first for x and the second for y (see [28] for details), the following reaction functions are obtained
f u ( y ) = max 0 , 1 2 4 u y + 5 y 2 3 2 y f v ( x ) = max 0 , 1 2 4 v x + 5 x 2 3 2 x ,
since clearly productions cannot be negative. Hence, the reaction map we construct is a Cournot map
F u , v ( x , y ) = ( f u ( y ) , f v ( x ) ) .
Different ω -limits for the model are shown in Figure 21, where the initial conditions are x 0 = 0.2 and y 0 = 0.3 . We have computed orbits of length equal to 200,000 and we have drawn the last 100,000 points.

4.5. A Recurrent Class of Two-Dimensional Endomorphisms

The class of maps given by F ( x , y ) = ( y , h ( x ) ) , where h ( x ) is a continuous function, piecewise continuously differentiable, has been considered among others in [29], and in this framework this kind of map provides us another different example to which we can apply this analysis.
Observe that F 2 ( x , y ) = ( h ( x ) , h ( y ) ) . Following [29] we consider the map h ( x ) = α x + β g ( γ x ) , where
g ( x ) = 4 µ x ( 1 x ) if 0 < x < 1 ( µ > 0 ) , 0 otherwise .
The parameters satisfy 0 < α < 1 , 1 < β < 0 and γ < 0 . In our particular case, the parameters will use in the simulations are fixed, namely α = 0.62386015 , β = 0.790837347 and γ = 0.85446789 . See results in Figure 22 and Figure 23.

5. Some Advances in the Empty-Interior Case

For a Cournot map, we already know the topological structure of an ω -limit set with empty interior, see Theorem 1. Essentially, the situation is similar to the interval case, the ω -limit set is a nowhere dense set. In the interval case this means that the set is totally disconnected. This changes for Cournot maps, we can find ω -limit sets with empty interior and locally connected, even connected.
Our first example shows an ω -limit set of empty interior homeomorphic to the circle S 1 = z C : | z | = 1 . Consider a transitive map f 1 : [ 0 , 1 ] [ 0 , 1 ] with f 1 ( 0 ) = 1 and f 1 ( 1 ) = 0 ; for instance, take
f 1 ( x ) = 1 2 x , if x [ 0 , 1 2 ] , T ( 2 ( x 1 2 ) ) , if x [ 1 2 , 1 ] ,
where T is the well-known tent map T ( x ) = 1 | 1 2 x | , x [ 0 , 1 ] .
f 1 being (totally) transitive, let x 0 [ 0 , 1 ] be a transitive point, that is, a point with orbit dense. Consider the map F 1 ( x , y ) = ( y , f 1 ( x ) ) . In this case, it is easily seen that
ω F 1 ( ( 0 , x 0 ) ) = 0 × I I × 1 { 1 } × I I × { 0 } .
Therefore, ω F 1 ( ( 0 , x 0 ) ) is homeomorphic to the unit circle. See Figure 24.
As a second example, consider the transitive map f 2 : [ 0 , 1 ] [ 0 , 1 ] given by
f 2 ( x ) = 2 ( x + 1 4 ) , if x [ 0 , 1 4 ] , 1 2 ( x 1 4 ) if x [ 1 4 , 3 4 ] , 2 ( x 3 4 ) if x [ 3 4 , 1 ] .
Notice that f 2 is transitive but f 2 2 is not. Consider a point y 0 for which ω f 2 ( y 0 ) = I , and define the antitriangular map F 2 ( x , y ) = ( y , f 2 ( x ) ) . Now, a direct computation of the orbit of ( 1 2 , y 0 ) gives the limit set (see Figure 25)
ω F 2 ( 1 2 , y 0 ) = 1 2 × I I × 1 2 .
In view of the last example, we stress that it is possible to find ω -limit sets of antitriangular maps consisting of the union of the diagonal and the graph of an interval map (for instance, see Figure 26).
Proposition 2.
Let f C ( I , I ) be a transitive map. Let x 0 I such that ω f ( x 0 ) = I . Then,
Δ Γ f = { ( x , x ) : x I } { ( x , f ( x ) ) : x I }
can be realized as the ω-limit set of the Cournot map F ( x , y ) = ( y , f ( x ) ) .
Proof. 
It suffices to consider the point ( x 0 , x 0 ) to obtain ω F ( x 0 , x 0 ) = Δ Γ f . □
Remark 3.
If in the above result, we choose a map f C ( I , I ) and a point x 0 such that ω f ( x 0 ) is a Cantor set C; notice that we are able to find totally disconnected ω limit sets of the form { ( x , x ) : x C } { ( x , f ( x ) ) : x C } . For instance, if we consider the well-known parabola f ( x ) = λ x ( 1 x ) of type 2 (its set of periods is given by all the powers of 2), where λ = 3.569 . . . is the limit value of the period doubling bifurcation or route to chaos of the unimodal family of parabolas f λ ( x ) = λ x ( 1 x ) , λ [ 0 , 4 ] (for instance, see [30] for more information), we can choose a point x 0 in such a way that ω f ( x 0 ) = C 0 is homeomorphic to the classical ternary Cantor set and, in this case for F ( x , y ) = ( y , f ( x ) ) , we find that ω F ( x 0 , x 0 ) = { ( x , x ) : x C 0 } { ( x , f ( x ) ) : x C 0 } , see Figure 27.
In the same direction, we find the following result on a peculiar type of ω -limit set for Cournot maps (see Figure 28).
Proposition 3.
Let f C ( I , I ) be a totally transitive map. Let Γ f be its graph and Γ f * = { ( f ( x ) , x ) : x I } . Then there exists an antitriangular map F and a point ( x , y ) I 2 such that ω F ( x , y ) = Γ f Γ f * .
Proof. 
Since f is transitive, there is x 0 I such that ω f ( x 0 ) = I . Consider the antitriangular map F ( x , y ) = ( f ( y ) , f ( x ) ) . Since f is totally transitive, it is easy to check that ω f ( x 0 , f ( x 0 ) ) = Γ f Γ f * . □
In our third example we stress the fact that, contrary to the first examples, there exist ω -limit sets of antitriangular maps which are not connected. To see it, define the map (see Figure 29)
f 3 ( x ) = 1 3 2 x , if x 0 , 1 3 , f 2 ( 3 ( x 1 3 ) ) , if x 1 3 , 2 3 , 1 3 2 x , if x 1 3 , 2 3 ,
where f 2 was defined in the second example. In this case, there exists z 0 [ 1 3 , 2 3 ] such that ω f 3 ( z 0 ) = 1 3 , 2 3 . By defining F 3 ( x , y ) = ( y , f 3 ( x ) ) , a direct inspection of the orbit of ( 0 , z 0 ) gives us the limit set
ω F 3 ( ( 0 , x 0 ) ) = { 0 } × 1 3 , 2 3 1 3 , 2 3 × { 1 } { 1 } × 1 3 , 2 3 1 3 , 2 3 × { 0 } .
Our following example exhibits an ω -limit set with empty interior and homeomorphic to C 2 : = ( x , y ) : x 2 + y 2 = 1 ( x , y ) : ( x 2 ) 2 + y 2 = 1 , namely C 2 is the union of two circles joined by a point. We define F 4 ( x , y ) = ( y , f 4 ( x ) ) , where
f 4 ( x ) = 3 x , if x 0 , 1 3 , 3 x + 2 , if x 1 3 , 2 3 , 3 x 2 , if x 2 3 , 1 .
Since f 4 is a transitive map, take a point w 0 I such that ω f 4 ( w 0 ) = I . Then by direct computation we find that
ω F 4 ( ( w 0 , w 0 ) ) = Δ Γ f 4 ,
where Δ is the diagonal of the unit square and Γ f 4 = ( x , f 4 ( x ) ) : x I is the graph of f 4 (see Figure 30).
In fact, we can generalize the above example to find ω -limit sets homeomorphic to the union of n-circles, n 2 , attach one of them to the other by a point, or
C n = ( x , y ) R 2 : ( x 2 j ) 2 + y 2 = 1 , for some j = 0 , 1 , , n 1 .
This is a substantial difference of the ω -limit sets of antitriangular maps with respect to the one dimensional case—the limit sets can be connected and, at the same time, exhibit empty interior.
Proposition 4.
For each n 1 , there exists an antitriangular map Φ n such that ω Φ n ( X n ) is homeomorphic to C n for some X n I 2 .
Proof. 
We distinguish two cases according to the parity of n.
If n = 2 k , define (see Figure 31 for n = 6 )
φ n ( x ) = ( n + 1 ) x 2 j n + 1 , if x 2 j n + 1 , 2 j + 1 n + 1 for j = 0 , 1 , , n 2 , 1 ( n + 1 ) x 2 j 1 n + 1 , if x 2 j 1 n + 1 , 2 j n + 1 for j = 1 , , n 2 .
Since φ n is transitive, take a point x 0 I for which ω φ n ( x 0 ) = I . Define Φ n ( x , y ) = ( y , φ n ( x ) ) . Then, as an immediate consequence of iterating ( x 0 , x 0 ) successively and to consider the transitivity of the point x 0 , we obtain
ω Φ n ( ( x 0 , x 0 ) ) = Δ Γ φ n ,
where Δ is the diagonal of the unit square and Γ φ n = ( x , φ n ( x ) ) : x I is the graph of φ n .
For the odd case, first we define (see Figure 32)
φ 3 ( x ) = 4 x , if x 0 , 1 4 , 3 2 2 x , if x 1 4 , 1 2 , 4 x 3 2 , if x 1 2 , 5 8 , 6 8 x , if x 5 8 , 3 4 , 4 x 3 , if x 3 4 , 1 .
With this function, we consider the antitriangular map Φ 3 ( x , y ) = ( y , φ 3 ( x ) ) . Notice that φ 3 ( x ) is a transitive map, therefore there exists w 0 I such that ω φ 3 ( w 0 ) = I . With respect to Φ 3 , it is easily seen that ω Φ 3 ( w 0 , w 0 ) = Δ Γ φ 3 , where, again, Γ φ 3 means the graph of φ 3 .
In general, for n = 2 k + 1 , n 5 , we define (see Figure 33 for n = 7 )
φ n ( x ) = T 2 ( k 1 ) x j 2 ( k 1 ) , if x j 2 ( k 1 ) , j + 1 2 ( k 1 ) , j = 0 , , k 2 , φ 3 ( 2 x 1 ) , if x 1 2 , 5 8 13 16 , 1 , 9 4 2 x , if x 5 8 , 3 4 , 4 x 9 4 , if x 3 4 , 13 16 ,
where T ( · ) denotes the well-known tent map T ( z ) = 1 | 1 2 z | , z [ 0 , 1 ] . That is, the graph of φ n ( x ) is composed of k 2 tent maps placed between 0 and 1 2 , whereas in 1 2 , 1 we draw the scaled graph of φ 3 in the zones 1 2 , 5 8 13 16 , 1 and try to establish a fixed point in x = 3 4 . Again, if z 0 I is a transitive point of φ n , and we put Φ n ( x , y ) = ( y , φ n ( x ) ) , it is straightforward to obtain ω Φ n ( z 0 , z 0 ) = Δ Γ φ n , being Γ φ n the graph of φ n . □
Now, let us present some other connected ω -limit sets whose interiors are empty, and where its aspect is similar to a lattice structure.
Example 1.
Consider a totally transitive map f : I I , for instance the tent map. Let x 0 I such that ω f ( x 0 ) = I and define the Cournot map F ( x , y ) = ( y , f ( x ) ) . On the other hand, take a periodic point y 0 of period N 1 . Then, if { y 0 , y 1 , , y N 1 } is the periodic orbit, it is easily seen, with the help of Remark 1, that
ω F ( x 0 , y 0 ) = I × { y 0 , y 1 , , y N 1 } { y 0 , y 1 , , y N 1 } × I .
In Figure 34 you can see the lattice generated by a periodic point of period 2.
According to the aspect of the drawn ω -limit sets of a Cournot map with non-empty interior, we are left the following result concerning the connectivity of such a ω -limit set. Before we state a topological result (see ([31], p. 27)) which implies, as an easy consequence, that the union of two closed sets in the interval has an empty interior if each of them has in turn an empty interior.
Lemma 7.
If K is a closed set in a topological space ( X , T ) , and A X is any subset of X, then Int K Int ( A ) = Int K A .
We present here a characterization for connected ω -limit sets of Cournot maps that have non-empty interior. Realize that we can justify it in view of our analysis developed in Section 3, nevertheless we give the corresponding theoretical proof.
Proposition 5.
Let F ( x , y ) = ( f 2 ( y ) , f 1 ( x ) ) , ( x , y ) I 2 be a Cournot map. Let ω F ( x , y ) be an ω-limit set with non-empty interior. Then, ω F ( x , y ) is connected if and only if
(1) 
π j ( ω F ( x , y ) ) is connected, where π j is meant the canonical projection to the j-th coordinate, j = 1 , 2 .
(2) 
ω F 2 ( x , y ) ω F 2 ( F ( x , y ) ) .
Proof. 
Assume that ω F ( x , y ) is connected. Since π j is continuous, j = 1 , 2 , we have ( 1 ) . On the other hand, if ω F 2 ( x , y ) ω F 2 ( F ( x , y ) ) = , then, taking into account that ω F ( x , y ) = ω F 2 ( x , y ) ω F 2 ( F ( x , y ) ) , we would have a decomposition of ω F ( x , y ) into two closed disjoint sets, which contradicts that ω F ( x , y ) is connected.
Now, we assume that ( 1 ) and ( 2 ) hold, and we are going to prove that in these circumstances ω F ( x , y ) is connected. By Proposition 1 and ( 1 ) , π 1 ( ω F ( x , y ) ) = ω f 2 f 1 ( x ) ω f 2 f 1 ( f 2 ( y ) ) is a connected set in the real line, therefore an interval, which is possibly degenerate. If the interval is degenerate, then both ω f 2 f 1 ( x ) and ω f 2 f 1 ( f 2 ( y ) ) are singletons (in fact, the same point), and it is easily seen that ω F ( x , y ) is reduced to a fixed point, therefore a connected set. So, next we assume that π 1 ( ω F ( x , y ) is a closed interval with non-empty interior. According to Lemma 7, either ω f 2 f 1 ( x ) or ω f 2 f 1 ( f 2 ( y ) ) has non-empty interior. Without loss of generality, assume that ω f 2 f 1 ( x ) = i = 1 m I i , where each I i is a non-degenerate subinterval, I r I s = if r s , and ( f 2 f 1 ) ( I i ) = I i + 1 ( mod m ) , i = 1 , , m . Necessarily, either m = 1 or m = 2 : if m 3 , then if we denote I i = [ a i , b i ] , i = 1 , , m , the omega-limit set ω f 2 f 1 ( f 2 ( y ) ) must contain the intervals [ b i , a i + 1 ] for i = 1 , , m 1 , but this is impossible, as was shown in Lemma 4.
(i)
If m = 2 , then ω f 2 f 1 ( x ) = A = I 1 I 2 , and by force ω f 2 f 1 ( f 2 ( y ) ) = I 1 , with π 1 ( ω F ( x , y ) ) = I 1 I 1 I 2 . Applying the maps f 1 , f 2 , we find ω f 1 f 2 ( f 1 ( x ) ) = f 1 ( ω f 2 f 1 ( x ) ) = f 1 ( A ) = f 1 ( I 1 ) f 1 ( I 2 ) = : J 1 J 2 , and ω f 1 f 2 ( y ) = ω f 1 f 2 ( ( f 1 f 2 ) ( y ) ) = f 1 ( ω f 2 f 1 ( f 2 ( y ) ) ) = f 1 ( I 1 ) = : J 1 . By Lemma 4, A is mixing, so ( f 2 f 1 ) 2 | I i is topologically mixing, i = 1 , 2 . Then, by Theorem 2 there exists ( x 1 , y 1 ) I 2 such that:
(i.1)
either ω F 4 ( x 1 , y 1 ) = ω ( f 2 f 1 ) 2 ( x 1 ) × ω ( f 1 f 2 ) 2 ( y 1 ) = I 1 × J 1 s , for some s { 1 , 2 } (in fact, here J 1 is not mixing for ( f 1 f 2 ) , but we can decompose it as J 1 1 J 1 2 and each ( f 1 f 2 ) 2 | J 1 j is mixing, j = 1 , 2 ): in this case, since ω F ( x , y ) has non-empty interior and we can use Lemma 3, it can be noticed that the we obtain Distribution D6, which contradicts our hypothesis ( 2 ) on the intersection of ω F 2 ( x , y ) and ω F 2 ( F ( x , y ) ) ;
(i.2)
or ω F 4 ( x 1 , y 1 ) = ω ( f 2 f 1 ) 2 ( x 1 ) × ω ( f 1 f 2 ) 2 ( y 1 ) = I 1 × J 1 , if ( f 1 f 2 ) | J 1 is mixing; in this case, reasoning as above, we arrive at Distribution D4, see Figure 10, a connected set with non-empty interior.
(ii)
Let m = 1 . Notice that if Int ( ω F ( x , y ) ) , also ω f 1 f 2 ( y ) has non-empty interior, as a consequence of Proposition 1 and the fact that in a Cartesian product the connected components of a set are the product of connected components of each space, see [31]. Here, additionally, we can distinguish two different cases depending on the nature of ω f 1 f 2 ( y ) = B .
(ii.1)
If B = J is an interval with f 2 ( B ) = f 2 ( J ) = I 1 , we obtain: either Distribution D1, with k = 1 , if I 1 is mixing, therefore a connected ω -limit set holding ( 1 ) and ( 2 ) ; or the Distribution that we have found in case A, B no mixing, two rectangles tied by the vertex obtained with the ‘middle’ points (fixed points) of I 1 and J 1 .
(ii.2)
If B = J is an interval with f 1 ( A ) B , f 1 ( A ) Int ( B ) = , according to Lemma 4 both A = I 1 and J 1 are mixing. Reasoning as in Case (i.2), we can find ( x 1 , y 1 ) such that ω f 2 f 1 ( x ) = I 1 and ω f 1 f 2 ( y ) = J , and it is immediate to see that ω F will be the union of two rectangles tied by a common vertex, a connected set.
Remark 4.
We emphasize that the proof strengthens our study in Section 3, because inside it we have found the only possible connected ω-limit sets with non-empty interior that appeared in that section. Moreover, notice that the conditions are always necessary, even in the general frame of a compact metric space and a continuous map φ : X X that has the form φ ( x , y ) = ( φ 2 ( y ) , φ 1 ( x ) ) , with φ j : X X , j = 1 , 2 . It remains for us to study whether, in fact, they are or are not also sufficient conditions in order to characterize the connectivity of ω-limit sets of Cournot maps with empty interior.
Remark 5.
In the above Proposition, both conditions ( 1 ) and ( 2 ) are needed in order to attain that the ω-limit set ω F ( x , y ) be connected. In this sense, it is possible to find a non-connected ω-limit set ω F ( x , y ) holding ( 1 ) : see Figure 35.
Additionally, we can find another non-connected ω-limit set ω F ( x , y ) verifying, nevertheless, the property ( 1 ) , see Figure 36 for the non-empty interior case. With regards to the empty interior case, consider the transitive map f : [ 0 , 1 ] [ 0 , 1 ] given by f ( x ) = 1 2 + 2 x if 0 x 4 , f ( x ) = 3 2 2 x if 1 4 x 3 4 , and f ( x ) = 2 x 3 2 if 3 4 x 1 . It is easily seen that f is transitive but not totally transitive. Let { y 1 , y 2 } = { 1 6 , 5 6 } be a periodic orbit having order two, and define the Cournot map F ( x , y ) = ( y , f ( x ) ) . If x 0 has a dense orbit by f, so ω f ( x 0 ) = [ 0 , 1 ] , we find ω F ( x 0 , y 1 ) = [ 0 , 1 2 ] × { y 1 } { y 1 } × [ 1 2 , 1 ] [ 1 2 , 1 ] × { y 2 } { y 2 } × [ 0 , 1 2 ] . Then ω F ( x 0 , y 1 ) is not connected, however π j ( ω F ( x 0 , y 1 ) ) = [ 0 , 1 ] (see Figure 36).
Finally, realize that, according to our description of ω-limit sets of Cournot maps with non-empty interior, we are in a position to assert that both conditions are also sufficient in order to establish the connectivity of ω F ( x , y ) in the non-empty interior case, which is an open question in the case of empty interior.
We finish the section by mentioning the notion of minimal set and some associated results, for the case of Cournot maps, extracted from [18]. A minimal set M I 2 of a Cournot map F C A ( I 2 , I 2 ) is a non-empty, closed and invariant set by F, which does not contain a proper subset with the same three properties. In [18] it is proved that a minimal set M of F cannot be of the form C 1 × C 2 , where C 1 and C 2 are Cantor sets. In the same paper, it is shown that, nevertheless, given two solenoidal sets Q 1 and Q 2 having periodic decompositions that are relatively prime, we can find a Cournot map F ( x , y ) = ( g ( y ) , f ( x ) ) and x , y I such that ω F ( x , y ) = ( Q 1 × f ( Q 2 ) ) ( Q 2 × f ( Q 1 ) ) is a minimal set of F (for the notion of solenoidal set—a class of Cantor set—the reader is referred to [18] and references therein). An interesting question would be to find, if possible, a Cournot map that has the product C × C as an admissible ω -limit set, where C is a Cantor set.

6. Conclusions

Despite the difficulty in analyzing ω -limit sets for two-dimensional maps, in the case of Cournot maps we have been able to completely describe the structure of their omega limits with non-empty interior. As a complement, we have shown that these structures arise naturally in some economic models, which can be formulated by Cournot maps, for instance, the Puu’s duopoly or the Matsumoto-Nonaka’s model. Cyclical phenomena in economics attract great interest. Following Burns and Mitchell (1946), [32], “business cycles are a type of fluctuation found in the aggregate economic activity of nations that organize their work mainly in business enterprises—a cycle consists of expansions occurring at about the same time in many economic activities, followed by similarly general recessions, contractions, and revivals which merge into the expansion phase of the next cycle”. In mathematical terms, the orbit of a periodic point is called a cycle of length n. In the case at hand, we can observe that replacing points in the orbit by rectangles, a “cyclical movement” applies, in which the rectangle limits the values in each step, thus, a more general cyclical process can be considered and the classification of the orbits with non-empty interior that have been studied throughout this paper contributes to shedding light on economic dynamics.
Obviously, it is an open question to give a complete and detailed description of ω -limit sets of Cournot maps with empty interior. In this paper, we have provided some interesting examples showing that the limit set can be homeomorphic to the circle, even to the union of k circles attached between them by common tangent points; moreover, a difference with the one-dimensional case appears, now the limit set can be connected even though it itself has an empty interior. Another task to be carried out is to find in the non-empty interior case a general formulation for all possible realignments and counting of negative orientations which have appeared in the case A and B no mixing, to try to obtain a closed expression for this number of negative orientations.
Realize that Cournot maps can be generalized in the following way: in the n-dimensional cube I n = [ 0 , 1 ] n , we define
F ( x 1 , x 2 , , x n ) = f σ ( 1 ) ( x σ ( 1 ) ) , f σ ( 2 ) ( x σ ( 2 ) ) , , f σ ( n ) ( x σ ( n ) ) ,
where σ is a (cyclic) permutation of { 1 , 2 , , n } , and each f σ ( j ) is a continuous function defined from I into itself. These maps can be named permuted direct product maps (see for instance, [33] or [34]). Then, an interesting question would be the study of ω -limit sets with non-empty interior for permuted direct product maps. For instance, for n = 3 , we would have a union of cubes moving in I 3 according to specific rules to be determined.
Another interesting question is to prove whether the conditions ( 1 ) and ( 2 ) in Proposition 5 are sufficient or not in order to establish that the corresponding omega-limit is connected. Our conjecture is the affirmative and, even more, we can address the question to the general frame of a product X 1 × X 2 of compact metric spaces and, if we generalize the definition of a Cournot map as φ : X 1 × X 2 X 1 × X 2 , φ ( x , y ) = φ 2 ( y ) , φ 1 ( x ) , with φ i : X i X j , i j , to ask for a characterization of connected ω -limit sets in terms of their projections and the intersection of the omega-limits ω φ 2 ( x , y ) and ω φ 2 ( φ ( x , y ) ) .

Author Contributions

Investigation, A.L.-B. and M.M.-G.; Writing–original draft, A.L-B. and M.M.-G. The authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by AEI/FEDER, UE, Ministerio de Ciencias, Innovación y Universidades, Spain, Grant number MTM2017-84079-P.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Block, L.S.; Coppel, W.A. Dynamics in One Dimension; Lecture Note in Mathematics 1513; Springer: Berlin, Germany, 1992. [Google Scholar]
  2. Kolyada, S.F.; Snoha, L. Some aspects of topological transitivity—A survey. Grazer Math. Ber. 1997, 334, 3–35. [Google Scholar]
  3. Agronsky, S.J.; Bruckner, A.M.; Ceder, J.G.; Pearson, T.L. The structure of ω-limit sets for continuous functions. Real Anal. Exch. 1989, 15, 483–510. [Google Scholar] [CrossRef]
  4. Bruckner, A.M.; Smítal, J. The structure of ω-limit sets for continuous maps of the interval. Math. Bohem. 1992, 117, 42–47. [Google Scholar] [CrossRef]
  5. Agronsky, S.; Ceder, J. Each Peano subspace of Ek is an ω-limit set. Real Anal. Exch. 1991, 17, 371–378. [Google Scholar] [CrossRef]
  6. Agronsky, S.; Ceder, J. What sets can be ω-limit sets in En? Real Anal. Exch. 1991, 17, 97–109. [Google Scholar] [CrossRef]
  7. Ceder, J. Some results and problems about ω-limit sets. Real Anal. Exch. 1990, 16, 39–40. [Google Scholar] [CrossRef]
  8. Jiménez López, V.; Smítal, J. ω-limit sets for triangular mappings. Fund. Math. 2001, 167, 1–15. [Google Scholar] [CrossRef] [Green Version]
  9. Kolyada, S.F.; Snoha, L. On ω-limit sets of triangular maps. Real Anal. Exch. 1992, 18, 115–130. [Google Scholar] [CrossRef]
  10. Balibrea, F.; Cánovas, J.S.; Linero, A. ω-limit sets of antitriangular maps. Topol. Appl. 2004, 137, 13–19. [Google Scholar] [CrossRef] [Green Version]
  11. Puu, T. Nonlinear Economic Dynamics, 4th ed.; Springer: Berlin, Germany, 1997. [Google Scholar]
  12. Cánovas, J.S.; Linero, A. Topological dynamic classification of duopoly games. Chaos Solitons Fractals 2001, 12, 1259–1266. [Google Scholar] [CrossRef]
  13. Dana, R.A.; Montrucchio, L. Dynamic complexity in duopoly games. J. Econom. Theory 1986, 40, 40–56. [Google Scholar] [CrossRef]
  14. Kopel, M. Simple and Complex Adjustment Dynamics in Cournot Duopoly Models. Chaos Solitons Fractals 1996, 7, 2031–2048. [Google Scholar] [CrossRef]
  15. Pražák, P.; Kovárník, J. Nonlinear phenomena in Cournot duopoly model. Systems 2018, 6, 30. [Google Scholar] [CrossRef] [Green Version]
  16. Puu, T. Chaos in Duopoly Pricing. Chaos Solitons Fractals 1991, 1, 573–581. [Google Scholar] [CrossRef]
  17. Rand, D. Exotic phenomena in games and duopoly models. J. Math. Econ. 1978, 5, 173–184. [Google Scholar] [CrossRef]
  18. Balibrea, F.; Cánovas, J.S.; Linero, A. Minimal sets of antitriangular maps. Internat J. Bifur. Chaos Appl. Sci. Engrg. 2003, 13, 1733–1741. [Google Scholar] [CrossRef]
  19. Day, R.H. Irregular growth cycles. Am. Econ. Rev. 1982, 72, 406–414. [Google Scholar]
  20. Friedman, J. Oligopoly theory. In Handbook of Mathematical Economics. Volume 2; Arrow, K.J., Intriligator, M.D., Eds.; North Holland Publishing Co.: Amsterdam, The Netherlands, 1982; pp. 491–534. [Google Scholar]
  21. Friedman, J. Duopoly. In Game Theory; Eatwell, J., Milgate, M., Newman, P., Eds.; Palgrave Macmillan: London, UK, 1989; pp. 133–138. [Google Scholar]
  22. Cournot, A.A. Researches into the Mathematical Principle of the Theory of Wealth; Macmillan: New York, NY, USA, 1838. [Google Scholar]
  23. Puu, T. Chaos in business cycles. Chaos Solitons Fractals 1991, 1, 457–473. [Google Scholar] [CrossRef]
  24. Cánovas, J.S.; Muñoz-Guillermo, M. On the complexity of economic dynamics: An approach through topological entropy. Chaos Solitons Fractals 2017, 103, 163–176. [Google Scholar] [CrossRef]
  25. Cánovas, J.S.; Muñoz-Guillermo, M. On the dynamics of Kopel’s Cournot duopoly model. Appl. Math. Comput. 2018, 330, 292–306. [Google Scholar] [CrossRef]
  26. Matsumoto, A.; Nonaka, N. Statistical dynamics in a chaotic Cournot model with complementary goods. J. Econ. Behav. Organ. 2006, 61, 769–783. [Google Scholar] [CrossRef]
  27. Cánovas, J.S.; Muñoz-Guillermo, M. Describing the Dynamics and Complexity of Matsumoto-Nonaka’s Duopoly Model. Abstr. Appl. Anal. 2013, 2013, 18. [Google Scholar] [CrossRef]
  28. Puu, T.; Norin, A. Cournot duopoly when the competitors operate under capacity constraints. Chaos Solitons Fractals 2003, 18, 577–592. [Google Scholar] [CrossRef] [Green Version]
  29. Lupini, R.; Lenci, S.; Gardini, L. Bifurcations and multistability in a class of two-dimensional endomorphisms. Nonlinear Anal. 1997, 28, 61–85. [Google Scholar] [CrossRef]
  30. Sharkovsky, A.N.; Kolyada, S.F.; Sivak, A.G.; Fedorenko, V.V. Dynamics of One-Dimensional Maps; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1997. [Google Scholar]
  31. Engelking, R. General Topology; Heldermand: Berlin, Germany, 1989. [Google Scholar]
  32. Burns, A.F.; Mitchell, W.C. Measuring Business Cycles; NBER: Cambridge, MA, USA, 1946. [Google Scholar]
  33. Linero Bas, A.; Soler López, G. A note on the dynamics of cyclically permuted direct product maps. Topol. Appl. 2016, 203, 147–158. [Google Scholar] [CrossRef]
  34. Linero Bas, A.; Soler López, G. A splitting result on transitivity for a class of n-dimensional maps. Nonlinear Dyn. 2016, 84, 163–169. [Google Scholar] [CrossRef]
Figure 1. Case (1) in Theorem 3: Two points or an odd number of points.
Figure 1. Case (1) in Theorem 3: Two points or an odd number of points.
Mathematics 09 00452 g001
Figure 2. An even number n of points, n 4 , following the distribution stated in Case (2) of Theorem 3.
Figure 2. An even number n of points, n 4 , following the distribution stated in Case (2) of Theorem 3.
Mathematics 09 00452 g002
Figure 3. An even number n of points, n 4 , following the distribution stated in Case (3) of Theorem 3.
Figure 3. An even number n of points, n 4 , following the distribution stated in Case (3) of Theorem 3.
Mathematics 09 00452 g003
Figure 4. Two equivalent limit sets.
Figure 4. Two equivalent limit sets.
Mathematics 09 00452 g004
Figure 5. Mixing-mixing. Distribution D1. k = 5 ; f 1 ( A ) = B , A and B contain 5 disjoint intervals, that is, p = q = 5 ; k = = lcm ( 5 , 5 ) = 5 . Observe that p 1 ( I ) = 1 and p 2 ( J ) = 1 for each rectangle R = I × J .
Figure 5. Mixing-mixing. Distribution D1. k = 5 ; f 1 ( A ) = B , A and B contain 5 disjoint intervals, that is, p = q = 5 ; k = = lcm ( 5 , 5 ) = 5 . Observe that p 1 ( I ) = 1 and p 2 ( J ) = 1 for each rectangle R = I × J .
Mathematics 09 00452 g005
Figure 6. Mixing-mixing. Distribution D2. f 1 ( A ) Int ( B ) . In the left side: p = q = 3 , = 3 and k = 2 · = 6 ; p 1 ( π 1 ( R ) ) = 2 and p 2 ( π 2 ( R ) ) = 2 for each rectangle R in L. In the right side: p = q = 2 , = 2 , k = 2 = 4 ; again p 1 ( π 1 ( R ) ) = 2 and p 2 ( π 2 ( R ) ) = 2 .
Figure 6. Mixing-mixing. Distribution D2. f 1 ( A ) Int ( B ) . In the left side: p = q = 3 , = 3 and k = 2 · = 6 ; p 1 ( π 1 ( R ) ) = 2 and p 2 ( π 2 ( R ) ) = 2 for each rectangle R in L. In the right side: p = q = 2 , = 2 , k = 2 = 4 ; again p 1 ( π 1 ( R ) ) = 2 and p 2 ( π 2 ( R ) ) = 2 .
Mathematics 09 00452 g006
Figure 7. A and B mixing. Distribution D3. We define L 1 as the set of rectangles R such that p 1 ( π 1 ( R ) ) = 3 and p 2 ( π 2 ( R ) ) = 2 . The contrary occurs for rectangles R in L 2 , for which p 1 ( R ) = 2 and p 2 ( R ) = 3 . Thus, | L 1 | = | L 2 | = 12 and | L | = | L 1 L 2 | = 24 ; A contains 4 disjoint intervals, B is made of 6 disjoint intervals and f 1 ( A ) B = . Observe that = lcm ( 4 , 6 ) = 12 .
Figure 7. A and B mixing. Distribution D3. We define L 1 as the set of rectangles R such that p 1 ( π 1 ( R ) ) = 3 and p 2 ( π 2 ( R ) ) = 2 . The contrary occurs for rectangles R in L 2 , for which p 1 ( R ) = 2 and p 2 ( R ) = 3 . Thus, | L 1 | = | L 2 | = 12 and | L | = | L 1 L 2 | = 24 ; A contains 4 disjoint intervals, B is made of 6 disjoint intervals and f 1 ( A ) B = . Observe that = lcm ( 4 , 6 ) = 12 .
Mathematics 09 00452 g007
Figure 8. A and B mixing. Distribution D4. | L | = 8 . Observe that p i ( π i ( R ) ) = 1 for any R in L and i = 1 , 2 . Thus, | L 1 | = 4 and | L 2 | = 4 . The cardinality of A and B is equal to 4, thus = 4 ; f 1 ( A ) Int ( B ) = and f 1 ( A ) B , for this reason projections of rectangles have common vertices. Observe that rectangles do not have common points.
Figure 8. A and B mixing. Distribution D4. | L | = 8 . Observe that p i ( π i ( R ) ) = 1 for any R in L and i = 1 , 2 . Thus, | L 1 | = 4 and | L 2 | = 4 . The cardinality of A and B is equal to 4, thus = 4 ; f 1 ( A ) Int ( B ) = and f 1 ( A ) B , for this reason projections of rectangles have common vertices. Observe that rectangles do not have common points.
Mathematics 09 00452 g008
Figure 9. A and B mixing. Distribution D4. | L | = 6 . A contains 3 disjoint intervals and f 1 ( A ) Int ( B ) = but f 1 ( A ) B ; B has 3 disjoint intervals. | L 1 | = | L 2 | = 3 and rectangles of both sets have a common vertex.
Figure 9. A and B mixing. Distribution D4. | L | = 6 . A contains 3 disjoint intervals and f 1 ( A ) Int ( B ) = but f 1 ( A ) B ; B has 3 disjoint intervals. | L 1 | = | L 2 | = 3 and rectangles of both sets have a common vertex.
Mathematics 09 00452 g009
Figure 10. A and B mixing. Distribution D4. | L | = 4 . A contains 1 interval and f 1 ( A ) Int ( B ) = but f 1 ( A ) B ; in this case, the intersection are two points; B has 2 intervals; | L 1 | = | L 2 | = 2 . Rectangles from L 1 have two vertices in common with rectangles from L 2 and the same for rectangles from L 2 .
Figure 10. A and B mixing. Distribution D4. | L | = 4 . A contains 1 interval and f 1 ( A ) Int ( B ) = but f 1 ( A ) B ; in this case, the intersection are two points; B has 2 intervals; | L 1 | = | L 2 | = 2 . Rectangles from L 1 have two vertices in common with rectangles from L 2 and the same for rectangles from L 2 .
Mathematics 09 00452 g010
Figure 11. A and B mixing. Distribution D4. | L | = 12 ; A contains 3 intervals and f 1 ( A ) Int ( B ) = but f 1 ( A ) B ; in this case, the intersection are two points but rectangles have no common points; B has 6 intervals; | L 1 | = | L 2 | = 6 .
Figure 11. A and B mixing. Distribution D4. | L | = 12 ; A contains 3 intervals and f 1 ( A ) Int ( B ) = but f 1 ( A ) B ; in this case, the intersection are two points but rectangles have no common points; B has 6 intervals; | L 1 | = | L 2 | = 6 .
Mathematics 09 00452 g011
Figure 12. A mixing and B no mixing. Distribution D5. Here, p = 2 , q = 3 , = 6 ; each ‘entire’ rectangle R in L 1 verifies p 1 ( π 1 ( R ) ) = 3 = p and p 2 ( π 2 ( R ) ) = 2 = q , whereas each ‘entire’ rectangle R in L 2 holds p 2 ( π 2 ( R ) ) = 3 = p and p 1 ( π 1 ( R ) ) = 2 = q .
Figure 12. A mixing and B no mixing. Distribution D5. Here, p = 2 , q = 3 , = 6 ; each ‘entire’ rectangle R in L 1 verifies p 1 ( π 1 ( R ) ) = 3 = p and p 2 ( π 2 ( R ) ) = 2 = q , whereas each ‘entire’ rectangle R in L 2 holds p 2 ( π 2 ( R ) ) = 3 = p and p 1 ( π 1 ( R ) ) = 2 = q .
Mathematics 09 00452 g012
Figure 13. A mixing and B no mixing. Distribution D6. In the first examples, p = 2 ,   q = 1 , and p = 4 ,   q = 2 ; in the last one, p = 6 ,   q = 3 .
Figure 13. A mixing and B no mixing. Distribution D6. In the first examples, p = 2 ,   q = 1 , and p = 4 ,   q = 2 ; in the last one, p = 6 ,   q = 3 .
Mathematics 09 00452 g013
Figure 14. A and B no mixing. Observe that f ( A ) B = and under the theoretical assumptions we should obtain 7 (2 times in each) changes of sign, but shifting J 2 , J 4 and I 2 the result is as it is shown.
Figure 14. A and B no mixing. Observe that f ( A ) B = and under the theoretical assumptions we should obtain 7 (2 times in each) changes of sign, but shifting J 2 , J 4 and I 2 the result is as it is shown.
Mathematics 09 00452 g014
Figure 15. Distributions with two different orientations for the case no mixing-no mixing. Positive orientation is shown in the left and negative one is in the right.
Figure 15. Distributions with two different orientations for the case no mixing-no mixing. Positive orientation is shown in the left and negative one is in the right.
Mathematics 09 00452 g015
Figure 16. Case (i.O) corresponding to = 1 and = 3 , whenever f 1 ( A ) Int ( B ) , A and B no mixing.
Figure 16. Case (i.O) corresponding to = 1 and = 3 , whenever f 1 ( A ) Int ( B ) , A and B no mixing.
Mathematics 09 00452 g016
Figure 17. Case (ii.E) corresponding to m = 2 = 4 and m = 2 = 6 , whenever f 1 ( A ) Int ( B ) , A and B no mixing; here the number of rectangles is k = 4 in each figure.
Figure 17. Case (ii.E) corresponding to m = 2 = 4 and m = 2 = 6 , whenever f 1 ( A ) Int ( B ) , A and B no mixing; here the number of rectangles is k = 4 in each figure.
Mathematics 09 00452 g017
Figure 18. ω -limit sets for Cournot Puu’s model for c 2 = 1 and c 1 = 6.194 (left), c 1 = 6.243 (center) and c 1 = 6.25 (right) taking as initial conditions ( x 0 , y 0 ) = ( 0.01 , 0.0011 ) . We have computed orbits of length equal to 200,000 and we have drawn the last 100,000 points.
Figure 18. ω -limit sets for Cournot Puu’s model for c 2 = 1 and c 1 = 6.194 (left), c 1 = 6.243 (center) and c 1 = 6.25 (right) taking as initial conditions ( x 0 , y 0 ) = ( 0.01 , 0.0011 ) . We have computed orbits of length equal to 200,000 and we have drawn the last 100,000 points.
Mathematics 09 00452 g018
Figure 19. ω -limit sets for Kopel’s model for λ 1 = λ 2 = 1 . We have computed orbits or length equal to 200000 and we have plotted the last 100000. ( x 0 , y 0 ) are the initial conditions. The parameter values for each figure follows. (a) µ 1 = 3.6 , µ 2 = 3.95 , x 0 = 0.539815 and y 0 = 0.933646 ; (b) µ 1 = 3.65 , µ 2 = 3.65 , x 0 = 0.539815 , y 0 = 0.933646 ; (c) µ 1 = 3.85 , µ = 3.6 , x 0 = 0.539815 , y 0 = 0.933646 ; (d) µ 1 = 3.6 , µ 2 = 3.55 , x 0 = 0.539815 , y 0 = 0.933646 ; (e) µ 1 = 3.6 , µ 2 = 3.65 , x 0 = 0.539815 and y 0 = 0.933646 ; (f) µ 1 = 3.65 , µ 2 = 3.55 , x 0 = 0.539815 , y 0 = 0.933646 .
Figure 19. ω -limit sets for Kopel’s model for λ 1 = λ 2 = 1 . We have computed orbits or length equal to 200000 and we have plotted the last 100000. ( x 0 , y 0 ) are the initial conditions. The parameter values for each figure follows. (a) µ 1 = 3.6 , µ 2 = 3.95 , x 0 = 0.539815 and y 0 = 0.933646 ; (b) µ 1 = 3.65 , µ 2 = 3.65 , x 0 = 0.539815 , y 0 = 0.933646 ; (c) µ 1 = 3.85 , µ = 3.6 , x 0 = 0.539815 , y 0 = 0.933646 ; (d) µ 1 = 3.6 , µ 2 = 3.55 , x 0 = 0.539815 , y 0 = 0.933646 ; (e) µ 1 = 3.6 , µ 2 = 3.65 , x 0 = 0.539815 and y 0 = 0.933646 ; (f) µ 1 = 3.65 , µ 2 = 3.55 , x 0 = 0.539815 , y 0 = 0.933646 .
Mathematics 09 00452 g019
Figure 20. ω -limit sets for Matsumoto-Nonaka’s model. The value of the parameter α is α = 1.7 . (a) β = 0.59 , x 0 = 0.4 and y 0 = 1.2 ; (b) β = 0.605 , x 0 = 0.4 and y 0 = 0.1 ; (c) µ = 0.635 , x 0 = 0.4 and y 0 = 0.2 ; (d) β = 0.65 , x 0 = 0.4 and y 0 = 0.1 ; (e) β = 0.695 , x 0 = 0.4 and y 0 = 0.2 ; (f) β = 0.71 , x 0 = 0.4 and y 0 = 0.7 . We have computed orbits of length 200,000 and we have drawn the last 100,000 points.
Figure 20. ω -limit sets for Matsumoto-Nonaka’s model. The value of the parameter α is α = 1.7 . (a) β = 0.59 , x 0 = 0.4 and y 0 = 1.2 ; (b) β = 0.605 , x 0 = 0.4 and y 0 = 0.1 ; (c) µ = 0.635 , x 0 = 0.4 and y 0 = 0.2 ; (d) β = 0.65 , x 0 = 0.4 and y 0 = 0.1 ; (e) β = 0.695 , x 0 = 0.4 and y 0 = 0.2 ; (f) β = 0.71 , x 0 = 0.4 and y 0 = 0.7 . We have computed orbits of length 200,000 and we have drawn the last 100,000 points.
Mathematics 09 00452 g020
Figure 21. ω -limit sets for Cournot duopoly when the competitors operate under capacity constraints. Initial conditions x 0 = 0.2 and y 0 = 0.3 . The longitude orbit is equal to 200000 and the last 100000 points have been plotted. (a) u = 1 and v = 8.137 ; (b) u = 1 and v = 8.151 ; (c) u = 1 and v = 8.193 .
Figure 21. ω -limit sets for Cournot duopoly when the competitors operate under capacity constraints. Initial conditions x 0 = 0.2 and y 0 = 0.3 . The longitude orbit is equal to 200000 and the last 100000 points have been plotted. (a) u = 1 and v = 8.137 ; (b) u = 1 and v = 8.151 ; (c) u = 1 and v = 8.193 .
Mathematics 09 00452 g021
Figure 22. ω -limit sets for µ = 1.56 , µ = 1.58 and µ = 1.66 (left, center and right respectively) and initial conditions x 0 = 0.5 and y 0 = 0.3 .
Figure 22. ω -limit sets for µ = 1.56 , µ = 1.58 and µ = 1.66 (left, center and right respectively) and initial conditions x 0 = 0.5 and y 0 = 0.3 .
Mathematics 09 00452 g022
Figure 23. ω -limit sets with empty interior for µ = 1.56 , x 0 = 0.5 and y 0 = 0.895647 (left); µ = 1.58 , x 0 = 0.5 and y 0 = 0.911129 (center); µ = 1.66 , x 0 = 0.5 and y 0 = 0.973056 (right).
Figure 23. ω -limit sets with empty interior for µ = 1.56 , x 0 = 0.5 and y 0 = 0.895647 (left); µ = 1.58 , x 0 = 0.5 and y 0 = 0.911129 (center); µ = 1.66 , x 0 = 0.5 and y 0 = 0.973056 (right).
Mathematics 09 00452 g023
Figure 24. The map f 1 and the ω -limit set ω F 1 ( ( 0 , x 0 ) ) .
Figure 24. The map f 1 and the ω -limit set ω F 1 ( ( 0 , x 0 ) ) .
Mathematics 09 00452 g024
Figure 25. The map f 2 and the ω -limit sets ω F 2 ( ( 1 2 , y 0 ) ) , ω F 2 ( ( y 0 , y 0 ) ) .
Figure 25. The map f 2 and the ω -limit sets ω F 2 ( ( 1 2 , y 0 ) ) , ω F 2 ( ( y 0 , y 0 ) ) .
Mathematics 09 00452 g025
Figure 26. The transitive map f ( x ) = 4 ( x 1 2 ) 2 originates the ω -limit set ω F ( ( x 0 , x 0 ) ) = Δ Γ f .
Figure 26. The transitive map f ( x ) = 4 ( x 1 2 ) 2 originates the ω -limit set ω F ( ( x 0 , x 0 ) ) = Δ Γ f .
Mathematics 09 00452 g026
Figure 27. The transitive map f ( x ) = λ x ( 1 x ) originates the ω-limit set ω F ( ( x 0 , x 0 ) ) = Δ | C Γ f | C .
Figure 27. The transitive map f ( x ) = λ x ( 1 x ) originates the ω-limit set ω F ( ( x 0 , x 0 ) ) = Δ | C Γ f | C .
Mathematics 09 00452 g027
Figure 28. The graphs Γ f and Γ f * corresponding to f = T 2 , the second iterate of the tent map.
Figure 28. The graphs Γ f and Γ f * corresponding to f = T 2 , the second iterate of the tent map.
Mathematics 09 00452 g028
Figure 29. The map f 3 and, in red, the ω -limit set ω F 3 ( ( 0 , z 0 ) ) .
Figure 29. The map f 3 and, in red, the ω -limit set ω F 3 ( ( 0 , z 0 ) ) .
Mathematics 09 00452 g029
Figure 30. The map f 4 and the ω -limit set ω F 4 ( ( w 0 , w 0 ) ) homeomorphic to C 2 .
Figure 30. The map f 4 and the ω -limit set ω F 4 ( ( w 0 , w 0 ) ) homeomorphic to C 2 .
Mathematics 09 00452 g030
Figure 31. The map φ 6 and the ω -limit set ω Φ 6 ( ( x 0 , x 0 ) ) homeomorphic to C 6 .
Figure 31. The map φ 6 and the ω -limit set ω Φ 6 ( ( x 0 , x 0 ) ) homeomorphic to C 6 .
Mathematics 09 00452 g031
Figure 32. The map φ 3 and the ω -limit set ω Φ 3 ( ( w 0 , w 0 ) ) homeomorphic to C 3 .
Figure 32. The map φ 3 and the ω -limit set ω Φ 3 ( ( w 0 , w 0 ) ) homeomorphic to C 3 .
Mathematics 09 00452 g032
Figure 33. The map φ 7 and the ω -limit set ω Φ 7 ( ( z 0 , z 0 ) ) homeomorphic to C 7 .
Figure 33. The map φ 7 and the ω -limit set ω Φ 7 ( ( z 0 , z 0 ) ) homeomorphic to C 7 .
Mathematics 09 00452 g033
Figure 34. In red, the connected ω-limit set ω F ( x 0 , y 0 ) for a periodic point y 0 of period 2.
Figure 34. In red, the connected ω-limit set ω F ( x 0 , y 0 ) for a periodic point y 0 of period 2.
Mathematics 09 00452 g034
Figure 35. Here, ω F ( x , y ) = W 1 W 2 , with W 1 = ω F 2 ( x , y ) (in red color) and W 2 = ω F 2 ( F ( x , y ) ) (in green color); the movement of the orbit by F is 1 2 3 4 5 6 7 8 ; see also Figure 17.
Figure 35. Here, ω F ( x , y ) = W 1 W 2 , with W 1 = ω F 2 ( x , y ) (in red color) and W 2 = ω F 2 ( F ( x , y ) ) (in green color); the movement of the orbit by F is 1 2 3 4 5 6 7 8 ; see also Figure 17.
Mathematics 09 00452 g035
Figure 36. Here, the projections of ω F ( x , y ) are connected but ω F ( x , y ) is not.
Figure 36. Here, the projections of ω F ( x , y ) are connected but ω F ( x , y ) is not.
Mathematics 09 00452 g036
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Linero-Bas, A.; Muñoz-Guillermo, M. A Full Description of ω-Limit Sets of Cournot Maps Having Non-Empty Interior and Some Economic Applications. Mathematics 2021, 9, 452. https://doi.org/10.3390/math9040452

AMA Style

Linero-Bas A, Muñoz-Guillermo M. A Full Description of ω-Limit Sets of Cournot Maps Having Non-Empty Interior and Some Economic Applications. Mathematics. 2021; 9(4):452. https://doi.org/10.3390/math9040452

Chicago/Turabian Style

Linero-Bas, Antonio, and María Muñoz-Guillermo. 2021. "A Full Description of ω-Limit Sets of Cournot Maps Having Non-Empty Interior and Some Economic Applications" Mathematics 9, no. 4: 452. https://doi.org/10.3390/math9040452

APA Style

Linero-Bas, A., & Muñoz-Guillermo, M. (2021). A Full Description of ω-Limit Sets of Cournot Maps Having Non-Empty Interior and Some Economic Applications. Mathematics, 9(4), 452. https://doi.org/10.3390/math9040452

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop