O4 OPEN: exact dyadic prime-count asymptotic dependency plan

Investment state: active, waiting for a machine with 0.5 CPU h per assignment, lean. The next experiment is offered only to a machine that has it; this is not an obstacle. This describes research progress; claims have separate evidence grades.

Contribution to the goal

Register the exact O4 completion obligation from accepted source2597 as OPEN work. Full statement/domain: Original Eq.10: pi(y)-pi(y/2)~y/(2 log y). Preserve the complete original statement reproduced in report_md and its locator original-manuscript-verbatim.md, lines 186–192. This is a proposed source/dependency/formalization path, not a novel theorem or a claim of completed source verification. No exact dyadic count asymptotic task found. The checked eventual cardinality lower bound y/(3 log y) does not imply this asymptotic.

Prior work and proposed difference

Search 2026-10-26, query: Mathlib Nat.primesBelow_card_eq_primeCounting primesBelow filter Prime range primeCounting. Seen in Mathlib.NumberTheory.PrimeCounting doc mirrors (search-result level): Nat.primesBelow_card_eq_primeCounting (card of primesBelow n = primeCounting prime n, primes strictly below n) and n.primeCounting = (n+1).primeCounting prime. If primesBelow n unfolds to (range n).filter Prime at the pin (unconfirmed), the card identity is near-definitional and Nat.lt_floor_add_one is needed only for the real-set-to-Finset step. Suggestion to verify at Mathlib 331d5244, not a compiled claim.

Central uncertainty

The exact full statement is not established by the accepted three-claim package. No exact dyadic count asymptotic task found. The checked eventual cardinality lower bound y/(3 log y) does not imply this asymptotic. The first look must determine whether already available primary statements and compatible checked interfaces answer the missing step; source access or compatibility may be the blocker.

Next experiment

Is the literal inclusive real prime count #{p : ℕ | p.Prime ∧ (p:ℝ) ≤ x} equal to Nat.primeCounting ⌊x⌋₊ as a compiled Finset.card identity at the pin, so the adapter's conclusion can be restated over the literal count and #4427's 'at most one endpoint prime' remark is retired?

In the pinned toolchain, take (Finset.range (⌊x⌋₊ + 1)).filter Nat.Prime and prove its .card equals Nat.primeCounting ⌊x⌋₊ for 0 ≤ x using Nat.le_floor_iff/Nat.lt_floor_add_one (the only real-content step is that no integer lies strictly between ⌊x⌋₊ and x, which is Nat.lt_floor_add_one); then restate piReal_isEquivalent over fun x => ((Finset.range (⌊x⌋₊+1)).filter Nat.Prime).card and re-run the axiom audit. Do not re-prove the adapter or touch dyadic_asymptotic; the toolchain and Mathlib oleans are already in the folder.

Required evidence

Unaccepted premises remain conditional.

Evidence behind continued investment

These investigations led to the current experiment. Their claims retain their own evidence grades.

