Journal of Statistical Distributions and Applications

Journal of Statistical Distributions and Applications Cover Image
Methodology
Open Access

A closed-form universal trivariate pair-copula

Journal of Statistical Distributions and Applications20141:7

https://doi.org/10.1186/2195-5832-1-7

©  Hürlimann; licensee Springer. 2014

Received: 4 April 2013

Accepted: 27 June 2013

Published: 11 June 2014

Abstract

Based on the trivariate pair-copula construction for the bivariate linear circular copula by Perlman and Wellner (Symmetry 3:574-99, 2011) and the Theorem of Carathéodory, which states that any valid correlation matrix is a finite convex combination of extreme correlation matrices, we generate a class of closed-form analytical 3-universal copulas. We derive explicit product and lifting copula formulas for the set of all extremal correlation matrices. Our analytical proof makes use of a novel set of conditional copula inequalities, which are of independent interest.

MSC 2010

60E15; 62E15; 62H05; 62H20

Keywords

Pair-copula Trivariate universality Linear circular copula Elliptical copula Extremal correlation Product copula Lifting copula Conditional product copula inequalities

1 Introduction

In practice, the joint normal transform method for dependence modelling, which consists of transforming the margins to normal distributions, induce a dependence structure and transform back, is rather popular (e.g. Kurowicka and Cooke (2006), Section 4.2). Applied to a random vector (X1, X2, …, X n ) with invertible continuous marginal distributions (F1, F2, …, F n ) this method follows three steps:
  1. 1)

    Specify the rank correlation matrix r = (r ij ),  1 ≤ i, j ≤ n, of this random vector, i.e. r ij  = Cov[F i (X i ), F j (X j )],  1 ≤ i, j ≤ n.

     
  2. 2)

    A random sample (Y 1, Y 2, …, Y n ) is drawn from a joint normal distribution with standard normal margins and the specified rank correlation matrix r = (r ij ).

     
  3. 3)

    Let Φ(x) denote the standard normal distribution. The random sample (X 1, X 2, …, X n ) with margins (F 1, F 2, …, F n ) and the rank correlation matrix r = (r ij ) is obtained from the inverse probability transform through X 1 , X 2 , … , X n = ( F 1 − 1 Φ Y 1 , F 2 − 1 Φ Y 2 , … , F n − 1 Φ Y n .

     

From a theoretical point of view this procedure suffers from several drawbacks. Concerning (1), it is known that every 3-dimensional valid correlation matrix can be realized as a rank correlation matrix, i.e. there exists a trivariate uniform distribution with this rank correlation structure, the so-called 3-universality property of copulas. This result is first stated in Joe (1997), Exercise 4.17, pp. 137–138. Kurowicka and Cooke (2006), Section 4.4.6, p.102, produce such trivariate copulas using the pair-copula construction for the so-called “elliptical copula” (see also Kurowicka and Cooke (2001)). Another recent proof is Devroye and Letac (2010). However, it is not yet known whether copulas are n -universal for n ≥ 6 (see Letac (2010) for n < 6). Therefore (1) is in general not necessarily consistent. The statement (2) causes similar difficulties. Indeed, the compatibility conditions under which a joint normal distribution with a specified rank correlation matrix exist, imply that for any n ≥ 3 there are compatibility counterexamples (see Hürlimann (2012a), Theorem 3.1 and Corollary 4.2). Moreover, the probability of incompatibility increases with the dimension (e.g. Kurowicka and Cooke (2001)), Section 4, Table 1, Ghosh and Henderson (2002), and Ghosh (2004), Figure 3.1, p. 67). On the other hand, the 3-universality of the elliptical pair-copula construction does not extend to the fourvariate case (e.g. Kurowicka and Cooke (2006), Example 4.9). Therefore, to enable a rigorous use of any valid rank correlation matrix, there is a need for a more comprehensive understanding of the class of universal copulas, at least in small dimensions.

In the present paper we offer an analytical approach to the pair-copula construction for the bivariate linear circular copula derived by Perlman and Wellner (2011), whose density obviously coincides with the “elliptical copula” introduced by Kurowicka et al. (2000). To the best of our knowledge Section 5 presents for the first time simple closed-form analytical 3-universal copula formulas. The possible extension to the multivariate case is a challenging topic for future research (see Section 6). A more detailed account of the content follows.

Section 2 recalls the trivariate pair-copula construction. We explain how the combined use of extremal correlation matrices and bivariate elliptical copulas lead to extremal lifting copulas whose bivariate product copula margins induce sharp bounds in the concordance order. The latter include the set of all feasible rank correlation matrices. Advocating the Theorem of Carathéodory, which states that any valid correlation matrix can be written as a finite convex combination of extreme correlation matrices, the generation of 3-universal copulas follows. Section 3 summarizes the needed bivariate linear circular copula formulas. Section 4 presents the analytical closed-form product copula formulas, and Section 5 states our main result about analytical 3-universal copulas. Section 6 contains a simple two-dimensional algorithm for generating random vectors with 3-universal linear circular copula, and many references to potential applications are provided. Detailed proofs follow in the Appendices 1 and 2.

2 Trivariate linear circular pair-copula construction

In response to the difficulties encountered with the multivariate normal copula, the pair-copula construction of multivariate copulas has become more and more popular as can be seen from the recent review by Czado (2010). The first pair-copula construction is due to Joe (1996), see also Joe (1997), Section 4.5. His construction is given in terms of distribution functions, while Bedford and Cooke (2001) Bedford and Cooke (2002) expressed these constructions in terms of densities, and Kurowicka and Cooke (2006), Section 6.4, designed various sampling algorithms for them. A trivariate restatement of these equivalent representations will play a major role.

As observed by Devroye and Letac (2010), any valid rank correlation matrix can be written as a finite convex combination of extreme correlation matrices, also called extreme points (Theorem of Carathéodory (1911) and Steinitz (1914)). By linearity it suffices to restrict the attention to the pair-copula construction for extreme points. This way a finite algorithm that permits the construction of 3-universal copulas in terms of the linear circular copula can be designed. The proposed approach is then made fully analytical in Section 3 through the derivation of simple closed-form analytical 3-universal copula formulas for the extreme points.

Recall the structure of the extreme points for the set of all positive semi-definite 3×3 correlation matrices. They have necessarily rank 1 or 2 and take the form (Ycart(1985), Corollary, p. 611):
ρ = ρ a , b , c = ρ ij = 1 cos c cos b cos c 1 cos a cos b cos a 1 , a + b + c ≡ 0 mod 2 π .
(2.1)
One notes that there are four extreme points of rank one, namely
a , b , c ∈ 0 , 0 , 0 , 0 , π , π , π , 0 , π , π , π , 0
(2.2)
and the rank two extreme points are characterized by the condition
sin a , sin b , sin c ≠ 0 , 0 , 0
(2.3)

The following immediate consequence is crucial.

Lemma 2.1

The absolute value of the partial correlation of a 3×3 extreme correlation matrix of the form (2.1) is always one. More precisely, one has
ρ 12 ; 3 = ρ 12 − ρ 13 ρ 23 1 − ρ 13 2 ⋅ 1 − ρ 13 2 = − sgn sin a ⋅ sin b = ± 1
(2.4)

Proof

