Universal approximations for flavor models

We develop a systematic analytical approximation scheme for the singular value decompositions of arbitrary complex three dimensional matrices Y with non-degenerate singular values. We derive exact expressions for the errors of this approximation and show that they are bounded from above by very simple ratios of the form (yi/yj )2n where yi< yj are singular values of Y and n is the order of the approximation. The applications we have in mind are the analytical and numerical treatments of arbitrary theories of flavor. We also compute upper bounds for the errors of the Cabbibo Kobayashi Maskawa (CKM) matrix that only depend on the ratios of the masses and the physical CKM angles.


Introduction
One of the unresolved mysteries of the Standard Model (SM) is the peculiar structure of the fermion sector, in particular the very non-generic structure of their masses and mixings. Disregarding the neutrino sector, the properties of the fermions are encoded in their Yukawa couplings, complex three by three matrices Y u , Y d and Y e .
A brief summary of the SM fermion data is given in table 1. The actual values depend on the renormalization group scale (and scheme) as well as on possible New Physics thresholds (such as supersymmetry), we quote the SM values in the MS scheme at 1 TeV as given in ref. [1]. Notice that RG running and threshold corrections typically give only O(1) modifications to these numbers. One observes the hierarchical structure y u 1 y u 2 y u 3 , y d 1 y d 2 y d 3 , y e 1 y e 2 y e 3 . (1.1) Moreover, the CKM mixing angles follow the hierarchy θ 13 θ 23 θ 12 1 .
(1. 2) while mixing angles in the neutrino sector are O(1). The observations eq. (1.1) require that the eigenvalues of the Hermitian matrices Y x Y † x (x = u, d, e) are very hierarchical, while eq. (1.2) implies that the eigenvectors of Y u Y † u and Y d Y † d are closely aligned. Clearly, the latter fact means that the up and down Yukawa couplings have to "know of each other" in some way.
Many models have been proposed to explain this peculiar structure, we comment on a few representative ones in section 4. In order to have good analytical and numerical JHEP07(2019)131 y u 6.3 × 10 −6 y d 1.4 × 10 −5 θ 12 0.23 y e 2.8 × 10 −6 θ 12 0.58 y c 3.1 × 10 −3 y s 2.7 × 10 −4 θ 23 4.2 × 10 −2 y µ 6.0 × 10 −4 θ 23 0.82 y t 0.87 y b 1.4 × 10 −2 θ 13 3.7 × 10 −3 y τ 1.0 × 10 −2 θ 13 0.15 Table 1. Quark and Lepton data at 1 TeV in the SM [1]. control over the model parameter space, it is common practice to expand eigenvalues and eigenvectors in terms of some small parameters present in a given model. However the goodness of such expansions not only depends on the size of the expansion parameters (of which there might be several) but also on all the other parameters of the model. To judge its accuracy, one would have to go higher order in the expansion, and in order to achieve a given precision one has to resum the expansion up to a certain order. In this short paper we comment on a very powerful and fully model-independent approximation scheme that can be carried to arbitrarily high precision. It is extremely simple to apply and does not rely on the existence of any expansion parameter. The expressions for eigenvalues and mixings are given exclusively in terms of the (Y x ) ij , without any assumptions on their sizes. The errors of the approximation are exactly bounded by (not just of the order of) simple ratios of the quantities (y i /y j ) 2n , y i < y j , where n is the order of the approximation. We will see that known approximations of particular models follow without any calculation, with the added bonus of adding complete analytical control over their errors. We hope that the method presented in this paper can help to better understand the parameter space of existing and yet to be conceived models of flavor, facilitating for instance fits to the data. Finally this paper may serve as a reference for students studying mainstream models (such as Frogatt-Nielsen [2]) for the first time who want a simple and easy to follow derivation of the known approximations.

Preliminaries
We recall that an arbitrary complex matrix Y can be written as a so-called singular value decomposition (SVD) where U L and U R are unitary and Y is diagonal. The elements of Y are called singular values (SV) of Y , which are unique up to phases. Given a particular phase convention for Y (say all SVs real positive), the remaining ambiguity consists of multiplication of U L and U R with the same diagonal phases matrix from the right. The columns of , and |Y| 2 are the eigenvalues. Our discussion will be greatly simplified by a convenient parametrization of a general unitary matrix U ∈ U(3) which we write as We will refer to this parametrization as the abc parametrization. The quantities n 1 and n 3 are normalization constants for the column vectors, given by Notice that det K = 1. The numbers a, b, c are arbitrary complex numbers, which together with the phases α, β, γ comprise the 9 (real) degrees of freedom of U(3). We will sometimes use the shorthandb Given an arbitrary U ∈ U(3), one can readily compute these parameters: Unitary matrices that appear in SVDs of random matrices (with matrix elements drawn from a uniform measure) are distributed according to the invariant Haar measure [3]. In the parametrization eq. (2.2), the Haar measure of the group is simply where we normalized the measure to unity.

