Plain-language statement
For every , every sufficiently large real number has a prime in the short multiplicative interval .
Exact Lean statement
@[blueprint
(title := "prime-between")
(statement := /-- For every $\eps>0$, there is a prime between $x$ and $(1+\eps)x$ for
all sufficiently large $x$. -/)
(proof := /-- Use Corollary \ref{pi_alt} to show that $\pi((1+\eps)x) - \pi(x)$ goes to infinity
as $x \to \infty$. -/)
(latexEnv := "corollary")]
theorem prime_between {ε : ℝ} (hε : 0 < ε) :
∀ᶠ x : ℝ in atTop, ∃ p : ℕ, Nat.Prime p ∧ x < p ∧ p < (1 + ε) * xFormal artifact
Lean source
@[blueprint (title := "prime-between") (statement := /-- For every $\eps>0$, there is a prime between $x$ and $(1+\eps)x$ for all sufficiently large $x$. -/) (proof := /-- Use Corollary \ref{pi_alt} to show that $\pi((1+\eps)x) - \pi(x)$ goes to infinity as $x \to \infty$. -/) (latexEnv := "corollary")]theorem prime_between {ε : ℝ} (hε : 0 < ε) : ∀ᶠ x : ℝ in atTop, ∃ p : ℕ, Nat.Prime p ∧ x < p ∧ p < (1 + ε) * x := by have squeeze := tendsto_by_squeeze (ε/2) (by linarith) rw [Filter.tendsto_iff_forall_eventually_mem] at squeeze specialize squeeze (Set.Ici 1) (by exact Ici_mem_atTop 1) simp only [Set.mem_Ici, eventually_atTop] at squeeze obtain ⟨a, ha⟩ := squeeze rw [eventually_atTop] use (max a 1) intro b hb rw [sup_le_iff] at hb specialize ha b hb.1 have val_lt : (⌊b⌋₊.primeCounting : ℝ) < ⌊(1 + ε/2) * b⌋₊.primeCounting := by linarith norm_cast at val_lt have jump := prime_in_gap b ((1 + ε/2) * b) (by linarith) val_lt obtain ⟨p, hp, b_lt_p, p_le⟩ := jump have p_lt: p < (1 + ε) * b := by linarith use p- Project
- Prime Number Theorem and More
- License
- Apache-2.0
- Commit
- a93551347dce
- Source
- PrimeNumberTheoremAnd/Consequences.lean:1546-1573
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Admissible bound mono
admissible_bound.mono
Plain-language statement
For positive parameters , the classical error-bound function is nonincreasing once .
Source project: Prime Number Theorem and More
Person-level attribution pending.
Analytic On div Removable zero
AnalyticOn_divRemovable_zero
Plain-language statement
Let be analytic on an open set containing , and suppose . Define for and . Then the apparent singularity at is removable and is analytic throughout .
Source project: Prime Number Theorem and More
Person-level attribution pending.
Analytic On div Removable zero closed Ball
AnalyticOn_divRemovable_zero_closedBall
Plain-language statement
Suppose and is analytic on the closed disc with . Define for and . Then is analytic on the entire closed disc, including at the removed singularity.
Source project: Prime Number Theorem and More
Person-level attribution pending.