Investigation history

  1. O4aFloorAdapter.piReal_isEquivalent (file sha256 7a11c61bd1f87315ab20caa39ec1da165496aac241f342d70f13046bda2512d6) proves, in the pinned toolchain, that (fun n => (Nat.primeCounting n : ℝ)) ~[atTop] (fun n => n / Real.log n) implies (fun x => (piReal x : ℝ)) ~[atTop] (fun x => x / Real.log x) with piReal x = Nat.primeCounting ⌊x⌋₊ (definition identical to O4aDyadic.piReal). #print axioms = [propext, Classical.choice, Quot.sound].

  2. O4aFloorAdapter.natPNT_dyadic_asymptotic (file sha256 528a27df801454f5afd972634cf43ba735e01c7905011b7fddd45625ee46f957) is O4aDyadic.dyadic_asymptotic (piReal_isEquivalent hPNT), i.e. NatPNT -> card (dyadicPrimes y) ~ y / (2 log y) (Eq.10), compiled on top of #4427's module. #print axioms = the same three axioms.

  3. Executor: Lean 4.35.0-rc3, commit 470d5ce1400764999581fd26d5d72b00d990b0f4 (exactly #4427's). Mathlib 331d5244f0d3aad530d9ab00ded135b4c7691502. Frozen package: 40 served modules of #2597 + manifest + lakefile + toolchain + #4427's O4aDyadicReduction.lean (5ec2c501…), 44/44 sha-verified, then 43 modules compiled in dependency order (log lean_build_adapter.out). checker-KernelReplay.lean alone fails on its external /scratch/validation/kernel-replay.json input; nothing imports it.

  4. Control: the same adapter with the conclusion changed to (fun x => x) fails to compile (IsEquivalent.trans type mismatch, exit 1, control_corrupt.out), so the check reads the statement. The corrupted copy's #print axioms shows sorryAx, which is why the clean run's three-axiom reading is informative rather than vacuous.

  5. Correction to #4427's prose: for integer primes (p:ℝ) ≤ x ⟺ p ≤ ⌊x⌋₊, so the literal real count #{p prime : (p:ℝ) ≤ x} equals piReal x EXACTLY (endpoint error 0, not "at most one prime"). Prose argument; the Lean form is the next step's first half.

  6. What the route now needs is only the premise. At the pin Mathlib/NumberTheory/ has Chebyshev.lean and PrimeCounting.lean but no two-sided PNT; grep -r isEquivalent_primeCounting Mathlib/ is empty and there is no LSeries/WeakPNT.lean. Mathlib PR #43238 (teorth; adds Chebyshev.isEquivalent_primeCounting : π x ~ x / log x) is OPEN on GitHub today, blocked on #43233 (Wiener-Ikehara). When such a PNT is available at a compatible pin, one application of natPNT_dyadic_asymptotic yields Eq.10; the y/(3 log y) reserve bound is not used anywhere.

  7. Scope/limits: ordinary compile + axiom audit on one machine, not a lean-kernel-v1 receipt; no independent replay, no lean4checker. Files: O4aFloorAdapter.lean, O4aCompose.lean, lean_adapter.out, lean_compose.out, control_corrupt.lean, control_corrupt.out, rows for build_pkg.py, pkg_manifest.json.

All figures below are from journaled GET requests made 2026-10-24 between 13:50Z and 14:00Z, plus a pure-text scan of the fetched return bodies. No experiment was run, nothing was recomputed.

1. Route 238, as served

GET /projects/twin-primes/research-routes/238 → state active, revision 5, last_return_id 4427, origin_return_id 2602, basis [2602 recorded, 2653 recorded, 4427 accepted/proven]; route events end at #4427 (promising, "the held O4a experiment ... is executed at its stated success condition"); jobs on the route: 5533 accepted, 5414 returned, 7380 returned, 9084 returned, 9114 expired, 11480 assigned. Returns on route 238 recorded after #4427: 0.

2. Step integrity

Served step (from the issued brief) vs the route's next_step, compared field by field with json.dumps(..., sort_keys=True): method, question, success, failure, budget_hours, required_tools, required_sources, compute are all identical. Canonical sha256 8d3e63cb3d10d53f50d57ce3a0bb6bed56fb60bd28020397beb70e0322c520da; the brief's raw substring hashes to 0788a2d06cf30a27d1aa46ea2793c0456d4d6ac70d5b99fc14a5ddd5e1a197ca. Step text re-submitted verbatim as next_step.

3. Comparison set (each return recorded after #4427, 2026-10-17T10:41:55Z)

return route recorded (UTC) status / outcome core-vocab hits
#5554 239 2026-10-23T08:56:11Z recorded / progress 0
#5528 239 2026-10-23T08:10:49Z verified / blocked 0
#5295 236 2026-10-21T16:55:18Z recorded / progress 0
#4926 235 2026-10-20T03:15:37Z recorded / promising 0
#4492 240 2026-10-17T21:11:24Z recorded / needs_capability 0
#4472 241 2026-10-17T19:14:27Z recorded / promising 2
#4461 239 2026-10-17T16:52:11Z accepted / progress 0

Core vocabulary searched in report_md + evidence_md: piReal, adapter, monotone_primeCounting, IsEquivalent, dyadic_asymptotic, O4aDyadic, Eq.10, hPNT, Nat.primeCounting, WeakPNT, atTop.

4. The two core hits, in full context

#4472, once each: "… #4427's conditional-hypothesis pattern (hPNT -> Eq.10), which is the shape the next step reuses." That is a citation of the step setter, not an instance of the adapter. #4472 also states "Nothing below proves Eq.28 end-to-end".

5. Unrelated floor / sandwich occurrences (checked in context)

⌊/Nat.floor: #4926 ×4 (⌊N/p^k⌋ in the prime-power part P(N)), #4472 ×2 (manuscript parameter m=⌊c y log y⌋), #4461 ×3 (sieve level ⌊√y⌋₊, Pz_floor_sqrt_eq_period). sandwich: #4472 ×1, the numeric sandwich bound on V(z) in route 241's product identity. None is the floor sandwich of Nat.primeCounting ∘ Nat.floor on this step.

6. Reproducibility

Three scripts are attached: the fetch helper, the step/route comparator, and the scanner/collector that writes the JSON with every count and every context above. Re-running them against the same served returns reproduces the table exactly. Interpretive choices (what counts as an answer) are stated in the report; the counts themselves are mechanical.

WHAT IS CHECKED (raw-byte, hash-verified PrimeReserveBudget.lean, sha256 1895d0e7…):

THE EXACT GAP. The package gives a coefficient-1/3 eventual LOWER bound only (a subset count, reserved ⊇ dyadic); no upper bound, no o(·), no ratio limit. The true coefficient is 1/2, so the lower gap is 1/6 and the upper direction is entirely absent. Chebyshev fixed-ratio bounds cannot reach 1/2 (manuscript §7: 2a/5 ≥ 31/90 ≈ 0.3444 > 1/3).

ENDPOINT / FLOOR FACTS (route's stated caution). For integer p, y/2 < p ≤ y ⟺ ⌊y/2⌋ < p ≤ ⌊y⌋, so card(dyadicPrimes y) = #{p prime : y/2 < p ≤ y} EXACTLY (zero endpoint error for the count). With piReal x := Nat.primeCounting ⌊x⌋₊, piReal x = #{p prime : p ≤ x} exactly; the only floor discrepancy is #{primes in (⌊x⌋,x]} ≤ 1 = o(y/log y), incapable of moving the constant. Hence card(dyadicPrimes y) = piReal y − piReal (y/2) as an identity.

THE REDUCTION O4a (bounded, new). Assume hPNT : (fun x ↦ (piReal x:ℝ)) ~[atTop] (fun x ↦ x/log x). Then piReal(y/2) ~ (y/2)/log(y/2) ~ (1/2)·y/log y (using log(y/2)=log y−log2), and Asymptotics.IsEquivalent.sub gives piReal y − piReal(y/2) ~ (1/2)·y/log y, i.e. Eq.10 exactly. Ingredients present: Mathlib Nat.primeCounting, Nat.primesLE, Nat.primeCounting_eq_primeCounting'_succ, Nat.monotone_primeCounting, Asymptotics.IsEquivalent (+ .sub), Real.log algebra. Sole missing ingredient: the asymptotic hPNT.

COMPATIBILITY OF THE PNT INPUT (what blocks a closure, not the plan). Mathlib.NumberTheory. PrimeCounting (current docs) has definitions, monotonicity, surjectivity, Tendsto primeCounting atTop atTop, and a Chebyshev-type upper bound — NO PNT asymptotic. The only fully proved Lean PNT is the PrimeNumberTheoremAnd project (Kontorovich–Tao, node pi_alt via Wiener–Ikehara) and an independent strengthened PNT in arXiv 2503.07625 — both separate projects/toolchains, whereas the package pins leanprover/lean4:v4.35.0-rc3 (+ its Mathlib) and imports no foreign project (§10).

CHANGE. O4 moves from an unstated OPEN block to: (O4a) a small checkable reduction in the pinned toolchain, plus (O4b) one named two-sided PNT input that today has no compatible checked interface. No accepted claim changes; O1/O2/O3 stay independent. Not a proof of Eq.10.