Reducing the number of equations defining a subset of the $n$-space over a finite field
Stefan Bara\'nczuk

TL;DR
This paper proves that for algebraic sets over finite fields, the number of defining equations can be reduced to the dimension of the space without increasing degrees, simplifying the description of these sets.
Contribution
It introduces a method to reduce the number of defining equations for algebraic sets over finite fields, maintaining degrees and providing a new way to simplify algebraic descriptions.
Findings
Number of equations can be reduced to the space dimension
Reduction preserves the total degree of defining polynomials
Applicable to both affine and projective algebraic sets
Abstract
Let be polynomials defining an algebraic set in affine -space over a finite field. Suppose . We prove that there exists a system of polynomials , each being a linear combination with scalar coefficients of , defining the same algebraic set. In particular, one reduces the number of equations without increasing the total degree. We also have the corresponding result for systems of homogeneous polynomials defining algebraic sets in projective spaces.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Graph theory and applications
Reducing the number of equations defining a subset of the -space over a finite field
Stefan Barańczuk
Collegium Mathematicum, Adam Mickiewicz University, ul. Uniwersytetu Poznańskiego 4, 61-614, Poznań, Poland
Abstract.
Let be polynomials defining an algebraic set in affine -space over a finite field. Suppose . We prove that there exists a system of polynomials , each being a linear combination with scalar coefficients of , defining the same algebraic set. In particular, one reduces the number of equations without increasing the total degree. We also have the corresponding result for systems of homogeneous polynomials defining algebraic sets in projective spaces.
Key words and phrases:
finite fields; algebraic sets; defining polynomials; reduction
2020 Mathematics Subject Classification:
11G25, 14A25
The theorem that any algebraic set in -dimensional space is the intersection of hypersurfaces 111The problem dates back to Kronecker. Its rather dramatic story is briefly presented in [2]; for much more detailed vivid account consult N. Schappacher’s available online presentation Political Space Curves. has been proved independently by Storch ([1]), and Eisenbud and Evans ([2]); both short proofs are ring-theoretic, i.e., one reduces the number of generators of radical ideals.
In this note we examine closer the finite fields case of the problem. If just the number of equations needed to describe an algebraic set is in question, then the answer is immediate: it is easy to construct a single polynomial defining it. If, however, the nature of defining polynomials (e.g., their total degree) is to be preserved, this problem becomes more interesting.
It turns out that we can avoid dealing with rings; the vector space structure is sufficient and, as in the theorem cited above, our result again produces equations; moreover, we show that these new equations can be chosen to be linear combinations with scalar coefficients of the old ones, so, roughly speaking, they remain of the same type (see Corollaries 3 and 4, with accompanying examples), and our proof is surprisingly elementary.
We fix the following notation:
the finite field with elements;
the vector space of all functions for a given set ;
the set of common zeros of ;
the subspace of generated by ;
the affine -space over a field ;
the projective -space over a field ;
a set of homogeneous coordinates for a point in .
Theorem 1**.**
Let be a set with at most elements. If for some then there exist such that .
This theorem is best possible with respect to the cardinality of . Indeed, we have the following.
Proposition 2**.**
For every field and every positive integer there are a set of cardinality , and maps such that but for any .
We have two immediate corollaries of Theorem 1 of interest in algebraic geometry.
Corollary 3**.**
Let and let be a homomorphism of vector spaces over . Any subset of defined by some members of (i.e., the zero locus of their images via ) can be defined using at most members of .
The space can be, for example, a space of polynomials in variables of bounded total degree.
Corollary 4**.**
Let and let be a homomorphism of vector spaces over . Any nonempty subset of defined by some members of (i.e., the zero locus of their images via ) can be defined using at most members of .
The space can be a space of homogeneous polynomials in variables of bounded total degree, the space of quadratic (or higher degree) forms in variables, the space of diagonal forms in variables, etc.
Before we present the proofs of Theorem 1 and Proposition 2, we separately state their following ingredient.
Let be an arbitrary field, and be a positive integer. Denote by the set of all matrices in in reduced row echelon form having the rank equal to , by the null space of a matrix , by the zero vector in , and by the equivalence relation which identifies points lying on the same line through the origin.
Lemma 5**.**
The map
[TABLE]
is bijective.
Proof.
Denote by the set of all matrices in having the rank equal to . For every the dimension of the vector space equals by the rank–nullity theorem, so . We thus have the map
[TABLE]
Since matrices of the same size have equal null spaces if and only if they are row equivalent, the induced map
[TABLE]
is well-defined and injective. It is also surjective, since every vector subspace of having dimension equal to is the null space of a matrix in .
Since the canonical map
[TABLE]
is bijective, the lemma follows. ∎
Proof of Theorem 1.
It is enough to prove the statement for since we may apply induction.
Denote
[TABLE]
By Lemma 5 every element of defines a unique matrix in ; denote this matrix by . Examine the set
[TABLE]
By Lemma 5 the number of elements in equals the cardinality of , i.e., . The number of elements in is at most the cardinality of , i.e., . Hence the cardinality of is at least . So choose a matrix . Our are defined by
[TABLE]
Indeed, the inclusion is obvious, and by the definition of the set is disjoint from , i.e., . ∎
In order to prove Proposition 2 we need the following.
Lemma 6**.**
Let be an arbitrary field. For any matrix where there exist a matrix in reduced row echelon form having the rank equal to , and a matrix such that .
Proof.
Denote by the matrix in having and all remaining entries equal to 0. Denote the rank of by . Let and be matrices transforming into , i.e., . Since , we get . Let be the matrix transforming into reduced row echelon form. We have
[TABLE]
Put and . ∎
Proof of Proposition 2.
For every point choose a set of homogeneous coordinates for and denote it by . Define . The cardinality of is . Consider defined in the following way: for every put
[TABLE]
We have .
Let , i.e.,
[TABLE]
for some matrix . By Lemma 6 there exist a matrix in reduced row echelon form having the rank equal to , and a matrix such that . Hence by Lemma 5 we get that there is belonging to . ∎
Proof of Corollary 3.
For any positive integer we have . Applying Theorem 1 and some elementary algebra, we get the assertion. ∎
Remark 7*.*
It has been suggested by the reviewer of this paper to include the following example to demonstrate that although the bound used in the proof of Corollary 3 is rather crude, the result is sharp for any . Consider the system of polynomials . While , any system of combinations of them has at least common zeros.
Proof of Corollary 4.
Let be the image via of a subset of . Let . Denote by the images of via the restriction homomorphism
[TABLE]
For any positive integer we have
[TABLE]
So we apply Theorem 1 to get such that . Let be such that
[TABLE]
Define by
[TABLE]
We are done, since
[TABLE]
∎
Acknowledgements.
We are grateful to Grzegorz Banaszak and Bartosz Naskręcki for discussions and suggestions. We wish to thank an anonymous referee for many improvements; in particular, for suggesting the concise formulation and proof of Lemma 5.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] U. Storch, Bemerkung zu einem Satz von M. Kneser , Arch. Math. (Basel) 23 (1972), 403-404
- 2[2] D. Eisenbud, E. Evans, Every algebraic set in n 𝑛 n -space is the intersection of n 𝑛 n hypersurfaces , Invent. Math. 19 (1973), 107-112
