Skip to main content
Log in

On Sets Containing an Affine Copy of Bounded Decreasing Sequences

  • Published:
Journal of Fourier Analysis and Applications Aims and scope Submit manuscript

Abstract

How small can a set be while containing many configurations? Following up on earlier work of Erdős and Kakutani (Colloq Math 4:195–196, 1957), Máthé (Fund Math 213(3):213–219, 2011) and Molter and Yavicoli (Math Proc Camb Soc 168:57–73, 2018), we address the question in two directions. On one hand, if a subset of the real numbers contains an affine copy of all bounded decreasing sequences, then we show that such a subset must be somewhere dense. On the other hand, given a collection of convergent sequences with prescribed decay, there is a closed and nowhere dense subset of the reals that contains an affine copy of every sequence in that collection.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Bennett, M., Iosevich, A., Taylor, K.: Finite chains inside thin subsets of \({\mathbb{R}}^d\). Anal. PDE 9(3), 597–614 (2016)

    Article  MathSciNet  Google Scholar 

  2. Bourgain, J.: Construction of sets of positive measure not containing an affine image of a given infinite structure. Isr. J. Math. 60(3), 333–344 (1987)

    Article  MathSciNet  Google Scholar 

  3. Davies, R.O.: Some remarks on the Kakeya problem. Proc. Camb. Philos. Soc. 69, 417–421 (1971)

    Article  MathSciNet  Google Scholar 

  4. Erdős, P.: On sets of distances of \(n\) points. Am. Math. Month. 53, 248–250 (1946)

    Article  MathSciNet  Google Scholar 

  5. Erdős, P.: Remarks on some problems in number theory. Math. Balkanica 4, 197–202 (1974). Papers presented at the Fifth Balkan Mathematical Congress (Belgrade, 1974)

    MathSciNet  MATH  Google Scholar 

  6. Erdős, P., Kakutani, S.: On a perfect set. Colloq. Math. 4, 195–196 (1957)

    Article  MathSciNet  Google Scholar 

  7. Falconer, K.J.: On a problem of Erdős on sequences and measurable sets. Proc. Am. Math. Soc. 90(1), 77–78 (1984)

    MATH  Google Scholar 

  8. Fraser, R., Pramanik, M.: Large sets avoiding patterns. Anal. PDE 11(5), 1083–1111 (2018)

    Article  MathSciNet  Google Scholar 

  9. Grafakos, L., Greenleaf, A., Iosevich, A., Palsson, E.: Multilinear generalized Radon transforms and point configurations. Forum Math. 27(4), 2323–2360 (2015)

    Article  MathSciNet  Google Scholar 

  10. Greenleaf, A., Iosevich, A., Liu, B., Palsson, E.: A group-theoretic viewpoint on Erdős-Falconer problems and the Mattila integral. Rev. Mat. Iberoam. 31(3), 799–810 (2015)

    Article  MathSciNet  Google Scholar 

  11. Guth, L., Iosevich, A., Ou, Y., Wang, H.: On Falconer’s distance set problem in the plane. Invent. Math. 219(3), 779–830 (2020)

    Article  MathSciNet  Google Scholar 

  12. Iosevich, A., Liu, B.: Equilateral triangles in subsets of \({\mathbb{R}}^d\) of large Hausdorff dimension. Isr. J. Math. 231(1), 123–137 (2019)

    Article  Google Scholar 

  13. Keleti, T.: Construction of one-dimensional subsets of the reals not containing similar copies of given patterns. Anal. PDE 1(1), 29–33 (2008)

    Article  MathSciNet  Google Scholar 

  14. Keleti, T.: Are lines much bigger than line segments? Proc. Am. Math. Soc. 144(4), 1535–1541 (2016)

    Article  MathSciNet  Google Scholar 

  15. Kolountzakis, M.N.: Infinite patterns that can be avoided by measure. Bull. Lond Math. Soc. 29(4), 415–424 (1997)

    Article  MathSciNet  Google Scholar 

  16. Łaba, I., Pramanik, M.: Arithmetic progressions in sets of fractional dimension. Geom. Funct. Anal. 19(2), 429–456 (2009)

    Article  MathSciNet  Google Scholar 

  17. Lyall, N., Magyar, Á.: Distance graphs and sets of positive upper density in \({\mathbb{R}}^d\). Anal. PDE 13(3), 685–700 (2020)

    Article  MathSciNet  Google Scholar 

  18. Máthé, A.: Covering the real line with translates of a zero-dimensional compact set. Fund. Math. 213(3), 213–219 (2011)

    Article  MathSciNet  Google Scholar 

  19. Molter, U., Yavicoli, A.: Small Sets containing any pattern. Math. Proc. Camb. Philos. Soc. 168, 57–73 (2018)

    Article  MathSciNet  Google Scholar 

  20. Shmerkin, P.: Salem sets with no arithmetic progressions. Int. Math. Res. Not. IMRN 7, 1929–1941 (2017)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

