Ternary scale theorems - Revision history

Inthar: /* Theorem 7 (Ternary parallelogram scales are MOS substitution) */

2026-06-07T11:19:08Z

Theorem 7 (Ternary parallelogram scales are MOS substitution)

← Older revision		Revision as of 11:19, 7 June 2026
Line 340:		Line 340:
	:''Main article: [[Ternary parallelogram scales are MOS substitution]]''		:''Main article: [[Ternary parallelogram scales are MOS substitution]]''

	Ternary [[parallelogram scale]] words are [[MOS substitution]] scale words, where the period count of the template MOS is the number of rows of the parallelogram parallel to the unique step size parallel to a side of the parallelogram.		Ternary parallelogram scale words are [[MOS substitution]] scale words, where the period count of the template MOS is the number of rows of the parallelogram parallel to the unique step size parallel to a side of the parallelogram.

	== Open problems ==		== Open problems ==

Inthar: /* Theorem 7 (Ternary parallelogram scales are MOS substitution) */

2026-06-07T11:18:56Z

Theorem 7 (Ternary parallelogram scales are MOS substitution)

← Older revision		Revision as of 11:18, 7 June 2026
Line 339:		Line 339:
	== Theorem 7 (Ternary parallelogram scales are MOS substitution) ==		== Theorem 7 (Ternary parallelogram scales are MOS substitution) ==
	:''Main article: [[Ternary parallelogram scales are MOS substitution]]''		:''Main article: [[Ternary parallelogram scales are MOS substitution]]''

			Ternary [[parallelogram scale]] words are [[MOS substitution]] scale words, where the period count of the template MOS is the number of rows of the parallelogram parallel to the unique step size parallel to a side of the parallelogram.

	== Open problems ==		== Open problems ==

Inthar: /* Open problems */

2026-06-06T14:31:38Z

Open problems

← Older revision		Revision as of 14:31, 6 June 2026
Line 336:		Line 336:
	* In the singly even case, since there are evenly many slot letters in both ''s''<sub>1</sub> and ''s''<sub>2</sub>, there are oddly many non-slot letters in both. Since ''s''<sub>1</sub> and ''s''<sub>2</sub> differ by interchanging '''y''' and '''z''', they have "opposite" filling letters, '''x''' + '''y''' being the opposite of '''x''' + '''z'''. This makes ''s''<sub>1</sub> and ''s''<sub>2</sub> opposite chiralities of an odd-regular MV3 scale.		* In the singly even case, since there are evenly many slot letters in both ''s''<sub>1</sub> and ''s''<sub>2</sub>, there are oddly many non-slot letters in both. Since ''s''<sub>1</sub> and ''s''<sub>2</sub> differ by interchanging '''y''' and '''z''', they have "opposite" filling letters, '''x''' + '''y''' being the opposite of '''x''' + '''z'''. This makes ''s''<sub>1</sub> and ''s''<sub>2</sub> opposite chiralities of an odd-regular MV3 scale.
	* In the doubly even case, the number of non-slot letters in ''s''<sub>1</sub> and ''s''<sub>2</sub> is even, and we have a filling MOS of period 2. Since ''s''<sub>1</sub> and ''s''<sub>2</sub> are both primitive, they are both even-regular scales. {{Qed}}		* In the doubly even case, the number of non-slot letters in ''s''<sub>1</sub> and ''s''<sub>2</sub> is even, and we have a filling MOS of period 2. Since ''s''<sub>1</sub> and ''s''<sub>2</sub> are both primitive, they are both even-regular scales. {{Qed}}

			== Theorem 7 (Ternary parallelogram scales are MOS substitution) ==
			:''Main article: [[Ternary parallelogram scales are MOS substitution]]''

	== Open problems ==		== Open problems ==

Inthar: Undo revision 226370 by Inthar (talk)

2026-03-18T20:40:07Z

Undo revision 226370 by Inthar (talk)

Show changes

Inthar at 20:39, 18 March 2026

2026-03-18T20:39:07Z

Show changes

Inthar: /* Proof */

2026-03-08T02:09:42Z

Proof

