Skip to content

Dual Evolution of Operators and Wilson Coefficients

A Wilson coefficient is a coordinate in the dual space to a renormalized operator basis. If the operators rotate and rescale with μ\mu, the coefficients must evolve contragrediently so that their pairing remains unchanged. With operators stored as a column and LeffCTO\mathcal L_{\rm eff}\supset C^{\mathsf T}O, the chapter convention DO=γO\mathcal D O=-\gamma O forces DC=γTC\mathcal D C=\gamma^{\mathsf T}C.

This page derives that transpose, solves noncommuting scale evolution with path ordering, and verifies the registered two-interval benchmark exactly. It also shows why preserving CTOC^{\mathsf T}O is necessary but not sufficient to detect a jointly reversed ordering: the differential equation and composition law provide independent checks.

Required background. Operator Anomalous-Dimension Matrices fixes γ\gamma, its sign, and its finite-basis covariance.

Helpful background. Form Factors and Local Operator Insertions supplies process-specific matrix elements to which coefficient vectors can be paired.

The dual equation from an invariant pairing

Section titled “The dual equation from an invariant pairing”

Write a renormalized effective interaction as

Leff(μ)CT(μ)O(μ)=iCi(μ)Oi(μ).\mathcal L_{\rm eff}(\mu) \supset C^{\mathsf T}(\mu)O(\mu) = \sum_i C_i(\mu)O_i(\mu).

Any canonical powers of a heavy scale have been included in CiC_i. The operator column obeys

DO=γO.\mathcal D O=-\gamma O.

Scale independence of the complete interaction requires

0=D(CTO)=(DC)TOCTγO.\begin{aligned} 0 &= \mathcal D(C^{\mathsf T}O)\\ &= (\mathcal DC)^{\mathsf T}O -C^{\mathsf T}\gamma O. \end{aligned}

Since this must hold for every vector in the closed operator sector,

DC=γTC.\boxed{ \mathcal D C=\gamma^{\mathsf T}C. }

The transpose is forced by the bilinear pairing. It is not a Hermitian conjugate: complex conjugation belongs to the separate Hermitian-conjugate operators and coefficients needed to make the action real. It is also not optional when γ\gamma happens to be symmetric in one example. A nonsymmetric benchmark is required to test the convention.

In row form,

DCT=CTγ.\mathcal D C^{\mathsf T}=C^{\mathsf T}\gamma.

Some references start from this row equation and display matrices multiplying on the right. Others define O=ZOO0O=Z_OO_0 or place a minus sign in the definition of γ\gamma. Translation begins with the scalar pairing, not with a memorized transpose.

Ordered operator and coefficient evolution

Section titled “Ordered operator and coefficient evolution”

Let

t=lnμμ0.t=\ln\frac{\mu}{\mu_0}.

The operator evolution matrix UO(t,t0)U_O(t,t_0) solves

UO(t,t0)t=γ(t)UO(t,t0),UO(t0,t0)=1.\frac{\partial U_O(t,t_0)}{\partial t} = -\gamma(t)U_O(t,t_0), \qquad U_O(t_0,t_0)=\mathbf1.

Thus

O(t)=UO(t,t0)O(t0),O(t)=U_O(t,t_0)O(t_0),

with

UO(t,t0)=Pexp ⁣[t0tdtγ(t)].U_O(t,t_0) = \mathcal P \exp\!\left[ -\int_{t_0}^{t}dt'\,\gamma(t') \right].

Here P\mathcal P places the matrix evaluated at later RG time to the left. The composition law is

UO(t2,t0)=UO(t2,t1)UO(t1,t0).U_O(t_2,t_0) = U_O(t_2,t_1)U_O(t_1,t_0).

The coefficient matrix UCU_C solves

UC(t,t0)t=γT(t)UC(t,t0).\frac{\partial U_C(t,t_0)}{\partial t} = \gamma^{\mathsf T}(t)U_C(t,t_0).

Differentiating the inverse transpose of UOU_O gives

UOTt=γT(t)UOT,\frac{\partial U_O^{-\mathsf T}}{\partial t} = \gamma^{\mathsf T}(t)U_O^{-\mathsf T},

so uniqueness of the initial-value problem implies

UC(t,t0)=UOT(t,t0),C(t)=UOT(t,t0)C(t0).\boxed{ U_C(t,t_0) = U_O^{-\mathsf T}(t,t_0), \qquad C(t)=U_O^{-\mathsf T}(t,t_0)C(t_0). }

