Sharp signed variation for simultaneous half-weight prime intersection masses
ProvedMasulloRH.half_weight_gram_prime_intersection_variationAssign each rational prime the half-weight mass . On a finite prime set , put . The target intersection masses on subsets are , , and for . Let be any real integrable densities of mass one, with possibly varying reference measures and measurable match events at every prime. Let be the signed mass of simultaneous matches at all primes in . Then
For exact data the left side is the minimum total variation and a finite atomic law attains it. Already , so an exact normalized signed fit at those two primes costs more than in total variation. If for every fixed nonempty finite , then . The result allows arbitrary dependence among the match events. The prescribed numbers are the input for the simultaneous indentation test in the rational principal pole component.
import Mathlib.Analysis.Complex.ExponentialBounds import Mathlib.Algebra.BigOperators.Option import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.NormNum import Mathlib.Tactic.Positivity import Mathlib.MeasureTheory.Integral.Bochner.Set import Mathlib.NumberTheory.SumPrimeReciprocals import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Data.Nat.Choose.Sum import Mathlib.Tactic.Linarith open Finset Filter open scoped BigOperators Topology Classical open MeasureTheory
theorem MasulloRH.half_weight_gram_prime_intersection_variation {Ω : Type*} [MeasurableSpace Ω] (μ : ℕ → Measure Ω)
(w : ℕ → Ω → ℝ) (E : ℕ → Ω → Set Nat.Primes)
(hw : ∀ n, Integrable (w n) (μ n)) (hn : ∀ n, ∫ x, w n x ∂μ n = 1)
(hE : ∀ n p, MeasurableSet {x | p ∈ E n x}) :
let h := fun p : Nat.Primes => (p : ℝ) * (Real.log (p : ℝ))^2 / ((p : ℝ)-1)^2
let W := fun P : Finset Nat.Primes => ∑ p ∈ P, h p
let obs := fun n (J : Finset Nat.Primes) =>
∫ x, (if (J : Set Nat.Primes) ⊆ E n x then w n x else 0) ∂μ n
let model := fun (P J : Finset Nat.Primes) => (if J = ∅ then 1 - W P else 0) +
∑ p ∈ P, if (J : Set Nat.Primes) ⊆ {p} then h p else 0
(∀ n P, |1 - W P| + W P ≤ (∫ x, |w n x| ∂μ n) +
2 * ∑ J ∈ P.powerset, |obs n J - model P J|) ∧
(37 / 20 < h ⟨2, Nat.prime_two⟩ + h ⟨3, Nat.prime_three⟩) ∧
(∀ P, ∃ (F : Finset (Option Nat.Primes)) (b : Option Nat.Primes → ℝ)
(A : Option Nat.Primes → Set Nat.Primes),
(∑ i ∈ F, b i) = 1 ∧
(∀ J : Finset Nat.Primes, (∑ i ∈ F, if (J : Set Nat.Primes) ⊆ A i then b i else 0) = model P J) ∧
(∑ i ∈ F, |b i|) = |1 - W P| + W P) ∧
((∀ p, Tendsto (fun n => obs n {p}) atTop (𝓝 (h p))) →
(∀ J, 2 ≤ J.card → Tendsto (fun n => obs n J) atTop (𝓝 0)) →
Tendsto (fun n => ∫ x, |w n x| ∂μ n) atTop atTop) := by sorry