Legend
- Boxes
- definitions
- Ellipses
- theorems and lemmas
- Blue border
- the statement of this result is ready to be formalized; all prerequisites are done
- Orange border
- the statement of this result is not ready to be formalized; the blueprint needs more work
- Blue background
- the proof of this result is ready to be formalized; all prerequisites are done
- Green border
- the statement of this result is formalized
- Green background
- the proof of this result is formalized
- Dark green background
- the proof of this result and all its ancestors are formalized
- Dark green border
- this is in Mathlib
Lemma
2.7boundary_compact_comparison
∀ {f : ℝ → ℝ},
Continuous f →
∀ {T : ℝ},
0 < T →
(∀ t > T, 0 ≤ f t) →
∀ (k : ℕ),
(∀ᶠ (h : ℝ) in nhdsWithin 0 (Set.Ioi 0),
MeasureTheory.IntegrableOn (fun t => f t * HardyZeta.normalizedHardyKernel k h t) (Set.Ioi 0)
MeasureTheory.volume) →
Filter.Tendsto (fun h => ∫ (t : ℝ) in Set.Ioi 0, f t * HardyZeta.normalizedHardyKernel k h t)
(nhdsWithin 0 (Set.Ioi 0)) (nhds 0) →
∫ (t : ℝ) in Set.Icc (2 * T) (2 * T + 1), f t * (t ^ 2 + 1 / 4) ^ k * Real.cosh (Real.pi / 4 * t) ≤
∫ (t : ℝ) in Set.Icc 0 T, |f t| * (t ^ 2 + 1 / 4) ^ k * Real.cosh (Real.pi / 4 * t)
Lemma
2.141integrable_difference_kernel
∀ {μ : MeasureTheory.Measure ℝ} {g : ℝ → ℝ} (h x : ℝ),
MeasureTheory.Integrable (fun t => g t * Real.cosh ((x + h) * t)) μ →
MeasureTheory.Integrable (fun t => g t * Real.cosh ((x - h) * t)) μ →
MeasureTheory.Integrable (fun t => g t * Real.cosh (x * t)) μ →
MeasureTheory.Integrable (fun t => g t * HardyZeta.differenceMultiplier h t * Real.cosh (x * t)) μ
Lemma
2.156integral_shifted_even_power
∀ {w : ℝ → ℝ} {μ : MeasureTheory.Measure ℝ} {a C : ℝ},
(∀ (n : ℕ), MeasureTheory.Integrable (fun t => t ^ (2 * n) * w t) μ) →
(∀ (n : ℕ), ∫ (t : ℝ), t ^ (2 * n) * w t ∂μ = C * (-a) ^ n) →
∀ (k : ℕ), ∫ (t : ℝ), (t ^ 2 + a) ^ k * w t ∂μ = C * (-a + a) ^ k
Lemma
2.157integral_shifted_even_power_eq_zero
∀ {w : ℝ → ℝ} {μ : MeasureTheory.Measure ℝ} {a C : ℝ},
(∀ (n : ℕ), MeasureTheory.Integrable (fun t => t ^ (2 * n) * w t) μ) →
(∀ (n : ℕ), ∫ (t : ℝ), t ^ (2 * n) * w t ∂μ = C * (-a) ^ n) →
∀ {k : ℕ}, k ≠ 0 → ∫ (t : ℝ), (t ^ 2 + a) ^ k * w t ∂μ = 0
Lemma
2.172modifiedDifference_integral
∀ {μ : MeasureTheory.Measure ℝ} (h x : ℝ) (f : ℝ → ℝ → ℝ),
MeasureTheory.Integrable (f (x + h)) μ →
MeasureTheory.Integrable (f (x - h)) μ →
MeasureTheory.Integrable (f x) μ →
HardyZeta.modifiedDifference h (fun y => ∫ (t : ℝ), f y t ∂μ) x =
∫ (t : ℝ), HardyZeta.modifiedDifference h (fun y => f y t) x ∂μ
Lemma
2.192normalizedHardyIntegral_eq
∀ (k : ℕ) (h : ℝ),
|Real.pi / 4 - (↑k + 1) * h| + ↑k * |h| < Real.pi / 4 →
∫ (t : ℝ) in Set.Ioi 0, HardyZeta.hardyWeight t * HardyZeta.normalizedHardyKernel k h t =
h⁻¹ ^ (2 * k) * (HardyZeta.modifiedDifference h)^[k] HardyZeta.hardyTransform (Real.pi / 4 - (↑k + 1) * h)
Lemma
2.204not_positive_tail_of_vanishing_differences
∀ {f : ℝ → ℝ},
Continuous f →
∀ {T : ℝ},
0 < T →
(∀ t > T, 0 < f t) →
(∀ (k : ℕ),
∀ᶠ (h : ℝ) in nhdsWithin 0 (Set.Ioi 0),
MeasureTheory.IntegrableOn (fun t => f t * HardyZeta.normalizedHardyKernel (k + 1) h t) (Set.Ioi 0)
MeasureTheory.volume) →
(∀ (k : ℕ),
Filter.Tendsto (fun h => ∫ (t : ℝ) in Set.Ioi 0, f t * HardyZeta.normalizedHardyKernel (k + 1) h t)
(nhdsWithin 0 (Set.Ioi 0)) (nhds 0)) →
False
Lemma
2.224tendsto_compact_normalizedHardyKernel
∀ {f : ℝ → ℝ},
Continuous f →
∀ (k : ℕ) (l r : ℝ),
Filter.Tendsto (fun h => ∫ (t : ℝ) in Set.Icc l r, f t * HardyZeta.normalizedHardyKernel k h t)
(nhdsWithin 0 (Set.Ioi 0))
(nhds (∫ (t : ℝ) in Set.Icc l r, f t * (t ^ 2 + 1 / 4) ^ k * Real.cosh (Real.pi / 4 * t)))
Lemma
2.226tendsto_integral_differenceKernel_Icc
∀ {g : ℝ → ℝ},
Continuous g →
∀ (a c l r : ℝ) (k : ℕ),
Filter.Tendsto
(fun h =>
∫ (t : ℝ) in Set.Icc l r,
g t * (HardyZeta.differenceMultiplier h t / h ^ 2) ^ k * Real.cosh ((a - c * h) * t))
(nhdsWithin 0 (Set.Ioi 0)) (nhds (∫ (t : ℝ) in Set.Icc l r, g t * (t ^ 2 + 1 / 4) ^ k * Real.cosh (a * t)))
Lemma
2.237tendsto_scaled_iterate_modifiedDifference
∀ {f : ℝ → ℝ} {a : ℝ} (n k : ℕ),
Filter.Tendsto (fun u => u⁻¹ ^ n * f (a - u)) (nhdsWithin 0 (Set.Ioi 0)) (nhds 0) →
∀ {c : ℝ},
↑k < c →
Filter.Tendsto (fun h => h⁻¹ ^ n * (HardyZeta.modifiedDifference h)^[k] f (a - c * h))
(nhdsWithin 0 (Set.Ioi 0)) (nhds 0)
Lemma
2.246tendsto_weighted_psi_cusp
∀ {ι : Type u_1} {l : Filter ι} {z : ι → ℂ} {c : ℝ},
0 < c →
∀ (s : ℝ),
Filter.Tendsto z l (nhds 0) →
(∀ᶠ (t : ι) in l, z t ≠ 0) →
(∀ᶠ (t : ι) in l, c * ‖z t‖ ≤ (z t).re) →
Filter.Tendsto (fun t => ‖z t‖⁻¹ ^ s * ‖1 / 2 + HardyZeta.psi (Complex.I + z t)‖) l (nhds 0)
Theorem
5.2Four Exponentials: DEFERRED
Prove FourExponentials.Conjecture after a successful Sharp Five proof. This work order is not a mathematical implication.
Theorem
5.1Sharp Five Exponentials: OPEN
Hardy is complete. Prove SharpFiveExponentials.Conjecture next. No proof is present.