The lower footrule-beta boundary and the complete pairwise region #
The lower seed of Proposition 3.2 is constructed by reflection of a centered ordinal sum. No shuffle formula or assumed coefficient values are required.
theorem
ProbabilityTheory.Copula.RankRegion.TauFootruleBeta.diagonal_beta_lower
(C : Copula 2)
(t : ↑unitInterval)
:
Equations
- One or more equations did not get rendered due to their size.
Instances For
noncomputable def
ProbabilityTheory.Copula.RankRegion.TauFootruleBeta.lowerSeed
(α : ↑unitInterval)
:
Copula 2
Equations
- One or more equations did not get rendered due to their size.
Instances For
noncomputable def
ProbabilityTheory.Copula.RankRegion.TauFootruleBeta.footruleBetaLower
(b : ℝ)
(hb : b ∈ Set.Icc (-1) 1)
:
Copula 2
Equations
Instances For
theorem
ProbabilityTheory.Copula.RankRegion.TauFootruleBeta.footruleBetaLower_coefficients
(b : ℝ)
(hb : b ∈ Set.Icc (-1) 1)
:
(footruleBetaLower b hb).kendallTau = (1 + b) ^ 2 / 4 - 1 ∧ (footruleBetaLower b hb).spearmanFootrule = 3 / 16 * (1 + b) ^ 2 - 1 / 2 ∧ (footruleBetaLower b hb).blomqvistBeta = b
theorem
ProbabilityTheory.Copula.RankRegion.TauFootruleBeta.minimal_footrule_at_beta
(b : ℝ)
(hb : b ∈ Set.Icc (-1) 1)
:
∃ (D : Copula 2),
D.blomqvistBeta = b ∧ D.spearmanFootrule = 3 / 16 * (1 + b) ^ 2 - 1 / 2 ∧ ∀ (C : Copula 2), C.blomqvistBeta = b → D.spearmanFootrule ≤ C.spearmanFootrule