$\def\sp{\mathrm{Sym}^+}$Let $\sp \subset GL(n,\mathbb R)$ denote the manifold of positive-definite symmetric $n \times n$ matrices. I am interested in functions $A : \sp \to \sp$ that are equivariant under the natural conjugation action of $O(n)$; i.e. such that$$A(R^T X R) = R^T A(X) R$$ for all $X \in \sp, R \in O(n)$. By choosing $R \in O(n)$ to diagonalize $X$ and then letting $R$ range over reflection and permutation matrices, one can characterize these $A$ as exactly those of the form $$A(X) = \sum_{k=1}^n a(\lambda_k; \lambda_1, \ldots, \widehat{\lambda_k}, \ldots, \lambda_n)e_k \otimes e_k$$ where $\lambda_k>0$ are the (repeated) eigenvalues of $X$ with corresponding (orthonormal) eigenvectors $e_k$ and $a : (0,\infty)^n \to (0,\infty)$ is symmetric in its last $n-1$ arguments. (The $\widehat \lambda_k$ denotes omission.)

Since $a(\lambda_1;\lambda_2,\ldots,\lambda_n) = A^{11}(\mathrm{diag}(\lambda_1,\ldots,\lambda_n))$, we know that $A \in C^\infty \implies a \in C^\infty$. My question is:

Does the converse hold; i.e. if $a$ is smooth can we conclude that $A$ is smooth?

In the analogous problem for $O(n)$-invariant maps $A : \sp \to \mathbb R$ (which reduce to symmetric functions $a : (0,\infty)^n \to \mathbb R$ of the eigenvalues), we can solve this problem using Glaeser's "differentiable Newton's theorem" - we get that a smooth symmetric function of the eigenvalues is a smooth function of the symmetric matrix invariants, which are in turn smooth functions of the matrix itself. However, I'm unsure how to transfer this kind of idea to the matrix-valued setting - all I can find are references about invariant scalars (e.g. Schwarz is a nice generalization of Glaeser's result, but still not obviously of use to me). I guess my issue is that I don't know how to retain any regularity when "packing the eigenvalues back in", since the eigenspaces are not smooth functions of the matrix.

I guess one way you could think of this is as a generalization of functional calculus - if we restrict to $a$ that depend only on their first argument, then (from what I understand) functional calculus is exactly the construction of $A$ from $a$.

Some progress: I have managed to prove the polynomial version by finding a recurrence relation of equivariant matrices that induces Newton's identities on the eigenvalues:

If $a : (0,\infty)^n \to (0,\infty)$ is a polynomial symmetric in its last $n-1$ arguments, then the output components of the corresponding map $A : \sp \to \sp$ are polynomials in the input components.

However, in retrospect I'm not sure if this helps at all in attaining the smooth version. Any input from someone more familiar with this kind of stuff would be greatly appreciated - my representation/invariant/????? theory background is lacking.