PhyslibSearch

Physlib.Mathematics.DataStructures.Matrix.LieTrace

20 declarations

instance

Uniform space structure on Matrixm×n(K)\text{Matrix}_{m \times n}(\mathbb{K})

#instUniformSpace_physlib

Given a uniform space K\mathbb{K}, the set of m×nm \times n matrices with entries in K\mathbb{K}, denoted by Matrixm×n(K)\text{Matrix}_{m \times n}(\mathbb{K}), is equipped with a uniform space structure. This structure is the product uniform structure induced by the uniform structure on K\mathbb{K} for each entry (i,j)(i, j) of the matrix.

theorem

If f(n)=0f(n) = 0 for all nn, then n=0f(n)=0\sum_{n=0}^{\infty} f(n) = 0

#tsum_eq_zero

Let β\beta be a topological additive commutative monoid. For any sequence f:Nβf: \mathbb{N} \to \beta, if f(n)=0f(n) = 0 for all nNn \in \mathbb{N}, then the infinite sum n=0f(n)\sum_{n=0}^{\infty} f(n) is equal to 00.

theorem

(fn)ij=(fn)ij\left( \sum f_n \right)_{ij} = \sum (f_n)_{ij}

#matrix_tsum_apply

Let f:NMatrixm×m(K)f: \mathbb{N} \to \text{Matrix}_{m \times m}(\mathbb{K}) be a sequence of square matrices. If the series n=0fn\sum_{n=0}^\infty f_n is summable, then for any indices i,jmi, j \in m, the (i,j)(i, j)-th entry of the infinite sum is equal to the infinite sum of the (i,j)(i, j)-th entries of each matrix. That is, (n=0fn)ij=n=0(fn)ij \left( \sum_{n=0}^\infty f_n \right)_{ij} = \sum_{n=0}^\infty (f_n)_{ij}

theorem

diag(AB)=diag(A)diag(B)\text{diag}(AB) = \text{diag}(A) \cdot \text{diag}(B) for upper-triangular matrices

#diag_mul_of_blockTriangular_id

For any two upper-triangular matrices AA and BB (formalized as square matrices that are block-triangular with respect to the identity function), the diagonal of their product ABAB is the element-wise product of their respective diagonals. That is, (AB)ii=AiiBii(AB)_{ii} = A_{ii} \cdot B_{ii} for all indices ii.

theorem

Powers of upper-triangular matrices are upper-triangular

#pow

Let AA be a square matrix over a field K\mathbb{K}. If AA is an upper-triangular matrix (defined as `BlockTriangular A id`), then for any natural number kk, its kk-th power AkA^k is also an upper-triangular matrix.

theorem

diag(Ak)=diag(A)k\text{diag}(A^k) = \text{diag}(A)^k for upper-triangular matrices

#diag_pow_of_blockTriangular_id

Let AA be an m×mm \times m upper-triangular matrix over a field K\mathbb{K}. For any natural number kk, the diagonal of the matrix power AkA^k is equal to the element-wise kk-th power of the diagonal of AA. That is, diag(Ak)=diag(A)k\text{diag}(A^k) = \text{diag}(A)^k, or equivalently, the ii-th diagonal entry of the kk-th power of AA is given by (Ak)ii=(Aii)k(A^k)_{ii} = (A_{ii})^k for all indices ii.

theorem

The exponential of an upper-triangular matrix is upper-triangular

#blockTriangular_exp_of_blockTriangular_id

Let AA be an m×mm \times m matrix over a field K\mathbb{K}. If AA is an upper-triangular matrix (formally defined as `BlockTriangular A id`), then its matrix exponential exp(A)\exp(A) is also an upper-triangular matrix.

theorem

(An)ii=(Aii)n(A^n)_{ii} = (A_{ii})^n for upper-triangular matrices

#diag_pow_entry_eq_pow_diag_entry

