Ternary scale theorems: Difference between revisions

Inthar (talk | contribs)
No edit summary
Tag: Reverted
Inthar (talk | contribs)
 
(3 intermediate revisions by the same user not shown)
Line 35: Line 35:
# 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).
# If ''n'' is odd, then the result of identifying the two equinumerous step sizes is a primitive MOS.  
# If ''n'' is odd, then the result of identifying the two equinumerous step sizes is a primitive MOS.  
# If ''n'' is odd, {{nowrap|''s'' {{=}} ''a'''''X''' ''b'''''Y''' ''b''}} is obtained from some mode of the (primitive) MOS ''a'''''X''' 2''b'''''W''' by replacing all the '''W'''s successively with alternating '''Y'''s and ℤs (or alternating ℤs and '''Y'''s for the other chirality, fixing the mode of ''a'''''X''' 2''b'''''W'''). The two alternants differ by replacing one '''Y''' with a . In other words, ''s'' is ''odd-regular'' in our classification of MV3 scales.
# If ''n'' is odd, {{nowrap|''s'' {{=}} ''a'''''X''' ''b'''''Y''' ''b'''''Z'''}} is obtained from some mode of the (primitive) MOS ''a'''''X''' 2''b'''''W''' by replacing all the '''W'''s successively with alternating '''Y'''s and '''Z'''s (or alternating '''Z'''s and '''Y'''s for the other chirality, fixing the mode of ''a'''''X''' 2''b'''''W'''). The two alternants differ by replacing one '''Y''' with a '''Z'''. In other words, ''s'' is ''odd-regular'' in our classification of MV3 scales.


=== Proof ===
=== Proof ===
Line 82: Line 82:
The {{nowrap|''n'' − 1}} stacked AGS terms are identified when the equinumerous step sizes are equated. Thus we have a binary scale with a generator (occurring at {{nowrap|''n'' − 1}} positions), hence being a primitive MOS.
The {{nowrap|''n'' − 1}} stacked AGS terms are identified when the equinumerous step sizes are equated. Thus we have a binary scale with a generator (occurring at {{nowrap|''n'' − 1}} positions), hence being a primitive MOS.
==== Statement (5) ====
==== Statement (5) ====
By part (2), we have that ''s'' has step signature {{nowrap|''a'''''X''' ''b'''''Y''' ''b''}}, ''a'' odd. By part (4), we have that {{nowrap|''T''('''X''', '''W''') {{=}} ''s''('''X''', '''W''', '''W''')}} is a MOS scale ''a'''''X'''2''b'''''W'''. If {{nowrap|''b'' {{=}} 1}}, there's nothing to prove, so assume {{nowrap|''b'' > 1}}.
By part (2), we have that ''s'' has step signature {{nowrap|''a'''''X''' ''b'''''Y''' ''b'''''Z'''}}, ''a'' odd. By part (4), we have that {{nowrap|''T''('''X''', '''W''') {{=}} ''s''('''X''', '''W''', '''W''')}} is a MOS scale ''a'''''X'''2''b'''''W'''. If {{nowrap|''b'' {{=}} 1}}, there's nothing to prove, so assume {{nowrap|''b'' > 1}}.


Consider the two generators in the GS of ''s'', which are lifts of the generator {{nowrap|''i'''''X''' + ''j'''''W'''}} of ''T''('''X''', '''W'''), where {{nowrap|gcd(''j'', 2''b'') {{=}} 1}}. Assume, possibly after inverting the generator, that the imperfect generator of ''T'' has {{nowrap|''j'' − 1}} '''W'''s and the perfect generator has ''j'' '''W'''s.
Consider the two generators in the GS of ''s'', which are lifts of the generator {{nowrap|''i'''''X''' + ''j'''''W'''}} of ''T''('''X''', '''W'''), where {{nowrap|gcd(''j'', 2''b'') {{=}} 1}}. Assume, possibly after inverting the generator, that the imperfect generator of ''T'' has {{nowrap|''j'' − 1}} '''W'''s and the perfect generator has ''j'' '''W'''s.


