QuantumInfo.ForMathlib.HermitianMat.Reindex
Much like `Matrix.reindex` and `Matrix.submatrix`, we can reindex a Hermitian matrix to get another Hermitian matrix; however, this only makes sense when both permutations are the same, accordingly, `HermitianMat.reindex` only takes one `Equiv` argument (as opposed to `Matrix.reindex`'s two).
This file then gives relevant lemmas for simplifying this.
Our simp-normal form for expressions involving `HermitianMat.reindex` is that we try to push the reindexing as far out as possible, so that it can be absorbed by `HermitianMat.trace`, or cancelled our in a `HermitianMat.inner`. In places where it commutes (like `HermitianMat.inner`) we push it to the right side. One downside is that we're not as likely to hit `reindex_one`.
15 declarations
Reindexing of a Hermitian matrix by an equivalence
Given a Hermitian matrix indexed by a type and an equivalence (bijection) , the reindexed matrix is the Hermitian matrix indexed by whose underlying matrix is with both its rows and columns reindexed by . Formally, the resulting matrix has entries for .
Matrix of a reindexed Hermitian matrix equals the symmetric reindexing of its underlying matrix
Let be a Hermitian matrix indexed by . Given an equivalence (permutation) , the underlying matrix of the reindexed Hermitian matrix is equal to the matrix reindexed by on both rows and columns. That is, .
For any Hermitian matrix with indices in over a field , reindexing using the identity equivalence (the reflexive equivalence) results in the original matrix . Here, denotes the operation of permuting the rows and columns of by the identity map.
Composition Law for Reindexing Hermitian Matrices
Let be a Hermitian matrix with indices in . Given two bijections (equivalences) and , the result of first reindexing by and then reindexing the result by is equal to reindexing by the composition ( trans ) of the two bijections. That is, .
Reindexing the zero Hermitian matrix yields
For any Hermitian matrix (the zero matrix) indexed by over a field , and for any equivalence (permutation) , the reindexed matrix remains the zero matrix of the new indexing type . In other words, reindexing the zero Hermitian matrix results in a zero Hermitian matrix.
Reindexing the Identity Hermitian Matrix
Let and be types with decidable equality, and be an equivalence between them. Then the reindexing of the identity Hermitian matrix (of type `HermitianMat d 𝕜`) by is equal to the identity Hermitian matrix (of type `HermitianMat d₂ 𝕜`). That is, .
`HermitianMat.reindex` Distributes over Addition
Let and be Hermitian matrices indexed by over the field , and let be an equivalence (reindexing) between types and . Then the sum of the reindexed matrices and is equal to the reindex of their sum:
Reindexing Distributes over Subtraction of Hermitian Matrices
Let and be Hermitian matrices indexed by , and let be an equivalence (permutation) between index types. The difference of the reindexed matrices is equal to the reindexing of their difference: where denotes the Hermitian matrix obtained by permuting the rows and columns of according to .
Reindexing commutes with negation of Hermitian matrices
Let be a Hermitian matrix indexed by , and let be an equivalence between index types. Then the reindexing of the negation of is equal to the negation of the reindexed matrix, i.e., .
Reindexing commutes with real scalar multiplication of Hermitian matrices
Let be a Hermitian matrix indexed by , and let be an equivalence between index types. For any real scalar , the reindexing of the scalar product by is equal to the scalar product of and the reindexed matrix , i.e., .
Conjugation of a Reindexed Hermitian Matrix
Let be a Hermitian matrix indexed by , and let be an equivalence between index types and . For any matrix indexed by over a field , where and are finite types, the conjugation of the reindexed Hermitian matrix by is equal to the conjugation of by the submatrix of obtained by reindexing its columns with . That is, where the submatrix is defined by elements .
Let be a Hermitian matrix, be a matrix of dimension , be an equivalence of index types, and be a mapping. Then the conjugation of by the submatrix of indexed by and is equal to the reindexing of the conjugation of by the submatrix of indexed by the identity and , specifically: where denotes the inverse equivalence of .
Let be a Hermitian matrix indexed by . Given an equivalence (permutation) between index types, the reindexed Hermitian matrix can be expressed as a conjugation of . Specifically, , where is the matrix formed by reindexing the identity matrix by the equivalence on the rows and the identity map on the columns.
The kernel of a reindexed Hermitian matrix under is the preimage of under the relabeling map induced by .
Let be a Hermitian matrix indexed by over a field , and let be an equivalence between indexing sets. Let denote the kernel of the linear operator associated with acting on the Euclidean space . Then the kernel of the reindexed Hermitian matrix is equal to the preimage (comap) of the kernel of under the linear map induced by the coordinate relabeling , denoted by , where is the linear equivalence .
Reindexing Hermitian matrices preserves the inclusion of their kernels
Let and be Hermitian matrices indexed by , and let be a bijection between indexing sets. The kernel of the reindexed matrix (under ) is a subspace of the kernel of the reindexed matrix if and only if the kernel of is a subspace of the kernel of . That is, .
