The Setting
This proposition is a step in the counterexamples to the duality conjecture for metric entropy, in their part on finite-field partitions and separated rows. Let be a prime, and positive integers, and . The question is whether a single list of directions , its length fixed by , and a real before is chosen, serves every nonzero symmetric -linear form on at once: after at most directions are deleted, the deleted ones depending on , the form should be nonzero at every -tuple of the remaining directions, repeated directions allowed. For it asks for vectors of of which at most lie in any one hyperplane through the origin.
Symmetric Forms and Directions
A point of is a function on with values in , and denotes . A symmetric form of degree on , an element of , is the symmetric -linear map given by a coefficient for each multiset of indices from : (1) where is the multiset of the indices. The number of such multisets, and so the dimension of , is (2)✦
The number of directions attached to , and a real is the integer (3)✦
The Claim
Theorem 1. Let be a prime, and positive integers, , and the number of directions (3). Suppose and . Then there are directions such that every nonzero symmetric form of degree on has a nonempty set with (4)✦ More generally, for a real and a positive integer satisfying (5)✦ in place of (3) and the bounds on , there are directions with the same property.
In the paper, the result reads: for , positive integers and , , and a prime , there are such that for every nonzero some with has for all , repeated indices allowed.
What Is Checked
The claim is stated over the prime field and , the symmetric forms of degree on given by their coefficients on multisets and evaluated by (1), the dimension of (2) and the number of directions of (3).
The diagonal polynomial of a symmetric form of degree with coefficients is the polynomial in (6)✦ whose value at is . Let and let be a nonzero symmetric form of degree on . Then (7)✦ and its total degree is exactly : (8)✦
On lists of directions, the uniform probability of a set is .✦ For a set of -tuples of vectors and an index tuple , the tuple event is the set of lists with .✦ The zero set of a symmetric form of degree on is . Let , let be a nonzero symmetric form of degree on , and let , repeated indices allowed. Then (9)✦
For a positive integer and natural numbers , and with , (10)✦
The support of an -tuple of elements of a set is the set of its entries✦, and -tuples have pairwise disjoint supports when the supports of and are disjoint for all .✦ Let be any finite set, , and any natural numbers, a finite set with at most elements and, for each , a set of bad -tuples. If (11)✦ then there is a list such that for every and all index tuples with pairwise disjoint supports, at least one of the tuples lies outside .
Let be a finite set, a positive integer, a natural number, and a set of bad -tuples among which no have pairwise disjoint supports. Then there is a set with (12)✦