Keywords

1 Introduction

The textile plot is a useful tool for data visualisation proposed by Kumasaka and Shibata [3]. The method transforms a given dataset consisting of continuous and/or categorical variables into a real matrix and draws a parallel coordinate plot based on it. The order of variables is determined using some variance criteria or clustering methods. We refer readers to [2] for a comprehensive study on parallel coordinate plots and [6] for geometric observation of parallel coordinate plots.

We first briefly review the textile plot (see [3] for details). We only consider continuous variables and fix the order of variables for simplicity. Suppose that a real matrix \(\varvec{X}=(x_{ti})=(\varvec{x}_1,\ldots ,\varvec{x}_p)\in \mathbb {R}^{n\times p}\) is given. Let \(y_{ti}=a_i\,+\,b_ix_{ti}\) for each t and i, where each \(a_i\) and \(b_i\) are determined as follows. Let \(\bar{y}_{t\cdot }=p^{-1}\sum _{i=1}^p y_{ti}\) be the ‘horizontal’ mean. Then each \(a_i\) and \(b_i\) are determined in such a way that the deviation

$$ \sum _{t=1}^n \sum _{i=1}^p (y_{ti}-\bar{y}_{t\cdot })^2 $$

is minimised under the restrictions of \(y_{ti}=a_i+b_ix_{ti}\) and \(\sum _t\sum _i y_{ti}^2=1\). The textile plot draws a line graph of \((y_{ti})_{i=1}^p\) for each t. Figure 1 explains the construction of the textile plot when \(p=5\).

Fig. 1.
figure 1

Construction of the textile plot. The sum of deviations of \(y_{ti}\) against the horizontal average \(\bar{y}_{t\cdot }\) is minimised under the restrictions \(y_{ti}=a_i+b_ix_{ti}\) and \(\sum _{t,i}y_{ti}^2=1\).

The obtained matrix \(\varvec{Y}=(y_{ti})\) satisfies a set of conditions. A set of such matrices is called the textile set (see also [5]). In [5], we have shown that a canonical part of the textile set can be written as a union of submanifolds.

A visualisation method of linkage disequilibrium in genetic studies, where multiple-single nucleotide polymorphism (SNP) genotype data are considered, has been developed as an application of the textile plot [4]. Since the data considered in [4] are categorical, they are first quantified by dummy variables and then the textile plot is applied. See [3] and [4] for details.

In this study, we derive some geometric properties of the textile set that have not been explored in [5]. Furthermore, we define a proper subset called the strict textile set in order to fill the gap between the textile set and the textile plot.

The rest of this paper is organised as follows. In Sect. 2, we provide the definition of the textile set and represent it as an inverse image of a differentiable map. In Sect. 3, we define the strict textile set and investigate its representations. In Sect. 4, we investigate the textile set from the viewpoint of differential and analytic geometry. Section 5 concludes the paper.

2 The Textile Set

The matrix \(\varvec{Y}\in \mathbb {R}^{n\times p}\) constructed for the textile plot as described in Sect. 1 satisfies the following two conditions:

$$\begin{aligned}&\exists \lambda \in \mathbb {R}, \,\, \,\, \forall i\in \{1,\ldots ,p\},\,\, \,\, \sum _{j=1}^p\varvec{y}_i^{\top }\varvec{y}_j = \lambda \Vert \varvec{y}_i\Vert ^2 \end{aligned}$$
(1)

and

$$\begin{aligned}&\sum _{j=1}^p\Vert \varvec{y}_j\Vert ^2 = 1. \end{aligned}$$
(2)

The two conditions are necessary for \(\varvec{Y}\) to be an output of the textile plot but not sufficient. Indeed, two data matrices \(\varvec{Y}=(\varvec{v},\varvec{v})\) and \(\tilde{\varvec{Y}}=(\varvec{v},-\varvec{v})\) for any vector \(\varvec{v}\in \mathbb {R}^n\) with \(\Vert \varvec{v}\Vert ^2=1/2\) satisfy the conditions (1) and (2) for \(\lambda =2\) and \(\lambda =0\), respectively, but only the former is the output of the textile plot.

The textile set is defined as follows (see also [5]).

Definition 1

A set of all matrices \(\varvec{Y}\in \mathbb {R}^{n\times p}\) satisfying Eqs. (1) and (2) is called the textile set and denoted by \(T_{n,p}\).

