Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

../


Source. Y. Yu and K. Chen, Erdős Problem 354(i): Strong Completeness of Two Dyadic Floor Sequences, manuscript of 13 September 2026, Section 10 "Good rational approximants and long sparse windows" with Subsections 10.1--10.2 and displays (10.1)--(10.2), physical pp. 11--12, in the seventeen-page PDF held by its library source card, Yu and Chen (2026).

Standing. This is an author-recorded reconstruction. It is not an independent review, changes no status and assigns no tier. Dirichlet's approximation theorem is the one external input; it is imported in the form stated below and not reproved.

Definitions

The normalized pair, ai,bia_i,b_i, KnK_n and PnP_n are as on the normalization page; c0c_0, aa and RnR_n as on the finite-event decay page; θ=α/β\theta=\alpha/\beta, good rationals, λ\lambda, kk and En,kE_{n,k} as on the digit-budget page. log⁡\log is the natural logarithm. For an integer b≥2b\ge2 let D(b)D(b) be the least denominator ≥b\ge b of a good rational (shown to exist below). Put

b(n)=⌈2nβ⌉,Dn∗=D(b(n)),k(D)=⌈log⁡2(8D)⌉,f(n)=n+k(Dn∗),b(n)=\lceil2^n\beta\rceil,\quad D_n^*=D(b(n)),\quad k(D)=\lceil\log_2(8D)\rceil,\quad f(n)=n+k(D_n^*), m(D)=⌊log⁡2(D/β)⌋ (D≥β),Cβ=⌈log⁡2⌈16β⌉⌉,Cβ′=⌈log⁡2(3⌈β⌉)⌉.m(D)=\lfloor\log_2(D/\beta)\rfloor\ (D\ge\beta),\qquad C_\beta=\lceil\log_2\lceil16\beta\rceil\rceil,\qquad C'_\beta=\lceil\log_2(3\lceil\beta\rceil)\rceil .

For a reduced p/qp/q its binary height is H=⌈log⁡2(p+q+1)⌉H=\lceil\log_2(p+q+1)\rceil, and δi=qai−pbi\delta_i=qa_i-pb_i for i≥0i\ge0.

