Generator-offset property: Difference between revisions
m →Proof |
m →Proof |
||
Line 64: | Line 64: | ||
# 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. 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-length, unconditionally SV3, GO 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). | |||
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-length, unconditionally SV3, GO 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). | |||
In case 2, 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 leftover generator after stacking alternating g<sub>1</sub> and g<sub>2</sub>. Then the generator circle looks like g<sub>1</sub> g<sub>2</sub> g<sub>1</sub> g<sub>2</sub> ... g<sub>1</sub> g<sub>2</sub> g<sub>3</sub>. Then the combinations of alternants corresponding to a step come in exactly 3 sizes: | In case 2, 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 leftover generator after stacking alternating g<sub>1</sub> and g<sub>2</sub>. Then the generator circle looks like g<sub>1</sub> g<sub>2</sub> g<sub>1</sub> g<sub>2</sub> ... g<sub>1</sub> g<sub>2</sub> g<sub>3</sub>. Then the combinations of alternants corresponding to a step come in exactly 3 sizes: |