Approximating complex perplectic matrices by finite products from a finite generating set

Clicks: 1
ID: 286900
2021
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score โ€” reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal

Ranked #3,327 of 3,757 articles by views in Malay Journal

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 3,757 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
For positive integer n, let ๐“œn(โ„‚) denote the set of all n x n matrices over โ„‚. We say a matrix A in ๐“œn(โ„‚) is a complex perplectic matrix whenever A is invertible and A-1=JA*J such that J is the matrix with 1s on the skew-diagonal and 0s everywhere else, and A* is the conjugate-transpose of A. The matrix A is said to be skew-perHermitian whenever -A=JA*J. It turns out that the set of all complex perplectic matrices forms a matrix Lie group whose Lie algebra is the set of all skew-perHermitian matrices. Now, consider an arbitrary 2 x 2 perplectic matrix B of the form B=exp(x1U1 + x2U2 + x3U3) where x1,x2,x3 are real numbers such that 4x2x3-x12 > 0 and the matrices U1,U2,U3 span the complex perplectic Lie algebra of order two. Using polar and LDL decompositions, we obtain the decomposition B = ULDL* such that U is unitary, L is lower triangular, and D is diagonal. We show that U, L, D are all complex perplectic and have determinant 1. Let ๐“– denote a nonempty finite subset of ๐“œ2(โ„‚). For each positive integer m, we define ๐“–m = {A1A2...Ak | 0 โ‰ค k โ‰ค m and A1,...,Ak โˆˆ ๐“–} which is the set of all words in G of length at most m where word of length 0 is the identity. We abbreviate โŸจ๐“–โŸฉ = โ‹ƒ0โ‰คm<โˆž๐“–m. In this paper, we construct a fixed set ๐“– consisting of finitely many complex perplectic matrices that is closed under taking inverses. We show that U, L, D above can be approximated by some words in โŸจ๐“–โŸฉ via the Hilbert-Schmidt norm. This leads to an approximation of the matrix B. Our results serve as initial steps towards establishing an analogue of the Solovay-Kitaev theorem on special complex perplectic group of order two.
Reference Key
persistent_1760659996_68f18a1ce6f8e Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Pagaygay, Aaron
Journal Malay Journal
Year 2021
DOI
DOI not found
URL
https://animorepository.dlsu.edu.ph/etdm_math/2
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.