Ternary scale theorems: Difference between revisions

Akselai (talk | contribs)
big edit for section "Classification of MV3 scales"
Inthar (talk | contribs)
→Theorem 5 (Classification of MV3 scales): Added a proof that PWF scales are balanced.
Line 219: Line 219:
* '''Case 3.10''': (''x'', ''y'') = (floor(''n''/μ), 2*floor(''n''/μ) + 3)
* '''Case 3.10''': (''x'', ''y'') = (floor(''n''/μ), 2*floor(''n''/μ) + 3)
{{qed}}
{{qed}}
== Theorem 5 (Classification of MV3 scales) ==
== Theorem 5 (PWF scales are balanced) ==
All pairwise-well-formed scales are [[balanced]].
=== Proof ===
Let ''S'' be a PWF scale. The case where ''S'' is equivalent to '''XYXZXYX''' can be manually verified, so by Theorem 4, the only remaining case is when ''S'' can be constructed by stacking two alternating sizes, '''g'''<sub>1</sub> and '''g'''<sub>2</sub>, of ''k''-steps. We assume that ''S'' has scale signature ''a'''''X''' ''b'''''Y''' ''b'''''Z''' where ''a'' is odd. This ''k'' corresponds to the class of generators of the MOS ''a'''''X''' 2''b'''''W'''. This MOS is obtained from ''S'' by applying the function π such that π('''X''') = '''X''' and π('''Y''') = π('''Z''') = '''W'''. Naturally, π applies to abstract interval sizes, or more properly, Parikh vectors. Additionally, we can choose ''k'' so that the two sizes of ''k''-steps in π(''S'') are:
* the perfect generator '''g''' = ''t'''''X''' + (''k'' &minus; ''t'')'''W''' (note (''k'' &minus; ''t'') is odd by a previous proof), and
* the imperfect generator '''i''' = (''t'' + 1)'''X''' + (''k'' &minus; ''t'' &minus; 1)'''W'''.
We have π('''g'''<sub>1</sub>) = π('''g'''<sub>2</sub>) = '''g'''. Let '''h''' be the size in ''S'' such that π('''h''') = '''i'''. Hence only one ''k''-step subword ''h'' has this size in ''S''. By Theorem 1, we also may assume |'''g'''<sub>1</sub>|<sub>'''Y'''</sub> = |'''g'''<sub>2</sub>|<sub>'''Y'''</sub> + 1 and |'''g'''<sub>1</sub>|<sub>'''Z'''</sub> = |'''g'''<sub>2</sub>|<sub>'''Z'''</sub> &minus; 1.
 
As ''S'' is periodic and gcd(len(''S''), ''k'') = 1, it suffices to count letters in stacks of ''k''-steps in ''S''. The ''j''-step on any note of ''S'' can be computed by reducing a stack of ''k''-step subwords on that note, which alternate in size between '''g'''<sub>1</sub> and '''g'''<sub>2</sub>. Note that:
# Such a stack has a unique number ''m'' = ''m''(''j'') of ''k''-steps for a given ''j''.
# Either such a stack has '''h''' as one of its ''k''-steps, or it does not.
 
Depending on point (2), ''m'' may be even or odd. If ''m'' is even, then in any stack in ''S'' that has '''i''', the number of stacked '''g''' generators in the projection is odd, hence the number of non-'''X''' letters in the corresponding ''km''-step word in ''S'' is odd. Each incremental shift of the boundary that does not result in including '''i''' results in one '''Y''' being swapped for a '''Z''', or vice versa, while the number of '''X''' steps remains ''t''. In summary:
* |'''g'''|<sub>'''X'''</sub> = |'''g'''|<sub>'''X'''</sub> = ''t''
* |'''g'''<sub>1</sub>|<sub>'''Y'''</sub> = |'''g'''<sub>2</sub>|<sub>'''Z'''</sub> =  ceil((''k'' &minus; ''t'')/2),
* |'''g'''<sub>1</sub>|<sub>'''Z'''</sub> = |'''g'''<sub>2</sub>|<sub>'''Y'''</sub> = floor((''k'' &minus; ''t'')/2),
* |'''i'''|<sub>'''X'''</sub> = (''t'' + 1), |'''i'''|<sub>'''Y'''</sub> = |'''i'''|<sub>'''Z'''</sub> = (''k'' &minus; ''t'' &minus; 1)/2 = floor((''k'' &minus; ''t'')/2).
This proves that the set of ''j''-steps is balanced. The argument for when ''m'' is odd is similar. {{qed}}
== Theorem 6 (Classification of MV3 scales) ==
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.
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 6.1 (Classification of ternary balanced scales) ===
# A primitive [[balanced]] MV3 scale ''S'' is one of the following:
# A primitive [[balanced]] MV3 scale ''S'' is one of the following:
## If len(S) is odd, then ''S'' is equivalent to '''XYXZXYX''', or to a word constructed from taking the brightest mode of the MOS ''a'''''X''' ''b'''''Z''' with ''a'' even and gcd(''a'', ''b'') = 1, and replacing every other '''X''' with '''Y'''. We assume '''X''' > '''Z''' when constructing the MOS.
## If len(S) is odd, then ''S'' is equivalent to '''XYXZXYX''', or to a word constructed from taking the brightest mode of the MOS ''a'''''X''' ''b'''''Z''' with ''a'' even and gcd(''a'', ''b'') = 1, and replacing every other '''X''' with '''Y'''. We assume '''X''' > '''Z''' when constructing the MOS.
Line 229: Line 247:
# Balanced primitive ternary scales of type (2) have a generator sequence of period 2.-->
# Balanced primitive ternary scales of type (2) have a generator sequence of period 2.-->


=== Theorem 5.2 (Classification of MV3 scales) ===
=== Theorem 6.2 (Classification of MV3 scales) ===
# A primitive MV3 scale is either (1) balanced, (2) equivalent to '''XYZYX''', or (3) equivalent to a "twisted" word constructed as follows:
# A primitive MV3 scale is either (1) balanced, (2) equivalent to '''XYZYX''', or (3) equivalent to a "twisted" word constructed as follows:
## Start with the brightest multimos word ''ka'''''X''' ''kb'''''Z''' with ''a'' being an even number.
## Start with the brightest multimos word ''ka'''''X''' ''kb'''''Z''' with ''a'' being an even number.