← Older revision		Revision as of 02:09, 8 March 2026
Line 329:		Line 329:
	Write ''s''<sub>1</sub> for the scale word made from stacked 2-steps from the 0-degree, and let ''s''<sub>2</sub> be as follows:		Write ''s''<sub>1</sub> for the scale word made from stacked 2-steps from the 0-degree, and let ''s''<sub>2</sub> be as follows:
	* In the singly even case, let ''s''<sub>2</sub> be the circular word of 2-steps starting at the (''n''/2)-degree. We know that they differ only by interchanging '''y''' and '''z''', hence that they have the same period. Hence both ''s''<sub>1</sub> and ''s''<sub>2</sub> are primitive.		* In the singly even case, let ''s''<sub>2</sub> be the circular word of 2-steps starting at the (''n''/2)-degree. We know that they differ only by interchanging '''y''' and '''z''', hence that they have the same period. Hence both ''s''<sub>1</sub> and ''s''<sub>2</sub> are primitive.
	* In the doubly even case, start from the mode of ''s'' whose template MOS is the brightest mode. Let ''s''<sub>2</sub> be offset at a generator of the even-regular scale, which ~~by Theorem 6~~ we choose to have the same interval class as a bright generator of the MOS ''a'''''x''' 2''k'''''X'''. This is what induces the equality of ''s''<sub>1</sub> and ''s''<sub>2</sub> (in particular, the two scales have the same period, thus they are both primitive): Let ''s''<sub>''t''</sub> be the period of the brightest mode of the template MOS, and let ''g'' be its bright generator class. Then the slice {{nowrap\|''s''<sub>''t''</sub>[-''g'' +1 : 1]}} is the imperfect generator of the MOS. Now when we "darken" the mode by one generator, which is the difference between the template MOSes of ''s''<sub>1</sub> and ''s''<sub>2</sub>, we turn that slice into the bright generator, hence swapping ''s''<sub>''t''</sub>[-''g''] and ''s''<sub>''t''</sub>[-''g'' + 1]. Note that ''g'' must be odd since it generates a 2-period MOS. So (under 0-indexing) the first letter's index is even and the second letter's index is odd, which is what we want since the letters are within a stacked 2-step. While the generator might have to be higher by an (''n''/2)-step, that doesn't affect the parity since ''n''/2 is even.		* In the doubly even case, start from the mode of ''s'' whose template MOS is the brightest mode. Let ''s''<sub>2</sub> be offset at a generator of the even-regular scale, which we choose to have the same interval class as a bright generator of the MOS ''a'''''x''' 2''k'''''X'''. This is what induces the equality of ''s''<sub>1</sub> and ''s''<sub>2</sub> (in particular, the two scales have the same period, thus they are both primitive): Let ''s''<sub>''t''</sub> be the period of the brightest mode of the template MOS, and let ''g'' be its bright generator class. Then the slice {{nowrap\|''s''<sub>''t''</sub>[-''g'' +1 : 1]}} is the imperfect generator of the MOS. Now when we "darken" the mode by one generator, which is the difference between the template MOSes of ''s''<sub>1</sub> and ''s''<sub>2</sub>, we turn that slice into the bright generator, hence swapping ''s''<sub>''t''</sub>[-''g''] and ''s''<sub>''t''</sub>[-''g'' + 1]. Note that ''g'' must be odd since it generates a 2-period MOS. So (under 0-indexing) the first letter's index is even and the second letter's index is odd, which is what we want since the letters are within a stacked 2-step. While the generator might have to be higher by an (''n''/2)-step, that doesn't affect the parity since ''n''/2 is even.

	We prove that ''s''<sub>1</sub> and ''s''<sub>2</sub> are MOS substitution scales with a filling MOS of period 2. The number the 2-step (1) occurs must be the same in both ''s''<sub>1</sub> and ''s''<sub>2</sub>. The word of stacked 2-steps of the template MOS (which is of the form {{nowrap\|''w''('''x''', '''X''', '''X''')''w''('''x''', '''X''', '''X''')}}), which is itself a MOS word, consists of letters (1) '''x''' + '''X''' and (2) 2'''X''' if more '''X''''s than '''x''''s, 2'''x''' if more '''x''''s than '''X''''s. The word of stacked 2-steps from our chosen offset is also this same MOS word. Thus it remains to handle the cases (1) and (2) above. Whenever the letter '''x''' + '''X''' is encountered, the number of the last letters that are equated to '''X''' that are consumed is 1, which is odd. Whenever the other letter is encountered, that number is even (0 or 2). Hence (since ''n'' > 4) the letter 2'''X''' resp. 2'''x''' serves as the non-slot letter, and the letters ('''x''' + '''X''') serve as the slot letters where a 2-period filling MOS word (a repetition of {{nowrap\|('''x'''+'''y''')('''x'''+'''z''')}}) is substituted.		We prove that ''s''<sub>1</sub> and ''s''<sub>2</sub> are MOS substitution scales with a filling MOS of period 2. The number the 2-step (1) occurs must be the same in both ''s''<sub>1</sub> and ''s''<sub>2</sub>. The word of stacked 2-steps of the template MOS (which is of the form {{nowrap\|''w''('''x''', '''X''', '''X''')''w''('''x''', '''X''', '''X''')}}), which is itself a MOS word, consists of letters (1) '''x''' + '''X''' and (2) 2'''X''' if more '''X''''s than '''x''''s, 2'''x''' if more '''x''''s than '''X''''s. The word of stacked 2-steps from our chosen offset is also this same MOS word. Thus it remains to handle the cases (1) and (2) above. Whenever the letter '''x''' + '''X''' is encountered, the number of the last letters that are equated to '''X''' that are consumed is 1, which is odd. Whenever the other letter is encountered, that number is even (0 or 2). Hence (since ''n'' > 4) the letter 2'''X''' resp. 2'''x''' serves as the non-slot letter, and the letters ('''x''' + '''X''') serve as the slot letters where a 2-period filling MOS word (a repetition of {{nowrap\|('''x'''+'''y''')('''x'''+'''z''')}}) is substituted.

Inthar: /* Proof */

2026-03-08T02:06:39Z

Proof

← Older revision		Revision as of 02:06, 8 March 2026
Line 331:		Line 331:
	* In the doubly even case, start from the mode of ''s'' whose template MOS is the brightest mode. Let ''s''<sub>2</sub> be offset at a generator of the even-regular scale, which by Theorem 6 we choose to have the same interval class as a bright generator of the MOS ''a'''''x''' 2''k'''''X'''. This is what induces the equality of ''s''<sub>1</sub> and ''s''<sub>2</sub> (in particular, the two scales have the same period, thus they are both primitive): Let ''s''<sub>''t''</sub> be the period of the brightest mode of the template MOS, and let ''g'' be its bright generator class. Then the slice {{nowrap\|''s''<sub>''t''</sub>[-''g'' +1 : 1]}} is the imperfect generator of the MOS. Now when we "darken" the mode by one generator, which is the difference between the template MOSes of ''s''<sub>1</sub> and ''s''<sub>2</sub>, we turn that slice into the bright generator, hence swapping ''s''<sub>''t''</sub>[-''g''] and ''s''<sub>''t''</sub>[-''g'' + 1]. Note that ''g'' must be odd since it generates a 2-period MOS. So (under 0-indexing) the first letter's index is even and the second letter's index is odd, which is what we want since the letters are within a stacked 2-step. While the generator might have to be higher by an (''n''/2)-step, that doesn't affect the parity since ''n''/2 is even.		* In the doubly even case, start from the mode of ''s'' whose template MOS is the brightest mode. Let ''s''<sub>2</sub> be offset at a generator of the even-regular scale, which by Theorem 6 we choose to have the same interval class as a bright generator of the MOS ''a'''''x''' 2''k'''''X'''. This is what induces the equality of ''s''<sub>1</sub> and ''s''<sub>2</sub> (in particular, the two scales have the same period, thus they are both primitive): Let ''s''<sub>''t''</sub> be the period of the brightest mode of the template MOS, and let ''g'' be its bright generator class. Then the slice {{nowrap\|''s''<sub>''t''</sub>[-''g'' +1 : 1]}} is the imperfect generator of the MOS. Now when we "darken" the mode by one generator, which is the difference between the template MOSes of ''s''<sub>1</sub> and ''s''<sub>2</sub>, we turn that slice into the bright generator, hence swapping ''s''<sub>''t''</sub>[-''g''] and ''s''<sub>''t''</sub>[-''g'' + 1]. Note that ''g'' must be odd since it generates a 2-period MOS. So (under 0-indexing) the first letter's index is even and the second letter's index is odd, which is what we want since the letters are within a stacked 2-step. While the generator might have to be higher by an (''n''/2)-step, that doesn't affect the parity since ''n''/2 is even.

	We prove that ''s''<sub>1</sub> and ''s''<sub>2</sub> are MOS substitution scales with a filling MOS of period 2. The number the 2-step (1) occurs must be the same in both ''s''<sub>1</sub> and ''s''<sub>2</sub>. The word of stacked 2-steps of the template MOS (which is of the form {{nowrap\|''w''('''x''', '''X''', '''X''')''w''('''x''', '''X''', '''X''')}}), which is itself a MOS word, consists of letters (1) '''x''' + '''X''' and (2) 2'''X''' if more '''X''''s than '''x''''s, 2'''x''' if more '''x''''s than '''X''''s. The word of stacked 2-steps from our chosen offset is also this same MOS word. Thus it remains to handle the cases (1) and (2) above. ~~IWhenever~~ the letter '''x''' + '''X''' is encountered, the number of the last letters that are equated to '''X''' that are consumed is 1, which is odd. Whenever the other letter is encountered, that number is even (0 or 2). Hence (since ''n'' > 4) the letter 2'''X''' resp. 2'''x''' serves as the non-slot letter, and the letters ('''x''' + '''X''') serve as the slot letters where a 2-period filling MOS word (a repetition of {{nowrap\|('''x'''+'''y''')('''x'''+'''z''')}}) is substituted.		We prove that ''s''<sub>1</sub> and ''s''<sub>2</sub> are MOS substitution scales with a filling MOS of period 2. The number the 2-step (1) occurs must be the same in both ''s''<sub>1</sub> and ''s''<sub>2</sub>. The word of stacked 2-steps of the template MOS (which is of the form {{nowrap\|''w''('''x''', '''X''', '''X''')''w''('''x''', '''X''', '''X''')}}), which is itself a MOS word, consists of letters (1) '''x''' + '''X''' and (2) 2'''X''' if more '''X''''s than '''x''''s, 2'''x''' if more '''x''''s than '''X''''s. The word of stacked 2-steps from our chosen offset is also this same MOS word. Thus it remains to handle the cases (1) and (2) above. Whenever the letter '''x''' + '''X''' is encountered, the number of the last letters that are equated to '''X''' that are consumed is 1, which is odd. Whenever the other letter is encountered, that number is even (0 or 2). Hence (since ''n'' > 4) the letter 2'''X''' resp. 2'''x''' serves as the non-slot letter, and the letters ('''x''' + '''X''') serve as the slot letters where a 2-period filling MOS word (a repetition of {{nowrap\|('''x'''+'''y''')('''x'''+'''z''')}}) is substituted.

	Now we count the letters that occur in these MOS substitution words of 2-steps. Consider the chunk boundaries of the template MOS. For every boundary between chunks, there is one slot letter in the template MOS for ''s''<sub>1</sub> and one in the template MOS ''s''<sub>2</sub>, due to index parity. So it suffices that we have evenly many boundaries between (nonempty) chunks. Equivalently, we have to prove that there are evenly many steps of the step size that occurs less frequently in the template MOS ''a'''''x''' 2''k'''''X''', which is true by assumption (''a'' and 2''k'' are both even).		Now we count the letters that occur in these MOS substitution words of 2-steps. Consider the chunk boundaries of the template MOS. For every boundary between chunks, there is one slot letter in the template MOS for ''s''<sub>1</sub> and one in the template MOS ''s''<sub>2</sub>, due to index parity. So it suffices that we have evenly many boundaries between (nonempty) chunks. Equivalently, we have to prove that there are evenly many steps of the step size that occurs less frequently in the template MOS ''a'''''x''' 2''k'''''X''', which is true by assumption (''a'' and 2''k'' are both even).

Inthar: /* Proof */

2026-03-08T02:01:09Z

Proof

← Older revision		Revision as of 02:01, 8 March 2026
Line 264:		Line 264:
	For 5.1.1: We showed previously that the Fraenkel, odd-regular, and even-regular circular words are balanced.		For 5.1.1: We showed previously that the Fraenkel, odd-regular, and even-regular circular words are balanced.

	We will first prove that a balanced circular word is primitive iff ~~rhe~~ gcd of the step signature is 1. Proof sketch: let ''d'' be the gcd of the step signature. (''n''/''d'')-step multisets come in 1 size, namely the equave divided by ''d'', because if some letter count differs, then we get 3 values for this letter count for (''n''/''d'')-step multisets by the discrete IVT.		We will first prove that a balanced circular word is primitive iff the gcd of the step signature is 1. Proof sketch: let ''d'' be the gcd of the step signature. (''n''/''d'')-step multisets come in 1 size, namely the equave divided by ''d'', because if some letter count differs, then we get 3 values for this letter count for (''n''/''d'')-step multisets by the discrete IVT.

	It remains to show that (a) ternary balanced words are pairwise-MOS (b) if ''a'' > ''b'' > ''c'', then ''s'' is equivalent to the Fraenkel word (c) assuming ''a'' != ''b'' = ''c'' any ''s'' that is not odd-regular or even-regular is not balanced.		It remains to show that (a) ternary balanced words are pairwise-MOS (b) if ''a'' > ''b'' > ''c'', then ''s'' is equivalent to the Fraenkel word (c) assuming ''a'' != ''b'' = ''c'' any ''s'' that is not odd-regular or even-regular is not balanced.

Inthar: /* Theorem 5.1 (Classification of ternary balanced scales) */

2026-03-08T02:00:34Z

Theorem 5.1 (Classification of ternary balanced scales)

← Older revision		Revision as of 02:00, 8 March 2026
Line 251:		Line 251:

	=== Theorem 5.1 (Classification of ternary balanced scales) ===		=== Theorem 5.1 (Classification of ternary balanced scales) ===
	# A primitive [[balanced]] ternary scale ''s'' is pairwise-MOS, ~~and~~ satisfies one of the following:		# A primitive [[balanced]] ternary scale ''s'' is pairwise-MOS; conversely, pairwise-MOS scales are balanced. Such a scale satisfies one of the following:
	## '''sporadic balanced''': ''s'' is equivalent to '''XYXZXYX''', the ternary [[Fraenkel word]], with step signature 4'''X'''2'''Y'''1'''Z'''.		## '''sporadic balanced''': ''s'' is equivalent to '''XYXZXYX''', the ternary [[Fraenkel word]], with step signature 4'''X'''2'''Y'''1'''Z'''.
	## '''odd-regular''': len(''s'') is odd, and ''s'' is equivalent to a word constructed from taking the brightest mode of the MOS ''c'''''X'''''b'''''Z''' with ''c'' even and {{nowrap\|gcd(''c'', ''b'') {{=}} 1}}, and replacing every other '''X''' with '''Y'''. We assume {{nowrap\|'''X''' > '''Z'''}} when constructing the MOS. In particular, ''s'' has [[step signature]] ''a'''''X'''''a'''''Y'''''b'''''Z''' where ''b'' is odd (with {{nowrap\|''a'' {{=}} ''c''/2}}).		## '''odd-regular''': len(''s'') is odd, and ''s'' is equivalent to a word constructed from taking the brightest mode of the MOS ''c'''''X'''''b'''''Z''' with ''c'' even and {{nowrap\|gcd(''c'', ''b'') {{=}} 1}}, and replacing every other '''X''' with '''Y'''. We assume {{nowrap\|'''X''' > '''Z'''}} when constructing the MOS. In particular, ''s'' has [[step signature]] ''a'''''X'''''a'''''Y'''''b'''''Z''' where ''b'' is odd (with {{nowrap\|''a'' {{=}} ''c''/2}}).

Inthar: /* Proof */

2026-03-08T01:59:27Z

Proof

← Older revision		Revision as of 01:59, 8 March 2026
Line 262:		Line 262:

	==== Proof ====		==== Proof ====
	For 5.1.1: We showed previously that the Fraenkel, odd-regular, and even-regular circular words are balanced. ~~Thus it~~ remains to show that (a) ternary balanced words are pairwise-MOS (b) if ''a'' > ''b'' > ''c'', then ''s'' is equivalent to the Fraenkel word (c) assuming ''a'' != ''b'' = ''c'' any ''s'' that is not odd-regular or even-regular is not balanced.		For 5.1.1: We showed previously that the Fraenkel, odd-regular, and even-regular circular words are balanced.

			We will first prove that a balanced circular word is primitive iff rhe gcd of the step signature is 1. Proof sketch: let ''d'' be the gcd of the step signature. (''n''/''d'')-step multisets come in 1 size, namely the equave divided by ''d'', because if some letter count differs, then we get 3 values for this letter count for (''n''/''d'')-step multisets by the discrete IVT.

			It remains to show that (a) ternary balanced words are pairwise-MOS (b) if ''a'' > ''b'' > ''c'', then ''s'' is equivalent to the Fraenkel word (c) assuming ''a'' != ''b'' = ''c'' any ''s'' that is not odd-regular or even-regular is not balanced.

	(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.