Optimization for factorized quantities in perturbative QCD
P. M. Stevenson

TL;DR
This paper revisits the optimization of scheme choices in perturbative QCD calculations, correcting previous deficiencies and simplifying the process by identifying proper scheme variables and invariants.
Contribution
It corrects and clarifies the application of the principle of minimal sensitivity in optimizing factorized quantities in perturbative QCD, simplifying the optimization procedure.
Findings
Recovered earlier results of Nakkagawa and Niegawa.
Showed that optimized coefficient C^opt=1, simplifying calculations.
Identified proper scheme variables, RG equations, and invariants.
Abstract
Perturbative calculations of factorized physical quantities, such as moments of structure functions, suffer from renormalization- and factorization-scheme dependence. The application of the principle of minimal sensitivity to "optimize" the scheme choices is reconsidered, correcting deficiencies in the earlier literature. The proper scheme variables, RG equations, and invariants are identified. Earlier results of Nakkagawa and Niegawa are recovered, even though their starting point is, at best, unnecessarily complicated. In particular, the optimized coefficients of the coefficient function C are shown to vanish, so that C^opt=1. The resulting simplifications mean that the optimization procedure is as simple as that for purely-perturbative physical quantities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Optimization for factorized quantities
in perturbative QCD
P. M. Stevenson
*T.W. Bonner Laboratory, Department of Physics and Astronomy,
Rice University, Houston, TX 77251, USA*
Abstract:
Perturbative calculations of factorized physical quantities, such as moments of structure functions, suffer from renormalization- and factorization-scheme dependence. The application of the principle of minimal sensitivity to “optimize” the scheme choices is reconsidered, correcting deficiencies in the earlier literature. The proper scheme variables, RG equations, and invariants are identified. Earlier results of Nakkagawa and Niégawa are recovered, even though their starting point is, at best, unnecessarily complicated. In particular, the optimized coefficients of the coefficient function are shown to vanish, so that . The resulting simplifications mean that the optimization procedure is as simple as that for purely-perturbative physical quantities.
1 Introduction
The application of the principle of minimal sensitivity [1] to the problem of factorization-scheme dependence has had a rather unfortunate history. The present author shares some of the blame, and this paper aims to make amends. The pioneering work by Politzer [2], which showed the way, was marred by a trivial algebraic error, seemingly showing that the optimization equations had no solution. The error was belatedly corrected in Ref. [3]. However, Ref. [3] is, in retrospect, insufficiently general beyond second order. The formulation of Nakkagawa and Niégawa (NN) in a series of papers [4]-[7] is, at best, unnecessarily complicated and creates spurious difficulties. However, NN’s optimization equations are actually equivalent to those we derive below. We discuss their work in Appendix A. Note that in Refs. [2]-[7] “” has the opposite sign to ours.111 Our notation follows Ref. [8], except that we now omit tilde’s on and , which had merely emphasized a difference in definition from previous conventions. Tildes will be needed here for another purpose.
The prototypical factorization problem is in deep-inelastic leptoproduction, where a high-energy lepton collides with a proton, or other hadron, exchanging a virtual photon of large virtuality . Neglecting power-suppressed terms, the th moment, , of the non-singlet proton structure function can be factorized into the form
[TABLE]
where is an operator matrix element, is a coefficient function, and is some arbitrary “factorization scale.” (From now on the moment index will be suppressed.)
The operator matrix element has an dependence given by its anomalous dimension
[TABLE]
While itself cannot be calculated perturbatively, its anomalous dimension, , has a calculable perturbation series of the form
[TABLE]
The leading-order coefficient is written as for later convenience. While is invariant the other coefficients, are scheme-dependent. The expansion parameter, , is the couplant in some arbitrary renormalization scheme (RS) with renormalization scale . Its dependence is given by the function:
[TABLE]
The scheme-dependent coefficients can be regarded as RS labels [1, 8].
The coefficient function can be calculated as a perturbation series:
[TABLE]
where is the couplant of some other arbitrary RS – which can be different from the RS used to define . It can have a different renormalization scale , and different RS labels . (In the latter respect we differ from Ref. [3].) Perhaps the easiest way to understand that the RS’s for and can be distinct, without inconsistency, is to imagine that first both and are calculated in the same RS and then a substitution , with arbitrary , is made in the result for . In terms of renormalization constants, the constant needed for the renormalization of the operator (which is genuinely an infinite change of normalization) must be consistent between the calculations of and , but the reparametrization step – the substitution of and in the bare forms of and , respectively – can involve distinct and renormalization constants.
Thus, what we shall call “RS/FS dependence” involves a choice of factorization scheme (FS), parametrized by , and two, independent, choices of RS for and that are labelled, respectively, by , and by , , where
[TABLE]
(See Appendix B for the definition of . Without loss of generality, we may assume that the two renormalization prescriptions for and are defined so that their parameters are the same.)
Integrating Eq. (1.2), utilizing the -function equation, gives
[TABLE]
Note that the dependence of comes solely from (whereas the dependence of comes solely from the coefficients). The constant of integration may be written as a constant defined by
[TABLE]
where, as with the definition of , the lower limit of in each integral produces a divergence that cancels between the two integrals. The normalization constant is not calculable from perturbation theory, but is RS/FS invariant, as shown in Ref [3].
2 Second-order approximation
We first discuss second order, where all authors are in agreement. A second-order approximation corresponds to truncating the series for , , and after two terms. The integrals in Eq. (1.8) become
[TABLE]
which exponentiates to
[TABLE]
Substituting in Eq. (1.1), one obtains the second-order approximation to as
[TABLE]
This approximant depends on RS/FS choices through three variables, , , and . Partial differentiations of Eq. (2.3) yield
[TABLE]
Self-consistency of perturbation theory requires these variations to be of order . Noting that , we see that
[TABLE]
so that has the form
[TABLE]
where is an invariant.222 The earlier literature is a bit sloppy at this point, as we discuss in section 4.
Substituting Eq. (2.7) back into Eqs. (2.4–2.6) and equating to zero produces the optimization conditions. Since vanishes, the solution to the optimization equation (2.4) is simply
[TABLE]
The second optimization equation, from (2.5), then reduces to
[TABLE]
and (2.6) gives
[TABLE]
Eliminating between these last two equations gives us the optimal in terms of :
[TABLE]
Also, from the integrated -function (“int-”) equation (see Appendix B), at second order, we have
[TABLE]
Substituting for and for in Eq. (2.8) and equating to zero, since , we find
[TABLE]
which determines the optimized in terms of the invariant quantities and . Substituting back in Eq. (2.12) then fixes . The final optimized result, from Eq. (2.3), is
[TABLE]
Note that the optimization condition means that , so that all perturbative corrections are effectively exponentiated and re-absorbed into the anomalous dimension by the optimization procedure. As we shall see later, this property holds at any order, as first noted by NN [5].
Also note that while the value of (and hence ) is determined, it is not needed to obtain the result for .
3 RG equations
As discussed above the RS/FS variables are , , , , and the coefficients. We now write down the RG equations expressing the fact that the physical quantity is independent of all these variables. Symbolically, we have
[TABLE]
where stands for any of the set of variables .
Recalling the factorized form of Eq. (1.1), and noting that is manifestly independent of , we see that
[TABLE]
The same argument applies to the derivatives, since , while it depends on and its RS variables , is manifestly independent of and its RS variables . Thus, the first two RG equations have the familiar form
[TABLE]
where the first term collects dependence from the coefficients of , while the second term collects the compensating dependence via . (See Appendix B for the definition of the functions.)
The other RG equations all take the form
[TABLE]
where is any of the variables or . The first term only involves dependence via the coefficients – indeed we are tempted to add “” (meaning “with held constant”) to the notation, to match Eqs. (3.3), (3.4), but it is unnecessary since is manifestly independent of and . The second term can be evaluated as follows. In the case , we may simply use the definition of , Eq. (1.2), to get
[TABLE]
For we can first write
[TABLE]
and then use Eq. (1.8) to obtain
[TABLE]
Although we return to this form later, for the present we follow NN and re-write it as
[TABLE]
where . The equivalence to Eq. (3.8) can be shown by integrating by parts and then using the differential equation satisfied by the functions (see Appendix B). Finally, for we find, from Eq. (1.8),
[TABLE]
Thus, the RG equations, in addition to Eqs. (3.3,3.4), are
[TABLE]
As usual, the RG equations determine how the coefficients must depend on the RS/FS variables. We now re-write the RG equations to facilitate finding these dependences. First, we use the series for and :
[TABLE]
with . Second, we convert the functions to the functions of Appendix B (whose series begin ). A third simplification, concerning the lower limit of the summations, is discussed below. We obtain
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
The summations of the terms inherently begin with , but in the and equations, where the second term starts only at order , it is immediately evident that cannot depend on or for . Thus, we may begin those summations at . For the equation a stronger result holds, since must vanish for as well as for . This observation is crucial for the “exponentiation theorem” proved in Sect. 5.
In -th order all the sums would go up to only and the equations would only be satisfied, in an arbitrary RS/FS, up to remainder terms of order . The vanishing of all terms up to and including fixes the RS/FS dependence of the coefficients, and leads us to identify a set of invariants, , as discussed in the next section.
4 Invariants
The scheme dependences of were already found in Eq. (2.7) and led us to the first invariant
[TABLE]
It is dependent because , when calculated from Feynman diagrams, will contain a term . One can view as , where is a scale specific to the quantity , but related, in an exactly calculable way, to the of some universal, reference RS. The earlier literature used an “invariant” given by
[TABLE]
It is true that is invariant under changes of FS and renormalization scale, with the explicit and dependences cancelling the implicit and dependences of . Where fails to be invariant is under a change of RS that leaves the renormalization scale unchanged, but changes the renormalization prescription, so that , with some arbitrary . Under such a transformation the factor in , see Eq. (2.2), becomes , so the coefficient must become to leave invariant. Thus, . Since our is
[TABLE]
this change in cancels with the change from to , by the Celmaster-Gonsalves [9] relation.
The higher invariants, , can be defined to be -independent. As with the invariants, it is convenient to define the ’s so that they reduce to the -function coefficients in “effective charge” schemes, defined by the RS/FS choices , . The invariants, so defined, depend on and only via the difference and have no dependence on or .
To find the invariants we will need the conversion between and ; either or its inverse
[TABLE]
The coefficients can most easily be found from the relation between the functions: . (In fact, the calculation mirrors that for the invariants in Ref. [8].) The first three coefficients are
[TABLE]
Note that the ’s do not only involve differences . It is true, though, that the coefficients of the inverse relationship are obtained by exchanging all plain and tilde variables.
We now turn to a calculation of the invariant . Expanding Eqs. (3.15–3.19) in powers of and and using the above result for , we can extract the self-consistency conditions. From the lowest-order terms we recover Eqs. (2.7) for ’s derivatives, plus confirmation that does not depend on the other RS/FS variables (, , ). From the next-order terms we find
[TABLE]
Integrating each of these equations individually is easy, but combining the results consistently is a little tricky. However, it is straightforward to check our result that has the form:
[TABLE]
where the constant is independent of all the RS/FS variables. The constant can be conveniently written as so that the invariant is given by
[TABLE]
An easier and more systematic way to calculate the invariants is to find them as the invariants associated with the physical quantity
[TABLE]
The perturbation series for can be found in terms of the and series in various ways. Perhaps the simplest is the following. First, note that all the dependence of resides in the coefficients of . For dimensional reasons such dependence can come only via the ratios and . Thus,
[TABLE]
The dependence of must cancel out with that of in the product , so that
[TABLE]
while is independent of , so that
[TABLE]
From these observations we see that
[TABLE]
Thus, is, in a sense, a “physicalized” version of .
Substituting in the above formula we find
[TABLE]
We could now expand out in terms of , converting to using Eq. (4.4). Alternatively, we can eliminate and find the series expansion in terms of . The results are more compact in the scheme:
[TABLE]
with
[TABLE]
and so on. Note that these coefficients are independent of the FS and independent of the tilde RS variables, with the explicit and dependences exactly cancelling with the implicit dependences from the coefficients; see Eqs. (2.7), (4.6). Thus, the coefficients only depend, in the usual way, on the RS variables associated with .
As usual, we can construct the invariants for the quantity :
[TABLE]
and these coincide with the ’s. Indeed, it is easy to see that the “effective-charge-type” RS/FS used in the definition of the ’s corresponds to the usual effective-charge scheme for , so the equivalence of to is true for all .
The calculation can be straightforwardly extended to higher orders. Defining
[TABLE]
the first three invariants are
[TABLE]
Using these formulas the values of the invariants can be found from Feynman-diagram calculations performed in any convenient RS/FS.
5 The exponentiation theorem
The -th order approximation is defined by truncating the series for , , , and . The resulting approximant, in general, will have a residual RS/FS dependence that is formally of order . The optimization conditions correspond to requiring the RG equations to be exactly satisfied, with no remainder. (To avoid notational clutter, we leave it understood that, henceforth, any RS/FS-dependent symbol ( etc.) stands for the optimized value of that quantity.)
At second order we saw that the optimization equation gave . In third order ) the equation (3.15), in which , reduces to
[TABLE]
Also, the equation (3.16), in which the factor cancels out because , becomes just
[TABLE]
Substituting this back into the previous equation gives . Substituting back into Eq. (5.2) then gives . The result generalizes to all orders, as first noted by NN.
Theorem (Nakkagawa and Niégawa [5])
The solution to the and optimization equations is
[TABLE]
Thus, in the optimal scheme, so that all perturbative corrections are effectively exponentiated and re-absorbed into the anomalous dimension .
Proof: The optimization equation follows from Eq. (3.16):
[TABLE]
where . Recall that all terms up to and including must cancel in any RS, thus determining . By starting the sum at we have already used the fact that must vanish for and for , as noted at the end of Sect. 3.
We begin by considering the case . The first term vanishes, as there are no terms in the sum, so we find that in the optimal scheme
[TABLE]
Next, consider the case . In any scheme, cancellation of the terms requires
[TABLE]
In the optimal scheme the left-hand side must vanish, since vanishes in the optimization equation (5.4). Thus, in the optimal scheme, . Proceeding to the case we can find as a sum of and terms. In the optimal scheme this must vanish, and since we already have , we now find that , too. We may then proceed to successively lower cases to see that other ’s vanish. Finally, we reach , where we are dealing with the equation, which gives us . Substituting back into then shows that .
6 The optimization equations
The fact that in the optimal scheme allows us to simplify the remaining optimization equations, which follow from Eqs. (3.17–3.19) with the summations truncated at .
Also, recalling that the functions are related to the integrals, one sees that the equation involves
[TABLE]
This can be simplified by interchanging the order of the two integrations:
[TABLE]
to give
[TABLE]
which corresponds to going back to the form in Eq. (3.8) for . Also note that the optimization equations involve a related set of integrals
[TABLE]
Thus, the , , and optimization equations can be written as
[TABLE]
[TABLE]
[TABLE]
In each of these equations the first term is a polynomial in that must precisely cancel out the terms up to and including present in the second term, if it were expanded out in a power series in . In Ref [8] we used the notation to mean “truncate the series for immediately after the term” (i.e., ). Here we will need as the equivalent operation in the expansion parameter . Thus, we may re-write the equations (swapping the order of the two terms and dividing out a factor) as
[TABLE]
[TABLE]
[TABLE]
However, note that the arguments of the ’s are all functions of , rather than , so it is best to think of the operation in three stages (i) expand as series in up to , (ii) convert to using Eq. (4.4), and (iii) re-expand as a series in , and truncate after the term.
A further simplification results from the realization that, since , we do not need to know the optimized value of ; nor do we need to know the ’s or : they do not enter into the optimized result for , which just involves evaluating in the optimal scheme. Thus, what we need to do is to take combinations of the optimization equations in which and the ’s cancel out. From the resulting equation combinations we can solve for the coefficients in terms of the “principal variables” . (Note that the and integrals are functions of these principal variables.) Finally, we can use the invariants, and , and the int- equation to determine the optimized result. Note that when =0 the ’s have exactly the same form as the usual invariants with ’s in place of ’s.
In the next section we illustrate the above observations in the case of third order.
7 Third-order approximation
In third order () we have four remaining optimization equations, in the variables , , , and . From Eqs.(6.8)–(6.10) these are
[TABLE]
Taking the equation minus the equation cancels the terms and, not coincidentally, the terms, leaving
[TABLE]
An term remains, but we can substitute from the equation to obtain
[TABLE]
Taking the equation minus the equation cancels the terms, giving
[TABLE]
We may solve these last two equations for in terms of the principal variables .
From the four original equations we have extracted just two equations that give us the coefficients that we need. There are effectively two other equations that we can just ignore; they would determine and (which gives and, combined with the int- equation of the tilde scheme, would then fix ), but we have no need to obtain values for these variables.
To relate the principal variables to and the invariants, we substitute the optimal-scheme quantities into the expressions for and , combining the latter with the int- equation to eliminate . In the optimal scheme, since , the formula for reduces to
[TABLE]
which is the familiar form of a invariant, but with ’s as the coefficients. Similarly, in the optimal scheme
[TABLE]
where is the third-order approximation to the function of the int- equation.
8 A simpler approach
In fact, there is a simpler approach that allows us to get directly to the equations determining the optimal ’s. Consider the physical quantity defined in Eq. (4.9), which we showed is given by Eq. (4.13), so that when . That suggests that we consider in the form:
[TABLE]
where “’ is a shorthand for the same “lower limit of [math] with subtraction of the suitable infinite scheme-independent constant,” as in Eq. (1.8). Formally, this expression for is valid quite generally, and is independent of the RS used, so it satisfies RG equations saying that the total dependences on and all vanish. What we are doing in RS/FS optimization is equivalent to a normal RS optimization applied to , except that the approximants being optimized are not truncations of the perturbation series for , but are approximants formed by truncating the perturbation series for and . That is, the -th approximant to is given by substituting
[TABLE]
into Eq. (8.1). The optimization equations follow from requiring the and derivatives to vanish. (Note that when we take such derivatives the infinite constant plays no role and the “” lower limit can safely be replaced by [math], since the resulting integrals converge.) For we have
[TABLE]
while for
[TABLE]
Substituting the series form for leads to
[TABLE]
where arises from the first and third terms of Eq. (8.4).
The derivatives and are the usual RS dependences of perturbative coefficients [1, 8], and can be quickly found from the expressions for the invariants. Thus,
[TABLE]
Using these results, and recalling that in the FS/RS optimal scheme the optimized ’s equal the optimized ’s, the reader can quickly check that at 3rd order () Eqs. (8.5) and (8.6) lead directly to Eqs. (7.6) and (7.7).
At 4th order () the equations reduce to
[TABLE]
[TABLE]
[TABLE]
We have explicitly checked that these are indeed the equations one would obtain from appropriate combinations of Eqs. (6.8), (6.9), (6.10).
9 Conclusions and outlook
The optimization approach to the problem of RS/FS dependence is now, we believe, on a firm footing. It is far less daunting than it might appear at first sight. There are scheme variables at -th order and coefficients, . However, of the optimization equations lead to , so that ; another variables () then need not be solved for. That leaves combinations of optimization equations that can be solved for in terms of the “principal variables” . In fact, these equations can be obtained more directly by the approach in the last section. By substituting in the expressions for the invariants, one can then solve for all the needed quantities. The last step will require an iterative algorithm, as in ordinary optimization [8].
Our results have applications to various quantities, such as charmonium decays to hadrons, decays to charmonium, or Higgs boson decay to hadrons: These quantities have a factorized form involving the wavefunction at the origin or, in the last case, the quark masses. For applications involving parton distribution functions and fragmentation functions there is more work to be done. We have only considered the non-singlet case; the flavour-singlet case involves matrices describing quark-gluon mixing. Also, our analysis has used the language of structure-function moments, which is convenient theoretically since it reduces a convolution integral to a simple product. However, phenomenologically, it seems preferable to deal directly with the parton distributions using parton-evolution (DGLAP) equations. It would be valuable to see if our moments-based approach can be reformulated in that language and put into practice.
We end with a plea to recognize of the importance of this effort. When QCD was young, the use of phenomenological, ad hoc choices was excusable, perhaps even necessary to make progress. Now that the theory is mature we cannot go on using arbitrary renormalization prescriptions and blind guesses at the “right” renormalization and factorization scales (which don’t even exist, since it is only the ratios of and to the prescription-dependent that matter). If “precision QCD” is to be a valid scientific enterprise, it must be based on a systematic treatment of RS/FS ambiguities, with a respect for RG invariance at its core.
Appendix A: Discussion of the work of NN
In this appendix we critique the work of Nakkagawa and Niégawa (NN) [4]-[7] and outline why, nevertheless, their optimization equations are equivalent to ours. Note that their “” corresponds to our (and their “” is the opposite sign to ours). Their is the same as ours, but their is somehow supposed to explicitly depend on both and . They write where . It is never clear quite how this object is defined. Because of its supposed dependence on two scales, NN associate it with two functions, whose coefficients are supposed to depend on . We find this rather odd; it might not be wrong, but it certainly creates difficulties without gaining any generality. In our approach the couplant is a normal couplant, with a renormalization scale , in a RS labelled by . This RS is distinct from, and independent of, the tilde RS used for , whose scale is and whose scheme labels are . Along with FS labels these form the complete set of RS/FS labels, and variation of any one label, in a partial derivative, is made holding the other labels constant. Thus, there is no question of ’s “depending” on or or their ratio.
For NN the integration of their two -function equations for “” is problematic [5, 6], because of a dependence on the integration path. Later [7] they claimed to have resolved this problem, and made the dependence of their ’s go away. In our view, this dependence and the integration-path problem should never have been there in the first place!
NN’s analysis involves a somewhat mysterious variable , which it seems must actually be, in their notation, . In our notation that means . Provided that we make this identification, we find that their equations (Eqs. (18a-e) of Ref. [5]) are equivalent to ours. Apart from straightforward conversion of notation we need to recognize that they work with variables and , etc., while we work with and (related to and , respectively). Thus their is at constant and coincides with our : However, their is at constant and so corresponds to our ). Hence, their optimization equation associated with is a sum of our and optimization equations.
Notwithstanding our criticisms, NN deserve praise for arriving at the correct optimization equations, and they were correct to criticize Refs. [2, 3]’s formulation as insufficiently general. The applications of their results, pursued with Yokota [10], are valid and important. In particular, they show how optimization naturally resolves the issue that, in a naïvely fixed scheme, the perturbative coefficients for the th moment would grow like .
Appendix B: and functions
For the reader’s convenience we list here some key formulas from Refs. [1, 8]. The integrated form of the -function equation, referred to as the “int-” equation, is
[TABLE]
with
[TABLE]
The functions, defined as , are given by
[TABLE]
Their series expansions begin at order so it is convenient to define functions which begin :
[TABLE]
For it is natural to define
[TABLE]
with the convention that and . Equation (B.3) can then be re-written as
[TABLE]
where
[TABLE]
(Note that this formula for even holds for if the r.h.s. is interpreted as the limit from above.)
Differentiating Eq. (B.3) leads to
[TABLE]
where here the prime indicates differentiation with respect to , regarding the coefficients as fixed.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. M. Stevenson, Phys. Rev. D 23 , 2916 (1981).
- 2[2] H. D. Politzer, Nucl. Phys. B 194 , 493 (1982).
- 3[3] P. M. Stevenson and H. D. Politzer, Nucl. Phys. B 277 , 758 (1986).
- 4[4] H. Nakkagawa and A. Niégawa, Phys. Lett. B 119 , 415 (1982).
- 5[5] H. Nakkagawa and A. Niégawa, Prog. Theor. Phys. 70 , 511 (1983).
- 6[6] H. Nakkagawa and A. Niégawa, Prog. Theor. Phys. 71 , 339 (1984).
- 7[7] H. Nakkagawa and A. Niégawa, Prog. Theor. Phys. 71 , 816 (1984).
- 8[8] P. M. Stevenson, Nucl. Phys. B 868 , 38 (2013).
