OAI/NumberTheory/Ostmann/Arithmetic/BulkLogWeightedKernelPairComparison.lean

GitHub source file

2 declarations, 0 contain sorry, 0 declared as axioms

1. def OAI.Ostmann.bulkLogWeightedKernelPairBudget line 12
2. theorem OAI.Ostmann.PublishedProgressionInput.bulk_log_weighted_kernel_pair_prime_comparison line 21

   Source documentation

   The signed pair keeps every initial bulk log-sum factor. Its additional root and variation costs are explicit, and independent of the prime values.

   theorem PublishedProgressionInput.bulk_log_weighted_kernel_pair_prime_comparison (P : PublishedProgressionInput)
       {σ : Type*} (value : σ → ℝ) (i : σ) (childBound pivotBound : ℕ → ℕ)
       {n : ℕ} (T : Bool → MovingSlotData σ n) (hT : ∀ b, (T b).CompensationAbsent i)
       (L R : Polynomial ℝ) (ψ : 𝓢(ℝ, ℂ)) (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 e : ℕ) (hsize : ∀ b, (T b).SizeLE d) (hregular : ∀ b, (T b).RegularLengthLE r)
       (hL : L.natDegree ≤ e) (hR : R.natDegree ≤ e)
       {t : ℕ} (slots : Fin t → List σ) (cb Dlog : ℝ) (hDlog : 0 ≤ Dlog)
       (hloglip : ∀ x y, |logCellProfile x - logCellProfile y| ≤ Dlog * |x - y|)
   …

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