The Setting
Take a prime ideal over a field of characteristic zero, together with a finite set of common integer zeros of satisfying for every and , where is a real height parameter. The problem is to cover by boundedly many algebraic patches attached to prime ideals of controlled dimension and degree, using integer-coefficient defining equations of bounded degree and coefficient size whose Jacobian determinant stays nonzero at the covered points.
These notes go through the definitions underlying integer patches and the five bounds the library states.
Hilbert Invariants and Integer Points
For a field , a variable index set , and a nonnegative integer , the space of polynomials of bounded degree is the -subspace of the polynomial ring consisting of polynomials supported on monomial exponent vectors of total degree at most .✦ When , we write and ; for any multivariate polynomial , we write for its total degree and for its coefficient at a monomial exponent vector .
For an ideal , the affine Hilbert polynomial of is a rational-coefficient univariate polynomial of degree at most for which there exists a nonnegative integer such that the image of in satisfies (1): (1)✦ The affine dimension (where ) of an ideal is the degree of its affine Hilbert polynomial , with the convention .✦ Writing for the coefficient of in , the affine degree of an ideal is the rational number given by (2): (2)✦
An integer tuple is a point on an ideal if in for every .✦ For any polynomial , we also write for its image under the induced coefficient-wise map .
For a finite variable index set and a nonnegative integer , the set of monomials of bounded degree is the finite set of monomial exponent vectors of total degree at most . Given a nonnegative integer and a real number , the integral kernel height bound is the real number given by (3): (3)✦
Integer Patches and Covering Budgets
An integer patch in variables consists of a subset of free coordinates and a family of defining equations indexed by the complement .✦ The patch Jacobian minor of an integer patch in variables is the determinant of the square partial-derivative matrix in (4): (4)✦
Given an ideal over a field , an integer patch in variables is a patch on if , for every , and .✦ An integer patch in variables is a bounded integer patch with degree bound and height parameter if there exists an integer with such that every satisfies and every and monomial exponent vector satisfy (5): (5)✦
An equation lock for an ideal over a field , a finite set , and a degree bound is the condition that a polynomial with belongs to if and only if in for every that is a point on .✦ Relative to an ideal over a field , a finite set , nonnegative integers , and a real number , a good patch piece is a pair consisting of an ideal and an integer patch in variables such that is prime, , , , satisfies the equation lock for and , is a patch on , and is a bounded integer patch with degree bound and height parameter .✦ Given a patch piece consisting of an ideal over a field and an integer patch in variables, an integer tuple is covered by if is a point on and .✦
For nonnegative integers , the kernel count budget and the kernel degree budget are defined by recursion on via , , and (6): (6)
Using a fixed auxiliary next-degree function , the patch count budget and the patch degree budget are defined by recursion on for via , , and (7): (7)
The Claim
For finite index sets and , a field of characteristic zero, a nonnegative integer , a real number , and a family of integer tuples () satisfying for all and , there exists a family of polynomials in satisfying (8): (8)✦
Let , let be a field of characteristic zero, and let be a prime ideal. Suppose that satisfies , , and for all sufficiently large integers , and suppose that are coordinate indices whose residue classes in are algebraically independent over . Then there exist a subset and polynomials () satisfying (9): (9)✦
Over an arbitrary field , let , let be a prime ideal with and , and let be a set of polynomials satisfying for every . Then there exists a finite list (of length ) of prime ideals satisfying (10): (10)✦
Suppose , is a field of characteristic zero, is a prime ideal with and , satisfies and , is a finite set, and is a real number with for every and . Then there exists a finite list of patch pieces satisfying (11): (11)✦
Theorem 1. Let , let be a field of characteristic zero, let be a prime ideal with and , let be a finite set of points on , and let be a real number satisfying for every and . Then there exists a finite list of patch pieces satisfying (12): (12)✦
In the paper, the result reads: under the box bound of Theorem 3.1, any algebraic set of degree at most admits boundedly many patches with covering , of bounded degree and with the coefficients of and bounded by , so at covered points , uniformly in and .
What Is Checked
The main covering theorem (12), the proper-cut cover (11), and the generic Jacobian bound (9) are stated over a field of characteristic zero, a prime ideal , the spaces , and the affine Hilbert polynomial invariants and , together with integer points on bounded by , integer patches with their Jacobian minors, equation locks, good patch pieces, patch piece coverage, and the patch count and degree budgets. The component bound (10) is stated over an arbitrary field , a prime ideal , a bounded-degree polynomial set , and the kernel count and degree budgets, while (8) is stated over finite index sets and , a field of characteristic zero, bounded integer tuples, the monomial set , and the integral kernel height bound . Over an arbitrary field , every ideal admits a polynomial with and an integer for which (1) holds with in place of .✦