Solve Ra[bcd]=0: What Permutations Work?

  • Context: Undergrad 
  • Thread starter Thread starter Kevin McHugh
  • Start date Start date
  • Tags Tags
    Expression Mean
Click For Summary

Discussion Overview

The discussion revolves around the expression Ra[bcd] = 0 and seeks to identify which permutations of the indices b, c, and d result in this expression being zero. Participants explore the properties of the Riemann tensor, particularly its antisymmetry and implications for the permutations of indices.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants propose that Ra[bcd] represents an antisymmetrized tensor, while others confirm this interpretation.
  • One participant notes that the expression Rabcd + Racdb + Radbc = 0 eliminates only one of the 21 possible components.
  • Another participant suggests that permutations of b, c, and d lead to replication in the expressions, questioning how many unique combinations yield useful information.
  • It is mentioned that the first Bianchi identity holds true for any combination of indices, but not all combinations provide significant insights.
  • Some participants discuss specific cases, such as when a = b or b = c, leading to trivial identities (0 = 0) rather than informative results.
  • There is a suggestion that the symmetries of the Riemann tensor might simplify the analysis of the permutations.

Areas of Agreement / Disagreement

Participants express differing views on the implications of the Bianchi identity and the significance of various index combinations. There is no consensus on which specific permutations of b, c, and d make Ra[bcd] equal to zero, and the discussion remains unresolved.

Contextual Notes

Some participants acknowledge their uncertainty regarding the manipulation of indices and the interpretation of the Riemann tensor's properties, indicating a reliance on further clarification and exploration of the topic.

Kevin McHugh
Messages
319
Reaction score
165
Given: Ra[bcd] = 0
What permutations of bcd make this expression 0? TIA for your response.
 
Physics news on Phys.org
Kevin McHugh said:
Given: Ra[bcd] = 0
What permutations of bcd make this expression 0? TIA for your response.
Rabcd+Racdb+Radbc=0
 
I think this is an anti-symmetrised tensor, not a symmetrised one, isn't it?
 
Ibix said:
I think this is an anti-symmetrised tensor, not a symmetrised one, isn't it?

Yes it is an antisymmetric tensor.
 
Samy_A said:
Rabcd+Racdb+Radbc=0

Samy, I'm afraid I'm too thick to understand your answer. Can you elaborate further please? IIRC, this expression only eliminates one expression from the 21 possible components.
 
I'm pretty new to index gymnastics too, so check what I am saying with other sources.

I think Samy has written ##R_{a (bcd)}##, not ##R_{a [bcd]}##. The latter is ##R_{abcd}- R_{acbd} +R_{acdb} -R_{adcb} +R_{adbc} -R_{abdc}=0##. Note that every ordering of the last three indices appears and that any pair of orderings that you can make by swapping two indices have opposite signs.

Both Samy's and my expressions are interpreted to mean that for any a, b, c, d, that statement must be valid. Because you are permuting b, c and d, though, there is a lot of replication in the expressions. a,b,c,d=0,1,2,3 and 0,1,3,2 yield identical expressions, for example.
 
What I'm looking for is a rule to help me understand. For instance, for R[ab][cd], R = 0 when a=b and c=d. Is there similar rule for the antisymmetric part of [bcd]?
 
It's possible, for example, that Samy has used the symmetries of the Riemann tensor to simplify his expression. I'd need to think about it with a pen and paper.

Perhaps best to wait for Samy or someone else to clarify...
 
Ibix said:
The latter is ##R_{abcd}- R_{acbd} +R_{acdb} -R_{adcb} +R_{adbc} -R_{abdc}=0##.

Since ##R_{pqdc}=-R_{pqcd}##, you can write the left-hand side as
##R_{abcd}- (-R_{acdb}) +R_{acdb} -(-R_{adbc}) +R_{adbc} -(-R_{abcd})=2(R_{abcd}+R_{acdb}+R_{adbc})##
 
  • Like
Likes   Reactions: Ibix
  • #10
Ok. The Riemann tensor is anti-symmetric in its last two indices. That is, ##R_{abcd}=-R_{abdc}##. So my expression (correct for a general four index tensor) simplifies to Samy's in the case of the Riemann tensor.

Edit: ...as robphy just pointed out.

Samy's expression is not ##R_{a (bcd)}##. Forget I said that.

I'm going to shut up now before I confuse anything even worse.
 
  • #11
My apologies, I thought R was the Riemann tensor.
 
  • #12
No apologies Samy, it is the Riemann tensor.
 
  • #13
Am I not being clear in my question? Nobody has yet answered it. What combinations of [bcd] make Ra[bcd] zero?
 
  • #14
Kevin McHugh said:
No apologies Samy, it is the Riemann tensor.
Indeed. It was me who was confused, not you, @Samy_A
 
  • #15
Kevin McHugh said:
Am I not being clear in my question? Nobody has yet answered it. What combinations of [bcd] make Ra[bcd] zero?
Any combination (if we interpret the expression as I did in post ##2).
 
  • #16
Kevin McHugh said:
Am I not being clear in my question? Nobody has yet answered it. What combinations of [bcd] make Ra[bcd] zero?
Samy_A said:
Any combination (if we interpret the expression as I did in post ##2).
To elaborate on this, the first Bianchi identity Rabcd+Racdb+Radbc=0 is true for any combination of indices, but not all combination yield interesting information.

Let's take the case where a=b.
We then have Raacd+Racda+Radac=0.
But Raacd=0.
Also Racda=Rdaac=-Radac, so the identity ends up telling us that 0=0 in case a=b. And similarly for a=c or a=d.

Let's take the case where b=c.
Rabbd+Rabdb+Radbb=0.
Here Radbb=0, and Rabbd=-Rabdb, so again the identity ends up telling us that 0=0 in case b=c.

The Bianchi identity is only interesting when the indices are all different, and by the symmetries of the Riemann tensor, it allows you to reduce the number of independent components by one.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
Replies
1
Views
2K
  • · Replies 16 ·
Replies
16
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 32 ·
2
Replies
32
Views
3K
  • · Replies 53 ·
2
Replies
53
Views
4K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 35 ·
2
Replies
35
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 25 ·
Replies
25
Views
2K