Wiki
Wiki

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

Updated


Subject and independence

Role. Independent reviewer in a fresh context, commissioned for refutation and given only the assignment. The reviewer took no part in writing the page under review or any page in its folder, had no contact with the page's author, and consulted nothing beyond the allowed reading listed here except the two exposures disclosed below.

Subject. wiki/research/erdos_1221/ko26b_lemma_2_1_reconstruction.md as it stood on 2026-09-28T05:03:27Z (the reconstruction page), read in full.

Artifact. The retained PDF of arXiv:2609.07196v2 under the card Korsky 2026, resolution (16 pages; physical page and printed page coincide). Physical pages 4 and 5 (Section 2 and Lemma 2.1 with its proof) were read in full at the text layer and on page images rendered at 150 dots per inch, every displayed formula being checked on the images. Pages 1--3 were read at the text layer for the definitions of gaps and rr-spans and for the statement of Theorem 1.1; page 6 (the preamble of Section 3 and Proposition 3.1) and pages 10--11 (Section 6 through Lemma 6.2) were read at the text layer and on page images rendered at 110 dots per inch, for the page's two "Role in the argument" sentences; page 15 (Section 8 and the acknowledgments) was read at the text layer for the Standing sentence. The canonical conversion beside the PDF was read for Section 2 and agrees with the page images at every display used.

Other allowed material read. The library card _index.md; the statement portion of Problem 1221 (everything before its "Current assessment" heading); the "Whole-claim report" and "Audit checklist" sections of docs/verification.md, together with the shared "Audit checklist" list they extend; the "Source fidelity" section of docs/evidence.md; and docs/math_authoring.md in full. The two reconstruction pages linked from "Role in the argument" (Proposition 3.1 and Lemma 6.2) were not read: the page cites them as consumers, not as inputs, and the two role sentences were checked against the source's pages 6 and 11 instead. The folder _index.md, every evidence/ folder, every assessment, known-results, status, standing or acceptance text, and every other review were not read.

Exposures. Two, neither of which bears on the mathematics. The library card was read in full, so its "Read status" paragraph and its "Relation to Problem 1221" section, which carry standing and acceptance text, reached the reviewer along with the provenance paragraph. The problem page has no separate Statement heading; its statement portion holds a "Status" paragraph, which was read with it.

Restatement

Fix an integer r≥1r\ge1 and a sequence x1,x2,…x_1,x_2,\ldots of pairwise distinct points of T=R/Z\mathbb T=\mathbb R/\mathbb Z. For real t≥1t\ge1, PtP_t is the set of the first ⌊t⌋\lfloor t\rfloor points and Nt(I)N_t(I) the number of them in an arc II. Arcs are half-open, (x,x+ℓ](x,x+\ell] with 0<ℓ<10<\ell<1, taken in the positive direction of the lift; "clockwise", "after" in cyclic order and "increasing lift" name the same direction throughout. An rr-span of PtP_t is the distance in that direction from a point of PtP_t to the point rr places after it in the cyclic order of PtP_t, that is, a sum of rr consecutive gaps.

Standing hypothesis (2.1). A number A≥1A\ge1 is fixed, and there is a threshold t0t_0 such that for every real t≥t0t\ge t_0 there are at,bt≥0a_t,b_t\ge0 with at+bt≤Aa_t+b_t\le A and

r−att≤S≤r+bttfor every r-span S of Pt.\frac{r-a_t}{t}\le S\le\frac{r+b_t}{t} \qquad\text{for every $r$-span $S$ of $P_t$.}

For D>0D>0 put Ut(D)=D−1sup⁡xNt((x,x+D/t])U_t(D)=D^{-1}\sup_xN_t((x,x+D/t]) and Vt(D)=D−1inf⁡xNt((x,x+D/t])V_t(D)=D^{-1}\inf_xN_t((x,x+D/t]), the supremum and infimum over x∈Tx\in\mathbb T.

Claim. For every D>0D>0, every E>0E>0 and every integer k≥1k\ge1 with q=E/(kr)<1q=E/(kr)<1 there is a threshold TT, depending on DD, EE, kk, rr, AA, t0t_0 and the sequence, such that for every real t≥Tt\ge T