This identity already contains the ordering. There is no need to guess whether to reverse a product after transposing it.

The figure displays the two rows. Read the upper row from the earlier operator to the later operator, then compare the lower row: the coefficient map is the inverse transpose of the complete ordered product, not the transpose of each generator with the operator sign left unchanged.

Ordered operator evolution is paired with its inverse transpose on Wilson coefficients, preserving the coefficient–operator scalar.

For a column operator basis, O(μ2)=UO(μ2,μ1)O(μ1)O(\mu_2)=U_O(\mu_2,\mu_1)O(\mu_1) and C(μ2)=UOT(μ2,μ1)C(μ1)C(\mu_2)=U_O^{-\mathsf T}(\mu_2,\mu_1)C(\mu_1). The equality of CTOC^{\mathsf T}O holds for noncommuting scale evolution as well as for a constant matrix. The original diagram is schematic and not to scale.

Use the registered RG time 0t10\le t\le1 and piecewise constant matrices

γ(t)={γA=(1201),0t<0.4,γB=(0110),0.4t1.\gamma(t) = \begin{cases} \gamma_A= \begin{pmatrix} 1&2\\ 0&-1 \end{pmatrix}, &0\le t<0.4,\\[1.2em] \gamma_B= \begin{pmatrix} 0&1\\ -1&0 \end{pmatrix}, &0.4\le t\le1. \end{cases}

They do not commute:

[γA,γB]=(2222)0.[\gamma_A,\gamma_B] = \begin{pmatrix} -2&2\\ 2&2 \end{pmatrix} \ne0.

For the first interval, γA2=1\gamma_A^2=\mathbf1, hence

UA=e0.4γA=cosh(0.4)1sinh(0.4)γA=(e0.42sinh(0.4)0e0.4).\begin{aligned} U_A &= e^{-0.4\gamma_A}\\ &= \cosh(0.4)\mathbf1-\sinh(0.4)\gamma_A\\ &= \begin{pmatrix} e^{-0.4}&-2\sinh(0.4)\\ 0&e^{0.4} \end{pmatrix}. \end{aligned}

For the second interval, γB2=1\gamma_B^2=-\mathbf1, hence

UB=e0.6γB=cos(0.6)1sin(0.6)γB=(cos(0.6)sin(0.6)sin(0.6)cos(0.6)).\begin{aligned} U_B &= e^{-0.6\gamma_B}\\ &= \cos(0.6)\mathbf1-\sin(0.6)\gamma_B\\ &= \begin{pmatrix} \cos(0.6)&-\sin(0.6)\\ \sin(0.6)&\cos(0.6) \end{pmatrix}. \end{aligned}

The earlier factor acts on the initial column first and therefore appears on the right:

UO(1,0)=UBUA.U_O(1,0)=U_BU_A.

Numerically,

UA(0.6703200460360.82150465160601.491824697641),U_A \simeq \begin{pmatrix} 0.670320046036&-0.821504651606\\ 0&1.491824697641 \end{pmatrix}, UB(0.8253356149100.5646424733950.5646424733950.825335614910),U_B \simeq \begin{pmatrix} 0.825335614910&-0.564642473395\\ 0.564642473395&0.825335614910 \end{pmatrix},

and

UO(0.5532390073811.5203646339320.3784911687600.767399635777).U_O \simeq \begin{pmatrix} 0.553239007381&-1.520364633932\\ 0.378491168760&0.767399635777 \end{pmatrix}.

The coefficient matrix is

UC=UOT=UBTUAT(0.7673996357770.3784911687601.5203646339320.553239007381).\begin{aligned} U_C &= U_O^{-\mathsf T}\\ &= U_B^{-\mathsf T}U_A^{-\mathsf T}\\ &\simeq \begin{pmatrix} 0.767399635777&-0.378491168760\\ 1.520364633932&0.553239007381 \end{pmatrix}. \end{aligned}

Choose deterministic initial data

O(0)=(12),C(0)=(31),CT(0)O(0)=1.O(0)= \begin{pmatrix} 1\\ 2 \end{pmatrix}, \qquad C(0)= \begin{pmatrix} 3\\ -1 \end{pmatrix}, \qquad C^{\mathsf T}(0)O(0)=1.

Evolution gives

O(1)(2.4874902604831.913290440314),C(1)(2.6806900760914.007854894415).O(1) \simeq \begin{pmatrix} -2.487490260483\\ 1.913290440314 \end{pmatrix}, \qquad C(1) \simeq \begin{pmatrix} 2.680690076091\\ 4.007854894415 \end{pmatrix}.

Their pairing is

CT(1)O(1)=1.000000000000000C^{\mathsf T}(1)O(1) = 1.000000000000000

at the displayed precision. The analytic value is exactly one.

The same initial data expose common mistakes:

Evolution attemptedFinal pairingDiagnosis
Correct O=UOO0O=U_OO_0, C=UOTC0C=U_O^{-\mathsf T}C_01.0000000000001.000000000000Invariant pairing and differential equations both pass.
Missing transpose: C=UO1C0C=U_O^{-1}C_05.175802649218-5.175802649218The coefficient vector was treated as an operator coordinate.
Same matrix: C=UOC0C=U_OC_07.206189929267-7.206189929267Both sign and dual representation are wrong.
Reversed operator product UAUBU_AU_B with the intended CC7.8206629477327.820662947732Chronological ordering is reversed.

If both the operator product and coefficient inverse transpose are reversed together, the scalar pairing remains invariant. That joint mistake is caught by a second test:

maxij(UBUAUAUB)ij0.463856418388.\max_{ij} \left| (U_BU_A-U_AU_B)_{ij} \right| \simeq 0.463856418388.

Equivalently, substitute the proposed U(t)U(t) into tU=γ(t)U\partial_tU=-\gamma(t)U on each interval and test continuity at t=0.4t=0.4. Pairing invariance alone checks duality, not whether the intended time-ordered initial-value problem was solved.

A reproducible calculation uses this exact benchmark. Its accepted implementation must preserve the pairing to relative tolerance 101210^{-12} and must reject the missing-transpose and reversed-order adversarial cases.

Let a finite, possibly scale-dependent change be

O=B(t)O.O'=B(t)O.

Preserving the interaction fixes

C=BT(t)C.C'=B^{-\mathsf T}(t)C.

The operator anomalous dimension transforms as

γ=BγB1(tB)B1.\gamma' = B\gamma B^{-1} -(\partial_tB)B^{-1}.

Differentiating CC' gives

tC=γTC,\partial_tC' = \gamma'^{\mathsf T}C',

only when both the inverse transpose and the derivative term are retained. At the level of finite evolution,

UO(t,t0)=B(t)UO(t,t0)B1(t0),U_O'(t,t_0) = B(t)U_O(t,t_0)B^{-1}(t_0),

and therefore

UC(t,t0)=BT(t)UC(t,t0)BT(t0).U_C'(t,t_0) = B^{-\mathsf T}(t) U_C(t,t_0) B^{\mathsf T}(t_0).

The endpoint matrices matter. Applying BB only at one scale changes the coordinate system at one end of the evolution and is not a basis round trip.

For a constant triangular map

B=(1101),B= \begin{pmatrix} 1&1\\ 0&1 \end{pmatrix},

the induced coefficient map is

BT=(1011).B^{-\mathsf T} = \begin{pmatrix} 1&0\\ -1&1 \end{pmatrix}.

The mixing convention record requires this exact operator/coefficient round trip before a basis translation is accepted.

Suppose a more microscopic theory fixes a coefficient vector at a hard scale MM:

C(M)=Cmatch(M).C(M)=C_{\rm match}(M).

Running to a lower scale μ\mu gives

C(μ)=UOT(μ,M)Cmatch(M).C(\mu) = U_O^{-\mathsf T}(\mu,M)C_{\rm match}(M).

The low-scale amplitude is

A=CT(μ)fO(μ)i.\mathcal A = C^{\mathsf T}(\mu) \left\langle f|O(\mu)|i\right\rangle.

The matrix element evolves with UOU_O, so the arbitrary intermediate scale cancels when matching, running, and matrix elements use the same scheme and basis. Manohar illustrates how matrix anomalous dimensions generate operator mixing and resum leading logarithms in Wilson coefficients Manohar 2018, § 5.10.1, pp. 46–48.

At finite perturbative order, the cancellation is only accurate through the retained order. Varying μ\mu probes omitted logarithmic terms, but it is not a complete uncertainty distribution. A valid scale-variation study also varies matching and matrix-element inputs coherently and does not cross a threshold without the required matching step.

Using the operator equation for coefficients. CC belongs to the dual space. The transpose and opposite sign relative to DO=γO\mathcal D O=-\gamma O follow from CTOC^{\mathsf T}O.

Transposing each exponential without inverting. The correct finite coefficient map is UOTU_O^{-\mathsf T}. A transpose alone does not cancel operator evolution.

Writing an unordered exponential for a running matrix. If [γ(t1),γ(t2)]0[\gamma(t_1),\gamma(t_2)]\ne0, the ordinary exponential of the integral does not solve the initial-value problem.

Checking only the invariant pairing. Reversing both operator and coefficient products consistently can preserve the pairing while solving the wrong ordered equation. Also test the differential residual or a known composition benchmark.

Applying a basis map at only one endpoint. A scale-dependent basis change modifies γ\gamma and both endpoints of the evolution matrix.

  1. Starting from D(CTO)=0\mathcal D(C^{\mathsf T}O)=0 and DO=γO\mathcal DO=-\gamma O, derive the coefficient equation with indices.
Solution

Write the pairing as CiOiC_iO_i. Then

0=(DCi)OiCiγijOj.0=(\mathcal DC_i)O_i-C_i\gamma_{ij}O_j.

Relabel iji\leftrightarrow j in the second term:

0=[DCiγjiCj]Oi.0= \left[ \mathcal DC_i-\gamma_{ji}C_j \right]O_i.

Independence of the basis operators gives DCi=γjiCj\mathcal DC_i=\gamma_{ji}C_j, or DC=γTC\mathcal DC=\gamma^{\mathsf T}C.

  1. Prove UC=UOTU_C=U_O^{-\mathsf T} directly from the operator differential equation.
Solution

From tUO=γUO\partial_tU_O=-\gamma U_O,

tUO1=UO1(tUO)UO1=UO1γ.\partial_tU_O^{-1} = -U_O^{-1}(\partial_tU_O)U_O^{-1} = U_O^{-1}\gamma.

Transposition gives

tUOT=γTUOT.\partial_tU_O^{-\mathsf T} = \gamma^{\mathsf T}U_O^{-\mathsf T}.

The initial value is the identity, so this is exactly the coefficient evolution matrix.

  1. Explain why UOT=UBTUATU_O^{-\mathsf T}=U_B^{-\mathsf T}U_A^{-\mathsf T} when UO=UBUAU_O=U_BU_A.
Solution

Use

(UBUA)1=UA1UB1.(U_BU_A)^{-1}=U_A^{-1}U_B^{-1}.

After transposition,

(UBUA)T=UBTUAT.(U_BU_A)^{-\mathsf T} = U_B^{-\mathsf T}U_A^{-\mathsf T}.

Thus the later coefficient factor is also on the left. Attempting to reverse the final displayed product a second time double-counts the reversal already contained in inversion and transposition.

  1. Show that a simultaneous but reversed evolution can preserve CTOC^{\mathsf T}O and state an independent rejection test.
Solution

For any invertible trial matrix VV, the pair

Otrial=VO0,Ctrial=VTC0O_{\rm trial}=VO_0, \qquad C_{\rm trial}=V^{-\mathsf T}C_0

obeys CtrialTOtrial=C0TO0C_{\rm trial}^{\mathsf T}O_{\rm trial}=C_0^{\mathsf T}O_0. Therefore choosing V=UAUBV=U_AU_B instead of UBUAU_BU_A passes the pairing test. It fails tU=γ(t)U\partial_tU=-\gamma(t)U, the declared composition law, and the exact benchmark matrix.

Continue to Symmetry-Protected Operators, Currents, and Improvement to identify operator directions whose evolution is fixed by exact identities. Continue to Nonperturbative Renormalization Schemes and Step Scaling to replace infinitesimal perturbative running by continuum-extrapolated finite scale steps.

  • Collins, John C. 1984; open-access reissue 2023. Renormalization: An Introduction to Renormalization, the Renormalization Group and the Operator-Product Expansion. Cambridge Monographs on Mathematical Physics. Cambridge University Press. DOI and Open PDF.

  • Manohar, Aneesh V. 2018. “Introduction to Effective Field Theories.” Lectures at the 2017 Les Houches Summer School on Effective Field Theories. arXiv:1804.05863.