Erdős–Straus: a sieve bound on the Type II branch
- Kind
- Theorem with a written proof (a large-sieve argument)
- Status
- Proof read by a falsifier agent with no gap found; unrefereed
- Prior work
- Not found in the sources searched; the method is standard, and the theorem is a transposition of Dahan's fixed-depth theorem to fixed shifts
On this page
The statement
The Erdős–Straus conjecture says that has a solution in positive integers for every . For a prime the least shift is 1; the theorem concerns . A shift proposes the denominator ; the Type II branch of shift succeeds when there are coprime with and , and then gives a solution with that . Let be the least shift that works on either branch.
Theorem F. Let be a finite set of positive integers . The number of primes , , at which every fails on the Type II branch is
Corollary. For let , the number of shifts 3, 7, 11, … up to . Then . At : .
Check it yourself
- One shift at work. For , , and 29 leaves remainder 2 on division by 3. Take , : they are coprime, , and 3 divides . So .
- The key step (the involution lemma). If shift fails on the Type II branch at , the residues mod of the prime factors of contain no pair : two primes and dividing would give , . So each failing shift confines the prime factors of to half the residue classes coprime to , and each such shift removes about half a class per prime from the sieve.
- The lemma on data. Over the primes below 1048576 and the shifts 3, 7, 11, 15, 19, 23: 81307 Type II failures and 0 violations of the lemma, while its converse fails 95454 times. The converse fails because products also count: .
Worked examples
The counts of primes up to at which the Type II branch fails, with the ratio to the theorem's rate in brackets:
| fails at 3 / | at 3 and 7 / | at 3, 7, 11 / | |
|---|---|---|---|
| 418 (0.2356) | 88 (0.1652) | 33 (0.2063) | |
| 1,401 (0.2355) | 301 (0.1787) | 119 (0.2496) | |
| 4,742 (0.2334) | 1,033 (0.1893) | 420 (0.2866) | |
| 16,407 (0.2329) | 3,374 (0.1871) | 1,329 (0.2877) | |
| 57,186 (0.2313) | 11,270 (0.1859) | 4,196 (0.2823) |
The middle column equals at every . The third column counts Type II failures, not . The ratios settle, which agrees with the theorem's exponent but cannot confirm it: the bound is an upper bound and these are small.
Status and who checked it
- Proved by hand. The proof combines the involution lemma with Montgomery's arithmetic large sieve at and Mertens' theorem in arithmetic progressions, both cited as standard results. No computation is part of the proof.
- Who checked it. A falsifier agent read the proof step by step and found no gap ("this is a reading, not an independent proof"), and reran the checks above. No second reviewer graded it. Unrefereed.
- Open. A matching lower bound for without a hypothesis: it is not even known from these sources that infinitely many primes have . Under the Elliott–Halberstam conjecture a lower bound of the same order holds, by a conditional argument the same falsifier agent also held. Whether the exponent is sharp for two or more shifts.
Prior work
Credited. The criterion at a fixed shift, its two branches and the shift-3 case are in Dahan's work (arXiv 2608.24035), as is the nearest theorem: "fixed_depth", the same shape of bound for fixed sets of witness pairs whose shift moves with , by Selberg's sieve and Bombieri–Vinogradov. Dahan's later preprint (arXiv 2611.08717) applies the large sieve over a growing number of shifts, with a weaker saving at any fixed number. Shift 3 alone has a two-sided count by Iwaniec (1972); shift 7 alone by Dahan.
Searches run. The sources listed for the project, and Dahan's two papers searched for this statement. The theorem was not found in the sources searched. The method is standard; the theorem is a transposition of fixed_depth to fixed shifts.
Still owed. The body of Sander (1994), which counts one family and would not decide this; a wider search than the sources listed.
Further reading
- B. Dahan, "Sieve dimension and search depth for the Erdős–Straus conjecture, n ≡ 1 (mod 24)", arXiv 2608.24035
- B. Dahan, arXiv 2611.08717
- Montgomery, the arithmetic large sieve (1968); the constant is Montgomery and Vaughan's (1973).