Ut(D)≤(1+3kAD)(1+q) U(1+q)t(E),Vt(D)≥(1−q−kAD(3−q))+V(1−q)t(E).U_t(D)\le\Bigl(1+\frac{3kA}{D}\Bigr)(1+q)\,U_{(1+q)t}(E), \qquad V_t(D)\ge\Bigl(1-q-\frac{kA}{D}(3-q)\Bigr)_+V_{(1-q)t}(E).

Moreover, with EE, kk, rr, AA, t0t_0 and the sequence fixed, one threshold TT serves every DD in any bounded set of positive numbers.

Scope. The claim is conditional on (2.1) and asserts nothing about which sequences satisfy it; nothing is claimed for q≥1q\ge1; the point sets at real times are those at integer times, Pt=P⌊t⌋P_t=P_{\lfloor t\rfloor}, while the normalization in (2.1) and in UtU_t, VtV_t uses the real tt; the constants are explicit and carry their dependence on kk, AA, DD and qq in the displayed form.

Checklist

  • Quantifiers and scope. Passes. Both halves are threshold statements ("for all sufficiently large tt") with the source's dependence; the uniformity is claimed only for DD in a bounded range and for fixed EE, kk; the case of an empty JJ in the lower bound is covered by the positive part; q<1q<1 is kept and nothing is claimed beyond it.
  • Circularity. Passes; nothing resembling (2.2) or (2.3) is assumed. The proof uses (2.1), the injectivity of compositions of bijections with inclusions of nested sets, and an exact exchange of integrals.
  • Model and convention changes. Passes. Real times with Pt=P⌊t⌋P_t=P_{\lfloor t\rfloor} are the source's own convention (p. 4); lifts to R\mathbb R serve only to measure displacements and translate endpoints, and every arc used is shorter than 11, so membership of a lifted point in a lifted arc is membership on the circle; the orientation is the same in the arcs, the spans and the moves.
  • Finite and statistical overreach. Inapplicable. The "averaging" is an exact identity of integrals, re-derived below, not a heuristic; no finite case stands in for a proof.
  • Uniformity. Passes. The threshold must place t−=(1−q)tt_-=(1-q)t beyond t0t_0 (then (2.1) holds at every time used, since all lie in [t−,t+][t_-,t_+]), make kr<⌊t−⌋kr<\lfloor t_-\rfloor, and make every arc shorter than 11: ∣J∣≤(D+3kA)/t|J|\le(D+3kA)/t in the upper bound, ∣J∣≤D/t|J|\le D/t in the lower bound, and ℓ=E/t±<1\ell=E/t_\pm<1. Each requirement is independent of DD or monotone in DD, so a bounded range of DD needs one threshold. The constants display their dependence on kk, AA, DD and qq.
  • Extremal conclusions. Passes. NtN_t takes finitely many values, so the supremum and infimum defining UtU_t and VtV_t are attained; the page claims no sharpness or attained extremum; the positive part keeps the lower coefficient in the claim's own units.
  • Consequences and composition. Passes. "The supremum over xx gives (2.2)" and "the infimum over xx gives (2.3)" follow because the per-interval bounds hold for every xx with an xx-free coefficient. The two role sentences match the source: Section 3 (p. 6) iterates the lemma along doubling scales between Ar\sqrt{Ar} and r∓Ar\mp A and applies it once more, and Section 6 (p. 11) calls Lemma 6.2 "the averaged counterpart of Lemma 2.1". (2.1) is consumed at tt and at every s∈[t−,t+]s\in[t_-,t_+], which the hypothesis supplies. The Statement section does not itself name (2.1) as a hypothesis; see F1.
  • Computation. Inapplicable. The page and this review use hand algebra only, retained under "Weakest steps".
  • Reproduction. Inapplicable. No rerun commands or coverage claims are made.
  • Source and verdict fidelity. Passes. The statement, the displacement ranges, both intervals JJ, the averaging displays, the coefficient algebra and the uniformity remark were compared with the page images of pp. 4--5 and agree; Lemma 2.1 is stated on p. 4 and proved on pp. 4--5, as the locators say; the version is arXiv v2. The Standing sentence claims author-recorded standing only; "AI-assisted" is supported by the acknowledgments (p. 15), and "registered as a proof claim" by the card's provenance paragraph.