I am grateful to my advisor Malabika Pramanik for her guidance throughout the preparation of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tongou Yang.

Additional information

Communicated by Alex Iosevich.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

In the appendix, we give a proof of a particular case of Molter and Yavicoli’s result [19]. It is actually almost parallel to their proof, but with the notations greatly simplified since we are only considering a special case.

Definition 7.1

A dimension function \(h:[0,\infty )\rightarrow [0,\infty ]\) is a right-continuous increasing function such that \(h(0)=0\), \(h(t)>0\) for \(t>0\).

Definition 7.2

Let h be a dimension function. For a set \(E\subseteq {\mathbb {R}}\) and \(0<\delta \le \infty \), we define

$$\begin{aligned} {\mathcal {H}}^h_\delta (E)=\inf \left\{ \sum _i h\left( \mathrm {diam}{B_i}\right) :\bigcup _i B_i\supseteq E,\mathrm {diam}(B_i)<\delta \right\} . \end{aligned}$$

We then define

$$\begin{aligned} {\mathcal {H}}^h(E):=\sup _{0<\delta \le \infty }{\mathcal {H}}^h_\delta (E) =\lim _{\delta \rightarrow 0^+}{\mathcal {H}}^h_\delta (E). \end{aligned}$$

Proposition 7.3

Let \(h(x):=-\frac{1}{\ln x}\) with \(h(0)=0\) be a dimension function. Suppose \({\mathcal {H}}^h(E)=0\) for some set \(E\subseteq {\mathbb {R}}\). Then E has Hausdorff dimension 0.

Proof

Let \(s>0\). Then there is \(C_s>0\) with \( x^s<-\frac{C_s}{\ln x}\) for all \(0\le x\le 1\), since \(\lim _{x\rightarrow 0^+}x^s\ln x=0\) by L’Hôpital’s rule. Then for any \(0<\delta <1\),

$$\begin{aligned} {\mathcal {H}}^s_\delta (E)&=\inf \left\{ \sum _i \left( \mathrm {diam}(B_i)\right) ^s :\bigcup _i B_i\supseteq E,\mathrm {diam}(B_i)<\delta \right\} \\&\le \inf \left\{ \sum _i C_s h(\mathrm {diam} (B_i)) :\bigcup _i B_i\supseteq E,\mathrm {diam}(B_i)<\delta \right\} \\&\le C_s {\mathcal {H}}^h(E)=0. \end{aligned}$$

\(\square \)

Theorem 7.4

Theorem 3.2 and Theorem 4.4 of [19], simplified Let h be any dimension function. Then there is an \(F_\sigma \)-set \(E\subseteq {\mathbb {R}}\) such that \({\mathcal {H}}^h(E)=0\) and for any sequence \(\{\alpha _m\}_{m=1}^\infty \subseteq {\mathbb {R}}\), we have

$$\begin{aligned} \bigcap _{m=1}^\infty E+\alpha _m\ne \varnothing . \end{aligned}$$

In particular, \(\mathrm {dim}_H(E)=0\) by the previous proposition.

