determine the Petrov type of the Weyl tensor - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : DifferentialGeometry : Tensor : DifferentialGeometry/Tensor/PetrovType

Tensor[PetrovType] - determine the Petrov type of the Weyl tensor

Calling Sequences

     PetrovType(g, pt, options)

     PetrovType(NTetrad, pt, options)

     PetrovType(NPWeyl, pt, options)

     PetrovType(Fr, pt, options)

 

Parameters

   g        - a metric tensor g of Lorentz signature 1,1,1,1 on a four-dimensional manifold M

   Fr       - the name of an initialized anholonomic frame, created from a null tetrad

   NTetrad  - a list of 4 vectors defining a null tetrad

   NPWeyl   - a table, the Newman-Penrose Weyl scalars

   pt       - (optional) a list of equations specifying the coordinates of a point of M

    options  -  the keyword arguments output, parameters, auxiliaryequations

 

Description

Examples

See Also

Description

• 

The Petrov classification of the Weyl tensor of the metric g is an algebraic classification based upon the eigenvalues and eigenvectors for the Weyl tensor, the principal null directions associated to the Weyl tensor, or the factorized form of the Weyl spinor. The Weyl tensor is determined to be one of the following types "O", "N", "D", "I", "II", "III".  See Stephani, Kramer, et al for details.

• 

Because the algorithm is based upon the calculation of the Newman-Penrose Weyl scalars, it is best to use one of the last 3 calling sequences.  The second and fourth calling sequences use a null tetrad L,N,M,M, where L and N are real, M is the complex conjugate of M, and

gL,N=1,   gM,M=1, 

where g is the metric.

• 

Note that the Weyl scalars can often be simplified through the application of an appropriate null tetrad rotation. The first calling sequence PetrovType(g, pt, option) will automatically generate a null tetrad (if possible) but the result may not be optimal for calculating all the invariants needed to determine the Petrov type.

• 

It is possible that the Petrov type can vary from point to point on the manifold M. The command PetrovType  returns, if possible, the Petrov type at a generic point. If the command fails, try to calculate Petrov type at a specific point with the optional argument pt. Constraints on the coordinates values can be imposed with assuming.

• 

The values of the invariants used to test for a given Petrov type will be returned with the keyword argument output = petrovtype, where petrovtype is one of "O", "N" , "D", "I", "II", "III".

• 

If the metric or null tetrad depends upon a number of parameters (either constants or functions), then the keyword argument parameters= ParList,where ParList is the list of parameters, will invoke case-splitting with respect to these parameters. Special values of the parameters, where the Petrov type changes, are calculated. Additional algebraic or differential conditions may be imposed upon the parameters using the keyword argument auxiliaryequations = EqList. The case-splitting algorithm is as follows. First, the Petrov type for generic values of the parameters, independent of the auxiliary equations is determined. Then the algebraic and differential conditions that the parameters must satisfy for non-generic types are computed. These are combined with the auxiliary equations and the combined set of equations are passed to pdsolve. This results in a list of exceptional parameter values for the non-generic cases. The Petrov type of each exceptional set of parameter values is re-computed and the results returned in a table format.

• 

The branching performed by the program PetrovType can be tracked by setting infolevel[PetrovType] = 2.

• 

See Details for PetrovType for a complete description of the algorithm used.

• 

This command is part of the DifferentialGeometry:-Tensor package and can be used in the form PetrovType(...) only after executing the commands with(DifferentialGeometry); with(Tensor); in that order.  It can always be used in the long form DifferentialGeometry:-Tensor:-PetrovType.

Examples

withDifferentialGeometry:withTensor:

 

For Examples 1 -- 4 we use the following metric.

DGsetupt,x,y,z,M

frame name: M

(2.1)
M > 

gevalDG1x2dt&tdtdx&tdxdy&tdydz&tdz

g1x2dtdtdxdxdydydzdz

(2.2)

 

Example 1.

Calculate the Petrov type directly from the metric.

M > 

PetrovTypeg

D

(2.3)

 

Example 2.

Calculate the Petrov type from a null tetrad for the metric g. First use the command DGGramSchmidt to construct an orthonormal tetrad.

M > 

OTetradDGGramSchmidtD_t&comma;D_x&comma;D_y&comma;D_z&comma;g&comma;signature=1&comma;1&comma;1&comma;1assuming0<x

OTetradxD_t&comma;D_x&comma;D_y&comma;D_z

(2.4)
M > 

NTetradNullTetradOTetrad

NTetrad2x2D_t+22D_z&comma;2x2D_t22D_z&comma;22D_x+I22D_y&comma;22D_xI22D_y

(2.5)
M > 

PetrovTypeNTetrad

D

