Disconnected graphs, decomposition principle

In summary, Schwartz states that the disconnected part of the S-matrix (or is he talking about the full S-matrix here, please correct me if I'm wrong) factorizes into the products of the two 1\to3 connected processes. Then he says that the connected diagram has only single overall delta-function \delta^4(\sum p) (and cannot produce more delta-functions which is related to the cluster decomposition principle), while the disconnected matrix elements will have extra delta-functions \mathcal{M}=\delta^4(\sum_{subset} p)(\dots). Finally, he states that disconnected amplitudes
  • #1
SpookyMulder
6
0
Hi, I'm reading Schwartz's book "Quantum field theory and the standard model", section 7.3.2., page 95 (https://books.google.com/books?id=H...ce=gbs_ge_summary_r&cad=0#v=onepage&q&f=false)
where he's talking about disconnected diagrams, the ones that have subsets of external vertices connected to each other without interacting with the other subsets. Schwartz basically states that the disconnected part of the [itex]S[/itex]-matrix (or is he talking about the full [itex]S[/itex]-matrix here, please correct me if I'm wrong) factorizes into the products of the two [itex]1\to3[/itex] connected processes. Then he says that the connected diagram has only single overall delta-function [itex]\delta^4(\sum p)[/itex] (and cannot produce more delta-functions which is related to the cluster decomposition principle), while the disconnected matrix elements will have extra delta-functions [itex]\mathcal{M}=\delta^4(\sum_{subset} p)(\dots)[/itex].

Finally, he states that disconnected amplitudes are always infinitely larger than the connected ones, so that the interference between connected and disconnected diagrams vanishes. Now, what does it mean that there's no interference? Does it mean that [itex]\left|\mathcal{M}_{disc}+\mathcal{M}_{conn}\right|^2 = \left|\mathcal{M}_{disc}\right|^2+\left|\mathcal{M}_{conn}\right|^2 [/itex] or something else? How do we prove it in general? I know I should read Weinberg at some point, but still...

Schwartz also has a problem (7.2) at the end of the chapter related to this discussion (see page 103 https://books.google.com/books?id=H...ce=gbs_ge_summary_r&cad=0#v=onepage&q&f=false)
Calculate the contribution to [itex]2 \to 4[/itex] scattering from the Lagrangian [itex]\mathcal{L} = -\frac{1}{2} \phi \Box \phi + \frac{g}{3!}\phi^3 + \frac{\lambda}{6!}\phi^6[/itex] from the connected diagram, with the 6-point vertex, and the disconnected diagram with the 3-point vertex. Show that there is no interference. (There are of course many connected diagrams with the 3-point vertex that you can ignore).

Attached are the relevant diagrams. Using position-space Feynman rules, I calculated
[tex]\langle i|S| \rangle_{conn} = i \lambda (2\pi)^4 \delta^{4}(p_1+p_2-p_3-p_4-p_5-p_6)[/tex]
[tex]\langle i|S| \rangle_{disc} = -g^2 (2\pi)^8 \delta^{4}(p_1-p_3-p_4) \delta^{4}(p_2-p_5-p_6)[/tex]
where [itex]p_1, p_2[/itex] --- incoming, [itex]p_3, p_4,p_5,p_6[/itex] --- outgoing momenta.

How do I show that there's no interference?

Snapshot.jpg
 
Last edited:
Physics news on Phys.org
  • #2
One more thing. Is there a book other than Weinberg's that carefully explains these things? Don't get me wrong, I love Weinberg's books, but sometimes you need a less advanced book to understand what Weinberg says and I've never seen anyone except for Schwartz who would talk about cluster decomposition principle.

P.S. Should this thread be moved to homework/coursework forum? Obviously, the question I asked is not related to my hm/coursework, but it seems like you have a rule that requires hm/coursework-TYPE questions to be posted in the hw/coursework forum (sorry I didn't catch this before):

Please note that all homework/coursework-TYPE questions must be posted in the HW/Coursework forum, not in this this forum. This is applicable even if your question is not officially from a HW/Coursework, and you are just doing this for your own study, or for someone else.
 
  • #3
I don't think Schwartz explains this very well. Here's my understanding of what's going on.

The product of the disconnected diagrams is zero unless both delta-functions are satisfied. This is a much stronger constraint that the single delta-function of the connected diagram. Thus, there are many sets of momenta for which the disconnected diagrams vanish, and then only the connected diagram contributes.

In the case that both delta-functions are satisfied, the product of the disconnected diagrams is infinitely larger than the connected diagram (actually, larger by a factor of VT, where V is the volume of the interaction region and T is the duration of the measurement, in units of the Compton wavelength of the particles, roughly speaking). Thus, in that case, we can ignore the connected diagram.

So we are always in a situation where either only the disconnected diagrams, or only the connected diagram, contributes. I guess that's what Schwartz means by "no interference".

Schwartz also explains why cluster decomposition isn't discussed much: it's automatic in QFT with local interactions. So if you're going to study QFT with local interactions, there's no need to separately worry about cluster decomposition.
 
  • Like
Likes SpookyMulder
  • #4
Avodyne, thanks for your reply. Now it's more clear. Can you think of any other books where this topic is explained better than in Schwartz's book?
Avodyne said:
So we are always in a situation where either only the disconnected diagrams, or only the connected diagram, contributes. I guess that's what Schwartz means by "no interference".
OK, if we go back to the problem that Schwartz assigned, am I supposed to prove that [itex]\left|\mathcal{M}_{disc}+\mathcal{M}_{conn}\right|^2 = \left|\mathcal{M}_{disc}\right|^2+\left|\mathcal{M}_{conn}\right|^2[/itex] (and hence the decay rate is the sum of the decay rates due to the connected and disconnected graphs) by integrating over the phase space?
 
  • #5
SpookyMulder said:
Can you think of any other books where this topic is explained better than in Schwartz's book?
Um, not really. I don't think this requires much explanation. In practice, if you want to study a particular connected process experimentally, you simply avoid the regions of phase space where the disconnected processes contribute. I believe Srednicki says a few words about this, but no formulas.
SpookyMulder said:
OK, if we go back to the problem that Schwartz assigned, am I supposed to prove that [itex]\left|\mathcal{M}_{disc}+\mathcal{M}_{conn}\right|^2 = \left|\mathcal{M}_{disc}\right|^2+\left|\mathcal{M}_{conn}\right|^2[/itex] (and hence the decay rate is the sum of the decay rates due to the connected and disconnected graphs) by integrating over the phase space?
I have no idea what Schwartz wants you to do! I think it's a badly posed problem. As I said, if you are in a region of phase space where the disconnected process is allowed, then it dominates the probability for the total process to occur (assuming it is happening in a large volume over a long time), and if you are not in such a region of phase space, then the disconnected diagrams vanish (again assuming large volume and time), and only the connected process contributes.
 
  • #6
Do you mean the theorem that the (unconnected) ##N##-point function the disconnected pieces (i.e., pure vacuum subdiagrams which do not contain an external leg) are just an undefined phase factor and thus irrelevant for observables like cross sections which are ##\propto |S_{fi}|^2##? Then you find two proofs in my QFT lecture notes:

http://fias.uni-frankfurt.de/~hees/publ/lect.pdf

One, using the operator formalism in Sect. 3.9 and the other, using path-integral methods and generating functions, in Sect. 4.6.
 
  • #7
vanhees71 said:
Do you mean the theorem that the (unconnected) ##N##-point function the disconnected pieces (i.e., pure vacuum subdiagrams which do not contain an external leg) are just an undefined phase factor and thus irrelevant for observables like cross sections which are ##\propto |S_{fi}|^2##?
No, we are not talking about pure vacuum subdiagrams here, but disconnected diagrams that have external legs.

I thank Avodyne once again for answering my question.
 

What are disconnected graphs?

Disconnected graphs are graphs in which some vertices are not connected to any other vertices by edges. This means that there are distinct subgraphs within the overall graph that are not connected to each other.

What is the decomposition principle for disconnected graphs?

The decomposition principle is a method for breaking down a disconnected graph into smaller, connected subgraphs. This is done by identifying the disconnected components and then finding a way to connect them through the addition of edges.

Why is the decomposition principle important?

The decomposition principle is important because it allows us to analyze and understand complex disconnected graphs by breaking them down into smaller, more manageable parts. It also helps us to identify patterns and relationships within the graph.

What are some real-world applications of disconnected graphs?

Disconnected graphs can be used to model various situations in the real world, such as social networks, transportation networks, and computer networks. They can also be used in data analysis and clustering algorithms.

What are some common algorithms used for analyzing disconnected graphs?

Some common algorithms used for analyzing disconnected graphs include the breadth-first search algorithm and the depth-first search algorithm. These algorithms can help us to identify the components of a disconnected graph and how they are connected to each other.

Similar threads

  • High Energy, Nuclear, Particle Physics
Replies
1
Views
2K
  • High Energy, Nuclear, Particle Physics
Replies
5
Views
2K
  • High Energy, Nuclear, Particle Physics
Replies
1
Views
2K
  • Cosmology
Replies
6
Views
359
  • High Energy, Nuclear, Particle Physics
Replies
2
Views
2K
  • High Energy, Nuclear, Particle Physics
Replies
1
Views
2K
  • Quantum Physics
Replies
1
Views
2K
  • High Energy, Nuclear, Particle Physics
Replies
7
Views
3K
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
2K
Replies
2
Views
780
Back
Top