Let AA be an m×mm \times m upper-triangular matrix (formally defined as `BlockTriangular A id`) over a field K\mathbb{K}. For any natural number nn and any index ii, the (i,i)(i, i)-th diagonal entry of the nn-th power of AA is equal to the nn-th power of the (i,i)(i, i)-th entry of AA. That is, (An)ii=(Aii)n(A^n)_{ii} = (A_{ii})^n.

theorem

(1n!An)ii=1n!(Aii)n\left(\frac{1}{n!} A^n\right)_{ii} = \frac{1}{n!} (A_{ii})^n for upper-triangular matrices

#exp_series_diag_term_eq

Let AA be an m×mm \times m upper-triangular matrix (formally defined as `BlockTriangular A id`) over a field K\mathbb{K}. For any natural number nn and any index ii, the (i,i)(i, i)-th entry of the nn-th term of the matrix exponential series, 1n!An\frac{1}{n!} A^n, is equal to the nn-th term of the scalar exponential series of the (i,i)(i, i)-th entry of AA. That is, (1n!An)ii=1n!(Aii)n\left(\frac{1}{n!} A^n\right)_{ii} = \frac{1}{n!} (A_{ii})^n.

theorem

n=0(1n!An)ii=n=01n!(Aii)n\sum_{n=0}^\infty \left(\frac{1}{n!} A^n\right)_{ii} = \sum_{n=0}^\infty \frac{1}{n!} (A_{ii})^n for Upper-Triangular Matrices

#matrix_exp_series_diag_eq_scalar_series

Let AA be an m×mm \times m upper-triangular matrix (formally defined as `BlockTriangular A id`) over a field K\mathbb{K}. For any index ii, the sum of the (i,i)(i, i)-th entries of the terms in the matrix exponential series equals the sum of the terms in the scalar exponential series for the diagonal entry AiiA_{ii}. That is: n=0(1n!An)ii=n=01n!(Aii)n\sum_{n=0}^\infty \left(\frac{1}{n!} A^n\right)_{ii} = \sum_{n=0}^\infty \frac{1}{n!} (A_{ii})^n

theorem

(expA)ii=exp(Aii)(\exp A)_{ii} = \exp(A_{ii}) for Upper-Triangular Matrices

#diag_exp_of_blockTriangular_id

Let AA be an m×mm \times m upper-triangular matrix (formally defined as `BlockTriangular A id`) over a field K\mathbb{K}. The ii-th diagonal entry of the matrix exponential expA\exp A is equal to the scalar exponential of the ii-th diagonal entry of AA. That is, for any index ii: (expA)ii=exp(Aii) (\exp A)_{ii} = \exp(A_{ii})

theorem

det(expA)=exp(tr A)\det(\exp A) = \exp(\text{tr } A) for Upper-Triangular Matrices

#det_exp_of_blockTriangular_id

Let AA be an m×mm \times m upper-triangular matrix (formally defined as `BlockTriangular A id`) over a field K\mathbb{K}. The determinant of the matrix exponential of AA is equal to the exponential of the trace of AA. That is: det(expA)=exp(tr A)\det(\exp A) = \exp(\text{tr } A)

theorem

Trace Invariance under Unitary Conjugation

#trace_unitary_conj

For any m×mm \times m matrix AA over a field K\mathbb{K} and any unitary matrix UU in the unitary group U(m,K)\text{U}(m, \mathbb{K}), the trace is invariant under unitary conjugation: tr(UAU)=tr(A)\text{tr}(U A U^*) = \text{tr}(A) where UU^* denotes the adjoint (conjugate transpose) of the matrix UU.

theorem

det(UAU)=detA\det(U A U^*) = \det A for unitary matrices UU

#det_unitary_conj

Let AA be a square matrix of size m×mm \times m over a field K\mathbb{K}, and let UU be an element of the unitary group of degree mm over K\mathbb{K}. Then the determinant of the matrix product UAUU A U^* is equal to the determinant of AA, where UU^* denotes the adjoint (star) of the unitary matrix UU.

theorem

exp(UAU)=U(expA)U\exp(U A U^*) = U (\exp A) U^*

