Normal forms
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-05-14 20:43:53 UTC.
- The original revision id was 142153269.
- 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:
An integral matrix is a matrix whose entries are all integers. An important normalized form for integral matricies is [[http://Hermite normal form|Hermite normal form]], and by using Hermite normal form we may define normalized forms of lists of [[Harmonic Limit|p-limit]] musical intervals (or [[Monzos and Interval Space|monzos]]) or lists of [[Vals and Tuning Space|vals]], the normal interval (or mon) list and the normal val list. There are slightly different definitions of Hermite normal form in use, and if you are using a computer proram to compute it, you should take care that the same normal monzo or val list is finally achieved. The definition used by the Wikipedia article on Hermite form, probably the most standard, works as follows. An n by m integral matrix H is in Hermite normal form if firstly there can be defined a function F such that F(i) = 0 if all of the entries in the ith column of H are 0, and otherwise F(i) is equal to the row number of the first nonzero entry in the ith column, counting up from the bottom, ie the nth row. H[F(i), i] will therefore be this first nonzero entry, and we have (1) If i < j, H[i, j] = 0 (H is upper triangular) (2) F(i) is a function of the column number i. (3) F(i) = 0 if and only if all of the entries in the ith column are 0. (4) F is an increasing function of the column number i, and becomes strictly increasing after F(i) becomes positive. (5) If k > F(i) > 0 then H[k, i] = 0; that is, F(i) is the row of the first nonzero entry in the ith column, counting up from the bottom. (6) If F(i) > 0 then H[F(i), i] > 0; that is, the first nonzero entry in the ith column, counting up from the bottom, is positive. (7) If F(i) > 0 and i < k then H[F(i), i] > H[F(i), k] >= 0; that is, the first nonzero entry in the ith column, counting up from the bottom, is greater than any of the rest along that row, which however are all non-negative. There is some redundancy in the statement of these conditions, but that does no harm. ==Normal interval lists== Given a list of p-limit intervals, we can convert it to a normal list by the following procedure: (1) Convert the list to a list of monzos (2) Reverse the order of the elements of the monzos (3) Form a matrix whose rows are these reversed monzos (4) Hermite reduce this matrix to Hermite normal form (5) Reverse the entries in each row of the Hermite normal form matrix, and use these reversed rows to form a new list of monzos (6) Discard all the all-zero monzos, corresponding to the unison 1/1 (7) Reverse the whole list (not the entries) of the remaining monzos (8) Convert this list back to a list of p-limit rational numbers (9) For any number q < 1 on this list, replace q with 1/q The result is a normal interval list. The set of elements of the original list generates a finitely generated free abelian subgroup of the positive rationals under multiplication, and therefore of any p-limit group it lives inside. The normalized list contains a minimal set of generators, each greater than zero, in an ordering of nondecreasing prime limit which is parsimonious in its use of higher limits. For example, if we normalize [81/80, 126/125] we obtain [81/80, 59049/57344]. The first interval is 5-limit, which is as small as possible. The second is 7-limit, which must be the case because the group these two generate is 7-limit. However, it uses only 2, 3 and 7 in its prime factorization, parsimoniously rejecting 5 as the next highest prime limit. Because abstract regular temperaments, where the prime mappings are known but not the specific tuning of the generators are fully characterized by their kernel, the group of intervals they map to the unison, they can be characterized by the regular interval list of a set of generators (called commas or unison vectors) for the kernel. The above normal interval list, for example, characterizes septimal meantone, defining the normal [[Comma sequences|comma sequence]] of septimal meantone.
Original HTML content:
<html><head><title>Normal lists</title></head><body>An integral matrix is a matrix whose entries are all integers. An important normalized form for integral matricies is [[<!-- ws:start:WikiTextUrlRule:50:http://Hermite --><a class="wiki_link_ext" href="http://Hermite" rel="nofollow">http://Hermite</a><!-- ws:end:WikiTextUrlRule:50 --> normal form|Hermite normal form]], and by using Hermite normal form we may define normalized forms of lists of <a class="wiki_link" href="/Harmonic%20Limit">p-limit</a> musical intervals (or <a class="wiki_link" href="/Monzos%20and%20Interval%20Space">monzos</a>) or lists of <a class="wiki_link" href="/Vals%20and%20Tuning%20Space">vals</a>, the normal interval (or mon) list and the normal val list.<br /> <br /> There are slightly different definitions of Hermite normal form in use, and if you are using a computer proram to compute it, you should take care that the same normal monzo or val list is finally achieved. The definition used by the Wikipedia article on Hermite form, probably the most standard, works as follows. <br /> <br /> An n by m integral matrix H is in Hermite normal form if firstly there can be defined a function F such that F(i) = 0 if all of the entries in the ith column of H are 0, and otherwise F(i) is equal to the row number of the first nonzero entry in the ith column, counting up from the bottom, ie the nth row.<br /> H[F(i), i] will therefore be this first nonzero entry, and we have<br /> <br /> (1) If i < j, H[i, j] = 0 (H is upper triangular)<br /> <br /> (2) F(i) is a function of the column number i.<br /> <br /> (3) F(i) = 0 if and only if all of the entries in the ith column are 0.<br /> <br /> (4) F is an increasing function of the column number i, and becomes strictly increasing after F(i) becomes positive.<br /> <br /> (5) If k > F(i) > 0 then H[k, i] = 0; that is, F(i) is the row of the first nonzero entry in the ith column, counting up from the bottom.<br /> <br /> (6) If F(i) > 0 then H[F(i), i] > 0; that is, the first nonzero entry in the ith column, counting up from the bottom, is positive.<br /> <br /> (7) If F(i) > 0 and i < k then H[F(i), i] > H[F(i), k] >= 0; that is, the first nonzero entry in the ith column, counting up from the bottom, is greater than any of the rest along that row, which however are all non-negative.<br /> <br /> There is some redundancy in the statement of these conditions, but that does no harm.<br /> <br /> <!-- ws:start:WikiTextHeadingRule:0:<h2> --><h2 id="toc0"><a name="x-Normal interval lists"></a><!-- ws:end:WikiTextHeadingRule:0 -->Normal interval lists</h2> <br /> Given a list of p-limit intervals, we can convert it to a normal list by the following procedure:<br /> <br /> (1) Convert the list to a list of monzos<br /> <br /> (2) Reverse the order of the elements of the monzos<br /> <br /> (3) Form a matrix whose rows are these reversed monzos<br /> <br /> (4) Hermite reduce this matrix to Hermite normal form<br /> <br /> (5) Reverse the entries in each row of the Hermite normal form matrix, and use these reversed rows to form a new list of monzos <br /> <br /> (6) Discard all the all-zero monzos, corresponding to the unison 1/1<br /> <br /> (7) Reverse the whole list (not the entries) of the remaining monzos<br /> <br /> (8) Convert this list back to a list of p-limit rational numbers<br /> <br /> (9) For any number q < 1 on this list, replace q with 1/q<br /> <br /> The result is a normal interval list. The set of elements of the original list generates a finitely generated free abelian subgroup of the positive rationals under multiplication, and therefore of any p-limit group it lives inside. The normalized list contains a minimal set of generators, each greater than zero, in an ordering of nondecreasing prime limit which is parsimonious in its use of higher limits. For example, if we normalize [81/80, 126/125] we obtain [81/80, 59049/57344]. The first interval is 5-limit, which is as small as possible. The second is 7-limit, which must be the case because the group these two generate is 7-limit. However, it uses only 2, 3 and 7 in its prime factorization, parsimoniously rejecting 5 as the next highest prime limit. Because abstract regular temperaments, where the prime mappings are known but not the specific tuning of the generators are fully characterized by their kernel, the group of intervals they map to the unison, they can be characterized by the regular interval list of a set of generators (called commas or unison vectors) for the kernel. The above normal interval list, for example, characterizes septimal meantone, defining the normal <a class="wiki_link" href="/Comma%20sequences">comma sequence</a> of septimal meantone.</body></html>