Since a + b + c ≡ 0  mod  2π we have from the cosine addition law that cos c = cos(−(a + b) = cos(a + b) = cos a ⋅ cos b − sin a ⋅ sin b. Inserted in the defining relation for the partial correlation coefficient we get ρ 12 ; 3 = − sin a ⋅ sin b sin a ⋅ sin b , which implies (2.4). ◊

Now, in a first step, let us assume that all joint, marginal and conditional distributions are absolutely continuous, and that the corresponding densities exist. Let (X1, X2, X3) be a trivariate random vector from the Fréchet space F(F13, F23) of all trivariate distributions with given bivariate margins F13(x1, x3), F23(x2, x3). Denote the marginal distributions by F1(x1), F2(x2), F3(x3), the conditional distributions obtained from F13, F23 by F1|3(x1|x3), F2|3(x2|x3), and the marginal densities by f1(x1), f2(x2), f3(x3). Let C13(u1, u3), C23(u2, u3), respectively C12|3(u1, u2), be copulas associated to the random vectors (X1, X3), (X2, X3), respectively to the conditional random vector (X1, X2|X3), which necessarily exist by the Theorem of Sklar (1959). The mixture of conditional distributions defined by (e.g. Joe (1997), equation (4.37))
F 123 x 1 , x 2 , x 3 = ∫ − ∞ x 3 C 12 3 F 1 3 x 1 z 3 , F 2 3 x 2 z 3 d F 3 z 3 = ∫ − ∞ x 3 C 12 3 ∂ C 13 F 1 x 1 , F 3 z 3 ∂ u 3 , ∂ C 23 F 2 x 2 , F 3 z 3 ∂ u 3 f 3 z 3 d z 3 ,
(2.5)
is a proper trivariate distribution in F(F13, F23). In terms of densities, the joint trivariate density corresponding to (2.5), if it exists, reads (e.g. Czado (2010) Section 2)
f 123 x 1 , x 2 , x 3 = c 13 ( F 1 x 1 , F 3 ( x 3 ) ) c 23 ( F 2 ( x 2 ) , F 3 ( x 3 ) ) c 12 3 ( F 1 3 ( x 1 x 3 ) , F 2 3 ( x 2 x 3 ) ) f 1 ( x 1 ) f 2 ( x 2 ) f 3 ( x 3 ) ,
(2.6)

where c13(u1, u3), c23(u2, u3), c12|3(u1, u2) are the copula densities of C13(u1, u3), C23(u2, u3), C12|3(u1, u2).

As we are looking for universal trivariate copulas we focus on uniform [0,1] marginal distributions and copulas for bivariate marginal and bivariate conditional distributions. Let (X1, X2, X3) be a trivariate random vector with uniform [0,1] margins. A random sampling algorithm for the simulation of (X1, X2, X3) corresponding to (2.5) reads (e.g. Kurowicka and Cooke (2006), equation (6.2)):
X 3 = U 3 , X 2 = F 2 3 − 1 U 2 U 3 , X 1 = F 1 3 − 1 F 12 3 ; U 2 − 1 U 1 U 3
(2.7)

where U1, U2, U3 are independent uniform [0,1] random variables, F 1 3 − 1 x 1 x 3 , F 2 3 − 1 x 2 x 3 are the inverse cumulative distributions of F1|3(x1|x3), F2|3(x2|x3), and F 12 3 ; U 2 − 1 x 1 denotes the inverse cumulative distribution for X1 given U2 under the conditional copula C12|3(u1, u2).

Kurowicka and Cooke (2006), Section 4.4.6, p.102, generate universal trivariate copulas with arbitrary valid rank correlation matrices using the sampling algorithm (2.7) based on the so-called “elliptical copula” for the involved copulas C13(u1, u3), C23(u2, u3), C12|3(u1, u2).

However, it seems that no attempt has been made so far to translate this Monte Carlo simulation procedure into closed-form analytical copula formulas. For this, it is appropriate to restate the representation (2.5) for the trivariate copula C(u1, u2, u3) associated to the uniform random vector (X1, X2, X3) as follows:
C u 1 , u 2 , u 3 = ∫ 0 u 3 C 12 3 ∂ ∂ t C 13 u 1 , t , ∂ ∂ t C 23 u 2 , t dt
(2.8)
It is important to remark that (2.8) is a special case of the following more general trivariate copula construction. Let A(u, v),  B(u, v) be two bivariate copulas, and let C = {C t (u, v),  t ∈ [0, 1]} be a family of bivariate copulas. Then, the mapping A ∗  C B  :  [0, 1]3 → [0, 1], defined by
A ∗ C B u 1 , u 2 , u 3 = ∫ 0 u 3 C t ∂ ∂ t A u 1 , t , ∂ ∂ t B u 2 , t dt
(2.9)
yields a trivariate copula, called the C-lifting of the copulas A and B (Durante et al. (2007a), Proposition 3.2). The bivariate copula margins of the trivariate copula (2.9) are (A ∗  C B)(u1, u2),  A(u1, u3),  B(u2, u3), where the bivariate copula
A ∗ C B u 1 , u 2 = ∫ 0 1 C t ∂ ∂ t A u 1 , t , ∂ ∂ t B u 2 , t dt
(2.10)

is called the C-product of the copulas A and B (see Durante et al. (2007b) for details). Clearly, the special instance (2.8) is obtained for the (constant) conditional copula family C t (u, v) ≡ C12|3(u, v),  t ∈ [0, 1].

Specializing further to bivariate elliptical copulas and extremal correlation matrices with the property ρ12;3 = ± 1 (see Lemma 2.1), and finite convex combinations from these copulas, we claim that it suffices to consider the following two types of C-lifting copulas (2.8):
C + u 1 , u 2 , u 3 = ∫ 0 u 3 min ∂ ∂ t C 13 u 1 , t , ∂ ∂ t C 23 u 2 , t dt , if ρ 12 ; 3 = 1 , C − u 1 , u 2 , u 3 = ∫ 0 u 3 max ∂ ∂ t C 13 u 1 , t + ∂ ∂ t C 23 u 2 , t − 1 , 0 dt , if ρ 12 ; 3 = − 1 ,
(2.11)
where C13(u1, u3), C23(u2, u3) are bivariate elliptical copulas with correlation parameters r13 = ρ13,  r23 = ρ23. Indeed, choosing the Hoeffding-Fréchet bounds as conditional copulas C12|3(u1, u2) = M(u1, u2) = min{u1, u2}, resp. C12|3(u1, u2) = W(u1, u2) = max{u1 + u2 − 1, 0}, corresponds to choosing the bivariate conditional elliptical copula for the extreme conditional correlations r12|3 = ± 1 (note that the bivariate copula is a comprehensive family, which realizes any correlation value in the interval (−1, 1)). But, for these elliptical copula choices, the conditional correlation is constant and coincides with the partial correlation (e.g. Kurowicka and Cooke (2006), Proposition 3.19, p.44). In particular, we have r12|3 = ± 1  ⇔  ρ12;3 = ± 1, which shows that the construction (2.11) realizes the extremal correlation matrices with the property
ρ 12 = ρ 13 ρ 23 ± 1 − ρ 13 2 ⋅ 1 − ρ 13 2
(2.12)
In particular, this means that the correlations of the product copulas C+(u1, u2) = (C13 ∗  M C23)(u1, u2),  C−(u1, u2) = (C13 ∗  W C23)(u1, u2) coincide with (2.12). Moreover, according to Durante et al. (2007a), Corollary 4.1, we have for all bivariate copulas C12 that are compatible with C13, C23 the sharp bounds in the concordance order:
C − u 1 , u 2 ≤ C 12 u 1 , u 2 ≤ C + u 1 , u 2
(2.13)

But ρ13,  ρ23 ∈ [−1, 1] are arbitrary and the correlation ρ12 of C12 in (2.12) varies between the two extreme bounds (2.12), hence all rank correlation matrices are feasible (see also the special case n = 3 of Theorem 3.1 in Hürlimann (2012b)). The extreme lifting copulas (2.11) together with appropriate finite convex combinations generate a class of 3-universal copulas. In the next Sections, we show that the product and lifting copulas satisfy closed-form analytical expressions.

For reasons of symmetry it is more appropriate to work with uniform [−1,1] random margins. Then a copula is defined on the centred cube C n  = [−1, 1] n ,  n ≥ 2, with uniform [−1,1] margins. In this setting and new notation, the lifting copulas (2.11) read:
C + x , y , z = ∫ − 1 z min ∂ ∂ t C 13 x , t , ∂ ∂ t C 23 y , t dt , C − x , y , z = ∫ − 1 z max ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 , 0 dt , ( x , y , z ) ∈ C 3 .
(2.14)
In a first step, we compute the bivariate product copulas with extremal correlations (2.12), i.e.
C + x , y = ∫ − 1 1 min ∂ ∂ t C 13 x , t , ∂ ∂ t C 23 y , t dt , C − x , y = ∫ − 1 1 max ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 , 0 dt , ( x , y ) ∈ C 2 .
(2.15)

For this we need the explicit formulas of the bivariate linear circular copula, which are summarized in the Section 3.

3 The bivariate linear circular copula

Starting point is the unique circular symmetric distribution on the unit disk B2 in R2 with uniform [−1,1] margins. The associated so-called circular copula on C2 is given by (Perlman and Wellner (2011), Theorem 3.1):
C u , v = 1 4 u + v + 1 + γ 0 u , v , γ 0 u , v = α 0 u , v , u 2 + v 2 < 1 , β 0 u , v , u 2 + v 2 ≥ 1 ,
(3.1)
With
α 0 u , v = 1 2 π ⋅ u ⋅ arcsin v 1 − u 2 + v ⋅ arcsin u 1 − v 2 − arcsin uv 1 − u 2 1 − v 2 , β 0 u , v = sgn ( uv ) ⋅ 1 4 ( u + v − 1 ) .
(3.2)
Taking partial derivatives one obtains the corresponding copula density
c u , v = 1 2 π 1 − u 2 − v 2 , u , v ∈ B 2 .
(3.3)
To obtain from this a one-parameter comprehensive family of copulas, let (U, V) ~ c(u, v) be the unique circular symmetric random vector on B2. For each angle φ ∈ − π 2 , π 2 , set r = sin(φ) ∈ (−1, 1), and consider the linear transformed random vector (X, Y r ) defined by
X = U , Y r = r ⋅ U + 1 − r 2 ⋅ V
(3.4)
which by circular symmetry generates a copula on C2. The support of (X, Y r ) is the ellipse
E r = x , y x 2 + y 2 − 2 rxy < 1 − r 2
(3.5)
Clearly, the correlation coefficient (that is equal to the rank correlation) of the random pair (X, Y r ) is r ∈ (−1, 1). The corresponding comprehensive one-parameter family of linear circular copulas has the explicit representation (Perlman and Wellner (2011), Theorem 5.1):
C r x , y = 1 4 x + y + 1 + γ r x , y , γ r x , y = α r x , y , ( x , y ) ∈ E r , β r x , y , ( x , y ) ∈ C 2 \ E r
(3.6)
with
α r x , y = 1 2 π ⋅ x ⋅ arcsin y − rx 1 − r 2 1 − x 2 + y ⋅ arcsin x − ry 1 − r 2 1 − y 2 − arcsin xy − r 1 − x 2 1 − y 2 ,
(3.7)
and
β r x , y = 1 4 x + y − 1 , ( x , y ) ∈ L 1 ( r ) : = ( C 2 \ E r ) ∩ x + y ≥ 1 + r 1 4 x − y + 1 , ( x , y ) ∈ L 2 ( r ) : = ( C 2 \ E r ) ∩ y − x ≥ 1 − r 1 4 − x − y − 1 , ( x , y ) ∈ L 3 ( r ) : = ( C 2 \ E r ) ∩ x + y ≤ − 1 − r 1 4 y − x + 1 , ( x , y ) ∈ L 4 ( r ) : = ( C 2 \ E r ) ∩ y − x ≤ − 1 + r
(3.8)
It is important to remark that the copula density coincides with the “elliptical copula” density introduced in Kurowicka et al. (2000) and extensively used in the book by Kurowicka and Cooke (2006). It is given by (Perlman and Wellner (2011), Proposition 5.1):
c r x , y = 1 2 π 1 − r 2 1 − x 2 − y − rx 2 ⋅ 1 E r x , y , x , y ∈ C 2 .
(3.9)

Since this family is obtained through linear transformation of the unique circular copula it is natural to use the name “linear circular copula”. This new terminology clearly distinguishes it from the ubiquitous class of “elliptical copulas” that is generated by the multivariate elliptical distributions in any dimension. A further reason is that Perlman and Wellner (2011), Section 6, consider the possibility to generate non-linear circular copulas and provide an example.

For later use in Section 4, we also need expressions for the conditional linear circular copulas, i.e. the partial derivatives with respect to the arguments. For this, we first rewrite (3.6) for the outer part C2 \ E r of the ellipse as follows:
C r x , y = 1 2 x + y , ( x , y ) ∈ L 1 ( r ) 1 2 x + 1 , ( x , y ) ∈ L 2 ( r ) 0 , x , y ∈ L 3 ( r ) 1 4 y + 1 , ( x , y ) ∈ L 4 ( r )
(3.10)
Through partial derivation we obtain the following formula
∂ C r x , y ∂ y = 1 4 + 1 2 π arcsin x − ry 1 − r 2 1 − y 2 , x , y ∈ E r 1 2 , x , y ∈ L 1 ( r ) ∪ L 4 ( r ) 0 , x , y ∈ L 2 ( r ) ∪ L 3 ( r )
(3.11)

4 Analytical product copula formulas

Using the explicit formulas (3.6)-(3.8) for the linear circular copula, it is now possible to derive simple analytical expressions for the extreme linear circular product copulas (2.15). Given are extreme correlation coefficients ρ 13 , ρ 23 , ρ 12 ± such that ρ 12 ± = ρ 13 ρ 23 ± 1 − ρ 13 2 ⋅ 1 − ρ 23 2 , ρ13, ρ23 ∈ [−1, 1]. Consider the linear circular copulas C 13 x , y = C r 12 x , y , C 23 x , y = C r 23 x , y obtained from (3.6) by setting r13 = ρ13,  r23 = ρ23. The abbreviations a = 1 − ρ 13 2 , b = 1 − ρ 23 2 , c± = ρ23a ∓ bρ13 are used throughout. Without loss of generality we assume that a ≥ b.

Proposition 4.1

The upper extreme linear circular product copula C + x , y = ∫ − 1 1 min ∂ ∂ t C 13 x , t , ∂ ∂ t C 23 y , t dt , x , y ∈ C 2 satisfies the following analytical representation:

Case I: c+ = r23a − br13 ≥ 0
I . a C + x , y = 1 2 ( x + 1 ) , ay − bx ≥ c + , I . b C + x , y = 1 2 ( y + 1 ) + C 13 ( x , ay − bx c + ) − C 23 ( y , ay − bx c + ) , − c + < ay − bx < c + , I . c C + x , y = 1 2 ( y + 1 ) , ay − bx ≤ − c + .
(4.1)
Case II: c+ = r23a − br13 < 0
II . a C + x , y = 1 2 ( x + 1 ) , ay − bx ≥ − c + , II . b C + x , y = 1 2 ( x + 1 ) − C 13 ( x , ay − bx c + ) + C 23 ( y , ay − bx c + ) , c + < ay − bx < − c + , II . c C + x , y = 1 2 ( y + 1 ) , ay − bx ≤ c + .
(4.2)

The special case c+ = 0 occurs exactly when ρ 13 = ρ 23 ∈ − 1 , 1 , ρ 12 + = 1 , and (4.1) reduces to the formula C + x , y = 1 2 x + 1 , y ≥ x , C + x , y = 1 2 y + 1 , y ≤ x .

Proposition 4.2

The lower extreme linear circular product copula C − x , y = ∫ − 1 1 max ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 , 0 dt , x , y ∈ C 2 , satisfies the following analytical representation:The special case c− = 0 occurs exactly when ρ 23 = − ρ 13 ∈ − 1 , 1 , ρ 12 − = − 1 , and (4.3) reduces to the formula C − x , y = 1 2 x + y , x + y ≥ 0 , C − x , y = 0 , x + y ≤ 0 .

Case I: c− = r23a + br13 ≥ 0
I . a C − x , y = 1 2 ( x + y ) , ay + bx ≥ c − , I . b C − x , y = C 13 ( x , ay + bx c − ) + C 23 ( y , ay + bx c − ) − 1 2 ( 1 + ay + bx c − ) , − c − < ay + bx < c − , I . c C − x , y = 0 , ay + bx ≤ − c − .
(4.3)
Case II: c− = r23a + br13 < 0
II . a C − x , y = 1 2 ( x + y ) , ay + bx ≥ − c − , II . b C − x , y = 1 2 ( x + y + 1 + ay + bx c − ) − C 13 ( x , ay + bx c − ) − C 23 ( y , ay + bx c − ) , c − < ay + bx < − c − , II . c C − x , y = 0 , ay + bx ≤ c − .
(4.4)

Remark 4.1

It has been stated after equation (2.12) that the (rank) correlations of the extreme linear circular product copulas coincide with ρ 12 ± . The obtained formulas (4.1)-(4.4) can be verified indirectly by showing that the rank correlations of these copulas are the right ones, i.e.
ρ 12 ± = 3 ⋅ ∫ − 1 1 ∫ − 1 1 C ± x , y dxdy − 3
(4.5)

This can be done through analytical calculation or numerical integral computation (the latter based on a computer algebra system, e.g. MATHCAD from MathSoft, Inc.). In fact, before conjectural statement and mathematical proof, we have first checked the simple case c± = 0, for which ρ 12 ± = ± 1 , and have verified numerically the formulas (4.5) in the general case.

A direct analytical proof of the obtained formulas is based on a set of (firstly conjectured) conditional copula inequalities, which are of independent interest, and are proved in detail in Appendix 1 and 2. These inequalities are also of primordial importance in Section 5.

Theorem 4.1

(Upper conditional product copula or UPC inequalities) In the above notations the following inequalities hold for all x, y, t ∈ [−1, 1]:

Case (I.a), ay − bx ≥ c+:
∂ ∂ t C 13 x , t ≤ ∂ ∂ t C 23 y , t
Case (I.b), − c+ < ay − bx < c+:
∂ ∂ t C 13 x , t ≤ ∂ ∂ t C 23 ( y , t ) , − 1 ≤ t ≤ ay − bx c + , ∂ ∂ t C 13 x , t ≥ ∂ ∂ t C 23 ( y , t ) , ay − bx c + ≤ t ≤ 1
Case (I.c), ay − bx ≤ − c+:
∂ ∂ t C 13 x , t ≥ ∂ ∂ t C 23 y , t
Case (II.a), ay − bx ≥ − c+:
∂ ∂ t C 13 x , t ≤ ∂ ∂ t C 23 y , t
Case (II.b), c+ < ay − bx < − c+:
∂ ∂ t C 13 x , t ≥ ∂ ∂ t C 23 ( y , t ) , − 1 ≤ t ≤ ay − bx c + , ∂ ∂ t C 13 x , t ≤ ∂ ∂ t C 23 ( y , t ) , ay − bx c + ≤ t ≤ 1
Case (II.c), ay − bx ≤ c+:
∂ ∂ t C 13 x , t ≥ ∂ ∂ t C 23 y , t

Theorem 4.2

(Lower conditional product copula or LPC inequalities) In the above notations the following inequalities hold for all x, y, t ∈ [−1, 1]:

Case (I.a), ay + bx ≥ c−:
∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≥ 0
Case (I.b), − c− < ay + bx < c−:
∂ ∂ t C 13 x , t + ∂ ∂ t C 23 ( y , t ) − 1 2 ≥ 0 , − 1 ≤ t ≤ ay + bx c − , ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 ( y , t ) − 1 2 ≤ 0 , ay + bx c − ≤ t ≤ 1
Case (I.c), ay + bx ≤ − c−:
∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≤ 0
Case (II.a), ay + bx ≥ − c−:
∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≥ 0
Case (II.b), c− < ay + bx < − c−:
∂ ∂ t C 13 x , t + ∂ ∂ t C 23 ( y , t ) − 1 2 ≥ 0 , ay + bx c − ≤ t ≤ 1 , ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 ( y , t ) − 1 2 ≤ 0 , − 1 ≤ t ≤ ay + bx c −
Case (II.c), ay + bx ≤ c−:
∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≤ 0

Proof of the Propositions 4.1 and 4.2

Inserting the inequalities from Theorem 4.1 (4.2) case by case into the upper (lower) product copula (2.15) shows the desired formulas. ◊

5 Analytical closed-form 3-universal copulas

Based on the relevant conditional copula inequalities provided in the Theorems 4.1 and 4.2, we derive first analytical closed-form expressions for the extreme linear circular lifting copulas (2.14). We use the same notations, abbreviations and assumptions as in the preceding Section.

Theorem 5.1

The upper extreme linear circular lifting copula (2.14) satisfies the following analytical representation:

Case I: c+ = r23a − br13 ≥ 0
I . a C + x , y , z = C 13 ( x , z ) , ay − bx ≥ c + , I . b C + x , y , z = C 13 ( x , ay − bx c + ) + C 23 ( y , z ) − C 23 ( y , ay − bx c + ) , z > ay − bx c + > − 1 , C + x , y , z = C 13 ( x , z ) , z ≤ ay − bx c + < 1 , I . c C + x , y = C 23 ( y , z ) , ay − bx ≤ − c + .
(5.1)
Case II: c+ = r23a − br13 < 0
II . a C + x , y , z = C 13 ( x , z ) , ay − bx ≥ − c + , II . b C + x , y , z = C 13 ( x , z ) − C 13 ( x , ay − bx c + ) + C 23 ( y , ay − bx c + ) , z > ay − bx c + > − 1 , C + x , y , z = C 23 ( y , z ) , z ≤ ay − bx c + < 1 , II . c C + x , y , z = C 23 ( y , z ) , ay − bx ≤ c + .
(5.2)

The special case c+ = 0 occurs exactly when r = ρ 13 = ρ 23 ∈ − 1 , 1 , ρ 12 + = 1 , and (5.1) reduces to the formula C+(x, y, z) = C r (x, z),  y ≥ x,  C+(x, y, z) = C r (y, z),  y ≤ x.

Theorem 5.2

The lower extreme linear circular lifting copula (2.14) satisfies the following analytical representation:

Case I: c− = r23a + br13 ≥ 0
I . a C − x , y , z = C 13 ( x , z ) + C 23 ( y , z ) − 1 2 ( 1 + z ) , ay + bx ≥ c − , I . b C − x , y , z = C 13 ( x , min { ay + bx c − , z } ) + C 23 ( y , min { ay + bx c − , z } ) − 1 2 ( 1 + min ay + bx c − , z ) , − c − < ay + bx < c − , I . c C − x , y , z = 0 , ay + bx ≤ − c − .
(5.3)
Case II: c− = r23a + br13 < 0
II . a C − x , y , z = C 13 ( x , z ) + C 23 ( y , z ) − 1 2 ( 1 + z ) , ay + bx ≥ − c − , II . b C − x , y , z = C 13 ( x , z ) − C 13 ( x , ay + bx c − ) + C 23 ( y , z ) − C 23 ( y , ay + bx c − ) , z > ay + bx c − > − 1 , C − x , y , z = 0 , z ≤ ay + bx c − < 1 , II . c C − x , y , z = 0 , ay + bx ≤ c − .
(5.4)

The special case c− = 0 occurs exactly when ρ 13 = ρ 23 = 0 , ρ 12 − = − 1 , and (5.3) reduces to the formula C − x , y , z = C 0 x , z + C 0 y , z − 1 2 1 + z , x + y ≥ 0 , C − x , y , z = 0 , x + y ≤ 0 .

Proof of the Theorems 5.1 and 5.2

Inserting the inequalities from Theorem 4.1 (4.2) case by case into the upper (lower) lifting copula (2.14) shows the desired formulas. ◊

By the Theorem of Carathéodory, the obtained results show the existence of a 3-universal linear circular based copula. However, instead of linearly combining four extreme points (Carathéodory’s result), two such points suffice here, as shown in the next main result. Recall that the linear circular lifting copulas C±(x, y, z) belong to the extreme points ρ ± = ρ 13 , ρ 23 , ρ 12 ± .

Theorem 5.3

(3-universal linear circular copula) Let ρ = (ρ13, ρ23, ρ12) belong to an arbitrary 3×3 positive semi-definite rank correlation matrix. Then, the following 3-copula is universal:
C ρ x , y , z = λ − C − ( x , y , z ) + λ + C + ( x , y , z ) , ( x , y , z ) ∈ C 3 , λ − = 1 2 ρ 12 + − ρ 12 1 − ρ 13 2 ⋅ 1 − ρ 23 2 ≥ 0 , λ + = 1 2 ρ 12 − ρ 12 − 1 − ρ 13 2 ⋅ 1 − ρ 23 2 ≥ 0 , λ − + λ + = 1 .

Proof

This follows from the preceding results by noting that ρ = λ−ρ− + λ+ρ+. ◊

6 Applications and conclusions

As an immediate statistical application, we show that the sampling algorithm for trivariate canonical vine copulas (Kurowicka and Cooke (2006), Section 6.4.2) reduces to a two-dimensional simulation algorithm for the uniform [0,1] random vectors X ± = X 1 ± , X 2 ± , X 3 ± with lower and upper extreme linear circular lifting copulas C±(u, v, w), (u, v, w) ∈  [0, 1]3. Invoking Theorem 5.3, this yields below a simple two-dimensional algorithm for generating random vectors X = (X1, X2, X3) with 3-universal linear circular copula. To show this, one needs some regression properties of the linear circular copula of Section 3.

Proposition 6.1

(Kurowicka and Cooke (2006), Proposition 3.18) Let U,  V be uniform [0,1] random variables joined by the linear circular copula with correlation ρ.

Then one has
E V U = 1 2 1 − ρ + ρU
(6.1)
Var V U = 1 2 1 − ρ 2 U 1 − U
(6.2)
F V U v u = 1 2 + 1 π arcsin v − ρu − 1 2 1 − ρ 1 − ρ 2 u 1 − u , u , v ∈ 0 , 1
(6.3)
F V U − 1 ξ u = 1 2 1 − ρ + ρu + 1 − ρ 2 u 1 − u ⋅ sin πξ − π 2 , u , ξ ∈ 0 , 1
(6.4)

Of further relevance is the following result, which states that conditional correlations are constant and equal to partial correlations for the linear circular copula.

Proposition 6.2

Kurowicka and Cooke (2006), Proposition 3.19) Let U1,  U2,  U3 be uniform [0,1] random variables, and let U1,  U2 and U2,  U3 be joined by the linear circular copula with correlations ρ12 and ρ13 respectively. Assume that the conditional copula for U2,  U3 given U1 does not depend on U1. Then, the conditional correlation ρ23|1 = ρ(U2|U1, U3|U1) is constant in U1 and ρ 23 1 = ρ 23 ; 1 = ρ 23 − ρ 12 ρ 13 1 − ρ 12 2 ⋅ 1 − ρ 23 2 .