Approximate diagonalizations
In this section we are going to describe a neat analytic way of diagonalizing a Hermitian matrix. Even though in principle it can be applied to any matrix, it is particularly suited for matrices that have hierarchical spectra, such as the mass matrices of the SM. Let A be a positive-definite, Hermitian 3 by 3 matrix, and let a i be its (non-degenerate) eigenvalues. By convention, we will assume that a 1 < a 2 < a 3 .
Let us consider the matrix A n which of course has the same eigenvectors as A. Diagonalizing it as

JHEP07(2019)131
we write the three column vectors of A n suggestively as Observe that we have written each column of A n as a linear combination of the eigenvectors of A. This way it becomes clear that as n → ∞ each of the three column vectors of A n (when properly normalized) converges to U i3 , the eigenvector corresponding to the largest eigenvalue a 3 , and hence we can compute the b and c parameters of We can choose any of the three representations j = 1, 2, 3, but observe that for the jth column of A n a small |U j3 | will slow down the convergence (or even destroy it if U j3 = 0) because it appears in the denominator of the subleading terms. However the U j3 cannot all be small simultaneously, in fact unitarity implies max j |U j3 | ≥ 1 √ 3 . Fortunately it is possible to find the j that maximizes |U j3 | without actually knowing U , just by looking at the length of the j th column vector of A n It is easy to see that in the limit of n → ∞ the largest |U j3 | is exactly correlated with the largest L j . For finite n one can still find a lower bound for |U j3 | which is evaluated in appendix A and comes very close to 1 √ 3 . In order to achieve the smallest error, we thus choose the longest of the three column vectors of A n , i.e., the one with the largest L, as an approximation for the eigenvector to eigenvalue a 3 .
For the parameter a andb which are related to the smallest eigenvalue, we proceed with the same method, this time with the matrix A −n , where for completeness we also give the dependent quantityb. Notice that if the columns used to determine U i3 and U i1 are different, j = k, the eigenvectors are exactly orthogonal (this trivially follows from the fact that A −n and A n are inverses) and equivalentlyb = b − ac. On the contrary, it is possible that the maximum length criterion gives the same column (say the first one of both A n and A −n ), in this case they are only orthogonal up to small corrections (see appendix A for details). Sometimes it might be more convenient to work with the matrix of minorsÃ This way, the procedure is defined also for a 1 = 0. Obviously, these results hold for matrices of any dimensions d, but the advantage for the case of interest of d = 3 is that it already completely determines the full unitary matrix U , as the eigenvector to a 2 follows from 10) or, equivalently, from the abc representation in eq. (2.3).
Having found an approximation U (n) for the matrix U , our next goal is to find an upper bound for the error of our algorithm. To this end, let us define the matrix which must converge to the identity. An explicit expression for V in terms of U ij and the a i can easily be obtained and is given in appendix A, where it is also shown that V can be bounded by Eq. (3.12) is valid for j = k (which is commonly satisfied in many explicit models) while for the case j = k a modified prescription yields the estimate eq. (A.18). We summarize our findings in the following theorem. This procedure works extremely well and can provide us with very useful analytic expressions and even fast converging numerical ones without the need for the calculation of the eigenvalues. 1 Note that the matrix U (n) defines a converging sequence (whose elements are explicitely given in terms of the matrix elements A ij ). Convergence is guaranteed as long as the eigenvalues are only slightly different, even though convergence is of course faster for smaller ratios of the eigenvalues. It is remarkable that contrary to what eq. (3.12) might suggest, the resulting matrix lim n→∞ U (n) is actually correct even when the spectra are degenerate. To see this, notice that the matrix U is not unique in this case. For instance, when a 1 = a 2 = a 3 only the first eigenvector is fixed while the other two can JHEP07(2019)131 be any vector orthogonal to U i1 . In this particular case, the matrix V in eq. (3.12) is convergent only in its first row and first vector ( showing that the method is finding the correct eigenvector to a 1 . The non-convergent two by two lower block of V indicates that the remaining two eigenvectors are not aligned between U and U (n) . However, these eigenvectors are arbitrary and hence any unitary U that has as its first column the eigenvector to a 1 is a correct solution. Similar considerations apply for a 1 = a 2 = a 3 as well as the trivial case a 1 = a 2 = a 3 .
To illustrate the importance of the maximum-length criterion, let us numerically examine the error of our method for a hierarchical matrix with and without the maximum-length criterion. For definiteness, we consider A = Y d Y † d with Y d the down quark Yukawa couplings (see table 1) in an arbitrary basis. Starting with the diagonal matrix, we perform random O(1) rotations U (drawn from the distribution eq. (2.8)) and then recompute the matrix U ≈ U (n) using our method with n = 1. To measure the error, we compute the matrix V ≡ U † U (n) and find its corresponding parameters ∆a, ∆b, and ∆c which indicate the deviation of V from the identity and are plotted in figure 1. The errors are in accordance with the upper limits derived above, while dropping the maximum-length criterion results in considerably larger corrections.
The eigenvalues themselves can be conveniently obtained by computing the traces of A n and A −n .
with a 2 following from the determinant. Alternatively, one can compute the limits where j and k are determined from the maximum length criterion. Even though this procedure works for any Hermitian matrix, it is particularly wellsuited for very hierarchical matrices with spectra a 1 a 2 a 3 , such as the mass matrices of the SM. In these cases one obtains very good approximations from the above relations JHEP07(2019)131 even with n = 1. Notice that we do not need to assume a particular form for the matrices, as long as the spectrum is hierarchical. These approximations thus go beyond the ones usually quoted in the literature, such as those resulting from the particular structure in eq. (4.1), which can be obtained as special cases of the above method.
If A is given as A = Y Y † , one can also obtain "half-integer" approximations, which can easily be found by starting from the SVD of Y , Y Y † Y , etc, instead of eq. (3.1). Of particular interest is the n = 1 2 case, obtained by starting from the SVD of Y , and results in the following important special case Theorem 2 (n = 1 2 approximation.) The singular value decomposition of a complex matrix Y is approximately determined as follows. The columns (U L ) i3 and (U L ) i1 are proportional to the longest columns of the matrices Y and (Y −1 ) † respectively, and the columns (U R ) i3 and (U R ) i1 are proportional to the longest columns of the matrices Y † and Y −1 . The errors are then bounded by eqs. (3.12) We will verify in section 4 that for the special structure eq. (4.1) the case n = 1 2 immediately yields the known approximations. Some corrections (such as the ones reported in ref. [4]) can be recovered from the n = 1 approximation. Finally we notice that there exist approximate expressions for the eigenvalues for half-integer n. In the case of n = 1 2 , they read where here j (j ) labels the longest row (column) of Y and analogously forỸ .
Let us now move to the CKM matrix V CKM ≡ U † u U d . The latter reads in our approximation: V (3.20) Using the explicit values given in table 1, we notice that for any model of Yukawa couplings, the approximation with n d = 1 and n u = 1 2 gives already excellent accuracy (at most 5% with the exception of θ 23 that has a maximal error of 12%, dominated by u 23 ). Observe that

JHEP07(2019)131
our approximation is very well-suited for numerical fits. Away from the physical values for the Yukawas it might lead to large errors (when for instance the true eigenvalues are not hierarchical), nevertheless near the χ 2 minimum one can always fully trust it. We stress once more that the upper bounds for the errors are very conservative, and can be much less in particular models. This typically happens when the entries in the matrix Y are itself hierarchical. One can get a good idea of this effect by computing V approximately using the approximate result for U . The result is the matrix V (n) , given in eq. (A.21).
Let us also comment on the PMNS matrix for neutrinos. If neutrinos are moderately hierarchical, one can obtain decent approximations for low n. This is only possible for the normal hierarchy, as in the inverted case one has m 1 m 2 > 0.98. On the other hand, in the normal ordering case, one has 0.17 ≤ m 2 m 3 ≤ 1 and 0 ≤ m 1 m 2 ≤ 1 depending on the size of m 1 . One can achieve accuracy comparable with (or less than) the current experimental one at n = 1 if m 1 10 −3 eV.

Examples
In this section, we would like to illustrate our method in three particular models or classes of models.

Frogatt-Nielsen and similar
Let us first turn to the Froggatt-Nielsen Model [2]. Identical reasoning applies to models with similar structure as in eq. (4.1), such as extra dimensions [6,7] or certain Clockwork models [8]. The structure of the Yukawa couplings is given as follows whereŶ u,d are O(1) complex matrices and the q i , u i and d i are the Froggatt-Nielsen charges of the doublet quarks, up-quarks, and down quarks respectively, taken to be positive, and is a moderately small order parameter. For definiteness, we will consider the charge assignments [9] q = (4, 2, 0) , u = (4, 2, 0) , d = (2, 1, 1) , with ≈ 0.2. In the n = 1 2 approximation, this selects the third row of Y * u and the first row and the third row of Y * d and the first row ofỸ d determine U d R : Similarly, it selects the third column of Y u and the first column ofỸ * u to determine U u L ,

JHEP07(2019)131
For U d L we have to choose the first column ofỸ d , and either the second or third column of Y d One sees that one can directly read off the eigenvectors from the Yukawa matrices and its inverses. For the determination of the third column of U d L , it is instructive to compare with the n = 1 approximation, which is always given by the third column of Y d Y d † , or which is essentially a weighted average of the two n = 1 2 cases, plus an -suppressed admixture of the first column (which by itself is already numerically suppressed compared to the second and third). The results here coincide with the ones that one would obtain when making a careful (but rather lengthy) expansion in terms of (see for instance ref. [9]). However, no calculation is ever necessary to obtain them, one simply reads them off from our standard rules. Notice that U u,d L and U u R are almost diagonal while U d R is almost blockdiagonal. This implies that the four error matrices V u,d L,R are even more diagonal than the conservative upper bound in eq. (3.12).

Textures from spontaneously broken SU(2) symmetry
As a second example, we chose the particular texture which has been explored originally in [10,11] (see ref. [5] for a variant taking into account more recent measurements of the CKM angles). We will implement this texture in the following completely general parametrization: which gives the inverse (4.10) Using redefinitions of the fermion fields, we have removed all the phases except one, chosen to be arg β. We stress that this parametrization is exact and no approximations have been made so far. It depends on five real parameters, η, ρ α, |β|, and arg β. Notice that the determinant constraint det Y = y 1 y 2 y 3 is already implemented, but the constraints from the traces

JHEP07(2019)131
will lead to two more relations between the five parameters that we will work out below. 3 However, one can already obtain various useful inequalities. First notice that the traces of Y Y † and its inverse imply |Y ij | ≤ y 3 and |(Y −1 ) ij | ≤ y −1 1 , in particular one has from which one can for instance see that |Y 21 | 2 , |Y 12 | 2 , |(Y −1 ) 21 | 2 and |(Y −1 ) 12 | 2 contribute only very little to the traces in eq. (4.11). The parameter η interpolates between various qualitatively different regimes. We will be focusing on the lower end of the interval eq. (4.12), more precisely which provides the most interesting phenomenological models. Under this assumption one finds immediately that eqs. (4.11) reduce to |β| = 1 , (4.16) Besides arg β this leaves as the only free parameters η (constrained by eq. (4.15)) and ξ or ρ (unconstrained). Let us now consider the matrix U L . In all expressions below we leave the implementation of eq. (4.16) and (4.17) implicit, but in order to get a better feeling for the behavior of the results we show in figure 2 a plot of the relevant functions α, and αρ ±1 as a function of ξ. Starting with the eigenvector to y 1 , which is always given by the first column ofỸ * for the regime in eq. (4.15), one finds Note that |a| = η −1 y 1 y 2 and |b| ≤ η 1 − η −4 y 1 y 2 (saturated at ρ = 0). Moving on to the eigenvector to y 3 , note that the first column of Y can never be the longest, whereas the third one is the longest when |Y 33 | > |Y 23 | or αρη 2 ≤ y 3 y 2 . In this case (j = 3) one reads off b = 0 , c = α ρ η 2 y 2 y 3 . There appears an upper bound for c given by |c| ≤ η 4 − 1, saturated at ρ = 0. Finally, when |Y 23 | > |Y 33 | or αρη 2 ≥ y 3 y 2 , the longest column of Y is the second one. The criterion can only be satisfied for η ≥ 2 1 4 , which in turn means that j = 3 is guaranteed when this condition is not met. For j = 2, the b and c parameters read b = η αρ Notice that b is bounded by |b| ≤ η 3 √ y 1 y 2 y 3 , which is small but still enhanced compared to the error of the approximation.
We see that as in the Froggatt Nielsen case, some of the rotation angles are suppressed. The global bounds (marginalized over ρ) are which only depend on η. We notice that c can only be suppressed if η is close to one, which in particular implies j = 3. We find it interesting that such strong statements as the ones in eq. (4.21) can easily be obtained within our formulation. The matrix U R can be obtained by the interchange of ρ ↔ ρ −1 in the above discussion.
To conclude, we stress again that the parametrization chosen here only depends on three free parameters ρ, η, arg β, all the while being completely general apart from the mild assumption eq. (4.15). This has to be contrasted with explicit models, where the Yukawa couplings are typically parametrized in terms of many more parameters, leading to plenty of flat directions when performing fits to the masses and mixings. We therefore hope that our parametrization together with the approximation scheme developed in this paper greatly simplifies the task of finding phenomenologically viable parameters for models with certain textures.

Clockwork model
As a third example we will consider a simple Clockwork [12] model similar to the ones of refs. [13,14]. This is an example of a model that does not feature any obvious small JHEP07(2019)131 expansion parameter, nor do we expect the rotation angles to be small. This class of models thus nicely illustrates how neither of the two properties are required for our approximation to work. The Yukawa couplings are generated from the following Clockwork Lagrangian: The last line has a U(3) flavor symmetry that is broken by the matrices M and K. Integrating out the Clockwork fields one finds the effective Lagrangian where For K and M random order one matrices, the eigenvalues of the Hermitian matrices Z x are always greater than one and strongly hierarchical for large N x [13]. The physical Yukawa couplings can then be obtained by canonical normalization The hierarchical structure of the CKM angles is guaranteed by the common hierarchical factor Z − 1 2 q . We have simulated the Yukawa couplings of this model, using random complex matrices (with flat priors) for M and K. We focus on one Yukawa, say Y u with N u = N q = 5 for definiteness. We have calculated the matrices U L and U R , using our approximation with n = 1 2 , as well as the error matrices V L and V R . The distributions for the |δ ij − |V ij | 2 |, normalized to their respective bounds from eq. (3.12), are shown in figure 3. 4 These ratios are expected to be smaller than one for our bounds to be correct. Indeed, no points in our simulation violate the bounds, even though they can come arbitrarily close. The median of the distribution is approximately equal to 0.15. We have checked that the displayed distribution does not depend significantly neither on the order of the approximation nor on the size of the generated hierarchies. In conclusion, this example illustrates that, barring further information on the structure of the Yukawa couplings, the global error bounds for our approximation are optimal.  Figure 3. Distribution of the quantities |δ ij − |V ij | 2 | normalized to their respective bounds.

Conclusions
Finally let us summarize some of the features of the approximation developed here.
• It is universal, i.e., it does not make any assumptions about the underlying matrix Y .
• Rather than an expansion scheme (with typically unknown radius of convergence) in which one would need to compute higher and higher terms that need to be summed in order to achieve a desired accuracy, one directly obtains the result up to the desired accuracy in terms of the matrix elements of Y .
• We have derived a global upper bound for the error matrix V . Thus, there are no hidden cases where one looses control over the approximation. One can even obtain an approximate expression for V by plugging in the leading result, see eq. (A.21).
• In contrast to usual expansion schemes, which contain often several small parameters, no ambiguities arise as to the relative size of various expansion parameters.
• We also have derived two equivalent but nontrivially related approximate expressions for the eigenvalues that can also be taken to arbitrary precision.
• The method is well-suited for numerical fits as it is very simple and computationally inexpensive. Moreover, even though the approximation might have large errors away from the physical parameters, in their vicinity (that is, near the "χ 2 minimum") it is necessarily fully under control.

A Error analysis
In this section we analyze the error of our approximation. Let U be the matrix whose columns are the eigenvectors of A, and let a 3 and a 1 be the largest and smallest eigenvalues respectively. Furthermore, let the jth column of A n and the kth column of A −n to be the longest. For now we will assume that k = j. Furthermore, let U

JHEP07(2019)131
Since j = k, the matrix U (n) is unitary as U (n) i1 and U (n) i3 are exactly orthogonal in that case. Let us define the matrix The matrix V is unitary and converges to the identity, encoding the error of our approximation. It is easy to obtain explicitly its first and third columns, up to normalization: Note that orthogonality of these two columns is exact for j = k. In the abc representation V can be given by K(∆a, ∆b, ∆c) with These expressions are exact, but depend on the unknown matrix U . Owing to the longestcolumn criteria and the unitarity of the matrix U the prefactors can be bounded as follows.
Let j maximize the column of A n and let = j. Define ξ to be the ratios of the lengths squared of the shorter columns to the longest, ξ ≡ (A 2n ) /(A 2n ) jj ≤ 1, or We want to find a lower bound for |U j3 | as this quantity appears in the denominators of eq. (A.5). Maximizing the l.h.s. and minimizing the r.h.s. for fixed U i3 gives (which by the way implies that ξ ≥ ( a 1 a 3 ) 2n ). We now use unitarity of the third column U i3 to find where ξ ≡ ξ + ξ , which is bounded by 2( a 1 a 3 ) 2n ≤ ξ ≤ 2. Finally use unitarity of the jth row to get 5 |U The bound is the weakest at ξ = 2 (when all three columns have equal lengths): Similar reasonings apply to the matrix A −n , leading to Valid only for a 2n 3 − ξa 2n 2 + a 2n 1 > 0. We simply define X ξ to be infinite otherwise.

JHEP07(2019)131
where ζ is the analogous parameter for the inverse matrix, satisfying also 2( a 1 a 3 ) 2n ≤ ζ ≤ 2. Again one has the global, ζ-independent bound We can use these results to put upper bounds on the abc parameters of V : n (A.14) , .
(A.15) These bounds are exact and only depend on the ratios of eigenvalues. Moreover, for large hierarchies or large n we can very well approximate X ≈ 2, Z ≈ 2, which are precisely the bounds one would obtain if it were possible to choose j to maximize |U j3 | directly. On the other hand, one can obtain stronger bounds X ξ < X and Z ζ < Z if one takes the information on the length ratios into account.
It is now straightforward to put bounds on the matrix V : where the first row is correct for any unitary matrix K(∆a, ∆b, ∆c). These bounds are exact. They are optimized for small values of the ratios (a i /a j ) n , where X ≈ Z ≈ 2. As V is unitary, the bounds become trivially satisfied when any of the entries on the r.h.s. of eq. (A.16) become greater than one. This roughly occurs when ( a 2 a 3 ) 2n > 1 4 or ( a 1 a 2 ) 2n > 1 4 . When it happens that j = k, one no longer has that U (n) i1 and U (n) i3 are exactly orthogonal. In practice, one can simply ignore this small deviation from unitarity (which can be estimated as U * (n) i3 U (n) i1 ≤ 3( a 1 a 3 ) n ) but the error estimates are more complicated as V is no longer unitary. Alternatively one can enforce unitarity by computingb = b − ac instead of extracting it from U (n) i1 , however, this can introduce large errors in sufficiently pathological cases.
For the purpose of deriving robust upper bounds for the error, we follow a simpler approach and instead enforce k = j (and hence exact unitarity of U (n) and V ) by taking JHEP07(2019)131 the second longest column of A −n . 6 In this case one obtains a slightly weaker bound as follows. As U j3 ≥ 1 3 , one has U j1 ≤ 2 3 and hence for the second largest entry one still has a lower bound, |U k1 | ≥ 1 6 . Then, unitarity of the kth row implies that |U k2 | ≤ 5 6 while unitarity of the third column implies |U k3 | ≤ 2 3 . As a consequence, one has now that |∆a| ≤ √ 5 a 1 a 2 n , |∆b| ≤ 2 a 1 a 3 n , (A.17) while eq. (A.14) still remains valid. In summary, the errors are now bounded by It is clear that one could also work with the case of the longest column of A −n and the second longest column of A n , but we will not spell out this case in detail. For n = 1 2 , one replaces eq. (A.3) by The bounds one obtains are then given by setting a i = y 2 i and n = 1 2 (or a n i → y i ) in the previous expressions.
It should be noted that the error matrix V can itself be computed approximatively by replacing in eqs. (A.4) and (A.5) the nth order result for U . This can be useful as sometimes the quantities ∆a, ∆b, ∆c are more suppressed than the conservative upper bounds presented here, leading to much more accurate results. Calling this matrix V (n) , it is given explicitly by where, in addition to replacing U by U (n) we have expanded in the hierarchies to leading order. Notice for the case of half-integer n, V L depends on U R and vice versa.