Truncated moments of regularly varying tails
TheoremAntitone bounded functions are interval integrable#✓fully proved
Antitone bounded functions are interval-integrable.
theorem intervalIntegrable_of_antitone_bdd {W : ℝ → ℝ} (hW : Antitone W)
(hWnn : ∀ t, 0 ≤ W t) (hWbdd : ∃ B, ∀ t, W t ≤ B) {a b : ℝ} (hab : a ≤ b) :
IntervalIntegrable W volume a b
Used by 1
TheoremLayer-cake formula for the first moment#✓fully proved
Layer-cake formula for the first moment on (0, a]: the integral of y
over (0, a] equals the integral of the right tail minus the endpoint
correction.
theorem layerCake_firstMoment {μ : Measure ℝ} [IsProbabilityMeasure μ] {a : ℝ} (ha : 0 ≤ a) :
∫ y in Set.Ioc 0 a, y ∂μ
= ∫ t in (0:ℝ)..a, (rightTail μ t - rightTail μ a)
def rightTail (μ : Measure ℝ) (x : ℝ) : ℝ := (μ (Set.Ioi x)).toReal
MathlibExt/Probability/RegularVariation.lean:209
Uses 1 · Used by 1
TheoremCorrected regularly-varying tail integral#✓fully proved
For a probability measure μ
on ℝ with regularly varying combined tail of index -α, 0 < α < 1, and
tail balance p, the first-moment tail integral satisfies
(∫ y in Ioc 0 (c * x), y ∂μ) / (x * combinedTail μ x) → p * α * c ^ (1 - α) / (1 - α).
theorem tailIntegral_tendsto {μ : Measure ℝ} [IsProbabilityMeasure μ] {α : ℝ}
(hα : 0 < α) (hα1 : α < 1) {p : ℝ} (hTB : HasTailBalance μ p)
(hRV : IsRegularlyVarying (combinedTail μ) (-α)) {c : ℝ} (hc : 0 < c) :
Tendsto (fun x => (∫ y in Set.Ioc 0 (c * x), y ∂μ) / (x * combinedTail μ x))
atTop (𝓝 (p * α * c ^ (1 - α) / (1 - α)))
def HasTailBalance (μ : Measure ℝ) [IsFiniteMeasure μ] (p : ℝ) : Prop :=
0 ≤ p ∧ p ≤ 1 ∧
(∀ᶠ x in atTop, 0 < combinedTail μ x) ∧
Tendsto (fun x => rightTail μ x / combinedTail μ x) atTop (𝓝 p)
MathlibExt/Probability/RegularVariation.lean:376
def IsRegularlyVarying (f : ℝ → ℝ) (ρ : ℝ) : Prop :=
∃ L : ℝ → ℝ, IsSlowlyVarying L ∧ ∀ᶠ x in atTop, f x = x ^ ρ * L x
MathlibExt/Probability/RegularVariation.lean:149
def combinedTail (μ : Measure ℝ) (x : ℝ) : ℝ := rightTail μ x + leftTail μ x
MathlibExt/Probability/RegularVariation.lean:218
Uses 13
DefinitionClosed upper tail of a measure#✓fully proved
The upper tail (μ {y | s ≤ |y|}).toReal.
noncomputable def tailGe (μ : Measure ℝ) (s : ℝ) : ℝ := (μ {y : ℝ | s ≤ |y|}).toReal
DefinitionStrict upper tail of a measure#✓fully proved
The lower tail (μ {y | s < |y|}).toReal.
noncomputable def tailGt (μ : Measure ℝ) (s : ℝ) : ℝ := (μ {y : ℝ | s < |y|}).toReal
TheoremStrict absolute tail equals the combined tail#✓fully proved
At nonnegative thresholds the strict absolute tail is the canonical combined tail.
theorem tailGt_eq_combinedTail (μ : Measure ℝ) [IsFiniteMeasure μ]
{s : ℝ} (hs : 0 ≤ s) : tailGt μ s = combinedTail μ s
noncomputable def tailGt (μ : Measure ℝ) (s : ℝ) : ℝ := (μ {y : ℝ | s < |y|}).toReal
MathlibExt/Probability/TruncatedMomentRV.lean:54
def combinedTail (μ : Measure ℝ) (x : ℝ) : ℝ := rightTail μ x + leftTail μ x
MathlibExt/Probability/RegularVariation.lean:218
Uses 4 · Used by 2
TheoremNon-strict absolute tail as combined tail plus endpoint atoms#✓fully proved
The non-strict absolute tail adds both endpoint atoms to the canonical strict tail.
theorem tailGe_eq_combinedTail_add_atoms (μ : Measure ℝ) [IsFiniteMeasure μ]
{s : ℝ} (hs : 0 < s) :
tailGe μ s = combinedTail μ s + (μ {s}).toReal + (μ {-s}).toReal
noncomputable def tailGe (μ : Measure ℝ) (s : ℝ) : ℝ := (μ {y : ℝ | s ≤ |y|}).toReal
MathlibExt/Probability/TruncatedMomentRV.lean:51
def combinedTail (μ : Measure ℝ) (x : ℝ) : ℝ := rightTail μ x + leftTail μ x
MathlibExt/Probability/RegularVariation.lean:218
Uses 4 · Used by 1
TheoremUpper tail is asymptotic to the combined tail#✓fully proved
The upper tail is asymptotically the combined tail.
theorem tailGe_ratio_tendsto {μ : Measure ℝ} [IsProbabilityMeasure μ] {α : ℝ}
(hα : 0 < α) (hRV : IsRegularlyVarying (combinedTail μ) (-α)) :
Tendsto (fun x => tailGe μ x / combinedTail μ x) atTop (𝓝 1)
def IsRegularlyVarying (f : ℝ → ℝ) (ρ : ℝ) : Prop :=
∃ L : ℝ → ℝ, IsSlowlyVarying L ∧ ∀ᶠ x in atTop, f x = x ^ ρ * L x
MathlibExt/Probability/RegularVariation.lean:149
def combinedTail (μ : Measure ℝ) (x : ℝ) : ℝ := rightTail μ x + leftTail μ x
MathlibExt/Probability/RegularVariation.lean:218
noncomputable def tailGe (μ : Measure ℝ) (s : ℝ) : ℝ := (μ {y : ℝ | s ≤ |y|}).toReal
MathlibExt/Probability/TruncatedMomentRV.lean:51
Uses 10 · Used by 1
TheoremLower tail is asymptotic to the combined tail#✓fully proved
The lower tail is asymptotically the combined tail.
theorem tailGt_ratio_tendsto {μ : Measure ℝ} [IsProbabilityMeasure μ] {α : ℝ}
(hRV : IsRegularlyVarying (combinedTail μ) (-α)) :
Tendsto (fun x => tailGt μ x / combinedTail μ x) atTop (𝓝 1)
def IsRegularlyVarying (f : ℝ → ℝ) (ρ : ℝ) : Prop :=
∃ L : ℝ → ℝ, IsSlowlyVarying L ∧ ∀ᶠ x in atTop, f x = x ^ ρ * L x
MathlibExt/Probability/RegularVariation.lean:149
def combinedTail (μ : Measure ℝ) (x : ℝ) : ℝ := rightTail μ x + leftTail μ x
MathlibExt/Probability/RegularVariation.lean:218
noncomputable def tailGt (μ : Measure ℝ) (s : ℝ) : ℝ := (μ {y : ℝ | s < |y|}).toReal
MathlibExt/Probability/TruncatedMomentRV.lean:54
Uses 5 · Used by 1
TheoremLayer-cake formula for the truncated second moment#✓fully proved
Layer-cake formula for the truncated second moment, in terms of the upper
tail tailGe. The term x ^ 2 * tailGt μ x removes the contribution
from points with |y| > x, which lie outside the closed truncation interval.
theorem layerCake {μ : Measure ℝ} [IsProbabilityMeasure μ] {x : ℝ} (hx : 0 ≤ x) :
∫ y in Set.Icc (-x) x, y ^ 2 ∂μ
= 2 * (∫ t in (0:ℝ)..x, t * tailGe μ t) - x ^ 2 * tailGt μ x
noncomputable def tailGe (μ : Measure ℝ) (s : ℝ) : ℝ := (μ {y : ℝ | s ≤ |y|}).toReal
MathlibExt/Probability/TruncatedMomentRV.lean:51
noncomputable def tailGt (μ : Measure ℝ) (s : ℝ) : ℝ := (μ {y : ℝ | s < |y|}).toReal
MathlibExt/Probability/TruncatedMomentRV.lean:54
Uses 2 · Used by 1
TheoremTruncated second moment asymptotic for regularly varying tails#✓fully proved
The corrected truncated-second-moment asymptotic: for a probability measure
on ℝ with regularly varying combined tail of index -α, 0 < α < 2, the
ratio (∫ y in Icc (-x) x, y ^ 2 ∂μ) / (x ^ 2 * combinedTail μ x) tends to
α / (2 - α).
Correction: v1/Atlas/TheoryOfProbability/code/RegularVariation.lean states
this with the constant 2 / (2 - α), which is wrong; the Pareto tail gives
α / (2 - α) (see the test file).
theorem truncatedMoment_tendsto {μ : Measure ℝ} [IsProbabilityMeasure μ] {α : ℝ}
(hα : 0 < α) (hα2 : α < 2)
(hRV : IsRegularlyVarying (combinedTail μ) (-α)) :
Tendsto (fun x => (∫ y in Set.Icc (-x) x, y ^ 2 ∂μ) / (x ^ 2 * combinedTail μ x))
atTop (𝓝 (α / (2 - α)))
def IsRegularlyVarying (f : ℝ → ℝ) (ρ : ℝ) : Prop :=
∃ L : ℝ → ℝ, IsSlowlyVarying L ∧ ∀ᶠ x in atTop, f x = x ^ ρ * L x
MathlibExt/Probability/RegularVariation.lean:149
def combinedTail (μ : Measure ℝ) (x : ℝ) : ℝ := rightTail μ x + leftTail μ x
MathlibExt/Probability/RegularVariation.lean:218
Uses 10
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.