Generator-offset property: Difference between revisions

Inthar (talk | contribs)
m hmm this whole thing's wrong
Inthar (talk | contribs)
No edit summary
Line 27: Line 27:
* A strengthening of the generator-offset property, tentatively named the ''swung-generator-alternant property'' (SGA), states that the alternants g<sub>1</sub> and g<sub>2</sub> can be taken to always subtend the same number of scale steps, thus both representing "detemperings" of a generator of a single-period [[mos]] scale (otherwise known as a well-formed scale). All odd GO scales are SGA, and aside from odd GO scales, only xyxz satisfies this property. The Zarlino and diasem scales above are both SGA. [[Blackdye]] is GO but not SGA.
* A strengthening of the generator-offset property, tentatively named the ''swung-generator-alternant property'' (SGA), states that the alternants g<sub>1</sub> and g<sub>2</sub> can be taken to always subtend the same number of scale steps, thus both representing "detemperings" of a generator of a single-period [[mos]] scale (otherwise known as a well-formed scale). All odd GO scales are SGA, and aside from odd GO scales, only xyxz satisfies this property. The Zarlino and diasem scales above are both SGA. [[Blackdye]] is GO but not SGA.


== Theorems ==<!--
== Theorems ==
=== Proposition 1 (Properties of SGA scales) ===  
=== Proposition 1 (Properties of SGA scales) ===  
Let ''S'' be a 3-step-size scale word in L, M, and s of length ''n'', and suppose ''S'' is SGA. Then:
Let ''S'' be a 3-step-size scale word in L, M, and s of length ''n'', and suppose ''S'' is SGA. Then:
# The length of ''S'' is odd, or ''S'' is equivalent to xxx...xyxz.
# The length of ''S'' is odd, or ''S'' is equivalent to (xy)<sup>''r''</sup>xz for some integer ''r'' ≥ 1.
# ''S'' is of the form ''a''x ''b''y ''b''z for some permutation (x, y, z) of (L, M, s).
# ''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).
Line 56: Line 56:
In case 1, let g<sub>1</sub> = (2, 1) &minus; (1, 1), g<sub>2</sub> = (1, 2) &minus; (2, 1), and g<sub>3</sub> = (1, 1) &minus; (''n''/2, 2) = (&minus;''n''/2*g<sub>1</sub> &minus; g<sub>1</sub> &minus; ''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) &minus; (1, 1), g<sub>2</sub> = (1, 2) &minus; (2, 1), and g<sub>3</sub> = (1, 1) &minus; (''n''/2, 2) = (&minus;''n''/2*g<sub>1</sub> &minus; g<sub>1</sub> &minus; ''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>). Thus all multiples of the generator g must be an even number of steps, and those intervals that are "offset" by g<sub>1</sub> must be an odd number of steps. Letting ''M'' be the subset of all even-numbered notes (which are generated by g) and considering ''M'' as a scale by dividing interval 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.
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 an even number of steps, and those intervals that are "offset" by g<sub>1</sub> must be an odd number of steps. Letting ''M'' be the subset of all even-numbered notes (which are generated by g) and considering ''M'' as a scale by dividing interval 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.


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 70: Line 70:
# a<sub>4</sub> &minus; a<sub>2</sub> = g<sub>1</sub> &minus; 2g<sub>2</sub> + g<sub>3</sub> = (g<sub>3</sub> &minus; g<sub>2</sub>) + (g<sub>1</sub> &minus; g<sub>2</sub>) = (chroma ± ε) ≠ 0 by choice of tuning.
# a<sub>4</sub> &minus; a<sub>2</sub> = g<sub>1</sub> &minus; 2g<sub>2</sub> + g<sub>3</sub> = (g<sub>3</sub> &minus; g<sub>2</sub>) + (g<sub>1</sub> &minus; 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-length, unconditionally SV3, GO scale must be of the form xy...xyxz. But this pattern is not abstractly SV3 if ''n'' ≥ 6, since 3-steps come in 4 sizes: xyx, yxy, yxz and xzx. Thus ''n'' = 4 and the scale is xyxz. (Note that xyxz 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) &minus; (1, 1) = g<sub>1</sub>, (1, 2) &minus; (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) &minus; (1, 1) = g<sub>1</sub>, (1, 2) &minus; (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: