User:Inthar/MV3

MV3 Examples

Diasem

"Diasem[5]" is: LMLMs

For example (one rotation of) diasem is (right is 4/3, down right is 7/6)

x-x-x-x-x
 x-x-x-x

This is LM LS LM LS L here you're stacking 1/1-7/6-4/3 but if you extend to 14 notes you have to do it like this

x-x-x-x-x-x-x
     x-x-x-x-x-x-x

MV3 Theorem 1

Suppose we have an MV3 scale word with steps x, y and z. With only one exception ("xyxzxyx"), at least two of the three steps must occur the same number of times. For example, it is possible to have a max-variety-3 scale with 3 small steps, 5 medium steps, and 3 large steps, because there are the same number of small steps as large steps. But a max-variety-3 scale with 3 small steps, 5 medium steps, and 4 large steps is impossible. (The one exception to this rule is "xyxzxyx", along with their repetitions "xyxzxyx", etc.) Moreover, there always exists some "generator" interval for any max-variety-3 scale (other than two exceptions, "xyzyx" and "xyxzxyx") such that the scale can be expressed as two parallel chains of this generator which are almost equal in length (the lengths are either equal, or differ by 1).

Below, assume that the scale word S is not multiperiod.

Lemma 1: S is pairwise-well-formed (PWF), i.e. sizes of chunks of any fixed letter form a MOS (except in the case "xyzyx")

TODO: account for case xyzyx.

To eliminate xyzyx we manually check all words up to length 5... (todo)

Now assume len(S) >= 6.

WOLOG consider chunks of x. Use q for any occurrence of either y and z.

say you have some intvl class (k steps) with 3 variants in x's and q's:

• S1 = a1x + b1q, represented by the word s1 in the MV3 scale
• S2 = a2x + b2q, word s2
• S3 = a3x + b3q, word s3

(si to be chosen later) Say that the mos formed by the Ys and Zs is rY sZ, wolog r > s. The # of chunks in rY sZ is s. The min chunk size is floor(r/s). The idea is to keep extending si to the right until the chunk size in the MOS guarantees an extra variety.

First we prove that chunk sizes can't differ by 2 or more.

have some length (say that of biggest chunk of x's) word with no q's and >=2 q's.

now y[biggest]z => contradiction bc two kinds of "one q"

so some non biggest chunk has to have y[chunk]z (or z[chunk]y)

then by using size of [y[non-biggest chunk]z] you get a contradiction bc you can scoot to get an x (since consecutive q's cant happen if there are consecutive x's)

u get [xyxxx...x]z, x[yxxxx...xz]x, y[x...xz], and all x's from the max chunk

If we have more q's than x's then we can't have "xx", so we're done.

This proves the claim about chunk sizes.

To be continued...

Proof of the alternating-gens (AG) property (except in the case xyxzxyx)

We now prove that except in the case xyxzxyx, if the scale is pairwise well-formed, the scale is generated by alternating generators.

To eliminate xyxzxyx we manually check all words up to length 7... (todo)

Now assume len(S) >= 8.

Proof of "ax by bz" (except in case xyxzxyx)

Assume len(S) >= 8. Write S in x's and q's, as above. By PWF, we have that the word of x's and q's is a MOS.

Assuming the alternating generator property, we have two chains of generator g0 (going right). The two cases are:

O-O-...-O (m notes)
O-O-...-O (m notes)

and

O-O-O-...-O (m notes)
O-O-...-O (m-1 notes).

Label the notes (1,k) and (2,k), 1 ≤ k ≤ m or m-1, for notes in the upper and lower chain respectively.

In case 1, let g1 = (2,1)-(1,m) and g2 = (1,1)-(2,m). The circle of stacked g0 generators is (starting from top left): (m-1 g0's) g1 (m-1 g0's) g2. A scale step is always a same number k (which must be odd) of such generators gi. Assume (after taking octave complement) that a single step takes less than half of the generators. So a word corresponding to the scale step is formed by one of:

• k g0
• (k-1) g0 + g1
• (k-1) g0 + g2.

It is clear that the last two sizes must occur the same number of times.

In case 2, let (2,1)-(1,1) = g1, (1,2)-(2,1) = g2 be the two alternating generators. Let g3 be the leftover generator after stacking alternating g1 and g2. Then the generator circle looks like g1 g2 g1 g2 ... g1 g2 g3. Then the generators corresponding to a step are:

• k g1 + (k-1) g2
• (k-1) g1 + k g2
• (k-1) g1 + (k-1) g2 + g3

if a step is an odd number of generators (since the scale size is odd, we can always ensure this by taking octave complements of all the generators). The first two sizes must occur the same number of times. QED.

MV3 Theorem 2

Once you have chosen a rank-3 temperament and a specific generator interval, there is a mechanical procedure to generate all max-variety-3 scales of a certain size (of which there are, however, infinitely many).