PhyslibSearch

QuantumInfo.ForMathlib.HermitianMat.Reindex

15 declarations

definition

Reindexing of a Hermitian matrix AA by an equivalence ee

#reindex

Given a Hermitian matrix AA indexed by a type dd and an equivalence (bijection) e:dd2e: d \simeq d_2, the reindexed matrix A.reindex(e)A.\text{reindex}(e) is the Hermitian matrix indexed by d2d_2 whose underlying matrix is AA with both its rows and columns reindexed by ee. Formally, the resulting matrix AA' has entries Ai,j=Ae1(i),e1(j)A'_{i, j} = A_{e^{-1}(i), e^{-1}(j)} for i,jd2i, j \in d_2.

theorem

Matrix of a reindexed Hermitian matrix equals the symmetric reindexing of its underlying matrix

#mat_reindex

Let AA be a Hermitian matrix indexed by dd. Given an equivalence (permutation) e:dd2e: d \simeq d_2, the underlying matrix of the reindexed Hermitian matrix A.reindex(e)A.\text{reindex}(e) is equal to the matrix AA reindexed by ee on both rows and columns. That is, (A.reindex(e)).mat=A.mat.reindex(e,e)(A.\text{reindex}(e)).\text{mat} = A.\text{mat}.\text{reindex}(e, e).

theorem

A.reindex(refl)=AA.\text{reindex}(\text{refl}) = A

#reindex_refl

For any Hermitian matrix AA with indices in dd over a field k\mathbf{k}, reindexing AA using the identity equivalence (the reflexive equivalence) results in the original matrix AA. Here, A.reindex(refl)A.\text{reindex}(\text{refl}) denotes the operation of permuting the rows and columns of AA by the identity map.

theorem

Composition Law for Reindexing Hermitian Matrices

#reindex_reindex

Let AA be a Hermitian matrix with indices in dd. Given two bijections (equivalences) e:dd2e: d \simeq d_2 and f:d2d3f: d_2 \simeq d_3, the result of first reindexing AA by ee and then reindexing the result by ff is equal to reindexing AA by the composition (ee trans ff) of the two bijections. That is, (Areindexed by e)reindexed by f=Areindexed by (fe)(A_{\text{reindexed by } e})_{\text{reindexed by } f} = A_{\text{reindexed by } (f \circ e)}.

theorem

Reindexing the zero Hermitian matrix yields 00

#reindex_zero

For any Hermitian matrix 00 (the zero matrix) indexed by dd over a field k\mathbf{k}, and for any equivalence (permutation) e:dd2e: d \simeq d_2, the reindexed matrix 0reindexed by e0_{\text{reindexed by } e} remains the zero matrix of the new indexing type d2d_2. In other words, reindexing the zero Hermitian matrix results in a zero Hermitian matrix.

theorem

Reindexing the Identity Hermitian Matrix I=1I = 1

#reindex_one

Let dd and d2d_2 be types with decidable equality, and e:dd2e: d \simeq d_2 be an equivalence between them. Then the reindexing of the identity Hermitian matrix IdI_d (of type `HermitianMat d 𝕜`) by ee is equal to the identity Hermitian matrix Id2I_{d_2} (of type `HermitianMat d₂ 𝕜`). That is, Id.reindex(e)=Id2I_d.\text{reindex}(e) = I_{d_2}.

theorem

`HermitianMat.reindex` Distributes over Addition

#reindex_add

Let AA and BB be Hermitian matrices indexed by dd over the field k\mathbb{k}, and let e:dd2e: d \simeq d_2 be an equivalence (reindexing) between types dd and d2d_2. Then the sum of the reindexed matrices AA and BB is equal to the reindex of their sum: (A.reindex e)+(B.reindex e)=(A+B).reindex e(A. \text{reindex } e) + (B. \text{reindex } e) = (A + B). \text{reindex } e

theorem

Reindexing Distributes over Subtraction of Hermitian Matrices

#reindex_sub

Let AA and BB be Hermitian matrices indexed by dd, and let e:dd2e: d \simeq d_2 be an equivalence (permutation) between index types. The difference of the reindexed matrices is equal to the reindexing of their difference: (A.reindex(e))(B.reindex(e))=(AB).reindex(e)(A.reindex(e)) - (B.reindex(e)) = (A - B).reindex(e) where A.reindex(e)A.reindex(e) denotes the Hermitian matrix obtained by permuting the rows and columns of AA according to ee.

theorem

Reindexing commutes with negation of Hermitian matrices

#reindex_neg

Let AA be a Hermitian matrix indexed by dd, and let e:dd2e: d \simeq d_2 be an equivalence between index types. Then the reindexing of the negation of AA is equal to the negation of the reindexed matrix, i.e., (A).reindex(e)=(A.reindex(e))(-A). \text{reindex}(e) = -(A. \text{reindex}(e)).

theorem

Reindexing commutes with real scalar multiplication of Hermitian matrices

#reindex_smul

