Generator-offset property: Difference between revisions
Tags: Mobile edit Mobile web edit |
No edit summary Tags: Mobile edit Mobile web edit |
||
Line 69: | Line 69: | ||
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*g<sub>1</sub> − 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 '''Z'''-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*g<sub>1</sub> − 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 '''Z'''-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 GO it is well-formed with respect to 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, all multiples of the generator g must be even-steps, and those intervals that are "offset" by g<sub>1</sub> must be odd-steps. Letting ''M'' be the subset 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 | Since ''S'' is GO it is well-formed with respect to 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, all multiples of the generator g must be even-steps, and those intervals that are "offset" by g<sub>1</sub> must be odd-steps. Letting ''M'' be the subset 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 interval class (''k''-steps) reached by stacking ''r'' generators: | Let ''r'' be odd and ''r'' ≥ 3. Consider the following abstract sizes for the interval class (''k''-steps) reached by stacking ''r'' generators: | ||
Line 78: | Line 78: | ||
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, abstractly 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). | 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, abstractly 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). | ||
===== Statement (2) ===== | ===== Statement (2) ===== | ||
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>. Assuming that a step is an odd number of generators, 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>. Assuming that a step is an odd number of generators, the combinations of alternants corresponding to a step come in exactly 3 sizes: |