betaFeedback

WorksMathematics

Linear maps preserving the Cullis' determinant. III

Abstract

This paper is the third in the series of papers devoted to the explicit description of linear maps preserving the Cullis' determinant of rectangular matrices of size n×kn\times k with entries belonging to an arbitrary ground field which is large enough. In this part we study the remaining case where k=3k = 3 and n≥k+2=5n \ge k + 2 = 5 and prove that every linear map preserving the Cullis' determinant admits the same description as for the case where k≥4k \ge 4 and n≥k+2n \ge k + 2 obtained previously.

Introduction

The theory of linear maps preserving matrix invariants is a broad field of research in Linear Algebra which is related with other fields of mathematics. It attracts an attention of many scientists since the beginning of 20th century when Frobenius in [1] obtained a description of linear maps preserving the determinant of square matrices.

Theorem 1.1 (Frobenius, [1 §7, Theorem I]). Let S:Mn(C)→Mn(C)S : \mathcal{M}_n(\mathbb{C}) \to\mathcal{M}_n(\mathbb{C}) be a bijective linear map satisfying det⁡(S(X))=det⁡(X)\det(S(X)) = \det(X) for all X∈Mn(C)X \in\mathcal{M}_n(\mathbb{C}), where C\mathbb{C} denotes the field of complex numbers and Mn(C)\mathcal{M}_n(\mathbb{C}) denotes the set n×nn \times n matrices with entries from C\mathbb{C}. Then there exist matrices M,N∈Mn(C)M, N \in\mathcal{M}_n(\mathbb{C}) with det⁡(MN)=1\det(MN) = 1 such that

S(X)=MXN for all X∈Mn(C) or S(X)=MXtN for all X∈Mn(C).S(X) = MXN \text{ for all } X \in\mathcal{M}_n(\mathbb{C}) \text{ or } S(X) = MX^{t}N \text{ for all } X \in\mathcal{M}_n(\mathbb{C}).

This area of study continues to be a subject of active research. We refer the reader to [2] for a survey of results up to the end of the 20th century and to [3] for a brief introduction. In particular, there are obtained generalisations of Theorem 1.1 regarding polynomial invariants of square matrices defined similarly including permanent [4], immanants [5] and Schur matrix functionals [6].

The Cullis’ determinant is an invariant of rectangular matrix generalizing the notion of the ordinary determinant of square matrix. It was introduced by Cullis in [7] and studied later by Radić in [8, 9, 10, 11], Makarewicz, Mozgawa, Pikuta and Szałkowski in [12, 13, 14], Amiri, Fathy and Bayat in [15], and Nakagami and Yanay in [16]. The Cullis’ determinant has many properties similar to those of the ordinary determinant (Theorem 3.1). Together with the Frobenius’ theorem above, this motivates to characterize the linear maps preserving the Cullis’ determinant. This direction of research was completely unexplored until 2024, when the authors solved the linear preserver problem for the Cullis determinant of rectangular matrices of size n×kn \times k with n=k+1n = k + 1. As it is shown in [17], this case is reduced to the case n=kn = k, where it is possible to use the Frobenius’ theorem.

In further studies of this problem, we obtained that for n≥k+2n \ge k + 2 and k≥4k \ge4, the characterization depends on parity of n+kn + k (see [18] and [19]). This result is formulated in Theorem 1.3 and Theorem 1.4. Let us introduce the basic notions and definitions used throughout our paper in order to formulate these theorems.

By F\mathbb{F} we denote a field without any restrictions on its characteristic. We will use the inequality ∣F∣>k|\mathbb{F}| > k for k∈Nk \in\mathbb{N} which means that either F\mathbb{F} is infinite or F\mathbb{F} is finite and ∣F∣>k|\mathbb{F}| > k.

We denote by Mnk(F)\mathcal{M}_{nk}(\mathbb{F}) the set of all n×kn \times k matrices with entries from a certain field F\mathbb{F}. Similarly, by Mnk(F[x1,…,xm])\mathcal{M}_{nk}(\mathbb{F}[x_1,\ldots,x_m]) we denote the set of all n×kn \times k matrices with entries from the ring F[x1,…,xm]\mathbb{F}[x_1,\ldots,x_m] of polynomials in variables x1,…,xmx_1,\ldots,x_m with coefficients from F\mathbb{F}.

Onk∈Mnk(F)O_{nk} \in\mathcal{M}_{nk}(\mathbb{F}) denotes the matrix with all the entries equal to zero. In∈Mnn(F)I_n \in\mathcal{M}_{nn}(\mathbb{F}) denotes the identity matrix. Let us denote by Eij∈Mnk(F)E_{ij} \in\mathcal{M}_{nk}(\mathbb{F}) the matrix, whose entries are all equal to zero besides the entry on the intersection of the ii-th row and the jj-th column, which is equal to one. By xijx_{ij} we denote the element of a matrix XX lying on the intersection of its ii-th row and jj-th column. If X∈Mnk(F)X \in\mathcal{M}_{nk}(\mathbb{F}), then by rk⁡(X)\operatorname{rk}(X) we denote the rank of XX. For a set SS and i,j∈Si,j \in S by δij\delta_{ij} we denote the Kronecker delta of ii and jj, which is equal to 1 if i=ji=j and equal to 0 otherwise.