Let AA be a Hermitian matrix indexed by dd, and let e:dd2e: d \simeq d_2 be an equivalence between index types. For any real scalar cRc \in \mathbb{R}, the reindexing of the scalar product cAc \cdot A by ee is equal to the scalar product of cc and the reindexed matrix AA, i.e., (cA).reindex(e)=c(A.reindex(e))(c \cdot A).reindex(e) = c \cdot (A.reindex(e)).

theorem

Conjugation of a Reindexed Hermitian Matrix (A.reindex e).conj B=A.conj (B.submatrix id e)(A.\text{reindex } e).\text{conj } B = A.\text{conj } (B.\text{submatrix id } e)

#reindex_conj

Let AA be a Hermitian matrix indexed by dd, and let e:dd2e: d \simeq d_2 be an equivalence between index types dd and d2d_2. For any matrix BB indexed by d3×d2d_3 \times d_2 over a field k\mathbf{k}, where dd and d2d_2 are finite types, the conjugation of the reindexed Hermitian matrix AA by BB is equal to the conjugation of AA by the submatrix of BB obtained by reindexing its columns with ee. That is, (A.reindex e).conj B=A.conj (B(id,e))(A.\text{reindex } e).\text{conj } B = A.\text{conj } (B \circ (\text{id}, e)) where the submatrix B.submatrix id eB.\text{submatrix id } e is defined by elements (B.submatrix id e)i,j=Bi,e(j)(B.\text{submatrix id } e)_{i, j} = B_{i, e(j)}.

theorem

A.conj(Bsubmatrix(e,f))=(A.conj(Bsubmatrix(id,f))).reindex(e1)A.\text{conj}(B_{\text{submatrix}(e, f)}) = (A.\text{conj}(B_{\text{submatrix}(\text{id}, f)})).\text{reindex}(e^{-1})

#conj_submatrix

Let AA be a Hermitian matrix, BB be a matrix of dimension d2×d4d_2 \times d_4, e:d3d2e: d_3 \simeq d_2 be an equivalence of index types, and f:dd4f: d \to d_4 be a mapping. Then the conjugation of AA by the submatrix of BB indexed by ee and ff is equal to the reindexing of the conjugation of AA by the submatrix of BB indexed by the identity and ff, specifically: A.conj(Bsubmatrix(e,f))=(A.conj(Bsubmatrix(id,f))).reindex(e1) A.\text{conj}(B_{\text{submatrix}(e, f)}) = (A.\text{conj}(B_{\text{submatrix}(\text{id}, f)})).\text{reindex}(e^{-1}) where e1e^{-1} denotes the inverse equivalence of ee.

theorem

A.reindex(e)=A.conj(Matrix.reindex e id 1)A.\text{reindex}(e) = A.\text{conj}(\text{Matrix.reindex } e \text{ id } 1)

#reindex_eq_conj

Let AA be a Hermitian matrix indexed by dd. Given an equivalence (permutation) e:dd2e: d \simeq d_2 between index types, the reindexed Hermitian matrix A.reindex(e)A.\text{reindex}(e) can be expressed as a conjugation of AA. Specifically, A.reindex(e)=A.conj(M)A.\text{reindex}(e) = A.\text{conj}(M), where MM is the matrix formed by reindexing the identity matrix 11 by the equivalence ee on the rows and the identity map on the columns.

theorem

The kernel of a reindexed Hermitian matrix AA under ee is the preimage of ker(A)\text{ker}(A) under the relabeling map induced by ee.

#ker_reindex

Let AA be a Hermitian matrix indexed by dd over a field k\mathbb{k}, and let e:dd2e: d \simeq d_2 be an equivalence between indexing sets. Let ker(A)\text{ker}(A) denote the kernel of the linear operator associated with AA acting on the Euclidean space Ed\mathbb{E}^d. Then the kernel of the reindexed Hermitian matrix A.reindex(e)A.\text{reindex}(e) is equal to the preimage (comap) of the kernel of AA under the linear map induced by the coordinate relabeling ee, denoted by ker(A.reindex(e))=ker(A).comap(Le)\text{ker}(A.\text{reindex}(e)) = \text{ker}(A).\text{comap}(L_e), where Le:Ed2EdL_e: \mathbb{E}^{d_2} \to \mathbb{E}^d is the linear equivalence vvev \mapsto v \circ e.

theorem

Reindexing Hermitian matrices preserves the inclusion of their kernels

#ker_reindex_le_iff

Let AA and BB be Hermitian matrices indexed by dd, and let e:dd2e: d \simeq d_2 be a bijection between indexing sets. The kernel of the reindexed matrix AA (under ee) is a subspace of the kernel of the reindexed matrix BB if and only if the kernel of AA is a subspace of the kernel of BB. That is, (A.reindex e).ker(B.reindex e).ker    A.kerB.ker(A.\text{reindex } e).\ker \le (B.\text{reindex } e).\ker \iff A.\ker \le B.\ker.