Generator-offset property: Difference between revisions

Inthar (talk | contribs)
No edit summary
Tags: Mobile edit Mobile web edit
Inthar (talk | contribs)
No edit summary
Tags: Mobile edit Mobile web edit
Line 59: Line 59:
# ''a''<sub>4</sub> &minus; ''a''<sub>2</sub> = ''g''<sub>1</sub> &minus; 2 ''g''<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; 2 ''g''<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-cardinality, unconditionally MV3, AG scale must be of the form ''xy...xyxz''. But this pattern is not unconditionally MV3 if ''n'' ≥ 6, since 3-steps come in 4 sizes: ''xyx'', ''yxy'', ''yxz'' and ''xzx''. Thus ''n'' = 4 and the scale is ''xyxz''.
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, since 3-steps come in 4 sizes: ''xyx'', ''yxy'', ''yxz'' and ''xzx''. Thus ''n'' = 4 and the scale is ''xyxz''. This proves (3).


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 are:
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 are: