Contributions to http://xenharmonic.wikispaces.com/ are licensed under a Creative Commons Attribution Share-Alike Non-Commercial 3.0 License.

Portions not contributed by visitors are Copyright 2018 Tangient LLC

TES: The largest network of teachers in the world

Portions not contributed by visitors are Copyright 2018 Tangient LLC

TES: The largest network of teachers in the world

Loading...

## Table of Contents

An integral matrix is a matrix whose entries are all integers. An important normalized form for integral matrices is Hermite normal form, and by using Hermite normal form we may define normalized forms of lists of p-limit musical intervals (or monzos) or lists of vals, the normal interval (or monzo) list and the normal val list.

There are slightly different definitions of Hermite normal form in use, and if you are using a computer program 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 when we define 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, checking up from the bottom, ie from the nth row, 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 < j then H[F(i), i] > H[F(i), j] >= 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 (once again) the entries in each row of the Hermite normal form matrix, and use these re-reversed rows to form a new list of monzos

(6) Discard all of 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 also 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 sequence of septimal meantone.

Normal interval lists can also be used to characterize the just intonation subgroups on which subgroup temperaments are defined and using which subgroup scales may be constructed. On the pages Chromatic pairs, Subgroup temperaments and Just intonation subgroups can be found many examples; the subgroup lists are given in a form where generators of the subgroup are separated by periods so as to flag the fact that the list defines a subgroup. An example would be the Barbados subgroup, 2.3.13/5.

## Normal val lists

If L is a list of n vals, we may write it as an nxm matrix, where the rows of the matrix are the vals, and m = pi(p), where p is the prime limit. To get the normal val list, we do the following:(1) Hermite reduce the matrix for L

(2) Throw away all rows which consist of nothing but zeros, resulting in a kxm matrix

(3) Find the Moore-Penrose pseudoinverse of the kxm matrix, and multiply this from the left by the row vector [1 log2(3) log2(5) ... log2(p)]. If the ith entry in the result is negative, multiply the corresponding val by -1. Return the result as the normalized val list.

The point of steps two and three is that now the vals on the list correspond to a list of generators which are all positive (written additively) or equivalently greater than 1 (written multiplicatively.) Just as a normal comma list can be used to classify an abstract regular temperament, so can a normal val list. The val list is what on Graham Breed's web site is called a "mapping", put into a canonical form. The "Maps" (though not the "Map to lattice") listed on temperament pages of this wiki are all normal val lists; an example would be [<1 0 -4 -13|, <0 1 4 10|], the normal val list for septimal meantone.

## Maple code

Below is Maple code for finding the normal interval and val list, given an interval list or a val list.log2 := proc(x) evalf(ln(x)/ln(2)) end:

transpos := proc(w)

- transpose of listlist w

local u;u := Matrix(w);

u := LinearAlgebra[Transpose](u);

convert(u, listlist) end:

pseudo := proc(w)

- pseudoinverse of listlist w

local u;u := Matrix(w);

u := LinearAlgebra[MatrixInverse](u, method='pseudo');

convert(u, listlist) end:

psu := proc(w) transpos(pseudo(w)) end:

pril := proc(n)

- log2 of first n primes

local i, u;u := NULL;

for i from 1 to n do

u := u,log2(ithprime(i)) od;

[u] end:

revlist := proc(l)

- reverse of list

local i, v, e;e := nops(l);

for i from 1 to e do

v[i] := l[e-i+1] od;

convert(convert(v,array),list) end:

orp := proc(w, p) padic[ordp](w, p) end:

pim := proc(q)

- rank of p-limit of q

local r, i, p;r := 1;

i := 0;

while not (r=q) do

i := i+1;

p := ithprime(i);

r := r*p^orp(q, p) od;

if i=0 then RETURN(0) fi;

i end:

plim := proc(q)

- prime limit of rational number q

ithprime(pim(q)) end:rat2monz := proc(q, n)

- converts rational number q to monzo of length n

local v, i;for i from 1 to n do

v[i] := ordp(q, ithprime(i)) od;

convert(convert(v, array), list) end:

monz2rat := proc(m)

- converts monzo to rational number

local i, t;t := 1;

for i from 1 to nops(m) do

t := t * ithprime(i)^m[i] od;

t end:

herm := proc(l)

- hermite normal form of listlist l

local M;M := Matrix(l);

convert(convert(HermiteForm[Z](M), array), listlist) end:

nori := proc(l)

- normal interval list from list of intervals l

local i, p, u, v, w;p := 1;

for i from 1 to nops(l) do

p := max(p, plim(l[i])) od;

u := [];

for i from 1 to nops(l) do

u := [op(u), revlist(rat2monz(l[i], p))] od;

v := herm(u);

for i from 1 to nops(l) do

u := revlist(v[i]);

u := monz2rat(u);

w[i] := u od;

u := [];

for i from 1 to nops(l) do

v := w[i];

if v<1 then v:=1/v fi;

if not v=1 then u := [op(u), v] fi od;

revlist(u) end:

norv := proc(l)

- normal val list from list of vals l

local u, v, w, i, n, a;u := herm(l);

n := rnk(u);

v := NULL:

for i from 1 to n do

v := v,u[i] od;

v := [v];

u := pseudo(v);

w := pril(nops(l[1]));

a := op(matmul(w, u));

u := NULL;

for i from 1 to n do

if a[i] < 0 then u := u,-v[i] fi;

if a[i] >= 0 then u := u,v[i] fi od;

[u] end: