BOP tuning: Difference between revisions
| Line 9: | Line 9: | ||
= Proof of Benedetti-Optimality On All Rationals = | = Proof of Benedetti-Optimality On All Rationals = | ||
The proof is | The proof is similar to the TOP optimality proof. | ||
First, we note that for any tuning map, call it <math>T</math>, there is an associated vector called a '''signed error map'''. This is given by <math>E = T-J</math>, where <math>J</math> is the JIP. If we assume that we are in a prime-limit, then the signed error map will contain the signed error on each prime. We assume that all errors are unweighted so far. | First, we note that for any tuning map, call it <math>T</math>, there is an associated vector called a '''signed error map'''. This is given by <math>E = T-J</math>, where <math>J</math> is the JIP. If we assume that we are in a prime-limit, then the signed error map will contain the signed error on each prime. We assume that all errors are unweighted so far. | ||