We point out that the textile set is an inverse image of a differentiable map. Let \(\mathcal {S}_+(p)\) be a set of all positive semi-definite matrices. For a data matrix \(\varvec{Y}\in \mathbb {R}^{n\times p}\), we denote the Gram matrix as \(g(\varvec{Y})=\varvec{Y}^\top \varvec{Y}\in \mathcal {S}_+(p)\). Then, g is a function from \(\mathbb {R}^{n\times p}\) to \(\mathcal {S}_+(p)\). Let \(T_+(p)\) be the image of \(T_{n,p}\) by g. Explicitly, \(T_+(p)\) consists of positive semi-definite matrices \(\varvec{S}\) satisfying the following two conditions:

$$\begin{aligned}&\exists \lambda \in \mathbb {R},\quad \forall i\in \{1,\ldots ,p\}, \quad \sum _j S_{ij} = \lambda S_{ii}, \\&\text {and}\,\, \,\, \sum _j S_{jj} = 1. \end{aligned}$$

The following theorem is important for understanding the structure of \(T_{n,p}\).

Theorem 1

The textile set is given by \(T_{n,p}=g^{-1}(T_+(p))\).

Proof

The proof is straightforward.

Fig. 2.
figure 2

The textile set \(T_{n,p}\) as an inverse image.

Figure 2 shows the relation of these objects. Note that \(T_+(p)\) does not depend on n.

3 The Strict Textile Set

In this section, we define the strict textile set as a proper subset of the textile set and characterise it.

The quantity \(\lambda \) in Eq. (1) is one of the eigenvalues of the correlation matrix \(r_{ij}=\varvec{y}_i^\top \varvec{y}_j/(\Vert \varvec{y}_i\Vert \Vert \varvec{y}_j\Vert )\), where \(\Vert \varvec{y}_i\Vert \ne 0\) is assumed for simplicity. However, in the original definition of the textile plot (see [3]), \(\lambda \) is the maximum eigenvalue of the correlation matrix. The following lemma characterises the condition of maximality.

Lemma 1

Let \(\varvec{Y}=(\varvec{y}_1,\ldots ,\varvec{y}_p)\) be an element of \(T_{n,p}\) and assume that \(\Vert \varvec{y}_i\Vert \)\(\ne 0\) for all i. Then \(\lambda \) in Eq. (1) is the maximal eigenvalue of \(r_{ij}=\varvec{y}_i^\top \varvec{y}_j/\Vert \varvec{y}_i\Vert \Vert \varvec{y}_j\Vert \) if and only if a matrix

$$\begin{aligned} Q_{ij} = \varvec{y}_i^{\top }\left( \sum _{k=1}^p \varvec{y}_k\right) \delta _{ij} - \varvec{y}_i^{\top }\varvec{y}_j \end{aligned}$$
(3)

is positive semi-definite.

Proof

The maximality condition is equivalent to

$$\begin{aligned} \sum _i \sum _j a_i \frac{\varvec{y}_i^{\top }\varvec{y}_j}{\Vert \varvec{y}_i\Vert \Vert \varvec{y}_j\Vert } a_j - \lambda \sum _i a_i^2 \le 0 \end{aligned}$$

for all \(\varvec{a}\in \mathbb {R}^p\). Let \(b_i=a_i/\Vert \varvec{y}_i\Vert \). Then we have

$$ \sum _i \sum _j b_i (\varvec{y}_i^{\top } \varvec{y}_j) b_j - \lambda \sum _i b_i^2 \Vert \varvec{y}_i\Vert ^2 \le 0. $$

Since Eq. (1) holds, this is further equivalent to

$$ \sum _i \sum _j b_i \left( \varvec{y}_i^{\top }\varvec{y}_j - \varvec{y}_i^{\top } \left( \sum _k\varvec{y}_k\right) \delta _{ij}\right) b_j \le 0, $$

and the proof is completed.

Now we define the strict textile set.

Definition 2

The strict textile set \(T_{n,p}^1\) consists of matrices \(\varvec{Y}\in T_{n,p}\) such that the matrix \(\varvec{Q}=(Q_{ij})\) defined by Eq. (3) is positive semi-definite.

The matrix \(\varvec{Q}\) is a function of the Gram matrix \(\varvec{S}=g(\varvec{Y})=\varvec{Y}^\top \varvec{Y}\). For the dependence, we can write

