Fokker block: Difference between revisions

From Xenharmonic Wiki
Jump to navigation Jump to search
Wikispaces>xenwolf
**Imported revision 150926501 - Original comment: **
Wikispaces>genewardsmith
**Imported revision 151065243 - 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:xenwolf|xenwolf]] and made on <tt>2010-06-29 08:24:58 UTC</tt>.<br>
: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2010-06-30 03:05:12 UTC</tt>.<br>
: The original revision id was <tt>150926501</tt>.<br>
: The original revision id was <tt>151065243</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 9: Line 9:


Suppose we have n-1 commas, and we form an n by n matrix, the top row of which are n indeterminate elements |e2 e3 e5 ... ep&gt;, and the other rows of which are the monzos corresponding to our chosen commas. If we take the determinant of this matrix, we get v2*e2+v3*e3+...+vp*ep where the v2, v3 ... vp are integers. We interpret this as the [[Vals and Tuning Space|val]] v = &lt;v2, v3, ... vp|. If this is a zero vector the commas are not independent, and if the there exists a common divisor we have what is known as a torsion problem, and we discard the comma set. Otherwise, if v2&lt;0 we reverse sign, and we have a val v which tells us what equal temperament our Fokker block will be approximating. For example, starting with the commas 81/80, 128/125 and 64/63, the above procedure gives us the val v = &lt;12 19 28 34|, and we will be looking at a 12-note scale in the 7-limit.
Suppose we have n-1 commas, and we form an n by n matrix, the top row of which are n indeterminate elements |e2 e3 e5 ... ep&gt;, and the other rows of which are the monzos corresponding to our chosen commas. If we take the determinant of this matrix, we get v2*e2+v3*e3+...+vp*ep where the v2, v3 ... vp are integers. We interpret this as the [[Vals and Tuning Space|val]] v = &lt;v2, v3, ... vp|. If this is a zero vector the commas are not independent, and if the there exists a common divisor we have what is known as a torsion problem, and we discard the comma set. Otherwise, if v2&lt;0 we reverse sign, and we have a val v which tells us what equal temperament our Fokker block will be approximating. For example, starting with the commas 81/80, 128/125 and 64/63, the above procedure gives us the val v = &lt;12 19 28 34|, and we will be looking at a 12-note scale in the 7-limit.
Now choose a "chroma" for the Fokker block, which is a p-limit interval c such that v(c) = 1; that is, if m is the monzo for c, then &lt;v|m&gt; = 1. Precisely which interval we choose doesn't actually matter, so if out commas are 81/80, 128/125 and 64/63, we could for instance choose 28/27, 25/24, 21/20, 16/15 or 15/14. Having selected a chroma, form the n by n matrix whose first row is the monzo for the chroma c, and whose other rows are monzos of the n-1 commas. Because we have chosen c so that v(c)=1, the determinant of this matrix will be +-1. It is therefore a [[http://en.wikipedia.org/wiki/Unimodular_matrix|unimodular matrix]], that is, a square matrix with coefficients which are integers and with determinant +-1. Such a matrix is invertible, and the inverse matrix is also unimodular. If we call c c1, and label the commas c2, c3, ... cn; and if we consider the columns of the inverse matrix to be vals and call them v1, v2, ... vn, then by the definition of the inverse of a matrix, vi(cj) = delta_ij, where delta_ij is the [[http://en.wikipedia.org/wiki/Kronecker_delta|Kronecker delta]]. Stated anoth way, vi(cj) is 0 unless i equals j, in which case vi(ci) = 1.




