Using SimTeEx to simplify polynomial expressions with tensors

Abstract

Computations with tensors are ubiquitous in fundamental physics, and so is the usage of Einstein's dummy index convention for the contraction of indices. For instance, $T_{ia}{U}_{aj}$ is readily recognized as the same as $T_{ib}{U}_{bj}$, but a computer does not know that T[i,a]U[a,j] is equal to T[i,b]U[b,j]. Furthermore, tensors may have symmetries which can be used to simply expressions: if $U_{ij}$ is antisymmetric, then $\hat{I}\pm T_{ia}{U}_{aj}+{\hat{I}}^2{T}_{ib}{U}_{jb}=\left(\hat{I}\pm -{\hat{I}}^2\right)T_{ia}{U}_{aj}$. The fact that tensors can have elaborate symmetries, together with the problem of dummy indices, makes it complicated to simplify polynomial expressions with tensors. In this work I will present an algorithm for doing so, which was implemented in the Mathematica package SimTeEx (Simplify Tensor Expressions). It can handle any kind of tensor symmetry.

Corrected the symmetry of the kappa tensor mentioned on page 2. 27 pages