Recursive structure of MOS scales: Difference between revisions

Line 464:

To establish MOSness in the case of non-linearly-independent ''p'' and ''g'', observe that every ''k''-step (which is a specific linear combination of L and s) in the scale with rational step ratio is a limit point of the same linear combination of L and s in versions of the binary scale with linearly independent ''p'' and ''g'', and thus there must be ''at most'' 2 sizes for each generic interval. Since χ, which separates the two sizes in the previous case, is ''p''-equivalent to ''ng'' and remains ''p''-inequivalent to 0 in the limit since L/s ≠ 1/1, each generic interval not ''p''-equivalent to 0 has ''exactly'' 2 sizes.

=== Uniqueness and existence of the generator===

Every MOS can be reduced to nL 1s (or 1L ns). Each step of the reduction decreases either the number of L's or the number of s's (or both), so one of them must reach 1 at some point. ''(note that reducing further gets us to 1L 0s, which has a period, but no generator per se)''

It is clear that the MOS nL 1s has a unique generator, L (or its inversion). However, the previous proof showed that reduction reflects generators, and so by induction all MOS scales have a single generator.

== See also ==

@@ Line 464: / Line 464: @@
 To establish MOSness in the case of non-linearly-independent ''p'' and ''g'', observe that every ''k''-step (which is a specific linear combination of L and s) in the scale with rational step ratio is a limit point of the same linear combination of L and s in versions of the binary scale with linearly independent ''p'' and ''g'', and thus there must be ''at most'' 2 sizes for each generic interval. Since χ, which separates the two sizes in the previous case, is ''p''-equivalent to ''ng'' and remains ''p''-inequivalent to 0 in the limit since L/s ≠ 1/1, each generic interval not ''p''-equivalent to 0 has ''exactly'' 2 sizes.
+=== Uniqueness and existence of the generator===
+Every MOS can be reduced to nL 1s (or 1L ns). Each step of the reduction decreases either the number of L's or the number of s's (or both), so one of them must reach 1 at some point. ''(note that reducing further gets us to 1L 0s, which has a period, but no generator per se)''
+It is clear that the MOS nL 1s has a unique generator, L (or its inversion). However, the previous proof showed that reduction reflects generators, and so by induction all MOS scales have a single generator.
 == See also ==