Mathematics of MOS: Difference between revisions
Line 260: | Line 260: | ||
This maximally even MOS has n % m large steps and m − (n % m) small steps. | This maximally even MOS has n % m large steps and m − (n % m) small steps. | ||
=== Binary generated scales with | === Binary generated scales with independent period and generator are MOS === | ||
This proof justifies the common description of "stack until binary" for MOS building and Erv Wilson's terminology ''moment of symmetry'' where MOS sizes are "moments" in time (when stacking) where the "symmetry" of binarity and MV2 holds. | This proof justifies the common description of "stack until binary" for MOS building and Erv Wilson's terminology ''moment of symmetry'' where MOS sizes are "moments" in time (when stacking) where the "symmetry" of binarity and MV2 holds. | ||
Line 281: | Line 281: | ||
Now we assume that ''g'' and ''p'' are linearly independent. By assumption ''a''L + ''b''s = (''ac'' + ''be'')''g'' + (''ad'' + ''bf'')''p'' = ''p''. Since ''a''L + ''b''s occurs on the "brightest" mode, from generatedness we have ''ac'' + ''be'' ∈ {0, ..., ''n'' − 1}. Hence we must have ''ac'' + ''be'' = 0, and thus ''c'' = ±''b'' and ''e'' = ∓''a'', from the assumption that gcd(a, b) = 1. | Now we assume that ''g'' and ''p'' are linearly independent. By assumption ''a''L + ''b''s = (''ac'' + ''be'')''g'' + (''ad'' + ''bf'')''p'' = ''p''. Since ''a''L + ''b''s occurs on the "brightest" mode, from generatedness we have ''ac'' + ''be'' ∈ {0, ..., ''n'' − 1}. Hence we must have ''ac'' + ''be'' = 0, and thus ''c'' = ±''b'' and ''e'' = ∓''a'', from the assumption that gcd(a, b) = 1. | ||
In fact, {L, s} is another valid basis for the abelian group with basis {''p'', ''g''}, since by binarity we have ''p, g'' ∈ span(L, s). Assume ''c'' = ''b'' and ''e'' = −''a''. [This corresponds to assuming that ''g'' is the "bright" generator.] Let χ = L − s > 0; then χ is ''p''-equivalent to ''+ng''. Now by generatedness and binarity, any interval class that has at least two sizes must have sizes separated by ''ng'' (the separation corresponding to changing an L step to an s step). Since ''g'' and ''p'' are linearly independent, for each ''j'' ∈ {1, ..., ''n'' − 1} there exists at most one ''k'' = ''k''(''j'') ∈ {1, ..., ''n'' − 1}</sub> such that ''jg'' is ''p''-equivalent to one size of ''k''-step. Hence if the class of ''k''-steps has ''at least'' two sizes, the sizes must be ''j''(''k'')''g'' and (''j''(''k'') − ''n'')''g''; any other size must leave the range −(''n'' − 1)''g'', ..., 0, ..., (''n'' − 1)''g''. Thus the class of ''k''-steps has at most two sizes for 1 ≤ ''k'' ≤ (''n'' − 1). Each non-''p''-equivalent class must have ''exactly'' two sizes, since the inverse of the ''k''-step that is equivalent to ''jg'' is an (''n'' − ''k'')-step equivalent to ''−jg'', which by linear independence must be distinct from an (''n'' − ''k'')-step equivalent to a positive number of ''g'' generators. (Note that the latter (''n'' − ''k'')-step does occur in the "brightest" mode of ''S'', i.e. the mode with the most ''g'' generators stacked ''up'' rather than ''down'' from the tonic.) | In fact, {L, s} is another valid basis for the abelian group with basis {''p'', ''g''}, since by binarity we have ''p, g'' ∈ span(L, s). Assume ''c'' = ''b'' and ''e'' = −''a''. [This corresponds to assuming that ''g'' is the "bright" generator.] Let χ = L − s > 0; then χ is ''p''-equivalent to ''+ng''. Now by generatedness and binarity, any interval class that has at least two sizes must have sizes separated by ''ng'' (the separation corresponding to changing an L step to an s step). Since ''g'' and ''p'' are linearly independent, for each ''j'' ∈ {1, ..., ''n'' − 1} there exists at most one ''k'' = ''k''(''j'') ∈ {1, ..., ''n'' − 1}</sub> such that ''jg'' is ''p''-equivalent to one size of ''k''-step. Hence if the class of ''k''-steps has ''at least'' two sizes, the sizes must be ''j''(''k'')''g'' and (''j''(''k'') − ''n'')''g''; any other size must leave the range −(''n'' − 1)''g'', ..., 0, ..., (''n'' − 1)''g''. Thus the class of ''k''-steps has at most two sizes for 1 ≤ ''k'' ≤ (''n'' − 1). Each non-''p''-equivalent class must have ''exactly'' two sizes, since the inverse of the ''k''-step that is equivalent to ''jg'' is an (''n'' − ''k'')-step equivalent to ''−jg'', which by linear independence must be distinct from an (''n'' − ''k'')-step equivalent to a positive number of ''g'' generators. (Note that the latter (''n'' − ''k'')-step does occur in the "brightest" mode of ''S'', i.e. the mode with the most ''g'' generators stacked ''up'' rather than ''down'' from the tonic.) | ||
[[Category:Math]] | [[Category:Math]] | ||
[[Category:MOS scale]] | [[Category:MOS scale]] | ||
[[Category:Scale]] | [[Category:Scale]] |