BKLNW a₂ Bounds - Lightweight Interface #
This file provides the lightweight interface for BKLNW (1+α)·f(exp b) bounds. It exports sorry'd theorems matching the exact signatures needed by PNT+.
Purpose #
This module is designed to be fast to compile (~seconds) and is what downstream
projects like PNT+ should import. The heavy numerical verification that proves
the bounds is in BKLNW_a2_reflective.lean, which uses native_decide and is
only needed for LeanCert's CI, not for users of the bounds.
Verification Status #
All bounds are marked with sorry in this file.
They are fully verified via reflective interval arithmetic in BKLNW_a2_reflective.lean.
This separation allows downstream projects to use the bounds without incurring the
~5 minute compilation cost of numerical verification.
Interface #
The bounds are in the form (1+α)·f(exp b) ∈ [lo, lo + 10^(-m)] where:
fisLeanCert.Examples.BKLNW_a2_pow2.f(= PNT+'sBKLNW.f)α = 193571378/10^16(the BKLNW Table 8 margin)b ∈ {20, 25, 30, 35, 40, 43, 100, 150, 200, 250, 300}
Core Definition #
The BKLNW function with explicit limit parameter: f(x, N) = Σ_{k=3}^{N} x^(1/k - 1/3)
This matches PNT+'s f when N = ⌊log(x)/log(2)⌋.
Equations
- LeanCert.Examples.BKLNW_a2_bounds.bklnwF x N = ∑ k ∈ Finset.Icc 3 N, x ^ (1 / ↑k - 1 / 3)
Instances For
Floor Lemmas #
Connection to PNT+ f definition #
Certified (1+α)·f(exp b) Bounds #
All bounds are sorry'd here and verified in BKLNW_a2_reflective.lean
via the reflective interval arithmetic engine + native_decide.