The Setting
A shear moves labeled vertices by linear combinations of a fixed collection of columns. The intersections of the corresponding translated holes depend on all of these columns, while the same columns must serve every pattern in the family.
Let be a real vector space, let be an additive commutative group with a translation-invariant probability measure , and let be a surjective additive map. Let be a set of labels; for each , let the labeled hole be measurable and let satisfy .
The translate of by is the set in (1).✦ For a nonnegative integer , columns in , and an integer with , the initial restriction and the linear column combination are defined by (1), with the latter taken for . (1)
Source Patterns and Branching Trees
A labeled source pattern in is a nonempty finite set with unique vertex labels and binary suffix fibers.✦ A finite labeled set has unique vertex labels if entails .✦ A finite labeled set has binary suffix fibers if, for each coordinate index , fixing all coordinates later than restricts the possible values of coordinate to two positions separated by one, as in (2). (2)✦
For , the coordinate slice of a finite labeled set is the subset of obtained by retaining the vertices with last coordinate and deleting that coordinate, as defined in (3). A family of finite collections of source patterns is closed under coordinate slices below if, for and , every nonempty slice belongs to .✦ (3)✦
For a source pattern and columns , the failure set is the intersection of the translated labeled holes in (4). (4)
A branching pattern of depth zero is a leaf labeled by . A branching pattern of depth is either a single branch or a pair of branches , where and have depth .✦ For a branching pattern , its first and second branches , its leaf count , and its leaf weight are given in (5); leaves are counted with multiplicity. (5)
For a branching pattern of depth and columns , the failure set is the set defined recursively by (6), where has columns in the last two lines. (6)✦
A family of finite collections of branching patterns is closed under branches below if both branches of every belong to whenever .✦ For either kind of family , its total number of patterns through dimension is in (7). (7)
The Claim
Theorem 1. Let be a nonnegative integer and let . For a family of source patterns closed under coordinate slices below , suppose . There are columns such that every , for , satisfies (8). (8)✦ For a family of branching patterns closed under branches below , suppose . There are columns such that every , for , satisfies (9). (9)✦ Every source pattern satisfies (10). (10)✦
In the paper, the result reads: for a lattice in , the torus with normalized Haar measure and quotient projection , measurable satisfying with , finite families of labeled patterns in that are binary by suffixes and closed under last-coordinate slicing for , and , there are vectors such that every satisfies (11). (11)
What Is Checked
The statements concern real vector spaces with surjective additive maps to commutative groups carrying invariant probability measure, measurable labeled holes with positive bounds, and finite families closed under coordinate slices or pattern branches.