Mathematical Problems in Engineering

Mathematical Problems in Engineering / 2021 / Article
Special Issue

Control Problems of Nonlinear Systems with Applications 2021

View this Special Issue

Research Article | Open Access

Volume 2021 |Article ID 1126757 | https://doi.org/10.1155/2021/1126757

Nating Chen, Menglei Lin, Yiliang Li, "Algebraic Relations among Four Types of Right Semi-Tensor Product", Mathematical Problems in Engineering, vol. 2021, Article ID 1126757, 6 pages, 2021. https://doi.org/10.1155/2021/1126757

Algebraic Relations among Four Types of Right Semi-Tensor Product

Academic Editor: Renming Yang
Received06 May 2021
Accepted07 Jun 2021
Published14 Jun 2021

Abstract

In this paper, algebraic relations among four kinds of right semi-tensor product (STP) are discussed. Firstly, this paper provides definitions of right STPs, consisting of the first right matrix-matrix STP, the second right matrix-matrix STP, the first right matrix-vector STP, and the second right matrix-vector STP. Secondly, relations among these right STPs are proposed. Finally, the main results show the convertibility of these right STPs.

1. Introduction

Cheng product, also called semi-tensor product (STP), was first introduced by Prof. Cheng [1]. A significant breakthrough of STP is that it overcomes the dimension barrier, which limits the development of conventional matrix product. The first type of STP is called left matrix-matrix (MM) STP, which expends the dimension of each matrix by right multiplying the identity matrix. Here, the matrix product refers to the Kronecker product. Thanks to the left MM STP, a Boolean network can be converted into a linear discrete-time form, which stimulates the development of Boolean networks [24]. In addition, the left MM STP also plays an important role in finite game [57], fuzzy systems [8, 9], and graph theory [10, 11].

However, the left MM STP loses its ability in discussing dimension-varying linear systems because the result of left MM STP of a matrix and a vector is a matrix instead of a vector. Thus, the second type of STP, called left matrix-vector (MV) STP, was proposed in [12]. Compared with the left MM STP, the left MV STP expends the dimension of vector by right multiplying a column vector whose elements are 1. Based on the left MV STP, dimension-varying linear systems were modeled [13]. Besides, the solution and stability of continuous-time dimension-varying linear systems were studied in [14]. References [15, 16] considered state dimensions of dimension-varying discrete linear systems.

Due to the importance of left MM STP and left MV STP, the authors in [17] explored more general STPs, which help to expand the possible applications of STP. In the following, the left MM STP and left MV STP are denoted by left MM-1 STP and left MV-1 STP. By right multiplying , the left MM-2 STP and left MV-2 STP are defined in [18]. Here, is an dimensional matrix, whose elements are 1. Relations among these four kinds of left STP are discussed in [19].

By changing the way of dimension expansion, the authors in [17] defined four corresponding right STPs, including right MM-1 STP, right MM-2 STP, right MV-1 STP, and right MV-2 STP. However, relations between these right STPs are not studied. Hence, this paper reviews definitions of right STP and discusses relations among these right STPs. The main results show the convertibility of these right STPs.

The rest of this paper is organised as follows. Section 2 introduced definitions of four kinds of right STP. Relations among these right STPs are investigated in Section 3. Section 4 gives some concluding remarks.

Before ending this section, we provided a list of notations, most of which can be found in [20, 21].(i) contains all dimensional matrices. The -th column (row) of matrix is denoted by . Particularly, .(ii) includes all dimensional column vectors.(iii) is the dimensional identity matrix.(iv), where .(v) is an dimensional zero matrix.(vi) is the transpose of matrix .(vii) is the Kronecker product

2. Definitions of Right STP

In this section, definitions of right STP are introduced. To begin with, the right STP of two matrices is proposed. In this paper, STP refers to right STP.

Definition 1. (see [12, 17]). Let and . Suppose is the least common multiple of and .(1)The first right MM STP (MM-1 STP) of and , denoted by , is defined as(2)The second right MM STP (MM-2 STP) of and , denoted by , is defined aswhere and or .

Remark 1. If , then . It means that MM-1 STP and MM-2 STP are generalizations of the conventional matrix product. In addition, MM-1 STP and MM-2 STP not only keep main properties of conventional matrix product available but add some new properties such as certain commutativity [12].

Given a matrix and a vector . Then, the conventional matrix product of and can be viewed as a linear mapping on . However, MM-1 STP and MM-2 STP cannot be regarded as linear mappings because results of MM-1 STP and MM-2 STP are matrices instead of vectors. Thus, other definitions of right STP, as extensions of linear mappings, are provided.

