OAI/NumberTheory/Ostmann/Arithmetic/BulkLogPairComparison.lean

GitHub source file

3 declarations, 0 contain sorry, 0 declared as axioms

1. def OAI.Ostmann.bulkLogSmoothPairFunction line 13
2. theorem OAI.Ostmann.PublishedProgressionInput.bulk_log_pair_slice_comparison line 26
3. theorem OAI.Ostmann.PublishedProgressionInput.bulk_log_pair_joint_comparison line 82

   Source documentation

   The original conjugate pair is compared jointly, retaining every Page correction. The only mass side condition is a finite reciprocal-prime sum.

   theorem PublishedProgressionInput.bulk_log_pair_joint_comparison
       (P : PublishedProgressionInput) {σ : Type*} [Fintype σ]
       (base : σ → ℝ) (order : List σ) (horder : order.Nodup)
       {n : ℕ} (T : Bool → MovingSlotData σ n) (hT : ∀ b i, i ∈ order → (T b).CompensationAbsent i)
       (i₀ : σ) (hi₀ : i₀ ∈ order) (ψ : 𝓢(ℝ, ℂ)) (X lo hi V : ℝ)
       (hlo : 1 ≤ lo) (hhi : lo ≤ hi) (hV : ∀ b, (T b).Frequencies (fun s => |(s : ℝ)| ≤ V))
       (φ : ℝ → ℝ) (G : ℕ → ℝ) (B D : ℝ) (hB : 0 ≤ B) (hD : 0 ≤ D)
       (hφ : ∀ x, |φ x| ≤ B) (hlip : ∀ x y, |φ x - φ y| ≤ D * |x - y|)
       (hout : ∀ x, 1 ≤ |x| → φ x = 0)
       (d r : ℕ) (hsize : ∀ b, (T b).SizeLE d) (hregular : ∀ b, (T b).RegularLengthLE r) (L R : ℝ)
       (Q : ℕ) (hQ : 2 ≤ Q) (q a : σ → ℕ) (u v : σ → ℝ)
       (hu : ∀ i, 1 ≤ u i) (hq : ∀ i ∈ order, 1 ≤ q i)
   …

   Mentions: OAI.Ostmann.PublishedProgressionInput, OAI.Ostmann.MovingSlotData