'''Claim 1''': Deleting '''X'''s from the generator subwords of ''s'' gives every ''j''-step subword in the scale ''E''<sub>X</sub>(''s'')('''Y''',&nbsp;), the scale word obtained by deleting all '''X''''s from ''s''. These ''j''-step subwords are adjacent and alternating under the ordering induced by the AGS stack.
'''Claim 1''': Deleting '''X'''s from the generator subwords of ''s'' gives every ''j''-step subword in the scale ''E''<sub>X</sub>(''s'')('''Y''',&nbsp;'''Z'''), the scale word obtained by deleting all '''X''''s from ''s''. These ''j''-step subwords are adjacent and alternating under the ordering induced by the AGS stack.


Proof:
Proof:
Line 98: Line 98:
* A.3.iv. Conclusion: ''T''[''p''], the leftmost letter of {{nowrap|''I'' {{=}} ''T''[''p'' : ''p'' + ''k''],}} is '''X'''.
* A.3.iv. Conclusion: ''T''[''p''], the leftmost letter of {{nowrap|''I'' {{=}} ''T''[''p'' : ''p'' + ''k''],}} is '''X'''.
* B.1. Now we go back to the original necklace ''s''. Lift each perfect generator window (we have {{nowrap|''n'' &minus; 1}} perfect windows) of ''T'' to ''s''.
* B.1. Now we go back to the original necklace ''s''. Lift each perfect generator window (we have {{nowrap|''n'' &minus; 1}} perfect windows) of ''T'' to ''s''.
* B.2. By the hypothesis that ''s'' has an AGS, and since the AGS descends to stacking a single generator in the template MOS ''T'', the lifted generators ''g''<sub>1</sub> and ''g''<sub>2</sub> alternate in their counts of '''Y''' and also alternate in their counts of .
* B.2. By the hypothesis that ''s'' has an AGS, and since the AGS descends to stacking a single generator in the template MOS ''T'', the lifted generators ''g''<sub>1</sub> and ''g''<sub>2</sub> alternate in their counts of '''Y''' and also alternate in their counts of '''Z'''.
* B.3. For a MOS binary word, the count of a given letter in a generator is coprime to the total count of that letter in one period of the MOS. By this fact applied to ''T'', {{nowrap|gcd(''j'', 2''b'') {{=}} 1}}.
* B.3. For a MOS binary word, the count of a given letter in a generator is coprime to the total count of that letter in one period of the MOS. By this fact applied to ''T'', {{nowrap|gcd(''j'', 2''b'') {{=}} 1}}.
* B.4. Hence, since every instance of the generator in ''T'' has ''j''-many '''W''' letters, every instance of ''g''<sub>1</sub> and every instance of ''g''<sub>2</sub> has ''j''-many non-'''X''' letters.
* B.4. Hence, since every instance of the generator in ''T'' has ''j''-many '''W''' letters, every instance of ''g''<sub>1</sub> and every instance of ''g''<sub>2</sub> has ''j''-many non-'''X''' letters.
* C.1. Importantly, deleting '''X''''s gives windows of length ''j'', such that when you project adjacent lifted generators (by deleting '''X''''s) to the binary necklace {{nowrap|''U'' :{{=}} ''E''<sub>'''X'''</sub>(''s'')('''Y''', )}}, the resulting ''j''-step windows in ''U'' are adjacent and do not overlap.
* C.1. Importantly, deleting '''X''''s gives windows of length ''j'', such that when you project adjacent lifted generators (by deleting '''X''''s) to the binary necklace {{nowrap|''U'' :{{=}} ''E''<sub>'''X'''</sub>(''s'')('''Y''', '''Z''')}}, the resulting ''j''-step windows in ''U'' are adjacent and do not overlap.
* C.2. Moreover, for every ''j''-step window {{nowrap|''U''[''q'' : ''q'' + ''j'']}}, there exists an {{nowrap|(''i'' + ''j'')-step}} window {{nowrap|''s''[''r'' : ''r'' + ''i'' + ''j'']}} such that {{nowrap|''s''[''r'']}} is the non-'''X''' that corresponds to {{nowrap|''U''[''q'']}} under step deletion. Since by subclaim A, the unique imperfect {{nowrap|(''i'' + ''j'')-step}} window in ''s'' begins in an '''X''', we know that {{nowrap|''s''[''r'' : ''r'' + ''i'' + ''j'']}} is perfect.
* C.2. Moreover, for every ''j''-step window {{nowrap|''U''[''q'' : ''q'' + ''j'']}}, there exists an {{nowrap|(''i'' + ''j'')-step}} window {{nowrap|''s''[''r'' : ''r'' + ''i'' + ''j'']}} such that {{nowrap|''s''[''r'']}} is the non-'''X''' that corresponds to {{nowrap|''U''[''q'']}} under step deletion. Since by subclaim A, the unique imperfect {{nowrap|(''i'' + ''j'')-step}} window in ''s'' begins in an '''X''', we know that {{nowrap|''s''[''r'' : ''r'' + ''i'' + ''j'']}} is perfect.
* C.3. We need only stack {{nowrap|2''b'' &le; ''n'' &minus; 1}} generators (to get {{nowrap|2''b''-many}} ''j''-step windows downstairs) to witness the alternation. Under the ordering induced by this stacking, the 1st ''j''-step subword of ''U'' and the last ({{nowrap|2''b''-th}}) ''j''-step window differ due to parity. Since {{nowrap|gcd(''j'', 2''b'') {{=}} 1}}, this visits every note of ''U''.
* C.3. We need only stack {{nowrap|2''b'' &le; ''n'' &minus; 1}} generators (to get {{nowrap|2''b''-many}} ''j''-step windows downstairs) to witness the alternation. Under the ordering induced by this stacking, the 1st ''j''-step subword of ''U'' and the last ({{nowrap|2''b''-th}}) ''j''-step window differ due to parity. Since {{nowrap|gcd(''j'', 2''b'') {{=}} 1}}, this visits every note of ''U''.


'''Claim 2''': If a binary necklace ''U'' has ''b'' '''Y'''s and ''b'' ℤs, {{nowrap|gcd(''j'', 2''b'') {{=}} 1}}, and consecutively stacked ''j''-steps in ''U'' occur in 2 alternating sizes, then {{nowrap|''U'' {{=}} ('''YZ''')<sup>''b''</sup>}}.
'''Claim 2''': If a binary necklace ''U'' has ''b'' '''Y'''s and ''b'' '''Z'''s, {{nowrap|gcd(''j'', 2''b'') {{=}} 1}}, and consecutively stacked ''j''-steps in ''U'' occur in 2 alternating sizes, then {{nowrap|''U'' {{=}} ('''YZ''')<sup>''b''</sup>}}.


Proof: Write '''u''' and '''v''' for the two sizes of ''j''-steps. Since {{nowrap|gcd(''j'', 2''b'') {{=}} 1}}, there exists ''m'' such that stacking ''m''-many ''j''-steps yields scale steps of ''U'', and ''m'' is odd because {{nowrap|gcd(''m'', 2''b'') {{=}} 1}}. Hence the scale steps of ''U'' are {{nowrap|('''uv''')<sup>{{sfrac|''m'' &minus; 1|2}}</sup>'''u''' (mod '''e''')}} and {{nowrap|('''vu''')<sup>{{sfrac|''m'' − 1|2}}</sup>'''v''' (mod '''e''')}}, and the step sizes alternate because '''u''' and '''v''' do.
Proof: Write '''u''' and '''v''' for the two sizes of ''j''-steps. Since {{nowrap|gcd(''j'', 2''b'') {{=}} 1}}, there exists ''m'' such that stacking ''m''-many ''j''-steps yields scale steps of ''U'', and ''m'' is odd because {{nowrap|gcd(''m'', 2''b'') {{=}} 1}}. Hence the scale steps of ''U'' are {{nowrap|('''uv''')<sup>{{sfrac|''m'' &minus; 1|2}}</sup>'''u''' (mod '''e''')}} and {{nowrap|('''vu''')<sup>{{sfrac|''m'' − 1|2}}</sup>'''v''' (mod '''e''')}}, and the step sizes alternate because '''u''' and '''v''' do.


These two claims prove that {{nowrap|''E''<sub>'''X'''</sub>(S) {{=}} ('''YZ''')<sup>''b''</sup>}} and that the two GS generators' sizes differ by replacing one '''Y''' for a . {{Qed}}
These two claims prove that {{nowrap|''E''<sub>'''X'''</sub>(S) {{=}} ('''YZ''')<sup>''b''</sup>}} and that the two GS generators' sizes differ by replacing one '''Y''' for a '''Z'''. {{Qed}}


== Theorem 2 (Classification of pairwise well-formed scales) ==
== Theorem 2 (Classification of pairwise well-formed scales) ==
Line 234: Line 234:
== Theorem 4 (Generator-offset structure of even-regular scales) ==
== Theorem 4 (Generator-offset structure of even-regular scales) ==
=== Definition (Even-regular scale) ===
=== Definition (Even-regular scale) ===
A primitive ternary scale ''s'' is ''even-regular'' if len(''s'') is even and ''s'' is equivalent to a word constructed from taking the MOS 2''a'''''X'''&nbsp;2''c''with ''a'' odd and {{nowrap|gcd(''a'', ''c'') {{=}} 1}}, and replacing every other '''X''' with '''Y'''. In particular,  ''s'' has [[step signature]] equivalent to ''a'''''X'''&nbsp;''a'''''Y'''&nbsp;''b''with ''a'' odd and ''b'' even. For example, '''LsLsLmsLsLsm''' (achiral [[diachrome]], 5'''L'''&nbsp;2'''m'''&nbsp;5'''s''') is an even-regular scale.
A primitive ternary scale ''s'' is ''even-regular'' if len(''s'') is even and ''s'' is equivalent to a word constructed from taking the MOS 2''a'''''X'''&nbsp;2''c'''''Z''' with ''a'' odd and {{nowrap|gcd(''a'', ''c'') {{=}} 1}}, and replacing every other '''X''' with '''Y'''. In particular,  ''s'' has [[step signature]] equivalent to ''a'''''X'''&nbsp;''a'''''Y'''&nbsp;''b'''''Z''' with ''a'' odd and ''b'' even. For example, '''LsLsLmsLsLsm''' (achiral [[diachrome]], 5'''L'''&nbsp;2'''m'''&nbsp;5'''s''') is an even-regular scale.
=== Theorem ===
=== Theorem ===
If {{nowrap|''s'' {{=}} ''s''('''X''', '''Y''', )}} 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 interval class as some generator of the MOS 2''a'''''W'''&nbsp;2''c'';
# 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 interval;
# the two generator chains are offset by a len(''s'')/2-step interval;
# ''s'' is [[balanced]].
# ''s'' is [[balanced]].


=== Proof ===
=== Proof ===
The result of substituting '''Y''' with '''X''' (let us call this map ''p'') is the MOS {{nowrap|''M'' {{=}} 2''a'''''X''' 2''c''}}, which has exactly 2 periods since {{nowrap|gcd(''a'', ''c'') {{=}} 1}}. ''M'' thus consists of two generator chains separated by the period of ''M'', which has {{nowrap|''a'' + ''c'' {{=}} len(''s'')}} steps. It thus suffices for there to exist ''k'', {{nowrap|0 &lt; ''k'' &lt; ''a'' + ''c''}}, such that every perfect ''k''-step generator has the same preimage in ''s'', which will be our desired generator. Suppose that the perfect ''k''-step of ''M'' is {{nowrap|''i'''''W''' + ''j''}} where {{nowrap|0 &lt; ''i'' &lt; ''a''}}. Since ''a'' is odd, possibly after taking the period-complement we may assume that ''i'' is even. Hence each subword ''w'' of ''s'' such that its projection ''p''(''w'') subtends a perfect ''k''-step satisfies {{nowrap|{{abs|''w''}}<sub>'''X'''</sub> {{=}} {{abs|''w''}}<sub>'''Y'''</sub> {{=}} ''i''/2}}. It plainly follows that every such ''w'' satisfies {{nowrap|{{abs|''w''}}<sub>'''X'''</sub> {{=}} {{abs|''w''}}<sub>'''Y'''</sub>}} =&nbsp;{{sfrac|''i''|2}} and {{nowrap|{{abs|''w''}}<sub></sub> {{=}} ''j''}}.
The result of substituting '''Y''' with '''X''' (let us call this map ''p'') is the MOS {{nowrap|''M'' {{=}} 2''a'''''X''' 2''c'''''Z'''}}, which has exactly 2 periods since {{nowrap|gcd(''a'', ''c'') {{=}} 1}}. ''M'' thus consists of two generator chains separated by the period of ''M'', which has {{nowrap|''a'' + ''c'' {{=}} len(''s'')}} steps. It thus suffices for there to exist ''k'', {{nowrap|0 &lt; ''k'' &lt; ''a'' + ''c''}}, such that every perfect ''k''-step generator has the same preimage in ''s'', which will be our desired generator. Suppose that the perfect ''k''-step of ''M'' is {{nowrap|''i'''''W''' + ''j'''''Z'''}} where {{nowrap|0 &lt; ''i'' &lt; ''a''}}. Since ''a'' is odd, possibly after taking the period-complement we may assume that ''i'' is even. Hence each subword ''w'' of ''s'' such that its projection ''p''(''w'') subtends a perfect ''k''-step satisfies {{nowrap|{{abs|''w''}}<sub>'''X'''</sub> {{=}} {{abs|''w''}}<sub>'''Y'''</sub> {{=}} ''i''/2}}. It plainly follows that every such ''w'' satisfies {{nowrap|{{abs|''w''}}<sub>'''X'''</sub> {{=}} {{abs|''w''}}<sub>'''Y'''</sub>}} =&nbsp;{{sfrac|''i''|2}} and {{nowrap|{{abs|''w''}}<sub>'''Z'''</sub> {{=}} ''j''}}.


It remains to show that ''s'' is balanced. Any ''k''-step subword has either ''j'' or ''j'' + 1 ℤs for some ''j'' since the result of conflating '''X''' and '''Y''' is a MOS, and ''k''-step subwords for both possibilities exist when 0 < ''k'' < len(''s'')/2. If the number of non-letters in a ''k''-step subword is even, then there is only one possibility for the number of '''X''' and the number of '''Y'''. If the number of non-letters in a ''k''-step subword is odd, then both the number of '''X'''s and the number of '''Y'''s differ by at most 1. {{qed}}
It remains to show that ''s'' is balanced. Any ''k''-step subword has either ''j'' or ''j'' + 1 '''Z'''s for some ''j'' since the result of conflating '''X''' and '''Y''' is a MOS, and ''k''-step subwords for both possibilities exist when 0 < ''k'' < len(''s'')/2. If the number of non-'''Z''' letters in a ''k''-step subword is even, then there is only one possibility for the number of '''X''' and the number of '''Y'''. If the number of non-'''Z''' letters in a ''k''-step subword is odd, then both the number of '''X'''s and the number of '''Y'''s differ by at most 1. {{qed}}


== Theorem 5 (Classification of MV3 scales) ==
== Theorem 5 (Classification of MV3 scales) ==
In the following, ''equivalent'' means "is the same circular word after permuting '''X''', '''Y''', and ." This means that '''XYXZXYX''' is equivalent to '''YZYXYZY''', or '''XZXYXZX''', and so on.
In the following, ''equivalent'' means "is the same circular word after permuting '''X''', '''Y''', and '''Z'''." This means that '''XYXZXYX''' is equivalent to '''YZYXYZY''', or '''XZXYXZX''', and so on.


=== Theorem 5.1 (Classification of ternary balanced scales) ===
=== Theorem 5.1 (Classification of ternary balanced scales) ===
# A primitive [[balanced]] ternary scale ''s'' is pairwise-MOS; conversely, pairwise-MOS scales are balanced. Such a scale satisfies one of the following:
# A primitive [[balanced]] ternary scale ''s'' is pairwise-MOS; conversely, pairwise-MOS scales are balanced. Such a scale satisfies one of the following:
## '''sporadic balanced''': ''s'' is equivalent to '''XYXZXYX''', the ternary [[Fraenkel word]], with step signature 4'''X'''2'''Y'''1ℤ.
## '''sporadic balanced''': ''s'' is equivalent to '''XYXZXYX''', the ternary [[Fraenkel word]], with step signature 4'''X'''2'''Y'''1'''Z'''.
## '''odd-regular''': len(''s'') is odd, and ''s'' is equivalent to a word constructed from taking the brightest mode of the MOS ''c'''''X'''''b''with ''c'' even and {{nowrap|gcd(''c'', ''b'') {{=}} 1}}, and replacing every other '''X''' with '''Y'''. We assume {{nowrap|'''X''' &gt; }} when constructing the MOS. In particular, ''s'' has [[step signature]] ''a'''''X'''''a'''''Y'''''b''where ''b'' is odd (with {{nowrap|''a'' {{=}} ''c''/2}}).
## '''odd-regular''': len(''s'') is odd, and ''s'' is equivalent to a word constructed from taking the brightest mode of the MOS ''c'''''X'''''b'''''Z''' with ''c'' even and {{nowrap|gcd(''c'', ''b'') {{=}} 1}}, and replacing every other '''X''' with '''Y'''. We assume {{nowrap|'''X''' &gt; '''Z'''}} when constructing the MOS. In particular, ''s'' has [[step signature]] ''a'''''X'''''a'''''Y'''''b'''''Z''' where ''b'' is odd (with {{nowrap|''a'' {{=}} ''c''/2}}).
## '''even-regular''': len(''s'') is even, and ''s'' is equivalent to a word constructed from taking the brightest mode of the MOS 2''a'''''X'''2''c''with ''a'' odd and {{nowrap|gcd(''a'', ''c'') {{=}} 1}}, and replacing every other '''X''' with '''Y'''. In particular,  ''s'' has [[step signature]] ''a'''''X'''''a'''''Y'''''b''with ''a'' odd and ''b'' even.
## '''even-regular''': len(''s'') is even, and ''s'' is equivalent to a word constructed from taking the brightest mode of the MOS 2''a'''''X'''2''c'''''Z''' with ''a'' odd and {{nowrap|gcd(''a'', ''c'') {{=}} 1}}, and replacing every other '''X''' with '''Y'''. In particular,  ''s'' has [[step signature]] ''a'''''X'''''a'''''Y'''''b'''''Z''' with ''a'' odd and ''b'' even.
# All primitive balanced ternary scales are MV3.
# All primitive balanced ternary scales are MV3.
# A balanced primitive ternary scale is SV3 if and only if it is not even-regular.
# A balanced primitive ternary scale is SV3 if and only if it is not even-regular.
# Odd-regular balanced primitive ternary scales have a generator sequence of period 2.
# Odd-regular balanced primitive ternary scales have a generator sequence of period 2.


(Condensed: All single-period balanced ternary scales that are not the Fraenkel word are a'''X''' a'''Y''' bℤ. In this case, if b is odd, then the scale is odd-regular. If b is even, then the scale is even-regular.)
(Condensed: All single-period balanced ternary scales that are not the Fraenkel word are a'''X''' a'''Y''' b'''Z'''. In this case, if b is odd, then the scale is odd-regular. If b is even, then the scale is even-regular.)


==== Proof ====
==== Proof ====
Line 276: Line 276:
(i) The sequence '''XZX''' must appear in ''W''.
(i) The sequence '''XZX''' must appear in ''W''.


There are two consecutive '''X'''s with no '''Y''' in between since ''a'' > ''b''. This means either '''XX''' or '''XZX''' appears. If '''XX''' appears, then a is necessarily surrounded by two '''X'''s.
There are two consecutive '''X'''s with no '''Y''' in between since ''a'' > ''b''. This means either '''XX''' or '''XZX''' appears. If '''XX''' appears, then a '''Z''' is necessarily surrounded by two '''X'''s.


(ii) The sequence '''YXXY''' and '''XYXXYX''' must appear in ''W''.
(ii) The sequence '''YXXY''' and '''XYXXYX''' must appear in ''W''.


There exists a pair of consecutive '''Y'''s with no in between. Thus we have a subword of the form '''YX'''<sup>''n''</sup>'''Y'''. Now, ''n'' &le; 1 is not possible because of the presence of '''XZX''' and '''Y'''-balance. ''n'' &ge; 3 implies the existence of '''X'''<sup>''n''-1</sup>'''ZX'''<sup>''n''-1</sup> by '''X'''-balance which is incompatible with '''YX'''<sup>''n''</sup>'''Y''' because of '''Y'''-balance. Therefore, ''n'' = 2. Note that this also implies the presence of subwords '''XX''' and '''XYXXYX'''.
There exists a pair of consecutive '''Y'''s with no '''Z''' in between. Thus we have a subword of the form '''YX'''<sup>''n''</sup>'''Y'''. Now, ''n'' &le; 1 is not possible because of the presence of '''XZX''' and '''Y'''-balance. ''n'' &ge; 3 implies the existence of '''X'''<sup>''n''-1</sup>'''ZX'''<sup>''n''-1</sup> by '''X'''-balance which is incompatible with '''YX'''<sup>''n''</sup>'''Y''' because of '''Y'''-balance. Therefore, ''n'' = 2. Note that this also implies the presence of subwords '''XX''' and '''XYXXYX'''.


(iii) The sequence '''XYXZXYX''' appears in ''W''.
(iii) The sequence '''XYXZXYX''' appears in ''W''.


The sequence ''W'' must contain a . This is necessarily surrounded by two '''X'''s since '''XX''' exists by Step (ii). This group is necessarily surrounded by two '''Y'''s since '''YXXY''' exists, and consequently, necessarily surrounded by two '''X'''s because '''XYXXYX''' exists. We get the sequence '''XYXZXYX'''.
The sequence ''W'' must contain a '''Z'''. This '''Z''' is necessarily surrounded by two '''X'''s since '''XX''' exists by Step (ii). This group is necessarily surrounded by two '''Y'''s since '''YXXY''' exists, and consequently, necessarily surrounded by two '''X'''s because '''XYXXYX''' exists. We get the sequence '''XYXZXYX'''.


(iv) ''W'' = ('''XYXZXYX''')<sup>ω</sup>.
(iv) ''W'' = ('''XYXZXYX''')<sup>ω</sup>.


No letter around this word can be a because '''YXXY''' exists. None can be a '''Y''' since '''XZX''' exists. Therefore, they have to be two '''X'''s. Then note that the two surrounding letters cannot be (because of the existence of '''XYXXYX''') nor '''X''' (because of the existence of '''YXZ''') so they are '''Y''', then followed by '''X''' (because '''XX''' exists). At this point, we have the sequence
No letter around this word can be a '''Z''' because '''YXXY''' exists. None can be a '''Y''' since '''XZX''' exists. Therefore, they have to be two '''X'''s. Then note that the two surrounding letters cannot be '''Z''' (because of the existence of '''XYXXYX''') nor '''X''' (because of the existence of '''YXZ''') so they are '''Y''', then followed by '''X''' (because '''XX''' exists). At this point, we have the sequence
“_'''XYXXYXZXYXXYX'''_”. Both _s are necessarily ℤs. To end the proof, note that we have obtained the configuration around every and this determines the whole sequence. Thus ''W'' = ('''XYXZXYX''')<sup>ω</sup>.
“_'''XYXXYXZXYXXYX'''_”. Both _s are necessarily '''Z'''s. To end the proof, note that we have obtained the configuration around every '''Z''' and this determines the whole sequence. Thus ''W'' = ('''XYXZXYX''')<sup>ω</sup>.


(c) The scale made by taking ''s'' and conflating '''Y''' and 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 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 ℤs. This violates balance because ''t''<sub>1</sub> contains zero ℤ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 5.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>{{=}} (''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 5.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 5.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''}} and {{nowrap|{{ceil|''a''/2}}'''X''' + {{floor|''a''/2}}'''Y''' + ''c''}}, since the underlying MOS 2''a'''''X'''2''c'''''Y''' only has the {{nowrap|(''a'' + ''c'')}}-step {{nowrap|''a'''''X''' + ''c''}}. 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 5.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'''.