Definition 2. (see [12, 17]). Let and . Suppose is the least common multiple of and .(1)The first right MV STP (MV-1 STP) of and , denoted by , is defined as(2)The second right MV STP (MV-2 STP) of and , denoted by , is defined as

Definition 3. Given and . Suppose is the least common multiple of and . Then,

3. Algebraic Relation among Four Types of STP

In this section, algebraic relations among four types of STP are discussed. The following three cases are considered: (1) STP of two vectors, (2) STP of matrices and vectors, and (3) STP of two matrices.

3.1. TP of Two Vectors

Firstly, algebraic relations among STPs of two column vectors are concerned.

Theorem 1. Let and be two column vectors. Then, the following results hold:(1)(2), where

Proof. (1) The correctness of the first item is obvious, so the proof is omitted. (2) In the light of the definition of MM-2 STP, one calculatesIn addition, it is easy to see that holds for any column vectors .

The following results are about algebraic relation among STPs of two row vectors.

Theorem 2. Let and be two column vectors. Then, the following results hold:(1)(2), where (3), where

Proof. (1)The correctness of the first item is obvious, so the proof is omitted.(2)By computing directly, one can see that holds(3)From the definition of MM-2 STP, we getCombined with the first two items, one obtains .

3.2. STP of Matrices and Vectors

In this subsection, algebraic relations among four types of STP of matrices and vectors are studied. To begin with, we focus on STP of matrices and column vectors.

Theorem 3. Given and . Suppose is the least common multiple of and . Then, the following results hold:(1)(2), where is the -th block of via dividing into equal blocks by rows(3)

Proof. (1)Since , we have for each . According to definitions of MM-1 STP and MV-1 STP, one derives(2)Divide into equal blocks by rows. The -th block of is denoted by . It is easy to see that holds. Thus, one getsCombined with the definition of MV-2 STP, we can draw the following conclusion:(3)From the definition of MM-2 STP, it is not hard to compute

Based on Theorem 3, another relations among four types of STP of matrices and column vectors can be introduced.

Corollary 1. Given and . Suppose is the least common multiple of and . Relations among all types of STP of and are shown as follows:(1), where is the -th block of via dividing into equal blocks by rows, .(2), where is the -th block of via dividing into equal blocks by rows.(3), where is the -th block of via dividing into equal blocks by rows, .

The following theorem shows different results between STP of column vectors and matrices and STP of matrices and column vectors.

Theorem 4. Given . Let be a column vector. Then, the following results hold:(1)(2)

Proof. (1)Since , one can see easily that holds according to the first item of Theorem 1. Moreover, we can conclude that is true.(2)Similarly, holds. From the second item of Theorem 1, we derive . Thus, one computesBased on the definition of MV-2 STP, we also getNext, we investigate algebraic relations among four types of STP of matrices and row vectors.

Theorem 5. Given . Let be a column vector. Then, the following results hold:(1)(2)(3)

Proof. (1)It is not hard to find . The first item of Theorem 2 shows that is true. Hence, holds.(2)By computation direct, we draw the following conclusion:(3)Combining (15) with definitions of STP, one derives the following results:

3.3. STP of Two Matrices

Combined with the analysis above, algebraic relations among four types of STP of two matrices are derived easily.

Theorem 6. Given and . Suppose is the least common multiple of and . Then, the following results hold:(1)(2), where is the -th block of via dividing into equal blocks by rows(3)

Proof. Since proofs of these tree items are similar, we only prove (1).(1)From equation (5), one finds . Because holds according to Theorem 3, it is not difficult to see . By calculation, we conclude thatwhich is true.

Similarly, another relation among of four types of STP of two matrices is presented.

Corollary 2. Given and . Suppose is the least common multiple of and . Relations among all types of STP of and are shown as follows:(1), where is the -th block of via dividing into equal blocks by rows, (2), where is the -th block of via dividing into equal blocks by rows(3), where is the -th block of via dividing into equal blocks by rows,

4. Conclusion

This paper has studied relations among four kinds of right STPs under three cases, containing STP of two vectors, STP of matrices and vectors, and STP of two matrices. The results obtained in this paper have shown the convertibility of these right STPs.

Data Availability

No data were used to support this study.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was supported by the grants from the Natural Science Foundation Project of Fujian, China (no. 2020J01795).