$$ Q_{ij}(\varvec{S}) = \sum _k S_{ik} \delta _{ij} - S_{ij} $$

or

$$ \varvec{Q}(\varvec{S}) = \mathrm{diag}(\varvec{S}\varvec{1}_p)-\varvec{S}, $$

where \(\varvec{1}_p\) is the all-ones vector and \(\mathrm{diag}(\varvec{v})\) is the diagonal matrix with the diagonal part \(\varvec{v}\). We also define

$$\begin{aligned} T_+^1(p) := T_+(p)\cap \{\varvec{S}\in \mathcal {S}_+(p)\mid \varvec{Q}(\varvec{S})\in \mathcal {S}_+(p)\}. \end{aligned}$$
(4)

Recall that \(\mathcal {S}_+(p)\) is the set of positive semi-definite matrices. From the definition, we obtain the following lemma.

Lemma 2

The strict textile set is given by \(T_{n,p}^1 = g^{-1}(T_+^1(p))\).

In what follows, we study the set \(T_+^1(p)\) instead of \(T_{n,p}^1\).

For example, if \(p=2\), then

$$ \varvec{Q}(\varvec{S}) = \begin{pmatrix} S_{12}&{} -S_{12}\\ -S_{12}&{} S_{12} \end{pmatrix} = S_{12} \begin{pmatrix} 1&{} -1\\ -1&{} 1 \end{pmatrix}. $$

The condition \(\varvec{Q}\succeq \varvec{0}\) is obviously equivalent to \(S_{12}\ge 0\).

If \(p=3\), then

$$\begin{aligned} \varvec{Q}(\varvec{S})&= \begin{pmatrix} S_{12}+S_{13}&{} -S_{12}&{} -S_{13}\\ -S_{12}&{} S_{12}+S_{23}&{} -S_{23}\\ -S_{13}&{} -S_{23}&{} S_{13}+S_{23} \end{pmatrix} \\&= S_{12} \begin{pmatrix} 1&{} -1&{} 0\\ -1&{} 1&{} 0\\ 0&{} 0&{} 0 \end{pmatrix} + S_{13} \begin{pmatrix} 1&{} 0&{} -1\\ 0&{} 0&{} 0\\ -1&{} 0&{} 1 \end{pmatrix} + S_{23} \begin{pmatrix} 0&{} 0&{} 0\\ 0&{} 1&{} -1\\ 0&{} -1&{} 1 \end{pmatrix}. \end{aligned}$$

A sufficient condition for positive semi-definiteness of \(\varvec{Q}\) is

$$ S_{12}\ge 0,\quad S_{13}\ge 0,\quad S_{23}\ge 0. $$

This is not necessary: a counter-example is

$$ \varvec{S} = \begin{pmatrix} 100&{} -1&{} 10\\ -1&{} 100&{} 10\\ 10&{} 10&{} 100 \end{pmatrix}. $$

It is directly shown that \(\varvec{Q}\) is positive semi-definite if and only if \(S_{12}+S_{13}+S_{23}\ge 0\) and \(S_{12}S_{13}+S_{12}S_{23}+S_{13}S_{23}\ge 0\).

Now let us consider general p. We denote the set appearing in the definition (4) as

$$ \mathcal {A} := \{\varvec{S}\in \mathcal {S}_+(p)\mid \varvec{Q}(\varvec{S})\in \mathcal {S}_+(p)\}. $$

Theorem 2

The set \(\mathcal {A}\) is a convex cone, which has an interior point.

Proof

First, we show that \(\mathcal {A}\) is a convex cone. Let \(\varvec{S}_1,\varvec{S}_2\in \mathcal {A}\) and \(c_1,c_2\ge 0\). Then \(c_1\varvec{S}_1+c_2\varvec{S}_2\in \mathcal {S}_+(p)\) and

$$ \varvec{Q}(c_1\varvec{S}_1+c_2\varvec{S}_2) = c_1\varvec{Q}(\varvec{S}_1) + c_2\varvec{Q}(\varvec{S}_2) \in \mathcal {S}_+(p). $$

Hence \(c_1\varvec{S}_1+c_2\varvec{S}_2\in \mathcal {A}\). Next, we prove that \(\mathcal {A}\) has an interior point. Observe that if \(S_{ij}>0\) for all pairs \(i\ne j\), then \(\varvec{Q}(\varvec{S})\in \mathcal {S}_+(p)\). Hence, we obtain