Claim 5.1.4 can be verified by noting that such scales are PWF and using Theorem 4. {{Qed}}
Claim 5.1.4 can be verified by noting that such scales are PWF and using Theorem 4. {{Qed}}
Line 304: Line 304:
# '''sporadic non-balanced''': equivalent to '''XYZYX''', or
# '''sporadic non-balanced''': equivalent to '''XYZYX''', or
# '''twisted''': equivalent to a word constructed as follows:
# '''twisted''': equivalent to a word constructed as follows:
#* Start with the brightest multiMOS word ''kc'''''X'''''kb''with ''c'' being an even number.
#* Start with the brightest multiMOS word ''kc'''''X'''''kb'''''Z''' with ''c'' being an even number.
#* Interchange a and an '''X''' at some (possibly more than one) of the boundaries of these copies of the MOS word ''w''. Here, the boundary of two consecutive copies of ''w'' is the last letter of the first word and the first letter of the second word. (At the ends of the whole multiMOS word, the boundaries are just the first and last letters of the word.) For example, let ''w'' be the multiMOS word 8'''X'''6ℤ, '''XXZXZXZXXZXZXZ'''. Then the border between the copies of the MOS subword '''XXZXZXZ''' are ''w''[6]''w''[7] and ''w''[13]''w''[0] (using 0-based numbering).
#* Interchange a '''Z''' and an '''X''' at some (possibly more than one) of the boundaries of these copies of the MOS word ''w''. Here, the boundary of two consecutive copies of ''w'' is the last letter of the first word and the first letter of the second word. (At the ends of the whole multiMOS word, the boundaries are just the first and last letters of the word.) For example, let ''w'' be the multiMOS word 8'''X'''6'''Z''', '''XXZXZXZXXZXZXZ'''. Then the border between the copies of the MOS subword '''XXZXZXZ''' are ''w''[6]''w''[7] and ''w''[13]''w''[0] (using 0-based numbering).
#* Replace every other '''X''' with '''Y''' in ''w''. (Thus in particular, twisted MV3 scales have step signature ''ka'''''X'''''ka'''''Y'''''kb'')
#* Replace every other '''X''' with '''Y''' in ''w''. (Thus in particular, twisted MV3 scales have step signature ''ka'''''X'''''ka'''''Y'''''kb'''''Z''')