References

  1. D. Cheng, “Semi-tensor product of matrices and its application to morgen’s problem,” Science China Information Sciences, vol. 44, no. 3, pp. 195–212, 2001. View at: Google Scholar
  2. Y. Zheng, H. Li, and J.-E. Feng, “State-feedback set stabilization of logical control networks with state-dependent delay,” Science China Information Sciences, vol. 64, no. 6, p. 169203, 2021, 1–169203:3. View at: Publisher Site | Google Scholar
  3. Y. Li, J. Li, and J.-e. Feng, “Set controllability of Boolean control networks with impulsive effects,” Neurocomputing, vol. 418, pp. 263–269, 2020. View at: Publisher Site | Google Scholar
  4. Y. Li, J. Li, and J.-E. Feng, “Output tracking of Boolean control networks with impulsive effects,” IEEE Access, vol. 8, pp. 157793–157799, 2020. View at: Publisher Site | Google Scholar
  5. D. Cheng, “On finite potential games,” Automatica, vol. 50, no. 7, pp. 1793–1801, 2014. View at: Publisher Site | Google Scholar
  6. D. Cheng and T. Liu, “From Boolean game to potential game,” Automatica, vol. 96, pp. 51–60, 2018. View at: Publisher Site | Google Scholar
  7. C. Li, Y. Xing, F. He, and D. Cheng, “A strategic learning algorithm for state-based games,” Automatica, vol. 113, pp. 1–9, 2020. View at: Publisher Site | Google Scholar
  8. D. Cheng, J.-e. Feng, and H. Lv, “Solving fuzzy relational equations via semitensor product,” IEEE Transactions on Fuzzy Systems, vol. 20, no. 2, pp. 390–396, 2012. View at: Publisher Site | Google Scholar
  9. J. Feng, H. Lv, and D. Cheng, “Multiple fuzzy relation and its application to coupled fuzzy control,” Asian Journal of Control, vol. 15, no. 5, pp. 1313–1324, 2013. View at: Google Scholar
  10. Y. Wang, C. Zhang, and Z. Liu, “A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems,” Automatica, vol. 48, no. 7, pp. 1227–1236, 2012. View at: Publisher Site | Google Scholar
  11. M. Meng and J. Feng, “A matrix approach to hypergraph stable set and coloring problems with its application to storing problem,” Journal of Applied Mathematics, pp. 1–10, 2014. View at: Google Scholar
  12. D. Cheng, “On equivalence of matrices,” Asian Journal of Mathematics, vol. 23, no. 2, pp. 257–348, 2019. View at: Publisher Site | Google Scholar
  13. D. Cheng, Z. Liu, and H. Qi, “Cross-dimensional linear systems,” 2017, https://arxiv.org/abs/1710.03530. View at: Google Scholar
  14. Q.-l. Zhang, B. Wang, and J.-e. Feng, “Solution and stability of continuous-time cross-dimensional linear systems,” Frontiers of Information Technology and Electronic Engineering, vol. 22, no. 2, pp. 210–221, 2021. View at: Publisher Site | Google Scholar
  15. J.-e. Feng, B. Wang, and Y. Yu, “On dimensions of linear discrete dimension-unbounded systems,” International Journal of Control, Automation and Systems, vol. 19, no. 1, pp. 471–477, 2021. View at: Publisher Site | Google Scholar
  16. P. Zhao, H. Guo, Y. Yu, and J. Feng, “On dimensions of dimension-bounded linear systems,” Science China Information Sciences, vol. 64, no. 5, pp. 1–3, 2021. View at: Publisher Site | Google Scholar
  17. D. Cheng, Z. Liu, Z. Xu, and T. Shen, “Generalised semi‐tensor product of matrices,” IET Control Theory and Applications, vol. 14, no. 1, pp. 85–95, 2020. View at: Publisher Site | Google Scholar
  18. D. Cheng, Z. Xu, and T. Shen, “Equivalence-based model of dimension-varying linear systems,” IEEE Transactions on Automatic Control, vol. 65, no. 12, pp. 5444–5449, 2020. View at: Publisher Site | Google Scholar
  19. J. Feng, Y. Li, and J. Zhao, “Four kinds of semi-tensor products and their relationships,” Journal of Liaocheng University (Nat. Sci.), vol. 33, no. 4, pp. 1–7, 2020, in Chinese. View at: Google Scholar
  20. D. Cheng, H. Qi, and Z. Li, Analysis and Control of Boolean Networks: A Semi-tensor Product Approach, Springer, London, UK, 2011.
  21. D. Cheng, H. Qi, and Y. Zhao, An Introduction to Semi-tensor Product of Matrices and its Application, World Scientific, Singapore, 2011.

Copyright © 2021 Nating Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Related articles

No related content is available yet for this article.
 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views127
Downloads308
Citations

Related articles

No related content is available yet for this article.

Article of the Year Award: Outstanding research contributions of 2021, as selected by our Chief Editors. Read the winning articles.