Algebra with positive definite symmetrizing trace is semisimple.   This is a follow-up question to 
When does a symmetric algebra over a field of characteristic 0 fail to be semisimple?
Let $H$ be a symmetric algebra over  $\mathbb{R}$ with symmetrizing trace  $\tau:H\to \mathbb{R}$ such that the corresponding bilinear form $H \times H \to \mathbb{R}, (h,h') \mapsto \tau(hh')$ is positive definite.  Assume also that $H$ is split over  $\mathbb{R}$.  Then we can choose an orthonormal basis  $\mathcal{B}$ for the bilinear form.  Thus
for each simple  $H$-module, the Schur element $c_V$ is given by
$$
c_V = \frac{1}{\dim_\mathbb{R} V} \sum_{b \in \mathcal{B}}\chi_V(b)^2 \geq 0.
$$
Moreover,  $c_V = 0$ implies that $\chi_V(h) = 0$ for all $h \in H$, but this contradicts the assumption  $V \neq 0$.
Hence all the Schur elements are nonzero, so $H$ is semisimple.

Does anyone know a reference for this result?   
Does anyone know of generalizations of this result?  Specifically, is there a more general setting in which positive definiteness can be defined and can this still be used to conclude that  $H$ is semisimple? For instance, suppose  $H$ is an algebra over  $\mathbb{R}(q)$, for an indeterminate $q$. Does the result hold without the assumption that $H$ is split?

 A: There is a lemma due to Dieudonné that is similar and may be the generalization you are seeking.  (My reference is Nathan Jacobson's book "Structure and Representations of Jordan algebras", in Chapter VI on pages 239, 240.)  We replace the real numbers with a field $F$---this can be any field.
Let $A$ be a finite-dimensional and possibly nonassociative $F$-algebra.  (This means that $A$ is a vector space and there is a bilinear map $A \times A \to F$ that we view as the product on $A$.  We don't make any other assumptions about the product.) 
Dieudonné says: 

If there is a nondegenerate and
  associative bilinear form $b$ on $A$,
  and $A$ has no nonzero ideals $I$ such
  that $I^2 = 0$, then $A$ is a direct
  sum of simple ideals.

To fill in a couple of definitions: The form $b$ is nondegenerate (a generalization of "positive definite") if for every nonzero $x \in A$ there is a $y \in A$ so that $b(x, y)$ is not zero.  It is associative if $b(xy, z) = b(x, yz)$ for all $x,y,z \in A$.  This $b$ plays the role of your $\tau$.
Added
If you assume that the multiplication on $A$ is associative, then each element comes with a "generic minimal polynomial" which mimics the properties of the characteristic polynomial in the case of $n$-by-$n$ matrices.  The linear coefficient gives an analogue of the trace $tr: A \to F$ which lets us define a symmetric bilinear form $t(a, a') := tr(aa')$.  This form is obviously "associative" in the above sense (because $A$ is associative).  Furthermore, if $I$ is an ideal of $A$ such that $I^2 = 0$, then every $i \in I$ and $a \in A$ satisfy $t(i, a) = tr(ia)$, which is 0 because $ia$ is nilpotent.  Therefore, as Mariano points out, one finds (without Dieudonné):

If the bilinear form $t$ is non-degenerate, then $A$ is a direct sum of simple ideals.

This provides the condition for semisimplicity in terms of a bilinear form that you were asking for.
A: Though not an answer to the request for references, I'd like to add the fact that these algebras are trivial:
If $A$ is a split, symmetric $\mathbb{R}$-algebra with positive definite trace form (in the above mentioned sense), it is semisimple as proven above. It is therefore a product of matrixrings over $\mathbb{R}$ and the traceform is a linear combination with positive coefficients of the traces of these matrixrings. But the trace on $\mathbb{R}^{d\times d}$ is not positive definite if $d>1$ because there are nonzero matrizes with square zero. Therefore we get an algebra isomorphism $A \cong \mathbb{R} \times \ldots \times \mathbb{R}$.
If there is indeed a generalization of this result to other fields than $\mathbb{R}$, this proof would probably carry over.
