Ternary scale theorems: Difference between revisions
No edit summary |
|||
| Line 3: | Line 3: | ||
* Bolded Latin variables refer to dyad sizes (more properly, Parikh vectors), for example step sizes. | * Bolded Latin variables refer to dyad sizes (more properly, Parikh vectors), for example step sizes. | ||
* Indices for all words are 1-indexed. | * Indices for all words are 1-indexed. | ||
** If '' | ** If ''s'' is a circular word and ''i'' < 1 or ''i'' > len(''s''), we first replace ''i'' with ''i'' % len(''s'') + 1 before using it as an argument in ''s''[-]. | ||
* The notation '' | * 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 ''s''('''X''', '''Y''') = '''XXY''' then ''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 dyad sizes that subtend them. | ||
* For a word ''w'' and letter '''x''', |''w''|<sub>'''x'''</sub> denotes the number of occurrences of the letter '''x''' in ''w''. For an abstract dyad size '''v''', |'''v'''|<sub>'''x'''</sub> is similar. | * For a word ''w'' and letter '''x''', |''w''|<sub>'''x'''</sub> denotes the number of occurrences of the letter '''x''' in ''w''. For an abstract dyad size '''v''', |'''v'''|<sub>'''x'''</sub> is similar. | ||
| Line 10: | Line 10: | ||
== Definitions == | == Definitions == | ||
* ''Dyad'' is used for the musical sense of ''interval'' to avoid confusion with the mathematical sense of ''interval''. | * ''Dyad'' is used for the musical sense of ''interval'' to avoid confusion with the mathematical sense of ''interval''. | ||
* A circular word '' | * 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 '''g'''<sub>1</sub> = 9/5 (a 9-step) and '''g'''<sub>2</sub> = 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 ''n''/2, or one chain has size (''n'' + 1)/2 and the second has size (''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>. | ||
*# The scale is ''well-formed'' with respect to g, i.e. all occurrences of the generator g are ''k''-steps for a fixed ''k''. | *# The scale is ''well-formed'' with respect to g, i.e. all occurrences of the generator g are ''k''-steps for a fixed ''k''. | ||
* A ''scale'' or ''scale word'' is a circular word with a chosen size for its equave. As we're not working with scales with distinct equaves simultaneously, all three terms are effectively synonymous for our purposes. | * A ''scale'' or ''scale word'' is a circular word with a chosen size for its equave. As we're not working with scales with distinct equaves simultaneously, all three terms are effectively synonymous for our purposes. | ||
| Line 19: | Line 19: | ||
* A strengthening of the generator-offset property, here 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 primitive [[mos]] scale (otherwise known as a well-formed scale). This is simply the property of having a [[generator sequence]] of period 2. All odd generator-offset scales are SGA, and aside from odd generator-offset scales, the only ternary scales to satisfy SGA are ('''xy''')<sup>''r''</sup>'''xz''', ''r'' ≥ 1. The Zarlino and diasem scales above are both SGA. [[Blackdye]] is generator-offset but not SGA. | * A strengthening of the generator-offset property, here 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 primitive [[mos]] scale (otherwise known as a well-formed scale). This is simply the property of having a [[generator sequence]] of period 2. All odd generator-offset scales are SGA, and aside from odd generator-offset scales, the only ternary scales to satisfy SGA are ('''xy''')<sup>''r''</sup>'''xz''', ''r'' ≥ 1. The Zarlino and diasem scales above are both SGA. [[Blackdye]] is generator-offset but not SGA. | ||
* An ''odd-step'' is a ''k''-step where ''k'' is odd; an ''even-step'' is defined similarly. | * An ''odd-step'' is a ''k''-step where ''k'' is odd; an ''even-step'' is defined similarly. | ||
* Given a linear or circular word '' | * Given a linear or circular word ''s'' with a step size '''X''', define ''E''<sub>'''X'''</sub>(''s'') as the scale word resulting from deleting all instances of '''X''' from ''s''. | ||
* By a ''subword'', ''substring'', or ''slice'' of a word '' | * By a ''subword'', ''substring'', or ''slice'' of a word ''s'', denoted ''s''[''i'' : ''j''] (''j'' > ''i''), we mean ''s''[''i''] ''s''[''i'' + 1] ... ''s''[''j'' − 1]. | ||
* Given a mos a'''X''' b'''Y''', a ''chunk'' of '''X''''s is a maximal (possibly length 0) substring made of '''X''''s, bounded by '''Y''''s. We do not include the boundary '''Y''''s. | * Given a mos a'''X''' b'''Y''', a ''chunk'' of '''X''''s is a maximal (possibly length 0) substring made of '''X''''s, bounded by '''Y''''s. We do not include the boundary '''Y''''s. | ||
* ''Length'' is another term for a scale's size. The length of a scale S is denoted len(S). | * ''Length'' is another term for a scale's size. The length of a scale S is denoted len(S). | ||
| Line 27: | Line 27: | ||
== Theorem 1 (Properties of SGA scales) == | == Theorem 1 (Properties of SGA scales) == | ||
Let '' | Let ''s'' be a ternary scale word in '''L''', '''M''', and '''s''' of length ''n'', and suppose ''s'' is SGA. Then: | ||
# The length of '' | # The length of ''s'' is odd, or ''s'' is equivalent to ('''xy''')<sup>''r''</sup>'''xz''' for some integer ''r'' ≥ 1. | ||
# If ''n'' is odd, '' | # If ''n'' is odd, ''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, '' | # If ''n'' is odd, ''s'' is abstractly SV3 (i.e. SV3 for almost all tunings). | ||
# If ''n'' is odd, '' | # If ''n'' is odd, ''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'''. | ||
# If ''n'' is odd, '' | # If ''n'' is odd, ''s'' is pairwise-mos. That is, the following operations each result in a [[mos]]: setting '''L''' = '''M''', setting '''L''' = '''s''', and setting '''M''' = '''s'''. | ||
In particular, odd generator-offset scales always satisfy these properties (see Proposition 2 below). | In particular, odd generator-offset scales always satisfy these properties (see Proposition 2 below). | ||
| Line 38: | Line 38: | ||
[Note: This is not true with SGA replaced with generator-offset; [[blackdye]] is a counterexample that is MV4.] | [Note: This is not true with SGA replaced with generator-offset; [[blackdye]] is a counterexample that is MV4.] | ||
=== Proof === | === Proof === | ||
Let '''e''' be the equave of '' | Let '''e''' be the equave of ''s''. | ||
Assuming SGA, we have two chains of the aggregate generator '''g''' (going right). In the diagrams below, O represents a note and - represents a generator '''g'''. The two cases are: | Assuming SGA, we have two chains of the aggregate generator '''g''' (going right). In the diagrams below, O represents a note and - represents a generator '''g'''. The two cases are: | ||
| Line 51: | Line 51: | ||
Label the notes (1, ''j'') and (2, ''j''), 1 ≤ ''j'' ≤ (number of notes in the chain), for notes in the upper and lower chain respectively. | Label the notes (1, ''j'') and (2, ''j''), 1 ≤ ''j'' ≤ (number of notes in the chain), for notes in the upper and lower chain respectively. | ||
==== Statement (1) ==== | ==== Statement (1) ==== | ||
In case 1, let '''g'''<sub>1</sub> = (2, 1) − (1, 1), '''g'''<sub>2</sub> = (1, 2) − (2, 1), and '''g'''<sub>3</sub> = (1, 1) − (''n''/2, 2) = ((−''n''/2 − 1)*'''g'''<sub>1</sub> − ''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 '' | In case 1, let '''g'''<sub>1</sub> = (2, 1) − (1, 1), '''g'''<sub>2</sub> = (1, 2) − (2, 1), and '''g'''<sub>3</sub> = (1, 1) − (''n''/2, 2) = ((−''n''/2 − 1)*'''g'''<sub>1</sub> − ''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 '' | Since ''s'' is generator-offset it is well-formed with respect to the aggregate generator '''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 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 ('''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'' ≥ 3. Consider the following abstract sizes for the dyad class of ''k''-steps reached by stacking ''r'' generators: | Let ''r'' be odd and ''r'' ≥ 3. Consider the following abstract sizes for the dyad class of ''k''-steps reached by stacking ''r'' generators: | ||
| Line 71: | Line 71: | ||
==== Statement (3) ==== | ==== Statement (3) ==== | ||
We only need to see that if len('' | We only need to see that if len(''s'') is odd and ''s'' is SGA, ''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. | ||
==== Statement (4) ==== | ==== Statement (4) ==== | ||
Assume '' | Assume ''s'' is ''a'''''X''' ''b'''''Y''' ''b'''''Z''', ''a'' odd. If ''b'' = 1, there's nothing to prove, so assume ''b'' > 1. | ||
Assume, possibly after inverting the generator, that the imperfect generator of ''T'' has ''j'' + 1 '''W''''s and the perfect generator has ''j'' '''W''''s. Consider the two alternants, detemperings of the generator ''i'''''X''' + ''j'''''W''' of the ''a'''''X''' 2''b'''''W''' mos ''T''('''X''', '''W''') = '' | Assume, possibly after inverting the generator, that the imperfect generator of ''T'' has ''j'' + 1 '''W''''s and the perfect generator has ''j'' '''W''''s. Consider the two alternants, detemperings of the generator ''i'''''X''' + ''j'''''W''' of the ''a'''''X''' 2''b'''''W''' mos ''T''('''X''', '''W''') = ''s''('''X''', '''W''', '''W''') where gcd(''j'', 2''k'') = 1. | ||
'''Claim 1''': Deleting '''X''''s from the alternant subwords of '' | '''Claim 1''': Deleting '''X''''s from the alternant subwords of ''s'' gives every ''j''-step subword in the scale ''E''<sub>X</sub>(''s'')('''Y''', '''Z'''), the scale word obtained by deleting all '''X''''s from ''s''. | ||
Proof: Consider the "imperfect alternant" subword of '' | Proof: Consider the "imperfect alternant" subword of ''s'' on index ''p'', which is ''I'' = ''s''[''p'' : ''p'' + ''i'' + ''j''], and suppose the result of deleting all '''X''''s from ''I'' has a j-step subword ''w'' as a substring. Then ''s''[''p'' − 1: ''p'' − 1 + ''i'' + ''j''] and ''s''[''p'' + 1 : ''p'' + 1 + ''i'' + ''j''] are both detemperings of perfect generators of ''T'', and have one fewer non-'''X''' step than ''I'' by our assumption. Thus the word ''I'' must both begin and end in a non-'''X''' letter. Removing all the '''X''''s from ''I'' results in a word that is ''j'' + 1 letters long and is the ''j''-step word ''w'' we started with, with just one extra letter appended. Thus one of the two perfect generators above, namely the one that removes the extra letter, must contain this ''j''-step. The rest of the ''j''-step subwords of ''s'' are all contained in "perfect" alternants; take ''q'' ≠ ''p'' to be the index of the first letter of one such ''j''-step subword (as contained in ''s'') and use ''s''[''q'' : ''q'' + ''i'' + ''j'']. | ||
'''Claim 2''': If a binary necklace ''U'' has ''b'' '''Y''''s and ''b'' '''Z''''s, gcd(''j'', 2''b'') = 1, and consecutively stacked ''j''-steps in ''U'' occur in 2 alternating sizes, then ''U'' = ('''YZ''')<sup>''b''</sup>. | '''Claim 2''': If a binary necklace ''U'' has ''b'' '''Y''''s and ''b'' '''Z''''s, gcd(''j'', 2''b'') = 1, and consecutively stacked ''j''-steps in ''U'' occur in 2 alternating sizes, then ''U'' = ('''YZ''')<sup>''b''</sup>. | ||
| Line 115: | Line 115: | ||
# If ''M'' = ''M''('''y''', '''z''') is the primitive MOS necklace above, then ''s'' = ''M''('''XY''', '''XZ''') for some assignment of variable names '''X''', '''Y''', and '''Z''' to the three letters of ''s''. | # If ''M'' = ''M''('''y''', '''z''') is the primitive MOS necklace above, then ''s'' = ''M''('''XY''', '''XZ''') for some assignment of variable names '''X''', '''Y''', and '''Z''' to the three letters of ''s''. | ||
=== Proof === | === Proof === | ||
(1) and (2) were proved in the proof of Proposition 1 (the part that we appeal to, from "all multiples of the generator '''g''' must be even-steps ..." to "These are all distinct by ℤ-linear independence", does not rely on '' | (1) and (2) were proved in the proof of Proposition 1 (the part that we appeal to, from "all multiples of the generator '''g''' must be even-steps ..." to "These are all distinct by ℤ-linear independence", does not rely on ''s'' having the SGA property). (3) and (4) are easy to check using (1). {{qed}} | ||
== Theorem 4 (Classification of pairwise well-formed scales) == | == Theorem 4 (Classification of pairwise well-formed scales) == | ||
Let '' | Let ''s''('''a''', '''b''', '''c''') be a scale word in three ℤ-linearly independent step sizes '''a''', '''b''', '''c'''. Suppose ''s'' is pairwise well-formed (equivalently, all its projections are primitive mosses). Then ''s'' is SV3 and has an odd number of notes. Moreover, ''s'' is either generator-offset or equivalent to the scale word '''abacaba'''. | ||
=== Proof === | === Proof === | ||
==== If the generator of a projection of '' | ==== If the generator of a projection of ''s'' is a ''k''-step, the word of stacked ''k''-steps in ''s'' is pairwise well-formed ==== | ||
Suppose '' | Suppose ''s'' has ''n'' notes (after dealing with small cases, we may assume ''n'' ≥ 7) and ''s'' projects to primitive mosses ''s''<sub>1</sub> (via identifying '''b''' with '''c'''), ''s''<sub>2</sub> (via identifying '''a''' with '''c'''), and ''s''<sub>3</sub> (via identifying '''a''' with '''b'''). Suppose ''s''<sub>1</sub>'s generator is a ''k''-step, which comes in two sizes: '''P''', the perfect ''k''-step, and '''I''', the imperfect ''k''-step. By stacking ''n''-many ''k''-steps, we get two words of length ''n'' of ''k''-steps of ''s''<sub>2</sub> and ''s''<sub>3</sub>, respectively. These binary words, which we call Σ<sub>2</sub> and Σ<sub>3</sub>, must be mosses, since ''m''-steps in the new words correspond to ''mk''-steps in the mos words ''s''<sub>1</sub> and ''s''<sub>2</sub>, which come in at most two sizes. Since ''s''<sub>1</sub> is a primitive mos, gcd(''k'', ''n'') = 1. Hence when 0 < ''m'' < ''n'', ''mk'' is ''not'' divisible by ''n'' and ''mk''-steps come in ''exactly'' two sizes; hence both Σ<sub>2</sub> and Σ<sub>3</sub> are primitive mosses. | ||
index: 1 2 3 4 ... ''n'' | index: 1 2 3 4 ... ''n'' | ||
| Line 130: | Line 130: | ||
Below we write step sizes resulting from identification as '''a'''~'''b''', '''b'''~'''c''', and '''a'''~'''c'''. | Below we write step sizes resulting from identification as '''a'''~'''b''', '''b'''~'''c''', and '''a'''~'''c'''. | ||
==== Two sizes of ''k''-steps in '' | ==== Two sizes of ''k''-steps in ''s'' project to ''s''<sub>1</sub>'s perfect generator ==== | ||
We can write sizes of dyads in '' | We can write sizes of dyads in ''s'' as vectors (''p'', ''q'', ''r'') using the basis ('''a''', '''b''', '''c'''). | ||
Suppose for sake of contradiction that only one size of ''k''-step ('''α''', '''β''', '''γ''') in '' | Suppose for sake of contradiction that only one size of ''k''-step ('''α''', '''β''', '''γ''') 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 (α + γ)*('''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. | ||
Only two sizes of ''k''-steps of '' | Only two sizes of ''k''-steps of ''s'' can project to P in ''s''<sub>1</sub>, for if there are three sizes of ''k''-steps (α, β, γ), (α, β′, γ′), (α, β′′, γ′′) in ''s'' that project to P, then β, β′ and β′′ are three distinct values. Thus these would project to three different ''k''-steps in ''s''<sub>3</sub>, contradicting the mos property of ''s''<sub>3</sub>. | ||
==== ''n'' is odd, etc. ==== | ==== ''n'' is odd, etc. ==== | ||
Suppose '''Q''' = (α, β, γ) ≠ '''R''' = (α, β′, γ′) are the two ''k''-steps in '' | Suppose '''Q''' = (α, β, γ) ≠ '''R''' = (α, β′, γ′) are the two ''k''-steps in ''s'' that project to '''P'''. Then '''T''' = (α′, β′′, γ′′) projects to '''I'''. Here the values in each component differ by at most 1, and α ≠ α′. Then the circular word Λ<sub>1</sub> formed by the '''a'''-components of the ''k''-steps in '''P''' is α...αα′. Since Σ<sub>2</sub> is a primitive mos pattern of β'''b''' + (''n'' − β)('''a'''~'''c''') and β′a + (''n'' − β′)('''a'''~'''c'''), the circular word Λ<sub>2</sub> = the pattern of β and β′ must be a primitive mos. Similarly, Λ<sub>3</sub> = the pattern of γ and γ′ is a primitive mos. | ||
Suppose Λ<sub>2</sub> is the mos λβ μβ′. Then Λ<sub>3</sub> is the mos (λ ± 1)γ (μ ∓ 1)γ′. Since both Λ<sub>2</sub> and Λ<sub>3</sub> are primitive, and at least one of μ and (μ ∓ 1) are even, it is now immediate that ''n'' is odd. | Suppose Λ<sub>2</sub> is the mos λβ μβ′. Then Λ<sub>3</sub> is the mos (λ ± 1)γ (μ ∓ 1)γ′. Since both Λ<sub>2</sub> and Λ<sub>3</sub> are primitive, and at least one of μ and (μ ∓ 1) are even, it is now immediate that ''n'' is odd. | ||
| Line 168: | Line 168: | ||
# 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 ''f'' − 1 generators away). | # the stack has one '''T''' and does not contain any '''R''' (since it's more than ''f'' − 1 generators away). | ||
These give exactly three distinct sizes for every dyad class. Hence '' | These give exactly three distinct sizes for every dyad class. Hence ''s'' is SV3. | ||
In this case S has two chains of '''Q''', one with floor(''n''/2) notes and one offset by '''Q'''<sup>(''f''−1)</sup>R with ceil(''n''/2) notes. Every instance of Q must be a ''k''-step, since by ℤ-linear independence '''Q''' = α'''a''' + β'''b''' + γ'''c''' is the only way to write '''Q''' in the basis ('''a''', '''b''', '''c'''); so '' | In this case S has two chains of '''Q''', one with floor(''n''/2) notes and one offset by '''Q'''<sup>(''f''−1)</sup>R with ceil(''n''/2) notes. Every instance of Q must be a ''k''-step, since by ℤ-linear independence '''Q''' = α'''a''' + β'''b''' + γ'''c''' is the only way to write '''Q''' in the basis ('''a''', '''b''', '''c'''); so ''s'' is well-formed with respect to '''Q'''. Thus ''s'' also satisfies the generator-offset property with generator '''Q'''. | ||
'''Case 2:''' μ ≥ ceil(''n''/2), i.e. Λ<sub>2</sub> has fewer β than β′. | '''Case 2:''' μ ≥ ceil(''n''/2), i.e. Λ<sub>2</sub> has fewer β than β′. | ||
Since Λ<sub>3</sub> has more β than β′, Λ<sub>2</sub> is floor(''n''/2)β ceil(''n''/2)β′, and Λ<sub>3</sub> is ceil(''n''/2)γ floor(''n''/2)γ′. There is a unique mode of ceil(''n''/2)γ floor(''n''/2)γ′ that both begins and ends with γ, namely γγ′γγ′…γγ′γ. Thus Λ<sub>2</sub> is ββ′ββ′…ββ′β′. It is now easy to see that if the number of ''k''-steps stacked is odd, then there are two sizes that do not contain '''T''' and one size that contains '''T'''; if the number of ''k''-steps stacked is even, then there is one size that does not contain '''T''' and two sizes that contain T. Hence '' | Since Λ<sub>3</sub> has more β than β′, Λ<sub>2</sub> is floor(''n''/2)β ceil(''n''/2)β′, and Λ<sub>3</sub> is ceil(''n''/2)γ floor(''n''/2)γ′. There is a unique mode of ceil(''n''/2)γ floor(''n''/2)γ′ that both begins and ends with γ, namely γγ′γγ′…γγ′γ. Thus Λ<sub>2</sub> is ββ′ββ′…ββ′β′. It is now easy to see that if the number of ''k''-steps stacked is odd, then there are two sizes that do not contain '''T''' and one size that contains '''T'''; if the number of ''k''-steps stacked is even, then there is one size that does not contain '''T''' and two sizes that contain T. Hence ''s'' is SV3. | ||
In this case we have Σ = '''QRQR'''...'''QRT''', and '' | In this case we have Σ = '''QRQR'''...'''QRT''', and ''s'' is well-formed with respect to the generator '''Q''' + '''R''', thus ''s'' satisfies the generator-offset property. By Proposition 1, ''s'' is SV3. | ||
'''Case 3:''' 3 ≤ μ ≤ floor(''n''/2). | '''Case 3:''' 3 ≤ μ ≤ floor(''n''/2). | ||
| Line 200: | Line 200: | ||
Λ<sub>3</sub> = γ γ′ γ γ γ′ γ γ | Λ<sub>3</sub> = γ γ′ γ γ γ′ γ γ | ||
Suppose a step of '' | Suppose a step of ''s'' is reached by stacking ''t''-many ''k''-steps. We have three cases after accounting for equave complements: | ||
# ''t'' = 1: '' | # ''t'' = 1: ''s'' is equivalent to '''abacaba'''. | ||
# ''t'' = 2: '' | # ''t'' = 2: ''s'' is '''QR QQ RQ TQ RQ QR QT''' => ''s'' is equivalent to '''abacaba'''. | ||
# ''t'' = 3: '' | # ''t'' = 3: ''s'' is '''QRQ QRQ TQR QQR QTQ RQQ RQT''' => ''s'' is equivalent to '''abacaba'''. | ||
(This also implies '' | (This also implies ''s'' is SV3.) | ||
'''Case 3.2''': (''x'', ''y'') = (floor(''n''/μ) + 1, 2*floor(''n''/μ) − 1) is impossible: Here (''x'', ''y'') = (4, 5). But then Λ<sub>2</sub> has a chunk of size < 3 because of the β' at index ''n'', contradicting that ''x'' is one of the chunk sizes of Λ<sub>2</sub>. | '''Case 3.2''': (''x'', ''y'') = (floor(''n''/μ) + 1, 2*floor(''n''/μ) − 1) is impossible: Here (''x'', ''y'') = (4, 5). But then Λ<sub>2</sub> has a chunk of size < 3 because of the β' at index ''n'', contradicting that ''x'' is one of the chunk sizes of Λ<sub>2</sub>. | ||
| Line 225: | Line 225: | ||
All pairwise-well-formed scales are [[balanced]]. | All pairwise-well-formed scales are [[balanced]]. | ||
=== Proof === | === Proof === | ||
Let '' | Let ''s'' be a PWF (thus primitive) 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 a class of generators of the primitive MOS ''a'''''X''' 2''b'''''W'''. This MOS is obtained from ''s'' by applying the letterwise substitution function π such that π('''X''') = '''X''' and π('''Y''') = π('''Z''') = '''W'''. Naturally, π applies to linear words, circular words, and abstract dyad sizes. Additionally, we can choose ''k'' so that the two sizes of ''k''-steps in π(''s'') are: | ||
* the perfect generator '''g''' = ''t'''''X''' + (''k'' − ''t'')'''W''' (note (''k'' − ''t'') is odd by a previous proof), and | * the perfect generator '''g''' = ''t'''''X''' + (''k'' − ''t'')'''W''' (note (''k'' − ''t'') is odd by a previous proof), and | ||
* the imperfect generator '''i''' = (''t'' + 1)'''X''' + (''k'' − ''t'' − 1)'''W'''. | * the imperfect generator '''i''' = (''t'' + 1)'''X''' + (''k'' − ''t'' − 1)'''W'''. | ||
We have π('''g'''<sub>1</sub>) = π('''g'''<sub>2</sub>) = '''g'''. Let '''h''' be the size in '' | 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> − 1 (the other case corresponds to the opposite chirality). | ||
As '' | 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''. | # Such a stack has a unique number ''m'' = ''m''(''j'') of ''k''-steps for a given ''j''. | ||
# Either such a stack has '''i''' as one of its ''k''-steps, or it does not. | # Either such a stack has '''i''' as one of its ''k''-steps, or it does not. | ||
Depending on point (2), ''m'' may be even or odd. If ''m'' is odd, then in any stack in '' | Depending on point (2), ''m'' may be even or odd. If ''m'' is odd, then in any stack in ''s'' that does not have '''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''. On the other hand, '''i''' has an even number of non-'''X''' steps, thus the numbers of '''Y''' and '''Z''' are the same in '''v''' and equal to min(|'''u'''<sub>1</sub>|<sub>'''Y'''</sub>, |'''u'''<sub>2</sub>|<sub>'''Y'''</sub>). | ||
In summary: Let '''u'''<sub>1</sub>, '''u'''<sub>2</sub> be the two sizes that do not include '''i''', and '''v''' be the size that does. Say that '''u'''<sub>1</sub> has one more '''g'''<sub>1</sub> than '''g'''<sub>2</sub>. Then | In summary: Let '''u'''<sub>1</sub>, '''u'''<sub>2</sub> be the two sizes that do not include '''i''', and '''v''' be the size that does. Say that '''u'''<sub>1</sub> has one more '''g'''<sub>1</sub> than '''g'''<sub>2</sub>. Then | ||
| Line 246: | Line 246: | ||
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 6.1 (Classification of ternary balanced scales) === | === Theorem 6.1 (Classification of ternary balanced scales) === | ||
# A primitive [[balanced]] MV3 scale '' | # A primitive [[balanced]] MV3 scale ''s'' is one of the following: | ||
## '' | ## ''s'' is equivalent to '''XYXZXYX''', the ternary Fraenkel word. | ||
## len('' | ## len(''s'') is odd, and ''s'' is equivalent 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. | ||
## len(S) is even, and '' | ## len(S) is even, and ''s'' is equivalent to a word constructed from taking the brightest mode of the MOS 2''a'''''X''' 2''b'''''Z''' with ''a'' odd and gcd(''a'', ''b'') = 1, and replacing every other '''X''' with '''Y'''. | ||
# 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 of type (3). | # A balanced primitive ternary scale is SV3 if and only if it is not of type (3). | ||