Weakest steps

W1. The displacement of the composed maps. Fix p∈Ptp\in P_t with lift p~\tilde p. The forward move FtF_t carries pp to the point krkr places after it in PtP_t, whose lift is p~+d1\tilde p+d_1 with d1d_1 the sum of the krkr gaps of PtP_t after pp. Those gaps form the rr-spans of PtP_t starting at pp, at its rrth successor, and so on to its (k−1)r(k-1)rth successor, so (2.1) at time tt gives d1∈[k(r−at)/t, k(r+bt)/t]d_1\in[k(r-a_t)/t,\,k(r+b_t)/t]. The backward move BsB_s at a time s≥ts\ge t carries Ft(p)∈Pt⊆PsF_t(p)\in P_t\subseteq P_s to the point krkr places before it in PsP_s, whose lift is p~+d1−d2\tilde p+d_1-d_2 with d2d_2 the sum of the krkr gaps of PsP_s before Ft(p)F_t(p); these are the krkr gaps of PsP_s after Bs(Ft(p))B_s(F_t(p)), so d2d_2 is the forward displacement of FsF_s at that point, and (2.1) at time ss gives d2∈[k(r−as)/s, k(r+bs)/s]d_2\in[k(r-a_s)/s,\,k(r+b_s)/s]. With kr/t−kr/s=ukr/t-kr/s=u,

d1−d2−u=(d1−krt)−(d2−krs)∈[−katt−kbss, kbtt+kass]⊆kt [−at−A, bt+A],d_1-d_2-u=\Bigl(d_1-\frac{kr}{t}\Bigr)-\Bigl(d_2-\frac{kr}{s}\Bigr) \in\Bigl[-\frac{ka_t}{t}-\frac{kb_s}{s},\ \frac{kb_t}{t}+\frac{ka_s}{s}\Bigr] \subseteq\frac kt\,[-a_t-A,\ b_t+A],

the inclusion because s≥ts\ge t and as,bs≤Aa_s,b_s\le A. In the lower bound the order is reversed, BsB_s first at p∈Pt−⊆Psp\in P_{t_-}\subseteq P_s and then FtF_t at Bs(p)∈Ps⊆PtB_s(p)\in P_s\subseteq P_t, with t−≤s≤tt_-\le s\le t; the lift is p~−d2+d1\tilde p-d_2+d_1 with the same two ranges, and with kr/s−kr/t=ukr/s-kr/t=u the quantity d1−d2+ud_1-d_2+u lies in the same bracket, now contained in [−kat/t−kA/t−, kbt/t+kA/t−][-ka_t/t-kA/t_-,\ kb_t/t+kA/t_-] because s≥t−s\ge t_-. Each range holds at every point of the set moved, so the order of composition does not matter for the bound. This step feeds W2 directly.

W2. The interval inclusions. Upper bound: I=(x,x+D/t]I=(x,x+D/t], α=k(at+A)/t\alpha=k(a_t+A)/t, β=k(bt+A)/t\beta=k(b_t+A)/t, J=(x−α, x+D/t+β]J=(x-\alpha,\,x+D/t+\beta]. For p∈Pt∩Ip\in P_t\cap I, W1 gives Tu(p)−u=p~+ηT_u(p)-u=\tilde p+\eta with η∈[−α,β]\eta\in[-\alpha,\beta]; then p~+η≥p~−α>x−α\tilde p+\eta\ge\tilde p-\alpha>x-\alpha, strictly because p~>x\tilde p>x, and p~+η≤x+D/t+β\tilde p+\eta\le x+D/t+\beta. So the lift lies in JJ and, as ∣J∣<1|J|<1, the point lies in the arc J+uJ+u. The map TuT_u is injective (a bijection of PtP_t, an inclusion, a bijection of PsP_s, an inclusion), so Nt(I)≤Nt+(J+u)N_t(I)\le N_{t_+}(J+u). Lower bound: α′=kat/t+kA/t−\alpha'=ka_t/t+kA/t_-, β′=kbt/t+kA/t−\beta'=kb_t/t+kA/t_-, J=(x+α′, x+D/t−β′]J=(x+\alpha',\,x+D/t-\beta'], empty if α′+β′≥D/t\alpha'+\beta'\ge D/t. For p∈Pt−∩(J+u)p\in P_{t_-}\cap(J+u), p~−u∈J\tilde p-u\in J and Tu′(p)=p~−u+ηT'_u(p)=\tilde p-u+\eta with η∈[−α′,β′]\eta\in[-\alpha',\beta'], so Tu′(p)>x+α′−α′=xT'_u(p)>x+\alpha'-\alpha'=x and Tu′(p)≤x+D/t−β′+β′=x+D/tT'_u(p)\le x+D/t-\beta'+\beta'=x+D/t: the point lies in II. Injectivity of Tu′T'_u gives Nt−(J+u)≤Nt(I)N_{t_-}(J+u)\le N_t(I), trivially when JJ is empty. The open left end and closed right end of II are exactly matched by those of JJ in both halves, so no boundary point escapes. This step feeds W3.

