Skip to main content

Given a real number $x \in (0, 1)$, we denote by $0.x_1x_2...$$0.x_1x_2\ldots$ its binary expansion, where we always choose the expansion that ends in an infinite number of $1’s$$1$’s whenever a choice has to be made.

Given two real numbers $a = 0.a_1a_2...$$a = 0.a_1a_2\ldots$ and $b = 0.b_1b_2...$ in $(0, 1)$, denote by $S(a, b)$ the set of indices $i$ for which $a_i \neq b_i$. We label the elements of $S(a, b)$ by $s_0, s_1, ...$$s_0, s_1,\ldots$, where the values of the sequence are chosen to be in increasing order. We suppress the dependence on $a, b$ when writing the sequence for clarity.

We say an increasing sequence $c_n$ of positive real numbers is anti-syndetic if for any polynomial $P$ with positive coefficients, there exists some $N \in \mathbb N$ such that $c_{n + N} > P(n)$ for all $n \in \mathbb N$.

A subset $D$ of $(0, 1)$ is said to be well approximating if for every $x \in (0, 1)$, there is a $d \in D$ such that the sequence $s_n$ associated with $S(x, d)$ is anti-syndetic.

Question: Does there exist a well approximating subset of $(0, 1)$ with Lebesgue measure zero?

Given a real number $x \in (0, 1)$, we denote by $0.x_1x_2...$ its binary expansion, where we always choose the expansion that ends in an infinite number of $1’s$ whenever a choice has to be made.

Given two real numbers $a = 0.a_1a_2...$ and $b = 0.b_1b_2...$ in $(0, 1)$, denote by $S(a, b)$ the set of indices $i$ for which $a_i \neq b_i$. We label the elements of $S(a, b)$ by $s_0, s_1, ...$ where the values of the sequence are chosen to be in increasing order. We suppress the dependence on $a, b$ when writing the sequence for clarity.

We say an increasing sequence $c_n$ of positive real numbers is anti-syndetic if for any polynomial $P$ with positive coefficients, there exists some $N \in \mathbb N$ such that $c_{n + N} > P(n)$ for all $n \in \mathbb N$.

A subset $D$ of $(0, 1)$ is said to be well approximating if for every $x \in (0, 1)$, there is a $d \in D$ such that the sequence $s_n$ associated with $S(x, d)$ is anti-syndetic.

Question: Does there exist a well approximating subset of $(0, 1)$ with Lebesgue measure zero?

Given a real number $x \in (0, 1)$, we denote by $0.x_1x_2\ldots$ its binary expansion, where we always choose the expansion that ends in an infinite number of $1$’s whenever a choice has to be made.

Given two real numbers $a = 0.a_1a_2\ldots$ and $b = 0.b_1b_2...$ in $(0, 1)$, denote by $S(a, b)$ the set of indices $i$ for which $a_i \neq b_i$. We label the elements of $S(a, b)$ by $s_0, s_1,\ldots$, where the values of the sequence are chosen to be in increasing order. We suppress the dependence on $a, b$ when writing the sequence for clarity.

We say an increasing sequence $c_n$ of positive real numbers is anti-syndetic if for any polynomial $P$ with positive coefficients, there exists some $N \in \mathbb N$ such that $c_{n + N} > P(n)$ for all $n \in \mathbb N$.

A subset $D$ of $(0, 1)$ is said to be well approximating if for every $x \in (0, 1)$, there is a $d \in D$ such that the sequence $s_n$ associated with $S(x, d)$ is anti-syndetic.

Question: Does there exist a well approximating subset of $(0, 1)$ with Lebesgue measure zero?

deleted 1 character in body
Source Link
Nate River
  • 6.3k
  • 2
  • 23
  • 99

Given a real number $x \in (0, 1)$, we denote by $0.x_1x_2...$ its binary expansion, where we always choose the expansion that ends in an infinite number of $1’s$ whenever a choice has to be made.

Given two real numbers $a = 0.a_1a_2...$ and $b = 0.b_1b_2...$ in $(0, 1)$, denote by $S(a, b)$ the set of indices $i$ for which $a_i \neq b_i$. We label the elements of $S(a, b)$ by $s_0, s_1, ...$ where the values of the sequence are chosen to be in increasing order. We suppress the dependence on $a, b$ when writing the sequence for clarity.

We say aan increasing sequence $c_n$ of positive real numbers is anti-syndetic if for any increasing sequencepolynomial $k_n$ of$P$ with positive integerscoefficients, there exists some $N \in \mathbb N$ such that $c_{n + N} > k_n$$c_{n + N} > P(n)$ for all $n \in \mathbb N$.

A subset $D$ of $(0, 1)$ is said to be well approximating if for every $x \in (0, 1)$, there is a $d \in D$ such that the sequence $s_n$ associated with $S(x, d)$ is anti-syndetic.

Question: Does there exist a well approximating subset of $(0, 1)$ with Lebesgue measure zero?

Given a real number $x \in (0, 1)$, we denote by $0.x_1x_2...$ its binary expansion, where we always choose the expansion that ends in an infinite number of $1’s$ whenever a choice has to be made.

Given two real numbers $a = 0.a_1a_2...$ and $b = 0.b_1b_2...$ in $(0, 1)$, denote by $S(a, b)$ the set of indices $i$ for which $a_i \neq b_i$. We label the elements of $S(a, b)$ by $s_0, s_1, ...$ where the values of the sequence are chosen to be in increasing order. We suppress the dependence on $a, b$ when writing the sequence for clarity.

