Optimal paths for symmetric actions in the unitary group (Q2016038)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Optimal paths for symmetric actions in the unitary group
    scientific article

      Statements

      Optimal paths for symmetric actions in the unitary group (English)
      0 references
      0 references
      0 references
      0 references
      18 June 2014
      0 references
      Let \({\mathcal L}\) be a symmetric Lagrangian defined on the algebra of \(n\times n\) complex matrices, i.e. \[ {\mathcal L}:M_n(\mathbb{C})\to \mathbb{R}^+ , \] \({\mathcal L}\) is convex and \({\mathcal L}(UAV)={\mathcal L}(A)\) for \(U,V\in{\mathcal U}(n)\) (the unitary group of \(M_n(\mathbb{C})\)). Examples of symmetric Lagrangians are the unitarily invariant norms in \(M_n(\mathbb{C})\), and the kinetic energy (square of the Frobenius norm). The action \({\mathcal S}\) induced by \({\mathcal L}\) is the functional \[ {\mathcal S}(\alpha)=\int_a^b {\mathcal L}(\dot{\alpha}(t)) dt \] defined on piecewise smooth curves in \({\mathcal U}(n)\). The main results of this paper are the following: Theorem 7: If \(U\in{\mathcal U}(n)\) and \(Z^*=Z\) with \(\|Z\|\leq \pi\), then \[ \gamma(t)=Ue^{itZ/b} \] is minimal for the action \({\mathcal S}\), among piecewise smooth curves \(\alpha:[0,b]\to {\mathcal U}(n)\) such that \(\alpha(0)=U\), \(\alpha(b)=\gamma(b)\). Theorem 12: Assuming further that \({\mathcal L}\) is strictly convex, the above curve \(\gamma\) is unique among minimal curves joining the same endpoints as \(\gamma\). These results are based on a fine theorem by \textit{R. C. Thompson} [Pac. J. Math. 66, 285--290 (1976; Zbl 0361.15014)]: If \(X,Y\in M_n(\mathbb{C})\), then there exist \(U,V\in{\mathcal U}(n)\) such that \[ |X+Y|\leq U|X|U^*+V|Y|V^*. \]
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references