Evolution Kernels, Consistency Relations, and Resummation Architecture
Factorization replaces one badly behaved fixed-order expression by several functions, each with its own natural scale. Renormalization-group evolution transports those boundary functions to a common scale. The transport resums logarithms only if the anomalous dimensions satisfy the same consistency relations as the factorization formula, and only if fixed-order boundary terms are not counted again in the evolved result.
This page builds that architecture for the off-shell Sudakov product. Its four cusp kernels reproduce the leading double logarithm and provide an exact common-scale cancellation test. Matrix evolution, logarithmic accuracy, profile scales, and fixed-order matching then extend the construction beyond this scalar kernel example.
Required background. Matching onto Factorized Operator Structures supplies the hard, collinear, and soft factors. Dual Evolution of Operators and Wilson Coefficients supplies coefficient–operator sign and transpose conventions. Large Logarithms and RG Improvement supplies the single-scale evolution logic.
Helpful background. Sudakov Logarithms and Resummation develops observable-level applications.
Consistent kernels for the Sudakov product
Section titled “Consistent kernels for the Sudakov product”Consider an amplitude-level factorization with two off-shell collinear legs,
Write . The multiplicative RG equations have the form
The cusp logarithms sum to zero because
The noncusp terms must independently satisfy
These are not optional simplifications. They express and test the scale relation, operator renormalization, zero-bin assignments, and sign conventions simultaneously.
| Factor | Natural virtuality scale | Cusp sign | Boundary calculation |
|---|---|---|---|
| Hard matching with no large | |||
| First collinear sector | |||
| Second collinear sector | |||
| Ultrasoft Wilson-line matrix element |
Becher, Broggio, and Ferroglia derive these equations and their consistency sum in Becher, Broggio, and Ferroglia 2015, §§ 5.1–5.2, preprint pp. 48–53, Open PDF.
In an early SCET endpoint calculation, the soft and collinear contributions are both needed to reproduce the full theory’s infrared behavior; matching is free of the large logarithm at its natural scale, and coefficient evolution then sums the Sudakov series. See Bauer, Fleming, and Luke 2000, §§ III.B–III.C, preprint pp. 11–13, Open PDF.
Evolution operators and path ordering
Section titled “Evolution operators and path ordering”For a column vector of renormalized functions obeying
the solution is
Path ordering is required when
Dropping is justified only after proving commutativity or diagonalizing in a scale-independent basis. A valid kernel also obeys
These composition tests catch ordering and transpose errors that can remain invisible in a first-order expansion.
For a commuting cusp kernel, change variables from scale to coupling. Define
and
The hard-amplitude kernel can then be written
Analogous kernels with their own cusp signs and physical arguments evolve the jets and soft function. Expanding a kernel to its input order must reproduce the original RGE and its boundary value .
First application: reproduce the leading Sudakov exponent
Section titled “First application: reproduce the leading Sudakov exponent”Freeze , keep only the one-loop cusp term, and set all noncusp anomalous dimensions to zero. Let
be constant. Evolve each factor from its natural scale in the table to an arbitrary common . Direct integration gives
Using , every dependence on the arbitrary common scale cancels, leaving
For a quark current, , so
This is the leading off-shell Sudakov suppression. The derivation uses all four factors: deleting the soft kernel or assigning it the jet sign leaves a spurious dependence and the wrong exponent. Running coupling promotes the simple squares to and integrals without changing the consistency test. For a cross section, the hard boundary is and the amplitude exponent is combined with the corresponding measured jet and soft functions.
Declaring logarithmic accuracy
Section titled “Declaring logarithmic accuracy”An accuracy label is meaningful only with an ingredient convention. A common exponent-counting convention is:
| Accuracy | Cusp anomalous dimension | Noncusp anomalous dimensions | function | Boundary matching |
|---|---|---|---|---|
| LL | 1 loop | omitted | 1 loop | tree |
| NLL | 2 loops | 1 loop | 2 loops | tree |
| NLL | 2 loops | 1 loop | 2 loops | 1 loop |
| NNLL | 3 loops | 2 loops | 3 loops | 1 loop |
The prime adds one order of fixed boundary terms without increasing the evolution order. Other communities shift labels, so a result should list ingredients rather than rely on “NLL” alone. Matrix problems must additionally state the perturbative order and basis used for diagonalization or path ordering.
Boundary functions are evaluated at natural scales and then evolved; their fixed-order logarithms must not be added a second time. When a resummed prediction is combined with a full fixed-order result, additive matching through order is
The subtraction must use the same conventions, inputs, phase space, and distributions as the fixed-order term. Its expansion is an essential reproduction test, not merely bookkeeping.
Canonical scales, profiles, and uncertainty
Section titled “Canonical scales, profiles, and uncertainty”Canonical scales minimize logarithms in each boundary function. For a two-jet distribution with small event shape , a typical hierarchy is
A fixed canonical choice can enter the nonperturbative region as and can continue resumming where the singular and nonsingular terms are comparable. Profile scales replace it with smooth functions of that:
- freeze the soft scale above a declared perturbative floor;
- follow canonical scaling in the resummation region;
- merge and into where fixed order should take over; and
- remain ordered and differentiable through the transition regions.
Uncertainty should retain its origin. Vary the hard, jet, and soft boundary scales around their canonical values subject to the hierarchy; vary profile transition points and curvature; vary the common evolution scale as a correlation check; and compare the matched expansion with the exact fixed-order result. The envelope is a truncation diagnostic, not a statistical confidence interval. A profile that crosses a Landau pole or creates a new large logarithm is inadmissible rather than an uncertainty variation.
The evolution stage in the construction map
Section titled “The evolution stage in the construction map”The last numbered box in the right panel represents the kernel architecture developed here. Its separate and labels matter: this page evolves virtuality. The next page adds rapidity evolution when equal-virtuality modes cannot be separated by alone.
Mode locations are shown in the exponents and of , with the transverse exponent written in each label. The line contains -collinear, -collinear, and soft-II scalings of virtuality ; their separation along the line is a rapidity separation. Ultrasoft momentum has virtuality , while hard fluctuations are matched at . The points are alternatives selected by a hierarchy and observable, not a universal simultaneous field list. A consistent construction requires homogeneous fields, multipole and overlap expansion, sector matching, and and, when needed, evolution, with explicit factorization checks. The diagram is schematic and not to scale.
Common pitfalls
Section titled “Common pitfalls”Evolving every factor from the hard scale. Jets and soft functions have lower natural scales. Starting all boundaries at leaves the logarithms inside fixed-order matching instead of resumming them through controlled kernels.
Dropping path ordering by inspection. A matrix that is diagonal at one scale need not share eigenvectors at another. Check commutators or solve the ordered system directly.
Using scale variation to hide inconsistency. If the anomalous-dimension sum is nonzero, no scale choice repairs the factorization formula. Locate the missing mode, overlap, operator, or counterterm first.
Adding resummed and fixed-order results without subtraction. Their common expansion is then counted twice. Verify the matched result through the declared fixed order before using it outside the asymptotic region.
Exercises
Section titled “Exercises”-
Why does a cusp term in an anomalous dimension produce double logarithms?
Solution
The cusp term already contains a logarithm such as . Integrating the RG equation over therefore produces ; coupling running organizes the higher logarithmic towers.
-
What is the strongest fixed-order check of a resummed expression?
Solution
Expand the resummed result to the known order and compare every singular distribution, logarithm, and scale-dependent constant with the fixed-order calculation in identical conventions.
References
Section titled “References”-
Bauer, Christian W., Sean Fleming, and Michael Luke. 2000. “Summing Sudakov Logarithms in in Effective Field Theory.” Physical Review D 63 (1): 014006. DOI. Open PDF.
-
Becher, Thomas, Alessandro Broggio, and Andrea Ferroglia. 2015. Introduction to Soft-Collinear Effective Theory. Lecture Notes in Physics 896. Cham: Springer. DOI. Open PDF.