Line 17: Line 19:
<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;Fokker blocks&lt;/title&gt;&lt;/head&gt;&lt;body&gt;The &lt;strong&gt;Fokker block&lt;/strong&gt; is one of the most notable inventions of the physicist and music theorist &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Adriaan_Fokker" rel="nofollow"&gt;Adriaan Fokker&lt;/a&gt;. While the idea generalizes easily to &lt;a class="wiki_link" href="/just%20intonation%20subgroups"&gt;just intonation subgroups&lt;/a&gt;, for ease of exposition we will suppose that we are in a &lt;a class="wiki_link" href="/Harmonic%20Limit"&gt;p-limit&lt;/a&gt; situation with n=pi(p) primes up to an including p. &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;Fokker blocks&lt;/title&gt;&lt;/head&gt;&lt;body&gt;The &lt;strong&gt;Fokker block&lt;/strong&gt; is one of the most notable inventions of the physicist and music theorist &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Adriaan_Fokker" rel="nofollow"&gt;Adriaan Fokker&lt;/a&gt;. While the idea generalizes easily to &lt;a class="wiki_link" href="/just%20intonation%20subgroups"&gt;just intonation subgroups&lt;/a&gt;, for ease of exposition we will suppose that we are in a &lt;a class="wiki_link" href="/Harmonic%20Limit"&gt;p-limit&lt;/a&gt; situation with n=pi(p) primes up to an including p. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Suppose we have n-1 commas, and we form an n by n matrix, the top row of which are n indeterminate elements |e2 e3 e5 ... ep&amp;gt;, and the other rows of which are the monzos corresponding to our chosen commas. If we take the determinant of this matrix, we get v2*e2+v3*e3+...+vp*ep where the v2, v3 ... vp are integers. We interpret this as the &lt;a class="wiki_link" href="/Vals%20and%20Tuning%20Space"&gt;val&lt;/a&gt; v = &amp;lt;v2, v3, ... vp|. If this is a zero vector the commas are not independent, and if the there exists a common divisor we have what is known as a torsion problem, and we discard the comma set. Otherwise, if v2&amp;lt;0 we reverse sign, and we have a val v which tells us what equal temperament our Fokker block will be approximating. For example, starting with the commas 81/80, 128/125 and 64/63, the above procedure gives us the val v = &amp;lt;12 19 28 34|, and we will be looking at a 12-note scale in the 7-limit.&lt;/body&gt;&lt;/html&gt;</pre></div>
Suppose we have n-1 commas, and we form an n by n matrix, the top row of which are n indeterminate elements |e2 e3 e5 ... ep&amp;gt;, and the other rows of which are the monzos corresponding to our chosen commas. If we take the determinant of this matrix, we get v2*e2+v3*e3+...+vp*ep where the v2, v3 ... vp are integers. We interpret this as the &lt;a class="wiki_link" href="/Vals%20and%20Tuning%20Space"&gt;val&lt;/a&gt; v = &amp;lt;v2, v3, ... vp|. If this is a zero vector the commas are not independent, and if the there exists a common divisor we have what is known as a torsion problem, and we discard the comma set. Otherwise, if v2&amp;lt;0 we reverse sign, and we have a val v which tells us what equal temperament our Fokker block will be approximating. For example, starting with the commas 81/80, 128/125 and 64/63, the above procedure gives us the val v = &amp;lt;12 19 28 34|, and we will be looking at a 12-note scale in the 7-limit.&lt;br /&gt;
&lt;br /&gt;
Now choose a &amp;quot;chroma&amp;quot; for the Fokker block, which is a p-limit interval c such that v(c) = 1; that is, if m is the monzo for c, then &amp;lt;v|m&amp;gt;  &lt;!-- ws:start:WikiTextHeadingRule:0:&amp;lt;h1&amp;gt; --&gt;&lt;h1 id="toc0"&gt;&lt;a name="x1. Precisely which interval we choose doesn't actually matter, so if out commas are 81/80, 128/125 and 64/63, we could for instance choose 28/27, 25/24, 21/20, 16/15 or 15/14. Having selected a chroma, form the n by n matrix whose first row is the monzo for the chroma c, and whose other rows are monzos of the n-1 commas. Because we have chosen c so that v(c)=1, the determinant of this matrix will be +-1. It is therefore a unimodular matrix, that is, a square matrix with coefficients which are integers and with determinant +-1. Such a matrix is invertible, and the inverse matrix is also unimodular. If we call c c1, and label the commas c2, c3, ... cn; and if we consider the columns of the inverse matrix to be vals and call them v1, v2, ... vn, then by the definition of the inverse of a matrix, vi(cj)"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:0 --&gt; 1. Precisely which interval we choose doesn't actually matter, so if out commas are 81/80, 128/125 and 64/63, we could for instance choose 28/27, 25/24, 21/20, 16/15 or 15/14. Having selected a chroma, form the n by n matrix whose first row is the monzo for the chroma c, and whose other rows are monzos of the n-1 commas. Because we have chosen c so that v(c)=1, the determinant of this matrix will be +-1. It is therefore a &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Unimodular_matrix" rel="nofollow"&gt;unimodular matrix&lt;/a&gt;, that is, a square matrix with coefficients which are integers and with determinant +-1. Such a matrix is invertible, and the inverse matrix is also unimodular. If we call c c1, and label the commas c2, c3, ... cn; and if we consider the columns of the inverse matrix to be vals and call them v1, v2, ... vn, then by the definition of the inverse of a matrix, vi(cj) &lt;/h1&gt;
delta_ij, where delta_ij is the &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Kronecker_delta" rel="nofollow"&gt;Kronecker delta&lt;/a&gt;. Stated anoth way, vi(cj) is 0 unless i equals j, in which case vi(ci) = 1.&lt;/body&gt;&lt;/html&gt;</pre></div>

