Generator-offset property: Difference between revisions

Inthar (talk | contribs)
Tags: Mobile edit Mobile web edit
Inthar (talk | contribs)
Tags: Mobile edit Mobile web edit
Line 132: Line 132:
Assume the L of S1 (it could be s, but it doesn’t matter) is the result of identifying b and c, and all instances of s in S1 come from a. Then the steps of S2 corresponding to the L of S1 must be either all b’s or all a~c’s, thus these steps are all b’s in S (otherwise they would be identified with the a, against the assumption that S1 and S2 are the same mos pattern and mode). So S has only two step sizes (a and b), contradicting the assumption that S has exactly three step sizes. This shows that the maximum variety of S must be at least 3, and that P has at least two preimages in S.
Assume the L of S1 (it could be s, but it doesn’t matter) is the result of identifying b and c, and all instances of s in S1 come from a. Then the steps of S2 corresponding to the L of S1 must be either all b’s or all a~c’s, thus these steps are all b’s in S (otherwise they would be identified with the a, against the assumption that S1 and S2 are the same mos pattern and mode). So S has only two step sizes (a and b), contradicting the assumption that S has exactly three step sizes. This shows that the maximum variety of S must be at least 3, and that P has at least two preimages in S.


At most two k-steps of S can project to P in S1, for if P has three preimages (α, β, γ), (α, β’, γ’), (α, β’’, γ’’) in S (written in the basis a, b, c), then β, β’ and β’’ are three distinct values. Thus these would project to three different k-steps in S3, contradicting the mos property of S3.
Only two k-steps of S can project to P in S1, for if P has three preimages (α, β, γ), (α, β’, γ’), (α, β’’, γ’’) in S (written in the basis a, b, c), then β, β’ and β’’ are three distinct values. Thus these would project to three different k-steps in S3, contradicting the mos property of S3.


So assume Q = (α, β, γ) != R = (α, β’, γ’) are the two preimages of P in S. Then I has preimage (α’, β’’, γ’’), which by abuse we also denote I. Here the values in each component differ by at most 1, and α != α’. Recall that I has preimage (α’, β’’, γ’’). Either β’’ = β or β’’ = β’. Assume β’’ = β’. Then γ’’ = γ. The cyclic words Λ1 = the pattern of α and α’, Λ2 = the pattern of β and β’, and Λ3 = the pattern of γ and γ must form mosses. By way of illustration, the chain of k-steps might look like this in s:
So assume Q = (α, β, γ) != R = (α, β’, γ’) are the two preimages of P in S. Then I has preimage (α’, β’’, γ’’), which by abuse we also denote I. Here the values in each component differ by at most 1, and α != α’. Recall that I has preimage (α’, β’’, γ’’). Either β’’ = β or β’’ = β’. Assume β’’ = β’. Then γ’’ = γ. The cyclic words Λ1 = the pattern of α and α’, Λ2 = the pattern of β and β’, and Λ3 = the pattern of γ and γ must form mosses. By way of illustration, the chain of k-steps might look like this in s: