The wedgie: Difference between revisions

Wikispaces>genewardsmith
**Imported revision 290423187 - Original comment: **
Wikispaces>genewardsmith
**Imported revision 290426531 - Original comment: **
Line 1: Line 1:
<h2>IMPORTED REVISION FROM WIKISPACES</h2>
<h2>IMPORTED REVISION FROM WIKISPACES</h2>
This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br>
This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br>
: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2012-01-08 18:22:21 UTC</tt>.<br>
: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2012-01-08 18:43:11 UTC</tt>.<br>
: The original revision id was <tt>290423187</tt>.<br>
: The original revision id was <tt>290426531</tt>.<br>
: The revision comment was: <tt></tt><br>
: The revision comment was: <tt></tt><br>
The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br>
The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br>
<h4>Original Wikitext content:</h4>
<h4>Original Wikitext content:</h4>
<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;white-space: pre-wrap ! important" class="old-revision-html">
<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;white-space: pre-wrap ! important" class="old-revision-html">[[toc|flat]]
 
=Basics=
=Basics=
The //[[Wedgies and Multivals|wedgie]]// is a way of defining and working with an [[abstract regular temperament]]. If one takes r independent [[vals]] in a p-limit group of n primes, then the wedgie is defined by taking the [[Wedgies and Multivals|wedge product]] of the vals, and dividing out the greatest common divisior of the coefficients, to produce an r-multival. If the first non-zero coefficient of this multival is negative, it is then scalar multiplied by -1, changing the sign of the first non-zero coefficient to be positive. The result is the wedgie. Wedgies are in a one-to-one relationship with abstract regular temperaments; that is, regular temperaments where no tuning has been decided on.
The //[[Wedgies and Multivals|wedgie]]// is a way of defining and working with an [[abstract regular temperament]]. If one takes r independent [[vals]] in a p-limit group of n primes, then the wedgie is defined by taking the [[Wedgies and Multivals|wedge product]] of the vals, and dividing out the greatest common divisior of the coefficients, to produce an r-multival. If the first non-zero coefficient of this multival is negative, it is then scalar multiplied by -1, changing the sign of the first non-zero coefficient to be positive. The result is the wedgie. Wedgies are in a one-to-one relationship with abstract regular temperaments; that is, regular temperaments where no tuning has been decided on.
Line 31: Line 32:
If C = ||W|| is the TE complexity, then the formula for the [[Tenney-Euclidean metrics#Logflat TE badness|logflat badness]] B in the 7-limit rank-two case is particularly simple: B = CE. If complexity is bounded by, for example, 20 (which allows for some quite complex temperaments) then since E ≤ 1/(4√q5√q7), B ≤ 20/(4√q5√q7) = 240.250. This is an absurdly high badness figure; while simply bounding complexity will lead to a finite list, the list would be enormous. An alternative is also to bound badness; for instance, we might produce a list of 7-limit rank-two temperaments with complexity less than 20 and a more reasonable badness limit, such as 0.05 or 0.06.
If C = ||W|| is the TE complexity, then the formula for the [[Tenney-Euclidean metrics#Logflat TE badness|logflat badness]] B in the 7-limit rank-two case is particularly simple: B = CE. If complexity is bounded by, for example, 20 (which allows for some quite complex temperaments) then since E ≤ 1/(4√q5√q7), B ≤ 20/(4√q5√q7) = 240.250. This is an absurdly high badness figure; while simply bounding complexity will lead to a finite list, the list would be enormous. An alternative is also to bound badness; for instance, we might produce a list of 7-limit rank-two temperaments with complexity less than 20 and a more reasonable badness limit, such as 0.05 or 0.06.


=Reconstituting wedgies in general=
Essentially the same situation obtains for rank two temperaments in higher limits. The rule then is that if E ≤ 1/(C(n, 3)√lb(q)√lb(p)) then wedging K = &lt;1 lb(3) lb(5) ... lb(p)| with the val consisting of 0 followed by the first n-1 coefficients of the wedgie and rounding will give the wedgie. Here p and q are the largest and second largest primes in the prime limit, lb(x) is log base two, and C(n, 3) is n choose three, n(n-1)(n-2)/6.
Essentially the same situation obtains for rank two temperaments in higher limits. The rule then is that if E ≤ 1/(C(n, 3)√lb(q)√lb(p)) then wedging K = &lt;1 lb(3) lb(5) ... lb(p)| with the val consisting of 0 followed by the first n-1 coefficients of the wedgie and rounding will give the wedgie. Here p and q are the largest and second largest primes in the prime limit, lb(x) is log base two, and C(n, 3) is n choose three, n(n-1)(n-2)/6.


In general, we can reconstruct W by rounding Y = (W∨2)∧K to the nearest integer coefficients, where K is the JI point &lt;1 lb(3) lb(5) ... lb(p)| in unweighted coordinates. Then we have ||W|| = ||(W-Y)+Y|| ≤ ||W-Y|| + ||Y|| by the triangle inequality, and since ||W-Y|| is bounded by the fact that W has been obtained by rounding, complexity, which is ||W||, can be bounded by ||Y||; which means it can be bounded by the coefficients of Y, which are those coefficients of W which can be found in W∨2 and over which we can be conducting a search. Moreover, we have from Y∧K = ((W∨2)∧K)∧K = 0 that relative error, which is ||W∧K||, is ||((W-Y) + Y)∧K|| = ||(W-Y)∧K||, hence relative error is also bounded by the fact that ||W-Y|| is bounded.
More generally, we can reconstitute W by rounding Y = (W∨2)∧K to the nearest integer coefficients, where K is the JI point &lt;1 lb(3) lb(5) ... lb(p)| in unweighted coordinates. Then we have ||(W-Y)+Y|| ≤ ||W-Y|| + ||Y|| by the triangle inequality, and since ||W-Y|| is bounded by the fact that W has been obtained by rounding, complexity, which is ||(W-Y)+Y||=||W||, can be bounded by ||Y||; which means it can be bounded by the coefficients of Y, which are those coefficients of W which can be found in W∨2 and over which we could be conducting a search. Moreover, we have from Y∧K = ((W∨2)∧K)∧K = 0 that relative error, which is ||W∧K||, is ||((W-Y) + Y)∧K|| = ||(W-Y)∧K||, hence relative error is also bounded by the fact that ||W-Y|| is bounded. This means that unless relative error is large, W can be recovered by rounding Y, and hence all wedgies within such a bound can be found by a search on only some prospective coefficients.




</pre></div>
</pre></div>
<h4>Original HTML content:</h4>
<h4>Original HTML content:</h4>
<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;width:200%;white-space: pre-wrap ! important" class="old-revision-html">&lt;html&gt;&lt;head&gt;&lt;title&gt;The wedgie&lt;/title&gt;&lt;/head&gt;&lt;body&gt;&lt;br /&gt;
<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;width:200%;white-space: pre-wrap ! important" class="old-revision-html">&lt;html&gt;&lt;head&gt;&lt;title&gt;The wedgie&lt;/title&gt;&lt;/head&gt;&lt;body&gt;&lt;!-- ws:start:WikiTextTocRule:9:&amp;lt;img id=&amp;quot;wikitext@@toc@@flat&amp;quot; class=&amp;quot;WikiMedia WikiMediaTocFlat&amp;quot; title=&amp;quot;Table of Contents&amp;quot; src=&amp;quot;/site/embedthumbnail/toc/flat?w=100&amp;amp;h=16&amp;quot;/&amp;gt; --&gt;&lt;!-- ws:end:WikiTextTocRule:9 --&gt;&lt;!-- ws:start:WikiTextTocRule:10: --&gt;&lt;a href="#Basics"&gt;Basics&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:10 --&gt;&lt;!-- ws:start:WikiTextTocRule:11: --&gt; | &lt;a href="#Conditions on being a wedgie"&gt;Conditions on being a wedgie&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:11 --&gt;&lt;!-- ws:start:WikiTextTocRule:12: --&gt; | &lt;a href="#Constrained wedgies"&gt;Constrained wedgies&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:12 --&gt;&lt;!-- ws:start:WikiTextTocRule:13: --&gt; | &lt;a href="#Reconstituting wedgies in general"&gt;Reconstituting wedgies in general&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:13 --&gt;&lt;!-- ws:start:WikiTextTocRule:14: --&gt;
&lt;!-- ws:end:WikiTextTocRule:14 --&gt;&lt;br /&gt;
&lt;!-- ws:start:WikiTextHeadingRule:1:&amp;lt;h1&amp;gt; --&gt;&lt;h1 id="toc0"&gt;&lt;a name="Basics"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:1 --&gt;Basics&lt;/h1&gt;
&lt;!-- ws:start:WikiTextHeadingRule:1:&amp;lt;h1&amp;gt; --&gt;&lt;h1 id="toc0"&gt;&lt;a name="Basics"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:1 --&gt;Basics&lt;/h1&gt;
The &lt;em&gt;&lt;a class="wiki_link" href="/Wedgies%20and%20Multivals"&gt;wedgie&lt;/a&gt;&lt;/em&gt; is a way of defining and working with an &lt;a class="wiki_link" href="/abstract%20regular%20temperament"&gt;abstract regular temperament&lt;/a&gt;. If one takes r independent &lt;a class="wiki_link" href="/vals"&gt;vals&lt;/a&gt; in a p-limit group of n primes, then the wedgie is defined by taking the &lt;a class="wiki_link" href="/Wedgies%20and%20Multivals"&gt;wedge product&lt;/a&gt; of the vals, and dividing out the greatest common divisior of the coefficients, to produce an r-multival. If the first non-zero coefficient of this multival is negative, it is then scalar multiplied by -1, changing the sign of the first non-zero coefficient to be positive. The result is the wedgie. Wedgies are in a one-to-one relationship with abstract regular temperaments; that is, regular temperaments where no tuning has been decided on.&lt;br /&gt;
The &lt;em&gt;&lt;a class="wiki_link" href="/Wedgies%20and%20Multivals"&gt;wedgie&lt;/a&gt;&lt;/em&gt; is a way of defining and working with an &lt;a class="wiki_link" href="/abstract%20regular%20temperament"&gt;abstract regular temperament&lt;/a&gt;. If one takes r independent &lt;a class="wiki_link" href="/vals"&gt;vals&lt;/a&gt; in a p-limit group of n primes, then the wedgie is defined by taking the &lt;a class="wiki_link" href="/Wedgies%20and%20Multivals"&gt;wedge product&lt;/a&gt; of the vals, and dividing out the greatest common divisior of the coefficients, to produce an r-multival. If the first non-zero coefficient of this multival is negative, it is then scalar multiplied by -1, changing the sign of the first non-zero coefficient to be positive. The result is the wedgie. Wedgies are in a one-to-one relationship with abstract regular temperaments; that is, regular temperaments where no tuning has been decided on.&lt;br /&gt;
Line 65: Line 68:
If C = ||W|| is the TE complexity, then the formula for the &lt;a class="wiki_link" href="/Tenney-Euclidean%20metrics#Logflat TE badness"&gt;logflat badness&lt;/a&gt; B in the 7-limit rank-two case is particularly simple: B = CE. If complexity is bounded by, for example, 20 (which allows for some quite complex temperaments) then since E ≤ 1/(4√q5√q7), B ≤ 20/(4√q5√q7) = 240.250. This is an absurdly high badness figure; while simply bounding complexity will lead to a finite list, the list would be enormous. An alternative is also to bound badness; for instance, we might produce a list of 7-limit rank-two temperaments with complexity less than 20 and a more reasonable badness limit, such as 0.05 or 0.06.&lt;br /&gt;
If C = ||W|| is the TE complexity, then the formula for the &lt;a class="wiki_link" href="/Tenney-Euclidean%20metrics#Logflat TE badness"&gt;logflat badness&lt;/a&gt; B in the 7-limit rank-two case is particularly simple: B = CE. If complexity is bounded by, for example, 20 (which allows for some quite complex temperaments) then since E ≤ 1/(4√q5√q7), B ≤ 20/(4√q5√q7) = 240.250. This is an absurdly high badness figure; while simply bounding complexity will lead to a finite list, the list would be enormous. An alternative is also to bound badness; for instance, we might produce a list of 7-limit rank-two temperaments with complexity less than 20 and a more reasonable badness limit, such as 0.05 or 0.06.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;!-- ws:start:WikiTextHeadingRule:7:&amp;lt;h1&amp;gt; --&gt;&lt;h1 id="toc3"&gt;&lt;a name="Reconstituting wedgies in general"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:7 --&gt;Reconstituting wedgies in general&lt;/h1&gt;
Essentially the same situation obtains for rank two temperaments in higher limits. The rule then is that if E ≤ 1/(C(n, 3)√lb(q)√lb(p)) then wedging K = &amp;lt;1 lb(3) lb(5) ... lb(p)| with the val consisting of 0 followed by the first n-1 coefficients of the wedgie and rounding will give the wedgie. Here p and q are the largest and second largest primes in the prime limit, lb(x) is log base two, and C(n, 3) is n choose three, n(n-1)(n-2)/6.&lt;br /&gt;
Essentially the same situation obtains for rank two temperaments in higher limits. The rule then is that if E ≤ 1/(C(n, 3)√lb(q)√lb(p)) then wedging K = &amp;lt;1 lb(3) lb(5) ... lb(p)| with the val consisting of 0 followed by the first n-1 coefficients of the wedgie and rounding will give the wedgie. Here p and q are the largest and second largest primes in the prime limit, lb(x) is log base two, and C(n, 3) is n choose three, n(n-1)(n-2)/6.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In general, we can reconstruct W by rounding Y = (W∨2)∧K to the nearest integer coefficients, where K is the JI point &amp;lt;1 lb(3) lb(5) ... lb(p)| in unweighted coordinates. Then we have ||W||  &lt;!-- ws:start:WikiTextHeadingRule:7:&amp;lt;h1&amp;gt; --&gt;&lt;h1 id="toc3"&gt;&lt;a name="x||(W-Y)+Y|| ≤ ||W-Y|| + ||Y|| by the triangle inequality, and since ||W-Y|| is bounded by the fact that W has been obtained by rounding, complexity, which is ||W||, can be bounded by ||Y||; which means it can be bounded by the coefficients of Y, which are those coefficients of W which can be found in W∨2 and over which we can be conducting a search. Moreover, we have from Y∧K"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:7 --&gt; ||(W-Y)+Y|| ≤ ||W-Y|| + ||Y|| by the triangle inequality, and since ||W-Y|| is bounded by the fact that W has been obtained by rounding, complexity, which is ||W||, can be bounded by ||Y||; which means it can be bounded by the coefficients of Y, which are those coefficients of W which can be found in W∨2 and over which we can be conducting a search. Moreover, we have from Y∧K &lt;/h1&gt;
More generally, we can reconstitute W by rounding Y = (W∨2)∧K to the nearest integer coefficients, where K is the JI point &amp;lt;1 lb(3) lb(5) ... lb(p)| in unweighted coordinates. Then we have ||(W-Y)+Y|| ≤ ||W-Y|| + ||Y|| by the triangle inequality, and since ||W-Y|| is bounded by the fact that W has been obtained by rounding, complexity, which is ||(W-Y)+Y||=||W||, can be bounded by ||Y||; which means it can be bounded by the coefficients of Y, which are those coefficients of W which can be found in W∨2 and over which we could be conducting a search. Moreover, we have from Y∧K = ((W∨2)∧K)∧K = 0 that relative error, which is ||W∧K||, is ||((W-Y) + Y)∧K|| = ||(W-Y)∧K||, hence relative error is also bounded by the fact that ||W-Y|| is bounded. This means that unless relative error is large, W can be recovered by rounding Y, and hence all wedgies within such a bound can be found by a search on only some prospective coefficients.&lt;/body&gt;&lt;/html&gt;</pre></div>
((W∨2)∧K)∧K = 0 that relative error, which is ||W∧K||, is ||((W-Y) + Y)∧K|| = ||(W-Y)∧K||, hence relative error is also bounded by the fact that ||W-Y|| is bounded.&lt;/body&gt;&lt;/html&gt;</pre></div>