AutoSamplingTheory.TechnicalLemmas.Measure.ContinuousCostWeakLowerSemicontinuity
9 named declarations scanned from AutoSamplingTheory/TechnicalLemmas/Measure/ContinuousCostWeakLowerSemicontinuity.lean.
Declarations
def AutoSamplingTheory.TechnicalLemmas.Measure.ContinuousCostWeakLowerSemicontinuity.truncatedContinuousNNReal Partial Not mapped
- The level-`n` bounded continuous truncation of a nonnegative continuous function.
def truncatedContinuousNNReal
{X : Type*} [TopologicalSpace X]
(c : X → ℝ≥0) (hc : Continuous c) (n : ℕ) : X →ᵇ ℝ≥0 where
toFun := fun x => min (c x) (n : ℝ≥0)
continuous_toFun := hc.min continuous_const
map_bounded' := by
use (n : ℝ) + (n : ℝ)
intro x y
rw [NNReal.dist_eq]
apply (abs_sub _ _).trans
rw [NNReal.abs_eq, NNReal.abs_eq]
apply add_le_add <;>
· norm_cast
exact min_le_right _ _
@[simp]
AutoSamplingTheory/TechnicalLemmas/Measure/ContinuousCostWeakLowerSemicontinuity.lean:36published source at 0e31a3cda412
theorem AutoSamplingTheory.TechnicalLemmas.Measure.ContinuousCostWeakLowerSemicontinuity.truncatedContinuousNNReal_apply Partial Not mapped
No declaration docstring.
theorem truncatedContinuousNNReal_apply
{X : Type*} [TopologicalSpace X]
(c : X → ℝ≥0) (hc : Continuous c) (n : ℕ) (x : X) :
truncatedContinuousNNReal c hc n x = min (c x) (n : ℝ≥0) :=
rfl
/-- Natural truncations increase pointwise to the original finite nonnegative
value, viewed in `ENNReal`. -/
AutoSamplingTheory/TechnicalLemmas/Measure/ContinuousCostWeakLowerSemicontinuity.lean:52published source at 0e31a3cda412
theorem AutoSamplingTheory.TechnicalLemmas.Measure.ContinuousCostWeakLowerSemicontinuity.iSup_coe_min_nat_eq Partial Not mapped
- Natural truncations increase pointwise to the original finite nonnegative value, viewed in `ENNReal`.
theorem iSup_coe_min_nat_eq (r : ℝ≥0) :
(⨆ n : ℕ, (((min r (n : ℝ≥0) : ℝ≥0) : ℝ≥0∞))) = (r : ℝ≥0∞) := by
apply le_antisymm
· exact iSup_le fun n => ENNReal.coe_le_coe.2 (min_le_left _ _)
· obtain ⟨n, hn⟩ := exists_nat_ge r
calc
(r : ℝ≥0∞) = ((min r (n : ℝ≥0) : ℝ≥0) : ℝ≥0∞) := by
rw [min_eq_left hn]
_ ≤ ⨆ m : ℕ, ((min r (m : ℝ≥0) : ℝ≥0) : ℝ≥0∞) :=
le_iSup (fun m : ℕ => ((min r (m : ℝ≥0) : ℝ≥0) : ℝ≥0∞)) n
/-- Monotone convergence expresses an unbounded continuous nonnegative
integral as the supremum of its bounded continuous truncations. -/
AutoSamplingTheory/TechnicalLemmas/Measure/ContinuousCostWeakLowerSemicontinuity.lean:60published source at 0e31a3cda412
theorem AutoSamplingTheory.TechnicalLemmas.Measure.ContinuousCostWeakLowerSemicontinuity.lintegral_eq_iSup_truncated Partial Not mapped
- Monotone convergence expresses an unbounded continuous nonnegative integral as the supremum of its bounded continuous truncations.
theorem lintegral_eq_iSup_truncated
{X : Type*} [MeasurableSpace X] [TopologicalSpace X] [OpensMeasurableSpace X]
(c : X → ℝ≥0) (hc : Continuous c) (mu : ProbabilityMeasure X) :
(∫⁻ x, (c x : ℝ≥0∞) ∂(mu : Measure X)) =
⨆ n : ℕ,
∫⁻ x, ((truncatedContinuousNNReal c hc n x : ℝ≥0) : ℝ≥0∞)
∂(mu : Measure X) := by
have hmono : Monotone
(fun n : ℕ => fun x : X =>
((truncatedContinuousNNReal c hc n x : ℝ≥0) : ℝ≥0∞)) := by
intro n m hnm x
exact ENNReal.coe_le_coe.2 <|
min_le_min le_rfl (by exact_mod_cast hnm)
have hmeas : ∀ n : ℕ, Measurable
(fun x : X =>
((truncatedContinuousNNReal c hc n x : ℝ≥0) : ℝ≥0∞)) := by
intro n
exact ENNReal.continuous_coe.measurable.comp
(truncatedContinuousNNReal c hc n).continuous.measurable
rw [← MeasureTheory.lintegral_iSup hmeas hmono]
congr 1
funext x
exact (iSup_coe_min_nat_eq (c x)).symm
/-- Integration of any continuous `NNReal`-valued cost is lower
semicontinuous for weak convergence of probability measures. -/
AutoSamplingTheory/TechnicalLemmas/Measure/ContinuousCostWeakLowerSemicontinuity.lean:73published source at 0e31a3cda412
theorem AutoSamplingTheory.TechnicalLemmas.Measure.ContinuousCostWeakLowerSemicontinuity.lowerSemicontinuous_lintegral_continuous_nnreal Partial Not mapped
- Integration of any continuous `NNReal`-valued cost is lower semicontinuous for weak convergence of probability measures.
theorem lowerSemicontinuous_lintegral_continuous_nnreal
{X : Type*} [MeasurableSpace X] [TopologicalSpace X] [OpensMeasurableSpace X]
(c : X → ℝ≥0) (hc : Continuous c) :
LowerSemicontinuous
(fun mu : ProbabilityMeasure X =>
∫⁻ x, (c x : ℝ≥0∞) ∂(mu : Measure X)) := by
have hfun :
(fun mu : ProbabilityMeasure X =>
∫⁻ x, (c x : ℝ≥0∞) ∂(mu : Measure X)) =
(fun mu : ProbabilityMeasure X =>
⨆ n : ℕ,
∫⁻ x, ((truncatedContinuousNNReal c hc n x : ℝ≥0) : ℝ≥0∞)
∂(mu : Measure X)) := by
funext mu
exact lintegral_eq_iSup_truncated c hc mu
rw [hfun]
apply lowerSemicontinuous_iSup
intro n
exact
(ProbabilityMeasure.continuous_lintegral_boundedContinuousFunction
(truncatedContinuousNNReal c hc n)).lowerSemicontinuous
/-- The finite `NNReal` representative of the quadratic displacement cost. -/
AutoSamplingTheory/TechnicalLemmas/Measure/ContinuousCostWeakLowerSemicontinuity.lean:99published source at 0e31a3cda412
def AutoSamplingTheory.TechnicalLemmas.Measure.ContinuousCostWeakLowerSemicontinuity.quadraticCostNNReal Partial Not mapped
- The finite `NNReal` representative of the quadratic displacement cost.
def quadraticCostNNReal
{E : Type*} [NormedAddCommGroup E] : E × E → ℝ≥0 :=
fun z => ‖z.1 - z.2‖₊ ^ 2
/-- The `NNReal` quadratic cost is continuous. -/
AutoSamplingTheory/TechnicalLemmas/Measure/ContinuousCostWeakLowerSemicontinuity.lean:122published source at 0e31a3cda412
theorem AutoSamplingTheory.TechnicalLemmas.Measure.ContinuousCostWeakLowerSemicontinuity.continuous_quadraticCostNNReal Partial Not mapped
- The `NNReal` quadratic cost is continuous.
theorem continuous_quadraticCostNNReal
{E : Type*} [NormedAddCommGroup E] :
Continuous (quadraticCostNNReal (E := E)) := by
exact (continuous_nnnorm.comp (continuous_fst.sub continuous_snd)).pow 2
/-- The finite representative agrees exactly with Samplinglib's existing
extended nonnegative quadratic cost. -/
AutoSamplingTheory/TechnicalLemmas/Measure/ContinuousCostWeakLowerSemicontinuity.lean:127published source at 0e31a3cda412
theorem AutoSamplingTheory.TechnicalLemmas.Measure.ContinuousCostWeakLowerSemicontinuity.coe_quadraticCostNNReal Partial Not mapped
- The finite representative agrees exactly with Samplinglib's existing extended nonnegative quadratic cost.
theorem coe_quadraticCostNNReal
{E : Type*} [NormedAddCommGroup E] (z : E × E) :
((quadraticCostNNReal (E := E) z : ℝ≥0) : ℝ≥0∞) =
WassersteinSpace.quadraticCost (E := E) z := by
simp [quadraticCostNNReal, WassersteinSpace.quadraticCost,
ENNReal.ofReal_pow (norm_nonneg _), enorm_eq_nnnorm]
/-- The quadratic Kantorovich objective is lower semicontinuous on the weak
space of probability measures on `E × E`.
`SecondCountableTopology E` is the product-Borel bridge required by Mathlib's
weak probability-measure topology; it is not a moment or transport assumption. -/
AutoSamplingTheory/TechnicalLemmas/Measure/ContinuousCostWeakLowerSemicontinuity.lean:134published source at 0e31a3cda412
theorem AutoSamplingTheory.TechnicalLemmas.Measure.ContinuousCostWeakLowerSemicontinuity.lowerSemicontinuous_quadraticCostFunctional Partial Not mapped
- The quadratic Kantorovich objective is lower semicontinuous on the weak space of probability measures on `E × E`. `SecondCountableTopology E` is the product-Borel bridge required by Mathlib's weak probability-measure topology; it is not a moment or transport assumption.
theorem lowerSemicontinuous_quadraticCostFunctional
{E : Type*} [NormedAddCommGroup E]
[MeasurableSpace E] [BorelSpace E] [SecondCountableTopology E] :
LowerSemicontinuous
(fun gamma : ProbabilityMeasure (E × E) =>
∫⁻ z, WassersteinSpace.quadraticCost (E := E) z
∂(gamma : Measure (E × E))) := by
simpa only [← coe_quadraticCostNNReal] using
(lowerSemicontinuous_lintegral_continuous_nnreal
(quadraticCostNNReal (E := E)) continuous_quadraticCostNNReal)
end
end ContinuousCostWeakLowerSemicontinuity
end Measure
end TechnicalLemmas
end AutoSamplingTheory
AutoSamplingTheory/TechnicalLemmas/Measure/ContinuousCostWeakLowerSemicontinuity.lean:146published source at 0e31a3cda412