Wiki
Wiki

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

Updated

../


Source. S. Fan, Strongly complete sets and a conjecture of Erdős, arXiv:2607.14071v5 (16 September 2026): Remark 4.2, physical and printed p. 20 (Remark 4.1 of v4, p. 19, with the same content); the definitions (1.1), (1.5), (1.8), (1.9), the observation that strongly complete sets satisfy (1.5), Theorem 1.1 and Corollary 1.2, pp. 2--4. Read in the canonical conversion beside the held v5 PDF, which was not itself opened for this page; the artifacts are identified on the library source card, Fan (2026), and the remark on its result page. The remark's rescaling, the finiteness of the intersection of the two rays and the "routine" triangle-inequality step are stated without detail in the source; they are written out below.

Standing. This is an author-recorded reconstruction. It is not an independent review, changes no status and assigns no tier. Theorem 1.1 and Corollary 1.2 are used only as statements: their proofs (Sections 2--4 of the source, about twenty pages) are not reconstructed.

Definitions

Here N={1,2,…}\mathbb N=\{1,2,\ldots\}, as in the source. For A⊆NA\subseteq\mathbb N, FS⁡(A)\operatorname{FS}(A) is the set of sums of nonempty finite subsets of AA; AA is complete if N∖FS⁡(A)\mathbb N\setminus\operatorname{FS}(A) is finite and strongly complete if A∖BA\setminus B is complete for every finite B⊆AB\subseteq A. ∥x∥\|x\| is the distance from the real xx to the nearest integer. Condition (1.5) for AA is

∑a∈A∥aθ∥=∞for every θ∈R∖Z.\sum_{a\in A}\|a\theta\|=\infty \qquad\text{for every }\theta\in\mathbb R\setminus\mathbb Z .

Mρ∗M_\rho^* (1.8) is the least positive integer such that every A⊆NA\subseteq\mathbb N satisfying (1.5) with ∣A∩(ρk,ρk+1]∣≥Mρ∗|A\cap(\rho^k,\rho^{k+1}]|\ge M_\rho^* for every sufficiently large kk is strongly complete. For α,β>0\alpha,\beta>0,

Aα,β={⌊2kα⌋,⌊2kβ⌋:k≥0}∖{0}(1.9);A_{\alpha,\beta}=\{\lfloor2^k\alpha\rfloor,\lfloor2^k\beta\rfloor:k\ge0\} \setminus\{0\}\qquad(1.9);

α∼β\alpha\sim\beta means α/β=2n\alpha/\beta=2^n for some n∈Zn\in\mathbb Z, and α\alpha is a dyadic rational if α∼n\alpha\sim n for some nonzero integer nn. For x>0x>0 and K≥0K\ge0 let UK(x)={⌊2kx⌋:k≥K}U_K(x)=\{\lfloor2^kx\rfloor:k\ge K\}. Hegyvári's conjecture, as the source records it (p. 4): Aα,βA_{\alpha,\beta} is complete whenever α≁β\alpha\not\sim\beta and at least one of α,β\alpha,\beta is not a dyadic rational.

In-source theorems used as statements (not reconstructed). Theorem 1.1 (p. 3): for ρ>1\rho>1, with uρ=⌈ρ(ρ−1)⌉u_\rho=\lceil\rho(\rho-1)\rceil, vρ=⌈ρ3/(ρ+1)⌉v_\rho=\lceil\rho^3/(\rho+1)\rceil and Mρ=min⁡{2uρ+1,2vρ}M_\rho=\min\{2u_\rho+1,2v_\rho\}, every A⊆NA\subseteq\mathbb N satisfying (1.5) and ∣A∩(ρk,ρk+1]∣≥M≥Mρ|A\cap(\rho^k,\rho^{k+1}]|\ge M\ge M_\rho for all large kk has qA∖F(n)/n(M−Mρ)log⁡ρ2→∞q_{A\setminus F}(n)/n^{(M-M_\rho)\log_\rho2}\to\infty for every finite F⊆AF\subseteq A, where qB(n)q_B(n) counts representations of nn as sums of distinct elements of BB; in particular AA is strongly complete. Corollary 1.2 (p. 4), the case ρ=2\rho=2 where u2=2u_2=2, v2=3v_2=3, M2=5M_2=5: every AA satisfying (1.5) with at least five elements in (2k,2k+1](2^k,2^{k+1}] for all large kk is strongly complete, so M2∗≤5M_2^*\le5.

Statement

Observation (p. 3). Every strongly complete A⊆NA\subseteq\mathbb N satisfies (1.5).

