The Setting
Take a finite set () of bounded coordinate height together with an ideal and a local system of polynomial equations around each point. Requiring point coordinates to be congruent modulo primes restricts to smaller subsets on which low-degree polynomials vanish, driving an -stage adaptive transition () that produces a sequence of Jacobian minor integers at each point .
The problem is to select deterministic prime blocks from given prime pools so that, for a large share of points and every block , at most a prescribed fraction of the primes in divide the product of those minor values along the adaptive path from . Accompanying this block-selection problem in an abstract vector-space setting and in the geometric setting are an averaging estimate for bad elements under subset deletion and a cardinality bound for sets fibered over a bounded-degree tree.
Combinatorial Definitions
For a set , a finite subset of root nodes, a map assigning a finite subset to each and , and an index , the -th tree level of and is the finite subset of defined recursively by (1): (1)✦
Given a finite set , an integer , and a map assigning a finite set to each finite set , the bad fraction is the real number defined by (2): (2)✦ with when or .
Fix a field , a -vector space , a state set , a parameter set , a map assigning a -subspace to each , , and , and a transition map assigning a state to each , , and -subspace . For , , and , the adaptive state sequence is the -tuple of states in defined recursively by and concatenation (3): (3)✦
Polynomial Ideals and Patches
Over a field in variables , for each , the space of polynomials of bounded degree is the -subspace of consisting of polynomials of total degree at most .✦ For an ideal and the quotient map , the affine Hilbert polynomial of is the polynomial in of degree at most such that for all sufficiently large .✦ For an ideal with affine Hilbert polynomial , the affine dimension of is the degree of (with )✦, and the affine degree of is the rational number defined by (4): (4)✦ where denotes the coefficient of in .
An integer patch in variables consists of a subset of free coordinates and a defining polynomial for each non-free coordinate .✦ The patch Jacobian minor of an integer patch in variables is the polynomial in defined by the determinant (5): (5)✦ An integer patch in variables is a patch on an ideal if , the image of every () under the coefficient homomorphism belongs to , and the image of its patch Jacobian minor under does not belong to .✦
For and , the integral kernel height bound is the real number defined by (6): (6)✦ An integer patch in variables is bounded with degree bound and height parameter if there exists with such that every () has total degree at most and every integer coefficient of satisfies .✦
Bounded Point Sets and Adaptive Paths
An integral kernel geometry in variables consists of a finite set and a real height such that for every and every .✦ For an ideal , an integer tuple is a point on if evaluating every at the image of in yields .✦
A patch piece over a field is a pair consisting of an ideal and an integer patch in variables; the patch piece covers a point if is a point on and in .✦ For , a prime ideal is a kernel parent ideal for if and .✦ Given an integral kernel geometry , integers , and , a complex patch piece is a physical state at for if is a kernel parent ideal for , is a patch on bounded with degree bound and height parameter , and covers .✦
Given , a tuple of finite subsets of , and , the cumulative block primes of up to stage is the subset of defined by .✦ For a finite set , an ideal , a point , and a finite set , the evaluation cell of , and is the subset of defined by (7): (7)✦ For and , the evaluation space of is the -subspace of consisting of polynomials vanishing on ✦, and for , the staged evaluation space of is the -subspace of defined by (8): (8)✦
Specializing adaptive sequences to an integral kernel geometry , a stage-degree map , integers , a point , an index , a complex patch piece , and an -tuple of finite blocks , the physical kernel subspace is the -subspace of defined by .✦ At stage , the physical transition sends and a subspace to a covering child patch piece for chosen from a finite list of child patch pieces associated to , , , , a recursively determined stage- degree budget, , and . Given also and a map assigning a complex patch piece to each , the physical path product is the integer defined by (9): (9)✦ where . For , a point is physically regular for with adaptive steps (relative to ) if (10) holds for every : (10)✦ reading the fraction as when .
The Claim
Theorem 1. (1) Suppose is a field, is a finite-dimensional -vector space, is a state set, is a finite point set, , are finite subsets of , and . For each , let assign a -subspace to each , , and -tuple of finite subsets of , let assign a state to each , , and -subspace , let , and let . Let satisfy , , , , and for all . Write , and assume that: for all , , , -tuple , , and finite sets , replacing the -th entry of by yields a subspace of with -th entry ; every () is prime with ; for every and every with , each satisfies and ; and for all , where . Then there exists an -tuple with and for all satisfying (11): (11)✦
(2) Given and , there exist with and with the following property. Let be an integral kernel geometry in variables, let assign a physical state at for to each , let , let be finite sets of primes, let , and let . Assume , , , , , , , for all and , for all , and for all . Then there exists with and for all satisfying (12): (12)✦
(3) Given , , , reals , and reals , , , there exist , integers with for all , and real constants and such that for every real , every integral kernel geometry in variables with , and every map assigning a physical state at for to each , there exist pairwise disjoint finite sets of primes satisfying and for all , for every and , and (13): (13)✦
(4) Let be a finite set, let satisfy and , let assign a nonnegative integer to each finite set , let assign a finite set to each finite set , and let . If for every one has , , and for every both and whenever one has , then (14) holds: (14)✦
(5) Let be a finite set, let be a finite root set, let assign a finite subset to each and , let be a sequence of integers with for all , let , and let and . If for all and , and for all , and for all and , then (15) holds: (15)✦
In the paper, the result reads: fixing , an index , a point , all blocks for , and a prime pool with consisting of primes in (for a constant depending on ) disjoint from those blocks, if is chosen uniformly among consecutive integers (where stands for the paper’s ) and is chosen uniformly among -element subsets of , then the expected fraction of primes in dividing at least one full-path integer is at most uniformly in and the remaining blocks (where stands for the paper’s ). Rather than bounding a single-block expectation over full-path integers as , the library states explicit finite-parameter inequalities in (14) and (15) and selects deterministic blocks simultaneously across all stages in (11) for abstract adaptive minor products and in (12) and (13) for physical patch states.
What Is Checked
The bound (15) is stated over a finite set with depth and node maps into the tree levels of a finite root set and bounded-size child maps () with uniform fiber bound , while (14) is stated over a finite set , (), a bounded monotone rank function , and a map invariant under rank-preserving single-element deletions and meeting in at most elements. Across adaptive stages, (11) is stated over a finite point set , a finite-dimensional -vector space , prime pools with primes at least , monotone subspace families , transition maps , nonzero bounded integer minor maps , and the dimension and pool-size inequality for , while (12) and (13) are stated over integral kernel geometries in variables of height , assignments of physical states at every , and physical regularity with respect to staged evaluation spaces on prime-congruence cells and physical transition maps.
Beyond the main claims, the library proves that for every polynomial ideal in variables over a field , the Hilbert function is eventually polynomial: there exist a rational-coefficient polynomial of degree at most and an integer cutoff such that for all .✦