The wedgie: Difference between revisions

Line 1:

<h2>IMPORTED REVISION FROM WIKISPACES</h2>

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~~:43:11 UTC</tt>.<br>

: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2012-01-10 15:09:01 UTC</tt>.<br>

: The original revision id was <tt>~~290426531~~</tt>.<br>

: The original revision id was <tt>291073755</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>

Line 35:

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 = <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.

More generally, we can reconstitute W by rounding Y = (W∨2)∧K to the nearest integer coefficients, where K is the JI point <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.

More generally, we can reconstitute W by rounding Y = (W∨2)∧K to the nearest integer coefficients, where K is the JI point <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. If the maximum allowed complexity is M, then we may find the extrema in each of the parameters of Y separately of ||Y||^2 = M^2, which defines a quadric, so that finding the extrema is easy. We then round these bounds up in absolute value to an integer, and we have our bounds.

</pre></div>

<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"><html><head><title>The wedgie</title></head><body><a href="#Basics">Basics</a> | <a href="#Conditions on being a wedgie">Conditions on being a wedgie</a> | <a href="#Constrained wedgies">Constrained wedgies</a> | <a href="#Reconstituting wedgies in general">Reconstituting wedgies in general</a>

<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"><html><head><title>The wedgie</title></head><body><a href="#Basics">Basics</a> | <a href="#Conditions on being a wedgie">Conditions on being a wedgie</a> | <a href="#Constrained wedgies">Constrained wedgies</a> | <a href="#Reconstituting wedgies in general">Reconstituting wedgies in general</a> | <a href="#x||(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. If the maximum allowed complexity is M, then we may find the extrema in each of the parameters of Y separately of ||Y||^2"> ||(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. If the maximum allowed complexity is M, then we may find the extrema in each of the parameters of Y separately of ||Y||^2 </a>

<br />

<br />

<h1 id="toc0"><a name="Basics"></a>Basics</h1>

The <em><a class="wiki_link" href="/Wedgies%20and%20Multivals">wedgie</a></em> is a way of defining and working with an <a class="wiki_link" href="/abstract%20regular%20temperament">abstract regular temperament</a>. If one takes r independent <a class="wiki_link" href="/vals">vals</a> in a p-limit group of n primes, then the wedgie is defined by taking the <a class="wiki_link" href="/Wedgies%20and%20Multivals">wedge product</a> 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.<br />

Line 71:

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.<br />

<br />

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.</body></html></pre></div>

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|| <h1 id="toc4"><a name="x||(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. If the maximum allowed complexity is M, then we may find the extrema in each of the parameters of Y separately of ||Y||^2"></a> ||(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. If the maximum allowed complexity is M, then we may find the extrema in each of the parameters of Y separately of ||Y||^2 </h1>

M^2, which defines a quadric, so that finding the extrema is easy. We then round these bounds up in absolute value to an integer, and we have our bounds.</body></html></pre></div>

@@ Line 1: / Line 1: @@
 <h2>IMPORTED REVISION FROM WIKISPACES</h2>
 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:43:11 UTC</tt>.<br>
+: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2012-01-10 15:09:01 UTC</tt>.<br>
-: The original revision id was <tt>290426531</tt>.<br>
+: The original revision id was <tt>291073755</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>
@@ Line 35: / Line 35: @@
 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.
-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.
+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. If the maximum allowed complexity is M, then we may find the extrema in each of the parameters of Y separately of ||Y||^2 = M^2, which defines a quadric, so that finding the extrema is easy. We then round these bounds up in absolute value to an integer, and we have our bounds.
 </pre></div>
 <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;!-- 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;
+<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:11:&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:11 --&gt;&lt;!-- ws:start:WikiTextTocRule:12: --&gt;&lt;a href="#Basics"&gt;Basics&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:12 --&gt;&lt;!-- ws:start:WikiTextTocRule:13: --&gt; | &lt;a href="#Conditions on being a wedgie"&gt;Conditions on being a wedgie&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:13 --&gt;&lt;!-- ws:start:WikiTextTocRule:14: --&gt; | &lt;a href="#Constrained wedgies"&gt;Constrained wedgies&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:14 --&gt;&lt;!-- ws:start:WikiTextTocRule:15: --&gt; | &lt;a href="#Reconstituting wedgies in general"&gt;Reconstituting wedgies in general&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:15 --&gt;&lt;!-- ws:start:WikiTextTocRule:16: --&gt; | &lt;a href="#x||(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. If the maximum allowed complexity is M, then we may find the extrema in each of the parameters of Y separately of ||Y||^2"&gt; ||(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. If the maximum allowed complexity is M, then we may find the extrema in each of the parameters of Y separately of ||Y||^2 &lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:16 --&gt;&lt;!-- ws:start:WikiTextTocRule:17: --&gt;
-&lt;!-- ws:end:WikiTextTocRule:14 --&gt;&lt;br /&gt;
+&lt;!-- ws:end:WikiTextTocRule:17 --&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;
 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 71: / Line 71: @@
 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;
-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>
+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||  &lt;!-- ws:start:WikiTextHeadingRule:9:&amp;lt;h1&amp;gt; --&gt;&lt;h1 id="toc4"&gt;&lt;a name="x||(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. If the maximum allowed complexity is M, then we may find the extrema in each of the parameters of Y separately of ||Y||^2"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:9 --&gt; ||(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. If the maximum allowed complexity is M, then we may find the extrema in each of the parameters of Y separately of ||Y||^2 &lt;/h1&gt;
+ M^2, which defines a quadric, so that finding the extrema is easy. We then round these bounds up in absolute value to an integer, and we have our bounds.&lt;/body&gt;&lt;/html&gt;</pre></div>