Remark 4.2. If M2∗=2M_2^*=2, then Aα,βA_{\alpha,\beta} is strongly complete whenever α≁β\alpha\not\sim\beta and at least one of α,β\alpha,\beta is not a dyadic rational. In particular M2∗=2M_2^*=2 would imply Hegyvári's conjecture, in the stronger form of strong completeness.

Proof

The observation

Suppose ∑a∈A∥aθ∥<∞\sum_{a\in A}\|a\theta\|<\infty for some θ∈R∖Z\theta\in\mathbb R\setminus\mathbb Z, so ∥θ∥>0\|\theta\|>0. Choose N0N_0 with ∑a∈A, a>N0∥aθ∥<∥θ∥/2\sum_{a\in A,\,a>N_0}\|a\theta\|<\|\theta\|/2. Since AA is strongly complete, A∩(N0,∞)A\cap(N_0,\infty) is complete, so every sufficiently large nn and n+1n+1 are sums of distinct elements of A∩(N0,∞)A\cap(N_0,\infty), and by the triangle inequality on R/Z\mathbb R/\mathbb Z each of ∥nθ∥\|n\theta\|, ∥(n+1)θ∥\|(n+1)\theta\| is at most the sum of ∥aθ∥\|a\theta\| over the elements used, hence less than ∥θ∥/2\|\theta\|/2. Then ∥θ∥=∥(n+1)θ−nθ∥≤∥(n+1)θ∥+∥nθ∥<∥θ∥\|\theta\|=\|(n+1)\theta-n\theta\|\le\|(n+1)\theta\|+\|n\theta\|<\|\theta\|, a contradiction.

Step 1: rescaling

Assume, by symmetry, that α\alpha is not a dyadic rational. Let s,ts,t be the integers with α′=2−sα∈(1/2,1]\alpha'=2^{-s}\alpha\in(1/2,1] and β′=2−tβ∈(1/2,1]\beta'=2^{-t}\beta\in(1/2,1]. Then α′≠β′\alpha'\ne\beta' (else α/β=2s−t\alpha/\beta=2^{s-t}), and α′\alpha' is not a dyadic rational, since α′∼α\alpha'\sim\alpha. The set U0(α)={⌊2k+sα′⌋:k≥0}U_0(\alpha)=\{\lfloor2^{k+s}\alpha'\rfloor:k\ge0\} contains Uk0(α′)U_{k_0}(\alpha') for every k0≥max⁡(s,0)k_0\ge\max(s,0), and similarly for β\beta; so for k0≥max⁡(s,t,1)k_0\ge\max(s,t,1),

Uk0(α′)∪Uk0(β′)⊆Aα,βU_{k_0}(\alpha')\cup U_{k_0}(\beta')\subseteq A_{\alpha,\beta}

(the values are positive, as 2k0α′>1/2⋅2k0≥12^{k_0}\alpha'>1/2\cdot2^{k_0}\ge1 for k0≥1k_0\ge1), and the complement B=Aα,β∖(Uk0(α′)∪Uk0(β′))B=A_{\alpha,\beta}\setminus(U_{k_0}(\alpha')\cup U_{k_0}(\beta')) is finite: an element ⌊2kα⌋\lfloor2^k\alpha\rfloor of Aα,βA_{\alpha,\beta} with k+s≥k0k+s\ge k_0 lies in Uk0(α′)U_{k_0}(\alpha'), so BB consists of values with k<k0−sk<k_0-s or k<k0−tk<k_0-t.

Finiteness of U0(α′)∩U0(β′)U_0(\alpha')\cap U_0(\beta'). For k≥1k\ge1, 2kα′∈(2k−1,2k]2^k\alpha'\in(2^{k-1},2^k], so ⌊2kα′⌋∈[2k−1,2k]\lfloor2^k\alpha'\rfloor\in[2^{k-1},2^k], and likewise for β′\beta'. If ⌊2kα′⌋=⌊2jβ′⌋\lfloor2^k\alpha'\rfloor=\lfloor2^j\beta'\rfloor with k,j≥1k,j\ge1, the two ranges [2k−1,2k][2^{k-1},2^k] and [2j−1,2j][2^{j-1},2^j] must meet, so ∣k−j∣≤1|k-j|\le1. The case j=k+1j=k+1 forces the common value to be 2k2^k, so ⌊2k+1β′⌋=2k\lfloor2^{k+1}\beta'\rfloor=2^k, that is β′<1/2+2−k−1\beta'<1/2+2^{-k-1}, which fails for kk large since β′>1/2\beta'>1/2; j=k−1j=k-1 is excluded symmetrically for kk large; and j=kj=k fails for kk large since 2k∣α′−β′∣≥22^k|\alpha'-\beta'|\ge2 then makes the floors differ. So only finitely many coincidences occur, and for k0k_0 large Uk0(α′)∩Uk0(β′)=∅U_{k_0}(\alpha')\cap U_{k_0}(\beta')=\emptyset. From now on k0k_0 is large enough for this and for k0≥max⁡(s,t,1)k_0\ge\max(s,t,1); the union above with BB is then a partition of Aα,βA_{\alpha,\beta}.

