Generator-offset property: Difference between revisions
Line 26: | Line 26: | ||
In case 1, let ''g''<sub>1</sub> = (2,1) − (1,1) and ''g''<sub>2</sub> = (1,2) − (2,1). 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>. | In case 1, let ''g''<sub>1</sub> = (2,1) − (1,1) and ''g''<sub>2</sub> = (1,2) − (2,1). 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>. | ||
Let ''r'' be odd and ''r'' | Let ''r'' be odd and ''r'' ≥ 3. Consider the following abstract sizes for the interval class reached by stacking ''r'' generators: | ||
# from ''g''<sub>1</sub> ... ''g''<sub>1</sub>, we get ''a''<sub>1</sub> = (''r'' − 1)/2*''g''<sub>0</sub> + ''g''<sub>1</sub> = (''r'' + 1)/2 ''g''<sub>1</sub> + (''r'' − 1)/2 ''g''<sub>2</sub> | # from ''g''<sub>1</sub> ... ''g''<sub>1</sub>, we get ''a''<sub>1</sub> = (''r'' − 1)/2*''g''<sub>0</sub> + ''g''<sub>1</sub> = (''r'' + 1)/2 ''g''<sub>1</sub> + (''r'' − 1)/2 ''g''<sub>2</sub> | ||
# from ''g''<sub>2</sub> ... ''g''<sub>2</sub>, we get ''a''<sub>2</sub> = (''r'' − 1)/2*''g''<sub>0</sub> + ''g''<sub>2</sub> = (''r'' − 1)/2 ''g''<sub>1</sub> + (''r'' + 1)/2 ''g''<sub>2</sub> | # from ''g''<sub>2</sub> ... ''g''<sub>2</sub>, we get ''a''<sub>2</sub> = (''r'' − 1)/2*''g''<sub>0</sub> + ''g''<sub>2</sub> = (''r'' − 1)/2 ''g''<sub>1</sub> + (''r'' + 1)/2 ''g''<sub>2</sub> | ||
Line 38: | Line 38: | ||
# ''a''<sub>4</sub> − ''a''<sub>2</sub> = ''g''<sub>1</sub> − 2 ''g''<sub>2</sub> + ''g''<sub>3</sub> = (''g''<sub>3</sub> − ''g''<sub>2</sub>) + (''g''<sub>1</sub> − ''g''<sub>2</sub>) = (chroma ± ε) != 0 by choice of tuning. | # ''a''<sub>4</sub> − ''a''<sub>2</sub> = ''g''<sub>1</sub> − 2 ''g''<sub>2</sub> + ''g''<sub>3</sub> = (''g''<sub>3</sub> − ''g''<sub>2</sub>) + (''g''<sub>1</sub> − ''g''<sub>2</sub>) = (chroma ± ε) != 0 by choice of tuning. | ||
By applying this argument to 1-steps, we see that there must be 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-cardinality, unconditionally MV3, AG scale must be of the form ''xy...xyxz''. But this pattern is not unconditionally MV3 if ''n'' | By applying this argument to 1-steps, we see that there must be 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-cardinality, unconditionally MV3, AG scale must be of the form ''xy...xyxz''. But this pattern is not unconditionally MV3 if ''n'' ≥ 6, 3-steps come in 4 sizes: ''xyx'', ''yxy'', ''yxz'' and | ||
''xzx''. Thus ''n'' = 4 and the scale is ''xyxz''. | ''xzx''. Thus ''n'' = 4 and the scale is ''xyxz''. | ||
Line 47: | Line 47: | ||
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. | 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. | ||
(The above holds for any odd ''n'' | (The above holds for any odd ''n'' ≥ 3.) | ||
Now we only need to see that AG + odd cardinality => unconditionally MV3. But the argument in case 2 above works for any interval class (unconditional MV3 wasn't used), hence any interval class comes in at most 3 sizes regardless of tuning. | Now we only need to see that AG + odd cardinality => unconditionally MV3. But the argument in case 2 above works for any interval class (unconditional MV3 wasn't used), hence any interval class comes in at most 3 sizes regardless of tuning. |