W3. The averaging and the division. For an arc JJ shorter than 11, a length 0<ℓ<10<\ell<1 and any finite point set PP,

∫0ℓN(J+u) du=∑p∈P∣{u∈[0,ℓ]:p∈J+u}∣=∑p∈P∣{v∈J:p∈(v,v+ℓ]}∣=∫JN((v,v+ℓ]) dv,\int_0^\ell N(J+u)\,du=\sum_{p\in P}\bigl|\{u\in[0,\ell]:p\in J+u\}\bigr| =\sum_{p\in P}\bigl|\{v\in J:p\in(v,v+\ell]\}\bigr| =\int_JN((v,v+\ell])\,dv,

because for each pp and each lift p~\tilde p the substitution v=p~−uv=\tilde p-u carries {u∈[0,ℓ]:p~−u∈J}\{u\in[0,\ell]:\tilde p-u\in J\} onto J∩[p~−ℓ,p~]J\cap[\tilde p-\ell,\tilde p], which differs from J∩[p~−ℓ,p~)J\cap[\tilde p-\ell,\tilde p), the set of v∈Jv\in J with p~∈(v,v+ℓ]\tilde p\in(v,v+\ell], by one point; the contributions of the different lifts of pp are disjoint on each side because ∣J∣<1|J|<1 and ℓ<1\ell<1, and they match lift by lift, so the identity is exact whatever ∣J∣+ℓ|J|+\ell is. Integrating the constant Nt(I)N_t(I) over [0,ℓ][0,\ell] and using Nt+((v,v+ℓ])≤E Ut+(E)N_{t_+}((v,v+\ell])\le E\,U_{t_+}(E) for ℓ=E/t+\ell=E/t_+ gives Nt(I) ℓ≤∣J∣ E Ut+(E)N_t(I)\,\ell\le|J|\,E\,U_{t_+}(E); dividing by Dℓ=DE/t+D\ell=DE/t_+ yields the coefficient ∣J∣t+/D≤(D+3kA)(1+q)/D|J|t_+/D\le(D+3kA)(1+q)/D, which is (2.2) after the supremum over xx. In the lower bound, Nt−((v,v+ℓ])≥E Vt−(E)N_{t_-}((v,v+\ell])\ge E\,V_{t_-}(E) for ℓ=E/t−\ell=E/t_- gives Nt(I) ℓ≥∣J∣ E Vt−(E)N_t(I)\,\ell\ge|J|\,E\,V_{t_-}(E), and dividing by DE/t−DE/t_- leaves the coefficient ∣J∣t−/D|J|t_-/D, which with ∣J∣≥(D/t−kA/t−2kA/t−)+|J|\ge(D/t-kA/t-2kA/t_-)_+ and t−/t=1−qt_-/t=1-q is at least

(t−t−kAD⋅t−t−2kAD)+=(1−q−kAD(1−q+2))+=(1−q−kAD(3−q))+,\Bigl(\frac{t_-}{t}-\frac{kA}{D}\cdot\frac{t_-}{t}-\frac{2kA}{D}\Bigr)_+ =\Bigl(1-q-\frac{kA}{D}(1-q+2)\Bigr)_+ =\Bigl(1-q-\frac{kA}{D}(3-q)\Bigr)_+ ,

