Creation and annihilation in matrix theory
The two most fundamental procedures in matrix theory deal with the completion and elimination of a single column: (i) complete (embed) a column into a matrix \(B\) with a certain prescribed property; (ii) eliminate (sweep out) all but one of its entries by using a matrix \(S\) of a certain prescribed type. A closed form representation is given for the matrix \(S\) that sweeps out a single column. This includes the integer as well as the unitary and regular cases. The closed form is built up from \(2\times 2\) case. The product rule for adjoints is used to show that the dual of this procedure is precisely the completion procedure, which completes a single column to a matrix \(B\) such that \(SB=BS=\) diagonal. This construction underlines the fact that the completion and elimination processes are complementary. By permuting rows suitably, the matrices may be assumed to be in lower Hessenberg form.
This page was built for publication: Creation and annihilation in matrix theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968755)