![]() |
![]() |
![]() |
|
![]() |
![]() |
||
![]() |
![]() |
||
![]() |
![]() |
||
![]() |
![]() |
||
![]() |
![]() |
(7.65) |
This leads to
![]() |
![]() |
![]() |
(7.66) |
![]() |
![]() |
![]() |
(7.67) |
where
is
for
, an even permutation of
and
is
for an odd permutation, and is 0 it two indices are the same
Proof: For a non-vanishing contribution all components of
must be different and the total contribution is the sum of the various
combinations of components multiplied by the sign of the permutation.
To fix the overall sign take an example case:
![]() |
![]() |
![]() |
|
![]() |
![]() |
(7.68) |