+/** Take trace of a string of an even number of Dirac gammas given a vector
+ * of indices. */
+static ex trace_string(exvector::const_iterator ix, size_t num)
+{
+ // Tr gamma.mu gamma.nu = 4 g.mu.nu
+ if (num == 2)
+ return lorentz_g(ix[0], ix[1]);
+
+ // Tr gamma.mu gamma.nu gamma.rho gamma.sig = 4 (g.mu.nu g.rho.sig + g.nu.rho g.mu.sig - g.mu.rho g.nu.sig )
+ else if (num == 4)
+ return lorentz_g(ix[0], ix[1]) * lorentz_g(ix[2], ix[3])
+ + lorentz_g(ix[1], ix[2]) * lorentz_g(ix[0], ix[3])
+ - lorentz_g(ix[0], ix[2]) * lorentz_g(ix[1], ix[3]);
+
+ // Traces of 6 or more gammas are computed recursively:
+ // Tr gamma.mu1 gamma.mu2 ... gamma.mun =
+ // + g.mu1.mu2 * Tr gamma.mu3 ... gamma.mun
+ // - g.mu1.mu3 * Tr gamma.mu2 gamma.mu4 ... gamma.mun
+ // + g.mu1.mu4 * Tr gamma.mu3 gamma.mu3 gamma.mu5 ... gamma.mun
+ // - ...
+ // + g.mu1.mun * Tr gamma.mu2 ... gamma.mu(n-1)
+ exvector v(num - 2);
+ int sign = 1;
+ ex result;
+ for (size_t i=1; i<num; i++) {
+ for (size_t n=1, j=0; n<num; n++) {
+ if (n == i)
+ continue;
+ v[j++] = ix[n];
+ }
+ result += sign * lorentz_g(ix[0], ix[i]) * trace_string(v.begin(), num-2);
+ sign = -sign;
+ }
+ return result;
+}
+
+ex dirac_trace(const ex & e, unsigned char rl, const ex & trONE)
+{
+ if (is_a<clifford>(e)) {
+
+ if (!ex_to<clifford>(e).get_representation_label() == rl)
+ return _ex0;
+ const ex & g = e.op(0);
+ if (is_a<diracone>(g))
+ return trONE;
+ else if (is_a<diracgammaL>(g) || is_a<diracgammaR>(g))
+ return trONE/2;
+ else
+ return _ex0;
+
+ } else if (is_exactly_a<mul>(e)) {
+
+ // Trace of product: pull out non-clifford factors
+ ex prod = _ex1;
+ for (size_t i=0; i<e.nops(); i++) {
+ const ex &o = e.op(i);
+ if (is_clifford_tinfo(o.return_type_tinfo(), rl))
+ prod *= dirac_trace(o, rl, trONE);
+ else
+ prod *= o;
+ }
+ return prod;
+
+ } else if (is_exactly_a<ncmul>(e)) {
+
+ if (!is_clifford_tinfo(e.return_type_tinfo(), rl))
+ return _ex0;
+
+ // Substitute gammaL/R and expand product, if necessary
+ ex e_expanded = e.subs(lst(
+ dirac_gammaL(rl) == (dirac_ONE(rl)-dirac_gamma5(rl))/2,
+ dirac_gammaR(rl) == (dirac_ONE(rl)+dirac_gamma5(rl))/2
+ ), subs_options::no_pattern).expand();
+ if (!is_a<ncmul>(e_expanded))
+ return dirac_trace(e_expanded, rl, trONE);
+
+ // gamma5 gets moved to the front so this check is enough
+ bool has_gamma5 = is_a<diracgamma5>(e.op(0).op(0));
+ size_t num = e.nops();
+
+ if (has_gamma5) {
+
+ // Trace of gamma5 * odd number of gammas and trace of
+ // gamma5 * gamma.mu * gamma.nu are zero
+ if ((num & 1) == 0 || num == 3)
+ return _ex0;
+
+ // Tr gamma5 gamma.mu gamma.nu gamma.rho gamma.sigma = 4I * epsilon(mu, nu, rho, sigma)
+ // (the epsilon is always 4-dimensional)
+ if (num == 5) {
+ ex b1, i1, b2, i2, b3, i3, b4, i4;
+ base_and_index(e.op(1), b1, i1);
+ base_and_index(e.op(2), b2, i2);
+ base_and_index(e.op(3), b3, i3);
+ base_and_index(e.op(4), b4, i4);
+ return trONE * I * (lorentz_eps(ex_to<idx>(i1).replace_dim(_ex4), ex_to<idx>(i2).replace_dim(_ex4), ex_to<idx>(i3).replace_dim(_ex4), ex_to<idx>(i4).replace_dim(_ex4)) * b1 * b2 * b3 * b4).simplify_indexed();
+ }
+
+ // Tr gamma5 S_2k =
+ // I/4! * epsilon0123.mu1.mu2.mu3.mu4 * Tr gamma.mu1 gamma.mu2 gamma.mu3 gamma.mu4 S_2k
+ // (the epsilon is always 4-dimensional)
+ exvector ix(num-1), bv(num-1);
+ for (size_t i=1; i<num; i++)
+ base_and_index(e.op(i), bv[i-1], ix[i-1]);
+ num--;
+ int *iv = new int[num];
+ ex result;
+ for (size_t i=0; i<num-3; i++) {
+ ex idx1 = ix[i];
+ for (size_t j=i+1; j<num-2; j++) {
+ ex idx2 = ix[j];
+ for (size_t k=j+1; k<num-1; k++) {
+ ex idx3 = ix[k];
+ for (size_t l=k+1; l<num; l++) {
+ ex idx4 = ix[l];
+ iv[0] = i; iv[1] = j; iv[2] = k; iv[3] = l;
+ exvector v;
+ v.reserve(num - 4);
+ for (size_t n=0, t=4; n<num; n++) {
+ if (n == i || n == j || n == k || n == l)
+ continue;
+ iv[t++] = n;
+ v.push_back(ix[n]);
+ }
+ int sign = permutation_sign(iv, iv + num);
+ result += sign * lorentz_eps(ex_to<idx>(idx1).replace_dim(_ex4), ex_to<idx>(idx2).replace_dim(_ex4), ex_to<idx>(idx3).replace_dim(_ex4), ex_to<idx>(idx4).replace_dim(_ex4))
+ * trace_string(v.begin(), num - 4);
+ }
+ }
+ }
+ }
+ delete[] iv;
+ return trONE * I * result * mul(bv);
+
+ } else { // no gamma5
+
+ // Trace of odd number of gammas is zero
+ if ((num & 1) == 1)
+ return _ex0;
+
+ // Tr gamma.mu gamma.nu = 4 g.mu.nu
+ if (num == 2) {
+ ex b1, i1, b2, i2;
+ base_and_index(e.op(0), b1, i1);
+ base_and_index(e.op(1), b2, i2);
+ return trONE * (lorentz_g(i1, i2) * b1 * b2).simplify_indexed();
+ }
+
+ exvector iv(num), bv(num);
+ for (size_t i=0; i<num; i++)
+ base_and_index(e.op(i), bv[i], iv[i]);
+
+ return trONE * (trace_string(iv.begin(), num) * mul(bv)).simplify_indexed();
+ }
+
+ } else if (e.nops() > 0) {
+
+ // Trace maps to all other container classes (this includes sums)
+ pointer_to_map_function_2args<unsigned char, const ex &> fcn(dirac_trace, rl, trONE);
+ return e.map(fcn);
+
+ } else
+ return _ex0;
+}
+
+ex canonicalize_clifford(const ex & e)
+{
+ // Scan for any ncmul objects
+ exmap srl;
+ ex aux = e.to_rational(srl);
+ for (exmap::iterator i = srl.begin(); i != srl.end(); ++i) {
+
+ ex lhs = i->first;
+ ex rhs = i->second;
+
+ if (is_exactly_a<ncmul>(rhs)
+ && rhs.return_type() == return_types::noncommutative
+ && is_clifford_tinfo(rhs.return_type_tinfo())) {
+
+ // Expand product, if necessary
+ ex rhs_expanded = rhs.expand();
+ if (!is_a<ncmul>(rhs_expanded)) {
+ i->second = canonicalize_clifford(rhs_expanded);
+ continue;
+
+ } else if (!is_a<clifford>(rhs.op(0)))
+ continue;
+
+ exvector v;
+ v.reserve(rhs.nops());
+ for (size_t j=0; j<rhs.nops(); j++)
+ v.push_back(rhs.op(j));
+
+ // Stupid recursive bubble sort because we only want to swap adjacent gammas
+ exvector::iterator it = v.begin(), next_to_last = v.end() - 1;
+ if (is_a<diracgamma5>(it->op(0)) || is_a<diracgammaL>(it->op(0)) || is_a<diracgammaR>(it->op(0)))
+ ++it;
+ while (it != next_to_last) {
+ if (it[0].compare(it[1]) > 0) {
+ ex save0 = it[0], save1 = it[1];
+ ex b1, i1, b2, i2;
+ base_and_index(it[0], b1, i1);
+ base_and_index(it[1], b2, i2);
+ it[0] = (ex_to<clifford>(save0).get_metric(i1, i2) * b1 * b2).simplify_indexed();
+ it[1] = v.size() == 2 ? _ex2 * dirac_ONE(ex_to<clifford>(it[1]).get_representation_label()) : _ex2;
+ ex sum = ncmul(v);
+ it[0] = save1;
+ it[1] = save0;
+ sum -= ncmul(v, true);
+ i->second = canonicalize_clifford(sum);
+ goto next_sym;
+ }
+ ++it;
+ }
+next_sym: ;
+ }
+ }
+ return aux.subs(srl, subs_options::no_pattern).simplify_indexed();
+}
+
+ex clifford_prime(const ex &e)
+{
+ pointer_to_map_function fcn(clifford_prime);
+ if (is_a<clifford>(e) && is_a<cliffordunit>(e.op(0))) {
+ return -e;
+ } else if (is_a<add>(e)) {
+ return e.map(fcn);
+ } else if (is_a<ncmul>(e)) {
+ return e.map(fcn);
+ } else if (is_a<power>(e)) {
+ return pow(clifford_prime(e.op(0)), e.op(1));
+ } else
+ return e;
+}
+
+ex delete_ONE(const ex &e)
+{
+ pointer_to_map_function fcn(delete_ONE);
+ if (is_a<clifford>(e) && is_a<diracone>(e.op(0))) {
+ return 1;
+ } else if (is_a<add>(e)) {
+ return e.map(fcn);
+ } else if (is_a<ncmul>(e)) {
+ return e.map(fcn);
+ } else if (is_a<mul>(e)) {
+ return e.map(fcn);
+ } else if (is_a<power>(e)) {
+ return pow(delete_ONE(e.op(0)), e.op(1));
+ } else
+ return e;
+}
+
+ex clifford_norm(const ex &e)
+{
+ return sqrt(delete_ONE((e * clifford_bar(e)).simplify_indexed()));
+}
+
+ex clifford_inverse(const ex &e)
+{
+ ex norm = clifford_norm(e);
+ if (!norm.is_zero())
+ return clifford_bar(e) / pow(norm, 2);
+}
+
+ex lst_to_clifford(const ex & v, const ex & mu, const ex & metr, unsigned char rl)
+{
+ unsigned min, max;
+ if (!ex_to<idx>(mu).is_dim_numeric())
+ throw(std::invalid_argument("Index should have a numeric dimension"));
+ unsigned dim = (ex_to<numeric>(ex_to<idx>(mu).get_dim())).to_int();
+ ex c = clifford_unit(mu, metr, rl);
+
+ if (is_a<matrix>(v)) {
+ if (ex_to<matrix>(v).cols() > ex_to<matrix>(v).rows()) {
+ min = ex_to<matrix>(v).rows();
+ max = ex_to<matrix>(v).cols();
+ } else {
+ min = ex_to<matrix>(v).cols();
+ max = ex_to<matrix>(v).rows();
+ }
+ if (min == 1) {
+ if (dim == max)
+ if (is_a<varidx>(mu)) // need to swap variance
+ return indexed(v, ex_to<varidx>(mu).toggle_variance()) * c;
+ else
+ return indexed(v, mu) * c;
+ else
+ throw(std::invalid_argument("Dimensions of vector and clifford unit mismatch"));
+ } else
+ throw(std::invalid_argument("First argument should be a vector vector"));
+ } else if (is_a<lst>(v)) {
+ if (dim == ex_to<lst>(v).nops())
+ return indexed(matrix(dim, 1, ex_to<lst>(v)), ex_to<varidx>(mu).toggle_variance()) * c;
+ else
+ throw(std::invalid_argument("List length and dimension of clifford unit mismatch"));
+ } else
+ throw(std::invalid_argument("Cannot construct from anything but list or vector"));
+}
+
+} // namespace GiNaC