Understanding the Relationship: Log, Traces, and Diagonalized Matrices

  • Thread starter Thread starter dm4b
  • Start date Start date
  • Tags Tags
    Matrices
dm4b
Messages
363
Reaction score
4
Trying to make sense of the following relation:

\sum log d_{j} = tr log(D)

with D being a diagonalized matrix.

Seems to imply the log of a diagonal matrix is the log of each element along the diagonal.

Having a hard time convincing myself that is true, though
 
Physics news on Phys.org
One more:

if M = A^{-1}DA,

why is this true:

tr A^{-1}log(D)A=tr\ log (M)
 
dm4b said:
Trying to make sense of the following relation:

\sum log d_{j} = tr log(D)

with D being a diagonalized matrix.

Seems to imply the log of a diagonal matrix is the log of each element along the diagonal.

Having a hard time convincing myself that is true, though

No, this is a fact about eigenvalues. If \lambda is an eigenvalue of D, then \log(\lambda) is an eigenvalue of \log(D).

This is usually first presented in the other direction, that if \lambda is an eigenvalue of D, then e^{\lambda} is an eigenvalue of e^D. (and the eigenvector is the same). It's very easy to see this by writing out the power series definition of eD and applying it to the eigenvector of D
 
Last edited:
  • Like
Likes 1 person
Office_Shredder said:
No, this is a fact about eigenvalues. If \lambda is an eigenvalue of D, then \log(\lambda) is an eigenvalue of \log(D).

This is usually first presented in the other direction, that if \lambda is an eigenvalue of D, then e^{\lambda} is an eigenvalue of e^D. (and the eigenvector is the same). It's very easy to see this by writing out the power series definition of eD and applying it to the eigenvector of D

ahh, thanks I should have known that.

I figured out the second one too, so no help needed on that one now.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
Back
Top