The Setting
Lemma 4.1 of the counterexample to Sidorenko’s conjecture is a set of counting estimates over a finite field with elements, in the section on transverse configurations and determinant signs. How many -dimensional subspaces does an -dimensional vector space over have, and how far is that number from ? For a symmetric matrix over chosen uniformly at random, how likely is to be singular, and for odd , how evenly is the quadratic character of split between and ? What share of the symmetric matrices has a given rank and a given sign, and how rare is a symmetric bilinear form with a large radical?
The library answers each question with an identity or a bound explicit in , and the one on rank and sign also with a limit as runs through the odd primes.
Subspaces of a Finite Vector Space
Let be a vector space over of finite dimension . The Grassmannian , for a natural number , is the set of subspaces of of dimension .✦
For natural numbers and , the Grassmann correction factor is the function of a real variable given by (1)✦
Symmetric Matrices and Their Signs
The space of symmetric matrices over consists of the matrices over with .✦
Probabilities on are taken under the uniform law. The uniform mean of a real function on a finite set is its average , and the probability of an event for uniform on is the uniform mean of its indicator over .✦
The quadratic character of is the function on equal to at , to at a nonzero square and to at every other element. For uniform on , the singular probability is the probability that is singular✦, and the sign probability of an integer is the probability that : (2)✦
A symmetric bilinear form on is a bilinear form with for all , and denotes the set of them.✦ The radical of is the subspace , and the radical quotient form of is the nondegenerate form that induces on , given by .✦ The sign of is (3)✦ where is the Gram matrix of in a basis of ; for the matrix is empty, its determinant is , and . The sign of a matrix is the sign of the bilinear form on .✦
Write for the th triangular number. The signed rank layer , for a natural number and an integer , is the set of matrices in of rank and sign ✦, and its layer mass is the share of it takes up: (4)✦
For an odd prime , a prime other than , is the layer mass over the field of integers modulo , and a limit as through the odd primes is the limit along the odd primes in increasing order.✦
The Claim
Theorem 1. Let be a finite field with elements and a vector space over of finite dimension , and let . The number of -dimensional subspaces of is the Gaussian binomial coefficient (5)✦ it satisfies (6)✦ and (7)✦ and it factors as (8)✦ For natural numbers , the Grassmann correction factor satisfies (9)✦ For uniform on , the singular probability satisfies (10)✦ and if moreover , has odd characteristic and , the sign probability satisfies (11)✦ For natural numbers and , the layer mass is (12)✦ and normalized by it is (13)✦ For natural numbers and , the layer masses over the fields , with running through the odd primes, satisfy (14)✦ For , the share of symmetric bilinear forms on whose radical has dimension at least satisfies (15)✦
In the paper, the result reads: for the number of -dimensional subspaces of is ; for uniform on with , and ; for , the probability that has rank and sign is ; and for , .
What Is Checked
The claim is stated over the Grassmannians of a vector space over a finite field, the Grassmann correction factor , the space of symmetric matrices under the uniform law with its singular and sign probabilities, the sign of a symmetric bilinear form through its radical quotient form and the quadratic character, the signed rank layers with their masses, the limit through the odd primes, and the symmetric bilinear forms with their radicals.
The library proves that the symmetric matrices form a subspace of all matrices over , and that the bilinear form of a matrix is symmetric.