Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
If you have an invariant, symmetric and non-degenerate bilinear form as stated, and, if $\mathfrak i$ is an ideal in $\mathfrak g$. Then, the orthogonal $\mathfrak i ^{\perp}$ of $\mathfrak i$ is also an ideal and your algebra $\mathfrak g$ splits as $\mathfrak i + \mathfrak i ^\perp$. So, for a non reductive algebra, you don't even have one such a bilinear form.
So you mean you first take a word consisting of numbers, say $w$. Then, from $w$ you have the Lehmer encoding that gives you a permutation $\sigma$. Thirdly, you apply $\sigma$ to the ordering of your letter in your intial word $w$ ?
Taking such an elliptic familly on $Y$ parametrized by $X$. For any $x$ in $X$, you have a legit elliptic pseudo-differential operator on $Y$. This way you can reduce $KK(Y, X)$ to the $K$ homology of $Y$. This is induced on $KK$ level by the map $ev_x : C(X) \to \mathbb C$
Then take $x = (1, 0, \cdots, 0)$. The point is that your question is just on comparaison of classical norms in a finite dimensional real vector space.