which is (2.3) after the infimum over xx. The parametrizations s(u)=t/(1−ut/(kr))s(u)=t/(1-ut/(kr)) and s(u)=t/(1+ut/(kr))s(u)=t/(1+ut/(kr)) were also recomputed: at u=ℓu=\ell the quantity ut/(kr)ut/(kr) equals q/(1+q)q/(1+q) and q/(1−q)q/(1-q) respectively, giving s=t+s=t_+ and s=t−s=t_-, and ss is monotone in uu, so ss stays in [t,t+][t,t_+] and in [t−,t][t_-,t].

Strongest attack

The attack aimed at the count inequality Nt(I)≤Nt+(J+u)N_t(I)\le N_{t_+}(J+u), since the backward move BsB_s acts in the cyclic order of PsP_s, which contains points inserted after time tt, and might move Ft(p)F_t(p) back past the left end of J+uJ+u. The sharpest case takes d1d_1 at its minimum k(r−at)/tk(r-a_t)/t and d2d_2 at its maximum k(r+bs)/sk(r+b_s)/s; then d1−d2=u−kat/t−kbs/s≥u−k(at+A)/td_1-d_2=u-ka_t/t-kb_s/s\ge u-k(a_t+A)/t, so Tu(p)−uT_u(p)-u is at least p~−k(at+A)/t\tilde p-k(a_t+A)/t, and the strict inequality p~>x\tilde p>x keeps it strictly inside the open left end of JJ. The symmetric case on the right lands exactly on the closed right end. The attack fails because JJ extends II by precisely the two one-sided worst cases with matching end conventions. Three further attempts were made. Placing the threshold of (2.1) between tt and some s(u)s(u) is excluded by the quantifier: the lemma's threshold puts t−t_-, hence every time used, beyond t0t_0. Breaking the averaging identity by an arc J+uJ+u whose translates cover the circle more than once is impossible because the identity holds lift by lift, and for large tt the lengths ∣J∣+ℓ|J|+\ell are far below 11 in any case. Letting DD tend to 00 inside a bounded range does not spoil the uniformity: the threshold requirements need only an upper bound on DD, the upper coefficient grows but the inequality stays true, and the lower coefficient is 00 for D≤kA(3−q)/(1−q)D\le kA(3-q)/(1-q), where (2.3) is trivial. No defect was found.

Premises

  • Hypothesis (2.1). Interface: fixed A≥1A\ge1; for every sufficiently large real tt, numbers at,bt≥0a_t,b_t\ge0 with at+bt≤Aa_t+b_t\le A bounding every rr-span of PtP_t between (r−at)/t(r-a_t)/t and (r+bt)/t(r+b_t)/t. Source held (the PDF), read on the page image of p. 4; it is the section's standing assumption, which the source says it derives from the ratio hypothesis in Section 5 (p. 4), not read here. The page names it as a hypothesis and proves nothing about it; the reconstruction is conditional on it.
  • Definitions of gaps, rr-spans, PtP_t, NtN_t, UtU_t, VtV_t. Source held, pp. 1 and 4 at the text layer and on the p. 4 image; the clockwise-distance form of a span is the source's own in Section 6 (p. 10). Interfaces as restated above.
  • Distinctness of the points. Source held, p. 1 (abstract and Section 1); used so that the cyclic order and the gaps are defined.
  • Exchange of the order of integration for a nonnegative step function of (u,v)(u,v) on [0,ℓ]×J[0,\ell]\times J: standard and not imported from a held source; the page, like the source, does not name it.
  • Local claims consumed. None. The page cites no L-claim and uses no other reconstruction page; the two linked pages are consumers.
  • Explicit assumptions stated on the page. (2.1) at every time used; kr<∣Ps∣kr<|P_s| at every time used; every arc used shorter than 11.

Findings

