An explicit Chebyshev lower bound for primes in a quarter interval
ProvedWikipedia.SzemeredisTheorem.chebyshev_expression_le_card_primesInQuarterIntervaladditive-combinatoricsgreen-tao-port-8822number-theory
For a natural , let be the primes in . Then
The quarter cutoff uses natural division.
Preamble
/- Mechanically transplanted from https://github.com/plby/lean-proofs.git at 8822f7ddef30fadbd92e1c6ab4ed897af356af5e. Original scopes and proof bytes are oracle-derived. -/ import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Primes_Chebyshev import Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics import Mathlib.NumberTheory.Chebyshev set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 open Wikipedia.SzemeredisTheorem open Finset Real open Filter Asymptotics
Formal statement
theorem Wikipedia.SzemeredisTheorem.chebyshev_expression_le_card_primesInQuarterInterval
{X : ℕ} (hX : 2 ≤ X) :
(((X : ℝ) * log 2 - log (X + 1) -
2 * √(X : ℝ) * log X) -
log 4 * (X / 4 : ℕ)) /
log X ≤
(#(primesInQuarterInterval X) : ℝ) := by sorry
Source