Wedgie/Archived version: Difference between revisions

Inthar (talk | contribs)
mNo edit summary
m Internalize wikipedia links
Line 1: Line 1:
__FORCETOC__
The '''wedgie''' is a way of defining and working with an [[abstract regular temperament]] (that is, a regular temperament where no tuning has been decided on). Wedgies are in a one-to-one relationship with abstract regular temperaments.  
The '''wedgie''' is a way of defining and working with an [[abstract regular temperament]] (that is, a regular temperament where no tuning has been decided on). Wedgies are in a one-to-one relationship with abstract regular temperaments.  


Line 23: Line 22:


More generally, if one takes ''r'' independent [[vals]] ''V''<sub>1</sub>, ..., ''V''<sub>''r''</sub> in a rank-''n'' [[JI subgroup]] ''q''<sub>1</sub>.[...].''q''<sub>''n''</sub>, then the wedgie for the rank-''r'' temperament ''V''<sub>1</sub>& ...&''V''<sub>''r''</sub> is defined by:
More generally, if one takes ''r'' independent [[vals]] ''V''<sub>1</sub>, ..., ''V''<sub>''r''</sub> in a rank-''n'' [[JI subgroup]] ''q''<sub>1</sub>.[...].''q''<sub>''n''</sub>, then the wedgie for the rank-''r'' temperament ''V''<sub>1</sub>& ...&''V''<sub>''r''</sub> is defined by:
# Take the [https://en.wikipedia.org/wiki/Wedge_product wedge product] of the vals, producing an ''r''-'''multival'''.
# Take the [[Wikipedia: Wedge product|wedge product]] of the vals, producing an ''r''-'''multival'''.
# Divide out the greatest common divisior of the entries.
# Divide out the greatest common divisior of the entries.
# If the first non-zero entry of the result of step 2 is negative, every entry of the multival is multiplied by &minus;1, changing the sign of the first non-zero entry to be positive.  
# If the first non-zero entry of the result of step 2 is negative, every entry of the multival is multiplied by &minus;1, changing the sign of the first non-zero entry to be positive.  
Line 44: Line 43:
To find the '''period''': Let d = gcd(W(2, q_1), ..., W(2, q_n)). Then your period is 1\d.
To find the '''period''': Let d = gcd(W(2, q_1), ..., W(2, q_n)). Then your period is 1\d.


To find (a JI interpretation of) the '''generator''': Use the [https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm extended Euclidean algorithm] to find a JI ratio g = q_1^a_1 ... q_n^a_n (equivalently, a linear combination g = a_1 q_1 + ... + a_n q_n) such that W(2, g) = a_1 W(2, q_1) + ... a_n W(2,q_n) = d.
To find (a JI interpretation of) the '''generator''': Use the [[Wikipedia: Extended Euclidean algorithm|extended Euclidean algorithm]] to find a JI ratio g = q_1^a_1 ... q_n^a_n (equivalently, a linear combination g = a_1 q_1 + ... + a_n q_n) such that W(2, g) = a_1 W(2, q_1) + ... a_n W(2,q_n) = d.


Now choosing an optimal tuning for the temperament is a matter of choosing a way to measure error from JI and minimizing the error with linear algebra (read: a program such as the x31eq temperament finder). For example, the [[TE tuning|TE]] and [[POTE tuning|POTE]] tunings are based on minimizing [[TE error]].
Now choosing an optimal tuning for the temperament is a matter of choosing a way to measure error from JI and minimizing the error with linear algebra (read: a program such as the x31eq temperament finder). For example, the [[TE tuning|TE]] and [[POTE tuning|POTE]] tunings are based on minimizing [[TE error]].
Line 72: Line 71:


