Ergod. Th, & Dyna, Sys, (2015), 38, 337-358 © Cambridge University Press, 2013 doi:10.1017/etds.2013.54 The w-limit sets of quadratic Julia sets ANDREW D. BARWELL#+ and BRIAN E. RAINESS + Heilbronn Institute of Mathematical Research, University of Bristol, Howard House Queens Avenue, Bristol BSS ISN, UK (e-mail: A Barwell @bristol.ac.uk) $ School of Mathematics, University of Birmingham, Birmingham B15 2TT, UK § Department of Mathematics, Baylor University, Waco, TX 76798-7328, USA (e-mail: brian_raines@bayloredu) (Received 30 March 2012 and accepted in revised form 13 May 2013) Abstract. In this paper we characterize w-limit sets of dendritic Julia sets for quadratic maps. We use Baldwin's symbolic representation of these spaces as a non-HausdorfT itinerary space and prove that quadratic maps with dendritic Julia sets have shadowing, and also that forall such maps, a closed invariant set is an c-limit set ofa point if, and only if, it is internally chain transitive. 1. Introduction In this paper we consider the dynamics of quadratic maps on the complex plane, f-(2) = 22+e. The interesting dynamics of such a map are carried on the Julia set which is often a complicated, self-similar space. There are many values of c for which the Julia set is a dendrite, a locally connected and uniquely arewise connected compact metric space, One example is when the value c is strictly pre-periodic; such values are known as Misiurewiez, points and the corresponding Misiurewiez. maps are well studied (see, for example, [1, 9, 12)) Baldwin gives an efficient encoding of the dynamics of these quadratic maps restricted to the Julia set, into a shift map on a non-Hausdorff itinerary space [2]. A detailed description of all such itinerary spaces is given in [4], and an illustration of the utility of non-Hausdorff itinerary spaces in analyzing dynamical systems is given in [3]. Baldwin's collection of itinerary spaces is a large family of dendrites and maps that includes all of the dendritic Julia sets for quadratic maps. It also includes maps on self-similar dendrites which are not Julia sets, Our «limit set characterization theorem applies to both the Julia set dendrites and the dendrite maps which are not Julia sets, A set A is internally chain transitive (ICT) provided that for every ¢ > 0 and every pair x,y € A there is an e pseudo-orbit from x to y in A; in other words, a collection (220,41... Sy) SA such that d(f(x), x11) O there is a 5 > 0 such that for every 8 pseudo-orbit (x) there is a point z € X for which d(f"(c), x2) <¢ for all i; we say that z e-shadows the pseudo-orbit. In [8] the authors conjecture that the answer to the question ‘Is every ICT set an o-limit set?” is *yes’ for any map which has shadowing. The conjecture is supported by a result showing that for every tent map with a periodic critical point (maps which have shadowing) the answer is ‘yes’, and by an example showing that there are tent maps without shadowing for which the answer is ‘no’. Furthermore, the authors prove in [5] that the answer is “yes” in the class of shifts of finite type (SETS), a class of maps which has shadowing [13], but the answer is ‘no’ in the class of sofie shifls (Which do not have shadowing in general). There are maps of the unit interval for which the answer is ‘yes’ and others for which the answer is ‘no’, but for which shadowing is neither proved nor disproved [6]. Through the use of Baldwin's encoding, we demonstrate that the answer is ‘Yes’ for the class of dendritic Julia sets of quadratic maps, and that these maps have shadowing, further supporting the above conjecture. In fact we prove these results for all self-similar dendrite maps with the unique itinerary property—a large class of maps ‘containing the dendritic Julia set maps. This paper is organized as follows, In the next section we present the preliminary definitions and results for dendrite maps. In §3 we prove lemmas regarding the structure and properties of pseudo-orbits in these spaces, and in §4 we prove shadowing for dendritic Julia sets (Theorem 4.2), from which we obtain the proof of the main theorem, which states that for dendritic Julia sets, every ICT set is necessarily an «limit set (Theorem 4.4). 2. Preliminaries ‘We examine the dynamics of quadratic Julia ses that are dendrites via Baldwin's encoding using non-Hausdortf itinerary spaces. In this section we give a brief description of the definitions and results from [2] that relate to dendritic Julia sets. More detail and results can be found also in (4). Given a finite set of symbols, A fr each m € N we denote the words of length from Alby AP, and we define the stot finite words from A by aa at mt For finite word « € A“ let len(a) € N be the length of Iris a standard practice in dynamies to encode complicated behavior via symbolic dynamics. A typical simple encoding isto assign symbols from an alphabet to disjoint pele ori 01a 201354 abe nly Cambridge Urey resThe w-limit sets of quadratic Julia sets 339 regions and then to track orbits by recording the regions the points traverse. A difficulty arises due to the fact that the sequence space with its natural topology is totally disconnected while the dynamical system under consideration is usually not, Therefore, the encoding usually induces a semiconjugacy rather than a conjugacy. Baldwin avoids this difficulty by the use of ‘wildcard’ symbols. His encoding of the symbol space includes 2 symbol which stands forall of the other symbols at once. The topology then on his set of symbols is not the discrete topology, but rather a slightly more complicated non-Hausdorff topology. Consider the set (0, 1,*} with the non-Hausdorff topology with basis {{0}, (1), (0, 1, #)}. Let A be the product space induced by this topology on (0, 1, }® (a is the set of non-negative integers, {0} UN.) For each a € (0, 1, x)“, we can define the basic ‘open cylinder sets as BY :=(B € A: Bj =a whenever aj # *, for i Osuch that * # dinan # t= ##). Definition 2.1. Let Dy i= (x € Az xis (A, r)-admissible}, Thus D, is the set of all possible itineraries allowed by the kneading sequence z, about which Baldwin proved the following, ‘THEOREM 2.2. [2, Theorem 2.4] Let t be A-acceptable. Then D, is a shif-invariant self-similar dendrite. Notice that in D, there is only one point that has as its first coordinate the symbol ‘=, namely the critical point +r. ‘The other symbols, 0 and 1, correspond to the two not necessarily connected open regions of the space obtained by removing #« from Dy Baldwin proved that D, has a natural arc-length (or taxicab) metric, d, which we use in this paper. Moreover, this family of spaces includes all of the quadratic Julia sets which are dendrites pele ori 01a 201354 abe nly Cambridge Urey res340 A.D, Barwell and B. E, Raines ‘THEOREM 2.3. [2, Theorem 2.5] Let fo()=z? +e. If the Julia set of fel2), Jo is a dendrite then there is a A-acceptable sequence t such that fel is conjugate to op, Let r be a A-acceptable sequence. We call r the kneading sequence for the self-similar dendrite D-.. We call the point in D, of the form #r the critical point and all of its pre- images precritical points, Its worth noting that « is a homeomorphism (onto its image) when restricted to any connected subset of Dy not containing the critical point Letx and z= 2921 ~~ be points in Dy, and let n € 2. We =. We define et Aon] + tn For every i M, 50. Also if is recurrent but not periodic then rm is an integer for each m ¢ N and Remark 2.6. Notice that fk. j €N, with k > j such that dye oh; then: (1) iris periodic with period P then either k — 2) ifr isnot periodic then k= j =r, =nP for some n EN, ot j O such that p €() An for some p € Dz, then there isa subsequence (ni)iew such that (Ap, isan arc pele ori 01a 201354 abe nly Cambridge Urey res342, A.D, Barwell and B. E, Raines Proof. Notice that, since Dy is locally eosnected, only finitely many components of ‘D, ~(p) have diameter larger than ¢/2, so there is some component, Ko, of Dy — (p) that mects an infinite subsequence of the Ay =[Xp, Yq] with A, Ko having length greater than or equal to ¢/2. Call this subsequence (A, en. Relabel Ap, if necessary to ensure that the portion of Ay, that meets Ko contains xp,. So the arcs Ay, 0K are Ln. pl. Then every pair inthis subsequence meets mote than just p. Therefore, there is Some 22 € An; —{p} such that (Ay, (Ans) Ko = 20, pl. Let 25 be defined such that (Ans Ang) Ro = (25, ph. Let 25 be defined to be 2 if 2 € len, ph and let it be > otherwise. Define zp similarly for Ay, 1 Ang.;- Then [2m, P] 2 [Zmsi. pl and Femi PIS) An If zm > 2 p then it must be the case that (2, p] © (An, and we are done. If instead zm p then We have arcs By = [yq, 2m] all disjoint with lengths approaching ¢/2, This implies that there are infinitely many disjoint arcs of length atleast ¢/4 in a neighborhood of p. This violates the local connectivity of D;. Therefore, zm —> z# p, proving the lemma. D LEMMA 2.10. If Annet is « collection of arcs in D, with length greater than or equal toe > O then there isa subsequence (n:),en such that (Ag, is an ar: Proof. Let each An = Le. Yal With din. Yn) > € We prove that there is a subsequence with non-empty intersection. The result will follow by the previous lemma. Choose tn © (ns Ya) SUCH that (2p, fp) = £/2and dip, Yn) = €/2. Let (n)iew be a subsequence such that fq, converges to some point 1 € De. Notice that if tq, is within e/4 of ¢ but 6 [tne Ya] then there must be a branch point ps € Lp. Ym] With A, ps) 0. Then there isa natural number N, such that ifx, y € De with xy, yh, then d(x, ») <0 Q) Let NEN. Then there is a positive number dy such that if x, y €Dz with dex, y) 0 such that for every N there are points xy and yy with xyfw~ ywlw but d(xy, yw) > &. Let ew be defined so that xnly® enlv® yt Relabel if necessary so that d(xw, 2x) > ¢/2. This gives an infinite collection of arcs, An = [xa, Ze) With length greater than ¢/2. By the previous lemma, there exist an infinite subsequence (A, ics and points 5 ¢ with [s, 11 © Pjeq Any. Let w= (ui), v= (i) € Is. 1] = Pe (since Py is countable and [s, 1] is uncountable there are plenty of choices for w and v). Let kEN, and choose nj >k. Then u,v €[s, 11 © tq. qh therefore of (w). o*(v) €o*[xq;, Zn; The previous lemma then implies that wz = vg. This holds for every k, which isa contradiction since « and v are distinet sequences in D, To prove (2), let 5y > O be so small that ifs, ¢ € Py then d(s, 1) > Sy. Let x, ye De with d(x, 9) <4y. Then [(r, 9) Pyls 1. The previous lemmas imply then that sly ytw o ‘This lemma shows that the metric topology on D, is completely determined by the symbolic representation. It describes the key difference between the setting of this paper and the setting of shifts of finite type. In SFTs two points are within ¢ of each other if they are equal for their inital segment of length N,. In the symbolic spaces we study in this paper, We know that (wo points x and y are within ¢ of each other if either: (1) xand y have exactly the same initial segment of length N,; or (2) x and y havea disagreement in say the th place (with j < N,), in which case there is a precritical point z between them that has a # in the jth place. Moreover, if and y satisfy ease (1) or (2) for large M then they are close (within 54). Definition 2.13. In case (2) we say that x and y have a flip in the jth place. For example, we could have two points x and y within ¢ of each other as below: ES NONE ETT Taye S aKa ARYA VAL YN where j is chosen minimally. In this case we must have that the words xj. ---ty, and yjst +++ Yn, afe equivalent to t; --» ty,-j. So if tis not periodic then it must be the case that these three words are equal, If instead + is periodic, say with period P, then these words must be equal for the first P symbols, then they can have another flip, then they ‘must be equal for the next P symbols, etc. Analyzing this situation for 8 pseudo-orbits and using it to construct e-shadowing points is the focus of the next section, 3. Pseudo-orbits in dendrites In this section we will prove a number of results pertaining to pseudo-orbits in dendrites, which wil ultimately allow us to prove that dendrite maps have shadowing. Let N EN, For the purpose of illustration, we begin with a consideration of 8 pseudo- orbits in SFT spaces. Let{x;},ex be a 8 pseudo-orbit in X, an SFT, where 4 is small enough pele ori 01a 201354 abe nly Cambridge Urey res344 A.D, Barwell and B. E, Raines that de, y<5 implies aiw= sty By definition, otaiin= aly and o(n)iv=asla, which implies aslo If we denote x; by xirjx} +» then we have the following array of ini length N where down each column we have equality: ately! segments of aga}xieta! TRIG 242252) OREN xdepdede] x} OETXDERNA oN A etetatyt oad Beeeiad oth, SS eSySa8 ooo a SOMITE 8H ‘The column equality in the above array allows a straightforward proof of shadowing in SFT spaces. For sufficiently large N (and small 8) the point z is in the space, and it also 8-shadows the pseudo-orbit. It is easy to see from the array that dn=aity. This is also true forthe jth shift of z and the point x; ‘The symbolic spaces we consider in tis paper are far less simple. Let N € Nand choose Sy > O as in Lemma 2.12. Let {xi}ien bead := Sy pseudo-orbit in D,. Then, as described after the lemma, for each ¢ € N we have (ain mail ‘This implies that either these two inital segments are equal or there is a flip in some position, and a precritical point, z, between (xj) and 341. Consider now the array associated with the & pseudo-orbit: xdabcbedad od XPERIA 8 w2ddatad a3 DMIAE AT XR adxfdedad MIG xdxfdhefad ox ababxbedad xf OMAN tN psd orgy JO 201254 bed ane by Cambridge Urey PresThe w-limit sets of quadratic Julia sets 345, Since this isa 8 pseudo-orbit we know that of Vy ODM Nr Rel w for every 0 <1 < N. Notice also that oars ot Cay yrs = eave 2 for allt < N if, and only if, we have column equality in these segments as in the SFT case, Bur by Lemma 2.12 it may be the case that there is a flip in some column, say the jth column, relative to x). If j is minimal in this respect, then for all 1 < & < j we have the following column equality in the array: ‘This docs not hold in the jth column, since for some 1 0 we will choose a natural number N and § = by > O (based on several upcoming lemmas) much smaller than ¢. Then, given a 6 pseudo-orbit {xj}icr, we will construct a ‘canonical form’ of an ¢-shadowing point, 2 = zozs - =, where zo = x and iffy is the first ip column for the pseudo-orbit we let zy = x/*" for all j < ty but we define zz, =o. Letting t2 be the next flip cokimn we define zy ~ x6" for all) << and agtin we assign © to zi Continuing this procedure gives usa point 2 with possibly infinitely many places where there is .0, but since ois not in our alphabet, isnot a point in D;. We must then assign either 0, 1 or «to each o in 3 in such a way thatthe resulting point z is both in Dy and «shadows the pseudo orbit Ttis the goal ofthe next several results to prove that there exist an NV large enough and 46 small enough so that the os will occur with larger than N, gaps between them. Once this has been established, we then prove that any assignment of Os or 1s tothe os in £ will generate a true e-shadow z of the 5 pseudo-orbit (unless (2) ~ r for some k € «, in which case there is a unique assignment). To begin, we prove a basic feature of column equality in arays related to 6 pseudo obits between successive flip columns. The proof is immediate from the definition of tip column (see Figures 1 and 2) pele ori 01a 201354 abe nly Cambridge Urey res346 A.D, Barwell and B. E, Raines att print Agreement FiguRe 1, Lemma 3.200 i ion is A Ageotment tr PlouRE 2, Lemma 3.202), LEMMA 3.2, Let N €N and tet § = by. Let (xi}ien bea 8 pseudo-orbit, and let k EN be chosen such that there are wo flip columns. jy and jz, relative 0x4 with j, < jp and no ‘ip columns relative fo x between jy and jp. Then we have the following equalities: () forall lst 0 be defined as in Lemma 2.12. Let (riJiex be a 5 pseudo-orbit. Since r is periodic, if xg has a ip column in, say, the jt column with j < NV then it can have a lip column in every j +4? column afterwards, but also in somie columns which are not ‘in sync’ with the period. The next lemma addresses the arrangement ofthe flip colurnns that ate ‘out of syne’ LEMMA 3.3. Let N EN and let 5 = dy, Let {xi}ien be a 8 pseudo-orbit, and let k and J 8; to be minimal such that s.41 isa flip row ofa flip column gt with fig — j nota multiple of P and with fiat 4, 0° (Wl tw\~p Wipal-p and 07 (WY pel-g= Wiywl-g HFK = ged(p, q) and lwl > p +g —K then oF whan = wpa The following combinatorial argument will be a useful tool when dealing with return times, LEMMA 3.5. Suppose that t is not periodic. Then the return times {rm}mes have the property that r; > 1 for infinitely many 1 € Proof, Recall first that rp m’, and we get that ry/=1 my then there is @ third flip column, js > ja, relative to x, with lip row is such that (a) isis between i and in and ) js—a—l< myn Proof. Suppose we have the points, flip columns and rows as described in (i) and (ii) of the lemma, but suppose that there is no third flip column, js, satisfying (a) and (b). See Figure 5. ‘Without loss of generality, assume that i, < iz. Then there is some precritical point 21 € [resis Mesa] Such that 2 Ges. Vin zal aes lve psd orgy JO 201254 bed ane by Cambridge Urey Pres350 A.D, Barwell and B. E, Raines and 0! ()) = Sete +. Hence oF Nasi TN ae NEB INA Similarly, there is a precritical point 22 € [X441~1, Xt+ig] such that (sin -t IN ZAIN Xk and o?~2(29) =r Sanity +. Hence oP Mo 12 “INA We sce that Tibi ty jee = PAT) = ahHAN EZ) and oH enfye pat oF gi Napa In the same column we have tga HG), PON aay py oP (x giIINoed Since we assume that there are no successive flip columns js with related flip row is, where i < fy < fp and we assume jy — jg — 1 < mye and N= jy —1 > mpy, it must be the case that oP yy oP ag Nae ohare oP ead 8) for some MeN with M > m1 (otherwise there would have been a flip column js with flip row Zs satisfying (a) and (b)). There are three cases to consider. For instance, we could have (A) eA su4i, and xpes, is prec ®) a= maior (©) 21 A xii, and x44, is not precritical In case (A), lets be such that o7~!'(xy4i,) =r. Then because jj and jp are successive flip columns relative to x4, it must be the case that s > ja. Ifs is small enough to still be a flip column for xz then we know that 5 ~ jp ~ 1 =m, by our assumptions that no flip ‘column for xz satistes (a) and (b). Ifs is so large that it cannot be counted as a flip column relative to xe then it must be the case that s > N. So we again have s — jp — 1 > mest. ‘This implies that the frst M-length word of o/°~!'+"(¢,) equals the first M-length word of 02H 4411). SO Ehcinth ached Sachse =P aga ‘Cases (B) and (C) lead to the same conclusion via simpler reasoning. By a similar argument, considering three cases for 22 and Xy4i., We see that tity so Gag) psd orgy JO 201254 bed ane by Cambridge Urey PresThe w-limit sets of quadratic Julia sets 351 N a b A a = Noho} FIGURE 5. Return times the 8 preude- ori of Lemma 3.6; repretens ip So by equation (3) we sce that Ways 0 Taojien © 0B tw riodie, none of these symbols can be +. Therefore, Ajit eM = Ta Since M > m1 it then must be the case that jo — jr +1 > rust, but we assumed that Jo= jy 1 0, and let Ne be given as in Lemma 2.12, Let N> Ne, let § = Sy > 0, and let {si} bea 5 pseudo-orbit, with x; =x] +» foreach é €N, Suppose that there are ip columns in {xj}jew (i not, then the sequences {ar }ten. (Pe}acn Lie}ter are empty). Leta be minimal such that there exiss a ji = Ne minimal for which either: (1) there exists fy < a, minimal, such that j 8a Mip column relative to oy and iy isthe flip row of the fip column ji; in other words Xn Ac (2) we have that for all 1 I define cn, jny and i tecursively as above so that ay > fy—1 ‘Thus we oaly start looking for the next point with a flip column in its initial N-segment after we have passed the previous flip column. These sequences of ay and fi allow us to keep track of the key lip columns in the 5 pseudo-orbit. Specifically, in wying to construct a shadowing point for this 6 pseudo-orbit we need to know where the flip columns affect the N, agreement. Notice that (xin iil, for every 7 € N, while our goal is (o get a point z which has o!(2)Iy,~ fn,» for alli €N, with N, much smaller than N. The ay give us the points in the pseudo-orbit that have a flip column somewhere in their first N symbols, while the Ae are the actual place ‘where the canonical shadowing point must have a symbol. ‘The next result will help us prove that for every ¢ > O there is an NW > Ny large enough and hence a 8, := 5y > 0 small enough to guarantee that, after the © symbol (in some fcth place) in our canonical shadowing point, there is a well-defined string of length N, that agrees with r. This means that the actual shadowing point will have its th shift within © of the critical point. This property will allow us to freely choose 0 or 1 in place of each ©, as either choice is allowed in these self-similar dendrite maps. PROPOSITION 3.8. Let 6 > 0 and N, EN be given. Then there is some N > Ne large enough with associated 8_ := by > 0 such that for any 0 <5 < 5, and any 5 pseudo-orbit Uxdien with a flip column, xpestlnr© 0" DIN for all k €N and all 0 <1 < Ny Proof, We prove the proposition in three parts. First we assume that t is periodic with period P, then we assume that r is non-tecurrent, and finally we assume that is recurrent but non-periodic. To begin, let r be periodic with period P € N. So In this case we choose N so that NP 40% and we let}, =4y from Lemma 2.12. Choose 0<3 <4. Let k €N and consider a, First we consider the case that a satisies ease (1) of Definition 3.7, Let flip column j and associated flip row ig be as defined. We prove that there are no fips relative 10 Say between je — ie + 1 and (jg — ix + 1) + Ne with ip rows between 1 and (8, — ix) + Ne. Lemma 3.2 will imply the proposition As in Lemma 3.3, let 1 < 5) < (Se — ie) + Ne be the minimal flip row for a flip column, fy, felative t0 Soysig Where ()— jj is not a multiple of P. Given sy and ty, define Sq ji + Ne. Since N > 2PN, +2Ny we have t= N—rP = N ~2NcP > 2Ne Since jx < Nev tp >2Ne> jet Ne ‘The case that ax satisfies (2) of Definition 3.7 is more straightforward. This completes the proof forthe periodie case. Now assume that 1 is non-recurrent, Let M be large enough so that ry = 00 for all m= M. Thatis to say, the word ty --» ty never reoceurs in r. Let N © N be chosen so that N>2Ne4+ MHD, and let 8, = Sy as in Lemma 2.12. Let 0 < 8 <4,. Let k € N and consider ay. Suppose that ax satisfies (1) of Definition 3.7. Let j, and ig be the fip column and fip row as defined. We prove that there are no fis relative to x5, +4, With flip columns between J — fg + 1 and jx — ig + 1) + Ne and fip rows between I and (fie — ix) + Ne. Let z be the precritical point that is responsible forthe ay flip. That is to say, o aa sie -IN an Xonsule with oh ane We have oh 202, fee tye tenn Ia si VN OND because jg — ix < Ne. Suppose that there is some other flip relative to ay with flip column between jx — ie + 1 and (je — ik +1) + Ne. Let be minimal such that the ip row for this column occurs at Xay4+i,+r and let ¢ be chosen so that the precritical point 2’ responsible for this flip has 2 (ap sige DIN ZTN® Naps selv with of(=enn and je — ig —r <1 (je ik =F) + Ne. Since ris the rst sow with afip, it must be the case that oy St a RHED HATED (yy Hoty y pele ori 01a 201354 abe nly Cambridge Urey res354 A.D, Barwell and B. E, Raines This contradicts the assumption that r1 --- ry never reoccurs in r. The case where a satisfies (2) of Definition 3.7 is similar (notationally much simpler). The proof follows for non-recurrent Next assume that r is recurrent but not periodic and we have enumerated the return times as in Lemma 3.6. Specifically, let (m;}j N,. Then in this case define N’ ¢ NN such that Sy, LetO <8 < bs, and let (xi}jens be a 8 pseudo-orbit, As in the periodic case of the proof, let k € N and consider a. First we consider the case where ay satisfies case (1) of Definition 3.7. Let flip column jg and associated flip row ig be as defined. We prove that there are no flips relative to xa,+i, between jg ~ ik and ji — ik + Ne with Hip rows between 1 and ie + Ne ~ ig. Lemma 3.2 will imply the proposition. Suppose that there is a flip column relative to 5, in column f) with je — ik <4 < Jk ig +Ne. Choose t; minimally with respect to this property. Then 1) ~ (jy — ix) < Nz tq-1 is minimal such that fy is a Hip column for a,j, and fg —fyat < Megat ‘This process must (erminate at least by the time we have exhausted the possible flip rows between Xap, and Xp,44, = Xue jpn,» Lett; be the last such flip column. ‘Then 1 je + No ie < jk + No <2Ne. Therefore, fy ~t;—1 0, with Ne € N asin Lemma 2.12 and N €N and b, > O.asin Proposition 3.8. If (xp)nex is a 5 pseudo-orbit, where for each n we write xy = xfxt then for each n eX, say. aBgt sot Proof. Pickn € N. If there is either no flip column or no k € N with n < x = Ne we have that daly xgagtt ag and we are done. So assume that there is a flip column and some minimal fi, between nn and Ne, Which represents the first flip column jj, relative to x, with flip row ix. By Proposition 3.8, Apr ON. a for all <1 = Ne, Moreover, since jg and ig are minimal we have that xtaaght 6 no yhnd fists =X pmicertth for 0- 0, let Ne € N be given by Lemma 2.12, and N €N and 3, > 0 be given by Proposition 3.8, Let xjx2---- bea dy pseudo-orbit (finite or infinite), for each i write xj =xjai + and deline 2 = Zg2) -- by hifi Pa foranyke © ifi= fi for some ke. Ir the pscudo-orbit is finite with lst point xp, let Zy 3 = xf for every i > 0. The sequence is called a canonical e-shadow forthe 3, pseudo-otbit (1) pele ori 01a 201354 abe nly Cambridge Urey res356 A.D, Barwell and B. E, Raines THEOREM 4,2, Lett be A-acceptable, Then the shift map on the dendrite D, has shadowing. Proof. For a given © > 0, let Ne, N and , be as given in Definition 4.1, let (xsJiew be ab, pscudo-orbit, and let 2 be the canonical ¢-shadow for {xi}ien. Let < €(0, 1, #)” be such that 2; = 4 for all i fe. If, for all k EN, 0(2) 2, let zp, be either O or 1; if instead there is some least k such that o* (2) ~ r then define zp, = * and for all i> fi let 2: = ingy, Defined in this way, itis clear that z € Dy We show that d(o'(c), xi) <¢ for every i € N, which by Lemma 2.12 is equivalent to saying that oly, Pick i €N; then by Proposition 3.9, situs xpayet fhe Thus o! ai, itm, by the definition of the canonical shadow, and so do!(z), x) . D ‘The following is an immediate corollary of the previous theorem, CoRoLLaRy 4.3, Any quadratic map f i Jo Jc with a dendritic Julia set Jc has shadowing. ‘We now prove our main theorem, which is the following, THEOREM 4.4, Let ¢ be A-acceplable, Then BCD. is closed and internally chain transitive if, and only if, B = (2) for some z € Dy Proof. Dx has shadowing by Theorem 4.2. For every i € N let 4; be the constant given by shadowing such that each 8; pseudo-orbit is 1/2'-shadowed, Suppose that B < Dy is closed and ICT: If B is finite to be ICT it must be a cycle and is thus an o-limit set, so assume that B is infinite. Then to be ICT it must contain infinitely many non-precritical points, By compactness of B let (xj}jen be a dense subset of B, then since B is ICT, for every (CN there is a 3) pseudo-orbit Py = {xy = xf, .-.,.xf, = acca), with my > Mya for Njj)-1 given by Lemma 2.12, (If the 8; pseudo-orbit between x; and x1 has length less than NM, pi-1 we ean add extra 3; pseudo-orbits from x1 (0 itself until the inequality is satisfied.) For each 7 EN, let zi = cizizi ~~ be an assignment of the canonical 1/2/-shadow for TT; as constructed in the proof of Theorem 4,2, except that we do not assign a * to any o in any zi. Define z € (0, 1}® by 2021 E120 Fey 202T and let) = j_; ny. We claim that : €-D, and that (@) = B. To see that z€ Dz, notice first that since B contains infinitely many non-precritical points, elements of {zi}ien will contain arbitrarily long intial segments of non-precrtical points, and we deduce that (2) # r for any KEN. Itz ¢ De, then by the definition of Dy we must have that for some k € N, o(2) only differs from r in a place where one has pele ori 01a 201354 abe nly Cambridge Urey resThe w-limit sets of quadratic Julia sets 357 hhas no * sot must have a + in this place, and as such is periodic, But then by the construction of z, cofinitely many of the z; would have to be precritical, forcing B to be he critical cycle, a contradiction, ‘To see that B C a(2), notice that o' Nps = ZN, for every i, 80 1 ON x 0, pick j © N so that max{d(x, y), 1/2!) < ¢/2. Then do"(2), y) $d(o"(2), x) + dy, ») 1 tae») 0 such that y ¢ B,(B); pick Jc N such that 1/24 J we must have that o {or appropriate integers kj, by Lemma 2.12. Since y ¢ B, viy,# iy, forall x € B. But then by (7), for infinitely many é > J, oh Nem, for any x € B, meaning that for infinitely many zs, N= MM ae Oh EDIN EN Ny ‘This contradicts the fact that the z+ 1/2/-shadow points in B. Therefore, «(e)\B is empty. Hence (2) = B. a Finally, Theorems 2.3 and 4.4 imply the following. COROLLARY 4.5. For any quadratic map f': Je» Je with a dendritic Julia set Je, A.C Jeis closed and internally chain transitive if and only if A = (2) for some z € Je. REFERENCES [1] L.Atseda and N. Fagella. Dynamics on Hubbard tees. Fd. Math. 1682) (2000), 115-141, [2] S. Baldwin, Continaus itinerary factions and dendite maps. Topology Appl. S816) (2007), 2889- 2938, [3] 5. Baldwin tnverse Limits oftenlke maps on tees. Fund. Math 2073) (2010) 211-254, psd orgy JO 201254 bed ane by Cambridge Urey Pres358 oy 10) mu 2) a1 A.D, Barwell and B. E, Raines S. Baldwin, Julia sets and peviodic kneading sequences. J Fixed Point Theory Appl. Ht) (2010), 201 2. ‘A Barwell, C. Good, R. Knight and B. E. Raines. A characttization of amit sets in shite spaces. Ergod. Th. & Dynam. 83s. 3(1) 2010), 21-31, A.D, Barwell A chiracerzation of eimit sels of piecewise monotone maps of the interval. and. Math. 2072) 2010), 161-174 ‘A.D. Barwell, C. Good, P Oprocha and B.E Raines. Characterizations of «limit sts in topologically hyperbolic systems. Discrete Comin. Dyn. Sy9t 38S) (2013), 1819-1833, A.D. Barwell, G. Davies and C. Good. On the «lint ses of tent maps. Fund. Mate. 247(1) (2012), 38-54, ‘A. Douady and J. H. Hubbard. Ende d\mamigue des polyndmes complexes. Pate I (Publications -Mathématiquesd'Oren, 84), Université de Pars‘, Département de Mathématiqies, Onay, 198. [N.1.Fine and HS Will Uniqueness theorems for pride funtions. Pro. Amer Math Soe. 161965), 109-14, M. W. Hirsch, H. 1. Smith and X-Q. Zago. Chain ransivity,atractvity, and stong repllrs for semidynamical systems. Dynam. Differetial Equations 131) (2001), 107-131. D Sebleicher. On aber an loealconsecivity of Mandelbrot and Maltbrot sts. Fractal Geometry and Applications: A Jubilee of Benolt Mandela. Part I (Proceedings of Symposia in Pave Mathematies, 72), American Mathematical Society, Providence RI, 2008, pp. 477-817 Wales. On th pseudo orbit acing property andl relationship a stably, The Structure of Attractore ‘x Dynamical Systems (Proc. Conf, North Dakota State Unis, Farge, MD, 1977) (Lectre Notes in ‘Mathemaries, 658). Springer. Belin, 1978, pp. 231-244 psd orgy JO 201254 bed ane by Cambridge Urey Pres