QuantumInfo.ForMathlib.Isometry
42 declarations
Isometry matrix
A matrix is an **isometry** if the product of its conjugate transpose and itself is the identity matrix, i.e., .
Submatrix of Identity is an Isometry if Row Map is Bijective and Column Map is Injective
Let be the identity matrix of type over a ring . For any functions and , if is bijective and is injective, then the submatrix of formed by indexing rows with and columns with (denoted as ) is an isometry.
A bijective row-submatrix of the identity matrix is an isometry
Let be the identity matrix over a ring . For any bijective function , the submatrix of formed by indexing the rows with and the columns with the identity function is an isometry.
An injective column-submatrix of the identity matrix is an isometry
Let be the identity matrix over a ring . For any injective function , the submatrix of formed by indexing the rows by the identity map and the columns by is an isometry.
iff and are isometries
Let be a square matrix over a ring . Then is an element of the unitary group if and only if both and its conjugate transpose (or adjoint) are isometries.
Permutation matrices are members of the unitary group
Let be a type (indexing set) and be a ring. For any permutation of , its associated permutation matrix is an element of the unitary group .
Reindexed Identity Matrix is an Isometry
For any isomorphisms (equivalences) of index types and , the matrix obtained by reindexing the identity matrix using and is an isometry. Here, , and a matrix is an isometry if it preserves the inner product (specifically, ).
Reindexing the Identity Matrix by an Equivalence is Unitary
Let be an equivalence between two index types and . Let denote the identity matrix of size over a ring . The reindexing of this identity matrix by (on both rows and columns) results in a matrix that is an element of the unitary group . In terms of components, if is the Kronecker delta on , the resulting matrix defined by is unitary.
Matrix Reindexing equals Conjugation by Reindexed Identity Matrices
Let be a matrix over a ring , and let be an equivalence (bijection) between index sets and . The reindexing of by , denoted as , is equal to the product , where denotes the identity matrix. This expresses the reindexed matrix as a conjugation-like product involving the reindexed identity matrices.
Reindexing a Matrix is Equivalent to Conjugation by a Permutation Matrix in the Unitary Group
Let be a matrix over a ring , and let be a permutation of the index set . The reindexing of by the permutation can be expressed as a conjugation by the corresponding permutation matrix: where denotes the permutation matrix associated with , and both and are elements of the unitary group .
Equality of Hermitian matrix and matrix from their shared eigenvectors and eigenvalues
Let and be matrices in where is a field. Suppose is a Hermitian matrix (). If every eigenvector of with eigenvalue is also an eigenvector of with the same eigenvalue (maintaining the property ), then .
The continuous functional calculus of a Hermitian matrix is given by for any two-sided isometry that diagonalizes .
Let be a field with a structure of -complete like field (such as or ). Let be an Hermitian matrix over . Suppose there exists an matrix (where and are finite index sets) that is a two-sided isometry, satisfying and . If can be diagonalized by as , where is a diagonal matrix with real entries , then for any function , the continuous functional calculus (CFC) of with respect to is given by:
CFC of a Hermitian Matrix for any Unitary Diagonalization
Let be an Hermitian matrix over a field (where is or ). Suppose can be diagonalized by a unitary matrix such that , where is a diagonal matrix of real eigenvalues . For any continuous function , the continuous functional calculus (CFC) of applied to is given by where denotes the conjugate transpose of .
The continuous functional calculus commutes with conjugation by an isometry (where is also an isometry).
Let be a matrix and be a function. For any matrix such that both and its conjugate transpose are isometries (i.e., they preserve the norm), the continuous functional calculus (CFC) of the conjugated matrix satisfies: where denotes the conjugate transpose of .
Continuous Functional Calculus Commutes with Unitary Conjugation
Let be a square matrix and be a unitary matrix from the unitary group . For any continuous function , applying the continuous functional calculus (CFC) to the conjugation of by satisfies where is the inverse of the unitary matrix .
for unitary
Let be a matrix and be a function. For any unitary matrix in the unitary group , the continuous functional calculus (CFC) satisfies: where denotes the conjugate transpose (Hermitian adjoint) of , and is the matrix representation of the unitary element.
The continuous functional calculus commutes with matrix reindexing
Let be a matrix and be a function. For any equivalence between the index types and , the continuous functional calculus of the reindexed matrix satisfies: where denotes the matrix with its rows and columns permuted or renamed according to .
If and Commute, then their Euclidean Linear Maps Commute
Let and be matrices. If and commute (i.e., ), then their corresponding linear maps on the Euclidean space, denoted by and , also commute.
Intersections of Eigenspaces of Symmetric Operators and Form an Orthogonal Family
Let be a field with a structure of `RCLike` (either or ), and let be an inner product space over . Let and be symmetric linear operators on . Then the family of subspaces formed by the intersection of the eigenspaces of and , indexed by pairs of eigenvalues , is an orthogonal family. Specifically, for any pair of eigenvalues , the subspace is orthogonal to whenever .
Monotonicity of with ignored bottom elements
Let be a complete lattice, and let and be two families of elements in . If for every , either is the bottom element or there exists some such that , then it holds that:
Simultaneous eigenspace decomposition for commuting symmetric operators
Let be a field which is either or (an `RCLike` field), and let be a finite-dimensional inner product space over . Given two symmetric linear operators that commute (i.e., ), the collection of intersections of their eigenspaces, for all pairs of eigenvalues , forms a direct sum decomposition of the vector space .
Commuting symmetric operators induce an internal direct sum decomposition of via joint eigenspaces indexed by .
Let be a field with a structure of or (an `RCLike` field), and let be a finite-dimensional inner product space over . Suppose and are symmetric linear operators on () that commute with each other (). Then decomposes into an internal direct sum of the intersections of their eigenspaces. Specifically, , where and denote the sets of eigenvalues of and respectively, and denotes the eigenspace of operator corresponding to eigenvalue .
Commuting Hermitian matrices are simultaneously unitarily diagonalizable
Let and be Hermitian matrices in (where is or ). If and commute, then there exists a unitary matrix such that both and are diagonal matrices.
Unitary matrices are invertible in the unitary group
For any matrix in the unitary group , is an invertible element within that group.
The matrix representation of a unitary operator is invertible
Let be an element of the unitary group , where is either or . Then the underlying matrix is invertible, with its inverse being its adjoint (or conjugate transpose).
Unitary diagonalization of a Hermitian matrix implies is a functional calculus of a canonical diagonal matrix.
Let be a Hermitian matrix in (where is or ) and be a unitary matrix. If is a diagonal matrix, then for any bijection (where is the cardinality of ), there exists a real-valued function such that can be expressed via the continuous functional calculus (CFC) as: where is the diagonal matrix defined by for .
Commuting Hermitian Matrices have a Common Preimage in the Constant Functional Calculus
Let and be Hermitian matrices that commute with each other. Then there exists a common matrix such that both and can be expressed as a continuous functional calculus (CFC) of . That is, there exist functions and such that and .