== Technical introduction ==
== Technical introduction ==
An alternating [http://en.wikipedia.org/wiki/Multilinear_map multilinear map] which is a multilinear function taking a certain number n of [[monzos]] as arguments and returning an integer as a value we may call an '''n-map'''. This definition is quite a mouthful, and we will attempt to unpack it in more comprehensible language and explain why these things are valuable in tuning theory.
An alternating [[Wikipedia: Multilinear map|multilinear map]] which is a multilinear function taking a certain number n of [[monzos]] as arguments and returning an integer as a value we may call an '''n-map'''. This definition is quite a mouthful, and we will attempt to unpack it in more comprehensible language and explain why these things are valuable in tuning theory.


The simplest kind of n-map is the 1-map, or [[val]]. This takes p-limit rational numbers, which may be written as monzos, and returns an integer, and may be called both a [http://en.wikipedia.org/wiki/Group_homomorphism group homomorphism] and a [http://mathworld.wolfram.com/ModuleHomomorphism.html module homomorphism]. Vals are [http://en.wikipedia.org/wiki/Linear_map linear]: if you take the product of two p-limit rationals (or equivalently, add the corresponding monzos) then the val applied to the product/sum is the sum of the val applied to each separately, and so forth. Next come the 2-maps. These are linear functions f(u,v), linear for u fixing v, and linear for v fixing u, and alternating. meaning that f(u,u)=0 and f(u,v)=-f(v,u).
The simplest kind of n-map is the 1-map, or [[val]]. This takes p-limit rational numbers, which may be written as monzos, and returns an integer, and may be called both a [[Wikipedia: Group homomorphism|group homomorphism]] and a [http://mathworld.wolfram.com/ModuleHomomorphism.html module homomorphism]. Vals are [[Wikipedia: Linear map|linear]]: if you take the product of two p-limit rationals (or equivalently, add the corresponding monzos) then the val applied to the product/sum is the sum of the val applied to each separately, and so forth. Next come the 2-maps. These are linear functions f(u,v), linear for u fixing v, and linear for v fixing u, and alternating. meaning that f(u,u)=0 and f(u,v)=-f(v,u).


One use for such things is as "machines" for measuring complexity. If we consider the 1-map which is the val for 11-limit 31et, we find we have &lt;31 49 72 87 107|. This tells us that it takes 72 steps of 31 equal to get to the approximate 5, which therefore has a complexity of 72 in this system. Now consider a 2-map "meantone(u,v)" which tells us, roughly speaking, how many generator steps it takes to get to v assuming u is being used as a period in septimal meantone. Using 2 as a period we can take (the approximate) 3/2 as a generator, in which case we have meantone(2,3)=1, meantone(2,5)=4, meantone(2,7)=10. With 3 as a period and 3/2 as a generator, we get meantone(3,5)=4 and meantone(3,7)=13. Finally, with if we take 5 as a period we find that four 3/2s give 5, so 5^(1/4) or equivalently 3/2 is the basic period. Using 3/2 as a period and 9/8 as a generator we get three generator steps to 7, and multiplying by four to be using 5 and not 5^(1/4) gives us meantone(5,7)=12. This description does not make clear where the signs come from, which will emerge from the discussion of the wedge product, but it may help to elucidate how these things are connected to complexity.
One use for such things is as "machines" for measuring complexity. If we consider the 1-map which is the val for 11-limit 31et, we find we have &lt;31 49 72 87 107|. This tells us that it takes 72 steps of 31 equal to get to the approximate 5, which therefore has a complexity of 72 in this system. Now consider a 2-map "meantone(u,v)" which tells us, roughly speaking, how many generator steps it takes to get to v assuming u is being used as a period in septimal meantone. Using 2 as a period we can take (the approximate) 3/2 as a generator, in which case we have meantone(2,3)=1, meantone(2,5)=4, meantone(2,7)=10. With 3 as a period and 3/2 as a generator, we get meantone(3,5)=4 and meantone(3,7)=13. Finally, with if we take 5 as a period we find that four 3/2s give 5, so 5^(1/4) or equivalently 3/2 is the basic period. Using 3/2 as a period and 9/8 as a generator we get three generator steps to 7, and multiplying by four to be using 5 and not 5^(1/4) gives us meantone(5,7)=12. This description does not make clear where the signs come from, which will emerge from the discussion of the wedge product, but it may help to elucidate how these things are connected to complexity.


Given an n-map f and an m-map g we may define a new (n+m)-map, the [http://en.wikipedia.org/wiki/Exterior_algebra wedge product] of f and g, written f∧g, as follows:
Given an n-map f and an m-map g we may define a new (n+m)-map, the [[Wikipedia: Exterior algebra|wedge product]] of f and g, written f∧g, as follows:


<math>\displaystyle f\wedge g = \sum_s sgn(s)f(x_s(1),x_s(2),...,x_s(n))g(x_s(n+1),...,x_s(n+m))</math>
<math>\displaystyle f\wedge g = \sum_s sgn(s)f(x_s(1),x_s(2),...,x_s(n))g(x_s(n+1),...,x_s(n+m))</math>


where the sum is taken over S(n,m), the set of all [http://en.wikipedia.org/wiki/Permutation permutations] of the first n+m integers which are an [http://en.wikipedia.org/wiki/%28p,q%29_shuffle (n,m) shuffles], and sgn(t) is the [http://en.wikipedia.org/wiki/Parity_of_a_permutation parity of the permutation] t, which is +1 if t is even meaning an even number of transpositions of two numbers will get to t, and -1 if t is odd.
where the sum is taken over S(n,m), the set of all [[Wikipedia:Permutation|permutations]] of the first n+m integers which are an [[Wikipedia:(p,q)_shuffle|(n,m) shuffles]], and sgn(t) is the [[Wikipedia: Parity of a permutation|parity of the permutation]] t, which is +1 if t is even meaning an even number of transpositions of two numbers will get to t, and -1 if t is odd.


If f and g are both vals (1-maps) then this becomes especially easy: f∧g(u,v) = f(u)g(v) - f(v)g(u). Let's consider a specific example. Suppose E19 = {{val| 19 30 44 53 }} is the equal temperament val for septimal 19et, and E31 = {{val| 31 49 72 87 }} is the val for septimal 31et. Then writing intervals multiplicatively, we have
If f and g are both vals (1-maps) then this becomes especially easy: f∧g(u,v) = f(u)g(v) - f(v)g(u). Let's consider a specific example. Suppose E19 = {{val| 19 30 44 53 }} is the equal temperament val for septimal 19et, and E31 = {{val| 31 49 72 87 }} is the val for septimal 31et. Then writing intervals multiplicatively, we have
Line 90: Line 89:
We may continue in this way to consider (2,5), (2,7), (3,5), (3,7) and (5,7), and writing them in this alphabetical order yields &lt;&lt;1 4 10 4 13 12||. Here the double angle braces are to indicate that the object is a 2-map. In fact, it is a special kind of 2-map in that it is the result of taking a wedge product rather than being, eg, the sum of two wedge products and is called a '''bival'''. In the same way, triple wedge products yield trivals which we depict with three angle braces, and so forth. Just as vals as associatd to rank one (equal) temperaments, bivals are associated to [[rank_two_temperament|rank two temperament]]s such as [[meantone]], trivals to [[rank_three_temperament|rank three temperament]]s, and so forth. In tuning theory the necessity to look at any n-maps aside from vals, bivals and trivals seldom arises, so this notation, which is not standardly mathematical but which has been adopted for convenience by tuning theorists, is quite practical. As we can see by comparing the numbers, E19∧E31 is the same object we were calling "meantone(u,v)" which gives us complexity measurements for meantone.
We may continue in this way to consider (2,5), (2,7), (3,5), (3,7) and (5,7), and writing them in this alphabetical order yields &lt;&lt;1 4 10 4 13 12||. Here the double angle braces are to indicate that the object is a 2-map. In fact, it is a special kind of 2-map in that it is the result of taking a wedge product rather than being, eg, the sum of two wedge products and is called a '''bival'''. In the same way, triple wedge products yield trivals which we depict with three angle braces, and so forth. Just as vals as associatd to rank one (equal) temperaments, bivals are associated to [[rank_two_temperament|rank two temperament]]s such as [[meantone]], trivals to [[rank_three_temperament|rank three temperament]]s, and so forth. In tuning theory the necessity to look at any n-maps aside from vals, bivals and trivals seldom arises, so this notation, which is not standardly mathematical but which has been adopted for convenience by tuning theorists, is quite practical. As we can see by comparing the numbers, E19∧E31 is the same object we were calling "meantone(u,v)" which gives us complexity measurements for meantone.


This particular bival has the properties that the first nonzero coordinate (1, in this case) is positive, and that the [http://en.wikipedia.org/wiki/Greatest_common_divisor GCD] of all of the coordinates is 1. An n-map with these properties we may call ''reduced'', and reduced n-vals can be used to give unique names to [[regular temperament]]s.
This particular bival has the properties that the first nonzero coordinate (1, in this case) is positive, and that the [[Wikipedia: Greatest common divisor|GCD]] of all of the coordinates is 1. An n-map with these properties we may call ''reduced'', and reduced n-vals can be used to give unique names to [[regular temperament]]s.


These reduced n-vals, and particularly reduced bivals, are called ''wedgies'', and the fact that they are reduced both makes the name unique and tells us that wedgies are [http://en.wikipedia.org/wiki/Projective_space projective], and hence the definition of regular temperaments in terms of them is projective. Thus, E24 = &lt;24 38 56| is a perfectly valid val, but since it is not reduced, it does not define a 1-wedgie and hence there is no 5-limit 24et temperament to go with it. Sometimes such a temperament, where more than one set of notes exists in it each of which is unreachable from the others via intervals with defined prime mappings is called ''contorted''. Wedgies do not name or signify contorted temperaments.
These reduced n-vals, and particularly reduced bivals, are called ''wedgies'', and the fact that they are reduced both makes the name unique and tells us that wedgies are [[Wikipedia: Projective space|projective]], and hence the definition of regular temperaments in terms of them is projective. Thus, E24 = &lt;24 38 56| is a perfectly valid val, but since it is not reduced, it does not define a 1-wedgie and hence there is no 5-limit 24et temperament to go with it. Sometimes such a temperament, where more than one set of notes exists in it each of which is unreachable from the others via intervals with defined prime mappings is called ''contorted''. Wedgies do not name or signify contorted temperaments.


== Truncation of wedgies ==
== Truncation of wedgies ==
Line 100: Line 99:
If we take any three integers &lt;&lt;a b c|| such that GCD(a, b, c) = 1 and a ≥ 1 the result is always a wedgie, the wedgie tempering out the [[The_dual|dual]] [[monzos|monzo]] |c -b a&gt;. Since three such integers chosen at random are unlikely to produce a suitably small comma, the temperament will probably not be worth much, but at least it can be defined.  
If we take any three integers &lt;&lt;a b c|| such that GCD(a, b, c) = 1 and a ≥ 1 the result is always a wedgie, the wedgie tempering out the [[The_dual|dual]] [[monzos|monzo]] |c -b a&gt;. Since three such integers chosen at random are unlikely to produce a suitably small comma, the temperament will probably not be worth much, but at least it can be defined.  


However, this is no longer the case in higher limits. There, not everything which looks like a wedgie will be one; for instance the wedgies must also satisfy the condition, for any wedgie W, that W∧W = 0, where the "0" means the multival of rank 2r obtained by wedging W with W. For prime limits 7 and 11 this condition suffices for rank two, but in general we need to check, for every prime q ≤ p and every basis val v sending q to 1 and everything else to 0, that (W∨q)∧W and (W∧v)º∧Wº = 0, where "∨" denotes the [[Interior_product|interior product]]. These conditions, the complete set along with the basic reduction conditions for being a wedgie, are known as the [http://en.wikipedia.org/wiki/Pl%C3%BCcker_embedding Plücker relations]. Note that the Plücker relations must be satisfied, since for a rank r multival, W∨q is a rank r-1 multival corresponding to tempering out all the commas of W, as well as q.
However, this is no longer the case in higher limits. There, not everything which looks like a wedgie will be one; for instance the wedgies must also satisfy the condition, for any wedgie W, that W∧W = 0, where the "0" means the multival of rank 2r obtained by wedging W with W. For prime limits 7 and 11 this condition suffices for rank two, but in general we need to check, for every prime q ≤ p and every basis val v sending q to 1 and everything else to 0, that (W∨q)∧W and (W∧v)º∧Wº = 0, where "∨" denotes the [[Interior_product|interior product]]. These conditions, the complete set along with the basic reduction conditions for being a wedgie, are known as the [[Wikipedia: Plücker embedding|Plücker relations]]. Note that the Plücker relations must be satisfied, since for a rank r multival, W∨q is a rank r-1 multival corresponding to tempering out all the commas of W, as well as q.


In the 7-limit case, if we wedge a prospective rank two multival W = &lt;&lt;a b c d e f|| with itself, we obtain W∧W = 2(af-be+cd). The quantity af-be+cd is the [http://en.wikipedia.org/wiki/Pfaffian Pfaffian] of the wedgie, and that the Pfaffian is zero tells us that in the five-dimensional projective space '''P⁵''' in which wedgies live, the wedgie lies on a (four-dimensional) [http://en.wikipedia.org/wiki/Hypersurface hypersurface], known as the [[Abstract_regular_temperament#The Geometry of Regular Temperaments|Grassmannian]] '''Gr'''(2, 4). For an 11-limit rank-two wedgie W = &lt;&lt;w1 w2 w3 w4 w5 w6 w7 w8 w9 w10|| we have that W∧W = 2&lt;&lt;&lt;&lt;w1w8-w2w6+w3w5, w1w9-w2w7+w4w5, w1w10-w3w7+w4w6, w2w10-w3w9+w4w8, w5w10-w6w9+w7w8|||| is zero. These conditions allow us to solve for three of the coefficients in terms of the other seven, and so that '''Gr'''(2, 5), the Grassmannian of rank-two 11-limit temperaments, is a six-dimensional projective [http://en.wikipedia.org/wiki/Algebraic_variety algebraic variety] in nine-dimensional projective space '''P⁹'''. Wedgies correspond to rational points on this variety. For 11-limit rank three temperaments, we have w6w1-w5w2+w4w3 = w9w1-w8w2+w7w3 = w10w1-w8w4+w7w5 = w10w2-w9w4+w7w6 = w10w3-w9w5+w8w6 = 0; again, this leads to a six-dimensional variety, this time '''Gr'''(3, 5).  
In the 7-limit case, if we wedge a prospective rank two multival W = &lt;&lt;a b c d e f|| with itself, we obtain W∧W = 2(af-be+cd). The quantity af-be+cd is the [[Wikipedia: Pfaffian|Pfaffian]] of the wedgie, and that the Pfaffian is zero tells us that in the five-dimensional projective space '''P⁵''' in which wedgies live, the wedgie lies on a (four-dimensional) [[Wikipedia: Hypersurface|hypersurface]], known as the [[Abstract_regular_temperament#The Geometry of Regular Temperaments|Grassmannian]] '''Gr'''(2, 4). For an 11-limit rank-two wedgie W = &lt;&lt;w1 w2 w3 w4 w5 w6 w7 w8 w9 w10|| we have that W∧W = 2&lt;&lt;&lt;&lt;w1w8-w2w6+w3w5, w1w9-w2w7+w4w5, w1w10-w3w7+w4w6, w2w10-w3w9+w4w8, w5w10-w6w9+w7w8|||| is zero. These conditions allow us to solve for three of the coefficients in terms of the other seven, and so that '''Gr'''(2, 5), the Grassmannian of rank-two 11-limit temperaments, is a six-dimensional projective [[Wikipedia: Algebraic variety|algebraic variety]] in nine-dimensional projective space '''P⁹'''. Wedgies correspond to rational points on this variety. For 11-limit rank three temperaments, we have w6w1-w5w2+w4w3 = w9w1-w8w2+w7w3 = w10w1-w8w4+w7w5 = w10w2-w9w4+w7w6 = w10w3-w9w5+w8w6 = 0; again, this leads to a six-dimensional variety, this time '''Gr'''(3, 5).  


== Constrained wedgies ==
== Constrained wedgies ==