Now, let U1,  U2,  U3 be uniform [0,1] random variables. To generate a random vector X = (X1, X2, X3) with valid rank correlation matrix ρ = (ρ13, ρ23, ρ12), one uses the general sampling algorithm by Kurowicka and Cooke (2006), Section 6.4.2, which in the linear circular copula case reads as follows (use equation (6.4)):
X 1 = U 1 , X 2 = F ρ 12 ; U 1 − 1 U 2 = 1 2 ( 1 − ρ 12 ) + ρ 12 U 1 + 1 − ρ 12 2 U 1 1 − U 1 ⋅ sin ( π U 2 − π 2 ) , X 3 = F ρ 13 ; U 1 − 1 ( F ρ 23 1 ; U 2 − 1 U 3 ) = 1 2 ( 1 − ρ 13 ) + ρ 13 U 1 + 1 − ρ 13 2 U 1 1 − U 1 ⋅ sin ( π F ρ 23 1 ; U 2 − 1 ( U 3 ) − π 2 ) , F ρ 23 1 ; U 2 − 1 U 3 = 1 2 ( 1 − ρ 23 1 ) + ρ 23 1 U 2 + 1 − ρ 23 1 2 U 2 1 − U 2 ⋅ sin ( π U 3 − π 2 ) .

For the extreme points ρ ± = ρ 13 , ρ 23 ± , ρ 12 with ρ 23 ± = ρ 12 ρ 13 ± 1 − ρ 12 2 ⋅ 1 − ρ 13 2 one has ρ 23 1 ± = ρ 23 ; 1 ± = ± 1 by Proposition 6.2 (see also Kurowicka and Cooke (2006), p.102). To generate uniform [0,1] random vectors X ± = X 1 ± , X 2 ± , X 3 ± with correlation matrices ρ±, one uses two times the preceding equations. In case ρ 23 1 + = 1 one has F ρ 23 1 + ; U 2 − 1 U 3 = U 2 , and in case ρ 23 1 − = − 1 one has F ρ 23 1 − ; U 2 − 1 U 3 = 1 − U 2 .

It follows that
X 1 ± = U 1 , X 2 ± = 1 2 1 − ρ 12 + ρ 12 U 1 + 1 − ρ 12 2 U 1 1 − U 1 ⋅ sin ( π U 2 − π 2 ) , X 3 ± = 1 2 1 − ρ 13 + ρ 13 U 1 ± 1 − ρ 13 2 U 1 1 − U 1 ⋅ sin ( π U 2 − π 2 ) .
(6.5)