For A∈Mnk1(F)A \in\mathcal{M}_{nk_1}(\mathbb{F}) and B∈Mnk2(F)B \in\mathcal{M}_{nk_2}(\mathbb{F}) by A∣B∈Mn,k1+k2(F)A|B \in\mathcal{M}_{n,k_1+k_2}(\mathbb{F}) we denote the block matrix defined by A∣B=(AB)A|B = \begin{pmatrix} A & B \end{pmatrix}.

For A∈Mnk(F)A \in\mathcal{M}_{nk}(\mathbb{F}) by At∈Mkn(F)A^t \in\mathcal{M}_{kn}(\mathbb{F}) we denote the transpose of the matrix AA, i.e. Aijt=AjiA^t_{ij} = A_{ji} for all 1≤i≤k1 \le i \le k, 1≤j≤n1 \le j \le n.

We use the notation for submatrices following [20] and [21]. That is, by A[J1∣J2]A[J_1|J_2] we denote the ∣J1∣×∣J2∣|J_1| \times|J_2| submatrix of AA lying on the intersection of rows with the indices from J1J_1 and the columns with the indices from J2J_2. By A(J1∣J2)A(J_1|J_2) we denote the submatrix of AA derived from it by striking out from it the rows with indices belonging to J1J_1 and the columns with the indices belonging to J2J_2. If the set is absent, then it means the empty set, i.e. A(J1∣)A(J_1|) denotes the matrix derived from AA by striking out from it the rows with indices belonging to J1J_1. We may skip curly brackets, i.e. A[1,2∣3,4]=A[{1,2}∣{3,4}]A[1,2|3,4] = A[\{1,2\}|\{3,4\}]. The notation with mixed brackets is also used, i.e. A([1])A([1]) denotes the first column of the matrix AA. This notation is also used for vectors as well. In this case vectors are considered as n×1n \times1 or 1×n1 \times n matrices.

We use the bold font to denote vectors and lower indices to denote their coordinates. In the case if we need a series of vectors, we use upper indices placed in braces. For example, if v=(10)\mathbf{v} = \begin{pmatrix}1\\0\end{pmatrix}, then vt=(10)\mathbf{v}^t = \begin{pmatrix}1 & 0\end{pmatrix} and v1=1\mathbf{v}_1 = 1. If u(1)=(10)\mathbf{u}^{(1)} = \begin{pmatrix}1\\0\end{pmatrix}, u(2)=(01)\mathbf{u}^{(2)} = \begin{pmatrix}0\\1\end{pmatrix}, then u1(1)=1\mathbf{u}^{(1)}_1 = 1 and u1(2)=0\mathbf{u}^{(2)}_1 = 0.

For A=(aij)∈Mnn(F)A=(a_{ij})\in\mathcal{M}_{n n}(\mathbb{F}) we denote by det⁡(A)\det(A) the ordinary determinant of AA. In addition, the following notation is used

det⁡(A)=∣a11⋯an1⋮⋱⋮an1⋯ann∣.\det(A)= \begin{vmatrix} a_{11} & \cdots& a_{n1}\\ \vdots& \ddots& \vdots\\ a_{n1} & \cdots& a_{nn} \end{vmatrix}.

Definition 1.2 (Cf. [7 §3, the definition on p. 12 and §30, Theorem I.]). Let n≥k≥1n\geq k\geq1 be integers, X∈Mnk(F)X\in\mathcal{M}_{n k}(\mathbb{F}) be a matrix. Then Cullis’ determinant det⁡nk(X)\det_{n k}(X) of XX is defined by

det⁡nk(X)=(−1)(1+⋯+k)∑1≤c1<⋯<ck≤n(−1)c1+⋯+ck∣xc11⋯xc1k⋮⋱⋮xck1⋯xckk∣.\det_{n k}(X)=(-1)^{(1+\cdots+k)} \sum_{1\leq c_1<\cdots<c_k\leq n} (-1)^{c_1+\cdots+c_k} \begin{vmatrix} x_{c_1 1} & \cdots& x_{c_1 k}\\ \vdots& \ddots& \vdots\\ x_{c_k 1} & \cdots& x_{c_k k} \end{vmatrix}.

That is, the Cullis’ determinant of XX is an alternating sum of basic minors of XX. We also denote det⁡nk(X)\det_{n k}(X) as follows

det⁡nk(X)=∣X11⋯X1k⋮⋱⋮Xn1⋯Xnk∣nk.\det_{n k}(X)= \begin{vmatrix} X_{11} & \cdots& X_{1k}\\ \vdots& \ddots& \vdots\\ X_{n1} & \cdots& X_{nk} \end{vmatrix}_{n k}.

In the case if n=kn=k, then det⁡nn\det_{n n} is also denoted as det⁡k\det_k and is clearly equal to the ordinary determinant of a square matrix.

For k>nk>n the Cullis’ determinant of X∈Mnk(F)X\in\mathcal{M}_{n k}(\mathbb{F}) is defined by det⁡nk(X)=det⁡kn(Xt)\det_{n k}(X)=\det_{k n}(X^{t}) (see [8 Definition 1]).

