Generator-offset property: Difference between revisions
m →Proof |
|||
| Line 155: | Line 155: | ||
Λ<sub>2</sub> = β W(β, β’) β’ | Λ<sub>2</sub> = β W(β, β’) β’ | ||
Λ<sub>3</sub> = γ W(γ, γ’) γ | Λ<sub>3</sub> = γ W(γ, γ’) γ | ||
where W is a word in two letters of length n − 2. | where W is a word in two letters, of length n − 2. | ||
Since, by our assumption, Λ<sub>3</sub> has two γ’s in a row, Λ<sub>3</sub> must have more γ than γ’, so μ − 1 < n/2. Since Λ<sub>3</sub> is a mos, μ − 1 ≥ 1. So we have 2 ≤ μ ≤ ceil(n/2). | Since, by our assumption, Λ<sub>3</sub> has two γ’s in a row, Λ<sub>3</sub> must have more γ than γ’, so μ − 1 < n/2. Since Λ<sub>3</sub> is a mos, μ − 1 ≥ 1. So we have 2 ≤ μ ≤ ceil(n/2). | ||