cert-machine · report · every number recomputed at build

Erdős #290: the 4k(k+1) law as exact integer identities

A digit that was a guess is now a theorem

Someone asked, in an open GitHub issue, what number to put in the OEIS for Erdős problem #290 — and guessed its third digit. That digit is now PROVED. The constant is 0.546…, with no assumption about the tail — the one input taken as given is the Magma computation in the proof of van Doorn's Lemma 32 (arXiv:2411.03073: G_d ≅ S_l⁺ for every even d ≤ 60 except 8, 24, 48) — where every previous horizon could pin only 0.54…. It took closing 250 consecutive degrees of a computation nobody had run past d = 120.

tl;dr
  • The finding. 1/(1+c) = 0.546…, with no assumption about the tail. Three digits of the constant an OEIS entry would carry, proved — not estimated, not sampled. The one input taken as given is the Magma computation in the proof of van Doorn's Lemma 32 (arXiv:2411.03073: G_d ≅ S_l⁺ for every even d ≤ 60 except 8, 24, 48); this build re-certifies its irreducibility half, not its group half. The previous horizon held only 0.54…, so the third digit is new here, and it is the digit the #290 issue guessed. Underneath it: the 4k(k+1) square-discriminant law, every line of its proof checked as an exact integer identity at each even d ≤ 80 (given the published composition law, §1), the bracket for c tightened to width 8.05 × 10⁻⁴ — 80% tighter than the cited page — and every even degree pinned exactly through l = 310 (d = 620), the 6 exceptional degrees past the cited horizon (d = 168, 224, 288, 360, 440 and 528) among them. Since 2026-08-31 the liminf is a THEOREM, not an interval: van Doorn (arXiv:2609.00104, Theorem 1) proved it equals 1/(1+c) exactly, so this bracket is now the certified numeric value of that constant rather than one end of a range — and the two-sided reading below (1/(2c) ≤ 0.602108) is superseded, §3b. What the headline rests on, and how far each premise was checked, is listed in §2.
  • The mechanism. Closed-form Galois class sums from the cycle-index EGF replace an enumeration of every partition of l, 38.9 million objects at l = 87, where it ran out of memory; the two are checked equal exactly for every l ≤ 12 at this build. Planted falsifiers must fire at every build.
  • Check it. node tools/erdos290-lean-battery.js — closed forms equal enumeration exactly for l ≤ 12, the broken-EGF red control must fire (6 checks, run at this build).
1/(1+c), no tail assumption
0.546…
the liminf itself (arXiv:2609.00104, Theorem 1), proved with no assumption about the tail; the Magma computation in the proof of van Doorn's Lemma 32 (arXiv:2411.03073: G_d ≅ S_l⁺ for every even d ≤ 60 except 8, 24, 48) taken as given — [0.546083759260, 0.546323774021], derived by exact rational division of the bracket. 3 digits agreed, against 2 at the cited horizon
the 4k(k+1) law
RE-PROVED
every line of the proof an exact integer identity at each even d ≤ 80, given the published composition law (§1); 3 planted falsifiers fired during this build
cited bracket (K=60)
[0.829113767, 0.833228925]
reproduced byte-identically from the lifted narrowing pipeline; printed outward
this build's bracket
[0.830416407, 0.831220913]
width 8.05 × 10⁻⁴ — 80% tighter; densities pinned through l = 310; printed outward
degrees pinned
l ≤ 310
250 new degrees closed by the five-candidate squeeze (l = 61..310), none left open
exceptional degrees
6 closed
d = 4k(k+1) past the cited d ≤ 120: 168 (k = 6), 224 (k = 7), 288 (k = 8), 360 (k = 9), 440 (k = 10), 528 (k = 11) — every one in range
conditional c*
0.83073295584873…
34 certified digits under ONE labeled group-theory assumption — re-derived this build
1/(1+c*)
0.54622931040010…
the OEIS-shaped constant, exact rational division of the conditional enclosure
how to read the marks

Every number on this page is exact rational arithmetic, and every printed end of an interval is rounded outward. The one mark is in §2b: a dotted line joins the squeeze's exact widths, because between two of them nothing was computed. Where a number rests on a published result read here, or on a hypothesis, the page says so in italic, and §2 and §4 list each premise with how far it was checked.