References

  1. [1]F. G. Frobenius. Über die Darstellung der endlichen Gruppen durch lineare Substitutionen, 944–1015. S. B. Deutsch. Akad. Wiss. Berlin, 1897. DOI: 10.3931/e-rara-18879.
  2. [2]S. Pierce et al., A survey of linear preserver problems, Linear Multilinear Algebra 33 (1992), no. 1-2, DOI: 10.1080/03081089208818176.DOI
  3. [3]P. Šemrl. Linear preserver problems. In L. Hogben, editor, Handbook of linear algebra, Discrete mathematics and its applications, chapter 30-1. CRC press Taylor & Francis, Boca Raton, 2nd ed edition, 2014.
  4. [4]P. Botta, Linear transformations that preserve the permanent, Proc. Amer. Math. Soc. 18 (1967), no. 3, 566–569, DOI: 10.1090/S0002-9939-1967-0213376-6.DOI
  5. [5]M. Duffner, Linear transformations that preserve immants, Linear Algebra Appl. 197-198 (1994), 567–588, DOI: https://doi.org/10.1016/0024-3795(94)90504-5.
  6. [6]C. de Seguins Pazzis, On the linear preservers of schur matrix functionals, Linear Algebra Appl. 567 (2019), 63–117, DOI: https://doi.org/10.1016/j.laa.2018.12.031.
  7. [7]C. E. Cullis, Matrices and determinoids: Volume 1, Cambridge, Cambridge University Press, 1913.
  8. [8]M. Radić, A definition of the determinant of a rectangular matrix, Glas. Mat. Ser. III 1(21) (1966), 17–22.
  9. [9]M. Radić, About a determinant of rectangular 2 × n matrix and its geometric interpretation, Beitr. Algebra Geom. 46 (2005), no. 2, 321–349.
  10. [10]M. Radić, A generalization of the determinant of a square matrix and some of its applications in geometry, Mat. (Zagreb) 20 (1991), no. 2, 19–36.
  11. [11]M. Radić, Areas of certain polygons in connection with determinants of rectangular matrices, Beitr. Algebra Geom. 49 (2008), no. 1, 71–96.
  12. [12]A. Makarewicz, P. Pikuta, and D. Szałkowski, Properties of the determinant of a rectangular matrix, Ann. Univ. Mariae Curie-Skłodowska Sect. A 68 (2014), no. 1, 31–41, DOI: 10.17951/a.2014.68.1.31.DOI
  13. [13]A. Makarewicz, W. Mozgawa, and P. Pikuta, Volumes of polyhedra in terms of determinants of rectangular matrices, Bull. Soc. Sci. Lett. Łodz Ser. Rech. Deform 66 (2016), no. 2, 105–117.
  14. [14]A. Makarewicz and P. Pikuta, Cullis-Radić determinant of a rectangular matrix which has a number of identical columns, Ann. Univ. Mariae Curie-Skłodowska Sect. A 74 (2020), no. 2, 41, DOI: 10.17951/a.2020.74.2.41-60.DOI
  15. [15]A. Amiri, M. Fathy, and M. Bayat, Generalization of some determinantal identities for non-square matrices based on Radic’s definition, TWMS J. Pure Appl. Math. 1 (2010), no. 2, 163–175.
  16. [16]Y. Nakagami and H. Yanai, On Cullis’ determinant for rectangular matrices, Linear Algebra Appl. 422 (2007), no. 2, 422–441, DOI: 10.1016/j.laa.2006.11.001.DOI
  17. [17]A. Guterman and A. Yurkov, Linear maps preserving the Cullis determinant of (n+1)×n matrices, Sarajevo J. Math. 20 (2024), no. 1, 47–59, DOI: 10.5644/sjm.20.01.05.DOI
  18. [18]A. Guterman and A. Yurkov, Linear maps preserving the Cullis’ determinant. I, Linear Algebra Appl. (2025). Submitted for publication. Available at https://arxiv.org/abs/2512.13437.
  19. [19]A. Guterman and A. Yurkov, Linear maps preserving the Cullis’ determinant. II, Linear Algebra Appl. (2025). Submitted for publication. Available at https://arxiv.org/abs/2512.13445.
  20. [20]H. Minc, Permanents, Cambridge, Cambridge University Press, 1984.
  21. [21]S. Pierce, Discriminant preserving linear maps, Linear Multilinear Algebra 8 (1979), no. 2, 101–114, DOI: 10.1080/03081087908817306.
  22. [22]S. Lang, Algebra, Springer, New York, 2002.
  23. [23]R. Westwick, Transformations on tensor spaces, Pacific J. Math. 23 (1967), no. 3, 613–620, DOI: 10.2140/pjm.1967.23.613.DOI
  24. [24]A. Guterman and A. Yurkov, Linear varieties, matroids and their applications to the Cullis’ determinant, J. Algebra. Comb. (2026). Submitted for publication. Available at https://arxiv.org/abs/2512.21098.

Paper details

vlnc:W_5b5ganjm
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents