Ternary scale theorems: Difference between revisions

Inthar (talk | contribs)
Inthar (talk | contribs)
No edit summary
Line 7: Line 7:
** If ''s'' is a circular word and {{nowrap|''i'' < 0}} or {{nowrap|''i'' ≥ len(''s'')}}, we first replace ''i'' with {{nowrap|''i'' % len(''s'')}} before using it as an argument in ''s''[-].
** If ''s'' is a circular word and {{nowrap|''i'' < 0}} or {{nowrap|''i'' ≥ len(''s'')}}, we first replace ''i'' with {{nowrap|''i'' % len(''s'')}} before using it as an argument in ''s''[-].
* The notation ''s''('''X'''<sub>1</sub>, ..., '''X'''<sub>''r''</sub>) is used for an ''r''-ary scale word with variables '''X'''<sub>1</sub>, ..., '''X'''<sub>''r''</sub> possibly standing in for any sizes. If {{nowrap|''s''('''X''', '''Y''') {{=}} '''XXY'''}} then {{nowrap|''s''('''A''', '''B''') {{=}} '''AAB'''}}.
* The notation ''s''('''X'''<sub>1</sub>, ..., '''X'''<sub>''r''</sub>) is used for an ''r''-ary scale word with variables '''X'''<sub>1</sub>, ..., '''X'''<sub>''r''</sub> possibly standing in for any sizes. If {{nowrap|''s''('''X''', '''Y''') {{=}} '''XXY'''}} then {{nowrap|''s''('''A''', '''B''') {{=}} '''AAB'''}}.
* We leave the distinction between linear words (words in the ordinary sense) and circular words up to context. We usually also elide the distinction between subwords and the dyad sizes that subtend them.
* We leave the distinction between linear words (words in the ordinary sense) and circular words up to context. We usually also elide the distinction between subwords and the interval sizes that subtend them.
* For a word ''w'' and letter '''x''', {{abs|''w''}}<sub>'''x'''</sub> denotes the number of occurrences of the letter '''x''' in ''w''. For a step vector size '''v''', {{abs|'''v'''}}<sub>'''x'''</sub> is similar.
* For a word ''w'' and letter '''x''', {{abs|''w''}}<sub>'''x'''</sub> denotes the number of occurrences of the letter '''x''' in ''w''. For a step vector size '''v''', {{abs|'''v'''}}<sub>'''x'''</sub> is similar.


== Definitions ==
== Definitions ==
* ''Dyad'' is used for the musical sense of ''interval'' to avoid confusion with the mathematical sense of ''interval''. But strictly speaking, ''interval'' in the musical sense is different than ''dyad''. (An octave is an interval but not a dyad, and a 2:3:4 chord is a dyad but not an interval.)
* A circular word ''s'' (representing the steps of a [[periodic scale]]) of size ''n'' is '''generator-offset''' if it satisfies the following properties. The following conditions do not imply that '''g'''<sub>1</sub> and '''g'''<sub>2</sub> are the same number of scale steps. For example, 5-limit [[blackdye]] has {{nowrap|'''g'''<sub>1</sub> {{=}} {{sfrac|9|5}}}} (a 9-step) and {{nowrap|'''g'''<sub>2</sub> {{=}} {{sfrac|5|3}}}} (a 7-step).
* A circular word ''s'' (representing the steps of a [[periodic scale]]) of size ''n'' is '''generator-offset''' if it satisfies the following properties. The following conditions do not imply that '''g'''<sub>1</sub> and '''g'''<sub>2</sub> are the same number of scale steps. For example, 5-limit [[blackdye]] has {{nowrap|'''g'''<sub>1</sub> {{=}} {{sfrac|9|5}}}} (a 9-step) and {{nowrap|'''g'''<sub>2</sub> {{=}} {{sfrac|5|3}}}} (a 7-step).
*# ''s'' is generated by two chains of stacked generators g separated by a fixed offset δ; either both chains are of size {{sfrac|''n''|2}}, or one chain has size {{sfrac|''n'' + 1|2}} and the second has size {{sfrac|''n'' − 1|2}}. Equivalently, ''s'' can be built by stacking a single chain of alternants '''g'''<sub>1</sub> and '''g'''<sub>2</sub>, resulting in a circle of the form either '''g'''<sub>1</sub> '''g'''<sub>2</sub> ... '''g'''<sub>1</sub> '''g'''<sub>2</sub> '''g'''<sub>1</sub> '''g'''<sub>3</sub> or '''g'''<sub>1</sub> '''g'''<sub>2</sub> ... '''g'''<sub>1</sub> '''g'''<sub>2</sub> '''g'''<sub>3</sub>.
*# ''s'' is generated by two chains of stacked generators g separated by a fixed offset δ; either both chains are of size {{sfrac|''n''|2}}, or one chain has size {{sfrac|''n'' + 1|2}} and the second has size {{sfrac|''n'' − 1|2}}. Equivalently, ''s'' can be built by stacking a single chain of alternants '''g'''<sub>1</sub> and '''g'''<sub>2</sub>, resulting in a circle of the form either '''g'''<sub>1</sub> '''g'''<sub>2</sub> ... '''g'''<sub>1</sub> '''g'''<sub>2</sub> '''g'''<sub>1</sub> '''g'''<sub>3</sub> or '''g'''<sub>1</sub> '''g'''<sub>2</sub> ... '''g'''<sub>1</sub> '''g'''<sub>2</sub> '''g'''<sub>3</sub>.
Line 63: Line 62:
In case 1, let {{nowrap|'''g'''<sub>1</sub> {{=}} (2, 1) − (1, 1)|'''g'''<sub>2</sub> {{=}} (1, 2) − (2, 1)}}, and {{nowrap|'''g'''<sub>3</sub> {{=}} (1, 1) − ({{frac|''n''|2}}, 2)}} {{nowrap|{{=}} ((−{{frac|''n''|2}} − 1)*'''g'''<sub>1</sub> − {{frac|''n''|2}}*'''g'''<sub>2</sub>) (mod '''e''')}}. We assume that '''g'''<sub>1</sub>, '''g'''<sub>2</sub> and '''e''' are ℤ-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 {{nowrap|'''g'''<sub>1</sub> {{=}} (2, 1) − (1, 1)|'''g'''<sub>2</sub> {{=}} (1, 2) − (2, 1)}}, and {{nowrap|'''g'''<sub>3</sub> {{=}} (1, 1) − ({{frac|''n''|2}}, 2)}} {{nowrap|{{=}} ((−{{frac|''n''|2}} − 1)*'''g'''<sub>1</sub> − {{frac|''n''|2}}*'''g'''<sub>2</sub>) (mod '''e''')}}. We assume that '''g'''<sub>1</sub>, '''g'''<sub>2</sub> and '''e''' are ℤ-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 generator-offset it is well-formed with respect to the aggregate generator {{nowrap|'''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 by the AGS assumption, each is an odd-step. All multiples of the aggregate generator '''g''' must be even-steps, and those dyads that are "offset" by '''g'''<sub>1</sub> must be odd-steps. Letting ''M'' be the subset consisting 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 {{nowrap|('''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.
Since ''s'' is generator-offset it is well-formed with respect to the aggregate generator {{nowrap|'''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 by the AGS assumption, each is an odd-step. All multiples of the aggregate 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 consisting 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 {{nowrap|('''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'' &ge; 3. Consider the following abstract sizes for the dyad class of ''k''-steps reached by stacking ''r'' generators:
Let ''r'' be odd and ''r'' &ge; 3. Consider the following abstract sizes for the interval class of ''k''-steps reached by stacking ''r'' generators:
# from '''g'''<sub>1</sub> '''g'''<sub>2</sub> ... '''g'''<sub>1</sub>, we get {{nowrap|''a''<sub>1</sub> {{=}} {{sfrac|''r'' − 1|2}} * '''g''' + '''g'''<sub>1</sub>}} {{nowrap|{{=}} {{ceil|{{frac|''r''|2}}}} '''g'''<sub>1</sub> + {{floor|{{frac|''r''|2}}}} '''g'''<sub>2</sub>}}
# from '''g'''<sub>1</sub> '''g'''<sub>2</sub> ... '''g'''<sub>1</sub>, we get {{nowrap|''a''<sub>1</sub> {{=}} {{sfrac|''r'' − 1|2}} * '''g''' + '''g'''<sub>1</sub>}} {{nowrap|{{=}} {{ceil|{{frac|''r''|2}}}} '''g'''<sub>1</sub> + {{floor|{{frac|''r''|2}}}} '''g'''<sub>2</sub>}}
# from '''g'''<sub>2</sub> '''g'''<sub>1</sub> ... '''g'''<sub>2</sub>, we get {{nowrap|''a''<sub>2</sub> {{=}} {{sfrac|''r'' − 1|2}} * '''g''' + '''g'''<sub>2</sub>}} {{nowrap|{{=}} {{floor|{{frac|''r''|2}}}} '''g'''<sub>1</sub> + {{ceil|{{frac|''r''|2}}}} '''g'''<sub>2</sub>}}
# from '''g'''<sub>2</sub> '''g'''<sub>1</sub> ... '''g'''<sub>2</sub>, we get {{nowrap|''a''<sub>2</sub> {{=}} {{sfrac|''r'' − 1|2}} * '''g''' + '''g'''<sub>2</sub>}} {{nowrap|{{=}} {{floor|{{frac|''r''|2}}}} '''g'''<sub>1</sub> + {{ceil|{{frac|''r''|2}}}} '''g'''<sub>2</sub>}}
Line 82: Line 81:


==== Statement (3) ====
==== Statement (3) ====
We only need to see that if len(''s'') is odd and ''s'' is AGS, ''s'' is abstractly SV3. But the argument in case 2 above works when you substitute any odd-step dyad classes in ''s'' instead of a 1-step (abstract SV3 wasn't used). To get even-step dyad classes, we can take octave complements. Hence any dyad class in such a scale comes in (abstractly) exactly 3 sizes.
We only need to see that if len(''s'') is odd and ''s'' is AGS, ''s'' is abstractly SV3. But the argument in case 2 above works when you substitute any odd-step interval classes in ''s'' instead of a 1-step (abstract SV3 wasn't used). To get even-step interval classes, we can take octave complements. Hence any interval class in such a scale comes in (abstractly) exactly 3 sizes.


==== Statement (4) ====
==== Statement (4) ====
Line 146: Line 145:


==== Two sizes of ''k''-steps in ''s'' project to ''s''<sub>1</sub>'s perfect generator ====
==== Two sizes of ''k''-steps in ''s'' project to ''s''<sub>1</sub>'s perfect generator ====
We can write sizes of dyads in ''s'' as vectors {{nowrap|(''p'', ''q'', ''r'')}} using the basis {{nowrap|('''a''', '''b''', '''c''')}}.  
We can write sizes of intervals in ''s'' as vectors {{nowrap|(''p'', ''q'', ''r'')}} using the basis {{nowrap|('''a''', '''b''', '''c''')}}.  


Suppose for sake of contradiction that only one size of ''k''-step {{nowrap|('''α''', '''β''', '''γ''')}} in ''s'' projects to '''P''' in ''s''<sub>1</sub>. Then projecting to ''s''<sub>2</sub> shows that ''s''<sub>2</sub>'s generator is the ''k''-step {{nowrap|(α + γ)*('''a'''~'''c''') + β'''b'''}}, and Σ<sub>2</sub>'s imperfect generator is located at index ''n'', like Σ<sub>1</sub>'s imperfect generator is. Then ''s''<sub>1</sub> and ''s''<sub>2</sub> are the same mode of the same MOS pattern (up to knowing which step size is the bigger one). Assume the '''L''' of ''s''<sub>1</sub> (it could be '''s''', but it doesn't matter) is the result of identifying '''b''' and '''c''', and all '''s''' steps in ''s''<sub>1</sub> come from '''a'''. Then the steps of ''s''<sub>2</sub> corresponding to the '''L''' of ''s''<sub>1</sub> must be either all '''b''''s or all '''a'''~'''c''''s, thus these steps are all '''b''''s in ''s'' (otherwise they would be identified with the '''a''', against the assumption that ''s''<sub>1</sub> and ''s''<sub>2</sub> are the same MOS pattern and mode). So ''s'' has only two step sizes (a and b), contradicting the assumption that ''s'' is ternary.
Suppose for sake of contradiction that only one size of ''k''-step {{nowrap|('''α''', '''β''', '''γ''')}} in ''s'' projects to '''P''' in ''s''<sub>1</sub>. Then projecting to ''s''<sub>2</sub> shows that ''s''<sub>2</sub>'s generator is the ''k''-step {{nowrap|(α + γ)*('''a'''~'''c''') + β'''b'''}}, and Σ<sub>2</sub>'s imperfect generator is located at index ''n'', like Σ<sub>1</sub>'s imperfect generator is. Then ''s''<sub>1</sub> and ''s''<sub>2</sub> are the same mode of the same MOS pattern (up to knowing which step size is the bigger one). Assume the '''L''' of ''s''<sub>1</sub> (it could be '''s''', but it doesn't matter) is the result of identifying '''b''' and '''c''', and all '''s''' steps in ''s''<sub>1</sub> come from '''a'''. Then the steps of ''s''<sub>2</sub> corresponding to the '''L''' of ''s''<sub>1</sub> must be either all '''b''''s or all '''a'''~'''c''''s, thus these steps are all '''b''''s in ''s'' (otherwise they would be identified with the '''a''', against the assumption that ''s''<sub>1</sub> and ''s''<sub>2</sub> are the same MOS pattern and mode). So ''s'' has only two step sizes (a and b), contradicting the assumption that ''s'' is ternary.
Line 189: Line 188:
# the stack has only copies of '''Q''' and '''R'''; or
# the stack has only copies of '''Q''' and '''R'''; or
# the stack has one '''T''' and does not contain any '''R''' (since it's more than {{nowrap|''f'' − 1}} generators away).
# the stack has one '''T''' and does not contain any '''R''' (since it's more than {{nowrap|''f'' − 1}} generators away).
These give exactly three distinct sizes for every dyad class. Hence ''s'' is SV3.
These give exactly three distinct sizes for every interval class. Hence ''s'' is SV3.


In this case ''s'' has two chains of '''Q''', one with {{floor|''n''/2}} notes and one offset by {{nowrap|'''Q'''<sup>(''f'' − 1)</sup>R}} with {{ceil|''n''/2}} notes. Every instance of Q must be a ''k''-step, since by ℤ-linear independence {{nowrap|'''Q''' {{=}} α'''a''' + β'''b''' + γ'''c'''}} is the only way to write '''Q''' in the basis {{nowrap|('''a''', '''b''', '''c''')}}; so ''s'' is well-formed with respect to '''Q'''. Thus ''s'' also satisfies the generator-offset property with generator '''Q'''.
In this case ''s'' has two chains of '''Q''', one with {{floor|''n''/2}} notes and one offset by {{nowrap|'''Q'''<sup>(''f'' − 1)</sup>R}} with {{ceil|''n''/2}} notes. Every instance of Q must be a ''k''-step, since by ℤ-linear independence {{nowrap|'''Q''' {{=}} α'''a''' + β'''b''' + γ'''c'''}} is the only way to write '''Q''' in the basis {{nowrap|('''a''', '''b''', '''c''')}}; so ''s'' is well-formed with respect to '''Q'''. Thus ''s'' also satisfies the generator-offset property with generator '''Q'''.
Line 258: Line 257:
If {{nowrap|''s'' {{=}} ''s''('''X''', '''Y''', '''Z''')}} is even-regular, then:
If {{nowrap|''s'' {{=}} ''s''('''X''', '''Y''', '''Z''')}} is even-regular, then:
# ''s'' consists of two generator chains, each with len(''s'')/2 notes;
# ''s'' consists of two generator chains, each with len(''s'')/2 notes;
# the generator has the same dyad class as some generator of the MOS 2''a'''''W'''&nbsp;2''c'''''Z''';
# the generator has the same interval class as some generator of the MOS 2''a'''''W'''&nbsp;2''c'''''Z''';
# the two generator chains are offset by a len(''s'')/2-step dyad;
# the two generator chains are offset by a len(''s'')/2-step interval;
# ''s'' is [[balanced]].
# ''s'' is [[balanced]].


Line 309: Line 308:
(c) The scale made by taking ''s'' and conflating '''Y''' and '''Z''' into the letter '''W''' must be a MOS. To this scale we may imagine substituting a scale made of an equal amount of '''Y''' and '''Z''' letters into the "slot letters" '''W''' letter by letter. Let ''t''<sub>1</sub> be a length-''k'' subword of the form '''YX'''<sup>''k''-2</sup>'''Y''' under the projection. We may assume that the chunk sizes of the MOS are ''k'' - 2 and ''k'' - 1, or ''k'' - 2 and ''k'' - 3. Either way, there exists some subword with (''k'' - i)-many '''X'''s, i = 1 or 2, and two '''Z'''s. This violates balance because ''t''<sub>1</sub> contains zero '''Z'''s.
(c) The scale made by taking ''s'' and conflating '''Y''' and '''Z''' into the letter '''W''' must be a MOS. To this scale we may imagine substituting a scale made of an equal amount of '''Y''' and '''Z''' letters into the "slot letters" '''W''' letter by letter. Let ''t''<sub>1</sub> be a length-''k'' subword of the form '''YX'''<sup>''k''-2</sup>'''Y''' under the projection. We may assume that the chunk sizes of the MOS are ''k'' - 2 and ''k'' - 1, or ''k'' - 2 and ''k'' - 3. Either way, there exists some subword with (''k'' - i)-many '''X'''s, i = 1 or 2, and two '''Z'''s. This violates balance because ''t''<sub>1</sub> contains zero '''Z'''s.


For 7.1.2: Suppose ''s'' is balanced and has at least three sizes for ''k''-steps, {{nowrap|''a''<sub>''i''</sub>'''X''' + ''b''<sub>''i''</sub>'''Y''' + ''c''<sub>''i''</sub>'''Z''' {{=}} (''a''<sub>''i''</sub>, ''b''<sub>''i''</sub>, ''c''<sub>''i''</sub>)}} for {{nowrap|''i'' ∈ {{(}}1, 2, 3{{)}}}}. We may assume {{nowrap|(''a''<sub>2</sub>, ''b''<sub>2</sub>, ''c''<sub>2</sub>) {{=}} (''a''<sub>1</sub>, ''b''<sub>1</sub> + 1, ''c''<sub>1</sub> − 1)}}. Then either {{nowrap|(''a''<sub>3</sub>, ''b''<sub>3</sub>, ''c''<sub>3</sub>) {{=}} (''a''<sub>1</sub> + 1, ''b''<sub>1</sub>, ''c''<sub>1</sub> − 1)}} or {{nowrap|(''a''<sub>3</sub>, ''b''<sub>3</sub>, ''c''<sub>3</sub>) {{=}} (''a''<sub>1</sub> − 1, ''b''<sub>1</sub> + 1, ''c''<sub>1</sub>)}}. In both cases, by balancedness applied to subwords of length ''k'', the three vectors represent the only possible dyad sizes.
For 7.1.2: Suppose ''s'' is balanced and has at least three sizes for ''k''-steps, {{nowrap|''a''<sub>''i''</sub>'''X''' + ''b''<sub>''i''</sub>'''Y''' + ''c''<sub>''i''</sub>'''Z''' {{=}} (''a''<sub>''i''</sub>, ''b''<sub>''i''</sub>, ''c''<sub>''i''</sub>)}} for {{nowrap|''i'' ∈ {{(}}1, 2, 3{{)}}}}. We may assume {{nowrap|(''a''<sub>2</sub>, ''b''<sub>2</sub>, ''c''<sub>2</sub>) {{=}} (''a''<sub>1</sub>, ''b''<sub>1</sub> + 1, ''c''<sub>1</sub> − 1)}}. Then either {{nowrap|(''a''<sub>3</sub>, ''b''<sub>3</sub>, ''c''<sub>3</sub>) {{=}} (''a''<sub>1</sub> + 1, ''b''<sub>1</sub>, ''c''<sub>1</sub> − 1)}} or {{nowrap|(''a''<sub>3</sub>, ''b''<sub>3</sub>, ''c''<sub>3</sub>) {{=}} (''a''<sub>1</sub> − 1, ''b''<sub>1</sub> + 1, ''c''<sub>1</sub>)}}. In both cases, by balancedness applied to subwords of length ''k'', the three vectors represent the only possible interval sizes.


For 7.1.3: The ternary Fraenkel word may be verified as SV3 by inspection, and we have already shown in Theorem 1 that odd-regular balanced scales are SV3. To show that even-regular balanced scales are ''not'' SV3, observe that {{nowrap|(''a'' + ''c'')}}-steps come in only 2 sizes in such a scale ''s'': {{nowrap|{{floor|''a''/2}}'''X''' + {{ceil|''a''/2}}'''Y''' + ''c'''''Z'''}} and {{nowrap|{{ceil|''a''/2}}'''X''' + {{floor|''a''/2}}'''Y''' + ''c'''''Z'''}}, since the underlying MOS 2''a'''''X'''2''c'''''Y''' only has the {{nowrap|(''a'' + ''c'')}}-step {{nowrap|''a'''''X''' + ''c'''''Z'''}}. The construction replaces the '''X'''s in these subwords with alternating '''X'''s and '''Y'''s; either of '''X''' or '''Y''' may occur first, corresponding to the two possible sizes, since ''a'' is odd and thus the {{nowrap|(''a'' + ''c'')}}-step subword {{nowrap|''s''[''k'' &minus; 1 : ''k'' + ''a'' + ''c'' &minus; 1]}} becomes the subword {{nowrap|''s''[''k'' + ''a'' + ''c'' &minus; 1 : ''k'' + 2''a'' + 2''c'' &minus; 1]}} via interchanging '''X''' and '''Y'''.
For 7.1.3: The ternary Fraenkel word may be verified as SV3 by inspection, and we have already shown in Theorem 1 that odd-regular balanced scales are SV3. To show that even-regular balanced scales are ''not'' SV3, observe that {{nowrap|(''a'' + ''c'')}}-steps come in only 2 sizes in such a scale ''s'': {{nowrap|{{floor|''a''/2}}'''X''' + {{ceil|''a''/2}}'''Y''' + ''c'''''Z'''}} and {{nowrap|{{ceil|''a''/2}}'''X''' + {{floor|''a''/2}}'''Y''' + ''c'''''Z'''}}, since the underlying MOS 2''a'''''X'''2''c'''''Y''' only has the {{nowrap|(''a'' + ''c'')}}-step {{nowrap|''a'''''X''' + ''c'''''Z'''}}. The construction replaces the '''X'''s in these subwords with alternating '''X'''s and '''Y'''s; either of '''X''' or '''Y''' may occur first, corresponding to the two possible sizes, since ''a'' is odd and thus the {{nowrap|(''a'' + ''c'')}}-step subword {{nowrap|''s''[''k'' &minus; 1 : ''k'' + ''a'' + ''c'' &minus; 1]}} becomes the subword {{nowrap|''s''[''k'' + ''a'' + ''c'' &minus; 1 : ''k'' + 2''a'' + 2''c'' &minus; 1]}} via interchanging '''X''' and '''Y'''.
Line 345: Line 344:
Write ''s''<sub>1</sub> for the scale word made from stacked 2-steps from the 0-degree, and let ''s''<sub>2</sub> be as follows:
Write ''s''<sub>1</sub> for the scale word made from stacked 2-steps from the 0-degree, and let ''s''<sub>2</sub> be as follows:
* In the singly even case, let ''s''<sub>2</sub> be the circular word of 2-steps starting at the (''n''/2)-degree. We know that they differ only by interchanging '''y''' and '''z''', hence that they have the same period. Hence both ''s''<sub>1</sub> and ''s''<sub>2</sub> are primitive.
* In the singly even case, let ''s''<sub>2</sub> be the circular word of 2-steps starting at the (''n''/2)-degree. We know that they differ only by interchanging '''y''' and '''z''', hence that they have the same period. Hence both ''s''<sub>1</sub> and ''s''<sub>2</sub> are primitive.
* In the doubly even case, start from the mode of ''s'' whose template MOS is the brightest mode. Let ''s''<sub>2</sub> be offset at a generator of the even-regular scale, which by Theorem 6 we choose to have the same dyad class as a bright generator of the MOS ''a'''''x''' 2''k'''''X'''. This is what induces the equality of ''s''<sub>1</sub> and ''s''<sub>2</sub> (in particular, the two scales have the same period, thus they are both primitive): Let ''s''<sub>''t''</sub> be the period of the brightest mode of the template MOS, and let ''g'' be its bright generator class. Then the slice {{nowrap|''s''<sub>''t''</sub>[-''g'' +1 : 1]}} is the imperfect generator of the MOS. Now when we "darken" the mode by one generator, which is the difference between the template MOSes of ''s''<sub>1</sub> and ''s''<sub>2</sub>, we turn that slice into the bright generator, hence swapping ''s''<sub>''t''</sub>[-''g''] and ''s''<sub>''t''</sub>[-''g'' + 1]. Note that ''g'' must be odd since it generates a 2-period MOS. So (under 0-indexing) the first letter's index is even and the second letter's index is odd, which is what we want since the letters are within a stacked 2-step. While the generator might have to be higher by an (''n''/2)-step, that doesn't affect the parity since ''n''/2 is even.
* In the doubly even case, start from the mode of ''s'' whose template MOS is the brightest mode. Let ''s''<sub>2</sub> be offset at a generator of the even-regular scale, which by Theorem 6 we choose to have the same interval class as a bright generator of the MOS ''a'''''x''' 2''k'''''X'''. This is what induces the equality of ''s''<sub>1</sub> and ''s''<sub>2</sub> (in particular, the two scales have the same period, thus they are both primitive): Let ''s''<sub>''t''</sub> be the period of the brightest mode of the template MOS, and let ''g'' be its bright generator class. Then the slice {{nowrap|''s''<sub>''t''</sub>[-''g'' +1 : 1]}} is the imperfect generator of the MOS. Now when we "darken" the mode by one generator, which is the difference between the template MOSes of ''s''<sub>1</sub> and ''s''<sub>2</sub>, we turn that slice into the bright generator, hence swapping ''s''<sub>''t''</sub>[-''g''] and ''s''<sub>''t''</sub>[-''g'' + 1]. Note that ''g'' must be odd since it generates a 2-period MOS. So (under 0-indexing) the first letter's index is even and the second letter's index is odd, which is what we want since the letters are within a stacked 2-step. While the generator might have to be higher by an (''n''/2)-step, that doesn't affect the parity since ''n''/2 is even.


We prove that ''s''<sub>1</sub> and ''s''<sub>2</sub> are MOS substitution scales with a filling MOS of period 2. The number the 2-step (1) occurs must be the same in both ''s''<sub>1</sub> and ''s''<sub>2</sub>. The word of stacked 2-steps of the template MOS (which is of the form {{nowrap|''w''('''x''', '''X''', '''X''')''w''('''x''', '''X''', '''X''')}}), which is itself a MOS word, consists of letters (1) '''x''' + '''X''' and (2) 2'''X''' if more '''X''''s than '''x''''s, 2'''x''' if more '''x''''s than '''X''''s. The word of stacked 2-steps from our chosen offset is also this same MOS word. Thus it remains to handle the cases (1) and (2) above. IWhenever the letter '''x''' + '''X''' is encountered, the number of the last letters that are equated to '''X''' that are consumed is 1, which is odd. Whenever the other letter is encountered, that number is even (0 or 2). Hence (since ''n'' > 4) the letter 2'''X''' resp. 2'''x''' serves as the non-slot letter, and the letters ('''x''' + '''X''') serve as the slot letters where a 2-period filling MOS word (a repetition of {{nowrap|('''x'''+'''y''')('''x'''+'''z''')}}) is substituted.
We prove that ''s''<sub>1</sub> and ''s''<sub>2</sub> are MOS substitution scales with a filling MOS of period 2. The number the 2-step (1) occurs must be the same in both ''s''<sub>1</sub> and ''s''<sub>2</sub>. The word of stacked 2-steps of the template MOS (which is of the form {{nowrap|''w''('''x''', '''X''', '''X''')''w''('''x''', '''X''', '''X''')}}), which is itself a MOS word, consists of letters (1) '''x''' + '''X''' and (2) 2'''X''' if more '''X''''s than '''x''''s, 2'''x''' if more '''x''''s than '''X''''s. The word of stacked 2-steps from our chosen offset is also this same MOS word. Thus it remains to handle the cases (1) and (2) above. IWhenever the letter '''x''' + '''X''' is encountered, the number of the last letters that are equated to '''X''' that are consumed is 1, which is odd. Whenever the other letter is encountered, that number is even (0 or 2). Hence (since ''n'' > 4) the letter 2'''X''' resp. 2'''x''' serves as the non-slot letter, and the letters ('''x''' + '''X''') serve as the slot letters where a 2-period filling MOS word (a repetition of {{nowrap|('''x'''+'''y''')('''x'''+'''z''')}}) is substituted.