Rank-3 scale theorems: Difference between revisions
No edit summary Tags: Mobile edit Mobile web edit |
No edit summary Tags: Mobile edit Mobile web edit |
||
Line 26: | Line 26: | ||
The problem with this definition is that it is unclear what "closest approximation" means. We take several different definitions of that phrase and define different versions of the LQ property. | The problem with this definition is that it is unclear what "closest approximation" means. We take several different definitions of that phrase and define different versions of the LQ property. | ||
Let n = a+b+c be the scale size, w = aX bY cZ be the scale word, let | Let n = a+b+c be the scale size, w = aX bY cZ be the scale word, let L be a line of the form L(t) = (a, b, c)t ÷ v_0, where v_0 is a constant vector. We say that L is ''in generic position'' if L intersects the yz-plane at (0, α, β) where α, β, and β/α are irrational. | ||
* Assume ''S'' is a 2-step scale. Then ''S'' is ''slope-LQ'' if the slope between any two pair of points (representing a ''k''-mosstep) is one of the two nearest possible slopes (in the set {k/0,...,0/k}) to b/a. | * Assume ''S'' is a 2-step scale. Then ''S'' is ''slope-LQ'' if the slope between any two pair of points (representing a ''k''-mosstep) is one of the two nearest possible slopes (in the set {k/0,...,0/k}) to b/a. | ||
* Say that a 2-step scale ''S'' is ''floor-LQ'' if some mode ''M'' of ''S'' satisfies that γ(''M'') = the graph of floor(b/a*x). | * Say that a 2-step scale ''S'' is ''floor-LQ'' if some mode ''M'' of ''S'' satisfies that γ(''M'') = the graph of floor(b/a*x). | ||
* Say that a k-step scale ''S'' is ''LQ'' if the | * Say that a k-step scale ''S'' is ''LQ'' if the corresponding line, in generic position, has intersections with coordinate level planes x = k, y = k or z = k that spell out the scale as you move in the positive t direction. | ||
===== MV2 is equivalent to floor-LQ in 2-step scales (WIP) ===== | ===== MV2 is equivalent to floor-LQ in 2-step scales (WIP) ===== | ||
Assume wlog there are more L's than s's. | Assume wlog there are more L's than s's. |