* Implementation of GiNaC's clifford algebra (Dirac gamma) objects. */
/*
- * GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2002 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
+#include <iostream>
+#include <stdexcept>
+
#include "clifford.h"
#include "ex.h"
#include "idx.h"
#include "archive.h"
#include "utils.h"
-#include <stdexcept>
-
namespace GiNaC {
GINAC_IMPLEMENT_REGISTERED_CLASS(clifford, indexed)
if (is_a<diracgamma>(c.op(0))) { // proper dirac gamma object
i = c.op(1);
b = _ex1;
+ } else if (is_a<diracgamma5>(c.op(0))) { // gamma5
+ i = _ex0;
+ b = _ex1;
} else { // slash object, generate new dummy index
varidx ix((new symbol)->setflag(status_flags::dynallocated), ex_to<idx>(c.op(1)).get_dim());
b = indexed(c.op(0), ix.toggle_variance());
if (is_a<clifford>(*other)) {
+ // Contraction only makes sense if the represenation labels are equal
+ if (ex_to<clifford>(*other).get_representation_label() != rl)
+ return false;
+
ex dim = ex_to<idx>(self->op(1)).get_dim();
// gamma~mu gamma.mu = dim ONE
}
}
- // Remove squares of gamma5
- while (s.size() >= 2 && is_a<clifford>(s[0]) && is_a<clifford>(s[1]) && is_a<diracgamma5>(s[0].op(0)) && is_a<diracgamma5>(s[1].op(0))) {
- s.erase(s.begin(), s.begin() + 2);
- something_changed = true;
- }
-
// Remove equal adjacent gammas
if (s.size() >= 2) {
exvector::iterator it, itend = s.end() - 1;
ex & b = it[1];
if (!is_a<clifford>(a) || !is_a<clifford>(b))
continue;
- if (is_a<diracgamma>(a.op(0)) && is_a<diracgamma>(b.op(0))) {
+ bool a_is_diracgamma = is_a<diracgamma>(a.op(0));
+ bool b_is_diracgamma = is_a<diracgamma>(b.op(0));
+ if (a_is_diracgamma && b_is_diracgamma) {
const ex & ia = a.op(1);
const ex & ib = b.op(1);
if (ia.is_equal(ib)) { // gamma~alpha gamma~alpha -> g~alpha~alpha
b = dirac_ONE(representation_label);
something_changed = true;
}
- } else if (!is_a<diracgamma>(a.op(0)) && !is_a<diracgamma>(b.op(0))) {
+ } else if (is_a<diracgamma5>(a.op(0)) && is_a<diracgamma5>(b.op(0))) {
+ // Remove squares of gamma5
+ a = dirac_ONE(representation_label);
+ b = dirac_ONE(representation_label);
+ something_changed = true;
+ } else if (!a_is_diracgamma && !b_is_diracgamma) {
const ex & ba = a.op(0);
const ex & bb = b.op(0);
if (ba.is_equal(bb)) { // a\ a\ -> a^2
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 * (eps0123(i1, i2, i3, i4) * b1 * b2 * b3 * b4).simplify_indexed();
+ 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 (unsigned i=1; i<num; i++)
base_and_index(e.op(i), bv[i-1], ix[i-1]);
v.push_back(ix[n]);
}
int sign = permutation_sign(iv, iv + num);
- result += sign * eps0123(idx1, idx2, idx3, idx4)
+ 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);
}
}