Skip to main content
All packages

AlexKontorovich/PrimeNumberTheoremAnd

PrimeNumberTheoremAnd

Blueprint for the PNT+ Project

Therefore indexed 1,644 complete source declarations from the exact package revision. Individual authorship and independent verification remain unset.

Research project325 GitHub starsApache-2.09 indexed versionsRepositoryFull history on Reservoir

Head version

a93551347dce

a93551347dce924b1db75d40218841bf085a465f

Toolchain
leanprover/lean4:v4.32.0
Revision date
22 Jul 2026
Dependencies
13
Versions
9

External build observation

Exact head commit and toolchain

No Reservoir build observation was found for this exact commit and toolchain. This is not evidence of failure.

Pin this source in lakefile.lean

require PrimeNumberTheoremAnd from git "https://github.com/AlexKontorovich/PrimeNumberTheoremAnd.git" @ "a93551347dce924b1db75d40218841bf085a465f"

Source declarations

1,644 indexed proofs

Package history

Showing 481 to 500 of 1,644 declarations.

theorem

FKS2.FloorButhe7.rhsE7_le_rowcurve

Open the record for the exact Lean statement and complete source.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor23Row7 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor23Row7.lean:82

theorem

FKS2.mid_row8_lo

Row-8 mid-range LO flank [e^10, e^5500] - restricted envelope cover (cells with b ≤ 5500, all below the gap band).

PrimeNumberTheoremAnd.IEANTN.FKS2Cor23Row8 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor23Row8.lean:51

theorem

FKS2.mid_row8_hi

Row-8 mid-range HI flank [e^9500, e^20000] - restricted envelope cover (cells with b' ≥ 9500, all above the gap band).

PrimeNumberTheoremAnd.IEANTN.FKS2Cor23Row8 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor23Row8.lean:80

theorem

FKS2.FloorButhe8.rhsE8_le_rowcurve

Open the record for the exact Lean statement and complete source.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor23Row8 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor23Row8.lean:141

theorem

FKS2.corollary_23_row8

Corollary 23, row 8 (A=121.107, B=3/2, C=2, x₀=1).

PrimeNumberTheoremAnd.IEANTN.FKS2Cor23Row8 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor23Row8.lean:176

lemma

FKS2.admissible_two_eq

admissible_bound A 2 C R x in terms of s = √(log x): = (A/R²)·s⁴·exp(−(C/√R)·s). The B = 2 analogue of admissible_three_halves_eq.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor23Row9 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor23Row9.lean:24

lemma

FKS2.rowcurve_dom_two

Generic B = 2 floor-curve domination: coeff·s⁴·exp(−rate·s) ≤ rowcurve when coeff ≤ A/R² and rate ≥ C/√R. s⁴ analogue of rowcurve_dom_three_halves.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor23Row9 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor23Row9.lean:49

theorem

FKS2.tail_row9

Row-9 tail [e^20000, ∞): cor14_tail gives Eπ ≤ admissible 121.107 (3/2) 2 R (a B=3/2, rate-2/√R curve), which DOMINATES the row-9 B=2 curve here because L^{3/2} ≤ (6.60/121.107·R^{1/2})·L² for s = √L ≥ 43.29 (and s ≥ 141 on this range).

PrimeNumberTheoremAnd.IEANTN.FKS2Cor23Row9 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor23Row9.lean:149

theorem

FKS2.Epi_le_xpow_half

Buthe bound in x^{-1/2} form (shared core for all Table-7 rows): from Buthe.theorem_2e/2f (valid x ∈ [2, 10^19]), Eπ x ≤ (1.95 + 3.9/log x + 19.5/(log x)²)·x^{-1/2} + 1.0452·(log x)/x.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24.lean:29

theorem

FKS2.corollary_24_all

FKS2 Corollary 24 (complete). Every Table-7 row (B, I) gives the pointwise bound Eπ x ≤ B x for all x with log x ∈ I.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24All · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24All.lean:31

theorem

FKS2.floor_row1

Row-1 Buthe floor [e^4, e^43] via floor_xhalf_of_check.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24Row1 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24Row1.lean:43

theorem

FKS2.corollary_24_row1

FKS2 Corollary 24, row 1 (table7 entry (x ↦ 2·log x·x^{-1/2}, Icc 1 57)): Eπ x ≤ 2·log x·x^{-1/2} whenever log x ∈ [1, 57]. For x > 0 this splits into the three segments above; for x < 0 (possible since log is even) the exponent -(1)/2 gives cos((-(1)/2)·π) = cos(-π/2) = 0, so x^{-1/2} = 0 and the RHS is 0, while Eπ x ≤ 0.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24Row1 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24Row1.lean:90

theorem

FKS2.floor_row10

Row-10 floor (Buthe) [e^4, e^10] via floor_xpow_of_check.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24Row10 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24Row10.lean:74

theorem

FKS2.corollary_24_row10

FKS2 Corollary 24, row 10 (table7 entry (x ↦ x^{-1/50}, Icc 1 1358.6)): Eπ x ≤ x^{-1/50} whenever log x ∈ [1, 1358.6]. For x > 0 this splits into the four segments above; for x ≤ 0 (possible since log is even) Eπ x ≤ 0 < x^{-1/50}.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24Row10 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24Row10.lean:121

theorem

FKS2.Table4Ext.cell_Epi_le_xpow

Transport: a checked cell dominated by the table value eps, with the per-cell numeric certificate eps ≤ exp(-b'/n), gives the row-n curve x^{-1/n} bound for on the whole cell [exp b, exp b'].

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24Row11 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24Row11.lean:48

theorem

FKS2.Table4Ext.checkXpowCell_sound

Soundness: a checked cell obeys eps ≤ exp(-b'/n).

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24Row11 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24Row11.lean:122

lemma

FKS2.Table4Ext.eval_expSplitNegXpow_eq_xpow

expSplitNegXpow n evaluated at s = √(log x) is exactly x^{-1/n} (for x > 0, log x ≥ 0).

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24Row11 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24Row11.lean:212

lemma

FKS2.Table4Ext.lhsE_sub_negxpow_supported

Support of lhsE - expSplitNegXpow n for the dyadic slab kernel.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24Row11 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24Row11.lean:228

theorem

FKS2.Table4Ext.Epi_le_evalLhsE_low

Buthe -upper-bound as eval_lhsE on the LOW range [2, e^10] (vs the committed FloorButhe.Epi_le_evalLhsE's [e^5, e^10]): identical reconciliation, only the hypothesis is 2 ≤ x. Curve-independent (FloorButhe.lhsE is the Buthe x^{-1/2} bound), so reusable by every x^{-1/n} row floor. Bottoms out at Buthe theorem_2e/2f + li.two_approx.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24Row11 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24Row11.lean:245

theorem

FKS2.Table4Ext.mid_xpow_of

Generic x^{-1/n} mid assembler: over the allCells prefix take k (chained from 10 to m, every cell passing the row-n checkXpowCell), Eπ ≤ x^{-1/n} on [e^10, e^m]. Uses cover_of_chainOk + cell_Epi_le_xpow_of_check + allCells_trusted. Row 11: k = 3746, m = 3756.

PrimeNumberTheoremAnd.IEANTN.FKS2Cor24Row11 · PrimeNumberTheoremAnd/IEANTN/FKS2Cor24Row11.lean:345

Static source extraction only. Package code was not executed. Every result keeps its complete declaration, exact file and line range, commit, toolchain, license file, and content hash.