Lorentz transformations and Minkowski metric

[blankvin]

I am attempting to read my first book in QFT, and got stuck.

A Lorentz transformation that preserves the Minkowski metric \eta_{\mu \nu} is given by x^{\mu} \rightarrow {x'}^{\mu} = {\Lambda}^\mu_\nu x^\nu. This means \eta_{\mu \nu} x^\mu x^\nu = \eta_{\mu \nu}x'^\mu x'^\nu for all x, which implies that \eta_{\mu \nu} = \eta_{\sigma \tau} {\Lambda}^\sigma_\mu {\Lambda}^\tau_\nu.

I am wondering if this is the right direction so as to arrive at the implication:

x^\sigma \rightarrow x'^\sigma = \Lambda^\sigma_\mu x^\mu, x^\tau \rightarrow x'^\tau = \Lambda^\tau_\nu x^\nu

Now, I am not sure how to go beyond this point. And I assume that \eta_{\mu \nu} = \eta_{\sigma \tau} {\Lambda}^\sigma_\mu {\Lambda}^\tau_\nu is an operator, so it does not matter if the x^i are included or not.


Thanks.

 

[WannabeNewton]

Use an infinitesimal Lorentz transformation and work to first order in the expansion parameter.

 

[blankvin]

Thank you for the quick reply.

Use an infinitesimal Lorentz transformation and work to first order in the expansion parameter.

Can you give me an example in this context or further explanation of what an infinitesimal Lorentz transformation is? Also, the unprimed to primed transformation is given. How do you go the other way?

Is it correct to say that since \eta_{\mu \nu} x ^\mu x^\nu = \eta_{\mu \nu} x'^\mu x'^\nu then \eta_{\mu \nu} x ^\mu x^\nu = \eta_{\mu \nu} \Lambda^\mu_\sigma x^\sigma \Lambda^\nu_\tau x^\tau? And since repeated indices are "dummy" indices, then they can be relabeled and we have that \eta_{\mu \nu} \Lambda^\mu_\sigma x^\sigma \Lambda^\nu_\tau x^\tau = \eta_{\sigma \tau} \Lambda^\sigma_\mu x^\mu \Lambda^\tau_\nu x^\nu, therefore showing the original implication?

 

[Fredrik]

I am attempting to read my first book in QFT, and got stuck.

A Lorentz transformation that preserves the Minkowski metric \eta_{\mu \nu} is given by x^{\mu} \rightarrow {x'}^{\mu} = {\Lambda}^\mu_\nu x^\nu. This means \eta_{\mu \nu} x^\mu x^\nu = \eta_{\mu \nu}x'^\mu x'^\nu for all x, which implies that \eta_{\mu \nu} = \eta_{\sigma \tau} {\Lambda}^\sigma_\mu {\Lambda}^\tau_\nu.

I am wondering if this is the right direction so as to arrive at the implication:

x^\sigma \rightarrow x'^\sigma = \Lambda^\sigma_\mu x^\mu, x^\tau \rightarrow x'^\tau = \Lambda^\tau_\nu x^\nu

Now, I am not sure how to go beyond this point. And I assume that \eta_{\mu \nu} = \eta_{\sigma \tau} {\Lambda}^\sigma_\mu {\Lambda}^\tau_\nu is an operator, so it does not matter if the x^i are included or not.

I prefer to work with the matrices instead of their components. The Minkowski bilinear form g is defined by $g(x,x)=x^T\eta x$ for all 4×1 matrices x. A Lorentz transformation is a 4×4 matrix $\Lambda$ such that $g(\Lambda x,\Lambda x)=g(x,x)$ for all 4×1 matrices x. So if $\Lambda$ is a Lorentz transformation, we have
$$x^T\eta x=g(x,x)=g(\Lambda x,\Lambda x)=(\Lambda x)^T\eta(\Lambda x) =x^T\Lambda^T \eta\Lambda x,$$ for all 4×1 matrices x. The words "for all" are the key to the answer. You can make a clever choice of x to show that one component of the matrix equation $\eta=\Lambda^T\eta\Lambda$ holds. Different choices of x will help you prove different components of that matrix equation.

It may be easier to first prove that this statement holds: For all 4×1 matrices x and y, we have $x^T\eta y=x^T\Lambda^T\eta\Lambda y$. You can prove this by noting that the seemingly weaker statement above (with two x's and no y) implies that for all x,y, we have $(x+y)^T\eta (x+y)=(x+y)^T\Lambda^T\eta\Lambda (x+y)$ and $(x-y)^T\eta (x-y)=(x-y)^T\Lambda^T\eta\Lambda (x-y)$.

The reason why this is worth doing first is that it's now very easy to single out any component you want from the matrix equation with a clever choice of x and y.

Can you give me an example in this context or further explanation of what an infinitesimal Lorentz transformation is?

When physicists use the term "infinitesimal", they're always talking about some kind of Taylor expansion, where we pretend that the higher order terms don't exist. A Lorentz transformation can be viewed as a function of six parameters (three velocity components and three Euler angles that identify a rotation). If we denote the 6-tuple of parameters by $\theta$, we can write
$$\Lambda(\theta)=I+\theta^a\frac{\partial}{\partial \theta^a}\bigg|_0\Lambda(\theta)+\cdots$$ The sum of the first order terms is often denoted by $\omega$. The sum $I+\omega$ can be called an infinitesimal Lorentz transformation. But this doesn't have anything to do with what you asked about. It is relevant to QFT though. A standard exercise is to show that if $\Lambda(\theta)$ is a Lorentz transformation, then $\omega^T=-\omega$.

Also, the unprimed to primed transformation is given. How do you go the other way?

This is so much easier when we're working with matrices instead of their components. $x'=\Lambda x$ implies $x=\Lambda^{-1}x'$. What's difficult to understand is that the component version of the former is $x'^\mu=\Lambda^\mu{}_\nu x^\nu$, while the component form of the latter is $x^\mu =\Lambda_\nu{}^\mu x'^\nu$. I wrote a post that explains this (and how to translate between component notation and matrix notation) a couple of days ago: https://www.physicsforums.com/showthread.php?p=4847943#post4847943

Is it correct to say that since \eta_{\mu \nu} x ^\mu x^\nu = \eta_{\mu \nu} x'^\mu x'^\nu then \eta_{\mu \nu} x ^\mu x^\nu = \eta_{\mu \nu} \Lambda^\mu_\sigma x^\sigma \Lambda^\nu_\tau x^\tau? And since repeated indices are "dummy" indices, then they can be relabeled and we have that \eta_{\mu \nu} \Lambda^\mu_\sigma x^\sigma \Lambda^\nu_\tau x^\tau = \eta_{\sigma \tau} \Lambda^\sigma_\mu x^\mu \Lambda^\tau_\nu x^\nu, therefore showing the original implication?

The calculation is correct, but you need an argument like the one described above (try several clever choices of x) to eliminate the x's.

 

[blankvin]

The calculation is correct, but you need an argument like the one described above (try several clever choices of x) to eliminate the x's.

Would a "clever" choice be to multiply both sides on the right by x_\nu x_\mu? That is, multiplying both sides on the left by the inverses of x^\mu and x^\nu?

 

[Fredrik]

Would a "clever" choice be to multiply both sides on the right by x_\nu x_\mu? That is, multiplying both sides on the left by the inverses of x^\mu and x^\nu?

Those aren't inverses, and to multiply both sides by something isn't to make a choice of x. What you need to do is to plug in specific numbers as the components of x.

If M is a 4×4 matrix whose component on row $\mu$, column $\nu$ is denoted by $M^\mu{}_\nu$, then what is
$$\begin{pmatrix}1& 0& 0& 0\end{pmatrix}M\begin{pmatrix}1\\ 0\\ 0\\ 0\end{pmatrix}?$$

 

[nrqed]

I am attempting to read my first book in QFT, and got stuck.

A Lorentz transformation that preserves the Minkowski metric \eta_{\mu \nu} is given by x^{\mu} \rightarrow {x'}^{\mu} = {\Lambda}^\mu_\nu x^\nu. This means \eta_{\mu \nu} x^\mu x^\nu = \eta_{\mu \nu}x'^\mu x'^\nu for all x, which implies that \eta_{\mu \nu} = \eta_{\sigma \tau} {\Lambda}^\sigma_\mu {\Lambda}^\tau_\nu.

I am wondering if this is the right direction so as to arrive at the implication:

x^\sigma \rightarrow x'^\sigma = \Lambda^\sigma_\mu x^\mu, x^\tau \rightarrow x'^\tau = \Lambda^\tau_\nu x^\nu

I am a bit confused about what you are trying to prove and what you are starting with. You seem to start with x^{\mu} \rightarrow {x'}^{\mu} = {\Lambda}^\mu_\nu x^\nu and you seem to want to prove


x^\sigma \rightarrow x'^\sigma = \Lambda^\sigma_\mu x^\mu, x^\tau \rightarrow x'^\tau = \Lambda^\tau_\nu x^\nu

But these three expressions are all the same! So can you clarify what you are trying to prove?

 

[Fredrik]

I am a bit confused about what you are trying to prove and what you are starting with. You seem to start with x^{\mu} \rightarrow {x'}^{\mu} = {\Lambda}^\mu_\nu x^\nu and you seem to want to prove


x^\sigma \rightarrow x'^\sigma = \Lambda^\sigma_\mu x^\mu, x^\tau \rightarrow x'^\tau = \Lambda^\tau_\nu x^\nu

But these three expressions are all the same! So can you clarify what you are trying to prove?

I'm pretty sure that he wants to prove that if $\eta_{\mu\nu}x'^\mu x'^\nu =\eta_{\mu\nu} x^\mu x^\nu$ for all x, then $\Lambda^\mu{}_\rho\Lambda^\nu{}_\sigma \eta_{\mu\nu} =\eta_{\rho\sigma}$, or equivalently, that if $x'^T\eta x'=x^T\eta x$ for all x, then $\Lambda^T\eta\Lambda=\eta$.

 

[ChrisVer]

Why do you need to use different choices for x?
I mean the form you reached and holds for all x is:
x^T \eta x = x^T \Lambda^T \eta \Lambda x
and I think it is enough to say that:
\eta= \Lambda^T \eta \Lambda
(No needs for x choices or inserting other vectros y etc)

 

[Fredrik]

Why do you need to use different choices for x?
I mean the form you reached and holds for all x is:
x^T \eta x = x^T \Lambda^T \eta \Lambda x
and I think it is enough to say that:
\eta= \Lambda^T \eta \Lambda
(No needs for x choices or inserting other vectros y etc)

This conclusion is definitely not obvious, but if you have previously proved a theorem that says e.g. that if <x,Ax>=0 for all x then A=0, then you can use that theorem.

If you do what I did in #4 to replace one of the x's with an arbitrary y, then there's another option to "clever choices of x" (or "clever choices of x and y"): If $x^TAy=0$ for all x,y, then $x^TA$ is the matrix representation of the functional that takes every vector to 0. So we have $0=x^TA=(A^Tx)^T$ for all x, and now we can argue that $A^T=0$ in the same way.

But I still think that "clever choices of x and y" is the easiest and best way to do this. It gives us a simple and elementary proof that doesn't rely on any other theorems.

 

[blankvin]

If M is a 4×4 matrix whose component on row $\mu$, column $\nu$ is denoted by $M^\mu{}_\nu$, then what is
$$\begin{pmatrix}1& 0& 0& 0\end{pmatrix}M\begin{pmatrix}1\\ 0\\ 0\\ 0\end{pmatrix}?$$

{M^1}_1

Then for basis vectors, x_\mu {M^\mu}_\nu x^\nu = {M^\mu}_\nu?

 

[Fredrik]

{M^1}_1

Then for basis vectors, x_\mu {M^\mu}_\nu x^\nu = {M^\mu}_\nu?

Yes, it's the top left component, but the rows and columns are usually numbered from 0 to 3 in relativity, so I would denote this component by $M^0{}_0$. So if $x^TMx=0$ for all x, then this choice of x tells us that $M^0{}_0=0$.

Since you have x on both sides of M, and there are only four vectors in the standard basis, you can only single out four components of M by plugging in standard basis vectors. These are the ones on the diagonal. To get information about the other components of M, you would have to plug in other vectors. For example, if you plug in (1,1,0,0), you get $M^0{}_0+M^0{}_1+M^1{}_0+M^1{}_1=0$. If you plug in (1,-1,0,0) you get an equation with the same components, but two of the sign flipped. If you keep plugging in vectors like these, you get more and more information, and will eventually find all the components of M.

It's much easier to first do what I did, to convert the result $x^TMx=0$ for all x to $x^TMy=0$ for all x,y. Now there's no need to plug in anything but standard basis vectors. By plugging in different standard basis vectors on the left and right, you can single out any component of M you want.

 

[ChrisVer]

Another, easier way I saw here
https://www.physicsforums.com/showthread.php?t=91974
Ax = Bx \Rightarrow B^{-1}A x = B^{-1}Bx = x
so B^{-1}A = I
Then you can also try to write x \rightarrow B^{-1} y (since B is given matrix, then for all x's implies for all y's) from where you will get A B^{-1} = I

These results: B^{-1}A = A B^{-1} =I, are the definition of A being the inverse of B^{-1}
So A= (B^{-1})^{-1}=B.

This just needs the assumption that B is inversible, which is true for the minkowski metric matrix. In your case:
x^{T} \eta x = x^T \Lambda^T \eta \Lambda x \Rightarrow x^{T} (\eta x) = x^T (\Lambda^T \eta \Lambda x) \Rightarrow \eta x = \Lambda^T \eta \Lambda x
So A= \Lambda^T \eta \Lambda and B= \eta, and since B is inversible then due to the above, A=B \Rightarrow \Lambda^T \eta \Lambda = \eta

(do I make it desperately obvious that working with specific components is confusing me that much?)

 

[Fredrik]

The step from $x^T(\eta x)=x^T(\Lambda^T\eta\Lambda x)$ for all x, to $\eta x=\Lambda^T\eta\Lambda x$ for all x, is non-trivial, since the things in parentheses depend on x. Even the step from $B^{-1}Ax=x$ for all x to $B^{-1}A=I$ requires an explanation. If you're familiar with the bijective correspondence between linear operators and matrices, then you can argue that the linear operators corresponding to $B^{-1}A$ and $I$ have the same domain and take each element of that domain to the same thing. That means that the linear operators are equal (i.e. that the linear operator corresponding to $B^{-1}A$ is the identity map), and that means that their matrices are equal. So we can conclude that $B^{-1}A=I$.

But the easiest way is still..."clever choices of x". This doesn't even require you to understand the connection between linear operators and matrices.

The word is "invertible" by the way.

 

[ChrisVer]

are you implying that the associative property does not hold?
http://en.wikipedia.org/wiki/Matrix_multiplication#Row_vector.2C_square_matrix.2C_and_column_vector
I don't understand how it can be non trivial, if I two vectors and take their normal product:
x^T y = x^T z don't I have that y=z? And how is x is destroying that? If you change x, then you are changing their results (y,z) but they still remain equal (or the equality x^T y = x^T z won't hold).
As for the identity: Or just ask what is the thing that when acts on every vector x gives you the same vector? By definition it's the identical "transformation" (or better mapping V \rightarrow V).

The problem with taking several x's is that you are "doomed" in checking too many elements and trying to do exactly the same thing in many steps. I'm trying to find the fastest,general and self-explanatory way (not saying that the other is wrong, but because you need to start putting "choices" I find it not delicate).

 

[blankvin]

OK - I have I have it.

A Lorentz transformation x^\mu \rightarrow {x&#039;}^\mu = {\Lambda^\mu}_\nu x^\nu preserves the Minkowski metric \eta_{\mu \nu}, which means that \eta_{\mu \nu} x^\mu x^\nu = \eta_{\mu \nu} {x&#039;}^\mu {x&#039;}^\nu \hspace{3pt} \forall \hspace{3pt} x. Therefore,

<br /> \eta_{\mu \nu} x^\mu x^\nu = \eta_{\mu \nu} {x&#039;}^\mu {x&#039;}^\nu \\<br /> = \eta_{\mu \nu} {\Lambda^\mu}_\sigma x^\sigma {\Lambda^\nu}_\tau x^\tau \\<br /> = \eta_{\sigma \tau} {\Lambda^\sigma}_\mu x^\mu {\Lambda^\tau}_\nu x^\nu \\<br /> \Rightarrow \eta_{\mu \nu} x^\mu x^\nu = \eta_{\sigma \tau} {\Lambda^\sigma}_\mu {\Lambda^\tau}_\nu x^\mu x^\nu<br />

by relabeling the repeated/dummy indices. Since this holds *for all x*,

<br /> <br /> \eta_{\mu \nu} = \eta_{\sigma \tau} {\Lambda^\sigma}_\mu {\Lambda^\tau}_\nu<br /> <br />.

 

[ChrisVer]

didn't you already do that in post #3?

 

[Fredrik]

are you implying that the associative property does not hold?

Of course not.

http://en.wikipedia.org/wiki/Matrix_multiplication#Row_vector.2C_square_matrix.2C_and_column_vector
I don't understand how it can be non trivial, if I two vectors and take their normal product:
x^T y = x^T z don't I have that y=z?

The following statement is true:

For all 4×1 matrices $y,z$, if $x^Ty=x^Tz$ for all 4×1 matrices x, then y=z.​

It's true, but not trivial. The easiest way to prove it is this: Let y,z be 4×1 matrices. Suppose that $x^Ty=x^Tz$ for all 4×1 matrices x. Then for each $\mu\in\{0,1,2,3\}$, we have $x^\mu=(e_\mu)^Ty=(e_\mu)^Tz=z^\mu$. This implies that $y=z$.

(Each $e_\mu$ denotes a standard basis vector).

And how is x is destroying that? If you change x, then you are changing their results (y,z) but they still remain equal (or the equality x^T y = x^T z won't hold).

You keep suggesting that the theorem I stated and proved above doesn't require proof, and that it's equally obvious that the following statement is also true:

For all linear operators A,B on the set of 4×1 matrices, if $x^TA(x)=x^TB(x)$ for all 4×1 matrices x, then $A=B$.​

This statement is true as well, but it's certainly not a trivial consequence of the first theorem. This should be obvious from the fact that the first theorem is a statement about 4×1 matrices, and the second is a statement about linear operators on the vector space of 4×1 matrices. That's how "x is destroying that".

As for the identity: Or just ask what is the thing that when acts on every vector x gives you the same vector? By definition it's the identical "transformation" (or better mapping V \rightarrow V).

Yes, I told you that this is a way to prove that $B^{-1}A=I$, but I also told you that it requires you to understand the relationship between linear operators and matrices. The argument you're making is not about the matrices $B^{-1}A$ and $I$. It's about the corresponding linear operators. Here's that part of my post again:

Even the step from $B^{-1}Ax=x$ for all x to $B^{-1}A=I$ requires an explanation. If you're familiar with the bijective correspondence between linear operators and matrices, then you can argue that the linear operators corresponding to $B^{-1}A$ and $I$ have the same domain and take each element of that domain to the same thing. That means that the linear operators are equal (i.e. that the linear operator corresponding to $B^{-1}A$ is the identity map), and that means that their matrices are equal. So we can conclude that $B^{-1}A=I$.

The problem with taking several x's is that you are "doomed" in checking too many elements and trying to do exactly the same thing in many steps.

Yes, the first time you do it, you will make some useless choices of x. That's why I prefer to first prove that $y^T\Lambda^T\eta\Lambda z=y^T\eta z$ for all 4×1 matrices y,z. It's very easy to avoid making useless choices of y and z. In fact, you will probably get it exactly right with your first guess.

I'm trying to find the fastest,general and self-explanatory way (not saying that the other is wrong, but because you need to start putting "choices" I find it not delicate).

I think the fastest and simplest way to eliminate all doubt is the proof I have sketched:

1. We know that $x^T\Lambda^T\eta\Lambda x=x^T\eta x$ for all x.
2. Let y,z be arbitrary 4×1 matrices. Since the equality in step 1 holds for all x, it holds when we substitute y+z for x, and it holds when we substitute y-z for x.
3. When we simplify the equalities obtained in 2, we find that $y^T\Lambda^T\eta\Lambda z=y^T\eta z$ for all 4×1 matrices y,z.
4. This result implies that for all $\mu,\nu$, we have
$$(\Lambda^T\eta\Lambda)^\mu{}_\nu = (e_\mu)^T(\Lambda^T\eta\Lambda)e_\nu =(e_\mu)^T\eta e_\nu =\eta_{\mu\nu}.$$ 5. The matrix equation $\Lambda^T\eta\Lambda=\eta$ holds, because each component of it holds.

I'm not sure why you find it "not delicate". The standard way to use that all x in a set have the same property P, is to pick a specific x in that set and use that it has property P.

 

[Fredrik]

OK - I have I have it.

A Lorentz transformation x^\mu \rightarrow {x&#039;}^\mu = {\Lambda^\mu}_\nu x^\nu preserves the Minkowski metric \eta_{\mu \nu}, which means that \eta_{\mu \nu} x^\mu x^\nu = \eta_{\mu \nu} {x&#039;}^\mu {x&#039;}^\nu \hspace{3pt} \forall \hspace{3pt} x. Therefore,

<br /> \eta_{\mu \nu} x^\mu x^\nu = \eta_{\mu \nu} {x&#039;}^\mu {x&#039;}^\nu \\<br /> = \eta_{\mu \nu} {\Lambda^\mu}_\sigma x^\sigma {\Lambda^\nu}_\tau x^\tau \\<br /> = \eta_{\sigma \tau} {\Lambda^\sigma}_\mu x^\mu {\Lambda^\tau}_\nu x^\nu \\<br /> \Rightarrow \eta_{\mu \nu} x^\mu x^\nu = \eta_{\sigma \tau} {\Lambda^\sigma}_\mu {\Lambda^\tau}_\nu x^\mu x^\nu<br />

by relabeling the repeated/dummy indices. Since this holds *for all x*,

<br /> <br /> \eta_{\mu \nu} = \eta_{\sigma \tau} {\Lambda^\sigma}_\mu {\Lambda^\tau}_\nu<br /> <br />.

This is a much better way to state what you did in posts #1 and #3, but what you wanted to know was why the final step is valid, right? Do you understand why it's valid now?

 

[ChrisVer]

I'm not sure why you find it "not delicate". The standard way to use that all x in a set have the same property P, is to pick a specific x in that set and use that it has property P.

Because you don't need one choice, but severals... If you wanted one choice then for an arbitrary x (or else put all x's) you would have to choose x = (a,b,c,d)^T with a,b,c,d \in \mathbb{R} arbitrary numbers...which of course won't be too insightful after taking the matrix multiplications with it.