Ternary scale theorems: Difference between revisions
No edit summary |
m →Theorem 1 (Properties of SGA scales): "abstractly SV3" -> "ternary"; various minor corrections and clarifying edits. |
||
| Line 31: | Line 31: | ||
# If ''n'' is odd, ''s'' is of the form ''a'''''x''' ''b'''''y''' ''b'''''z''' for some permutation ('''x''', '''y''', '''z''') of ('''L''', '''M''', '''s'''). | # If ''n'' is odd, ''s'' is of the form ''a'''''x''' ''b'''''y''' ''b'''''z''' for some permutation ('''x''', '''y''', '''z''') of ('''L''', '''M''', '''s'''). | ||
# If ''n'' is odd, ''s'' is abstractly SV3 (i.e. SV3 for almost all tunings). | # If ''n'' is odd, ''s'' is abstractly SV3 (i.e. SV3 for almost all tunings). | ||
# If ''n'' is odd, ''s'' = ''a'''''X''' ''b'''''Y''' ''b'''''Z''' is obtained from some mode of the (primitive) | # If ''n'' is odd, ''s'' = ''a'''''X''' ''b'''''Y''' ''b'''''Z''' is obtained from some mode of the (primitive) MOS ''a'''''X''' 2''b'''''W''' by replacing all the W's successively with alternating '''Y''''s and '''Z''''s (or alternating '''Z''''s and '''Y''''s for the other chirality, fixing the mode of ''a'''''X''' 2''b'''''W'''). The two alternants differ by replacing one '''Y''' with a '''Z'''. | ||
# If ''n'' is odd, ''s'' is pairwise- | # If ''n'' is odd, ''s'' is pairwise-MOS. That is, the following operations each result in a [[MOS]]: setting '''L''' = '''M''', setting '''L''' = '''s''', and setting '''M''' = '''s'''. | ||
In particular, odd generator-offset scales always satisfy these properties (see Proposition 2 below). | In particular, odd generator-offset scales always satisfy these properties (see Proposition 2 below). | ||
| Line 53: | Line 53: | ||
In case 1, let '''g'''<sub>1</sub> = (2, 1) − (1, 1), '''g'''<sub>2</sub> = (1, 2) − (2, 1), and '''g'''<sub>3</sub> = (1, 1) − (''n''/2, 2) = ((−''n''/2 − 1)*'''g'''<sub>1</sub> − ''n''/2*'''g'''<sub>2</sub>) mod '''e'''. We assume that '''g'''<sub>1</sub>, '''g'''<sub>2</sub> and '''e''' are ℤ-linearly independent. We have the chain '''g'''<sub>1</sub> '''g'''<sub>2</sub> '''g'''<sub>1</sub> '''g'''<sub>2</sub> ... '''g'''<sub>1</sub> '''g'''<sub>3</sub> which visits every note in ''s''. | In case 1, let '''g'''<sub>1</sub> = (2, 1) − (1, 1), '''g'''<sub>2</sub> = (1, 2) − (2, 1), and '''g'''<sub>3</sub> = (1, 1) − (''n''/2, 2) = ((−''n''/2 − 1)*'''g'''<sub>1</sub> − ''n''/2*'''g'''<sub>2</sub>) mod '''e'''. We assume that '''g'''<sub>1</sub>, '''g'''<sub>2</sub> and '''e''' are ℤ-linearly independent. We have the chain '''g'''<sub>1</sub> '''g'''<sub>2</sub> '''g'''<sub>1</sub> '''g'''<sub>2</sub> ... '''g'''<sub>1</sub> '''g'''<sub>3</sub> which visits every note in ''s''. | ||
Since ''s'' is generator-offset it is well-formed with respect to the aggregate generator '''g''' = ('''g'''<sub>2</sub> + '''g'''<sub>1</sub>). Since '''g'''<sub>1</sub> and '''g'''<sub>2</sub> subtend the same number of steps, | Since ''s'' is generator-offset it is well-formed with respect to the aggregate generator '''g''' = ('''g'''<sub>2</sub> + '''g'''<sub>1</sub>). Since '''g'''<sub>1</sub> and '''g'''<sub>2</sub> subtend the same number of steps by the SGA assumption, each is an odd-step. All multiples of the aggregate generator '''g''' must be even-steps, and those dyads that are "offset" by '''g'''<sub>1</sub> must be odd-steps. Letting ''M'' be the subset consisting of all even-numbered notes (which are generated by '''g''') and considering ''M'' as a scale by dividing degree indices in ''M'' by two, ''M'' is well-formed with respect to '''g''', thus ''M'' (and its offset) must be a MOS subset. Hence ('''g'''<sub>3</sub> + '''g'''<sub>1</sub>), the imperfect generator of the MOS generated by '''g''', subtends the same number of steps as '''g'''. Thus '''g'''<sub>2</sub> and '''g'''<sub>3</sub> subtend the same number of steps, a fact we need in order to be able to substitute one instance of '''g'''<sub>2</sub> with '''g'''<sub>3</sub> in the next part. | ||
Let ''r'' be odd and ''r'' ≥ 3. Consider the following abstract sizes for the dyad class of ''k''-steps reached by stacking ''r'' generators: | Let ''r'' be odd and ''r'' ≥ 3. Consider the following abstract sizes for the dyad class of ''k''-steps reached by stacking ''r'' generators: | ||
| Line 61: | Line 61: | ||
# from '''g'''<sub>1</sub> (...odd # of gens...) '''g'''<sub>1</sub> '''g'''<sub>3</sub> '''g'''<sub>1</sub> (...odd # of gens...) '''g'''<sub>1</sub>, we get a<sub>4</sub> = (''r'' + 1)/2 '''g'''<sub>1</sub> + (''r'' − 3)/2 '''g'''<sub>2</sub> + '''g'''<sub>3</sub> ≡ (''r'' − ''n''/2 − 1/2)'''g'''<sub>1</sub> + (''r'' − ''n''/2 − 3/2)'''g'''<sub>2</sub> mod e. | # from '''g'''<sub>1</sub> (...odd # of gens...) '''g'''<sub>1</sub> '''g'''<sub>3</sub> '''g'''<sub>1</sub> (...odd # of gens...) '''g'''<sub>1</sub>, we get a<sub>4</sub> = (''r'' + 1)/2 '''g'''<sub>1</sub> + (''r'' − 3)/2 '''g'''<sub>2</sub> + '''g'''<sub>3</sub> ≡ (''r'' − ''n''/2 − 1/2)'''g'''<sub>1</sub> + (''r'' − ''n''/2 − 3/2)'''g'''<sub>2</sub> mod e. | ||
Since ''n'' > 0, these are all distinct by ℤ-linear independence; hence there are at least 4 sizes for ''k''-steps. A 1-step must be reached by stacking an odd number of generators, thus by applying this argument to 1-steps, we see that there must be at least 4 step sizes in some tuning, a contradiction. Thus '''g'''<sub>1</sub> and '''g'''<sub>2</sub> must themselves be step sizes. Thus we see that an even-length | Since ''n'' > 0, these are all distinct by ℤ-linear independence; hence there are at least 4 sizes for ''k''-steps. A 1-step must be reached by stacking an odd number of generators, thus by applying this argument to 1-steps, we see that there must be at least 4 step sizes in some tuning, a contradiction. Thus '''g'''<sub>1</sub> and '''g'''<sub>2</sub> must themselves be step sizes. Thus we see that an even-length SGA ternary scale must be of the form (xy)<sup>''r''</sup>xz. (Note that (xy)<sup>''r''</sup>xz is not SV3, since it has only two kinds of 2-steps, '''xy''' and '''xz'''.) This proves (1). | ||
==== Statement (2) ==== | ==== Statement (2) ==== | ||
In case 2, let ''n'' ≥ 3 and let (2, 1) − (1, 1) = '''g'''<sub>1</sub>, (1, 2) − (2, 1) = '''g'''<sub>2</sub> be the two alternants. Let '''g'''<sub>3</sub> be the | In case 2, let ''n'' ≥ 3 and let (2, 1) − (1, 1) = '''g'''<sub>1</sub>, (1, 2) − (2, 1) = '''g'''<sub>2</sub> be the two alternants. Let '''g'''<sub>3</sub> be the closing generator after stacking alternating '''g'''<sub>1</sub> and '''g'''<sub>2</sub>. Then the generator circle is ('''g'''<sub>1</sub> '''g'''<sub>2</sub>)<sup>floor(''n''/2)</sup> '''g'''<sub>3</sub>. If a step is formed by stacking ''k'' generators, we may assume that ''k'' is odd, and the combinations of alternants corresponding to a step come in exactly 3 sizes: | ||
# ceil(''k''/2)'''g'''<sub>1</sub> + floor(''k''/2)'''g'''<sub>2</sub> | # ceil(''k''/2)'''g'''<sub>1</sub> + floor(''k''/2)'''g'''<sub>2</sub> | ||
# floor(''k''/2)'''g'''<sub>1</sub> + ceil(''k''/2)'''g'''<sub>2</sub> | # floor(''k''/2)'''g'''<sub>1</sub> + ceil(''k''/2)'''g'''<sub>2</sub> | ||
# floor(''k''/2)'''g'''<sub>1</sub> + floor(''k''/2) '''g'''<sub>2</sub> + '''g'''<sub>3</sub> | # floor(''k''/2)'''g'''<sub>1</sub> + floor(''k''/2) '''g'''<sub>2</sub> + '''g'''<sub>3</sub> | ||
(since the scale size is odd, we can always ensure this by taking octave complements of all the generators). By counting the length-k subwords of the (linear) word ('''g'''<sub>1</sub> '''g'''<sub>2</sub>)<sup>floor(''n''/2)</sup>, we see that the first two sizes must both occur (''n'' − ''k'') times. This proves (2). | (since the scale size is odd, we can always ensure this by taking octave complements of all the generators). By counting the length-''k'' subwords of the (linear) word ('''g'''<sub>1</sub> '''g'''<sub>2</sub>)<sup>floor(''n''/2)</sup>, we see that the first two sizes must both occur (''n'' − ''k'')/2 times. This proves (2). | ||
==== Statement (3) ==== | ==== Statement (3) ==== | ||
| Line 76: | Line 76: | ||
Assume ''s'' is ''a'''''X''' ''b'''''Y''' ''b'''''Z''', ''a'' odd. If ''b'' = 1, there's nothing to prove, so assume ''b'' > 1. | Assume ''s'' is ''a'''''X''' ''b'''''Y''' ''b'''''Z''', ''a'' odd. If ''b'' = 1, there's nothing to prove, so assume ''b'' > 1. | ||
Assume, possibly after inverting the generator, that the imperfect generator of ''T'' has ''j'' + 1 '''W''''s and the perfect generator has ''j'' '''W''''s. Consider the two alternants, detemperings of the generator ''i'''''X''' + ''j'''''W''' of the ''a'''''X''' 2''b'''''W''' | Assume, possibly after inverting the generator, that the imperfect generator of ''T'' has ''j'' + 1 '''W''''s and the perfect generator has ''j'' '''W''''s. Consider the two alternants, detemperings of the generator ''i'''''X''' + ''j'''''W''' of the ''a'''''X''' 2''b'''''W''' MOS ''T''('''X''', '''W''') = ''s''('''X''', '''W''', '''W''') where gcd(''j'', 2''k'') = 1. | ||
'''Claim 1''': Deleting '''X''''s from the alternant subwords of ''s'' gives every ''j''-step subword in the scale ''E''<sub>X</sub>(''s'')('''Y''', '''Z'''), the scale word obtained by deleting all '''X''''s from ''s''. | '''Claim 1''': Deleting '''X''''s from the alternant subwords of ''s'' gives every ''j''-step subword in the scale ''E''<sub>X</sub>(''s'')('''Y''', '''Z'''), the scale word obtained by deleting all '''X''''s from ''s''. | ||
| Line 92: | Line 92: | ||
x x x ... x | x x x ... x | ||
x x x ... x x | x x x ... x x | ||
and use the vectors (-1, 2) and (ceil(n/2), 1) as the Fokker block chromas. A rank-3 Fokker block has the property that tempering out by each of the chromas gives two | and use the vectors (-1, 2) and (ceil(n/2), 1) as the Fokker block chromas. A rank-3 Fokker block has the property that tempering out by each of the chromas gives two MOSes. These correspond to two of the temperings '''X''' = '''Y''', '''Y''' = '''Z''' and '''X''' = '''Z'''. The third tempering follows by symmetry (by taking the other chirality). {{qed}} | ||
== Theorem 2 (Odd generator-offset scales are SGA) == | == Theorem 2 (Odd generator-offset scales are SGA) == | ||