Ternary scale theorems: Difference between revisions

Inthar (talk | contribs)
m →Statement (5): I forgot to say "*by part (4)* `s` has a template MOS"...
Inthar (talk | contribs)
m "mos" -> "MOS"
Line 14: Line 14:
*# 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.
* A scale is ''primitive'' if its period is the same as its equave. A ''multimos'' or ''multiperiod mos'' is a non-primitive mos. A mos ''a'''''L''' ''b'''''s''' is primitive iff gcd(''a'', ''b'') = 1. This corresponds to the term ''single-period'' in common xen parlance. Any multimos can be constructed from a primitive mos by repeating the mos pattern multiple times, e.g. if 3'''L''' 2'''s''' is '''LLsLs''', then 9'''L''' 6'''s''' is '''LLsLsLLsLsLLsLs'''.
* A scale is ''primitive'' if its period is the same as its equave. A ''multiMOS'' or ''multiperiod MOS'' is a non-primitive MOS. A MOS ''a'''''L''' ''b'''''s''' is primitive iff gcd(''a'', ''b'') = 1. This corresponds to the term ''single-period'' in common xen parlance. Any multiMOS can be constructed from a primitive MOS by repeating the MOS pattern multiple times, e.g. if 3'''L''' 2'''s''' is '''LLsLs''', then 9'''L''' 6'''s''' is '''LLsLsLLsLsLLsLs'''.
* An ''n''-''ary'' scale is a scale with ''n'' different step sizes. ''Binary'' and ''ternary'' are used when ''n'' = 2 and 3 respectively.
* An ''n''-''ary'' scale is a scale with ''n'' different step sizes. ''Binary'' and ''ternary'' are used when ''n'' = 2 and 3 respectively.
* For the [[generator-offset property]], see the article.
* For the [[generator-offset property]], see the article.
* 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'' &ge; 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'' &ge; 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 ''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''.
* 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 ''s'', denoted ''s''[''i'' : ''j''] (''j'' > ''i''), we mean ''s''[''i''] ''s''[''i'' + 1] ... ''s''[''j'' &minus; 1].
* 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'' &minus; 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'').  
* A ''projection'' of a ternary scale is the operation of equating two of its step sizes.
* A ''projection'' of a ternary scale is the operation of equating two of its step sizes.
* A ternary scale is ''pairwise-well-formed'' if all its projections are well-formed (i.e. primitive mosses).
* A ternary scale is ''pairwise-well-formed'' if all its projections are well-formed (i.e. primitive MOSes).


== Theorem 1 (Properties of SGA scales) ==  
== Theorem 1 (Properties of SGA scales) ==  
Line 110: Line 110:
== Theorem 3 (Properties of even generator-offset ternary scales) ==
== Theorem 3 (Properties of even generator-offset ternary scales) ==
A primitive generator-offset ternary scale ''s'' of even size 6 or greater, where the generator '''g''' is an even-step, has the following properties:
A primitive generator-offset ternary scale ''s'' of even size 6 or greater, where the generator '''g''' is an even-step, has the following properties:
# ''s'' is a union of two copies of a primitive mos ''M'' of size ''n''/2 generated by g; thus it is a [[flought scale]] obtained by taking two offset copies of said primitive mos.
# ''s'' is a union of two copies of a primitive MOS ''M'' of size ''n''/2 generated by g; thus it is a [[flought scale]] obtained by taking two offset copies of said primitive MOS.
# ''s'' is ''not'' SV3.
# ''s'' is ''not'' SV3.
# ''s'' is ''not'' chiral.
# ''s'' is ''not'' chiral.
Line 118: Line 118:


