A uniform asymptotic Chebyshev bound in quarter intervals
ProvedWikipedia.SzemeredisTheorem.eventually_log_two_div_four_mul_div_log_le_cardadditive-combinatoricsgreen-tao-port-8822number-theory
For every sufficiently large natural , the number of primes in is at least
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.eventually_log_two_div_four_mul_div_log_le_card :
∀ᶠ X : ℕ in atTop,
log 2 / 4 * X / log X ≤
(#(primesInQuarterInterval X) : ℝ) := by sorry
Source