Proof

Let \(M_n\in 2{\mathbb {N}}\) be an increasing sequence, \(M_1\ge 4\), such that for all \(n\ge 2\),

$$\begin{aligned} h\left( \frac{1}{M_1M_2\cdots M_n}\right) \le \frac{1}{M_1M_2\cdots M_{n-1}}. \end{aligned}$$

For each real number x, we consider its digit expansion with respect to the sequence \(\{M_n\}\):

$$\begin{aligned} x=[x]+\sum _{n=1}^\infty \frac{x^{(n)}}{M_1M_2\cdots M_n}, \quad 0\le x^{(n)}\le M_n-1. \end{aligned}$$

where [x] denotes the integral part of x.

Let \(F_n\), \(n\in {\mathbb {N}}\) denote the collection of all real numbers such that its n-th digit, \(x^{(n)}\), is 0 or \(M_n/2\). If there are two possible expansions of x with one of them having \(x^{(n)}= 0\) or \(M_n/2\), include that number x in \(F_n\) as well (this ensures that \(F_n\) is made up of disjoint closed intervals). Let \(I_j:=\{(2k-1)2^{j-1}:k\in {\mathbb {N}}\}\) for \(j\in {\mathbb {N}}\). Then \(\{I_j\}_{j=1}^\infty \) forms a partition for \({\mathbb {N}}\). Define \(K_j:=\cap _{n\in I_j}F_n\). For example, \(K_2\) is the set of all real numbers so that their \(2,6,10,14,\dots \)-th digits are 0 or \(M_2/2\). Note \(K_j\) is also closed.

Lastly, define \(E:=\cup _j K_j\). We claim that E is the required \(F_\sigma \)-set.

  • To show \({\mathcal {H}}^h(E)=0\), it suffices to show \({\mathcal {H}}^h(K_j)=0\) for all j. Let \(\delta >0\) be small, and cover \(E_j\) by

    $$\begin{aligned} \frac{\prod _{i=1}^{(2k-1)2^{j-1}}M_i}{\prod _{l=1}^k \frac{1}{2}M_{(2l-1)2^{j-1}}} \end{aligned}$$

    intervals of lengths

    $$\begin{aligned} \frac{1}{\prod _{i=1}^{(2k-1)2^{j-1}}M_i}<\delta . \end{aligned}$$

    for all large k’s. Then we have

    $$\begin{aligned} {\mathcal {H}}^h_\delta (K_j)&\le \frac{\prod _{i=1}^{(2k-1)2^{j-1}}M_i}{\prod _{l=1}^{k} \frac{1}{2} M_{(2l-1)2^{j-1}}}\,\,\cdot h \left( \frac{1}{\prod _{i=1}^{(2k-1)2^{j-1}}M_i}\right) \\&\le \frac{\prod _{i=1}^{(2k-1)2^{j-1}}M_i}{\prod _{l=1}^{k} \frac{1}{2} M_{(2l-1)2^{j-1}}}\,\,\cdot \frac{1}{\prod _{i=1}^{(2k-1)2^{j-1}-1}M_i}\\&=\frac{2}{\prod _{l=1}^{k-1} \frac{1}{2} M_{(2l-1)2^{j-1}}}\\&\le \frac{1}{2^{k-2}}, \text {for all large }k. \end{aligned}$$

    Letting \(k\rightarrow \infty \), we have \({\mathcal {H}}^h_\delta (K_j)=0\). Letting \(\delta \rightarrow 0^+\), we have then \({\mathcal {H}}^h(K_j)=0\). Thus \({\mathcal {H}}^h(E)=0\).

  • Now let \(\{\alpha _m\}\) be given. We show

    $$\begin{aligned} \bigcap _{m=1}^\infty E+\alpha _m\ne \varnothing . \end{aligned}$$

    We have \(E\supseteq K_m\) for all \(m\ge 1\), so it suffices to show

    $$\begin{aligned} \bigcap _{m=1}^\infty E+\alpha _m\supseteq \bigcap _{m=1}^\infty K_m+\alpha _m. \end{aligned}$$
    (7.1)

    But \(K_1+\alpha _1=(F_1+\alpha _1)\cap (F_3+\alpha _1)\cap (F_5+\alpha _1)\cap \cdots \), \(K_2+\alpha _2=(F_2+\alpha _2)\cap (F_6+\alpha _2)\cap (F_{10}+\alpha _2)\cap \cdots \), etc. We can rewrite the infinite intersection on the right hand side of (7.1) into:

    $$\begin{aligned} \bigcap _{u=1}^\infty F_u+\alpha _{j_u}, \end{aligned}$$
    (7.2)

    where \(j_u\) is the greatest integer v such that \(2^{v-1}\) divides u. For example, the first few terms of the intersection are:

    $$\begin{aligned} (F_1+\alpha _1)\cap (F_2+\alpha _2)\cap (F_3+\alpha _1)\cap (F_4+\alpha _3) \cap (F_5+\alpha _1)\cap (F_6+\alpha _2)\cap \cdots \end{aligned}$$

    We would like to show this intersection is nonempty.

    Denote \(C_1:=[0, 1 /M_1]\). Since the distance between the centres of the two adjacent intervals in \(F_2\) is \(1 /(2M_1)\) and the intervals of \(F_2\) are shorter in length than those of \(F_1\), no matter how we translate \(C_1\), there is an interval \(C_2\) of \(F_2\) that is contained in that translate of \(C_1\).

    Hence for any given \(\alpha _1,\alpha _2\in {\mathbb {R}}\), we can find such \(C_2\) satisfying \(C_2+\alpha _2\subseteq C_1+\alpha _1\). Similarly, one can find \(C_3\) of \(F_3\) such that \(C_3+\alpha _1\subseteq C_2+\alpha _2\). Continuing in this way, we get a nested sequence of compact intervals with rapidly decreasing length:

    $$\begin{aligned} C_u+\alpha _{j_u}\subseteq C_{u-1}+\alpha _{j_{u-1}},\quad u\ge 2. \end{aligned}$$

    By the nested interval theorem, the intersection in (7.2) is nonempty, and hence so is the intersection in (7.1).

