Ternary scale theorems: Difference between revisions
No edit summary |
|||
| Line 1: | Line 1: | ||
A ''ternary scale'' is a scale with three (positive) step sizes, with no other constraints. This page documents known properties of subtypes of ternary scales and their proofs. | A ''ternary scale'' is a scale with three (positive) step sizes, with no other constraints such as maximum variety. This page documents known properties of subtypes of ternary scales and their proofs. | ||
== Conventions == | |||
* Non-italicized Latin variables refer to interval sizes, for example step sizes. | * Non-italicized Latin variables refer to interval sizes, for example step sizes. | ||
* Indices for all words are 1-indexed. | * Indices for all words are 1-indexed. | ||
| Line 7: | Line 6: | ||
* The notation ''S''(X<sub>1</sub>, ..., X<sub>''r''</sub>) is used for an ''r''-ary scale word with variables X<sub>1</sub>, ..., X<sub>''r''</sub> possibly standing in for any sizes. If ''S''(X, Y) = XXY then ''S''(A, B) = AAB. | * The notation ''S''(X<sub>1</sub>, ..., X<sub>''r''</sub>) is used for an ''r''-ary scale word with variables X<sub>1</sub>, ..., X<sub>''r''</sub> possibly standing in for any sizes. If ''S''(X, Y) = XXY then ''S''(A, B) = AAB. | ||
* We leave the distinction between linear and cyclic words up to context. We usually also elide the distinction between subwords and the interval sizes that subtend them. | * We leave the distinction between linear and cyclic words up to context. We usually also elide the distinction between subwords and the interval sizes that subtend them. | ||
== Definitions == | |||
* A cyclic word ''S'' (representing the steps of a [[periodic scale]]) of size ''n'' is '''generator-offset''' if it satisfies the following properties. The following conditions do not imply that g<sub>1</sub> and g<sub>2</sub> are the same number of scale steps. For example, 5-limit [[blackdye]] has g<sub>1</sub> = 9/5 (a 9-step) and g<sub>2</sub> = 5/3 (a 7-step). | * A cyclic word ''S'' (representing the steps of a [[periodic scale]]) of size ''n'' is '''generator-offset''' if it satisfies the following properties. The following conditions do not imply that g<sub>1</sub> and g<sub>2</sub> are the same number of scale steps. For example, 5-limit [[blackdye]] has g<sub>1</sub> = 9/5 (a 9-step) and g<sub>2</sub> = 5/3 (a 7-step). | ||
*# ''S'' is generated by two chains of stacked generators g separated by a fixed offset δ; either both chains are of size ''n''/2, or one chain has size (''n'' + 1)/2 and the second has size (''n'' − 1)/2. Equivalently, ''S'' can be built by stacking a single chain of alternants g<sub>1</sub> and g<sub>2</sub>, resulting in a circle of the form either g<sub>1</sub> g<sub>2</sub> ... g<sub>1</sub> g<sub>2</sub> g<sub>1</sub> g<sub>3</sub> or g<sub>1</sub> g<sub>2</sub> ... g<sub>1</sub> g<sub>2</sub> g<sub>3</sub>. | *# ''S'' is generated by two chains of stacked generators g separated by a fixed offset δ; either both chains are of size ''n''/2, or one chain has size (''n'' + 1)/2 and the second has size (''n'' − 1)/2. Equivalently, ''S'' can be built by stacking a single chain of alternants g<sub>1</sub> and g<sub>2</sub>, resulting in a circle of the form either g<sub>1</sub> g<sub>2</sub> ... g<sub>1</sub> g<sub>2</sub> g<sub>1</sub> g<sub>3</sub> or g<sub>1</sub> g<sub>2</sub> ... g<sub>1</sub> g<sub>2</sub> g<sub>3</sub>. | ||
| Line 23: | Line 22: | ||
* A ternary scale is ''pairwise-well-formed'' if all its projections are well-formed (i.e. single-period mosses). | * A ternary scale is ''pairwise-well-formed'' if all its projections are well-formed (i.e. single-period mosses). | ||
== Proposition 1 (Properties of SGA scales) == | |||
Let ''S'' be a ternary scale word in L, M, and s of length ''n'', and suppose ''S'' is SGA. Then: | Let ''S'' be a ternary scale word in L, M, and s of length ''n'', and suppose ''S'' is SGA. Then: | ||
# The length of ''S'' is odd, or ''S'' is equivalent to (xy)<sup>''r''</sup>xz for some integer ''r'' ≥ 1. | # The length of ''S'' is odd, or ''S'' is equivalent to (xy)<sup>''r''</sup>xz for some integer ''r'' ≥ 1. | ||
| Line 35: | Line 34: | ||
[Note: This is not true with SGA replaced with generator-offset; [[blackdye]] is a counterexample that is MV4.] | [Note: This is not true with SGA replaced with generator-offset; [[blackdye]] is a counterexample that is MV4.] | ||
=== Proof === | |||
Let e be the equave of ''S''. | Let e be the equave of ''S''. | ||
| Line 48: | Line 47: | ||
Label the notes (1, ''j'') and (2, ''j''), 1 ≤ ''j'' ≤ (number of notes in the chain), for notes in the upper and lower chain respectively. | Label the notes (1, ''j'') and (2, ''j''), 1 ≤ ''j'' ≤ (number of notes in the chain), for notes in the upper and lower chain respectively. | ||
==== Statement (1) ==== | |||
In case 1, let g<sub>1</sub> = (2, 1) − (1, 1), g<sub>2</sub> = (1, 2) − (2, 1), and g<sub>3</sub> = (1, 1) − (''n''/2, 2) = (−''n''/2*g<sub>1</sub> − g<sub>1</sub> − ''n''/2*g<sub>2</sub>) mod e. We assume that g<sub>1</sub>, g<sub>2</sub> and e are '''Z'''-linearly independent. We have the chain g<sub>1</sub> g<sub>2</sub> g<sub>1</sub> g<sub>2</sub> ... g<sub>1</sub> g<sub>3</sub> which visits every note in ''S''. | In case 1, let g<sub>1</sub> = (2, 1) − (1, 1), g<sub>2</sub> = (1, 2) − (2, 1), and g<sub>3</sub> = (1, 1) − (''n''/2, 2) = (−''n''/2*g<sub>1</sub> − g<sub>1</sub> − ''n''/2*g<sub>2</sub>) mod e. We assume that g<sub>1</sub>, g<sub>2</sub> and e are '''Z'''-linearly independent. We have the chain g<sub>1</sub> g<sub>2</sub> g<sub>1</sub> g<sub>2</sub> ... g<sub>1</sub> g<sub>3</sub> which visits every note in ''S''. | ||
| Line 61: | Line 60: | ||
These are all distinct by '''Z'''-linear independence. By applying this argument to 1-steps, we see that there must be 4 step sizes in some tuning, a contradiction. Thus g<sub>1</sub> and g<sub>2</sub> must themselves be step sizes. Thus we see that an even-length, abstractly SV3, generator-offset scale must be of the form (xy)<sup>''r''</sup>xz. (Note that (xy)<sup>''r''</sup>xz is not SV3, since it has only two kinds of 2-steps, xy and xz.) This proves (1). | These are all distinct by '''Z'''-linear independence. By applying this argument to 1-steps, we see that there must be 4 step sizes in some tuning, a contradiction. Thus g<sub>1</sub> and g<sub>2</sub> must themselves be step sizes. Thus we see that an even-length, abstractly SV3, generator-offset scale must be of the form (xy)<sup>''r''</sup>xz. (Note that (xy)<sup>''r''</sup>xz is not SV3, since it has only two kinds of 2-steps, xy and xz.) This proves (1). | ||
==== Statement (2) ==== | |||
In case 2, let (2, 1) − (1, 1) = g<sub>1</sub>, (1, 2) − (2, 1) = g<sub>2</sub> be the two alternants. Let g<sub>3</sub> be the leftover generator after stacking alternating g<sub>1</sub> and g<sub>2</sub>. Then the generator circle looks like g<sub>1</sub> g<sub>2</sub> g<sub>1</sub> g<sub>2</sub> ... g<sub>1</sub> g<sub>2</sub> g<sub>3</sub>. Assuming that a step is an odd number of generators, the combinations of alternants corresponding to a step come in exactly 3 sizes: | In case 2, let (2, 1) − (1, 1) = g<sub>1</sub>, (1, 2) − (2, 1) = g<sub>2</sub> be the two alternants. Let g<sub>3</sub> be the leftover generator after stacking alternating g<sub>1</sub> and g<sub>2</sub>. Then the generator circle looks like g<sub>1</sub> g<sub>2</sub> g<sub>1</sub> g<sub>2</sub> ... g<sub>1</sub> g<sub>2</sub> g<sub>3</sub>. Assuming that a step is an odd number of generators, the combinations of alternants corresponding to a step come in exactly 3 sizes: | ||
# ''k''g<sub>1</sub> + (''k'' − 1)g<sub>2</sub> | # ''k''g<sub>1</sub> + (''k'' − 1)g<sub>2</sub> | ||
| Line 69: | Line 68: | ||
(The above holds for any odd ''n'' ≥ 3.) | (The above holds for any odd ''n'' ≥ 3.) | ||
==== Statement (3) ==== | |||
For (3), we now only need to see that if len(''S'') is odd and ''S'' is SGA, ''S'' is abstractly SV3. But the argument in case 2 above works when you substitute any interval class in ''S'' instead of a 1-step (abstract SV3 wasn't used), hence any interval class comes in (abstractly) exactly 3 sizes. | For (3), we now only need to see that if len(''S'') is odd and ''S'' is SGA, ''S'' is abstractly SV3. But the argument in case 2 above works when you substitute any interval class in ''S'' instead of a 1-step (abstract SV3 wasn't used), hence any interval class comes in (abstractly) exactly 3 sizes. | ||
==== Statement (4) ==== | |||
For (4), assume ''S'' is ''a''X ''b''Y ''b''Z, ''a'' odd. If ''b'' = 1, there's nothing to prove, so assume ''b'' > 1. | For (4), assume ''S'' is ''a''X ''b''Y ''b''Z, ''a'' odd. If ''b'' = 1, there's nothing to prove, so assume ''b'' > 1. | ||
| Line 86: | Line 85: | ||
These two claims prove that ''E''<sub>X</sub>(S) = (YZ)<sup>''b''</sup> and that the two alternants' sizes differ by replacing one Y for a Z. | These two claims prove that ''E''<sub>X</sub>(S) = (YZ)<sup>''b''</sup> and that the two alternants' sizes differ by replacing one Y for a Z. | ||
==== Statement (5) ==== | |||
For (5), odd-numbered SGA scales are [[Fokker block]]s (in the 2-dimensional lattice generated by the generator and the offset). To see this, consider the following lattice depiction of such a scale: | For (5), odd-numbered SGA scales are [[Fokker block]]s (in the 2-dimensional lattice generated by the generator and the offset). To see this, consider the following lattice depiction of such a scale: | ||
x x x ... x | x x x ... x | ||
| Line 92: | Line 91: | ||
and use the vectors (-1, 2) and (ceil(n/2), 1) as the Fokker block chromas. A rank-3 Fokker block has the property that tempering out by each of the chromas gives two mosses. These correspond to two of the temperings X = Y, Y = Z and X = Z. The third tempering follows by symmetry (by taking the other chirality). | and use the vectors (-1, 2) and (ceil(n/2), 1) as the Fokker block chromas. A rank-3 Fokker block has the property that tempering out by each of the chromas gives two mosses. These correspond to two of the temperings X = Y, Y = Z and X = Z. The third tempering follows by symmetry (by taking the other chirality). | ||
==== Statement (6) ==== | |||
For (6), consider the mos ''a''X 2''b''W as chunks of X separated by W (tempering Y and Z together into W). Eliminating every other W (corresponding to either Y or Z) turns it into a mos: | For (6), consider the mos ''a''X 2''b''W as chunks of X separated by W (tempering Y and Z together into W). Eliminating every other W (corresponding to either Y or Z) turns it into a mos: | ||
# The chunk sizes of X form a mos, and taking every ''k''th note of an ''n''-note mos yields a mos. | # The chunk sizes of X form a mos, and taking every ''k''th note of an ''n''-note mos yields a mos. | ||
| Line 99: | Line 98: | ||
Lastly, ''E''<sub>X</sub>(''S'') is the mos ''b''Y ''b''Z; hence ''S'' is elimination-mos. | Lastly, ''E''<sub>X</sub>(''S'') is the mos ''b''Y ''b''Z; hence ''S'' is elimination-mos. | ||
== Proposition 2 (Odd generator-offset scales are SGA) == | |||
Suppose that a periodic scale satisfies the following: | Suppose that a periodic scale satisfies the following: | ||
* is generator-offset | * is generator-offset | ||
| Line 106: | Line 105: | ||
Then the scale is SGA. | Then the scale is SGA. | ||
=== Proof === | |||
Assume that the generator is a ''k''-step and ''k'' is even. (If ''k'' is not even, invert the generator.) On some note ''p'' we have a chain of (''n'' + 1)/2 notes and on ''p′'' = ''p'' + offset we'll have (''n'' − 1)/2) notes. | Assume that the generator is a ''k''-step and ''k'' is even. (If ''k'' is not even, invert the generator.) On some note ''p'' we have a chain of (''n'' + 1)/2 notes and on ''p′'' = ''p'' + offset we'll have (''n'' − 1)/2) notes. | ||
| Line 113: | Line 112: | ||
By modular arithmetic we have ''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. (If the offset wasn't reached in (''n'' + 1)/2 steps, the two generator chains either wouldn't be disjoint or wouldn't have the assumed lengths.) | By modular arithmetic we have ''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. (If the offset wasn't reached in (''n'' + 1)/2 steps, the two generator chains either wouldn't be disjoint or wouldn't have the assumed lengths.) | ||
== Proposition 3 (Properties of even generator-offset ternary scales) == | |||
A primitive generator-offset ternary scale of even size where the generator g is an even-step (i.e. g subtends an even number of steps) has the following properties: | A primitive generator-offset ternary scale of even size where the generator g is an even-step (i.e. g subtends an even number of steps) has the following properties: | ||
# It is a union of two primitive mosses of size ''n''/2 generated by g | # It is a union of two primitive mosses of size ''n''/2 generated by g | ||
| Line 119: | Line 118: | ||
# It is ''not'' chiral | # It is ''not'' chiral | ||
# It is a primitive mos word of two of the letters interleaved with the third letter, for example: XYXZXYXZXY, made by interleaving X's in the mos word YZYZY. | # It is a primitive mos word of two of the letters interleaved with the third letter, for example: XYXZXYXZXY, made by interleaving X's in the mos word YZYZY. | ||
=== Proof === | |||
(1) and (2) were proved in the proof of Proposition 1 (the part that we appeal to, from "all multiples of the generator g must be even-steps ..." to "These are all distinct by Z-linear independence", does not rely on ''S'' having the SGA property). (3) and (4) are easy to check using (1). | (1) and (2) were proved in the proof of Proposition 1 (the part that we appeal to, from "all multiples of the generator g must be even-steps ..." to "These are all distinct by Z-linear independence", does not rely on ''S'' having the SGA property). (3) and (4) are easy to check using (1). | ||
== Theorem 4 (Classification of pairwise well-formed scales) == | |||
Let ''S''(a, b, c) be a scale word in three '''Z'''-linearly independent step sizes a, b, c. Suppose ''S'' is pairwise well-formed (equivalently, all its projections are single-period 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 '''Z'''-linearly independent step sizes a, b, c. Suppose ''S'' is pairwise well-formed (equivalently, all its projections are single-period 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. | ||
=== 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 ==== | |||
Suppose ''S'' has ''n'' notes (after dealing with small cases, we may assume ''n'' ≥ 7) and ''S'' projects to single-period 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 single-period 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 single-period mosses. | Suppose ''S'' has ''n'' notes (after dealing with small cases, we may assume ''n'' ≥ 7) and ''S'' projects to single-period 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 single-period 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 single-period mosses. | ||
| Line 135: | Line 134: | ||
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. | ||
==== Two sizes of ''k''-steps in ''S'' project to ''S''<sub>1</sub>'s perfect generator ==== | |||
We can write sizes of intervals in ''S'' as vectors (''p'', ''q'', ''r'') using the basis (a, b, c). | We can write sizes of intervals in ''S'' as vectors (''p'', ''q'', ''r'') using the basis (a, b, c). | ||
| Line 142: | Line 141: | ||
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. ==== | |||
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 cyclic word Λ<sub>1</sub> formed by the a-components of the ''k''-steps in P is α...αα′. Since Σ<sub>2</sub> is a single-period mos pattern of βb + (''n'' − β)(a~c) and β′a + (''n'' − β′)(a~c), the cyclic word Λ<sub>2</sub> = the pattern of β and β′ must be a single-period mos. Similarly, Λ<sub>3</sub> = the pattern of γ and γ′ is a single-period 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 cyclic word Λ<sub>1</sub> formed by the a-components of the ''k''-steps in P is α...αα′. Since Σ<sub>2</sub> is a single-period mos pattern of βb + (''n'' − β)(a~c) and β′a + (''n'' − β′)(a~c), the cyclic word Λ<sub>2</sub> = the pattern of β and β′ must be a single-period mos. Similarly, Λ<sub>3</sub> = the pattern of γ and γ′ is a single-period mos. | ||
| Line 155: | Line 154: | ||
where ''W'' = ''W''(''x'', ''y'') is a word in two variables ''x'' and ''y'', of length ''n'' − 2. | where ''W'' = ''W''(''x'', ''y'') is a word in two variables ''x'' and ''y'', of length ''n'' − 2. | ||
==== Case analysis ==== | |||
Since, by our assumption, Λ<sub>3</sub> has two γ in a row, Λ<sub>3</sub> must have more γ than γ′, so μ − 1 < ''n''/2. Since Λ<sub>3</sub> is a mos, μ − 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 μ − 1 < ''n''/2. Since Λ<sub>3</sub> is a mos, μ − 1 ≥ 1. So we have 2 ≤ μ ≤ ceil(''n''/2). | ||
| Line 227: | Line 226: | ||
* '''Case 3.10''': (''x'', ''y'') = (floor(''n''/μ), 2*floor(''n''/μ) + 3) | * '''Case 3.10''': (''x'', ''y'') = (floor(''n''/μ), 2*floor(''n''/μ) + 3) | ||
== Theorem 5 (Classification of MV3 scales) == | |||
# A single-period MV3 is either (1) pairwise well-formed, (2) equivalent to XYZYX, or (3) a "twisted" word constructed as follows: | # A single-period MV3 is either (1) pairwise well-formed, (2) equivalent to XYZYX, or (3) a "twisted" word constructed as follows: | ||
## Start with a power of a multimos word ''w''(X, Z) = ''ka''X ''kb''Z such that ''a'' is even and each ''a''X ''b''Z subword of ''w'' is of the form X''P''(X, Z)Z where ''P''(X, Z) is a palindrome. | ## Start with a power of a multimos word ''w''(X, Z) = ''ka''X ''kb''Z such that ''a'' is even and each ''a''X ''b''Z subword of ''w'' is of the form X''P''(X, Z)Z where ''P''(X, Z) is a palindrome. | ||
| Line 233: | Line 232: | ||
## Replace every other X with Y in ''w''. | ## Replace every other X with Y in ''w''. | ||
# Single-period MV3 scales not of type (3) are always SV3. | # Single-period MV3 scales not of type (3) are always SV3. | ||
=== Proof === | |||
Proven by Bulgakova, Buzhinsky and Goncharov (2023), "[https://www.sciencedirect.com/science/article/pii/S0304397522006417 On balanced and abelian properties of circular words over a ternary alphabet]" (and Theorem 4). | Proven by Bulgakova, Buzhinsky and Goncharov (2023), "[https://www.sciencedirect.com/science/article/pii/S0304397522006417 On balanced and abelian properties of circular words over a ternary alphabet]" (and Theorem 4). | ||