Color ordering and partial amplitudes
Separate color tensors from ordered kinematics and identify the cyclic adjacency restrictions on tree poles.
On this page
The question for today
What you’ll understand
- Count cyclic trace orderings without confusing them with an independent kinematic basis.
- Identify admissible poles of a fixed color-ordered tree amplitude.
- Explain why coherent color reconstruction precedes a cross-section calculation.
A gluon amplitude carries both kinematic information and noncommuting color indices. Expanding its color dependence in ordered traces exposes simpler kinematic functions called partial amplitudes. At tree level each ordered function receives only diagrams compatible with its cyclic ordering, dramatically restricting possible factorization channels. This organization does not erase color interference, turn a partial amplitude into a probability, or identify every trace coefficient as an independent function. The meaning of an ordering must survive every later recursion and limit.
A trace expansion organizes the full color tensor
Choose fundamental SU(N) generators normalized so their pairwise trace equals the color Kronecker delta. Structure constants and generator products then allow a pure-gluon tree amplitude to be expanded in single traces. Each trace multiplies a color-ordered partial amplitude and the common coupling power. The generator normalization is a convention: changing it requires a compensating change of couplings and partial-amplitude normalization, rather than a new physical prediction.
Cyclic rotations leave a trace unchanged, so the trace sum uses permutations modulo cyclic rotations. Reflection and further amplitude identities can reduce the number of independent kinematic functions beyond this first organizational count. The trace expansion is useful even when it is redundant. At loop level multiple-trace structures and distinctions between primitive and partial amplitudes enter; the simple tree single-trace formula must not be presented as the complete loop color decomposition.
Cyclic adjacency determines possible channels
An internal line of a planar ordered tree separates consecutive external labels from their cyclic complement. Its momentum is the sum of that consecutive set, so only such sums can generate factorization poles in the partial amplitude. At four points ordered as one, two, three, four, the two distinct channels are the adjacent-pair invariants twelve and twenty-three. The nonadjacent thirteen channel belongs to other orderings rather than this partial amplitude.
At higher multiplicity a set and its complementary consecutive set describe the same internal line because total incoming momentum vanishes. Counting both as separate poles would double count a channel. An allowed channel can still have zero residue for a particular helicity assignment or theory. Conversely, an apparent forbidden pole in an intermediate expression must cancel from the final ordered function; its presence in one algebraic term is not yet proof of a physical singularity.
Color reconstruction remains coherent
Each partial amplitude is gauge invariant on shell when the color decomposition is performed consistently. This makes it a useful computational target even though it is not a directly measured color-resolved probability. To form a squared full amplitude, reconstruct the color tensor and contract it with its complex conjugate. Cross terms between different trace structures generally survive. Dropping them requires a stated approximation, such as a controlled leading-color treatment in a suitable setting.
Coupling powers, helicity sums, incoming-state averages, phase-space measures, and infrared-safe measurement functions are additional ingredients of an experimental prediction. None is supplied by merely counting traces. Color ordering instead gives a disciplined analytic workspace: neighboring soft factors, collinear limits, and recursion channels all refer to the same cyclic list. Reordering labels to simplify one expression without transforming its color coefficient can therefore change the reconstructed result.
Work it through
Four labels and three reflection pairs
For a pure four-gluon tree, count cyclic trace orderings and list them with label 1 fixed first. Pair them under reflection. For the representative (1,2,3,4), state the two distinct possible pair channels.
Fixing the first label removes cyclic rotations. Permuting the remaining three gives six representatives: 1234, 1243, 1324, 1342, 1423 and 1432. This is the organizational count 3!, rather than a minimal basis theorem.
At even multiplicity reflection has plus sign. After cyclically rotating reversed lists back to a leading 1, the pairs are (1234,1432), (1243,1342), and (1324,1423). Further kinematic relations can reduce the independent functions beyond these three pairs.
For 1234 the distinct adjacent-pair channels are s12 and s23. The complements 34 and 41 give those same invariants. The nonadjacent pair 13 cannot supply a genuine pole of this ordered tree.
There are six cyclic trace representatives and three reflection pairs. The 1234 partial amplitude has possible s12 and s23 pair poles, while the full color-dressed amplitude can contain other channels through other orderings.
The living notebook
Explore the model
Interactive lab · modular
Follow cyclic rotations of one ordering
Identify a residue r with rotating a four-label list by r positions. Reset and set both controls to Modulus m=4 and Additive step a=1; predict orbit period 4 and residues 0,1,2,3. For a fresh comparison, Reset and set both controls to m=4 and a=2; predict period 2 and residues 0,2. Step advances one addition from the fresh clock.
- Residue r0
- 0
- Orbit period · m/gcd(m,a)
- 12
- Distinct residues visited
- 1 of 12
Addition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forCyclic rotations form a simple finite orbit. This addition model does not evaluate noncommuting color traces, generate all inequivalent orderings, or establish amplitude reflection or basis relations.
Pause & reason
Check your understanding
Your turn
Try it yourself
For A6(1,2,3,4,5,6), examine P123², P456², P135² and s23. Which are possible channels, and how many distinct channels are represented by the allowed entries in this list?
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Use cyclic adjacency and then momentum conservation to compare the first two entries.
Compare with the solution
The sets 123 and 456 are consecutive complements, so both are allowed but represent the same channel: P456=−P123 and their squares agree. The set 135 is nonconsecutive and supplies no genuine ordered pole. The pair 23 is adjacent and gives another possible channel. Thus the list contains two distinct allowed channels, not three. Their actual residues depend on the amplitude's helicities and theory; this is a structural admissibility test.
Keep the idea
Take it with you
- Single traces organize pure-gluon tree color factors with an explicit generator normalization.
- Only cyclically consecutive momentum sums generate ordered-tree factorization channels.
- Trace representatives, independent partial amplitudes, and coherent color-summed observables are different counts.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.