(2.6)

 

Example 3.

If one intends to do a number of computations with the metric g it is usually advantageous to work explicitly with an orthonormal frame or null tetrad frame. See FrameData.

M > 

FDFrameDataNTetrad&comma;NP

FDE1&comma;E3=2E14x2E24x&comma;E1&comma;E4=2E14x2E24x&comma;E2&comma;E3=2E14x2E24x&comma;E2&comma;E4=2E14x2E24x

(2.7)
M > 

DGsetupFD

frame name: NP

(2.8)
NP > 

PetrovTypeNP

D

(2.9)

 

Example 4.

Here we first calculate the Newman-Penrose Weyl scalars (We continue with the null tetrad frame from the previous example). This is always the best way to proceed since one can simplify, if need be, the Weyl scalars, before proceeding to calculate the more complicated invariants needed by the algorithm to determine the Petrov type.

NP > 

WSNPCurvatureScalarsNTetrad&comma;output=WeylScalars

WStablePsi1=0&comma;Psi3=0&comma;Psi0=12x2&comma;Psi4=12x2&comma;Psi2=16x2

(2.10)
M > 

PetrovTypeWS

D

(2.11)

 

Example 5.

In this example we find all functions f(x, v) for which the following orthonormal frame has Petrov type "N". In this situation the PetrovType procedure is terminated once it has calculated the invariants whose vanishing leads to the type "N" classification. (See Step 2 in the description of the algorithm in Details for PetrovType.) First define the coordinates for this example.

M > 

DGsetupx&comma;y&comma;u&comma;v&comma;N

frame name: N

(2.12)

 

Define the metric.

N > 

g5evalDGdx&tdxdy&tdy+2du&sdv+fx&comma;v2du&tdu

g5dxdxdydy+fx&comma;v2dudu+dudv+dvdu

(2.13)

 

Calculate an orthonormal tetrad and then a null tetrad.

N > 

OTetrad5DGGramSchmidtD_u&comma;D_v&comma;D_x&comma;D_y&comma;g5&comma;signature=1&comma;1&comma;1&comma;1assuming0<fx&comma;v

OTetrad51fx&comma;vD_u&comma;1fx&comma;vD_u+fx&comma;vD_v&comma;D_x&comma;D_y

(2.14)
N > 

NTetrad5NullTetradOTetrad5

NTetrad522D_y+22fx&comma;vD_u&comma;22D_y+22fx&comma;vD_u&comma;I22D_x22fx&comma;vD_u+2fx&comma;v2D_v&comma;I22D_x22fx&comma;vD_u+2fx&comma;v2D_v

(2.15)

 

With the optional argument output = "N", the procedure will return the partial differential equations that fx&comma; v must satisfy for the metric to be of type "N". These PDE are too complicated to exhibit in their "raw" form but become quite simple if we use the command rifsimp to simplify.

N > 

PDEPetrovTypeNTetrad5&comma;output=N&colon;

M > 

PDE1DEtoolsrifsimpPDESolved

PDE12vxfx&comma;v=xfx&comma;vvfx&comma;vfx&comma;v&comma;2v2fx&comma;v=vfx&comma;v2fx&comma;v

(2.16)

 

Use pdsolve to find the general solution to PDE1.

M > 

SolnpdsolvePDE1

Solnfx&comma;v=2_C1v+2_F2x

(2.17)

 

Back substitute into the null tetrad NTetrad and check that the resulting null tetrad is of type "N".

M > 

NTetrad5aevalNTetrad5&comma;Soln

NTetrad5a22D_y+222_C1v+2_F2xD_u&comma;22D_y+222_C1v+2_F2xD_u&comma;I22D_x222_C1v+2_F2xD_u+22_C1v+2_F2x2D_v&comma;I22D_x222_C1v+2_F2xD_u+22_C1v+2_F2x2D_v

(2.18)
N > 

PetrovTypeNTetrad5a

N

(2.19)

 

Example 6.

This is the first of three examples which demonstrate the case-splitting functionality of PetrovType. In this example we consider a metric depending upon two constants p and q&period;  

M > 

DGsetupu&comma;v&comma;y&comma;z&comma;M

frame name: M

(2.20)
M > 

g6evalDG1y2dy&tdy2du&sdv+y2pdz&tdz+y2qdv&tdv

g61y2dudv1y2dvdu+y2qdvdv+1y2dydy+y2pdzdz

(2.21)
M > 

OTetrad6DGGramSchmidtD_u&comma;D_v&comma;D_y&comma;D_z&comma;g6&comma;signature=1&comma;1&comma;1&comma;1assuming0<p,0<y

OTetrad62yy2q+2+24D_u+2y2D_v&comma;2yy2q+224