Tenney–Euclidean metrics: Difference between revisions
→Temperamental complexity: internalize wikipedia links |
→The weighting matrix: Change subtitle; swap the terms in accordance with other articles |
||
Line 1: | Line 1: | ||
The '''Tenney-Euclidean metrics''' are [[Wikipedia: Metric (mathematics)|metrics]] defined in Tenney-Euclidean space. These consist of the TE norm, the temperamental norm, and the octave-equivalent TE seminorm. | The '''Tenney-Euclidean metrics''' are [[Wikipedia: Metric (mathematics)|metrics]] defined in Tenney-Euclidean space. These consist of the TE norm, the temperamental norm, and the octave-equivalent TE seminorm. | ||
== | == TE norm == | ||
Let us define the val weighting matrix W to be the [[wikipedia:diagonal matrix|diagonal matrix]] with values 1, 1/log<sub>2</sub>3, 1/log<sub>2</sub>5 … 1/log<sub>2</sub>p along the diagonal. Given a val "a" expressed as a row vector, the corresponding vector in weighted coordinates is aW, with transpose Wa<sup>T</sup> where the <sup>T</sup> denotes the transpose. Then the dot product of weighted vals is aW<sup>2</sup>a<sup>T</sup>, which makes the Euclidean metric on vals, a measure of complexity, to be || {{val| a<sub>2</sub> a<sub>3</sub> … a<sub>''p''</sub>}} ||<sub>2</sub> = sqrt (a<sub>2</sub><sup>2</sup> + a<sub>3</sub><sup>2</sup>/(log<sub>2</sub>3)<sup>2</sup> + … + a<sub>p</sub><sup>2</sup>/(log<sub>2</sub>''p'')<sup>2</sup>); dividing this by sqrt (''n''), where ''n'' = π(''p'') is the number of primes to ''p'' gives the Tenney-Euclidean, or TE | Let us define the val weighting matrix W to be the [[wikipedia:diagonal matrix|diagonal matrix]] with values 1, 1/log<sub>2</sub>3, 1/log<sub>2</sub>5 … 1/log<sub>2</sub>p along the diagonal. Given a val "a" expressed as a row vector, the corresponding vector in weighted coordinates is aW, with transpose Wa<sup>T</sup> where the <sup>T</sup> denotes the transpose. Then the dot product of weighted vals is aW<sup>2</sup>a<sup>T</sup>, which makes the Euclidean metric on vals, a measure of complexity, to be || {{val| a<sub>2</sub> a<sub>3</sub> … a<sub>''p''</sub>}} ||<sub>2</sub> = sqrt (a<sub>2</sub><sup>2</sup> + a<sub>3</sub><sup>2</sup>/(log<sub>2</sub>3)<sup>2</sup> + … + a<sub>p</sub><sup>2</sup>/(log<sub>2</sub>''p'')<sup>2</sup>); dividing this by sqrt (''n''), where ''n'' = π(''p'') is the number of primes to ''p'' gives the '''Tenney-Euclidean complexity''', or '''TE complexity'''. Similarly, if b is a monzo, then in weighted coordinates the monzo becomes bW<sup>-1</sup>, and the dot product is bW<sup>-2</sup>b<sup>T</sup>, leading to sqrt (b<sub>2</sub><sup>2</sup> + (log<sub>2</sub>3)<sup>2</sup>b<sub>3</sub><sup>2</sup> + … + (log<sub>2</sub>''p'')<sup>2</sup>b<sub>''p''</sub><sup>2</sup>); multiplying this by sqrt (''n'') gives the dual RMS norm on monzos, a measure of complexity we may call the '''Tenney-Euclidean norm''', or '''TE norm'''. | ||
== Temperamental complexity == | == Temperamental complexity == |