==== Proof ====
==== Proof ====
Line 336: Line 336:
* In the singly even case, since there are evenly many slot letters in both ''s''<sub>1</sub> and ''s''<sub>2</sub>, there are oddly many non-slot letters in both. Since ''s''<sub>1</sub> and ''s''<sub>2</sub> differ by interchanging '''y''' and '''z''', they have "opposite" filling letters, '''x''' + '''y''' being the opposite of '''x''' + '''z'''. This makes ''s''<sub>1</sub> and ''s''<sub>2</sub> opposite chiralities of an odd-regular MV3 scale.
* In the singly even case, since there are evenly many slot letters in both ''s''<sub>1</sub> and ''s''<sub>2</sub>, there are oddly many non-slot letters in both. Since ''s''<sub>1</sub> and ''s''<sub>2</sub> differ by interchanging '''y''' and '''z''', they have "opposite" filling letters, '''x''' + '''y''' being the opposite of '''x''' + '''z'''. This makes ''s''<sub>1</sub> and ''s''<sub>2</sub> opposite chiralities of an odd-regular MV3 scale.
* In the doubly even case, the number of non-slot letters in ''s''<sub>1</sub> and ''s''<sub>2</sub> is even, and we have a filling MOS of period 2. Since ''s''<sub>1</sub> and ''s''<sub>2</sub> are both primitive, they are both even-regular scales. {{Qed}}
* In the doubly even case, the number of non-slot letters in ''s''<sub>1</sub> and ''s''<sub>2</sub> is even, and we have a filling MOS of period 2. Since ''s''<sub>1</sub> and ''s''<sub>2</sub> are both primitive, they are both even-regular scales. {{Qed}}
== Theorem 7 (Ternary parallelogram scales are MOS substitution) ==
:''Main article: [[Ternary parallelogram scales are MOS substitution]]''
Ternary parallelogram scale words are [[MOS substitution]] scale words, where the period count of the template MOS is the number of rows of the parallelogram parallel to the unique step size parallel to a side of the parallelogram.


== Open problems ==
== Open problems ==
# Classify all twisted SV3 scales, thereby completing the classification of all abstractly SV3 scales.
# Classify all twisted SV3 scales, thereby completing the classification of all abstractly SV3 scales.
# Conjecture: If a twisted MV3 is not SV3, then it is constructed from ''ka'''''X'''''kb''where ''k'' is composite.
# Conjecture: If a twisted MV3 is not SV3, then it is constructed from ''ka'''''X'''''kb'''''Z''' where ''k'' is composite.


=== Conjecture ("MV3 Sequences") ===
=== Conjecture ("MV3 Sequences") ===