../
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,…}, as in the source. For
A⊆N, FS(A) is the set of sums of
nonempty finite subsets of A; A is complete if
N∖FS(A) is finite and strongly
complete if A∖B is complete for every finite B⊆A.
∥x∥ is the distance from the real x to the nearest integer.
Condition (1.5) for A is
a∈A∑∥aθ∥=∞for every θ∈R∖Z.
Mρ∗ (1.8) is the least positive integer such that every
A⊆N satisfying (1.5) with
∣A∩(ρk,ρk+1]∣≥Mρ∗ for every sufficiently large k
is strongly complete. For α,β>0,
Aα,β={⌊2kα⌋,⌊2kβ⌋:k≥0}∖{0}(1.9);
α∼β means α/β=2n for some n∈Z, and
α is a dyadic rational if α∼n for some nonzero
integer n. For x>0 and K≥0 let
UK(x)={⌊2kx⌋:k≥K}. Hegyvári's conjecture, as the
source records it (p. 4): Aα,β is complete whenever
α∼β and at least one of α,β is not a dyadic
rational.
In-source theorems used as statements (not reconstructed).
Theorem 1.1 (p. 3): for ρ>1, with
uρ=⌈ρ(ρ−1)⌉, vρ=⌈ρ3/(ρ+1)⌉
and Mρ=min{2uρ+1,2vρ}, every A⊆N
satisfying (1.5) and ∣A∩(ρk,ρk+1]∣≥M≥Mρ for all
large k has qA∖F(n)/n(M−Mρ)logρ2→∞ for
every finite F⊆A, where qB(n) counts representations of n
as sums of distinct elements of B; in particular A is strongly
complete. Corollary 1.2 (p. 4), the case ρ=2 where u2=2, v2=3,
M2=5: every A satisfying (1.5) with at least five elements in
(2k,2k+1] for all large k is strongly complete, so M2∗≤5.
Statement
Observation (p. 3). Every strongly complete A⊆N
satisfies (1.5).
Remark 4.2. If M2∗=2, then Aα,β is strongly complete
whenever α∼β and at least one of α,β is not
a dyadic rational. In particular M2∗=2 would imply Hegyvári's
conjecture, in the stronger form of strong completeness.
Proof
The observation
Suppose ∑a∈A∥aθ∥<∞ for some
θ∈R∖Z, so ∥θ∥>0. Choose N0
with ∑a∈A,a>N0∥aθ∥<∥θ∥/2. Since A is
strongly complete, A∩(N0,∞) is complete, so every sufficiently
large n and n+1 are sums of distinct elements of A∩(N0,∞),
and by the triangle inequality on R/Z each of
∥nθ∥, ∥(n+1)θ∥ is at most the sum of ∥aθ∥ over
the elements used, hence less than ∥θ∥/2. Then
∥θ∥=∥(n+1)θ−nθ∥≤∥(n+1)θ∥+∥nθ∥<∥θ∥,
a contradiction.
Step 1: rescaling
Assume, by symmetry, that α is not a dyadic rational. Let s,t be
the integers with α′=2−sα∈(1/2,1] and
β′=2−tβ∈(1/2,1]. Then α′=β′ (else
α/β=2s−t), and α′ is not a dyadic rational, since
α′∼α. The set
U0(α)={⌊2k+sα′⌋:k≥0} contains Uk0(α′)
for every k0≥max(s,0), and similarly for β; so for
k0≥max(s,t,1),
Uk0(α′)∪Uk0(β′)⊆Aα,β
(the values are positive, as 2k0α′>1/2⋅2k0≥1 for
k0≥1), and the complement
B=Aα,β∖(Uk0(α′)∪Uk0(β′)) is
finite: an element ⌊2kα⌋ of Aα,β with
k+s≥k0 lies in Uk0(α′), so B consists of values with
k<k0−s or k<k0−t.
Finiteness of U0(α′)∩U0(β′). For k≥1,
2kα′∈(2k−1,2k], so ⌊2kα′⌋∈[2k−1,2k],
and likewise for β′. If ⌊2kα′⌋=⌊2jβ′⌋
with k,j≥1, the two ranges [2k−1,2k] and [2j−1,2j] must
meet, so ∣k−j∣≤1. The case j=k+1 forces the common value to be
2k, so ⌊2k+1β′⌋=2k, that is
β′<1/2+2−k−1, which fails for k large since β′>1/2;
j=k−1 is excluded symmetrically for k large; and j=k fails for k
large since 2k∣α′−β′∣≥2 then makes the floors differ. So
only finitely many coincidences occur, and for k0 large
Uk0(α′)∩Uk0(β′)=∅. From now on k0 is
large enough for this and for k0≥max(s,t,1); the union above with
B is then a partition of Aα,β.
Step 2: two elements in every large dyadic interval
For k≥k0, 2k+1α′∈(2k,2k+1], so
⌊2k+1α′⌋∈[2k,2k+1], and it equals 2k only
if α′<1/2+2−k−1, which fails for k large. Hence for k0
large and k≥k0 both ⌊2k+1α′⌋ and
⌊2k+1β′⌋ lie in (2k,2k+1]; they are distinct by
Step 1 and belong to Aα,β. Thus
∣Aα,β∩(2k,2k+1]∣≥2(k≥k0).
Step 3: condition (1.5)
Write ck=⌊2kα′⌋ and dk=ck+1−2ck∈{0,1} (as
⌊2x⌋−2⌊x⌋∈{0,1}). If dk=0 for all
k≥k1, then ck=2k−k1ck1 for k≥k1, and
2−kck→α′ gives α′=ck1/2k1, so
α=2s−k1ck1 with ck1 a nonzero integer, contradicting
that α is not a dyadic rational. Hence ck+1=2ck+1 for
infinitely many k.
Let θ∈R∖Z with
∑a∈Aα,β∥aθ∥<∞. The elements ck,
k≥k0, belong to Aα,β and are pairwise distinct, so
∥ckθ∥→0. For the infinitely many k with ck+1=2ck+1,
∥θ∥=∥ck+1θ−2ckθ∥≤∥ck+1θ∥+2∥ckθ∥→0,
so ∥θ∥=0, contradicting θ∈/Z. Hence
Aα,β satisfies (1.5).
Step 4: conclusion
By Steps 2 and 3, Aα,β satisfies (1.5) and has at least two
elements in every (2k,2k+1] with k≥k0. If M2∗=2, the
definition of M2∗ makes Aα,β strongly complete. This is
the remark.
Scope. The hypothesis M2∗=2 is unproved: the source proves
M2∗≤5 (Corollary 1.2) and M2∗≥2 (Remark 4.1, reconstructed on
the next page).
Conversely, strong completeness of every Aα,β under
Hegyvári's condition would not by itself give M2∗=2, since these sets
are special. Nothing here concerns bases other than 2, and the
argument is silent on the rational-ratio cases beyond showing that they
would follow from the sharp threshold.