Ternary scale theorems: Difference between revisions
| Line 276: | Line 276: | ||
(a) Let ''s'' be a ternary balanced word; then for any given letter '''y''' the number of '''y'''s in a subword of any given length ''L'' varies by at most 1. Thus the same is true when we count all non-'''y''' letters in any subword of length ''L''; thus when we equate '''x''' and '''z''', the count of the resulting letter in any subword of length ''L'' differs by 1. Being a binary balanced word is one characterization of the MOS property. | (a) Let ''s'' be a ternary balanced word; then for any given letter '''y''' the number of '''y'''s in a subword of any given length ''L'' varies by at most 1. Thus the same is true when we count all non-'''y''' letters in any subword of length ''L''; thus when we equate '''x''' and '''z''', the count of the resulting letter in any subword of length ''L'' differs by 1. Being a binary balanced word is one characterization of the MOS property. | ||
(b) Assume that the projection ''p''<sub>'''YZ'''</sub>(''s'') identifying '''Y''' and '''Z''' of a PMOS scale ''s'' is an ''r''-period MOS with step signature ''ar'''''X''' ''cr'''''W'''... | (b) Assume that the projection ''p''<sub>'''YZ'''</sub>(''s'') identifying '''Y''' and '''Z''' of a primitive PMOS scale ''s'' is an ''r''-period MOS with step signature ''ar'''''X''' ''cr'''''W'''... | ||
For 7.1.2: Suppose ''s'' is balanced and has at least three sizes for ''k''-steps, ''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 ''i'' = 1, 2, 3. We may assume (''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 (''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 (''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 7.1.2: Suppose ''s'' is balanced and has at least three sizes for ''k''-steps, ''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 ''i'' = 1, 2, 3. We may assume (''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 (''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 (''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. | ||