Ternary scale theorems: Difference between revisions
| Line 58: | Line 58: | ||
# 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. | ||
These are all distinct by '''Z'''-linear independence. | These are all distinct by '''Z'''-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, abstractly SV3, generator-offset 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) ==== | ||