Generator-offset property: Difference between revisions
m →Proof: expand out expressions using g_3 to show more clearly that a_i are distinct |
m →Proof |
||
| Line 54: | Line 54: | ||
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. | ||
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 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''. | ||
Let ''r'' be odd and ''r'' ≥ 3. Consider the following abstract sizes for the interval class (''k''-steps) reached by stacking ''r'' generators: | Let ''r'' be odd and ''r'' ≥ 3. Consider the following abstract sizes for the interval class (''k''-steps) reached by stacking ''r'' generators: | ||