<p>Let <i>T</i> be an expanding Markov map with a repeller <i>F</i> on <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2024_1818_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="72" /> </InlineMediaObject> <EquationSource Format="TEX">\(X\subset [0,1]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>X</mi> <mo>⊂</mo> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation>. For any <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2024_1818_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="113" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{y_n\}_{n\ge 0}\subset [0,1]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mrow> <mo stretchy="false">{</mo> <msub> <mi>y</mi> <mi>n</mi> </msub> <mo stretchy="false">}</mo> </mrow> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </msub> <mo>⊂</mo> <mrow> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, we prove that the Hausdorff dimension of the badly approximable set <Equation ID="Equ17"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2024_1818_Article_Equ17.gif" Format="GIF" Height="33" Rendition="HTML" Resolution="72" Type="Linedraw" Width="247" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} \Big \{x\in F: \liminf \limits _{n\rightarrow \infty }|T^n (x)-y_n|&gt;0 \Big \} \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mrow> <mo maxsize="1.623em" minsize="1.623em" stretchy="true">{</mo> </mrow> <mi>x</mi> <mo>∈</mo> <mi>F</mi> <mo>:</mo> <munder> <mo movablelimits="false">lim inf</mo> <mrow> <mi>n</mi> <mo stretchy="false">→</mo> <mi>∞</mi> </mrow> </munder> <mrow> <mo stretchy="false">|</mo> <msup> <mi>T</mi> <mi>n</mi> </msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>-</mo> <msub> <mi>y</mi> <mi>n</mi> </msub> <mo stretchy="false">|</mo> </mrow> <mo>&gt;</mo> <mn>0</mn> <mrow> <mo maxsize="1.623em" minsize="1.623em" stretchy="true">}</mo> </mrow> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>is full. Moreover, using this result, we conclude that the Hausdorff dimension of the set of non-recurrent points, defined by <Equation ID="Equ18"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2024_1818_Article_Equ18.gif" Format="GIF" Height="33" Rendition="HTML" Resolution="72" Type="Linedraw" Width="241" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} \Big \{x\in F: \liminf \limits _{n\rightarrow \infty }|T^n(x)-x|&gt;0 \Big \} \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mrow> <mo maxsize="1.623em" minsize="1.623em" stretchy="true">{</mo> </mrow> <mi>x</mi> <mo>∈</mo> <mi>F</mi> <mo>:</mo> <munder> <mo movablelimits="false">lim inf</mo> <mrow> <mi>n</mi> <mo stretchy="false">→</mo> <mi>∞</mi> </mrow> </munder> <mrow> <mo stretchy="false">|</mo> <msup> <mi>T</mi> <mi>n</mi> </msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>-</mo> <mi>x</mi> <mo stretchy="false">|</mo> </mrow> <mo>&gt;</mo> <mn>0</mn> <mrow> <mo maxsize="1.623em" minsize="1.623em" stretchy="true">}</mo> </mrow> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>is also full. The results can be applied to some dynamical systems on fractal sets, such as cookie-cutter systems.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Badly Approximable Sets for Expanding Markov Maps

  • Na Yuan,
  • Shuailing Wang

摘要

Let T be an expanding Markov map with a repeller F on \(X\subset [0,1]\) X [ 0 , 1 ] . For any \(\{y_n\}_{n\ge 0}\subset [0,1]\) { y n } n 0 [ 0 , 1 ] , we prove that the Hausdorff dimension of the badly approximable set \(\begin{aligned} \Big \{x\in F: \liminf \limits _{n\rightarrow \infty }|T^n (x)-y_n|>0 \Big \} \end{aligned}\) { x F : lim inf n | T n ( x ) - y n | > 0 } is full. Moreover, using this result, we conclude that the Hausdorff dimension of the set of non-recurrent points, defined by \(\begin{aligned} \Big \{x\in F: \liminf \limits _{n\rightarrow \infty }|T^n(x)-x|>0 \Big \} \end{aligned}\) { x F : lim inf n | T n ( x ) - x | > 0 } is also full. The results can be applied to some dynamical systems on fractal sets, such as cookie-cutter systems.