Ternary scale theorems: Difference between revisions
m →Proof |
m →Proof |
||
| Line 233: | Line 233: | ||
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>). | 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 include '''i''', and '''v''' be the size that does | 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 | ||
* |'''u'''<sub>1</sub>|<sub>'''X'''</sub> = |'''u'''<sub>2</sub>|<sub>'''X'''</sub> = |v|<sub>'''X'''</sub> − 1 | * |'''u'''<sub>1</sub>|<sub>'''X'''</sub> = |'''u'''<sub>2</sub>|<sub>'''X'''</sub> = |v|<sub>'''X'''</sub> − 1 | ||
* |'''u'''<sub>1</sub>|<sub>'''Y'''</sub> = |'''u'''<sub>2</sub>|<sub>'''Y'''</sub> + 1 | * |'''u'''<sub>1</sub>|<sub>'''Y'''</sub> = |'''u'''<sub>2</sub>|<sub>'''Y'''</sub> + 1 | ||