Imported theorem (Dirichlet). For every real ξ\xi and integer Q≥1Q\ge1 there are integers j,kj,k with 1≤k≤Q1\le k\le Q and ∣kξ−j∣≤1/(Q+1)|k\xi-j|\le1/(Q+1). (This is the pigeonhole form; the source cites Mathlib's Diophantine approximation results as its reference 10.)

Statement

(10.2). Let the normalized pair have irrational θ\theta and suppose the sequence is incomplete. There is a constant L>0L>0 such that for every T0≥1T_0\ge1 and every ε>0\varepsilon>0 there are an integer T≥T0T\ge T_0 and a reduced rational p/qp/q with 1<p/q<21<p/q<2 and ∣p/q−θ∣<ε|p/q-\theta|<\varepsilon such that

H2≤4T,KT≤Llog⁡T,∣δi∣<2H (0≤i≤T).H^2\le4T,\qquad K_T\le L\log T,\qquad |\delta_i|<2^H\ (0\le i\le T).

Proof

Step 1: good rationals and the crossing denominator

Let Q≥1Q\ge1. Dirichlet gives 1≤q≤Q1\le q\le Q and pp with ∣θ−p/q∣≤1/(q(Q+1))|\theta-p/q|\le1/(q(Q+1)); reducing p/qp/q can only decrease the denominator and keeps the bound, and 1/(q(Q+1))<1/q21/(q(Q+1))<1/q^2 since q≤Qq\le Q. So a good rational pQ/qQp_Q/q_Q with ∣θ−pQ/qQ∣≤1/(Q+1)|\theta-p_Q/q_Q|\le1/(Q+1) exists for every QQ. None equals θ\theta, which is irrational, so if there were only finitely many good rationals their distances to θ\theta would have a positive minimum, contradicting 1/(Q+1)→01/(Q+1)\to0. Hence there are infinitely many good rationals; for a fixed qq at most two numerators satisfy ∣θ−p/q∣<1/q2|\theta-p/q|<1/q^2, so their denominators are unbounded and D(b)D(b) exists for every b≥2b\ge2.

The pre-crossing rational. Given b≥2b\ge2, apply Dirichlet with Q=D(b)−1≥1Q=D(b)-1\ge1: there is a reduced p/qp/q with q<D(b)q<D(b) and ∣θ−p/q∣≤1/(D(b)q)|\theta-p/q|\le1/(D(b)q). It is good, because q<D(b)q<D(b) gives 1/(D(b)q)<1/q21/(D(b)q)<1/q^2. Minimality of D(b)D(b) then forces q<bq<b: a good denominator in [b,D(b))[b,D(b)) would contradict the definition of D(b)D(b).

Step 2: matching layers and the cubic advance

For D≥βD\ge\beta, 2m(D)β≤D<2m(D)+1β2^{m(D)}\beta\le D<2^{m(D)+1}\beta by definition of m(D)m(D), and

k(D)=⌈log⁡2(8D)⌉≤⌈m(D)+1+3+log⁡2β⌉=m(D)+⌈log⁡2(16β)⌉≤m(D)+Cβ.k(D)=\lceil\log_2(8D)\rceil\le\lceil m(D)+1+3+\log_2\beta\rceil =m(D)+\lceil\log_2(16\beta)\rceil\le m(D)+C_\beta .

Apply (DB) from the digit-budget page at depth n≥1n\ge1 with the good rational of denominator Dn∗≥b(n)≥2nβD_n^*\ge b(n)\ge2^n\beta; its kk is k(Dn∗)k(D_n^*), so under incompleteness

Kf(n)≥Kn+c02eaKn−3(n≥1).K_{f(n)}\ge K_n+\frac{c_0}2e^{aK_n}-3\qquad(n\ge1).

Claim: f(n)>n3f(n)>n^3 for arbitrarily large nn. Suppose instead f(n)≤n3f(n)\le n^3 for all n≥n1n\ge n_1. Since KK is nondecreasing, Kn3≥Kf(n)K_{n^3}\ge K_{f(n)} for such nn. The event set is infinite (normalization page, item 5), so Kn→∞K_n\to\infty, and once KnK_n is large the exponential term dominates: Kn+c02eaKn−3≥Kn4K_n+\frac{c_0}2e^{aK_n}-3\ge K_n^4. Hence there is n2≥n1n_2\ge n_1 with Kn3≥Kn4K_{n^3}\ge K_n^4 for all n≥n2n\ge n_2. Choose n0≥n2n_0\ge n_2 with n0>1n_0>1 and Kn0≥2K_{n_0}\ge2. By induction on rr, Kn03r≥Kn04r≥24rK_{n_0^{3^r}}\ge K_{n_0}^{4^r}\ge2^{4^r}, because n03r≥n2n_0^{3^r}\ge n_2. But Km≤mK_m\le m for every mm, so 24r≤n03r2^{4^r}\le n_0^{3^r}, that is, (4/3)r≤log⁡2n0(4/3)^r\le\log_2n_0 for every rr, which is false. This proves the claim.

The bound (10.1). Let DD be a good denominator with m=m(D)≥1m=m(D)\ge1. Apply the window lemma of the digit-budget page at depth mm with this rational: q=D≥2mβ=λq=D\ge2^m\beta=\lambda, so under incompleteness Rm<3λ/D+Em,k(D)≤3+2k(D)R_m<3\lambda/D+E_{m,k(D)}\le3+2k(D), using the crude bound Em,k≤2kE_{m,k}\le2k (each of the 2k2k fractional parts is less than 11). With (FE-R),

c0eaKm≤Rm+2<2k(D)+5≤2m+2Cβ+5.(10.1)c_0e^{aK_m}\le R_m+2<2k(D)+5\le2m+2C_\beta+5. \tag{10.1}

Step 3: the windows

Fix ε>0\varepsilon>0 and T0T_0. By the claim, choose nn with f(n)>n3f(n)>n^3 and nn as large as needed below. Put D=Dn∗D=D_n^*, m=m(D)m=m(D), T=m−1T=m-1. From k(D)≤m+Cβk(D)\le m+C_\beta and f(n)=n+k(D)>n3f(n)=n+k(D)>n^3 we get m>n3−n−Cβm>n^3-n-C_\beta, and for n≥Cβ+4n\ge C_\beta+4 this gives T≥n2T\ge n^2 (as n3−n2−n≥11n>Cβ+1n^3-n^2-n\ge11n>C_\beta+1 for n≥4n\ge4). Take nn large enough that T≥T0T\ge T_0.

Let p/qp/q be the pre-crossing rational for b=b(n)b=b(n) from Step 1: q<b(n)q<b(n) and ∣θ−p/q∣≤1/(Dq)≤1/D≤1/(2nβ)|\theta-p/q|\le1/(Dq)\le1/D\le1/(2^n\beta). This tends to 00, so for nn large ∣p/q−θ∣<ε|p/q-\theta|<\varepsilon and 1<p/q<21<p/q<2 (as 1<θ<21<\theta<2).

Height. Since p<2qp<2q and q<⌈2nβ⌉≤2n⌈β⌉q<\lceil2^n\beta\rceil\le2^n\lceil\beta\rceil, p+q+1≤3q<3⋅2n⌈β⌉p+q+1\le3q<3\cdot2^n\lceil\beta\rceil, so H≤n+Cβ′H\le n+C'_\beta. For n≥Cβ′n\ge C'_\beta, H≤2nH\le2n and H2≤4n2≤4TH^2\le4n^2\le4T.

Residues. ∣qα−pβ∣=qβ∣θ−p/q∣≤β/D|q\alpha-p\beta|=q\beta|\theta-p/q|\le\beta/D, so for 0≤i≤T=m−10\le i\le T=m-1,

2i∣qα−pβ∣≤2m−1βD≤122^i|q\alpha-p\beta|\le\frac{2^{m-1}\beta}D\le\frac12

because D≥2mβD\ge2^m\beta. Writing ai=2iα−{2iα}a_i=2^i\alpha-\{2^i\alpha\} and bi=2iβ−{2iβ}b_i=2^i\beta-\{2^i\beta\},

δi=2i(qα−pβ)−q{2iα}+p{2iβ},∣δi∣<12+max⁡(p,q)<p+q+1≤2H.\delta_i=2^i(q\alpha-p\beta)-q\{2^i\alpha\}+p\{2^i\beta\},\qquad |\delta_i|<\frac12+\max(p,q)<p+q+1\le2^H .

Events. DD is a good denominator with m(D)=m≥n≥1m(D)=m\ge n\ge1, so (10.1) applies; with KT≤KmK_T\le K_m,

c0eaKT≤2m+2Cβ+5=2T+2Cβ+7,KT≤1alog⁡2T+2Cβ+7c0.c_0e^{aK_T}\le2m+2C_\beta+5=2T+2C_\beta+7,\qquad K_T\le\frac1a\log\frac{2T+2C_\beta+7}{c_0}.

For TT large the right side is at most Llog⁡TL\log T with the fixed constant L=2/aL=2/a, since (2T+2Cβ+7)/c0≤T2(2T+2C_\beta+7)/c_0\le T^2 eventually. Enlarging nn once more secures this. All four displayed properties of (10.2) now hold for this TT and p/qp/q.

Scope. The good crossing rational of denominator DD supplies the event bound; the pre-crossing rational supplies the small height and the all-layer residue bound; no continued-fraction indexing is used. The constants LL, CβC_\beta, Cβ′C'_\beta depend on α,β\alpha,\beta only. The construction needs incompleteness (for (DB) and (10.1)) and irrationality (for the good rationals and the infinitude of events).