\(\square \)

We remark that E defined in this way is not closed. This was seen by taking \(\{\alpha _m\}\) to be \({\mathbb {Q}}\cap [0,1]\) as in the introduction of the paper, but it can also be seen directly from this simplified construction. Indeed, \(E^c\) is the set of all real numbers x such that for any \(j\in {\mathbb {N}}\), there is \(k_j\in {\mathbb {N}}\) so that the \((2k-1)2^{j-1}\)-th digit of x is not 0 or \(M_n/2\). Particularly, if \(x\in E^c\), then there is an increasing sequence \(a_n\in {\mathbb {N}}\) such that the \(a_n\)-th digit of x is not 0 or \(M_n/2\).

If \(E^c\) were open, this means for any \(x\in E^c\), if y is sufficiently close to x, then \(y\in E^c\). However, we see that for any \(\delta >0\), we can choose \(|x-y|<\delta \) such that y is a finite decimal number, so \(y\notin E^c\).

Lastly, we have that E is dense in \({\mathbb {R}}\). Given \(\epsilon >0\) and \(x\in {\mathbb {R}}\), consider the digit expansion of x. There is some \(j_0\) and some real number y with the same digits as x on all digits \(1\le j\le j_0-1\) but having all digits 0 for \(j\ge j_0\), such that \(|x-y|<\delta \). Then \(y\in K_{j_0}\subseteq E\).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, T. On Sets Containing an Affine Copy of Bounded Decreasing Sequences. J Fourier Anal Appl 26, 73 (2020). https://doi.org/10.1007/s00041-020-09780-4

Download citation

  • Received:

  • Revised:

  • Published:

  • DOI: https://doi.org/10.1007/s00041-020-09780-4

Keywords

Mathematics Subject Classification

Navigation