Generator-offset property: Difference between revisions

Line 82:

Consider the two alternants, detemperings of the generator iX + jW of the ''a''X 2''b''W mos ''T''(X, W) = ''S''(X, W, W) where gcd(''j'', 2''k'') = 1.

'''Claim 1''': Deleting X's from the alternants of ''S'' gives every ''j''-step in the scale ''E''X(''S'')(Y, Z), the scale word obtained by deleting all X's from X.

'''Claim 1''': Deleting X's from the alternants of ''S'' gives every ''j''-step subword in the scale ''E''X(''S'')(Y, Z), the scale word obtained by deleting all X's from X.

Proof: Assume that the imperfect generator of ''T'' has ''j'' + 1 W's and the perfect generator has ''j'' W's. Suppose that one ''j''-step word ''R'' on note ''p'' of ''E''X(''S'') is "contained in" the corresponding "imperfect alternant" of ''S'', the unique (''i'' + ''j'')-step, which is ''I'' = ''S''[''p'' : ''p'' + ''i'' + ''j'']. By this we mean that ''E''X(''I'') has ''R'' as a substring. Then ''S''[''p'' - 1: ''p'' - 1 + ''i'' + ''j''] and ''S''[''p'' + 1 : ''p'' + 1 + ''i'' + ''j''] are both perfect, and have one fewer step that is Y or Z. Thus the word ''I'' must both begin and end in a letter that is either Y or Z. Removing all the X's from ''I'' results in a word that is ''j'' + 1 letters long and is the ''j''-step we started with, with just one extra letter. Thus one of the two perfect generators above, namely the one that removes the extra letter, must contain this ''j''-step.

@@ Line 82: / Line 82: @@
 Consider the two alternants, detemperings of the generator iX + jW of the ''a''X 2''b''W mos ''T''(X, W) = ''S''(X, W, W) where gcd(''j'', 2''k'') = 1.
-'''Claim 1''': Deleting X's from the alternants of ''S'' gives every ''j''-step in the scale ''E''<sub>X</sub>(''S'')(Y, Z), the scale word obtained by deleting all X's from X.
+'''Claim 1''': Deleting X's from the alternants of ''S'' gives every ''j''-step subword in the scale ''E''<sub>X</sub>(''S'')(Y, Z), the scale word obtained by deleting all X's from X.
 Proof: Assume that the imperfect generator of ''T'' has ''j'' + 1 W's and the perfect generator has ''j'' W's. Suppose that one ''j''-step word ''R'' on note ''p'' of ''E''<sub>X</sub>(''S'') is "contained in" the corresponding "imperfect alternant" of ''S'', the unique (''i'' + ''j'')-step, which is ''I'' = ''S''[''p'' : ''p'' + ''i'' + ''j'']. By this we mean that ''E''<sub>X</sub>(''I'') has ''R'' as a substring. Then ''S''[''p'' - 1: ''p'' - 1 + ''i'' + ''j''] and ''S''[''p'' + 1 : ''p'' + 1 + ''i'' + ''j''] are both perfect, and have one fewer step that is Y or Z. Thus the word ''I'' must both begin and end in a letter that is either Y or Z. Removing all the X's from ''I'' results in a word that is ''j'' + 1 letters long and is the ''j''-step we started with, with just one extra letter. Thus one of the two perfect generators above, namely the one that removes the extra letter, must contain this ''j''-step.