Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2109.11419 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909321334358016 |
|---|---|
| author | Mokhtari, Fahimeh Sanders, Jan |
| author_facet | Mokhtari, Fahimeh Sanders, Jan |
| contents | In the computation of the normal form of a colored network vector field, following the semigroup(oid) approach in [19], one would like to be able to say something about the structure of the Lie algebra of linear colored network vector fields. Unlike the purely abstract approach in [10], we describe here a concrete algorithm that gives us the Levi decomposition. If we apply this algorithm to a given subalgebra, it does put the elements in the subalgebra in the block form given by the Levi decomposition, but this need not be the Levi decomposition of the given subalgebra. We show that for $N$-dimensional vector fields with C colors (different functions describing different types of cells in the network) this Lie algebra $net_{C,N}$ is isomorphic to the semidirect sum of a semisimple part, consisting of two simple components $\mathfrak{sl}_C$ and $\mathfrak{sl}_B$, with $B=N-C$, which we write as a block-matrix and a solvable part, consisting of two elements representing the identity $C$ in $c\simeq glC$ and B in $b \simeq glB$, and an abelian algebra $a\simeq\mathfrak{Gr}(C,N)$, the Grassmannian, consisting of the $C$-dimensional subspaces of $\mathbb{R}^N$. The methods in this paper can be immediately applied to study the linear maps of colored networks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_11419 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | The Lie algebraic structure of colored networks Mokhtari, Fahimeh Sanders, Jan Dynamical Systems In the computation of the normal form of a colored network vector field, following the semigroup(oid) approach in [19], one would like to be able to say something about the structure of the Lie algebra of linear colored network vector fields. Unlike the purely abstract approach in [10], we describe here a concrete algorithm that gives us the Levi decomposition. If we apply this algorithm to a given subalgebra, it does put the elements in the subalgebra in the block form given by the Levi decomposition, but this need not be the Levi decomposition of the given subalgebra. We show that for $N$-dimensional vector fields with C colors (different functions describing different types of cells in the network) this Lie algebra $net_{C,N}$ is isomorphic to the semidirect sum of a semisimple part, consisting of two simple components $\mathfrak{sl}_C$ and $\mathfrak{sl}_B$, with $B=N-C$, which we write as a block-matrix and a solvable part, consisting of two elements representing the identity $C$ in $c\simeq glC$ and B in $b \simeq glB$, and an abelian algebra $a\simeq\mathfrak{Gr}(C,N)$, the Grassmannian, consisting of the $C$-dimensional subspaces of $\mathbb{R}^N$. The methods in this paper can be immediately applied to study the linear maps of colored networks. |
| title | The Lie algebraic structure of colored networks |
| topic | Dynamical Systems |
| url | https://arxiv.org/abs/2109.11419 |