Wiki
Wiki

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

Updated


Statement

Notation (p. 2). N\mathbb N is the set of positive integers; for sequences, xn=O(yn)x_n=O(y_n) means ∣xn∣≤C∣yn∣|x_n|\le C|y_n| for every n∈Nn\in\mathbb N with some constant C∈(0,∞)C\in(0,\infty), and a vector is O(yn)O(y_n) when each coordinate is. Vectors of R3\mathbb R^3 are written as columns, and $\mathbb e_1,\mathbb e_2,\mathbb e_3$ is the standard basis (p. 8).

Lemma 2 (p. 8). There exist a matrix M∈GL(3,R)M\in\mathrm{GL}(3,\mathbb R), mutually disjoint finite sets S1,S2,S3,T1,T2,T3⊂NS_1,S_2,S_3,T_1,T_2,T_3\subset\mathbb N, and constants c1,c2,c3∈(0,∞)c_1,c_2,c_3\in(0,\infty) such that, for 1≤j≤31\le j\le3,

(∑a∈Sj−∑a∈Tj)M(1/(an)1/(an+1)1/(an+2))=cjnj ej+O(1n4).(3.1)\Bigl(\sum_{a\in S_j}-\sum_{a\in T_j}\Bigr)M \begin{pmatrix}1/(an)\\1/(an+1)\\1/(an+2)\end{pmatrix} =\frac{c_j}{n^j}\,\mathbb e_j+O\Bigl(\frac1{n^4}\Bigr). \qquad(3.1)

Explicit data (proof, p. 9). The proof takes

M=(1003−411−21),det⁡M=−2,(3.2)M=\begin{pmatrix}1&0&0\\3&-4&1\\1&-2&1\end{pmatrix},\qquad\det M=-2, \qquad(3.2)

S1={45,72,144,160,432,480}S_1=\{45,72,144,160,432,480\}, T1={48,60,120,720,1440,4320}T_1=\{48,60,120,720,1440,4320\}, S2=11⋅{16,20,240}S_2=11\cdot\{16,20,240\}, T2=11⋅{15,24,120}T_2=11\cdot\{15,24,120\}, S3=7⋅{10,30,60}S_3=7\cdot\{10,30,60\}, T3=7⋅{12,15}T_3=7\cdot\{12,15\}, and obtains c1=1/180c_1=1/180, c2=1/348480c_2=1/348480, c3=1/1029000c_3=1/1029000. The factors 77 and 1111 only make the six sets mutually disjoint. The paper remarks (p. 9) that its use of the lemma in the proof of Theorem 1 does not need the sets to be finite, only to have finitely many prime factors in all.

Check of the data (an observation of this page, not of the paper). With exact rational arithmetic, ∑Sja−i−∑Tja−i\sum_{S_j}a^{-i}-\sum_{T_j}a^{-i} for i=1,2,3i=1,2,3 vanishes for i≠ji\ne j and equals 1/1801/180, 1/6969601/696960, 1/20580001/2058000 for i=j=1,2,3i=j=1,2,3; with the rows of MM, which send (1/(an),1/(an+1),1/(an+2))(1/(an),1/(an+1),1/(an+2)) to (1/(an), 2/(an)2, 2/(an)3)+O(1/n4)(1/(an),\,2/(an)^2,\,2/(an)^3)+O(1/n^4), these give the printed c1c_1, c2=2/696960c_2=2/696960 and c3=2/2058000c_3=2/2058000. The 23 listed elements are distinct.

Source. V. Kovač, On the set of points represented by harmonic subseries, arXiv:2405.07681v3 (12 September 2024); Amer. Math. Monthly 132 (2025), 895--911: Lemma 2 in Section 3 on p. 8, its proof on p. 9 (arXiv v3 pagination). The edition read is identified on the source card.

Read depth. Claims checked: the statement and the explicit data were read clause by clause on the printed pages, and the power-sum identities behind c1,c2,c3c_1,c_2,c_3 were recomputed as stated above. Nothing here is independently reviewed.

Proof pointer

Page 9. Expanding 1/(an+k−1)1/(an+k-1) in powers of 1/(an)1/(an) up to an O(1/n4)O(1/n^4) error, the matrix MM makes the second coordinate start at 2/(an)22/(an)^2 and the third at 2/(an)32/(an)^3. The lemma then reduces to finding disjoint sets whose reciprocal power sums agree in the two powers other than jj and differ in power jj; the paper supplies six elementary identities among unit fractions and their squares and cubes, verified by computer.

Dependencies

None beyond elementary expansions and the stated identities.

Bears on

  • Problem 268: only as the arithmetic step in the proof of Theorem 1, whose page states the relation; the lemma alone says nothing about the set in the problem.