We say a sequence $c_n$ is anti-syndetic if for any increasing sequence $k_n$ of positive integers, there exists some $N \in \mathbb N$ such that $c_{n + N} > k_n$ for all $n \in \mathbb N$.

A subset $D$ of $(0, 1)$ is said to be well approximating if for every $x \in (0, 1)$, there is a $d \in D$ such that the sequence $s_n$ associated with $S(x, d)$ is anti-syndetic.

Question: Does there exist a well approximating subset of $(0, 1)$ with Lebesgue measure zero?

Given a real number $x \in (0, 1)$, we denote by $0.x_1x_2...$ its binary expansion, where we always choose the expansion that ends in an infinite number of $1’s$ whenever a choice has to be made.

Given two real numbers $a = 0.a_1a_2...$ and $b = 0.b_1b_2...$ in $(0, 1)$, denote by $S(a, b)$ the set of indices $i$ for which $a_i \neq b_i$. We label the elements of $S(a, b)$ by $s_0, s_1, ...$ where the values of the sequence are chosen to be in increasing order. We suppress the dependence on $a, b$ when writing the sequence for clarity.

We say an increasing sequence $c_n$ of positive real numbers is anti-syndetic if for any polynomial $P$ with positive coefficients, there exists some $N \in \mathbb N$ such that $c_{n + N} > P(n)$ for all $n \in \mathbb N$.

A subset $D$ of $(0, 1)$ is said to be well approximating if for every $x \in (0, 1)$, there is a $d \in D$ such that the sequence $s_n$ associated with $S(x, d)$ is anti-syndetic.

Question: Does there exist a well approximating subset of $(0, 1)$ with Lebesgue measure zero?

added 7 characters in body
Source Link
Nate River
  • 6.3k
  • 2
  • 23
  • 99

Given a real number $x \in (0, 1)$, we denote by $0.x_1x_2...$ its binary expansion, where we always choose the expansion that ends in an infinite number of $1’s$ whenever a choice has to be made.

Given two real numbers $a = 0.a_1a_2...$ and $b = 0.b_1b_2...$ in $(0, 1)$, denote by $S(a, b)$ the set of indices $i$ for which $a_i \neq b_i$. We label the elements of $S(a, b)$ by $s_0, s_1, ...$ where the values of the sequence are chosen to be in increasing order. We suppress the dependence on $a, b$ when writing the sequence for clarity.

We say a sequence $c_n$ is anti-syndetic if for any increasing sequence $k_n$ of positive integers, there exists some $N \in \mathbb N$ such that $c_n > k_n$$c_{n + N} > k_n$ for all $n > N$$n \in \mathbb N$.

A subset $D$ of $(0, 1)$ is said to be well approximating if for every $x \in (0, 1)$, there is a $d \in D$ such that the sequence $s_n$ associated with $S(x, d)$ is anti-syndetic.

Question: Does there exist a well approximating subset of $(0, 1)$ with Lebesgue measure zero?

Given a real number $x \in (0, 1)$, we denote by $0.x_1x_2...$ its binary expansion, where we always choose the expansion that ends in an infinite number of $1’s$ whenever a choice has to be made.

Given two real numbers $a = 0.a_1a_2...$ and $b = 0.b_1b_2...$ in $(0, 1)$, denote by $S(a, b)$ the set of indices $i$ for which $a_i \neq b_i$. We label the elements of $S(a, b)$ by $s_0, s_1, ...$ where the values of the sequence are chosen to be in increasing order. We suppress the dependence on $a, b$ when writing the sequence for clarity.

We say a sequence $c_n$ is anti-syndetic if for any increasing sequence $k_n$ of positive integers, there exists some $N \in \mathbb N$ such that $c_n > k_n$ for all $n > N$.

A subset $D$ of $(0, 1)$ is said to be well approximating if for every $x \in (0, 1)$, there is a $d \in D$ such that the sequence $s_n$ associated with $S(x, d)$ is anti-syndetic.

Question: Does there exist a well approximating subset of $(0, 1)$ with Lebesgue measure zero?

Given a real number $x \in (0, 1)$, we denote by $0.x_1x_2...$ its binary expansion, where we always choose the expansion that ends in an infinite number of $1’s$ whenever a choice has to be made.

Given two real numbers $a = 0.a_1a_2...$ and $b = 0.b_1b_2...$ in $(0, 1)$, denote by $S(a, b)$ the set of indices $i$ for which $a_i \neq b_i$. We label the elements of $S(a, b)$ by $s_0, s_1, ...$ where the values of the sequence are chosen to be in increasing order. We suppress the dependence on $a, b$ when writing the sequence for clarity.

We say a sequence $c_n$ is anti-syndetic if for any increasing sequence $k_n$ of positive integers, there exists some $N \in \mathbb N$ such that $c_{n + N} > k_n$ for all $n \in \mathbb N$.

A subset $D$ of $(0, 1)$ is said to be well approximating if for every $x \in (0, 1)$, there is a $d \in D$ such that the sequence $s_n$ associated with $S(x, d)$ is anti-syndetic.

Question: Does there exist a well approximating subset of $(0, 1)$ with Lebesgue measure zero?

Source Link
Nate River
  • 6.3k
  • 2
  • 23
  • 99
Loading