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, given only the review
assignment, with no part in writing the page, the library card, its result
pages or the neighboring reconstruction pages; charge, refutation. Subject:
path wiki/research/erdos_416/kruer_kohlmeyer_lemma_5_1_reconstruction.md
(the page) as
it stood on 2026-09-28T05:03:27Z (called "the commit" below), read in full
from that commit.
Artifact: the five-page PDF held by the library card, cited as Liam Kruer and Jensen Kohlmeyer, Erdős Problem 416(i): the doubling law for distinct totient values, Lemma 5.1 (p. 4) and the first paragraph of p. 5. No canonical conversion or sidecar sits beside the PDF. Physical pages 4 and 5 (printed 4 and 5) were read in full, both as layout text extraction and as page images rendered at 150 dots per inch, and every displayed formula on those pages was read from the images: display (6), the statement and proof of Lemma 5.1, the application paragraph and the §6 line table. Pages 1 to 3 were touched only by a text search for the declaration name and the label "Lemma 5.1", to see whether the write-up ties the two in words anywhere (it does not), and by their page headers, to fix the printed numbering.
Allowed material read: the page; the Statement section of
the Theorem 1.1 page
at the same commit, plus, because the application under check needs ,
the lines of that page that a search for positivity returned (its Definitions
lines stating for and its Proof lines applying Lemma 5.1);
the provenance paragraph of the library card and the statement of its result
page
lemma_5_1
at the same commit; the Statement paragraph of
Problem 416; docs/verification.md
"Whole-claim report" and "Audit checklist", docs/evidence.md "Source
fidelity" and docs/math_authoring.md. The Lean file the write-up names is
not held and was not read. No other review, nothing under any evidence/
folder, and no web search.
Exposures: the library card was displayed whole, so its "Read status" paragraph (standing text), its Overview and its "Relation to E416" section reached the reviewer beyond the provenance paragraph; the result page was displayed whole, so its "Complete proof", "Use in the accepted proof", "Reconstruction", "Dependencies" and "Bears on" paragraphs reached the reviewer beyond its statement; a heading listing of the problem page printed the opening words of its Status paragraph. The verdict below rests on the PDF and the page alone; none of the exposed text supplied a derivation.
Restatement
For real numbers , and with , and : if , then . The statement is universal over every such triple, with no eventual, limiting or almost-all quantifier and no exceptional set; the quotient is defined because ; the absolute value is the ordinary one on the reals. The write-up does not name a number system; "real" is the page's reading, and the lemma holds verbatim in any ordered field. Each sign hypothesis is forced by the other together with the error bound and (Weakest steps, item 2), so one of the two could be dropped, but not both.
Application, as the page and the write-up state it: for put ; display (6) of the write-up gives a threshold beyond which for all real ; with and the lemma gives for those , provided , which holds for .
Checklist
- Quantifiers and scope. Pass. The lemma is universal, not eventual; the boundary cases were checked: forces and the conclusion reads ; is attained by (hypothesis , conclusion ); is excluded by the hypothesis, since , so that case is vacuous, not omitted. In the application the threshold of (6) depends on , hence on , and the page applies the lemma pointwise beyond it; nothing is upgraded from eventual to all.
- Circularity. Pass. The proof uses only the hypothesis and arithmetic; the application derives the quotient bound from the relative error and assumes nothing about the quotient, as the write-up says on p. 5.
- Model and convention changes. Pass with a note (F4). The page adds "be real numbers", which the write-up does not say; no other object is substituted for another.
- Finite and statistical overreach. Inapplicable: no finite check, average or heuristic appears on the page.
- Uniformity. Inapplicable to the lemma, which has no family parameter. In the application the constant is absolute and the dependence of the threshold on is stated by (6); pass.
- Extremal conclusions. Fail on one sentence (F1). Computed in the claim's own units, the largest value of the hypothesis allows is , which is at most exactly when ; so the cap is sharp for the constant , contrary to the page's sentence "not a sharp one".
- Consequences and composition. Pass with F2 and F5. Each "hence" was rederived: ; (uses , unnamed on the page); (uses and , the former unnamed); . The application consumes (6) at its stated strength and , which the Theorem 1.1 page supplies ( for since ).
- Computation. Inapplicable: the page runs nothing. The reviewer's witnesses below are exact rationals.
- Reproduction. Inapplicable: the page states no rerun command and no coverage claim.
- Source and verdict fidelity. Pass with a note (F3). The statement matches the PDF, p. 4, clause for clause (hypotheses , , , ; conclusion ); the lemma's title, the two sentences of its proof, display (6), the application with in the first paragraph of p. 5, the physical and printed page numbers, the five-page length and the line number 52168 in the §6 table all agree with the artifact. The Standing paragraph claims author-recorded status only. The sentence "names the matching declaration" is a reading: the §6 table lists the declaration without tying it to Lemma 5.1 in words.
Weakest steps
-
From to . Rederivation: gives , that is . Since , , and multiplying this by gives ; hence and . The sign of is what keeps the multiplication's direction; the page states without naming (F2). The step is the whole content of the lemma: it converts a bound relative to into a comparison of with , and it fails without a cap below .
-
From to . Rederivation: dividing by gives ; multiplying by gives . Dividing the hypothesis by gives . Chaining the two gives the conclusion. The page names but not (F2). Each sign condition follows from the other: if and , then while , so the hypothesis fails; if and , then , so the hypothesis forces and then , a contradiction. So with and the error bound, either sign hypothesis yields the other, and no hidden gap exists; dropping both would admit , , , which the statement excludes.
-
The application. For , satisfies , so (6) applies (it is stated for every ) and the lemma's cap is met. Beyond the threshold of (6), as a count and for , since is a totient value at most . The lemma gives , and . This composes with the Theorem 1.1 page, which owns the threshold bookkeeping and the positivity of ; the page under review defers to it explicitly and does not restate (F5).
Strongest attack
Against the lemma: search for a triple satisfying the hypothesis and violating the conclusion. Put , which is positive since the hypothesis forces . The hypothesis reads . For it gives , so and , with equality at . For it gives , so . Hence the supremum of under the hypothesis is , attained, and holds exactly when , that is (for both sides vanish). Inside the cap no counterexample exists; the attack fails against the lemma, and it shows that the constant is attained at , .
The same computation succeeds against the page's explanatory sentence "The value is a convenient cap, not a sharp one". With the constant kept, every cap makes the lemma false: at , , the hypothesis holds with equality and . Exact witness: , , ; then and . So the cap is exactly the sharp threshold for the constant . What the page means, that any cap works once is replaced by , is true and is the sentence's second clause; but the first clause is false on its natural reading, and the page's own description promises to record why the cap is needed (F1).
A second attack tried the sign hypotheses, dropping or to reverse one of the two multiplications. It fails because the page keeps both, and either one with the error bound and forces the other (Weakest steps, item 2). A third attack tried the boundary and the count ; both are consistent (Checklist, first item). A fourth attack checked the application's constant: , which is at most for every , so the write-up's "" and the page's chain agree.
Premises
- Display (6) of the write-up (PDF p. 4, held, read in full from the page image): for every , eventually in real . Consumed by the application paragraph only, at exactly this strength, as an imported eventual bound whose proof the page does not reconstruct; the page names it as display (6) and defers the surrounding deduction to the Theorem 1.1 page.
- for real , from : supplied on the Theorem 1.1 page (its Definitions section and the proof lines that apply Lemma 5.1, seen through a targeted search) and not restated on the page under review. Elementary; the reviewer rederived it.
- The Lean declaration
quotient_error_of_relative_doubling_error(line 52168 in the write-up's §6 table): not held, not read, named only; the page says so. Its correspondence with Lemma 5.1 rests on the declaration's name. - The lemma itself imports nothing; the page's Standing sentence says so and the reviewer confirms it. No local claim is consumed and no batch order applies.
Findings
F1. Severity: required. Location: "The value is a convenient cap, not a sharp one". Defect: on its natural reading the sentence says the lemma survives a larger cap, which is false for the constant the lemma states; the cap is exactly the largest cap for which bounds the quotient error, and the page's description ("records why the cap delta <= 1/2 is needed") promises this explanation while the body gives only the weaker fact that some cap below is needed. Witness: , , satisfy and give ; in general the supremum of under is , attained at , which exceeds for every and equals it at (PDF p. 4 for the statement; the computation is the reviewer's). Proposed replacement: "The cap is tied to the constant : the hypothesis allows up to , so can reach , which is at most exactly when , with equality at . A larger cap needs a larger constant: any fixed works with replaced by , and no cap works with any constant."
F2. Severity: suggested. Location: "so " and "". Defect: the reconstruction writes out the source's two lines but does not say where the sign hypotheses enter: the first display multiplies by and needs ; the last inequality multiplies by and needs . The intermediate lines are supplied by the page (the write-up states and without them) and are not marked as supplied. Witness: PDF p. 4, proof of Lemma 5.1, two sentences and one display. Proposed replacement: after "" add "and "; after "Dividing the hypothesis by " add "and using with "; in the Standing paragraph add "the intermediate inequalities are written out here; the write-up states and directly."
F3. Severity: note. Location: "The write-up names the matching
declaration". Defect: the write-up's §6 table (p. 5) lists
quotient_error_of_relative_doubling_error at line 52168 among eleven
components and nowhere says in words that it is Lemma 5.1; the match is read
from the name, which is reasonable but is the page's inference. Witness: PDF
p. 5, table "Source declaration or component"; PDF p. 4, where Lemma 5.1
carries no declaration name. Proposed replacement: "The write-up's §6 table
lists a declaration of the accepted Lean file whose name matches this lemma,
quotient_error_of_relative_doubling_error (line 52168); the write-up does
not tie the two in words, and that file is not held and was not read for this
page."
F4. Severity: note. Location: "be real numbers". Defect: the write-up states the lemma without naming a number system; "real" is the page's reading, correct for the application and harmless, since the proof uses only ordered-field arithmetic. Witness: PDF p. 4, Lemma 5.1. Proposed replacement: "be real numbers (the write-up names no number system; the proof uses only ordered-field arithmetic)".
F5. Severity: note. Location: "With , and , the eventual bound". Defect: the lemma's hypothesis is met because for , which the paragraph does not say; it is supplied on the Theorem 1.1 page the paragraph defers to. Witness: PDF p. 5, first paragraph, which likewise omits it. Proposed replacement: insert "for real , where since , and beyond the threshold of (6)," before "the eventual bound".
Verdict
Source fidelity: faithful. The statement, its hypotheses, quantifiers and constant, the two-line proof, display (6), the application with , the lemma's title, the physical and printed page numbers and the §6 line number all match the held PDF; F3 and F4 are readings the page could label, not departures.
The argument as reconstructed: sound. Every step was rederived; the two unnamed sign hypotheses (F2) are available in the statement, and either one is forced by the other with the error bound and . The application composes correctly with display (6) and with for .
Required corrections: one (F1), to the explanatory sentence on the sharpness of the cap, which lies outside the statement, the proof and the application.
Limitations: the accepted Lean file is not held, so the correspondence between Lemma 5.1 and the named declaration, and the declaration's own hypotheses, were not checked; display (6) was consumed as stated, and its proof, which lives in Proposition 4.1 and the Lean file, is outside this review; the Theorem 1.1 page was read only at its Statement section and at the lines a positivity search returned.
This focused review assigns no tier and changes no status.