Theorem 6.1

Let U1,  U2 be uniform [0,1] random variables, and let ρ = (ρ13, ρ23, ρ12) be a valid rank correlation matrix. Then, the sampling procedure
X 1 = U 1 , X 2 = 1 2 1 − ρ 12 + ρ 12 U 1 + 1 − ρ 12 2 U 1 1 − U 1 ⋅ sin ( π U 2 − π 2 ) , X 3 = 1 2 1 − ρ 13 + ρ 13 U 1 + ρ 23 ; 1 1 − ρ 13 2 U 1 1 − U 1 ⋅ sin ( π U 2 − π 2 ) ,
(6.6)

generates a random vector with 3-universal linear circular copula that has correlation matrix ρ.

Proof

With a permutation of indices, one has by Theorem 5.3 that X = λ−X− + λ+X+, with
λ − = 1 2 ρ 23 + − ρ 23 1 − ρ 12 2 ⋅ 1 − ρ 13 2 ≥ 0 , λ + = 1 2 ρ 23 − ρ 23 − 1 − ρ 12 2 ⋅ 1 − ρ 13 2 ≥ 0 , λ − + λ + = 1 .

The result follows by combining the equations (6.5) noting that λ+ − λ− = ρ23;1. ◊

Let us conclude. Since simulation algorithms are almost always used in vine copula applications, any dimension reduction of such algorithms is a significant computational improvement. Vine copulas have received a lot of attention in recent years with applications in nearly all branches of mathematical sciences. Some further representative works on theory and applications of (vine) copulas include Cherubini et al. (2004), Mauguis and Guégan (2010), Vaz de Melo Mendes et al. (2010), Hürlimann (2011), Joe and Kurowicka (2011), Bernard and Czado (2012), Czado et al. (2012), Allen et al. (2013), Brechmann and Czado (2013), etc. Vine copulas are especially useful in higher dimensions. Unfortunately, due to its complexity, the present work could not be so far extended beyond dimension three. This is an important challenge for future research.

For n < 6 Letac (2010) has announced some universal copulas, which use quite advanced mathematics, however. As stated by him, a difficulty lies in the lack of an easy characterization of the extreme points of the convex set of correlation matrices of order n. One can ask whether in higher dimensions the explicit recursive closed form correlation bounds for positive semi-definite correlation matrices derived in Hürlimann (2012b) are of help in this matter, as is the case in dimension three.

Explicit simpler constructions than ours are also open for investigation. Note that one of the most elementary approach, which is based on bivariate linear Spearman copulas, though completely classified, does not lead to 3-universal copulas, as shown in Hürlimann (2012c).

Appendix 1

Some preliminary identities and inequalities

We begin with some preliminary material that will be used throughout in Appendix 2. Due to the structure of the bivariate linear circular copula, the analysis of the conjectured inequalities requires a case by case analysis of whether or not the coordinates (x, t), respectively (y, t), belong to one of the following disjoint regions of the centred square C2. For (x, t) these are the regions defined and denoted by

E r 13 = x , t : x 2 + t 2 − 2 r 13 xt < 1 − r 13 2
: inner of ellipse
E − r 13 = x , t : t ≤ r 13 x − 1 − r 13 2 1 − x 2
: lower outer part of ellipse
E + r 13 = x , t : t ≥ r 13 x + 1 − r 13 2 1 − x 2
: upper outer part of ellipse

L1(r13) = (C2 \ E(r13)) ∩ {x + t ≥ 1 + r13}: outer part of ellipse above line in 1st quadrant

L2(r13) = (C2 \ E(r13)) ∩ {t − x ≥ 1 − r13}: outer part of ellipse above line in 2nd quadrant

L3(r13) = (C2 \ E(r13)) ∩ {x + t ≤ − 1 − r13}: outer part of ellipse below line in 3rd quadrant

L4(r13) = (C2 \ E(r13)) ∩ {t − x ≤ − 1 + r13}: outer part of ellipse below line in 4th quadrant

For (y, t) these are the disjoint regions defined and denoted by

E r 23 = y , t : y 2 + t 2 − 2 r 23 yt < 1 − r 23 2
: inner of ellipse
E − r 23 = y , t : t ≤ r 23 y − 1 − r 23 2 1 − y 2
: lower outer part of ellipse
E + r 23 = y , t : t ≥ r 13 y + 1 − r 23 2 1 − y 2
: upper outer part of ellipse

L1(r23) = (C2 \ E(r23)) ∩ {y + t ≥ 1 + r23}: outer part of ellipse above line in 1st quadrant

L2(r23) = (C2 \ E(r23)) ∩ {t − y ≥ 1 − r23}: outer part of ellipse above line in 2nd quadrant

L3(r23) = (C2 \ E(r23)) ∩ {y + t ≤ − 1 − r23}: outer part of ellipse below line in 3rd quadrant

L4(r23) = (C2 \ E(r23)) ∩ {t − y ≤ − 1 + r23}: outer part of ellipse below line in 4th quadrant

We note that involved expressions of the type uv ± 1 − u 2 1 − v 2 necessarily belong to the interval [−1, 1] in virtue of the following slightly more general property.

Lemma A1.1

For x, y, z ∈ [−1, 1] the function defined by w x , y , z = xy + z 1 − x 2 1 − y 2 takes values in [−1,1].

Proof

See the proof of Lemma 4.7 in Kurowicka and Cooke (2006), pp. 121–122. ◊

Some inequality properties of the function w x , y , ± 1 = xy ± 1 − x 2 1 − y 2 defined in Lemma A1.1 will be useful throughout the proofs.

Lemma A1.2

The following properties hold:

(P1) w(x, y, − 1) ≤ x + y − 1  ⇔  x + y ≥ 0

(P2) w(x, y, 1) ≥ x − y + 1  ⇔  x − y ≤ 0(P3)
∂ w x , y , − 1 ∂ x ≥ 0 ⇔ x + y ≥ 0 , ∂ w x , y , − 1 ∂ y ≥ 0 ⇔ x + y ≥ 0
(P4)
∂ w x , y , 1 ∂ x ≥ 0 ⇔ x − y ≤ 0 , ∂ w x , y , 1 ∂ y ≥ 0 ⇔ x − y ≤ 0

(P5) if x, y < 1 then w(x, y, 1) > x + y − 1

(P6) if x, y < 1 then w(x, y, − 1) < 1 + y − x,  w(x, y, − 1) < 1 + x − y

Proof

This is obtained without difficulty through standard algebraic calculation. ◊

Lemma A1.3

The quantities r 13 , r 23 ∈ − 1 , 1 , a = 1 − r 13 2 ≥ b = 1 − r 23 2 and c± = ar23 ∓ br13 satisfy the following identities:
b ± c ± r 13 a = a − c ± r 23 b , a − c ± r 23 b 2 = 1 − c ± 2
(A1.1)

Proof

The first identity is shown by verifying the following equivalences:
b 2 ± b c ± r 13 = a 2 − a c ± r 23 ⇔ c ± a r 23 ± b r 13 = a 2 − b 2 ⇔ a 2 r 23 2 − b 2 r 13 2 = a 2 − b 2 ⇔ a 2 1 − b 2 − b 2 ( 1 − a 2 ) = a 2 − b 2
The second one is shown similarly as follows:
a 2 − 2 a c ± r 23 + c ± 2 r 23 2 = b 2 − b 2 ( c ± ) 2 ⇔ a 2 − 2 a c ± r 23 + ( c ± ) 2 = b 2 ⇔ c ± 2 a r 23 − c ± = a 2 − b 2 ⇔ c ± ( a r 23 ± b ρ 13 ) = a 2 − b 2

Since the last identity is true by the preceding equivalences, the result is shown. ◊

Lemma A1.4

The functions defined by
u ± = u ± x = c ± ⋅ w x , r 13 , ± 1 ± bx a , v ± = v ± y = ± ay − c ± ⋅ w y , r 23 , ± 1 b
(A1.2)
have the following inverse functions
x = u ± * u ± = ± ( a − c ± r 23 b ) ⋅ u ± ± c ± ⋅ 1 − u ± 2 = ( c ± r 13 ± b a ) ⋅ u ± ± c ± ⋅ 1 − u ± 2 , y = v ± * v − = ± ( a − c ± r 23 b ) ⋅ v ± ± c ± ⋅ 1 − v ± 2 = ( c ± r 13 ± b a ) ⋅ v ± ± c ± ⋅ 1 − v ± 2
(A1.3)

Proof

This is obtained through straightforward calculation using the identities (A1.1). ◊

Appendix 2

Proof of the conditional product copula inequalities

Starting point are the following preliminary remarks. According to (3.11), in case (x, t) ∈ E(r13),  (y, t) ∈ E(r23), we have ∂ ∂ t C 13 x , t ≤ ∂ ∂ t C 23 y , t if, and only if
arcsin x − r 13 t a 1 − t 2 ≤ arcsin y − r 23 t b 1 − t 2 ⇔ c + t ≤ ay − bx
(A2.1)
and similarly, we have ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≥ 0 if, and only if
arcsin x − r 13 t a 1 − t 2 + arcsin y − r 23 t b 1 − t 2 ≥ 0 ⇔ c − t ≤ ay + bx
(A2.2)
By symmetry it suffices to show the inequalities for Case I. The proof is done through exhaustive analysis of all possible disjoint regions that can contain the coordinates (x, t), respectively (y, t). We assume c± > 0 and identify the cases c± = 0 as limiting cases c± → 0. Items related to Theorem 4.1 (4.2) are distinguished using the abbreviation UPC (LPC) for upper (lower) conditional product copula inequalities unless quantities involving c± are used.
  1. (1)

    (x, t) ∈ E −(r 13) (y, t) arbitrary

     

(1.1) x + r13 ≥ 0 (UPC), x + r13 < 0 (LPC)

First of all, we note that ∂ ∂ t C 13 x , t = 1 2 (UPC) , ∂ ∂ t C 13 x , t = 0 (LPC). To show this we use the properties of Lemma A1.2 and (3.11) as follows:

(UPC): (P1) ⇒  t ≤ w(x, r13, − 1) ≤ x + r13 − 1  ⇒  (x, t) ∈ L4(r13)

(LPC): (i) using (P6) of Lemma 3.2: t ≤ w(x, r13, − 1) < 1 + r13 − x  ⇒  (x, t) ∉ L1(r13)
  1. (ii)

    using x + r 13 < 0 t ≥ − 1 > x + r 13 − 1  ⇒  (x, t) ∉ L 4(r 13)

     

Furthermore, we must have y + r23 ≥ 0 in Cases (I.a) and (I.b), which is shown as follows:

(UPC) Case (I.a): if y < − r23 then 0 ≤ c+ ≤ ay − bx < − ar23 − br13 = − c+ ≤ 0 a contradiction

(UPC) Case (I.b): y > (−c+ + bx)/a ≥ − (c+ + br13)/a = − r23

(LPC) Case (I.a): if y < − r23, then 0 ≤ c− ≤ ay + bx < − ar23 − br13 = − c− ≤ 0 a contradiction

(LPC) Case (I.b): if y < − r23 then − c− < ay + bx < − ar23 − br13 = − c− a contradiction

If one assumes that t ≤ w(y, r23, − 1), then ∂ ∂ t C 23 y , t = 1 2 in virtue of (3.11) because (P1) ⇒  t ≤ w(y, r23, − 1) ≤ y + r23 − 1  ⇒  (y, t) ∈ L4(r23)

We distinguish between three main cases:
  1. (a)

    c ± t ≥ ay ∓ bx (Case (I.c) and possibly Case (I.b))

     
Since ∂ ∂ t C 23 y , t ≤ 1 2 we have necessarily ∂ ∂ t C 13 x , t = 1 2 ≥ ∂ ∂ t C 23 y , t (UPC), and ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≤ 0 (LPC), as in the desired inequalities.
  1. (b)

    c ± t ≤ ay ∓ bx < c ± ⋅ w(y, r 23, − 1) (possible in Cases (I.a) and (I.b))

     
By the above we have ∂ ∂ t C 13 x , t = ∂ ∂ t C 23 y , t = 1 2 (UPC) and ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 = 0 (LPC), which is consistent with the desired inequalities.
  1. (c)

    c ± t ≤ ay ∓ bx and c ± ⋅ w(y, r 23, − 1) ≤ ay ∓ bx (possible in Cases (I.a) and (I.b))

     