$$ \mathcal {S}_{++}(p) \cap \{\varvec{S}\mid S_{ij}>0,\ i\ne j\} \subset \mathcal {A}, $$

where \(\mathcal {S}_{++}(p)\) denotes a set of all positive definite matrices. Since the two sets in the left-hand side are open, it is sufficient to show that their intersection is not empty. Indeed, a matrix

$$ \varvec{S} = \begin{pmatrix} 2&{} 1&{} \cdots &{} 1\\ 1&{} 2&{} &{} \vdots \\ \vdots &{} &{}\ddots &{} 1\\ 1&{} \cdots &{} 1&{} 2 \end{pmatrix} $$

belongs to the two sets. This completes the proof.

We return to the space of \(\varvec{Y}\). Define

$$\begin{aligned} \mathcal {B}&:= g^{-1}(\mathcal {A}) \\&=\{\varvec{Y}\in \mathbb {R}^{n\times p}\mid \varvec{Q}(\varvec{Y}^\top \varvec{Y})\in \mathcal {S}_+(p)\}. \end{aligned}$$

The strict textile set is given by \(T_{n,p}^1 = T_{n,p} \cap \mathcal {B}\). Indeed, we have

$$\begin{aligned} T_{n,p}^1&= g^{-1}(T_+^1) \\&= g^{-1}(T_+\cap \mathcal {A}) \\&= g^{-1}(T_+)\cap g^{-1}(\mathcal {A}) \\&= T_{n,p}\cap \mathcal {B}. \end{aligned}$$

Corollary 1

If \(n\ge p\), then \(\mathcal {B}\) has an interior point.

Proof

Note that \(g(\varvec{Y})=\varvec{Y}^\top \varvec{Y}\) is continuous. If \(n\ge p\), then g is also surjective. Indeed, for a given \(\varvec{S}\in \mathcal {S}_+(p)\), a matrix

$$ \varvec{Y}=\begin{pmatrix} \varvec{S}^{1/2}\\ \varvec{0} \end{pmatrix} $$

with the matrix square root \(\varvec{S}^{1/2}\) satisfies \(g(\varvec{Y})=\varvec{S}\). Since \(\mathcal {A}\) has an interior point, \(\mathcal {B}\) also has an interior point.

Figure 3 summarises the relations we obtained. Here we denote a set of all \(p\times p\) symmetric matrices as \(\mathcal {S}(p)\).

4 Geometric Properties of the Textile Set from the Viewpoint of Differential and Analytic Geometry

In this section, we demonstrate that the textile set \(T_{n,p}\) is a regular submanifold of \(\mathbb {R}^{n\times p}\) with codimension \(p + 1\). The result is independent from the preceding study presented in [5], where a canonical part of \(T_{n,p}\) was studied. Furthermore, we obtain an envelope of the textile set and a canonical form of the envelope under the hypothesis that \(n = p \ge 2\). Inselberg [1] has discussed the parallel coordinate from the analytical geometric point of view, which motivates our study.

Fig. 3.
figure 3

The strict textile set \(T_{n,p}^1\) and related objects.

Our observation starts with the quantity \(\lambda \) in Eq. (1).

Lemma 3

Let \(\varvec{Y}\in T_{n,p}\). Then \(\lambda \) is bounded as follows:

$$ 0\le \lambda \le p. $$

Proof

For the lower bound, take the summation of Eq. (1) with respect to i and use Eq. (2) to obtain \(\lambda =\Vert \sum _i \varvec{y}_i\Vert ^2\ge 0\). For the upper bound, first consider the case \(\Vert \varvec{y}_i\Vert >0\) for all i. Then Eq. (1) is equivalent to the condition that \(\lambda \) is an eigenvalue of the correlation matrix \(r_{ij}=\varvec{y}_i^\top \varvec{y}_j/\Vert \varvec{y}_i\Vert \Vert \varvec{y}_j\Vert \) because \(\sum _j r_{ij}\Vert \varvec{y}_j\Vert =\lambda \Vert \varvec{y}_i\Vert \). Since the trace of \((r_{ij})\) is p, we have \(\lambda \le p\). If \(\Vert \varvec{y}_i\Vert \) is zero for some i, consider a submatrix \((r_{ij})_{i,j\in I}\), where \(I:=\{i\mid \Vert \varvec{y}_i\Vert >0\}\). Note that I is not empty due to Eq. (2). It is shown that \(\lambda \) is an eigenvalue of the submatrix and therefore \(\lambda \le |I|\le p\).

