{"title":"Overlapping Iterated Function Systems from the Perspective of Metric Number Theory","authors":"S. Baker","doi":"10.1090/memo/1428","DOIUrl":null,"url":null,"abstract":"<p>In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from Diophantine approximation which shows that for a family of limsup sets, their Lebesgue measure is determined by the convergence or divergence of naturally occurring volume sums. For many parameterised families of overlapping iterated function systems, we prove that a typical member will exhibit similar Khintchine like behaviour. Families of iterated function systems that our results apply to include those arising from Bernoulli convolutions, the <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"StartSet 0 comma 1 comma 3 EndSet\">\n <mml:semantics>\n <mml:mrow>\n <mml:mo fence=\"false\" stretchy=\"false\">{</mml:mo>\n <mml:mn>0</mml:mn>\n <mml:mo>,</mml:mo>\n <mml:mn>1</mml:mn>\n <mml:mo>,</mml:mo>\n <mml:mn>3</mml:mn>\n <mml:mo fence=\"false\" stretchy=\"false\">}</mml:mo>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">\\{0,1,3\\}</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> problem, and affine contractions with varying translation parameter. As a by-product of our analysis we obtain new proofs of some well known results due to Solomyak on the absolute continuity of Bernoulli convolutions, and when the attractor in the <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"StartSet 0 comma 1 comma 3 EndSet\">\n <mml:semantics>\n <mml:mrow>\n <mml:mo fence=\"false\" stretchy=\"false\">{</mml:mo>\n <mml:mn>0</mml:mn>\n <mml:mo>,</mml:mo>\n <mml:mn>1</mml:mn>\n <mml:mo>,</mml:mo>\n <mml:mn>3</mml:mn>\n <mml:mo fence=\"false\" stretchy=\"false\">}</mml:mo>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">\\{0,1,3\\}</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> problem has positive Lebesgue measure.</p>\n\n<p>For each <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"t element-of left-bracket 0 comma 1 right-bracket\">\n <mml:semantics>\n <mml:mrow>\n <mml:mi>t</mml:mi>\n <mml:mo>∈<!-- ∈ --></mml:mo>\n <mml:mo stretchy=\"false\">[</mml:mo>\n <mml:mn>0</mml:mn>\n <mml:mo>,</mml:mo>\n <mml:mn>1</mml:mn>\n <mml:mo stretchy=\"false\">]</mml:mo>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">t\\in [0,1]</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> we let <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"normal upper Phi Subscript t\">\n <mml:semantics>\n <mml:msub>\n <mml:mi mathvariant=\"normal\">Φ<!-- Φ --></mml:mi>\n <mml:mi>t</mml:mi>\n </mml:msub>\n <mml:annotation encoding=\"application/x-tex\">\\Phi _t</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> be the iterated function system given by <disp-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"normal upper Phi Subscript t Baseline colon-equal StartSet phi 1 left-parenthesis x right-parenthesis equals StartFraction x Over 2 EndFraction comma phi 2 left-parenthesis x right-parenthesis equals StartFraction x plus 1 Over 2 EndFraction comma phi 3 left-parenthesis x right-parenthesis equals StartFraction x plus t Over 2 EndFraction comma phi 4 left-parenthesis x right-parenthesis equals StartFraction x plus 1 plus t Over 2 EndFraction EndSet period\">\n <mml:semantics>\n <mml:mrow>\n <mml:msub>\n <mml:mi mathvariant=\"normal\">Φ<!-- Φ --></mml:mi>\n <mml:mrow class=\"MJX-TeXAtom-ORD\">\n <mml:mi>t</mml:mi>\n </mml:mrow>\n </mml:msub>\n <mml:mo>≔</mml:mo>\n <mml:mstyle scriptlevel=\"0\">\n <mml:mrow class=\"MJX-TeXAtom-ORD\">\n <mml:mo maxsize=\"1.623em\" minsize=\"1.623em\">{</mml:mo>\n </mml:mrow>\n </mml:mstyle>\n <mml:msub>\n <mml:mi>ϕ<!-- ϕ --></mml:mi>\n <mml:mn>1</mml:mn>\n </mml:msub>\n <mml:mo stretchy=\"false\">(</mml:mo>\n <mml:mi>x</mml:mi>\n <mml:mo stretchy=\"false\">)</mml:mo>\n <mml:mo>=</mml:mo>\n <mml:mfrac>\n <mml:mi>x</mml:mi>\n <mml:mn>2</mml:mn>\n </mml:mfrac>\n <mml:mo>,</mml:mo>\n <mml:msub>\n <mml:mi>ϕ<!-- ϕ --></mml:mi>\n <mml:mn>2</mml:mn>\n </mml:msub>\n <mml:mo stretchy=\"false\">(</mml:mo>\n <mml:mi>x</mml:mi>\n <mml:mo stretchy=\"false\">)</mml:mo>\n <mml:mo>=</mml:mo>\n <mml:mfrac>\n <mml:mrow>\n <mml:mi>x</mml:mi>\n <mml:mo>+</mml:mo>\n <mml:mn>1</mml:mn>\n </mml:mrow>\n <mml:mn>2</mml:mn>\n </mml:mfrac>\n <mml:mo>,</mml:mo>\n <mml:msub>\n <mml:mi>ϕ<!-- ϕ --></mml:mi>\n <mml:mn>3</mml:mn>\n </mml:msub>\n <mml:mo stretchy=\"false\">(</mml:mo>\n <mml:mi>x</mml:mi>\n <mml:mo stretchy=\"false\">)</mml:mo>\n <mml:mo>=</mml:mo>\n <mml:mfrac>\n <mml:mrow>\n <mml:mi>x</mml:mi>\n <mml:mo>+</mml:mo>\n <mml:mi>t</mml:mi>\n </mml:mrow>\n <mml:mn>2</mml:mn>\n </mml:mfrac>\n <mml:mo>,</mml:mo>\n <mml:msub>\n <mml:mi>ϕ<!-- ϕ --></mml:mi>\n <mml:mrow class=\"MJX-TeXAtom-ORD\">\n <mml:mn>4</mml:mn>\n </mml:mrow>\n </mml:msub>\n <mml:mo stretchy=\"false\">(</mml:mo>\n <mml:mi>x</mml:mi>\n <mml:mo stretchy=\"false\">)</mml:mo>\n <mml:mo>=</mml:mo>\n <mml:mfrac>\n <mml:mrow>\n <mml:mi>x</mml:mi>\n <mml:mo>+</mml:mo>\n <mml:mn>1</mml:mn>\n <mml:mo>+</mml:mo>\n <mml:mi>t</mml:mi>\n </mml:mrow>\n <mml:mn>2</mml:mn>\n </mml:mfrac>\n <mml:mstyle scriptlevel=\"0\">\n <mml:mrow class=\"MJX-TeXAtom-ORD\">\n <mml:mo maxsize=\"1.623em\" minsize=\"1.623em\">}</mml:mo>\n </mml:mrow>\n </mml:mstyle>\n <mml:mo>.</mml:mo>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">\\begin{equation*} \\Phi _{t}≔\\Big \\{\\phi _1(x)=\\frac {x}{2},\\phi _2(x)=\\frac {x+1}{2},\\phi _3(x)=\\frac {x+t}{2},\\phi _{4}(x)=\\frac {x+1+t}{2}\\Big \\}. \\end{equation*}</mml:annotation>\n </mml:semantics>\n</mml:math>\n</disp-formula>\n We prove that either <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"normal upper Phi Subscript t\">\n <mml:semantics>\n <mml:msub>\n <mml:mi mathvariant=\"normal\">Φ<!-- Φ --></mml:mi>\n <mml:mi>t</mml:mi>\n </mml:msub>\n <mml:annotation encoding=\"application/x-tex\">\\Phi _t</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> contains an exact overlap, or we observe Khintchine like behaviour. Our analysis shows that by studying the metric properties of limsup sets, we can distinguish between the overlapping behaviour of iterated function systems in a way that is not available to us by simply studying properties of self-similar measures.</p>\n\n<p>Last of all, we introduce a property of an iterated function system that we call being consistently separated with respect to a measure. We prove that this property implies that the pushforward of the measure is absolutely continuous. We include several explicit examples of consistently separated iterated function systems.</p>","PeriodicalId":49828,"journal":{"name":"Memoirs of the American Mathematical Society","volume":"1 1","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2019-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Memoirs of the American Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1090/memo/1428","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 11
Abstract
In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from Diophantine approximation which shows that for a family of limsup sets, their Lebesgue measure is determined by the convergence or divergence of naturally occurring volume sums. For many parameterised families of overlapping iterated function systems, we prove that a typical member will exhibit similar Khintchine like behaviour. Families of iterated function systems that our results apply to include those arising from Bernoulli convolutions, the {0,1,3}\{0,1,3\} problem, and affine contractions with varying translation parameter. As a by-product of our analysis we obtain new proofs of some well known results due to Solomyak on the absolute continuity of Bernoulli convolutions, and when the attractor in the {0,1,3}\{0,1,3\} problem has positive Lebesgue measure.
For each t∈[0,1]t\in [0,1] we let Φt\Phi _t be the iterated function system given by Φt≔{ϕ1(x)=x2,ϕ2(x)=x+12,ϕ3(x)=x+t2,ϕ4(x)=x+1+t2}.\begin{equation*} \Phi _{t}≔\Big \{\phi _1(x)=\frac {x}{2},\phi _2(x)=\frac {x+1}{2},\phi _3(x)=\frac {x+t}{2},\phi _{4}(x)=\frac {x+1+t}{2}\Big \}. \end{equation*}
We prove that either Φt\Phi _t contains an exact overlap, or we observe Khintchine like behaviour. Our analysis shows that by studying the metric properties of limsup sets, we can distinguish between the overlapping behaviour of iterated function systems in a way that is not available to us by simply studying properties of self-similar measures.
Last of all, we introduce a property of an iterated function system that we call being consistently separated with respect to a measure. We prove that this property implies that the pushforward of the measure is absolutely continuous. We include several explicit examples of consistently separated iterated function systems.
期刊介绍:
Memoirs of the American Mathematical Society is devoted to the publication of research in all areas of pure and applied mathematics. The Memoirs is designed particularly to publish long papers or groups of cognate papers in book form, and is under the supervision of the Editorial Committee of the AMS journal Transactions of the AMS. To be accepted by the editorial board, manuscripts must be correct, new, and significant. Further, they must be well written and of interest to a substantial number of mathematicians.