We derive the inequality (C1.1) t ≤ w(x, r13, − 1) ≤ w(y, r23, − 1) which again implies that ∂ ∂ t C 13 x , t = ∂ ∂ t C 23 y , t = 1 2 (UPC) and ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 = 0 (LPC). We use the transformation of variable z = z(y) = ± (ay − c± ⋅ w(y, r23, − 1))/b and its inverse y = y z = ± a − c ± r 23 / b ⋅ z ± c ± ⋅ 1 − z 2 in (A1.3), where the second “±” signs hold for both (UPC) and (LPC). We show (C1.1), that is Δ(x, y) := w(y, r23, − 1) − w(x, r13, − 1) ≥ 0 under the constraints − r13 ≤ x ≤ z(y) (UPC), z(y) ≤ x < − r13 (LPC), − r23 ≤ y ≤ 1. By (P3) of Lemma A1.2 the function w(x, r13, − 1) is increasing in x (UPC), decreasing in x (LPC). It follows that Δ(x, y) ≥ Δ*(y, z(y)) := w(y, r23, − 1) − w(z(y), r13, − 1). Using the transformation z(y) we can write w(y, r23, − 1) = (ay ∓ bz(y))/c±. Making also use of the inverse y = y(z) we see that (use the first identity in (A1.1)) Δ * z : = Δ * ( y ( z ) , z ) = ay z ∓ bz c ± − w ( z , r 13 , − 1 ) = a c ± ± a − c ± r 23 / b ⋅ z ± c ⋅ 1 − z 2 ∓ b c ± z − r 13 z + a 1 − z 2 = a 1 − z 2 1 ± 1 ,

which implies that Δ(x, y) ≥ Δ*(y, z(y)) = Δ*(z) ≥ 0 as desired.

(1.2) x + r13 < 0 (UPC), x + r13 ≥ 0 (LPC)

We have ∂ ∂ t C 13 x , t = 0 ∂ ∂ t C 13 x , t = 1 2 (UPC), (LPC), which is shown as follows:

(UPC): (i) using (P6) of Lemma A1.2: t ≤ w(x, r13, − 1) < 1 + r13 − x  ⇒  (x, t) ∉ L1(r13)
  1. (ii)

    using x + r 13 < 0: t ≥ − 1 > x + r 13 − 1  ⇒  (x, t) ∉ L 4(r 13)

     

(LPC): (P1) of Lemma A1.2 ⇒  t ≤ w(x, r13, − 1) ≤ x + r13 − 1  ⇒  (x, t) ∈ L4(r13)

We distinguish between two main cases:
  1. (a)

    c ± t ≤ ay ∓ bx (Case (I.a) and possibly Case (I.b))

     
