Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Normal order
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Wick's theorem=== {{Main|Wick's theorem}} '''Wick's theorem''' states the relationship between the time ordered product of <math>n</math> fields and a sum of normal ordered products. This may be expressed for <math>n</math> even as :<math>\begin{align} T\left[\phi(x_1)\cdots \phi(x_n)\right]=&:\phi(x_1)\cdots \phi(x_n): +\sum_\textrm{perm}\langle 0 |T\left[\phi(x_1)\phi(x_2)\right]|0\rangle :\phi(x_3)\cdots \phi(x_n):\\ &+\sum_\textrm{perm}\langle 0 |T\left[\phi(x_1)\phi(x_2)\right]|0\rangle \langle 0 |T\left[\phi(x_3)\phi(x_4)\right]|0\rangle:\phi(x_5)\cdots \phi(x_n):\\ \vdots \\ &+\sum_\textrm{perm}\langle 0 |T\left[\phi(x_1)\phi(x_2)\right]|0\rangle\cdots \langle 0 |T\left[\phi(x_{n-1})\phi(x_n)\right]|0\rangle \end{align}</math> where the summation is over all the distinct ways in which one may pair up fields. The result for <math>n</math> odd looks the same except for the last line which reads :<math> \sum_\text{perm}\langle 0 |T\left[\phi(x_1)\phi(x_2)\right]|0\rangle\cdots\langle 0 | T\left[\phi(x_{n-2})\phi(x_{n-1})\right]|0\rangle\phi(x_n). </math> This theorem provides a simple method for computing vacuum expectation values of time ordered products of operators and was the motivation behind the introduction of normal ordering.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)