Kolmogorovʹs complexity for positive definite matrices Original Research Article

Based on Kolmogorovʹs idea, complexity of positive definite matrices with respect to a unit vector is defined. We show that the range of the complexity coincides with the logarithm of its spectrum and the order induced by the complexity is equivalent to the spectral one. This order implies the reversed one induced by the operator entropy.