We have ∂ ∂ t C 13 x , t = 0 ≤ ∂ ∂ t C 23 y , t (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≥ 0 (LPC) as desired
  1. (b)

    ay ∓ bx ≤ c ± t ≤ c ± ⋅ w(x, r 13, − 1) (Case (I.c) and possibly Case (I.b))

     

We show ∂ ∂ t C 23 y , t = 0 , which is consistent with the desired results ∂ ∂ t C 13 x , t ≥ ∂ ∂ t C 23 y , t (UPC) and ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≤ 0 (LPC). It suffices to show the following inequalities:

Case 1: x ≥ − (b + c+r13)/a (UPC), x ≤ (b − c−r13)/a (LPC)

(C1.2.1) t ≤ w(x, r13, − 1) ≤ w(y, r23, − 1), and y + r23 ≤ 0

Case 2: x ≤ − (b + c+r13)/a (UPC), x ≥ (b − c−r13)/a (LPC)

(C1.2.2) c± ⋅ w(y, r23, 1) ≤ ay ∓ bx ≤ c±t ≤ c± ⋅ w(x, r13, − 1), and y − r23 ≤ 0

Indeed, if these conditions hold, then ∂ ∂ t C 23 y , t = 0 in virtue of (3.11) as follows:

Case 1: (i) using (P6) of Lemma A1.2: t ≤ w(y, r23, − 1) < 1 + r23 − y  ⇒  (y, t) ∉ L1(r23)
  1. (ii)

    using y + r 23 ≤ 0: t ≥ − 1 ≥ y + r 23 − 1  ⇒  (y, t) ∉ L 4(r 23)

     
Case 2: (i) using y − r23 ≤ 0: t ≤ 1 ≤ 1 + r23 − y  ⇒  (y, t) ∉ L1(r23)
  1. (ii)

    using (P5) of Lemma A1.2: t ≥ w(y, r 23, 1) > y + r 23 − 1  ⇒  (y, t) ∉ L 4(r 23)

     

To show the above inequalities we use the transformation z = z(x) = (c± ⋅ w(x, r13, − 1) ± bx)/a.

Case 1: The function z(x) is increasing in the interval − (b + c±r13)/a ≤ x < − r13 (UPC), respectively z(x) is decreasing in the interval − r13 ≤ x ≤ (b − c−r13)/a (LPC):
z ' x = ( c ± r 13 ± b ) / a + c ± ⋅ x / 1 − x 2 ≥ 0 ⇔ x / 1 − x 2 ≥ α : = − ( ± b + c ± r 13 ) / a c ± ⇔ x ≥ α / 1 + α 2 = − ± b + c ± r 13 / a

In particular, by the restriction defining case (b), we have necessarily y ≤ z(x) ≤ z(−r13) = (−c± ∓ br13)/a = − r23  ⇒  y + r23 ≤ 0.

Now, we show that Δ(x, y) = w(y, r23, − 1) − w(x, r13, − 1) ≥ 0 under the constraints, − 1 ≤ y ≤ z(x),   − (b + c+r13)/a ≤ x < − r13 (UPC), − r13 ≤ x ≤ (b − c−r13)/a (LPC). Since w(y, r23, − 1) is decreasing in y by (P3) of Lemma A1.2, we have Δ(x, y) ≥ Δ*(x, z(x)) := w(z(x), r23, − 1) − w(x, r13, − 1) = w(z(x), r23, − 1) − (az(x) ∓ bx)/c±.

Since z(x) is increasing and z(−r13) = − r23,  z(−(b + c+r13)/a) = − 1 (UPC), respectively z(x) is decreasing and z(−r13) = − r23,  z((b − c−r13)/a) = − 1, its inverse in (A1.3) takes the “+” sign (UPC) respectively the “-“ sign (LPC), that is x = x z = ± b ± c ± r 13 / a ⋅ z ± c ± ⋅ 1 − z 2 . Insert it into the function Δ*(z) = Δ*(x(z), z) = w(z, r23, − 1) − (az ∓ bx(z))/c± to see that Δ(x, y) ≥ Δ*(x, z(x)) = Δ*(z) = 0 as desired.

Case 2: Similarly to Case 1, one shows that z(x) is decreasing in the interval − 1 ≤ x ≤ − (b + c+r13)/a (UPC), respectively z(x) is increasing in the interval (b − c−r13)/a ≤ x ≤ 1 (LPC), and in particular y ≤ z(x) ≤ z(−1) = − (±c±r13 + b)/a ≤ r23, where the last inequality is true because ar23 + b + c+r13 = (b + c+) ⋅ (1 + r13) ≥ 0 (UPC), ar23 + b − c−r13 ≥ c− ⋅ (1 − r13) ≥ 0 (LPC).

Now, we show that Δ(x, y) = (ay ∓ bx)/c± − w(y, r23, 1) ≥ 0 under the constraints − 1 ≤ y ≤ z(x), − 1 ≤ x ≤ − (b + c+r13)/a (UPC), (b − c−r13)/a ≤ x ≤ 1 (LPC). The function h(y) = ± (ay/c± − w(y, r23, 1)) is decreasing (UPC), respectively increasing (LPC), in the interval − 1 ≤ y ≤ − (b ± c±r13)/a:
h ' y = ± ( a − c ± r 23 ) / c ± ± b ⋅ y / 1 − y 2 ≤ ( ≥ ) 0 ⇔ y / 1 − y 2 ≤ β : = ( c ± r 23 − a ) / b c ± ⇔ y ≤ β / 1 + β 2 = c ± r 23 − a / b = ∓ ( b ± c ± r 13 ) / a
It follows that Δ(x, y) ≥ Δ*(x, z(x)) = (az(x) ∓ bx)/c± − w(z(x), r23, 1). Since z(x) is decreasing (UPC), respectively increasing (LPC), and z(∓(b ± c±r13)/a) = − 1,  z(∓1) = ∓ (b ± c±r13)/a, its inverse in (A1.3) takes the “-“ sign (UPC) respectively the “+“ sign (LPC), that is we have x = x z = ± b ± c ± r 13 / a ⋅ z ∓ c ± ⋅ 1 − z 2 . Insert this expression into the function Δ*(z) = Δ*(x(z), z) = (az ∓ bx(z))/c± − w(z, r23, 1) to see that Δ(x, y) ≥ Δ*(x, z(x)) = Δ*(z) = 0.
  1. (2)

    (y, t) ∈ E −(r 23) (x, t) arbitrary

     

(2.1) y + r23 < 0

We have ∂ ∂ t C 23 y , t = 0 , which follows from Lemma A1.2 and (3.11) as follows:
  1. (i)

    using (P6) of Lemma A1.2: t ≤ w(y, r 23, − 1) < 1 + r 23 − y  ⇒  (y, t) ∉ L 1(r 23)

     
  2. (ii)

    using y + r 23 < 0: t ≥ − 1 > y + r 23 − 1  ⇒  (y, t) ∉ L 4(r 23)

     

Furthermore, we must have x + r13 < 0 (UPC), respectively x + r13 ≥ 0 (LPC), in Cases (I.a) and (I.b), which is shown as follows:

(UPC) Case (I.a): ay − bx ≥ c+  ⇒  x ≤ (ay − c+)/b < − (c+ + ar13)/b ≤ − r13, where the last inequality follows from ar23 − br13 + c+ = 2c+ ≥ 0

(UPC) Case (I.b): ay − bx > − c+  ⇒  x < (c+ + ay)/b < (c+ − ar23)/b = − r13

(LPC) Case (I.a): if x < − r13, then 0 ≤ c− ≤ ay + bx < − ar23 − br13 = − c− ≤ 0, a contradiction

(LPC) Case (I.b): if x < − r13, then − c− < ay + bx < − ar23 − br13 = − c−, a contradiction

In these Cases, if t ≤ w(x, r13, − 1), then ∂ ∂ t C 13 x , t = 0 (UPC), ∂ ∂ t C 13 x , t = 1 2 (LPC):

(UPC): (i) using (P6) of Lemma 3.2: t ≤ w(x, r13, − 1) < 1 + r13 − x  ⇒  (x, t) ∉ L1(r13)
  1. (ii)

    using x + r 13 < 0: t ≥ − 1 > x + r 13 − 1  ⇒  (x, t) ∉ L 4(r 13)

     

(LPC): (P1) of Lemma A1.2 ⇒  x + r13 ≥ 0  ⇒  w(x, r13, − 1) ≤ x + r13 − 1  ⇒  (x, t) ∈ L4(r13)

We have three main cases:
  1. (a)

    c ± t ≥ ay ∓ bx (Case (I.c) and possibly Case (I.b))

     
We have necessarily ∂ ∂ t C 13 x , t ≥ ∂ ∂ t C 23 y , t = 0 (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≤ 0 (LPC)
  1. (b)

    c ± t ≤ ay ∓ bx < c ± ⋅ w(x, r 13, − 1) (possible in Cases (I.a) and (I.b))

     
By the above we have ∂ ∂ t C 13 x , t = ∂ ∂ t C 23 y , t = 0 (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 = 0 (LPC), which is consistent with the desired inequalities.
  1. (c)

    c ± t ≤ ay ∓ bx and c ± ⋅ w(y, r 23, − 1) ≤ ay ∓ bx (possible in Cases (I.a) and (I.b))

     

We derive the inequality (C2.1) t ≤ w(y, r23, − 1) ≤ w(x, r13, − 1), which again implies ∂ ∂ t C 13 x , t = ∂ ∂ t C 23 y , t = 0 (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 = 0 (LPC). We use the transformation of variable z = z(x) = (c± ⋅ w(x, r13, − 1) ± bx)/a and its inverse x = x z = ± a − c ± r 23 / b ⋅ z ± c ± ⋅ 1 − z 2 in (A1.3), where the second “±” signs hold for both (UPC) and (LPC). We show that Δ(x, y) := w(x, r13, − 1) − w(y, r23, − 1) ≥ 0 under the constraints z(x) ≤ y < − r23 ,   − 1 ≤ x < − r13 (UPC), − r13 ≤ x ≤ 1 (LPC). By (P3) of Lemma A1.2 the function w(y, r23, − 1) is decreasing in y. It follows that Δ(x, y) ≥ Δ*(x, z(x)) = w(x, r13, − 1) − w(z(x), r23, − 1) = (az(x) ∓ bx)/c± − w(z(x), r23, − 1).

Now, insert the inverse x = x(z) into Δ*(z) = Δ*(x(z), z) = (az ∓ bx(z))/c± − w(z, r23, − 1) to see that Δ x , y ≥ Δ * x , z x = Δ * z = b 1 − z 2 1 ± 1 ≥ 0 as desired.

(2.2) y + r23 ≥ 0

Property (P1) implies t ≤ w(y, r23, − 1) ≤ y + r23 − 1  ⇒  (y, t) ∈ L4(r23)  ⇒ ∂ ∂ t C 23 y , t = 1 2

We distinguish between two main cases:
  1. (a)

    c ± t ≤ ay ∓ bx (Case (I.a) and possibly Case (I.b))

     
We have necessarily ∂ ∂ t C 13 x , t ≤ ∂ ∂ t C 23 y , t = 1 2 (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≥ 0 (LPC).
  1. (b)

    ay ∓ bx ≤ c ± t ≤ c ± ⋅ w(x, r 13, − 1) (Case (I.c) and possibly Case (I.b))

     

We show that ∂ ∂ t C 13 x , t = 1 2 (UPC), ∂ ∂ t C 13 x , t = 0 (LPC), which is consistent with ∂ ∂ t C 13 x , t ≥ ∂ ∂ t C 23 y , t (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≤ 0 (LPC). It suffices to show the following inequalities:

Case 1: y ≤ (a − c±r23)/b

(C2.2.1) t ≤ w(y, r23, − 1) ≤ w(x, r13, − 1, and x + r13 ≥ 0 (UPC), x + r13 ≤ 0 (LPC)

Case 2: y ≥ (a − c±r23)/b

(C2.2.2) w(x, r13, 1) ≤ (ay − bx)/c ≤ t ≤ w(y, r23, − 1), and x − r13 ≥ 0 (UPC), x − r13 ≤ 0 (LPC)

Indeed, if these conditions hold, then ∂ ∂ t C 13 x , t = 1 2 (UPC), ∂ ∂ t C 13 x , t = 0 (LPC) as follows:

(UPC) Case 1: Property (P1) implies t ≤ w(x, r13, − 1) ≤ x + r13 − 1  ⇒  (x, t) ∈ L4(r13)

(LPC) Case 1:
  1. (i)

    using (P6) of Lemma 3.2: t ≤ w(x, r 13, − 1) < 1 + r 13 − x  ⇒  (x, t) ∉ L 1(r 13)

     
  2. (i)

    using x + r 13 ≤ 0: t ≥ − 1 ≥ x + r 13 − 1  ⇒  (x, t) ∉ L 4(r 13)

     

(UPC) Case 2: Property (P2) implies t ≥ w(x, r13, 1) ≥ 1 + r13 − x  ⇒  (x, t) ∈ L1(r13)

(LPC) Case 2:
  1. (i)

    using x − r 13 ≤ 0: t ≤ 1 ≤ 1 + r 13 − x  ⇒  (x, t) ∉ L 1(r 13)

     
  2. (i)

    using (P5) of Lemma 3.2: t ≥ w(x, r 13, 1) > x + r 13 − 1  ⇒  (x, t) ∉ L 4(r 13)

     

To show the above inequalities we use the transformation z = z(y) = ± (ay − c± ⋅ w(y, r23, − 1))/b.

Case 1: The function z(y) is increasing (UPC) (respectively decreasing (LPC)) in the interval − r23 ≤ y ≤ (a − c±r23)/b: z ' y = ± a − c ± r 23 / b ∓ c ± ⋅ y / 1 − y 2 ≥ ≤ 0 ⇔ y ≤ a − c ± r 23 / b , hence x ≥ z(y) ≥ z(−r23) = (c+ − ar23)/b = − r13 (UPC), x ≤ z(y) ≤ z(−r23) = (ar23 − c−)/b = − r13 (LPC). Now, we show that Δ(x, y) = w(x, r13, − 1) − w(y, r23, − 1) ≥ 0 under the constraints z(y) ≤ x ≤ 1 (UPC), − 1 ≤ x ≤ z(y) (LPC), − r23 ≤ y ≤ (a − c±r23)/b.

Since w(x, r13, − 1) is increasing in x (UPC) (decreasing in x (LPC)) by (P3) of Lemma A1.2, we have Δ(x, y) ≥ Δ*(y, z(y)) = w(z(y), r13, − 1) − w(y, r23, − 1) = w(z(y), r13, − 1) − (ay ∓ bz(y))/c.

Since z(y) is increasing and z(−r23) = − r13,  z((a − c+r23)/b) = 1 (UPC), respectively z(y) is decreasing and z(−r23) = − r13,  z((a − c−r23)/b) = − 1 (LPC), its inverse takes the “-“ sign for both (UPC) and (LPC), that is y = y z = ± a − c ± r 23 / b ⋅ z − c ± ⋅ 1 − z 2 . Insert it into the function Δ*(z) = Δ*(y(z), z) = w(z, r23, − 1) − (ay(z) ∓ bz)/c± to see that Δ(x, y) ≥ Δ*(y, z(y)) = Δ*(z) = 0 as desired.

Case 2: Similarly to Case 1, one shows that z(y) is decreasing (UPC) (respectively increasing (LPC)) in the interval (a − c±r23)/b ≤ y ≤ 1, and in particular x ≥ z(y) ≤ z(1) = (a − c+r23)/b ≥ r13 (UPC), x ≤ z(y) ≤ z(1) = (c−r23 − a)/b ≤ r13 (LPC), where the last inequalities are true because a − br13 − c+r23 ≥ c+ ⋅ (1 − r23) ≥ 0 (UPC), br13 + a − c−r23 ≥ c− ⋅ (1 − r23) ≥ 0 (LPC). Now, we show that Δ(x, y) = (ay ∓ bx)/c± − w(x, r13, 1) ≥ 0 under the constraints z(y) ≤ x ≤ 1 (UPC), − 1 ≤ x ≤ z(y) (LPC), (a − c±r23)/b ≤ y ≤ 1. The function h(x) = w(x, r13, 1) ± bx/c is decreasing in the interval (a − c+r23)/b ≤ x ≤ 1 (UPC), respectively increasing in the interval − 1 ≤ x ≤ (c−r23 − a)/b (LPC):
h ' x = ± b ± c r 13 / c ± − a ⋅ x / 1 − x 2 ≤ ≥ 0 ⇔ x ≥ a − c + r 23 / b , x ≤ c − r 23 − a / b
It follows that Δ(x, y) ≥ Δ*(y, z(y)) = (ay ∓ bz(y))/c± − w(z(y), r13, 1). Since z(y) is decreasing and z((a − c+r23)/b) = 1,  z(1) = (a − c+r23)/b (UPC), respectively z(y) is increasing and z((a − c−r23)/b) = − 1,  z(1) = (c−r23 − a)/b (LPC), its inverse takes the “+” sign for both (UPC) and (LPC), that is y = y z = ± a − c ± r 23 / b ⋅ z + c ± ⋅ 1 − z 2 . Insert it into Δ*(z) = Δ*(y(z), z) = (ay(z) ∓ bz)/c± − w(z, r13, 1) to see that Δ(x, y) ≥ Δ*(y, z(y)) = Δ*(z) = 0.
  1. (3)

    (x, t) ∈ E(r 13) and (y, t) ∈ E(r 23)

     
The validity of the inequality ∂ ∂ t C 13 x , t ≤ ∂ ∂ t C 23 y , t in the Cases (I.a) and (I.b) follows from (A2.1). In Case (I.c) we have (ay − bx)/c+ ≤ − 1 ≤ t, hence ∂ ∂ t C 13 x , t ≥ ∂ ∂ t C 23 y , t . Similarly, the validity of the inequality ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≥ 0 in the Cases (I.a) and (I.b) follows from (A2.2). In Case (I.c) we have (ay + bx)/c− ≤ − 1 ≤ t, hence ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≤ 0 .
  1. (4)

    (x, t) ∈ E +(r 13), (y, t) arbitrary

     

(4.1) x − r13 < 0 (UPC), x − r13 ≥ 0 (LPC)

We first note that ∂ ∂ t C 13 x , t = 0 (UPC), ∂ ∂ t C 13 x , t = 1 2 (LPC):

(UPC): (i) using x − r13 < 0: t ≤ 1 < 1 + r13 − x  ⇒  (x, t) ∉ L1(r13)
  1. (ii)

    using (P5) of Lemma A1.2: t ≥ w(x, r 13, 1) > x + r 13 − 1  ⇒  (x, t) ∉ L 4(r 13)

     

(LPC): (P2) of Lemma A1.2: t ≥ w(x, r13, 1) ≥ 1 + r13 − x  ⇒  (x, t) ∈ L1(r13)  ⇒

We must have y − r23 < 0 in Cases (I.b) and (I.c). We argue as follows:

(UPC) Case (I.b): x < r13  ⇒  y < (c + bx)/a ≤ (c + br13)/a = r23

(UPC) Case (I.c): if y ≥ r23,   − x > − r13 then ay − bx ≥ ar23 − br13 = c in contradiction to the assumption ay − bx ≤ − c defining Case (I.c).

(LPC) Case (I.b): − x ≤ − r13  ⇒  y < (c− − bx)/a ≤ (c− − br13)/a = r23

(LPC) Case (I.c): if y ≥ r23,  x ≥ r13 then ay + bx ≥ ar23 + br13 = c− in contradiction to the assumption ay + bx ≤ − c− defining Case (I.c).

In this situation, if one assumes t ≥ w(y, r23, 1), then ∂ ∂ t C 23 y , t = 0 in virtue of (3.11):

(UPC): (i) using y − r23 < 0: t ≤ 1 < 1 + r23 − y  ⇒  (y, t) ∉ L1(r23)
  1. (ii)

    using (P5) of Lemma 3.2: t ≥ w(y, r 23, 1) > y + r 23 − 1  ⇒  (y, t) ∉ L 4(r 23)

     
(LPC): (i) using y − r23 < 0: t ≤ 1 < 1 + r23 − y  ⇒  (y, t) ∉ L1(r23)
  1. (ii)

    using (P5) of Lemma 3.2: t ≥ w(y, r 23, 1) > y + r 23 − 1  ⇒  (y, t) ∉ L 4(r 23)

     
We have three main cases:
  1. (a)

    c ± t ≤ ay ∓ bx (Case (I.a) and possibly Case (I.b))

     
We have necessarily ∂ ∂ t C 13 x , t = 0 ≤ ∂ ∂ t C 23 y , t (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≥ 0 (LPC).
  1. (b)

    c ± t ≥ ay ∓ bx > c ± ⋅ w(y, r 23, 1) (possible in Cases (I.b) and (I.c))

     
By the above we have ∂ ∂ t C 13 x , t = ∂ ∂ t C 23 y , t = 0 (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 = 0 (LPC), which is consistent with the desired inequalities
  1. (c)

    c ± t ≥ ay ∓ bx and ay ∓ bx ≤ c ± ⋅ w(y, r 23, 1) (possible in Cases (I.b) and (I.c))

     

We derive the inequality (C4.1) t ≥ w(x, r13, 1) ≥ w(y, r23, 1), which again implies that ∂ ∂ t C 13 x , t = ∂ ∂ t C 23 y , t = 0 (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 = 0 (LPC). We use the transformation z = z(y) = ± (ay − c± ⋅ w(y, r23, 1))/b and its inverse y = y z = ± a − c ± r 23 / b ⋅ z ± c ± ⋅ 1 − z 2 , where the second “±” signs hold for both (UPC) and (LPC). We show that Δ(x, y) = w(x, r13, 1) − w(y, r23, 1) ≥ 0 under the constraints z(y) ≤ x < r13 (UPC), r13 ≤ x ≤ z(y) (LPC), − 1 ≤ y < r23. By (P4) of Lemma A1.2 the function w(x, r13, 1) is increasing in x (UPC), respectively decreasing in x (LPC). It follows that Δ(x, y) ≥ Δ*(y, z(y)) = w(z(y), r13, 1) − w(y, r23, 1) = w(z(y), r13, 1) − (ay ∓ bz(y))/c±.

Insert the inverse y = y(z) into Δ*(z) = Δ*(y(z), z) = w(z, r13, 1) − (ay(z) ∓ bz)/c± to see that Δ x , y ≥ Δ * y , z y = Δ * z = a 1 − z 2 1 ∓ 1 ≥ 0 as desired.

(4.2) x − r13 ≥ 0 (UPC), x − r13 < 0 (LPC)

We first note that ∂ ∂ t C 13 x , t = 1 2 (UPC), ∂ ∂ t C 13 x , t = 0 (LPC):

(UPC): Property (P2) implies t ≥ w(x, r13, 1) ≥ 1 + r13 − x  ⇒  (x, t) ∈ L1(r13)

(LPC): (i) using x − r13 < 0: t ≤ 1 < 1 + r13 − x  ⇒  (x, t) ∉ L1(r13)
  1. (ii)

    using (P5) of Lemma 3.2: t ≥ w(x, r 13, 1) > x + r 13 − 1  ⇒  (x, t) ∉ L 4(r 13)

     
We distinguish between two main cases:
  1. (a)

    c ± t ≥ ay ∓ bx (Case (I.c) and possibly Case (I.b))

     
We have necessarily ∂ ∂ t C 13 x , t = 1 2 ≥ ∂ ∂ t C 23 y , t (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≤ 0 (LPC)
  1. (b)

    ay ∓ bx ≥ c ± t ≥ c ± ⋅ w(x, r 13, 1) (Case (I.a) and possibly Case (I.b))

     

We show that , ∂ ∂ t C 23 y , t = 1 2 which is consistent with the desired inequalities.

We show Case 1: x ≤ (b + c+r13)/a (UPC), x ≥ (c−r13 − b)/a (LPC) (C4.2.1) t ≥ w(x, r13, 1) ≥ w(y, r23, 1), and y − r23 ≥ 0 (UPC), y − r23 > 0 (LPC)

Case 2: x ≥ (b + c+r13)/a (UPC), x ≤ (c−r13 − b)/a (LPC) (C4.2.2) c± ⋅ w(x, r13, 1) ≤ c±t ≤ ay ∓ bx < c± ⋅ w(y, r23, − 1), and y + r23 ≥ 0

Indeed, if these conditions hold, then we have ∂ ∂ t C 23 y , t = 1 2 in virtue of (3.11) as follows:

Case 1: (P2) ⇒  t ≥ w(y, r23, 1) ≥ 1 + r23 − y  ⇒  (y, t) ∈ L1(r23)

Case 2: (P1) ⇒  t < w(y, r23, − 1) ≤ y + r23 − 1  ⇒  (y, t) ∈ L4(r23)

To show the above inequalities we use the transformation z = z(x) = (c± ⋅ w(x, r13, 1) ± bx)/a.

Case 1: The function z(x) is increasing in the interval r13 ≤ x ≤ (b + c+r13)/a (UPC), respectively decreasing in the interval (c−r13 − b)/a ≤ x < r13 (UPC): z ' x = ± b ± c ± r 13 / a − c ± ⋅ x / 1 − x 2 ≥ ≤ 0 ⇔ x ≤ b + c + r 13 / a , x ≥ c − r 13 − b / a .

In particular y ≥ z(x) > z(r13) = (c+ + br13)/a = r23 (UPC), y ≥ z(x) > z(r13) = (c− − br13)/a = r23 (LPC). Now, we show that Δ(x, y) = w(x, r13, 1) − w(y, r23, 1) ≥ 0 under the constraints z(x) ≤ y ≤ 1, r13 ≤ x ≤ (b + c+r13)/a (UPC), (c−r13 − b)/a ≤ x < r13 (LPC). Since w(y, r23, 1) is decreasing in y by (P4) of Lemma 3.2, we have Δ(x, y) ≥ Δ*(x, z(x)) = w(x, r13, 1) − w(z(x), r23, 1) = (az(x) ∓ bx)/c± − w(z(x), r23, 1).

Since z(x) is increasing and z(r13) = r23,  z((b + c+r13)/a) = 1 (UPC), respectively z(x) is decreasing, z(r13) = r23,  z((c−r13 − b)/a) = 1 its inverse in (A1.3) takes the “-“ sign (UPC), respectively the “+” sign (LPC), that is x = x z = ± b ± c ± r 13 / a ⋅ z ∓ c ⋅ 1 − z 2 . Insert it into Δ*(z) = Δ*(x(z), z) = (az ∓ bx(z))/c± − w(z, r23, 1) to see that Δ(x, y) ≥ Δ*(x, z(x)) = Δ*(z) = 0 as desired.

Case 2: Similarly to Case 1, one shows that z(x) is decreasing in the interval (b + c+r13)/a ≤ x ≤ 1 (UPC), respectively z(x) is increasing in the interval − 1 ≤ x ≤ (c−r13 − b)/a (LPC). In particular y ≥ z(x) ≥ z(1) = (b + c+r13)/a ≥ − r23 (UPC), y ≥ z(x) ≥ z(−1) = (b − c−r13)/a ≥ − r23 (LPC), where the last inequalities are true because ar23 + b + c+r13 = (b + c+) ⋅ (1 + r13) ≥ 0 (UPC), ar23 + b − c−r13 ≥ c− ⋅ (1 − r13) ≥ 0 (LPC).

Now, we show that Δ(x, y) = w(y, r23, − 1) − (ay ∓ bx)/c± ≥ 0 under the constraints z(x) ≤ y ≤ 1, (b + c+r13)/a ≤ x ≤ 1 (UPC), − 1 ≤ x ≤ (c−r13 − a)/b (LPC). The function h(y) = w(y, r23, − 1) − ay/c± is increasing in the interval (b ± c±r13)/a ≤ y ≤ 1:
h ' y = c ± r 23 − a / c ± + b ⋅ y / 1 − y 2 ≥ 0 ⇔ y ≥ a − c ± r 23 / b = b ± c ± r 13 / a
It follows that Δ(x, y) ≥ Δ*(x, z(x)) = w(z(x), r23, − 1) − (az(x) ∓ bx)/c±. Since z(x) is decreasing and z((b + c+r13)/a) = 1,  z(1) = (b + c+r13)/a (UPC), respectively z(x) is increasing and z((c−r13 − b)/a) = 1,  z(−1) = (a − c−r23)/b (LPC), its inverse takes the “+” sign (UPC), respectively the “-“ sign (LPC), that is x = x z = ± b ± c ± r 13 / a ⋅ z ± c ± ⋅ 1 − z 2 . Insert it into Δ*(z) = Δ*(x(z), z) = w(z, r23, 1) − (az ∓ bx(z))/c± to see that Δ(x, y) ≥ Δ*(x, z(x)) = Δ*(z) = 0.(5)
y , t ∈ E + r 23 , x , t arbitrary
(5.1)
y − r 23 ≥ 0
Property (P2) implies t ≥ w(y, r23, 1) ≥ 1 + r23 − y  ⇒  (y, t) ∈ L1(r23)  ⇒
∂ ∂ t C 23 y , t = 1 2

We must have x − r13 ≥ 0 (UPC), x − r13 ≥ 0 (LPC), in Cases (I.b) and (I.c):

(UPC) Case (I.b): x > (ay − c+)/b ≤ (ar23 − c+)/b = r13

(UPC) Case (I.c): if − x > − r13,  y ≥ r23 then ay − bx > ar23 − br13 = c+ in contradiction to the assumption ay − bx ≤ − c+ defining Case (I.c).

(LPC) Case (I.b): − y ≤ − r23  ⇒  x < (c− − ay)/b ≤ (c− − ar23)/b = r13

(LPC) Case (I.c): if x ≥ r13,  y ≥ r23 then ay + bx ≥ ar23 + br13 = c− in contradiction to the assumption ay + bx ≤ − c− defining Case (I.c).

In this situation, if t ≥ w(x, r13, 1), then ∂ ∂ t C 13 x , t = 1 2 (UPC), ∂ ∂ t C 13 x , t = 0 (LPC):

(UPC): using (P2) of Lemma A1.2: t ≥ w(x, r13, 1) ≥ 1 + r13 − x  ⇒  (x, t) ∈ L1(r13)

(LPC):
  1. (i)

    using x − r 13 < 0: t ≤ 1 < 1 + r 13 − x  ⇒  (x, t) ∉ L 1(r 13)

     
  2. (ii)

    using (P5) of Lemma A1.2: t ≥ w(x, r 13, 1) > x + r 13 − 1  ⇒  (x, t) ∉ L 4(r 13)

     
We distinguish between three main cases:
  1. (a)

    c ± t ≤ ay ∓ bx (Case (I.a) and possibly Case (I.b))

     
We have necessarily ∂ ∂ t C 13 x , t ≤ ∂ ∂ t C 23 y , t = 1 2 (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≥ 0 (LPC)
  1. (b)

    c ± t ≥ ay ∓ bx > c ± ⋅ w(x, r 13, 1) (possible in Cases (I.b) and (I.c))

     
By the above we have ∂ ∂ t C 13 x , t = ∂ ∂ t C 23 y , t = 1 2 (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 = 0 (LPC), which is consistent with the desired inequalities
  1. (c)

    c ± t ≥ ay ∓ bx and ay ∓ bx ≤ c ± ⋅ w(x, r 13, 1) (possible in Cases (I.b) and (I.c))

     

We derive the inequality (C5.1) t ≥ w(y, r23, 1) ≥ w(x, r13, 1), which again implies ∂ ∂ t C 13 x , t = ∂ ∂ t C 23 y , t = 1 2 (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 = 0 (LPC). We use the transformation z = z(x) = (c ⋅ w(x, r13, 1) ± bx)/a and its inverse in (A1.3) to show that Δ(x, y) = w(y, r23, 1) − w(x, r13, 1) ≥ 0 under the constraints r23 ≤ y ≤ z(x), r13 ≤ x ≤ 1 (UPC), − 1 ≤ x < r13 (LPC). By (P4) of Lemma A1.2 the function w(y, r23, 1) is decreasing in y, hence Δ(x, y) ≥ Δ*(x, z(x)) = w(z(x), r23, 1) − w(x, r13, 1) = w(z(x), r23, 1) − (az(x) ÷ bx)/c±.

Insert the inverse x = x(z) into Δ*(z) = Δ*(x(z), z) = w(z, r23, 1) − (az ∓ bx(z))/c± to see that Δ x , y ≥ Δ * x , z x = Δ * z = b 1 − z 2 1 ± 1 ≥ 0 as desired.(5.2)
y − r 23 < 0
We first note that ∂ ∂ t C 23 y , t = 0 :
  1. (i)

    using y − r 23 < 0: t ≤ 1 < 1 + r 23 − y  ⇒  (y, t) ∉ L 1(r 23)

     
  2. (ii)

    using (P5) of Lemma 3.2: t ≥ w(y, r 23, 1) > y + r 23 − 1  ⇒  (y, t) ∉ L 4(r 23)

     
We distinguish between two main cases:
  1. (a)

    c ± t ≥ ay ∓ bx (Case (I.c) and possibly Case (I.b))

     
We have necessarily ∂ ∂ t C 13 x , t ≥ ∂ ∂ t C 23 y , t = 0 (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≤ 0 (LPC)
  1. (b)

    c ± ⋅ w(y, r 23, 1) ≤ c ± t ≤ ay ∓ bx (Case (I.a) and possibly Case (I.b))

     

We show that ∂ ∂ t C 13 x , t = 0 (UPC), ∂ ∂ t C 13 x , t = 1 2 (LPC), which is consistent with the desired inequalities ∂ ∂ t C 13 x , t ≤ ∂ ∂ t C 23 y , t = 0 (UPC), ∂ ∂ t C 13 x , t + ∂ ∂ t C 23 y , t − 1 2 ≥ 0 (LPC)

Case 1 y ≥ (c±r23 − a)/b

(C5.2.1) t ≥ w(y, r23, 1) ≥ w(x, r13, 1), and x − r13 < 0 (UPC), x − r13 > 0 (LPC)

Case 2 y ≤ (c±r23 − a)/b

(C5.2.2) c± ⋅ w(y, r23, 1) ≤ c±t ≤ ay ∓ bx < c± ⋅ w(x, r13, − 1), x + r13 < 0 (UPC), x + r13 ≥ 0 (LPC)

Indeed, if these conditions hold, then ∂ ∂ t C 13 x , t = 0 in virtue of (3.11) as follows:

UPC) Case 1 (i) using x − r13 < 0: t ≤ 1 < 1 + r13 − x  ⇒  (x, t) ∉ L1(r13)
  1. (ii)

    using (P5) of Lemma 3.2: t ≥ w(x, r 13, 1) > x + r 13 − 1  ⇒  (x, t) ∉ L 4(r 13)

     

(LPC) Case 1: (P2) ⇒  t ≥ w(x, r13, 1) ≥ 1 + r13 − x  ⇒  (x, t) ∈ L1(r13)

(UPC) Case 2: (i) using (P6) of Lemma 3.2: t ≤ w(x, r13, − 1) < 1 + r13 − x  ⇒  (x, t) ∉ L1(r13)
  1. (ii)

    using x + r 13 < 0 t ≥ − 1 > x + r 13 − 1  ⇒  (x, t) ∉ L 4(r 13)

     

(LPC) Case 2: (P1) ⇒  t < w(x, r13, − 1) ≤ x + r13 − 1  ⇒  (x, t) ∈ L4(r13)

To show the above inequalities we use the transformation z = z(y) = ± (ay − c± ⋅ w(y, r23, 1))/b.

Case 1: Since the function z(y) is increasing (UPC) (respectively decreasing (LPC)) in the interval (c±r23 − a)/b ≤ y < r23, we have in particular x ≤ z(y) < z(r23) = (ar23 − c+)/b = r13 (UPC), x ≥ z(y) > z(r23) = (c− − ar23)/b = r13 (LPC). We show that Δ(x, y) = w(y, r23, 1) − w(x, r13, 1) ≥ 0 under the constraints − 1 ≤ x ≤ z(y) (UPC), z(y) ≤ x ≤ 1 (LPC), (c±r23 − a)/b ≤ y < r23. With (P4) of Lemma A1.2, w(x, r13, 1) is increasing in x (UPC), decreasing in x (LPC), hence Δ(x, y) ≥ Δ*(y, z(y)) = w(y, r23, 1) − w(z(y), r13, 1) = (ay ∓ bz(y))/c± − w(z(y), r13, 1).

Since z(y) is increasing and z(r23) = r13,  z((c+r23 − a)/b) = − 1 (UPC), respectively z(y) is decreasing and z(r23) = r13,  z((c−r23 − a)/b) = 1 (LPC), its inverse in (A1.3) takes the “+” sign: y z = ± a − c r 23 / b ⋅ z + c 1 − z 2 . Insert into Δ*(z) = Δ*(y(z), z) = (ay(z) ∓ bz)/c± − w(z, r23, 1) to see that Δ(x, y) ≥ Δ*(y, z(y)) = Δ*(z) = 0 as desired.

Case 2: One shows that z(y) is decreasing (UPC) (respectively increasing (LPC)) in the interval − 1 ≤ y ≤ (c±r23 − a)/b. In particular x ≤ z(y) ≤ z(−1) = (c+r23 − a)/b ≤ − r13 (UPC), x ≥ z(y) ≥ z(−1) = (a − c−r23)/b ≥ − r13 (LPC), where the last inequalities are true because a − br13 − c+r23 ≥ c+ ⋅ (1 − r23) ≥ 0 (UPC), a + br13 − c−r23 ≥ c− ⋅ (1 − r23) ≥ 0 (LPC).

Now, we show that Δ(x, y) = w(x, r13, − 1) − (ay ∓ bx)/c± ≥ 0 under the constraints − 1 ≤ x ≤ z(y) (UPC), z(y) ≤ x ≤ 1 (LPC), − 1 ≤ y ≤ (c±r23 − a)/b. Since the function h(x) = w(x, r13, − 1) ± bx/c is decreasing (UPC), respectively increasing (LPC), we have Δ(x, y) ≥ Δ*(y, z(y)) = w(z(y), r13, − 1) − (ay ∓ bz(y))/c±. Since z(y) is decreasing and z((c+r23 − a)/b) = − 1,  z(−1) = (c+r23 − a)/b (UPC), respectively z(y) is increasing and z((c−r23 − a)/b) = 1,  z(−1) = (a − c−r23)/b (LPC), its inverse in (A1.3) takes the “-“ sign, that is y z = ± a − c ± r 23 / b ⋅ z − c ± ⋅ 1 − z 2 . Insert it into Δ*(z) = Δ*(y(z), z) = w(z, r13, − 1) − (ay(z) − bz)/c to see that Δ(x, y) ≥ Δ*(y, z(y)) = Δ*(z) = 0 as desired.

Authors information

URL: http://sites.google.com/site/whurlimann/

Declarations

Acknowledgement

The author is grateful to the referees for their useful comments, which led to some improvement in content.

Authors’ Affiliations

(1)

References

  1. Allen DE, Ashraf MA, McAleer M, Powell RJ, Singh AK: Financial dependence analysis: applications of vine copulae. 2013.http://eprints.ucm.es/17819/1/1305.pdf Accessed 31 May 2013Google Scholar
  2. Bedford T, Cooke R: Probability density decomposition for conditionally dependent random variables modelled by vines. Ann. Math. Artif. Intell. 2001, 32: 245–268. 10.1023/A:1016725902970MathSciNetView ArticleGoogle Scholar
  3. Bedford T, Cooke R: Vines – a new graphical model for dependent random variables. Ann. Statist. 2002, 30(4):1031–1068.MathSciNetView ArticleGoogle Scholar
  4. Bernard C, Czado C: Multivariate Option Pricing Using Copulae. Appl. Stoch. Models Bus. Ind. 2012. doi:10.1002/asmb.1934 doi:10.1002/asmb.1934Google Scholar
  5. Brechmann EC, Czado C: Risk management with high-dimensional vine copulas: An analysis of the Euro Stoxx 50. Statist. Risk Modeling 2013. in press in pressGoogle Scholar
  6. Carathéodory C: Über den Variabilitätsbereich der Fourierschen Konstanten von positiven harmonischen Funktionen. Rend. del Circolo Matem. di Palermo 1911, 32: 193–217. 10.1007/BF03014795View ArticleGoogle Scholar
  7. Cherubini U, Luciano E, Vecchiato W: Copula Methods in Finance. New York: J. Wiley Finance Series; 2004.View ArticleGoogle Scholar
  8. Czado C: Pair-copula construction of multivariate copulas. In Copula Theory and its Applications. Proc. Workshop held in Warsaw, 25–26 Sep. 2009. Lecture Notes in Statistics. Volume 198. Edited by: Jaworski P, Durante F, Härdle W, Rychlik T. Heidelberg: Springer; 2010:93–109.Google Scholar
  9. Czado C, Schepsmeier U, Min A: Maximum likelihood estimation of mixed C-vines with application to exchange rates. Statist. Modelling 2012, 12(3):229–255. 10.1177/1471082X1101200302MathSciNetView ArticleGoogle Scholar
  10. Devroye L, Letac G: Copulas in three dimensions with prescribed correlations. 2010.http://arxiv.org/abs/1004.3146v1 [math.ST] Accessed 31 May 2013.Google Scholar
  11. Durante F, Klement EP, Quesada-Molina JJ: Copulas: compatibility and Fréchet classes. 2007.http://arxiv.org/abs/0711.2409v1 [math.ST] (2007a). Accessed 31 May 2013.Google Scholar
  12. Durante F, Klement EP, Quesada-Molina JJ, Sarkoci P: Remarks on two product-like constructions for copulas. Kybernetika 2007, 43(2):235–244.MathSciNetGoogle Scholar
  13. Ghosh S: Dependence in stochastic simulation models. Dissertation: Cornell University; 2004. http://www.research.ibm.com/people/g/ghoshs/pubs/thesis.pdf . Accessed 31 May 2013.Google Scholar
  14. Ghosh S, Henderson SG: Properties of the NORTA method in higher dimensions. In Proceedings of the 2002 Winter Simulation Conference. Ithaca, NY, USA: Sch. of Operations Res. & Ind. Eng.,Cornell Univ; 2002:pp. 263–269.Google Scholar
  15. Hürlimann W: Random loss development factor curves and stochastic claims reserving. JP J Fund Appl Stat 2011, 1(1):49–62.Google Scholar
  16. Hürlimann W: Compatibility conditions for the multivariate normal copula with given rank correlation matrix. Pioneer J Theor Appl Stat 2012, 3(2):71–86.Google Scholar
  17. Hürlimann W: Positive semi-definite correlation matrices: recursive algorithmic generation and volume measure. Pure Math Sci 2012, 1(3):137–149.Google Scholar
  18. Hürlimann W: On trivariate copulas with bivariate linear Spearman marginal copulas. J. Math. Syst Sci 2012, 2: 368–383.Google Scholar
  19. Joe H: Families of m-variate distributions with given margins and m(m-1)/2 bivariate dependence parameters. In Distributions with Fixed Marginals and Related Topics. IMS Lecture Notes Monograph Series 28. Edited by: Rüschendorf L, Schweizer B, Taylor MD. CA: Hayward; 1996:120–141.View ArticleGoogle Scholar
  20. Joe H: Multivariate models and dependence concepts. In Monographs on Statistics and Applied Probability. Volume 73. London: Chapman & Hall; 1997.Google Scholar
  21. Joe H, Kurowicka D (Eds): Dependence Modeling – Vine Copula Handbook. Singapore: World Scientific Publishing Co.; 2011.Google Scholar
  22. Kurowicka D, Misiewicz J, Cooke R, Elliptical copulae: Proceedings of the International Conference on Monte Carlo Simulation, Monte Carlo. In Proceedings Monte Carlo Simulation. Edited by: Schuëller GI, Spanos PD. Balkema: Lisse; 2000:209–214.Google Scholar
  23. Kurowicka D, Cooke R: Conditional, partial and rank correlation for the elliptical copula; dependence modelling in uncertainty analysis. TR, Delft Univ Technol. In Proceedings ESREL 2001. Edited by: Zio E, Demichela M, Piccinini N. Politecnico di Torino: Torino; 1795–1802.Google Scholar
  24. Kurowicka D, Cooke R: Uncertainty Analysis with High Dimensional Dependence Modelling. Chichester: J. Wiley; 2006.View ArticleGoogle Scholar
  25. Letac G: Jacobi polynomials and joint distributions in Rn with beta margins and prescribed correlation matrices. Warwick Workshop, Centre Res Stat Methodol 2010. http://www2.warwick.ac.uk/fac/sci/statistics/crism/workshops/orthogonal-polynomials/speakers/gerard_letac.pdf . Accessed 31 May 2013Google Scholar
  26. Mauguis P-A, Guégan D: An econometric study of vine copulas. Int. J. Economics and Finance 2010, 2(5):2–14.Google Scholar
  27. Perlman MD, Wellner JA: Squaring the circle and cubing the sphere: circular and spherical copulas. Symmetry 2011, 3: 574–599. 10.3390/sym3030574MathSciNetView ArticleGoogle Scholar
  28. Sklar A: Fonctions de répartition et leurs marges. Publications de l'Institut Statistique de l'Université de Paris 1959, 8: 229–31.MathSciNetGoogle Scholar
  29. Steinitz E: Bedingt konvergente Reihen und konvexe Systeme. J Reine Angew. Math. 1914, 143: 128–175.MathSciNetGoogle Scholar
  30. Vaz de Melo Mendes B, Mendes Semeraro M, Câmara Leal RP: Pair-copula modeling in finance. Financial Markets and Portfolio Management 2010, 24(2):193–213. 10.1007/s11408-010-0130-1View ArticleGoogle Scholar
  31. Ycart B: Extreme points in convex sets of symmetric matrices. Proc. Amer. Math. Soc. 1985, 95(4):607–612. 10.1090/S0002-9939-1985-0810172-4MathSciNetView ArticleGoogle Scholar

Copyright

© Hürlimann; licensee Springer. 2014

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.