Tenney–Euclidean tuning: Difference between revisions
More cleanup. Link to POTE page for practical examples |
Improve readability. Note: remove bold of vectors in body text cuz I don't find it easy to read |
||
| Line 1: | Line 1: | ||
__FORCETOC__ | __FORCETOC__ | ||
Tenney-Euclidean tuning is a variant of [[TOP tuning]] which employs the [[Tenney-Euclidean_metrics|TE norm]]. Just as the TOP tuning minimizes the maximum Tenney-weighted (L1) error of any interval, the TE tuning minimizes the maximum TE-weighted error of any interval. | '''Tenney-Euclidean tuning''' (or '''TE tuning''') is a variant of [[TOP tuning]] which employs the [[Tenney-Euclidean_metrics|TE norm]]. Just as the TOP tuning minimizes the maximum Tenney-weighted (L1) error of any interval, the TE tuning minimizes the maximum TE-weighted (L2) error of any interval. | ||
== Introduction == | == Introduction == | ||
| Line 11: | Line 11: | ||
If we put the weighted Euclidean metric on tuning space, leading to TE tuning space in weighted coordinates, it is easy to find the nearest point in the subspace to the JI point {{val|1 1 … 1}}, and this closest point will define a tuning map which is called TE tuning (or TOP-RMS), a tuning which has been extensively studied by [[Graham Breed]]. We may also keep unweighted coordinates and use the TE norm on tuning space; in these coordinates the JI point is {{val|1 log<sub>2</sub>3 … log<sub>2</sub>''p''}}. The two approaches are equivalent. | If we put the weighted Euclidean metric on tuning space, leading to TE tuning space in weighted coordinates, it is easy to find the nearest point in the subspace to the JI point {{val|1 1 … 1}}, and this closest point will define a tuning map which is called TE tuning (or TOP-RMS), a tuning which has been extensively studied by [[Graham Breed]]. We may also keep unweighted coordinates and use the TE norm on tuning space; in these coordinates the JI point is {{val|1 log<sub>2</sub>3 … log<sub>2</sub>''p''}}. The two approaches are equivalent. | ||
In more pragmatic terms, suppose M is the known mapping of the [[Regular temperament|abstract temperament]] | In more pragmatic terms, suppose M is the known mapping of the [[Regular temperament|abstract temperament]] whose rows are (not necessarily independent) vals, and W the weighting matrix. In this case, W<sub>''ij''</sub> = 1/log<sub>2</sub>''p'' if ''i'' = ''j'', and 0 otherwise. Then V = MW is the mapping in the weighted basis. Let's also denote the row vector of TE generators g, the row vector of targeted JI intervals p. TE tuning then defines a [[wikipedia:Least_squares|least square]] problem of the following overdetermined linear equation system: | ||
<math>\vec{g}V = J</math> | <math>\vec{g}V = J</math> | ||
where | where J = pW, i.e. the JI point, in the case of TE weighting it is {{val|1 1 … 1}}. The system simply says that the sum of V<sub>''ij''</sub> steps of generator g<sub>''i''</sub> for all ''i'' should equal the ''j''-th targeted JI interval J<sub>''j''</sub>. | ||
The system simply says that the sum of V<sub>''ij''</sub> steps of generator | |||
There are a number of methods to solve least square problems. One common way is to use the [[wikipedia:Moore%E2%80%93Penrose_pseudoinverse|Moore–Penrose pseudoinverse]]. | There are a number of methods to solve least square problems. One common way is to use the [[wikipedia:Moore%E2%80%93Penrose_pseudoinverse|Moore–Penrose pseudoinverse]]. | ||
| Line 33: | Line 31: | ||
* If the rows of A are linearly independent, then A<sup>+</sup> = A<sup>T</sup>(AA<sup>T</sup>)<sup>-1</sup>. This means the pseudoinverse can be found in this important special case by people who don't have a pseudoinverse routine available by using a matrix inverse routine. | * If the rows of A are linearly independent, then A<sup>+</sup> = A<sup>T</sup>(AA<sup>T</sup>)<sup>-1</sup>. This means the pseudoinverse can be found in this important special case by people who don't have a pseudoinverse routine available by using a matrix inverse routine. | ||
* uA<sup>+</sup> is the nearest point to u in the subspace spanned by the rows of A; A<sup>+</sup>v is the nearest point to v in the space spanned by the columns of A. | * uA<sup>+</sup> is the nearest point to u in the subspace spanned by the rows of A; A<sup>+</sup>v is the nearest point to v in the space spanned by the columns of A. | ||
In the pseudoinverse method, the (not necessarily independent) TE generators which correspond to the rows of V are given by | |||
<math>\vec{g} = JV^+</math> | <math>\vec{g} = JV^+</math> | ||
Applying the weighted vals to the generators gives | |||
<math>T = \vec{g}V = JV^+V</math> | |||
where T is the TE tuning map. | |||
We may also obtain the TE tuning from a projection map. P = V<sup>+</sup>V is the orthogonal projection map onto the space spanned by the rows of V. This space corresponds to the temperament, and so does P. However, P is independent of how the temperament is defined; it does not depend on whether the vals are linearly independent, how many of them there are, or whether contorsion has been removed. The tuning map giving the tuning of each prime number is found by multiplying by the JI map: JP where J is the JI map, which is the nearest point in the subspace corresponding to the temperament to J. | We may also obtain the TE tuning from a projection map. P = V<sup>+</sup>V is the orthogonal projection map onto the space spanned by the rows of V. This space corresponds to the temperament, and so does P. However, P is independent of how the temperament is defined; it does not depend on whether the vals are linearly independent, how many of them there are, or whether contorsion has been removed. The tuning map giving the tuning of each prime number is found by multiplying by the JI map: JP where J is the JI map, which is the nearest point in the subspace corresponding to the temperament to J. | ||
| Line 45: | Line 49: | ||
''See also: [[POTE tuning]]'' | ''See also: [[POTE tuning]]'' | ||
We may call pure-octaves Tenney-Euclidean tuning the '''POTE tuning'''. | We may call pure-octaves Tenney-Euclidean tuning the '''POTE tuning'''. If T = JP = gV is the TE tuning map, then a corresponding pure-octaves map can be found by [[wikipedia:Scalar_multiplication|scalar multiplication]], T/T<sub>1</sub>, where T<sub>1</sub>, the first entry, is the tuning of 2. The justification for this is that T does not only define a point, but a line through the origin lying in the subspace defining the temperament, or in other words, a point in the linear subspace of projective space corresponding to the temperament, and hence is a projective object. Another way to say this is that T defines not only the closest point to J, but the closest direction in terms of angular measure between the line through T and the line through J. | ||
If T = JP = | |||
== The Frobenius projection map == | == The Frobenius projection map == | ||
| Line 59: | Line 61: | ||
''For practical helps, see [[POTE tuning]].'' | ''For practical helps, see [[POTE tuning]].'' | ||
The val for 5-limit 12et is {{val|12 19 28}}. In weighted coordinates, that becomes | The val for 5-limit 12et is {{val|12 19 28}}. In weighted coordinates, that becomes v<sub>12</sub> = {{val|12 19/log<sub>2</sub>3 28/log<sub>2</sub>5}} ~ {{val|12.0 11.988 12.059}}. If we take this to be a 1×3 matrix and take the pseudoinverse, we get the 3×1 matrix v<sub>12</sub><sup>+</sup> ~ [{{monzo|0.027706 0.027677 0.027842}}]. Then P = v<sub>12</sub><sup>+</sup>v<sub>12</sub> is a projection map onto the one-dimensional subspace whose single basis vector is v<sub>12</sub>. We find that v<sub>12</sub>P equals v<sub>12</sub>; on the other hand, if we take the monzo for 81/80, which is {{monzo|-4 4 -1}}; and monzo-weight it to {{monzo|-4 4log<sub>2</sub>3 -log<sub>2</sub>5}} and multiply (either side, the matrix is symmetric) by P, we get the zero vector, corresponding to the unison. | ||
Now consider [[Diaschismic_family #Pajara|pajara]], the 7-limit temperament tempering out both 50/49 and 64/63. Two possible equal temperament tunings for pajara are [[12edo]] and [[22edo]]. We may define a | Now consider [[Diaschismic_family #Pajara|pajara]], the 7-limit temperament tempering out both 50/49 and 64/63. Two possible equal temperament tunings for pajara are [[12edo]] and [[22edo]]. We may define a 2×4 matrix with rows equal to the vals for 12, and 22; in weighted coordinates this would be | ||
V ~ [{{val|12 11.988 12.059 12.111}}, {{val|22 22.083 21.965 22.085}}] | V ~ [{{val|12 11.988 12.059 12.111}}, {{val|22 22.083 21.965 22.085}}] | ||
| Line 77: | Line 79: | ||
which we may also write as [{{monzo|-1.81029 -6.68250 4.83496 3.67652}}, {{monzo|1.00052 3.66285 -2.63063 -1.99757}}] | which we may also write as [{{monzo|-1.81029 -6.68250 4.83496 3.67652}}, {{monzo|1.00052 3.66285 -2.63063 -1.99757}}] | ||
Paj = V<sup>+</sup>V is a | Paj = V<sup>+</sup>V is a 4×4 symmetrical matrix which projects weighted vals in TE tuning space, or weighted monzos in TE interval space, to a subspace defined by pajara. It therefore projects the weighted monzos for 50/49, 64/63, 225/224, 2048/2025 etc. to the zero vector, whereas it leaves pajara vals such as [[10edo]] in weighted coordinates unchanged. | ||
If we use unweighted coordinates we get the Frobenius projection map instead, whose rows are [[fractional monzos]]. The unweighted pseudoinverse | If we use unweighted coordinates we get the Frobenius projection map instead, whose rows are [[fractional monzos]]. The unweighted pseudoinverse u<sub>12</sub><sup>+</sup> of the 5-limit val u<sub>12</sub> for 12 equal is the column matrix u<sub>12</sub><sup>T</sup>/1289; that is, the 1×3 matrix with column {{monzo|12/1289 19/1289 28/1289}}. Then u<sub>12</sub><sup>+</sup>u<sub>12</sub> is the 3×3 Frobenius projection map F: | ||
[{{val|144 228 336}}, {{val|228 361 532}}, {{val|336 532 784}}]/1289 | [{{val|144 228 336}}, {{val|228 361 532}}, {{val|336 532 784}}]/1289 | ||