Kite's thoughts on pergens: Difference between revisions
Wikispaces>TallKite **Imported revision 626231179 - Original comment: ** |
Wikispaces>TallKite **Imported revision 626236003 - 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:TallKite|TallKite]] and made on <tt>2018-02- | : This revision was by author [[User:TallKite|TallKite]] and made on <tt>2018-02-10 05:29:04 UTC</tt>.<br> | ||
: The original revision id was <tt> | : The original revision id was <tt>626236003</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> | ||
Line 748: | Line 748: | ||
==Various proofs (unfinished)== | ==Various proofs (unfinished)== | ||
The interval P8/2 has a "ratio" of the square root of 2 = 2<span style="vertical-align: super;">1/2</span>, and its monzo | The interval P8/2 has a "ratio" of the square root of 2 = 2<span style="vertical-align: super;">1/2</span>, and its monzo can be written with fractions as (1/2, 0). Likewise, the pergen (P8/m, (a,b)/n) implies P = (1/m, 0) and G = (a/n, b/n). These equations make the **pergen matrix** [(1/m 0) (a/n b/n)], which is P and G in terms of P8 and P12. Its inverse is [(m 0) (-am/b n/b)], which is P8 and P12 in terms of P and G, i.e. the square mapping. | ||
Because we started with a valid pergen, the square mapping must be an integer matrix. Since n/b is an integer, n must be a multiple of |b|. From this it follows that a and b must be coprime, otherwise both (a,b) and n could be reduced by GCD (a,b). Since -am/b is an integer, it follows that m must be a multiple of |b| as well. Thus GCD (m,n) = |b| · GCD (m/|b|, n/|b|)= |b| · r. | |||
Let | Let p = m/rb and q = n/rb, where p and q are coprime integers, nonzero but possibly negative. Then P8 = m·P = prb·P = r·(pb·P), and P8 splits into (at least) r parts. Furthermore, P12 = (-am/b)P + (n/b)G = -apr·P + qr·G = r·(-ap·P + q·G), and P12 also splits into at least r parts. Thus every 3-limit interval splits into at least r parts. | ||
Assume r | Assume it's a false double, and there's a comma (u,v,w) that splits both P8 and (a,b) appropriately | ||
can we prove r = 1? | |||
2.3.7 and (22,-5,-5) = P8/5 | |||
GCD (u,v,w) = 1 | |||
GCD (1 + ku, kv, kw) = m for some integer k, thus GCD (v,w) = m | |||
GCD (a + k'u, b + k'v, k'w) = n for some integer k', thus |w| = LCM (m,n) = mn/r|b| = pqr|b| | |||
Given an arbitrary x and y, GCD (x + k"u, y + k"v, k"w) >= r for some k | |||
Assume GCD (x,y) = 1 | |||
To prove: if r = 1, it's a false double, and (a,b)/n splits P8 into b parts | |||
if r > 1, it's a true double | |||
M | |||
a·P8 = (a,0) = (a,b) - (0,b) = M - b·P12 | |||
Let c and d be the bezout pair of a | M = n·G = qrb·G | ||
a·P8 = qrb·G - b·P12 = b·(qr·G - P12) | |||
Let c and d be the bezout pair of a and b, with c·a + d·b = 1 | |||
If |b| = 1, c = 0 and |d| = 1 | |||
Since the pergen is a double-split, m > 1, therefore |b| > 1, therefore c ≠ 0 | Since the pergen is a double-split, m > 1, therefore |b| > 1, therefore c ≠ 0 | ||
ca·P8 = cb·(qr·G - P12) | |||
(1 - d·b)·P8 = c·b·( | (1 - d·b)·P8 = c·b·(qr·G - P12) | ||
P8 = d·b·P8 + c·b·( | P8 = d·b·P8 + c·b·(qr·G - P12) = b · (d·P8 + cqr·G - c·P12) | ||
Therefore P8 is split into at least |b| periods | |||
Therefore P8 is split into | |||
Line 4,440: | Line 4,449: | ||
<br /> | <br /> | ||
This PDF is a rank-2 notation guide that shows the full lattice for the first 15 pergens, up through the third-splits block. It includes alternate enharmonics for many pergens.<br /> | This PDF is a rank-2 notation guide that shows the full lattice for the first 15 pergens, up through the third-splits block. It includes alternate enharmonics for many pergens.<br /> | ||
<!-- ws:start:WikiTextUrlRule: | <!-- ws:start:WikiTextUrlRule:5535:http://www.tallkite.com/misc_files/pergens.pdf --><a class="wiki_link_ext" href="http://www.tallkite.com/misc_files/pergens.pdf" rel="nofollow">http://www.tallkite.com/misc_files/pergens.pdf</a><!-- ws:end:WikiTextUrlRule:5535 --><br /> | ||
<br /> | <br /> | ||
Alt-pergenLister lists out thousands of pergens, and suggests periods, generators and enharmonics for each one. Alternate enharmonics are not listed, but single-pair notation for false-double pergens is. It can also list only those pergens supported by a specific edo. Written in Jesusonic, runs inside Reaper.<br /> | Alt-pergenLister lists out thousands of pergens, and suggests periods, generators and enharmonics for each one. Alternate enharmonics are not listed, but single-pair notation for false-double pergens is. It can also list only those pergens supported by a specific edo. Written in Jesusonic, runs inside Reaper.<br /> | ||
<!-- ws:start:WikiTextUrlRule: | <!-- ws:start:WikiTextUrlRule:5536:http://www.tallkite.com/misc_files/alt-pergenLister.zip --><a class="wiki_link_ext" href="http://www.tallkite.com/misc_files/alt-pergenLister.zip" rel="nofollow">http://www.tallkite.com/misc_files/alt-pergenLister.zip</a><!-- ws:end:WikiTextUrlRule:5536 --><br /> | ||
<br /> | <br /> | ||
Screenshot of the first 38 pergens:<br /> | Screenshot of the first 38 pergens:<br /> | ||
Line 4,462: | Line 4,471: | ||
<!-- ws:start:WikiTextHeadingRule:97:&lt;h2&gt; --><h2 id="toc21"><a name="Further Discussion-Various proofs (unfinished)"></a><!-- ws:end:WikiTextHeadingRule:97 -->Various proofs (unfinished)</h2> | <!-- ws:start:WikiTextHeadingRule:97:&lt;h2&gt; --><h2 id="toc21"><a name="Further Discussion-Various proofs (unfinished)"></a><!-- ws:end:WikiTextHeadingRule:97 -->Various proofs (unfinished)</h2> | ||
<br /> | <br /> | ||
The interval P8/2 has a &quot;ratio&quot; of the square root of 2 = 2<span style="vertical-align: super;">1/2</span>, and its monzo | The interval P8/2 has a &quot;ratio&quot; of the square root of 2 = 2<span style="vertical-align: super;">1/2</span>, and its monzo can be written with fractions as (1/2, 0). Likewise, the pergen (P8/m, (a,b)/n) implies P = (1/m, 0) and G = (a/n, b/n). These equations make the <strong>pergen matrix</strong> [(1/m 0) (a/n b/n)], which is P and G in terms of P8 and P12. Its inverse is [(m 0) (-am/b n/b)], which is P8 and P12 in terms of P and G, i.e. the square mapping. <br /> | ||
<br /> | |||
Because we started with a valid pergen, the square mapping must be an integer matrix. Since n/b is an integer, n must be a multiple of |b|. From this it follows that a and b must be coprime, otherwise both (a,b) and n could be reduced by GCD (a,b). Since -am/b is an integer, it follows that m must be a multiple of |b| as well. Thus GCD (m,n) = |b| · GCD (m/|b|, n/|b|)= |b| · r.<br /> | |||
<br /> | |||
Let p = m/rb and q = n/rb, where p and q are coprime integers, nonzero but possibly negative. Then P8 = m·P = prb·P = r·(pb·P), and P8 splits into (at least) r parts. Furthermore, P12 = (-am/b)P + (n/b)G = -apr·P + qr·G = r·(-ap·P + q·G), and P12 also splits into at least r parts. Thus every 3-limit interval splits into at least r parts.<br /> | |||
<br /> | <br /> | ||
Assume it's a false double, and there's a comma (u,v,w) that splits both P8 and (a,b) appropriately<br /> | |||
can we prove r = 1?<br /> | |||
2.3.7 and (22,-5,-5) = P8/5<br /> | |||
GCD (u,v,w) = 1<br /> | |||
GCD (1 + ku, kv, kw) = m for some integer k, thus GCD (v,w) = m<br /> | |||
GCD (a + k'u, b + k'v, k'w) = n for some integer k', thus |w| = LCM (m,n) = mn/r|b| = pqr|b|<br /> | |||
Given an arbitrary x and y, GCD (x + k&quot;u, y + k&quot;v, k&quot;w) &gt;= r for some k<br /> | |||
Assume GCD (x,y) = 1<br /> | |||
<br /> | <br /> | ||
<br /> | <br /> | ||
To prove: if r = 1, it's a false double, and (a,b)/n splits P8 into b parts<br /> | |||
if r &gt; 1, it's a true double<br /> | |||
<br /> | <br /> | ||
a·P8 = (a,0) = (a,b) - (0,b) = M - b·P12<br /> | |||
M = n·G = qrb·G<br /> | |||
a·P8 = qrb·G - b·P12 = b·(qr·G - P12)<br /> | |||
M | Let c and d be the bezout pair of a and b, with c·a + d·b = 1<br /> | ||
If |b| = 1, c = 0 and |d| = 1<br /> | |||
Let c and d be the bezout pair of a | |||
Since the pergen is a double-split, m &gt; 1, therefore |b| &gt; 1, therefore c ≠ 0<br /> | Since the pergen is a double-split, m &gt; 1, therefore |b| &gt; 1, therefore c ≠ 0<br /> | ||
ca·P8 = cb·(qr·G - P12)<br /> | |||
(1 - d·b)·P8 = c·b·( | (1 - d·b)·P8 = c·b·(qr·G - P12)<br /> | ||
P8 = d·b·P8 + c·b·( | P8 = d·b·P8 + c·b·(qr·G - P12) = b · (d·P8 + cqr·G - c·P12)<br /> | ||
Therefore P8 is split into at least |b| periods<br /> | |||
Therefore P8 is split into | <br /> | ||
<br /> | <br /> | ||
<br /> | <br /> |