Remark 1

From the proof, we observe that \(\lambda =0\) if and only if \(\sum _i\varvec{y}_i=\varvec{0}\), and that \(\lambda =p\) if and only if \(\varvec{y}_1=\cdots =\varvec{y}_p\).

For each \(\lambda \in [0, p]\), define a map \(f_\lambda :\mathbb {R}^{n\times p}\rightarrow \mathbb {R}^{p+1}\) as

$$ f_\lambda (\varvec{y}_1,\ldots ,\varvec{y}_p) := \left( \sum _{j=1}^p \varvec{y}_1^\top \varvec{y}_j - \lambda \Vert \varvec{y}_1\Vert ^2, \dots , \sum _{j=1}^p \varvec{y}_p^\top \varvec{y}_j - \lambda \Vert \varvec{y}_p\Vert ^2, \sum _{j=1}^p \Vert \varvec{y}_j\Vert ^2 - 1 \right) . $$

Remark 2

\(\{\,{f_{\lambda }}^{-1} (\varvec{0}) \mid 0 \le \lambda \le p\,\}\) yields a classification of the textile set, i.e.,

$$\begin{aligned} T_{n,p} = \bigsqcup _{0\le \lambda \le p} {f_{\lambda }}^{-1} (\varvec{0}). \end{aligned}$$
(5)

The following theorem is a result of the textile set from the viewpoint of differential geometry. This theorem shows that each \({f_{\lambda }}^{-1}(\varvec{0})\) is an \(np - (p + 1)\)-dimensional differentiable manifold.

Theorem 3

Suppose that

$$\begin{aligned} 0 < \lambda \, (\le p), \quad y_{11} \ne 0, \end{aligned}$$
(6)
$$\begin{aligned} y_{11} y_{j j} - y_{1 j} y_{j 1} \ne 0, \quad j = 2, \dots , p, \end{aligned}$$
(7)
$$\begin{aligned} \exists \ell \in \{\,2, \dots , p\,\}; \sum _{j = 2}^p y_{i j} + y_{i \ell } (1 - 2 \lambda ) \ne 0, \quad i = 1, \dots , n. \end{aligned}$$
(8)

We call the above equations the regularity condition, which implies that a natural inclusion map \(\iota :{f_{\lambda }}^{-1} (\varvec{0}) \hookrightarrow \mathbb {R}^{n\times p}\) is a homeomorphism onto its image. Then \({f_{\lambda }}^{-1}(\varvec{\varvec{0}})\) is a regular submanifold of \(\mathbb {R}^{n\times p}\) with codimension \(p + 1\).

Proof

We outline the proof. We derive the sufficient condition for the Jacobi matrix of \(f_\lambda \) over \({f_{\lambda }}^{-1} (\varvec{0})\) to be of full rank (\({=\,} p + 1\)). Each of Eqs. (6)–(8) establishes the desired conclusion.

The following theorem shows an application of Theorem 3.

Theorem 4

Assume that in Eq. (5), \(T_{n,p}\) is given by the finitely disjoint union of \({f_{\lambda }}^{-1} (\varvec{0})\) in addition to the regularity condition. Then, \(T_{n,p}\) is an \(np - (p + 1)\)-dimensional compact differentiable manifold, where its differential structure is induced from the disjoint union of open sets of the differential manifold \({f_{\lambda }}^{-1} (\varvec{0})\).

Proof

We outline the proof. We have observed that \(T_{n,p}\) is compact (see [5] for details). Combining Theorem 3 with the assumption of the finiteness leads to the conclusion.

The remainder of this section is devoted to the study of the textile set from the viewpoint of analytic geometry. Let \(n = p \ge 2\). The following lemma shows an envelope of \(T_{n,n}\).

Lemma 4

Fix \(\lambda \in [0, n]\), \(n \ge 2\). Let \(F_\lambda :{\mathbb {R}}^{n \times n}\rightarrow \mathbb {R}\) be a quadratic form defined as

$$ F_\lambda (\varvec{y}_1,\ldots ,\varvec{y}_n) := \sum _{i=1}^n \sum _{j=1}^n y_{ij}\left( \sum _{k\ne j}y_{ik}\right) -(\lambda -1). $$

Then \(T_{n,n}\subset {F_{\lambda }}^{-1}(0)\).