F1. Severity: suggested. Location: "## Statement (Lemma 2.1, p. 4)", "Fix D,E>0D,E>0 and an integer k≥1k\ge1". Defect: the Statement section, which a reader takes as the statement of record, does not say that the lemma holds under Hypothesis (2.1) with its fixed A≥1A\ge1, for the fixed rr and the distinct points of the Definitions section; the hypothesis is stated only in the Definitions section and in the frontmatter desc. Witness: the source states (2.1) as the assumption of "this section and the next" in the preamble of Section 2 (p. 4), and Lemma 2.1 (p. 4) is stated under it, so the lemma is conditional; the page's Statement section carries no conditional clause. Proposed replacement text: "Under Hypothesis (2.1), with its fixed A≥1A\ge1, for the fixed rr and the distinct points above: fix D,E>0D,E>0 and an integer k≥1k\ge1, and put q=E/(kr)q=E/(kr). If q<1q<1, then for all sufficiently large tt, ...".

F2. Severity: note. Location: "Cyclic moves. For a time ss with kr<∣Ps∣kr<|P_s|". Defect: the condition kr<∣Ps∣kr<|P_s| is supplied by the page and not marked as supplied. Witness: the source's proof begins "For each time ss, let FsF_s and BsB_s be the forward and backward cyclic moves by krkr places in PsP_s" (p. 4) with no such condition; the condition appears in the source only in Section 6 ("tt is sufficiently large that kr<∣Pt∣kr<|P_t|", p. 10). It is harmless, since it holds at every time s≥kr+1s\ge kr+1 and the lemma's threshold absorbs it. Proposed replacement text: "For a time ss with kr<∣Ps∣kr<|P_s| (a condition supplied here; the source states none in Section 2 and imposes it in Section 6, p. 10), let FsF_s be ...".

F3. Severity: note. Location: "## Uniformity", "make the intervals JJ, J+uJ+u shorter than 11". Defect: the list of what the threshold must do omits the arcs (v,v+ℓ](v,v+\ell] of length ℓ=E/t+\ell=E/t_+ or E/t−E/t_-, and the arc II itself, which must also be shorter than 11 for Ut±(E)U_{t_\pm}(E), Vt−(E)V_{t_-}(E) and Ut(D)U_t(D) to be the section's quantities. Witness: the source's convention "All times are taken large enough that the intervals used below have length less than one" (p. 4) covers every interval used, and the page's own Definitions paragraph repeats it. The omission does not affect the uniformity claim, since ℓ<1\ell<1 needs only t−>Et_->E, which is independent of DD. Proposed replacement text: "make the intervals II, JJ, J+uJ+u and (v,v+ℓ](v,v+\ell] shorter than 11".

F4. Severity: note. Location: "## Definitions", "with DD, the count a perfectly spread set would give". Defect: the gloss overstates. For ⌊t⌋\lfloor t\rfloor equally spaced points an arc of length D/tD/t holds ⌊D⌊t⌋/t⌋\lfloor D\lfloor t\rfloor/t\rfloor or one more points, which is DD only approximately and only as t→∞t\to\infty; the source says only that the two quantities "compare the largest and smallest counts in intervals of length D/tD/t with DD" (p. 4). Proposed replacement text: "with DD, approximately the count that ⌊t⌋\lfloor t\rfloor equally spaced points would give", or drop the gloss.

Verdict

Source fidelity: faithful. The page's Definitions, Hypothesis (2.1), Statement, both proofs and the uniformity remark match the source at pp. 4--5 in hypotheses, conclusions, quantifiers, constants and conventions; the locators (arXiv v2, Section 2, Lemma 2.1 stated on p. 4, proof on pp. 4--5) are correct; the supplied details are re-derivations of steps the source states without derivation, and the one supplied condition (F2) is harmless. No required correction.

The argument as reconstructed: sound. Every deduction was re-derived above; the displacement bookkeeping, the interval inclusions with their end conventions, the exchange of integrals, the divisions and the coefficient algebra all hold, and the threshold requirements support the stated uniformity.

Limitations. This review covers Lemma 2.1 and its proof only. It does not assess the derivation of (2.1) from the ratio hypothesis in Section 5, the iteration of Section 3, or the L1L^1 form of Section 6 beyond the two role sentences. The page records a reading of the canonical conversion checked against the text layer; the reviewer read the page images of pp. 4--5 instead and found them in agreement with both at every display used. No computation was used. This focused review assigns no tier and changes no status.