Ternary scale theorems: Difference between revisions
m →Theorem 6 (Classification of MV3 scales): Minor corrections for twisted MV3s. |
m →Proof: Clarifying |
||
| Line 106: | Line 106: | ||
Assume 1 < gcd(''k'', ''n'') < ''n'' and ''n'' ≥ 5. Since ''n'' is odd, ''d'' = gcd(''k'', ''n'') is an odd number at least 3, and by well-formedness with respect to the generator, there must be a circle of ''n''/''d'' < floor(''n''/2) notes formed by '''g''', contrary to the assumption of GO. Thus, gcd(''k'', ''n'') = 1. | Assume 1 < gcd(''k'', ''n'') < ''n'' and ''n'' ≥ 5. Since ''n'' is odd, ''d'' = gcd(''k'', ''n'') is an odd number at least 3, and by well-formedness with respect to the generator, there must be a circle of ''n''/''d'' < floor(''n''/2) notes formed by '''g''', contrary to the assumption of GO. Thus, gcd(''k'', ''n'') = 1. | ||
Since ''n'' is odd, if 0 ≤ ''r'' < ''n'', then ''rk'' ≡ ''k''/2 mod ''n'' iff ''r'' ≡ (''n'' + 1)/2 mod ''n''. (Note that both 2 and ''k'' are coprime with ''n'', hence multiplicatively invertible mod ''n''.) This proves that the offset, which must be reached after (''n'' + 1)/2 ''k''-steps, is a ''k''/2-step, as desired. (As [''k''] is a generator of ℤ/''n'', stacking (''n'' − 1)-many ''k''-steps must visit every note exactly once. Thus if the offset wasn't reached in (''n'' + 1)/2 steps, the two generator chains wouldn't have the assumed lengths.) {{qed}} | |||
== Theorem 3 (Properties of even generator-offset ternary scales) == | == Theorem 3 (Properties of even generator-offset ternary scales) == | ||