The Setting
Proposition 4.3 concerns a finite matrix whose rows, points of with the sup norm, are built from symmetric forms over a prime field. Its rows are indexed by the forms of degree on , where is a prime and the rank.✦ Each of directions partitions these forms according to their contraction , and a set of directions links two forms when one of its directions puts them in the same part. A column belongs to a form and a set , and its entry at is a logarithmic cutoff, at radius , of the distance from to along these links. The proposition counts the rows and the possible contractions along each direction, and asks how far apart two distinct rows can be.
Forms and Contractions
Let be a field and a natural number. A symmetric form of degree on is a family of coefficients , one for each multiset of indices from .✦ For a prime and , these forms make up , and the number of multisets indexing their coefficients is (1)✦
A form of degree is evaluated at vectors by (2)✦ where is the multiset of the entries of and is the coordinate of a vector at the index .
The contraction of a form of degree by a vector is the form of degree whose coefficient on a multiset of indices is (3)✦ where is the multiset with one more copy of . Given directions , indexed by in an index set, the label of a form of degree along is its contraction , a form of degree .✦
Partition Graphs and Profile Rows
Let be a set with labelings , indexed by in an index set, each mapping to a set of labels. For a set of indices, the partition graph is the simple graph on in which two distinct points and are adjacent when for some .✦ A walk of length from to in is a sequence of points of with consecutive points adjacent. The graph distance is the least length of such a walk, and when there is none.✦
The cutoff profile of radius is the function on with and, at a finite , (4)
Now let be finite and a finite family of finite sets of indices. The column index set is ✦, and the column of is the real function on given by (5)✦ The profile row of a point is the vector of , which carries the sup norm .✦
For a real number and a number of indices, an admissible set is a subset of that misses at most indices; the admissible sets form the family (6)✦
The Claim
Theorem 1. Let be a prime, and , and let carry the labels along directions . Then (7)✦ and each label takes at most values: (8)✦ If moreover the prime , the rank , the degree , the number of directions, the number and the directions are those of Proposition 4.2, then for any two distinct forms and in there is an admissible set with (9)✦ the rows of and satisfy (10)✦ and some column has (11)✦
In the paper, the result reads: with the parameters and directions of Proposition 4.2, , and , one has , each has at most realized labels, every pair of distinct forms has some with , and the rows of the matrix with columns indexed by satisfy for .
What Is Checked
The claims (7) to (11) are stated over the forms of degree on , given by their coefficients, with their labels by contraction along , over the partition graphs and their distances for admissible , and over the rows and columns built from the cutoff profile on .
The library also states two facts about these constructions in general. Let be any field, directions indexed by in any set, a nonempty finite set of indices, and , forms of degree over whose difference vanishes at no directions from : whenever . In the partition graph of the labels by contraction, every walk from to then has (12)✦ and the two forms satisfy (13)✦
For labelings of a finite set , a finite family of finite sets of indices and a radius , any two points , of with for some have (14)✦