Revision as of 03:05, 30 June 2010

IMPORTED REVISION FROM WIKISPACES

This is an imported revision from Wikispaces. The revision metadata is included below for reference:

This revision was by author genewardsmith and made on 2010-06-30 03:05:12 UTC.
The original revision id was 151065243.
The revision comment was:

The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.

Original Wikitext content:

The **Fokker block** is one of the most notable inventions of the physicist and music theorist [[http://en.wikipedia.org/wiki/Adriaan_Fokker|Adriaan Fokker]]. While the idea generalizes easily to [[just intonation subgroups]], for ease of exposition we will suppose that we are in a [[Harmonic Limit|p-limit]] situation with n=pi(p) primes up to an including p. 

Suppose we have n-1 commas, and we form an n by n matrix, the top row of which are n indeterminate elements |e2 e3 e5 ... ep>, and the other rows of which are the monzos corresponding to our chosen commas. If we take the determinant of this matrix, we get v2*e2+v3*e3+...+vp*ep where the v2, v3 ... vp are integers. We interpret this as the [[Vals and Tuning Space|val]] v = <v2, v3, ... vp|. If this is a zero vector the commas are not independent, and if the there exists a common divisor we have what is known as a torsion problem, and we discard the comma set. Otherwise, if v2<0 we reverse sign, and we have a val v which tells us what equal temperament our Fokker block will be approximating. For example, starting with the commas 81/80, 128/125 and 64/63, the above procedure gives us the val v = <12 19 28 34|, and we will be looking at a 12-note scale in the 7-limit.

Now choose a "chroma" for the Fokker block, which is a p-limit interval c such that v(c) = 1; that is, if m is the monzo for c, then <v|m> = 1. Precisely which interval we choose doesn't actually matter, so if out commas are 81/80, 128/125 and 64/63, we could for instance choose 28/27, 25/24, 21/20, 16/15 or 15/14. Having selected a chroma, form the n by n matrix whose first row is the monzo for the chroma c, and whose other rows are monzos of the n-1 commas. Because we have chosen c so that v(c)=1, the determinant of this matrix will be +-1. It is therefore a [[http://en.wikipedia.org/wiki/Unimodular_matrix|unimodular matrix]], that is, a square matrix with coefficients which are integers and with determinant +-1. Such a matrix is invertible, and the inverse matrix is also unimodular. If we call c c1, and label the commas c2, c3, ... cn; and if we consider the columns of the inverse matrix to be vals and call them v1, v2, ... vn, then by the definition of the inverse of a matrix, vi(cj) = delta_ij, where delta_ij is the [[http://en.wikipedia.org/wiki/Kronecker_delta|Kronecker delta]]. Stated anoth way, vi(cj) is 0 unless i equals j, in which case vi(ci) = 1.




 

Original HTML content:

<html><head><title>Fokker blocks</title></head><body>The <strong>Fokker block</strong> is one of the most notable inventions of the physicist and music theorist <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Adriaan_Fokker" rel="nofollow">Adriaan Fokker</a>. While the idea generalizes easily to <a class="wiki_link" href="/just%20intonation%20subgroups">just intonation subgroups</a>, for ease of exposition we will suppose that we are in a <a class="wiki_link" href="/Harmonic%20Limit">p-limit</a> situation with n=pi(p) primes up to an including p. <br />
<br />
Suppose we have n-1 commas, and we form an n by n matrix, the top row of which are n indeterminate elements |e2 e3 e5 ... ep&gt;, and the other rows of which are the monzos corresponding to our chosen commas. If we take the determinant of this matrix, we get v2*e2+v3*e3+...+vp*ep where the v2, v3 ... vp are integers. We interpret this as the <a class="wiki_link" href="/Vals%20and%20Tuning%20Space">val</a> v = &lt;v2, v3, ... vp|. If this is a zero vector the commas are not independent, and if the there exists a common divisor we have what is known as a torsion problem, and we discard the comma set. Otherwise, if v2&lt;0 we reverse sign, and we have a val v which tells us what equal temperament our Fokker block will be approximating. For example, starting with the commas 81/80, 128/125 and 64/63, the above procedure gives us the val v = &lt;12 19 28 34|, and we will be looking at a 12-note scale in the 7-limit.<br />
<br />
Now choose a &quot;chroma&quot; for the Fokker block, which is a p-limit interval c such that v(c) = 1; that is, if m is the monzo for c, then &lt;v|m&gt;  <!-- ws:start:WikiTextHeadingRule:0:&lt;h1&gt; --><h1 id="toc0"><a name="x1. Precisely which interval we choose doesn't actually matter, so if out commas are 81/80, 128/125 and 64/63, we could for instance choose 28/27, 25/24, 21/20, 16/15 or 15/14. Having selected a chroma, form the n by n matrix whose first row is the monzo for the chroma c, and whose other rows are monzos of the n-1 commas. Because we have chosen c so that v(c)=1, the determinant of this matrix will be +-1. It is therefore a unimodular matrix, that is, a square matrix with coefficients which are integers and with determinant +-1. Such a matrix is invertible, and the inverse matrix is also unimodular. If we call c c1, and label the commas c2, c3, ... cn; and if we consider the columns of the inverse matrix to be vals and call them v1, v2, ... vn, then by the definition of the inverse of a matrix, vi(cj)"></a><!-- ws:end:WikiTextHeadingRule:0 --> 1. Precisely which interval we choose doesn't actually matter, so if out commas are 81/80, 128/125 and 64/63, we could for instance choose 28/27, 25/24, 21/20, 16/15 or 15/14. Having selected a chroma, form the n by n matrix whose first row is the monzo for the chroma c, and whose other rows are monzos of the n-1 commas. Because we have chosen c so that v(c)=1, the determinant of this matrix will be +-1. It is therefore a <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Unimodular_matrix" rel="nofollow">unimodular matrix</a>, that is, a square matrix with coefficients which are integers and with determinant +-1. Such a matrix is invertible, and the inverse matrix is also unimodular. If we call c c1, and label the commas c2, c3, ... cn; and if we consider the columns of the inverse matrix to be vals and call them v1, v2, ... vn, then by the definition of the inverse of a matrix, vi(cj) </h1>
 delta_ij, where delta_ij is the <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Kronecker_delta" rel="nofollow">Kronecker delta</a>. Stated anoth way, vi(cj) is 0 unless i equals j, in which case vi(ci) = 1.</body></html>