Proof

We deduce that Eqs. (1) and (2) yield the following quadric: for all \(\varvec{y}_1,\ldots ,\varvec{y}_n \in T_{n,n}\),

$$\begin{aligned} F_\lambda (\varvec{y}_1,\ldots ,\varvec{y}_n) = 0, \quad 0 \le \lambda \le n. \end{aligned}$$
(9)

This completes the proof.

We proceed with the study on the canonical form of the quadric given by (9). The following theorem is a result of the textile set from the viewpoint of analytic geometry.

Theorem 5

Let \(F_{\lambda }\) be defined as in Lemma 4. Then, the canonical form of the quadric defined from \(F_{\lambda }\) is given as follows:

$$\begin{aligned}&- \frac{1}{\lambda - 1} {z_1}^2 - \dots - \frac{1}{\lambda - 1} {z_{n (n - 1)}}^2 \\&+\, \frac{n - 1}{\lambda - 1} {z_{n (n - 1) + 1}}^2 + \dots + \frac{n - 1}{\lambda - 1} {z_{n^2}}^2 = 1, \quad \lambda \ne 1, \\&- {z_1}^2 - \dots - {z_{n (n - 1)}}^2 + (n - 1) {z_{n (n - 1) + 1}}^2 + \dots + (n - 1) {z_{n^2}}^2 = 0, \quad \lambda = 1, \end{aligned}$$

where each \(z_i\), \(i = 1, \dots , n^2\), denotes a transformed coordinate to obtain the stated canonical form.

Proof

We outline the proof. For each \(i, j = 1, \dots , n\), identifying \(y_{ij}\) with \(y_{(i - 1) n + j}\) (\(\in \mathbb {R}^{n^2}\)), we can rewrite (9) as following:

$$\begin{aligned} F_{\lambda } (y_1, \dots , y_{n^2}) = (y_1, \dots , y_{n^2}) \, A \, (y_1, \dots , y_{n^2})^\top - (\lambda - 1) = 0, \quad 0 \le \lambda \le n, \end{aligned}$$
(10)

where

$$ A := \begin{pmatrix} A_1 &{} &{} \varvec{0} \\ &{} \ddots &{} \\ \varvec{0} &{} &{} A_n \end{pmatrix} , \quad A_k := \begin{pmatrix} 0 &{} 1 &{} \ldots &{} 1\\ 1 &{} 0 &{} \ldots &{} 1\\ \vdots &{} \vdots &{} \ddots &{} \vdots \\ 1 &{} 1 &{} \ldots &{} 0 \end{pmatrix} , \quad k = 1, \dots , n. $$

It can be noticed that the eigenvalues of A are given by \(-1\) and \(n - 1\) with their multiplicities \(n(n - 1)\) and n, respectively. Hence, we have \(\det A = ({(-1)}^{n-1} (n -1))^n \ne 0\) because \(n \ge 2\), from which it can be derived that \(F_{\lambda }\) given by Eq. (10) is a central quadric. Consequently, a proper coordinate transformation gives us the desired conclusion.

5 Conclusions

In this study, we have obtained geometric properties of the textile and strict textile sets as follows: The textile set can be characterised as an inverse image of the map g (Theorem 1). We have also defined the strict textile set and demonstrated its relation to a convex cone (Theorem 2). Furthermore, we have investigated the textile set from the viewpoint of differential geometry (Theorems 3 and 4) and analytic geometry (Lemma 4 and Theorem 5).

In the future, we plan to practically apply the results reported here and describe the intrinsically differential and analytical geometric structure of employed datasets. In fact, R. Shibata, who proposed the textile plot in [3], has suggested this direction to us. We are also concerned with defining a proper metric for the textile set \(T_{n,p}\) and its class \({f_{\lambda }}^{-1} (\varvec{0})\) as a differentiable manifold (stated in Theorems 3 and 4), and a quadric of the textile set \(T_{n,n}\) itself as well as its envelop.

We could not investigate probabilistic properties of \(\varvec{Y}\) and \(g(\varvec{Y})\) defined in Sect. 2 when the data matrix \(\varvec{X}\) is distributed according to some multivariate distributions. The distribution of \(\varvec{Y}\) should be studied to understand the behaviour of the textile plot. For instance, the variable selection based on the norm \(\Vert \varvec{y}_i\Vert \) has to be justified in the framework of sampling distributions.