== Theorem 4 (Classification of pairwise well-formed scales) ==
== Theorem 4 (Classification of pairwise well-formed scales) ==
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'''.
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 MOSes). 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 ''s'' is a ''k''-step, the word of stacked ''k''-steps in ''s'' is pairwise well-formed ====
==== 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 ''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.
Suppose ''s'' has ''n'' notes (after dealing with small cases, we may assume ''n'' ≥ 7) and ''s'' projects to primitive MOSes ''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 MOSes, 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 MOSes.


  index: 1 2 3 4 ...  ''n''
  index: 1 2 3 4 ...  ''n''
  Σ<sub>1</sub>:    '''P P P P ... P I'''
  Σ<sub>1</sub>:    '''P P P P ... P I'''
  Σ<sub>2</sub>:    [some mos]
  Σ<sub>2</sub>:    [some MOS]
  Σ<sub>3</sub>:    [some mos]
  Σ<sub>3</sub>:    [some MOS]


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'''.
Line 133: Line 133:
We can write sizes of dyads in ''s'' as vectors (''p'', ''q'', ''r'') using the basis ('''a''', '''b''', '''c''').  
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 ''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.
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 ''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>.
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 ''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'' &minus; β)('''a'''~'''c''') and β′a + (''n'' &minus; β′)('''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 '''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'' &minus; β)('''a'''~'''c''') and β′a + (''n'' &minus; β′)('''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.


Either β′′ = β or β′′ = β′. Assume β′′ = β′. Then γ′′ = γ, and Λ<sub>3</sub> is (λ + 1)γ (μ &minus; 1)γ′. Also assume that the first ''k''-step in Σ is '''Q'''. Then we have:
Either β′′ = β or β′′ = β′. Assume β′′ = β′. Then γ′′ = γ, and Λ<sub>3</sub> is (λ + 1)γ (μ &minus; 1)γ′. Also assume that the first ''k''-step in Σ is '''Q'''. Then we have:
Line 151: Line 151:


==== Case analysis ====
==== Case analysis ====
Since, by our assumption, Λ<sub>3</sub> has two γ in a row, Λ<sub>3</sub> must have more γ than γ′, so μ &minus; 1 < ''n''/2. Since Λ<sub>3</sub> is a mos, μ &minus; 1 ≥ 1. So we have 2 ≤ μ ≤ ceil(''n''/2).
Since, by our assumption, Λ<sub>3</sub> has two γ in a row, Λ<sub>3</sub> must have more γ than γ′, so μ &minus; 1 < ''n''/2. Since Λ<sub>3</sub> is a MOS, μ &minus; 1 ≥ 1. So we have 2 ≤ μ ≤ ceil(''n''/2).


We have three cases to consider:
We have three cases to consider:


'''Case 1''': μ = 2, i.e. Λ<sub>2</sub> is the mos (''n'' &minus; 2)β 2β′.
'''Case 1''': μ = 2, i.e. Λ<sub>2</sub> is the MOS (''n'' &minus; 2)β 2β′.


For Λ<sub>2</sub> to be a mos, the first, and only, occurrence of '''R''' must be at either ''f'' = floor(''n''/2) or ceil(''n''/2). We may assume that it is at ''f''; otherwise reverse the chain and reindex the words to start at 2''f''.
For Λ<sub>2</sub> to be a MOS, the first, and only, occurrence of '''R''' must be at either ''f'' = floor(''n''/2) or ceil(''n''/2). We may assume that it is at ''f''; otherwise reverse the chain and reindex the words to start at 2''f''.


       1 …  ''f''    … 2''f'' ''n''
       1 …  ''f''    … 2''f'' ''n''
Line 190: Line 190:
'''Case 3.1:''' (''x'', ''y'') = (floor(''n''/μ), 2*floor(''n''/μ) &minus; 1).
'''Case 3.1:''' (''x'', ''y'') = (floor(''n''/μ), 2*floor(''n''/μ) &minus; 1).


Since ''y'' &minus; ''x'' = floor(''n''/μ) &minus; 1, we have ''x'' = floor(''n''/μ) = 2 and ''y'' = 3. The chunk in Λ<sub>3</sub> whose size was defined to be ''y'' is made from two consecutive chunks in Λ<sub>2</sub> of size 1. (So Λ<sub>2</sub> has chunks of size 1 and 2, and Λ<sub>3</sub> has chunks of size 2 and 3.) Since chunk sizes of a mos themselves form a mos, Λ<sub>2</sub> has more chunks of size 1 than it has chunks of size 2.
Since ''y'' &minus; ''x'' = floor(''n''/μ) &minus; 1, we have ''x'' = floor(''n''/μ) = 2 and ''y'' = 3. The chunk in Λ<sub>3</sub> whose size was defined to be ''y'' is made from two consecutive chunks in Λ<sub>2</sub> of size 1. (So Λ<sub>2</sub> has chunks of size 1 and 2, and Λ<sub>3</sub> has chunks of size 2 and 3.) Since chunk sizes of a MOS themselves form a MOS, Λ<sub>2</sub> has more chunks of size 1 than it has chunks of size 2.


Λ<sub>2</sub> has only two chunks of size 1, Λ<sub>2</sub>[''n'' &minus; 1] and Λ<sub>2</sub>[1], since otherwise Λ<sub>3</sub> would have a chunk of size 1 within Λ<sub>3</sub>[1 : ''n'']. Thus Λ<sub>2</sub> has exactly one chunk of size 2. Thus Λ<sub>2</sub> = ββ′βββ′ββ′ and Λ<sub>3</sub> = γγ′γγγ′γγ. Thus we have:
Λ<sub>2</sub> has only two chunks of size 1, Λ<sub>2</sub>[''n'' &minus; 1] and Λ<sub>2</sub>[1], since otherwise Λ<sub>3</sub> would have a chunk of size 1 within Λ<sub>3</sub>[1 : ''n'']. Thus Λ<sub>2</sub> has exactly one chunk of size 2. Thus Λ<sub>2</sub> = ββ′βββ′ββ′ and Λ<sub>3</sub> = γγ′γγγ′γγ. Thus we have:
Line 256: Line 256:
=== Theorem 6.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.
## 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''[7]''w''[8] and ''w''[14]''w''[1] (using one-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''[7]''w''[8] and ''w''[14]''w''[1] (using one-based numbering).
## Replace every other '''X''' with '''Y''' in ''w''.
## Replace every other '''X''' with '''Y''' in ''w''.


Line 263: Line 263:
Most of this has been proved by Bulgakova, Buzhinsky and Goncharov (2023), "[https://arxiv.org/pdf/2012.15818 On balanced and abelian properties of circular words over a ternary alphabet]".
Most of this has been proved by Bulgakova, Buzhinsky and Goncharov (2023), "[https://arxiv.org/pdf/2012.15818 On balanced and abelian properties of circular words over a ternary alphabet]".


Note: The xen term "brightest mos word" is equivalent to "Christoffel word" in the paper, and similarly "brightest multimos word" is equivalent to "powers of a Christoffel word". Also see [[Glossary for combinatorics on words]] for more equivalents between xen community terms and standard academic terminology.
Note: The xen term "brightest MOS word" is equivalent to "Christoffel word" in the paper, and similarly "brightest multiMOS word" is equivalent to "powers of a Christoffel word". Also see [[Glossary for combinatorics on words]] for more equivalents between xen community terms and standard academic terminology.


For 6.1.3: The ternary Fraenkel word may be verified as SV3 by inspection, and we have already shown in Theorem 1 that balanced scales of type (2) are SV3. To show that balanced scales of type (3) are ''not'' SV3, observe that (''a''+''b'')-steps come in only 2 sizes in such a scale ''s'': floor(''a''/2)'''X''' + ceil(''a''/2)'''Y''' + ''b'''''Z''' and ceil(''a''/2)'''X''' + floor(''a''/2)'''Y''' + ''b'''''Z''', since the underlying MOS 2''a'''''X''' 2''b'''''Y''' only has the (''a''+''b'')-step ''a'''''X''' + ''b'''''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 (''a''+''b'')-step subword ''s''[''k'' : ''k''+''a''+''b''] becomes the subword ''s''[''k''+''a''+''b'' : ''k''+2''a''+2''b''] via interchanging '''X''' and '''Y'''.
For 6.1.3: The ternary Fraenkel word may be verified as SV3 by inspection, and we have already shown in Theorem 1 that balanced scales of type (2) are SV3. To show that balanced scales of type (3) are ''not'' SV3, observe that (''a''+''b'')-steps come in only 2 sizes in such a scale ''s'': floor(''a''/2)'''X''' + ceil(''a''/2)'''Y''' + ''b'''''Z''' and ceil(''a''/2)'''X''' + floor(''a''/2)'''Y''' + ''b'''''Z''', since the underlying MOS 2''a'''''X''' 2''b'''''Y''' only has the (''a''+''b'')-step ''a'''''X''' + ''b'''''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 (''a''+''b'')-step subword ''s''[''k'' : ''k''+''a''+''b''] becomes the subword ''s''[''k''+''a''+''b'' : ''k''+2''a''+2''b''] via interchanging '''X''' and '''Y'''.