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 641 to 660 of 1,644 declarations.

lemma

Kadiri.zeroImagSquareTail_le_dyadic_inv_sq

Inside dyadic shell k, each height-square term is bounded by 2^(-2k).

PrimeNumberTheoremAnd.IEANTN.KadiriZeroCounting · PrimeNumberTheoremAnd/IEANTN/KadiriZeroCounting.lean:760

theorem

Kadiri.zetaCountingDyadic_abs_N_le_backlund_majorant

An RvM estimate with Backlund's constants gives the dyadic N(T) bound by the explicit majorant.

PrimeNumberTheoremAnd.IEANTN.KadiriZeroCounting · PrimeNumberTheoremAnd/IEANTN/KadiriZeroCounting.lean:834

lemma

Kadiri.log_dyadic_le_count_scale

The logarithm of a dyadic height is bounded by the dyadic count scale.

PrimeNumberTheoremAnd.IEANTN.KadiriZeroCounting · PrimeNumberTheoremAnd/IEANTN/KadiriZeroCounting.lean:857

lemma

Kadiri.log_dyadic_le_nat_succ

The logarithm of a dyadic height is bounded by its dyadic exponent.

PrimeNumberTheoremAnd.IEANTN.KadiriZeroCounting · PrimeNumberTheoremAnd/IEANTN/KadiriZeroCounting.lean:879

lemma

Kadiri.abs_log_dyadic_div_two_pi_le

Log size of the dyadic main-term denominator factor.

PrimeNumberTheoremAnd.IEANTN.KadiriZeroCounting · PrimeNumberTheoremAnd/IEANTN/KadiriZeroCounting.lean:901

lemma

Kadiri.abs_zetaCountingMainTerm_core_le

Triangle bound for the RvM main term after writing A = T/(2*pi).

PrimeNumberTheoremAnd.IEANTN.KadiriZeroCounting · PrimeNumberTheoremAnd/IEANTN/KadiriZeroCounting.lean:928

theorem

Kadiri.zetaCountingRvM_dyadic_le

The RvM error term has the dyadic growth needed by the zero-tail route.

PrimeNumberTheoremAnd.IEANTN.KadiriZeroCounting · PrimeNumberTheoremAnd/IEANTN/KadiriZeroCounting.lean:995

theorem

Kadiri.zeroImagDyadicCumulativeCountByNSource_of_positive_bridge

The remaining N(T) count source splits into two counting inputs once the finite-strip multiplicity comparison is proved: absolute-height reduction to positive-height zeros, and comparison of N' 0 T to the project N(T).

PrimeNumberTheoremAnd.IEANTN.KadiriZeroCounting · PrimeNumberTheoremAnd/IEANTN/KadiriZeroCounting.lean:1095

theorem

Kadiri.zeroImagDyadicNPrimeToNSource_of_order_summable

The N' 0 T comparison with N(T) is sum monotonicity over the rectangle inclusion, once the larger positive-height N(T) series is known summable.

PrimeNumberTheoremAnd.IEANTN.KadiriZeroCounting · PrimeNumberTheoremAnd/IEANTN/KadiriZeroCounting.lean:1306

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.