Ternary scale theorems: Difference between revisions
No edit summary |
No edit summary |
||
| Line 22: | Line 22: | ||
* 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]. | * 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 | * ''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 mosses). | ||
| Line 170: | Line 170: | ||
These give exactly three distinct sizes for every dyad class. Hence ''s'' is SV3. | These give exactly three distinct sizes for every dyad class. Hence ''s'' is SV3. | ||
In this case | 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 β′. | ||