Strange non-vanishing higher order terms in the perturbation of a metric determinat

60 views
Skip to first unread message

Young-Hwan Hyun

unread,
Nov 23, 2015, 6:44:09 AM11/23/15
to xAct Tensor Computer Algebra
HI,

I'm  recently learning the xAct package.
I tried to get the 3-dimentional flat metric perturbation in the traceless condition.
γ_{ij}=exp[h]_{ij}, h_{ii}=0.
The result should be 1 because Det[γ_{ij}]=Exp[tr[h_{ij}]]=1.
But the xPert package gave me the non-vanishing 4-th order term.
Why does this happen?
I attached my nb note.

(I posted my writing before, but I can't see my posting in the group board.
So I'm writing this again.)
Perturbed_Detg.nb

Cyril Pitrou

unread,
Nov 23, 2015, 11:29:54 AM11/23/15
to Young-Hwan Hyun, xAct Tensor Computer Algebra
Dear Young-Hwan,

Thanks for your nice minimal example.

This is partly my fault. When you look at xPert code, you can see that in the section dedicated to the perturbation of determinants, there are two different methods. One when the order is less or equal than the dimension and one when the order is stricly larger than the dimension.

The method when order <= dim is based on Log@Trace formula and I implemented it using the tools of sorted partitions provided in xPert.

In case you are looking for, the code is

ExpandPerturbation1[Perturbation[mdet, order_.]] :=
    mdet order! Plus @@
     Map[(-1)^Length[#] productPertDet2[#, vbundle, pert] &,
      SortedPartitions[order]] /; ! IntegerQ[dim] || order <= dim;

The method when order > dim is found right above this piece of code and it looks like

ExpandPerturbation1[Perturbation[mdet, order_.]] := blabla /;IntegerQ[dim] && order > dim;

In general, for nxn matrices, whenever we have a product of n+1 matrices and then a trace, this can be expressed in terms of other types of products and traces. For instance, in the example I attach, in 2 dimension, any traceless matrix A is such that Tr[A.A.A]=0. This is true only in dim=2 and wrong in dim=3.
The first method is the fastest one, but it fails to use the fact that there are identities between traces of products of matrices so it would give results for the perturbation dim+1 dim+2 etc... and these should all vanish due to these identities. The second method is slightly slower, but by construction it has no perturbation if there was only the first order perturbation in the metric (dg[LI[1],i,j] is the only non-vanishing perturbation) in the case order > dim so it can be thought of as the method given the most compact result.

So the current state of xPert is to take the best of both world. The fastest when order <= dim, and the one which gives essentially 0 when order > dim (the most compact result).

In your case, your method would give the right result only if the Log-Trace method is used in all cases.
So you could modify xPert accordingly by commenting out

ExpandPerturbation1[Perturbation[mdet, order_.]] := blabla /;IntegerQ[dim] && order > dim;

such that this is never used.

And then removing the conditions at the end of

ExpandPerturbation1[Perturbation[mdet, order_.]] :=
    mdet order! Plus @@
     Map[(-1)^Length[#] productPertDet2[#, vbundle, pert] &,
      SortedPartitions[order]] /; ! IntegerQ[dim] || order <= dim;

that is to say, commenting the '/; ! IntegerQ[dim] || order <= dim' condition so that this method is used in all cases. I have checked that in that case, the fact that the method is Exp Log based, suits perfectly your exponential and the result is 1 at all orders as you desire.

Best,
Cyril Pitrou









--
You received this message because you are subscribed to the Google Groups "xAct Tensor Computer Algebra" group.
To unsubscribe from this group and stop receiving emails from it, send an email to xact+uns...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

Perturbed_Detg.nb

Young-Hwan Hyun

unread,
Nov 23, 2015, 9:48:09 PM11/23/15
to xAct Tensor Computer Algebra, younghw...@gmail.com
Dear Cyril,

Thanks for your kind explanation.
Now I see clearly what was happening in the code.
I think your suggestion will be better than imposing different identities for each dimension case.
Thanks again!

Sincerely,
Young-Hwan Hyun


2015년 11월 24일 화요일 오전 1시 29분 54초 UTC+9, Cyril Pitrou 님의 말:
Reply all
Reply to author
Forward
0 new messages