Step 2: two elements in every large dyadic interval

For k≥k0k\ge k_0, 2k+1α′∈(2k,2k+1]2^{k+1}\alpha'\in(2^k,2^{k+1}], so ⌊2k+1α′⌋∈[2k,2k+1]\lfloor2^{k+1}\alpha'\rfloor\in[2^k,2^{k+1}], and it equals 2k2^k only if α′<1/2+2−k−1\alpha'<1/2+2^{-k-1}, which fails for kk large. Hence for k0k_0 large and k≥k0k\ge k_0 both ⌊2k+1α′⌋\lfloor2^{k+1}\alpha'\rfloor and ⌊2k+1β′⌋\lfloor2^{k+1}\beta'\rfloor lie in (2k,2k+1](2^k,2^{k+1}]; they are distinct by Step 1 and belong to Aα,βA_{\alpha,\beta}. Thus

∣Aα,β∩(2k,2k+1]∣≥2(k≥k0).|A_{\alpha,\beta}\cap(2^k,2^{k+1}]|\ge2\qquad(k\ge k_0).

Step 3: condition (1.5)

Write ck=⌊2kα′⌋c_k=\lfloor2^k\alpha'\rfloor and dk=ck+1−2ck∈{0,1}d_k=c_{k+1}-2c_k\in\{0,1\} (as ⌊2x⌋−2⌊x⌋∈{0,1}\lfloor2x\rfloor-2\lfloor x\rfloor\in\{0,1\}). If dk=0d_k=0 for all k≥k1k\ge k_1, then ck=2k−k1ck1c_k=2^{k-k_1}c_{k_1} for k≥k1k\ge k_1, and 2−kck→α′2^{-k}c_k\to\alpha' gives α′=ck1/2k1\alpha'=c_{k_1}/2^{k_1}, so α=2s−k1ck1\alpha=2^{s-k_1}c_{k_1} with ck1c_{k_1} a nonzero integer, contradicting that α\alpha is not a dyadic rational. Hence ck+1=2ck+1c_{k+1}=2c_k+1 for infinitely many kk.

Let θ∈R∖Z\theta\in\mathbb R\setminus\mathbb Z with ∑a∈Aα,β∥aθ∥<∞\sum_{a\in A_{\alpha,\beta}}\|a\theta\|<\infty. The elements ckc_k, k≥k0k\ge k_0, belong to Aα,βA_{\alpha,\beta} and are pairwise distinct, so ∥ckθ∥→0\|c_k\theta\|\to0. For the infinitely many kk with ck+1=2ck+1c_{k+1}=2c_k+1,

∥θ∥=∥ck+1θ−2ckθ∥≤∥ck+1θ∥+2∥ckθ∥→0,\|\theta\|=\|c_{k+1}\theta-2c_k\theta\|\le\|c_{k+1}\theta\|+2\|c_k\theta\|\to0,

so ∥θ∥=0\|\theta\|=0, contradicting θ∉Z\theta\notin\mathbb Z. Hence Aα,βA_{\alpha,\beta} satisfies (1.5).

Step 4: conclusion

By Steps 2 and 3, Aα,βA_{\alpha,\beta} satisfies (1.5) and has at least two elements in every (2k,2k+1](2^k,2^{k+1}] with k≥k0k\ge k_0. If M2∗=2M_2^*=2, the definition of M2∗M_2^* makes Aα,βA_{\alpha,\beta} strongly complete. This is the remark.

Scope. The hypothesis M2∗=2M_2^*=2 is unproved: the source proves M2∗≤5M_2^*\le5 (Corollary 1.2) and M2∗≥2M_2^*\ge2 (Remark 4.1, reconstructed on the next page). Conversely, strong completeness of every Aα,βA_{\alpha,\beta} under Hegyvári's condition would not by itself give M2∗=2M_2^*=2, since these sets are special. Nothing here concerns bases other than 22, and the argument is silent on the rational-ratio cases beyond showing that they would follow from the sharp threshold.