File size: 4,023 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 | 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
|