§1 · the theorem

disc(f_d) is a square exactly at d = 4k(k+1)

Take P(x) = ∏_{j=0}^{d}(x−j) and f_d = P′, degree d. For EVEN d = 2l, recentring at d/2 makes f_d even: f_d(x + l) = h(x²) for a degree-l polynomial h. Four exact facts finish it: h(0) = (−1)^l (l!)²; the published composition law disc(h(x²)) = (−1)^l 2^{2l} · lead(h) · h(0) · disc(h)² (the non-monic composition law — Cullinan, The discriminant of a composition, which carries the leading coefficients explicitly; its hypotheses hold here since Res(h, x²) = h(0)² = (l!)⁴ ≠ 0); lead(f_d) = d+1; and disc(h) ≠ 0 by Rolle. Substituting:

disc(f_d) = (d+1) · ( 2^l · l! · disc(h) )²

so disc(f_d) is a perfect square exactly when d+1 is — that is, exactly at d = 4k(k+1). (Odd d are out of scope and need to be: there d/2 is a rational root, δ = 1, and that is where the log 2 that carries 83% of c comes from.) Given the published composition law, cited and not machine-checked for every d, the build re-checks every line as an exact integer identity at each even d ≤ 80 and requires the planted falsifiers — an index-from-1 misdefinition, a dropped non-monic factor — to FAIL. Until 2026-08-03 the source lab stated this law as a conjecture with 24 controls; it is a theorem.

§2 · the enclosure

What the bracket for c is made of

c = Σ_d δ(f_d)/(d(d+1)), where δ(f_d) is the density of primes p for which f_d has a root mod p. Odd d contribute exactly log 2 (proved). Each even d = 2l contributes δ · 1/(2l(2l+1)) with δ pinned EXACTLY where the Galois group is determined — hyperoctahedral at all even d ≤ 120 except {8, 24, 48, 80, 120} (the exceptional d = 4k(k+1) in that range, each settled individually) — and the honest interval [0,1] everywhere else. Nothing is estimated: every pinned δ is an exact rational, every unpinned δ costs the full width of its weight, and the bracket can therefore only shrink as knowledge grows (the build asserts the recorded narrowing is monotone).

This build first REPRODUCES the cited page's pipeline byte-for-byte: the lifted narrowing program is re-run and must emit the identical record (it did: same bytes, sha-checked), landing on the cited [0.829113767875, 0.833228924528] at knowledge horizon l = 60.

