Measurable Partition By Local-Slope Bands
ProvedFunctionalInequalities.Energy.LocalSlope.exists_partition_readableThis theorem constructs a measurable partition adapted to the local slope of a globally Lipschitz function.
Let be a second-countable Borel measurable normed additive group, let be globally -Lipschitz with , and let be represented by NNReal. Then there exist sets and constants , indexed by , such that
- every is measurable;
- the sets are pairwise disjoint and cover ;
- for every ;
- is -Lipschitz on ;
- for every ,
The Lean declaration is exists_partition_readable. The local slope and the final comparison are expressed in ENNReal, while , , and are nonnegative real constants represented by NNReal. This is a technical partition lemma used in patching arguments.
Original Lean declaration header
Within namespace FunctionalInequalities.Energy.LocalSlope. Shown in its original module context. Proof omitted.
theorem exists_partition {f : V → ℝ} {L : ℝ≥0} (hf : LipschitzWith L f) {α : ℝ≥0} (hα : 0 < α) :
∃ (D : ℕ → Set V) (c : ℕ → ℝ≥0),
(∀ i, MeasurableSet (D i)) ∧ Pairwise (Function.onFun Disjoint D) ∧
(⋃ i, D i) = Set.univ ∧ (∀ i, c i ≤ L + α) ∧
(∀ i, LipschitzOnWith (c i) f (D i)) ∧
(∀ i, ∀ x ∈ D i, ((c i : ℝ≥0∞)) ≤ apply f x + (α : ℝ≥0∞))
Module navigation
Module: Energy/Euclidean/Slope/Density.
Definition modules: Energy/LocalSlope/Basic.
Supporting theorems: lowerSemicontinuous_secant.
Previous: exists_patch_of_isCompact · Next: exists_patch.
Source excerpt, lines 567–572 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_Energy_Euclidean_Slope_Density
open scoped ENNReal NNReal ContDiff
universe u
variable {V : Type u} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [CompleteSpace V]
[MeasurableSpace V] [BorelSpace V] [SecondCountableTopology V] [FiniteDimensional ℝ V]
omit [InnerProductSpace ℝ V] [CompleteSpace V] [FiniteDimensional ℝ V]
theorem FunctionalInequalities.Energy.LocalSlope.exists_partition_readable {f : V → ℝ} {L : ℝ≥0} (hf : LipschitzWith L f) {α : ℝ≥0} (hα : 0 < α) :
∃ (D : ℕ → Set V) (c : ℕ → ℝ≥0),
(∀ i, MeasurableSet (D i)) ∧ Pairwise (Function.onFun Disjoint D) ∧
(⋃ i, D i) = Set.univ ∧ (∀ i, c i ≤ L + α) ∧
(∀ i, LipschitzOnWith (c i) f (D i)) ∧
(∀ i, ∀ x ∈ D i, ((c i : ℝ≥0∞)) ≤ apply f x + (α : ℝ≥0∞)) := by sorry