Documentation

Copula.RandomVariable.Invariance

← Copula mathematical handbook

Invariance of the copula under monotone transformations #

Nelsen, An Introduction to Copulas, second edition, Theorems 2.4.3 and 2.4.4.

Let μ be a law on Fin d → ℝ with continuous marginal CDFs and let each coordinate be transformed by a strictly monotone function f i. If s is the set of coordinates with strictly decreasing f i, then the transformed law again has continuous marginal CDFs and its copula is the copula of μ reflected in the coordinates of s (ofContinuousMarginals_map_coordMap).

For d = 2 this gives the classical statements: two increasing transformations leave the copula unchanged, one decreasing transformation reflects the corresponding coordinate, and two decreasing transformations produce the survival copula.

def ProbabilityTheory.Copula.coordMap {d : ℕ} (f : Fin d → ℝ → ℝ) (x : Fin d → ℝ) :
Fin d → ℝ

Apply the function f i to the i-th coordinate of a real vector.

Equations
Instances For
    @[simp]
    theorem ProbabilityTheory.Copula.coordMap_apply {d : ℕ} (f : Fin d → ℝ → ℝ) (x : Fin d → ℝ) (i : Fin d) :
    coordMap f x i = f i (x i)
    theorem ProbabilityTheory.Copula.measurable_coordMap {d : ℕ} {f : Fin d → ℝ → ℝ} (hf : ∀ (i : Fin d), Measurable (f i)) :

    Coordinatewise application of measurable maps is measurable.

    theorem ProbabilityTheory.Copula.measurable_fn_of_strict {d : ℕ} {s : Finset (Fin d)} {f : Fin d → ℝ → ℝ} (hinc : ∀ i ∉ s, StrictMono (f i)) (hdec : ∀ i ∈ s, StrictAnti (f i)) (i : Fin d) :

    Strictly monotone functions, of either direction, are measurable.

    For an atomless probability measure, m [x, ∞) = 1 - m (-∞, x].

    theorem ProbabilityTheory.Copula.marginal_map_coordMap {d : ℕ} (μ : MeasureTheory.ProbabilityMeasure (Fin d → ℝ)) {f : Fin d → ℝ → ℝ} (hf : ∀ (i : Fin d), Measurable (f i)) (i : Fin d) :

    The marginals of a coordinatewise transformed law are the transformed marginals.

    theorem ProbabilityTheory.Copula.cdf_marginal_map_coordMap_of_strictMono {d : ℕ} (μ : MeasureTheory.ProbabilityMeasure (Fin d → ℝ)) {f : Fin d → ℝ → ℝ} (hf : ∀ (i : Fin d), Measurable (f i)) {i : Fin d} (hi : StrictMono (f i)) (x : ℝ) :
    theorem ProbabilityTheory.Copula.cdf_marginal_map_coordMap_of_strictAnti {d : ℕ} (μ : MeasureTheory.ProbabilityMeasure (Fin d → ℝ)) {f : Fin d → ℝ → ℝ} (hf : ∀ (i : Fin d), Measurable (f i)) {i : Fin d} (hi : StrictAnti (f i)) (hc : Continuous ↑(ProbabilityTheory.cdf (marginal μ i))) (x : ℝ) :
    ↑(ProbabilityTheory.cdf (marginal (μ.map (coordMap f)) i)) (f i x) = 1 - ↑(ProbabilityTheory.cdf (marginal μ i)) x
    theorem ProbabilityTheory.Copula.continuous_cdf_marginal_map_coordMap {d : ℕ} (μ : MeasureTheory.ProbabilityMeasure (Fin d → ℝ)) (hc : ∀ (i : Fin d), Continuous ↑(ProbabilityTheory.cdf (marginal μ i))) {f : Fin d → ℝ → ℝ} {s : Finset (Fin d)} (hinc : ∀ i ∉ s, StrictMono (f i)) (hdec : ∀ i ∈ s, StrictAnti (f i)) (i : Fin d) :

    Transforming every coordinate by a strictly monotone function keeps the marginal CDFs continuous, because an injective map sends an atomless law to an atomless law.

    theorem ProbabilityTheory.Copula.marginalTransform_coordMap {d : ℕ} (μ : MeasureTheory.ProbabilityMeasure (Fin d → ℝ)) (hc : ∀ (i : Fin d), Continuous ↑(ProbabilityTheory.cdf (marginal μ i))) {f : Fin d → ℝ → ℝ} {s : Finset (Fin d)} (hinc : ∀ i ∉ s, StrictMono (f i)) (hdec : ∀ i ∈ s, StrictAnti (f i)) (x : Fin d → ℝ) :

    The coordinatewise transform of the marginal CDFs of the image law is the reflection of the transform of the original law.

    theorem ProbabilityTheory.Copula.ofContinuousMarginals_map_coordMap {d : ℕ} (μ : MeasureTheory.ProbabilityMeasure (Fin d → ℝ)) (hc : ∀ (i : Fin d), Continuous ↑(ProbabilityTheory.cdf (marginal μ i))) {f : Fin d → ℝ → ℝ} {s : Finset (Fin d)} (hinc : ∀ i ∉ s, StrictMono (f i)) (hdec : ∀ i ∈ s, StrictAnti (f i)) :

    Nelsen, Theorems 2.4.3 and 2.4.4 (any dimension). Applying strictly increasing maps to the coordinates outside s and strictly decreasing maps to the coordinates in s replaces the copula by its reflection in the coordinates of s.

    theorem ProbabilityTheory.Copula.isSklarCopula_map_coordMap {d : ℕ} {μ : MeasureTheory.ProbabilityMeasure (Fin d → ℝ)} (hc : ∀ (i : Fin d), Continuous ↑(ProbabilityTheory.cdf (marginal μ i))) {f : Fin d → ℝ → ℝ} {s : Finset (Fin d)} (hinc : ∀ i ∉ s, StrictMono (f i)) (hdec : ∀ i ∈ s, StrictAnti (f i)) {C : Copula d} (hC : IsSklarCopula μ C) :

    Any Sklar copula of μ reflected in s is a Sklar copula of the transformed law.

    theorem ProbabilityTheory.Copula.eq_reflect_of_isSklarCopula_map_coordMap {d : ℕ} {μ : MeasureTheory.ProbabilityMeasure (Fin d → ℝ)} (hc : ∀ (i : Fin d), Continuous ↑(ProbabilityTheory.cdf (marginal μ i))) {f : Fin d → ℝ → ℝ} {s : Finset (Fin d)} (hinc : ∀ i ∉ s, StrictMono (f i)) (hdec : ∀ i ∈ s, StrictAnti (f i)) {C D : Copula d} (hC : IsSklarCopula μ C) (hD : IsSklarCopula (μ.map (coordMap f)) D) :
    D = C.reflect s

    The Sklar copula of the transformed law is the reflected copula of the original law.

    The bivariate statements #

    theorem ProbabilityTheory.Copula.isSklarCopula_map_strictMono_two {μ : MeasureTheory.ProbabilityMeasure (Fin 2 → ℝ)} (hc : ∀ (i : Fin 2), Continuous ↑(ProbabilityTheory.cdf (marginal μ i))) {C : Copula 2} (hC : IsSklarCopula μ C) {α β : ℝ → ℝ} (hα : StrictMono α) (hβ : StrictMono β) :

    Nelsen, Theorem 2.4.3. Strictly increasing transformations of both coordinates leave the Sklar copula unchanged.

    Nelsen, Theorem 2.4.4 (first case). A strictly increasing map of the first coordinate and a strictly decreasing map of the second coordinate reflect the second copula coordinate.

    Nelsen, Theorem 2.4.4 (second case). A strictly decreasing map of the first coordinate and a strictly increasing map of the second coordinate reflect the first copula coordinate.

    Nelsen, Theorem 2.4.4 (survival case). Strictly decreasing transformations of both coordinates turn the Sklar copula into the survival copula.