What the headline rests on, in the order the number travels through it; every step between these is exact rational arithmetic — the bracket re-assembled at this build, the squeeze's closed degrees read from their record:

  1. assumed
    The Galois groups at every even d ≤ 60 but 8, 24 and 48 van Doorn's Lemma 32, a Magma computation (arXiv:2411.03073, pinned by sha256): cited, not re-run; this build re-certifies its irreducibility half, not its group half
  2. assumed
    The reduction to five candidate groups, at each degree the squeeze closed (l = 12, 24 and 31..310) the group theory in galois-exceptions.js's header (the S_l-submodules of F₂^l, Jordan's theorem, Frobenius cycle types): read; every certificate it then asks for, a discriminant, a kernel vector, a p-cycle, was decided when its degree closed (the cited page's tail-deltas.json to l = 60, certs/erdos290-tail-ext.json past it; not re-run here)
  3. verified
    The candidate densities from the cycle-index closed forms, used from l = 87 checked equal to an independent enumeration for every l ≤ 12 at this build (tools/erdos290-lean-battery.js, 6 checks, its broken-EGF red control fired)
  4. assumed
    liminf (b(a) − a)/log a = 1/(1+c) van Doorn's Theorem 1 (arXiv:2609.00104, pinned): read, not machine-checked; without it the bracket is a bracket for c alone

The bracket is exact rational arithmetic over these premises; the weakest is assumed: two published results and one reduction are read here, and no machine here checked them.

§2b · the squeeze

The interval, closing

Each pinned degree removes its own weight from the unknown tail, so the bracket can only shrink — and this is what that looks like when every point is recomputed in exact rationals at build time. Left of the shaded edge is the cited page's horizon; everything right of it is this repository running the same instrument further (§3 says which bytes ran where).

1e-3 2e-3 5e-3 1e-2 20 60 120 190 250 310 knowledge horizon l (densities pinned exactly for every even d = 2l up to here) certified width of c ← the cited page stops here 8.05 × 10⁻⁴
Certified width of the bracket for c against the knowledge horizon l, log scale, every 10 degrees: each dot is a width decided in exact rationals at this build; the dotted line between dots is drawn, not decided. 1.21 × 10⁻² at l = 20 · 4.12 × 10⁻³ at the cited l = 60 · 8.05 × 10⁻⁴ at l = 310, a factor of more than 14 across the sweep and 80% tighter than the cited page. The dots fall smoothly because the width is the unpinned tail Σ 1/(2l(2l+1)) and nothing else: no estimate enters, so no point can move up.Records: certs/erdos290-tail-ext.json · sha256 5ce28a45aef4; legacy/research/challenges/erdos290/tail-deltas.json · sha256 338b2a3a98f2The build refuses this figure if the certified width fails to fall from one sampled horizon to the next, or the squeeze no longer samples the cited horizon.
decided
exact arithmetic backs it
chosen
one member of a set the data admits
§3 · the continuation

Past the horizon: l = 61..310, same instrument, tighter interval

The entire remaining width at l = 60 is the unpinned tail Σ_{l>60} 1/(2l(2l+1)). This repository ran the cited page's own five-candidate squeeze — the lifted galois-exceptions.js, byte-identical through l = 86 and, from l = 87 on, with its candidate densities replaced by the closed forms of the tl;dr (tools/galois-exceptions-lean.js: the lifted bytes otherwise, refused unless they hash to the lift), nPrimes = 400, early exit — over l = 61..310. 250 degrees closed to a unique certified survivor — none refused. Result:

c ∈ [0.830416407911, 0.831220912621] (width ≤ 8.046 × 10⁻⁴, 80% tighter than the cited page)

Each closed degree also extends the evidence base of §4's assumption: every one is a new even degree at which the group is verified to be one of the two allowed candidates. The extension record is certs/erdos290-tail-ext.json; a degree absent from it contributed nothing but honest width.

Some closures deserve their own sentence. The EXCEPTIONAL degrees past the cited horizon — d = 4k(k+1), square discriminant by the theorem of §1, the degrees the cited page could not reach and left with their Galois group undetermined — are 168 (k = 6), 224 (k = 7), 288 (k = 8), 360 (k = 9), 440 (k = 10), 528 (k = 11). The squeeze closed EVERY one of them (survivor ES0), so every exceptional density through l = 310 is now an exact rational.

§3b · superseded, and why it is kept

The liminf became exact — so this bracket is now its value

Read this section as history. On 2026-08-31 van Doorn posted arXiv:2609.00104, whose Theorem 1 proves that liminf (b(a)−a)/log a = 1/(1+c) EXACTLY — a human write-up of a proof discovered with ChatGPT 5.6-Sol Pro (the abstract is pinned at corpus/sources/erdos290/arxiv-2609.00104-abs_2026-10-06.html, the PDF by sha256 beside it). The 1/(2c) endpoint is superseded by that theorem: Theorem 8 is no longer a two-sided interval, and the upper-endpoint sharpening this section describes no longer improves anything. What survives is better: the certified bracket on c above is now the numeric value of a constant that is known exactly, and to our knowledge it remains the sharpest published enclosure of it — the new paper states only "approximately 0.546" and makes no effort to compute it precisely. The reasoning below is left standing because it was correct when posted and because the lower endpoint 1/(1+c) is exactly what the new theorem singles out.

The bound this page set out to sharpen was one half of a pair. Van Doorn's Theorem 8 read 0.54 < liminf (b(a)−a)/log a < 0.61, with Lemma 31 supplying the lower endpoint 1/(1+c), Lemma 30 the upper endpoint 1/(2c), and Lemma 32 supplying 0.82 < c < 0.85. Both published constants are those two expressions rounded to two decimals — so the same constant c governs both, and a certified bracket for c moves both ends of the published interval, not one.

The upper endpoint costs nothing extra. 1/(2c) DECREASES in c, so it is fed by the bracket's certified LOWER endpoint — and the lower endpoint charges the unpinned tail zero, so no tail lemma, no assumption about the groups above the horizon, and no further degree enters it at all. Dividing the same bracket the other way, with outward rounding:

liminf (b(a)−a)/log a ≤ 1/(2c) ≤ 0.602107563430 (published: 0.61)

Setting the two together, Theorem 8 becomes 0.546083759260 < liminf < 0.602107563430 — the published interval narrowing from width 0.07 to at most 0.0561. Honesty about where that comes from: most of the upper-endpoint gain was already available at the cited horizon, which gives 0.603053548709; the continuation of §3 moves it the rest of the way. The published 0.61 is conservative mainly because 0.82 is a conservative reading of c, not because the horizon was short. Both numbers above carry the same Lemma 32 dependency as everything else on this page, and neither carries the §4 assumption.

§4 · the conditional value

c to 34 digits — under one labeled assumption

Below d = 62 the lifted kernel needs no assumption: it carries the paper's hyperoctahedral range and the exceptional densities at d = 8, 24 and 48 as exact rationals. Under one assumption about everything above it — given that for every even d ≥ 62, Gal(f_d) is either S_l⁺ or its index-2 subgroup, which is true at every degree where the group has been determined — the tail telescopes with two explicitly-carried error terms (the index-2 allowance 1/(2^l l!) and the alternating-series deviation), and c is pinned to 34 digits, re-derived during this build:

c* ∈ [0.8307329558487356638503727480334797, 0.8307329558487356638503727480334798]

That boundary is not asserted here, it is READ OFF the enclosure: the whole width of the interval above is the sum of the carried allowances, largest at l = 31 where one term costs 1.45e-47 — which caps this enclosure at 46 decimals no matter how large the cutoff, of which the record publishes 34. The derived constant 1/(1+c*) = 0.546229310400104587… (exact rational division of the enclosure) is the OEIS-shaped output. The assumption subsumes irreducibility of f_d for those degrees; it is certified only through the pinned horizon. The statement with no assumption about the tail remains the bracket of §3, which takes as given only the Magma computation in the proof of van Doorn's Lemma 32 (arXiv:2411.03073: G_d ≅ S_l⁺ for every even d ≤ 60 except 8, 24, 48), as everywhere on this page — the two are never conflated.

What c* rests on, beyond the premises of §2:

  1. assumed
    For every even d ≥ 62, Gal(f_d) is S_l⁺ or its index-2 subgroup a hypothesis, adopted: it holds at each of the 250 degrees the squeeze closed past the cited horizon (S_l⁺ at 244, the even-weight subgroup at 6, certs/erdos290-tail-ext.json) and is checked nowhere beyond l = 310

The 34 digits are exact given it; the hypothesis is the weakest premise, assumed, and no finite computation can check it.

The same telescoping run against THIS build's horizon instead of the cited kernel's — node tools/erdos290-cstar-precision.js — starts its assumption at d = 622 rather than d = 62, and the enclosure lengthens accordingly; that tool carries its own calibration against the kernel at the old horizon and writes the OEIS b-files.

§5 · provenance

The cited page, byte-preserved — and how to re-run all of it

This page supersedes the one cited in the erdosproblems #290 comment (posted 2026-08-04); that page and its programs are preserved BYTE-IDENTICALLY, hash-pinned through this repository's lift provenance, in the repository (the citation paths 301 here). Its self-contained programs — the theorem checker with its planted falsifiers, the narrowing pipeline, the five-candidate squeeze, the vendored exact-rational arithmetic — live beside it in the repository. This build re-runs the theorem checker and the narrowing pipeline; the squeeze's 250 closed degrees are read from their record, certs/erdos290-tail-ext.json, and are not re-run here. To repeat it yourself: node theorem.js (the proof), node narrowing.js (the bracket), node tools/run-erdos290-tail-ext.js or, sharded across cores, node tools/run-erdos290-tail-shard.js (the continuation past l = 60) from the repository.

contact

Write to Carlos

Sent by Web3Forms to Carlos’s inbox; nothing stored here.

Or write to carlos@carlostoledo.co, or open the public pilot form on GitHub.