#exp_unitary_conj

For any m×mm \times m matrix AA and any unitary matrix UU in the unitary group, the matrix exponential of the unitary conjugation of AA is equal to the unitary conjugation of the exponential of AA: exp(UAU)=U(expA)U\exp(U A U^*) = U (\exp A) U^* where UU^* denotes the adjoint (conjugate transpose) of the matrix UU. This property shows that the matrix exponential commutes with unitary conjugation.

theorem

det(exp(UAU))=det(expA)\det(\exp(U A U^*)) = \det(\exp A) for unitary UU

#det_exp_unitary_conj

Let AA be an m×mm \times m matrix over a field K\mathbb{K}, and let UU be a unitary matrix in the unitary group of degree mm. The determinant of the matrix exponential of the unitary conjugation of AA is equal to the determinant of the matrix exponential of AA: det(exp(UAU))=det(expA)\det(\exp(U A U^*)) = \det(\exp A) where UU^* denotes the adjoint (conjugate transpose) of the matrix UU.

theorem

Lie's Trace Formula: det(expA)=exp(tr A)\det(\exp A) = \exp(\text{tr } A)

#det_exp

Let K\mathbb{K} be an algebraically closed field that satisfies the properties of the real or complex numbers (specifically an `RCLike` field), and let mm be a finite index set. For any square matrix AMatm×m(K)A \in \text{Mat}_{m \times m}(\mathbb{K}), the determinant of the matrix exponential of AA is equal to the exponential of the trace of AA. That is: det(expA)=exp(tr A)\det(\exp A) = \exp(\text{tr } A) This identity is known as **Lie's trace formula**.

theorem

A continuous additive homomorphism ff commutes with the sum of a matrix series: f(sk)=f(sk)f(\sum s_k) = \sum f(s_k)

#map_tsum

Let α\alpha and β\beta be additive commutative monoids and topological spaces, where β\beta is a Hausdorff space. Let f:αβf: \alpha \to \beta be a continuous additive homomorphism. For a sequence of m×nm \times n matrices sks_k with entries in α\alpha, if the series k=0sk\sum_{k=0}^{\infty} s_k is summable, then the application of ff to each entry of the sum of the series is equal to the sum of the matrices obtained by applying ff to each entry of each sks_k. That is, f(k=0sk)=k=0f(sk) f\left( \sum_{k=0}^{\infty} s_k \right) = \sum_{k=0}^{\infty} f(s_k) where ff is applied entry-wise to the matrices.

theorem

Matrix Exponential Commutes with RC\mathbb{R} \hookrightarrow \mathbb{C} Inclusion Entry-wise

#exp_map_algebraMap

Let nn be a finite index set and AA be an n×nn \times n matrix with entries in the real numbers R\mathbb{R}. Let ι:RC\iota: \mathbb{R} \to \mathbb{C} denote the standard inclusion (canonical map) from the real numbers to the complex numbers. The theorem states that applying this inclusion entry-wise to the matrix exponential exp(A)\exp(A) yields the same result as taking the matrix exponential of the matrix AA after its entries have been mapped to C\mathbb{C} via ι\iota. In formula terms: map(ι,expA)=exp(map(ι,A)) \text{map}(\iota, \exp A) = \exp(\text{map}(\iota, A)) where exp\exp denotes the matrix exponential.

theorem

Lie's Trace Formula for Real Matrices: det(expA)=exp(tr A)\det(\exp A) = \exp(\text{tr } A)

#det_exp_real

Let nn be a finite index set and let AA be an n×nn \times n matrix with entries in the real numbers R\mathbb{R}. The determinant of the matrix exponential of AA is equal to the exponential of the trace of AA. That is: det(expA)=exp(tr A)\det(\exp A) = \exp(\text{tr } A) where exp\exp denotes the matrix exponential on the left-hand side and the standard exponential function on R\mathbb{R} on the right-hand side, and tr A\text{tr } A is the trace of the matrix. This identity is known as **Lie's trace formula** for real matrices.