math / data /lean /OAI /Combinatorics /ContingencyTables /PublishedInputs.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.02 kB
import Mathlib.MeasureTheory.Integral.Bochner.Set
import Mathlib.MeasureTheory.Measure.Lebesgue.Basic
import Mathlib.MeasureTheory.Constructions.Pi
import Mathlib.Analysis.SpecialFunctions.Pow.Real
namespace OAI
/-!
# The published analytic input for result 200
PrΓ©kopa, *On logarithmic concave measures and functions*, Acta Sci. Math.
(Szeged) 34 (1973), 335–343, Theorem 3, equation (2.3), with two source
functions. Source: https://acta.bibl.u-szeged.hu/14411/1/math_034_335-343.pdf
The one-dimensional input is Leindler (1972), *On a certain converse of
HΓΆlder's inequality II*, 217–223, as identified in PrΓ©kopa's Β§2.
The finite-box specialization allows positive continuous functions on a
common compact coordinate box and finite unions of open boxes.
-/
namespace ContingencyTables.PublishedInputs
open MeasureTheory
abbrev Point (q : β„•) := Fin q β†’ ℝ
/-- The bounded finite unions of open coordinate boxes used by the bin
conductance argument. Empty unions and empty coordinate boxes are allowed. -/
def IsFiniteBoxUnion {q : β„•} (S : Set (Point q)) : Prop :=
βˆƒ (n : β„•) (lower upper : Fin n β†’ Point q),
S = {x | βˆƒ k : Fin n, βˆ€ i, lower k i < x i ∧ x i < upper k i}
/-- The weighted Minkowski interpolation with the manuscript convention. -/
def interpolate {q : β„•} (t : ℝ) (S T : Set (Point q)) : Set (Point q) :=
{z | βˆƒ x ∈ S, βˆƒ y ∈ T, z = (1 - t) β€’ x + t β€’ y}
/-- Precisely the previously published finite-box integral interpolation
input. The functions need only be positive and continuous on the common
compact coordinate box; all integrals are Lebesgue integrals. -/
def FiniteBoxPrekopaLeindler (q : β„•) : Prop :=
βˆ€ (t : ℝ), 0 < t β†’ t < 1 β†’
βˆ€ (lower upper : Point q) (Sβ‚€ S₁ Sβ‚‚ : Set (Point q))
(fβ‚€ f₁ fβ‚‚ : Point q β†’ ℝ),
IsFiniteBoxUnion Sβ‚€ β†’ IsFiniteBoxUnion S₁ β†’ IsFiniteBoxUnion Sβ‚‚ β†’
closure Sβ‚€ βŠ† Set.Icc lower upper β†’
closure S₁ βŠ† Set.Icc lower upper β†’
closure Sβ‚‚ βŠ† Set.Icc lower upper β†’
ContinuousOn fβ‚€ (Set.Icc lower upper) β†’
ContinuousOn f₁ (Set.Icc lower upper) β†’
ContinuousOn fβ‚‚ (Set.Icc lower upper) β†’
(βˆ€ x ∈ Set.Icc lower upper, 0 < fβ‚€ x) β†’
(βˆ€ x ∈ Set.Icc lower upper, 0 < f₁ x) β†’
(βˆ€ x ∈ Set.Icc lower upper, 0 < fβ‚‚ x) β†’
interpolate t S₁ Sβ‚‚ βŠ† Sβ‚€ β†’
(βˆ€ x ∈ S₁, βˆ€ y ∈ Sβ‚‚,
(f₁ x) ^ (1 - t) * (fβ‚‚ y) ^ t ≀ fβ‚€ ((1 - t) β€’ x + t β€’ y)) β†’
(∫ x in S₁, f₁ x) ^ (1 - t) * (∫ y in Sβ‚‚, fβ‚‚ y) ^ t ≀
∫ z in Sβ‚€, fβ‚€ z
/-- Log-concavity is needed only on the common ambient box. -/
def LogConcaveOn {q : β„•} (ρ : Point q β†’ ℝ) (K : Set (Point q)) : Prop :=
βˆ€ x ∈ K, βˆ€ y ∈ K, βˆ€ t : ℝ, 0 < t β†’ t < 1 β†’
(ρ x) ^ (1 - t) * (ρ y) ^ t ≀ ρ ((1 - t) β€’ x + t β€’ y)
/-- Specialization of the published input to the one log-concave density
used for bin conductance. The geometric hypotheses specify the common ambient box. -/
theorem density_interpolation {q : β„•} (hPL : FiniteBoxPrekopaLeindler q)
(t : ℝ) (ht : 0 < t) (ht1 : t < 1)
(lower upper : Point q) (S T : Set (Point q)) (ρ : Point q β†’ ℝ)
(hS : IsFiniteBoxUnion S) (hT : IsFiniteBoxUnion T)
(hM : IsFiniteBoxUnion (interpolate t S T))
(hSc : closure S βŠ† Set.Icc lower upper)
(hTc : closure T βŠ† Set.Icc lower upper)
(hMc : closure (interpolate t S T) βŠ† Set.Icc lower upper)
(hρ : ContinuousOn ρ (Set.Icc lower upper))
(hpos : βˆ€ x ∈ Set.Icc lower upper, 0 < ρ x)
(hlc : LogConcaveOn ρ (Set.Icc lower upper)) :
(∫ x in S, ρ x) ^ (1 - t) * (∫ y in T, ρ y) ^ t ≀
∫ z in interpolate t S T, ρ z := by
apply hPL t ht ht1 lower upper (interpolate t S T) S T ρ ρ ρ
hM hS hT hMc hSc hTc hρ hρ hρ hpos hpos hpos Set.Subset.rfl
intro x hx y hy
exact hlc x (hSc (subset_closure hx)) y (hTc (subset_closure hy)) t ht ht1
end ContingencyTables.PublishedInputs
end OAI