physics

Path-ordering

Path-ordering is a physics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Path-ordering rather than just read about it. In short: In theoretical physics, path-ordering is the procedure (or a meta-operator P {\displaystyle {\mathcal {P}}} ) that orders a product of operators according to the value of a chosen parameter: P { O 1 ( σ 1 ) O 2 ( σ 2 ) ⋯ O N ( σ N ) } ≡ O p 1 ( σ p 1 ) O p 2 ( σ p 2 ) ⋯ O p N ( σ p N ) . {\displaystyle {\mathcal {P}}\left\{O_{1}(\sigma _{1})O_{2}(\sigma _{2})\cdots O_{N}(\sigma _{N})\right\}\equiv O_{p_{1}}(\sigma _…

Key takeaways

Path-ordering belongs to physics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Path-ordering to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Path-ordering from memory before moving on to harder problems.

Reference excerpt

In theoretical physics, path-ordering is the procedure (or a meta-operator P {\displaystyle {\mathcal {P}}} ) that orders a product of operators according to the value of a chosen parameter:

P { O 1 ( σ 1 ) O 2 ( σ 2 ) ⋯ O N ( σ N ) } ≡ O p 1 ( σ p 1 ) O p 2 ( σ p 2 ) ⋯ O p N ( σ p N ) . {\displaystyle {\mathcal {P}}\left\{O_{1}(\sigma _{1})O_{2}(\sigma _{2})\cdots O_{N}(\sigma _{N})\right\}\equiv O_{p_{1}}(\sigma _{p_{1}})O_{p_{2}}(\sigma _{p_{2}})\cdots O_{p_{N}}(\sigma _{p_{N}}).}

Here p is a permutation that orders the parameters by value:

p : { 1 , 2 , … , N } → { 1 , 2 , … , N } {\displaystyle p:\{1,2,\dots ,N\}\to \{1,2,\dots ,N\}}

σ p 1 ≤ σ p 2 ≤ ⋯ ≤ σ p N . {\displaystyle \sigma _{p_{1}}\leq \sigma _{p_{2}}\leq \cdots \leq \sigma _{p_{N}}.}

For example:

P { O 1 ( 4 ) O 2 ( 2 ) O 3 ( 3 ) O 4 ( 1 ) } = O 4 ( 1 ) O 2 ( 2 ) O 3 ( 3 ) O 1 ( 4 ) . {\displaystyle {\mathcal {P}}\left\{O_{1}(4)O_{2}(2)O_{3}(3)O_{4}(1)\right\}=O_{4}(1)O_{2}(2)O_{3}(3)O_{1}(4).}

In many fields of physics, the most common type of path-ordering is time-ordering, which is discussed in detail below.

Examples If an operator is not simply expressed as a product, but as a function of another operator, we must first perform a Taylor expansion of this function. This is the case of the Wilson loop, which is defined as a path-ordered exponential to guarantee that the Wilson loop encodes the holonomy of the gauge connection. The parameter σ that determines the ordering is a parameter describing the contour, and because the contour is closed, the Wilson loop must be defined as a trace in order to be gauge-invariant.

Time ordering In quantum field theory it is useful to take the time-ordered product of operators. This operation is denoted by T {\displaystyle {\mathcal {T}}} . (Although T {\displaystyle {\mathcal {T}}} is often called the "time-ordering operator", strictly speaking it is neither an operator on states nor a superoperator on operators.) For two operators A(x) and B(y) that depend on spacetime locations x and y we define:

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Path-ordering

Start with the simplest possible case. Write down what Path-ordering claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In physics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Path-ordering before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Path-ordering ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Path-ordering

In research: Path-ordering appears in physics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Path-ordering in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Path-ordering is common in secondary-school and first-year university syllabi. It links to neighbouring topics Gauge theories, Quantum field theory, so understanding it makes those chapters shorter.
In everyday life: Look for Path-ordering outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Path-ordering in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Path-ordering means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Path-ordering out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Path-ordering in simple terms?

In theoretical physics, path-ordering is the procedure (or a meta-operator P {\displaystyle {\mathcal {P}}} ) that orders a product of operators according to the value of a chosen parameter: P { O 1 ( σ 1 ) O 2 ( σ 2 ) ⋯ O N ( σ N ) } ≡ O p 1 ( σ p 1 ) O p 2 ( σ p 2 ) ⋯ O p N ( σ p N ) . {\displays…

Why does Path-ordering matter?

Because it connects several physics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Path-ordering?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Path-ordering.