WorksMathematics
Prime supports and vanishing in restricted coprime representations
Abstract
We study the prime supports that eliminate every representation of an even integer by two positive integers coprime to . Let be the largest vanishing instance obtainable with at most factors of not dividing . We prove for every . The upper bound follows by comparing a classical family of shifted-prime representations with a two-dimensional upper sieve for the loss at each additional factor. Retaining the same local density factor in both estimates yields a weighted survival criterion and positivity whenever the number of noncolliding factors above is sufficiently small compared with , for fixed . An exact reduction separates a minimum prime cover into forced prime-pair contributions and a residual problem, and gives the lower bound for along powers of two. Residue occupancies characterize the extremal concentration at a first zero. Explicit discrepancy estimates show that supports with at most eleven factors cannot eliminate every representation when , nor supports with at most seven noncolliding factors when . Positivity for the complete support of primes up to remains open.
Introduction
Let be even, and let be a product of distinct primes at least 5. We consider
The endpoint is included when admissible. The question is how many prime factors, and what arrangement of their excluded classes, are needed to make this count vanish.
The one-prime case was studied in [8]. Exact formulas for squarefree supports, together with the parametrization , discrepancy estimates, and positivity thresholds, were developed in [9]. Here the primes of an instance remain fixed, and the excluded residues are prescribed by that same . Removing a factor reveals the preceding survivor set. Imposing the factors in increasing order identifies a first vanishing step.
Write for the least nonnegative remainder of the integer upon division by . For an odd prime , the forbidden residues are and . They coincide precisely when , or equivalently . We call these factors colliding and write
Here counts distinct prime factors. For each integer , our principal size parameter is
It measures the largest vanishing instance allowed by at most noncolliding factors, with no bound on their size or on the number of colliding factors. The supremum compares different fixed instances .
Theorem 1.1 (Size of a vanishing instance). For every ,
In particular, is finite for every fixed .
The upper bound follows from Corollary 5.5. The lower bound is proved in Proposition 6.4 by constructing prime covers along the sequence . This choice avoids a logarithmic loss from the local density factor.
The estimates arise from two complementary descriptions of the same covering problem. First, for any fixed , the classical linear sieve supplies
with cardinality , where . An upper sieve applied to bounds the loss caused by a factor by . The common local factor cancels. For sufficiently large even , Theorem 5.4 gives a weighted positivity criterion and, in particular,
The shifted-prime input is classical [2, 6]. The result here compares its supply with the losses of a fixed support.
Second, let be the minimum total number of prime factors in a support with . Prime pairs force disjoint covering requirements, each of which can be met by choosing its smaller summand. Theorem 6.1 separates them exactly:
where counts the prime pairs with both summands at least , together with the admissible endpoint, and is a residual covering number. Fractional covering and disjoint-product packing admit the same reduction, although their optima need not equal the integer covering number. The same prime-pair requirements force . Under the conjectural bound , Remark 6.5 therefore gives .
To describe the first vanishing step, write and put
Its occupancies satisfy . At a first zero, this nonempty set lies entirely in the one or two classes removed by . Theorem 3.3 characterizes this concentration through a sharp second-moment bound with prescribed central mass. The arithmetic estimates below compare survivor counts with class capacities to exclude such a step.
The distinction between total and noncolliding factors is also useful in explicit ranges. Discrepancy estimates show that supports with at most eleven factors cannot vanish for , and supports with at most seven noncolliding factors cannot vanish for , with no restriction on the size of the factors. These effective conclusions complement (1.3), whose constants have not been made explicit.
The parameter is related in purpose to Jacobsthal-type covering problems. Iwaniec [5] proved a bound of order for the maximal run covered by primes in the ordinary one-class problem. Ziller and Morack [10] study paired progressions and their phases. Nguyen [7] studies finite-window CRT intersections and shift correlations for symmetric pairs on primorial wheels. Here the classes are tied to the fixed sum , and colliding factors are not charged. The parameter measures the extremal size under this noncolliding budget.
We call the natural cutoff. With , factorization gives
Every composite summand below has a prime divisor below , so the only admissible summands are 1 and primes exceeding . Since is even, cannot be an odd prime. Positivity at the complete cutoff therefore implies that every even with composite is a sum of two primes exceeding . This conclusion remains open here.
Sections 2–3 describe the count and the structure of a first zero. Section 4 gives explicit exclusions. Section 5 proves the weighted survival bound and the upper bound for . Section 6 proves the cover reduction and the lower bound for . Section 7 states the remaining quantitative gap.
Parametrization and discrepancy
Throughout, . All prime products are squarefree and supported on primes at least 5. The empty product is allowed. For , let be its largest factor. For integers and , we write the canonical remainder operator as in [8, 9]:
Thus , including for negative , and . Divisibility is equivalently expressed by or . We reserve for this operator and use in exponent bounds.
Alongside (1.1), consider the ordered count
The reflection has only one possible fixed point, namely . Hence
Put
The parameter interval is , with . If , this family represents one of the two admissible values of , and its reflection represents the other. If , it represents all permitted summands. Consequently, setting
we have
This is the parametrization of [9], written for the ordered count.
For each , let be the unique integer satisfying . The excluded parameter residues are
Their number is . Define
The dependence on is suppressed in and . The discrepancy bound is distinct from the diagonal indicator . For , we have and .
Lemma 2.1 (Parameter discrepancy). We have
If , then . In particular,
Proof. We recall the proof of [9 Proposition 5.2]. For each , choosing one excluded class at every prime dividing gives distinct prescribed values of by the Chinese remainder theorem. The count of each prescribed value in an interval of length differs from by at most . Inclusion–exclusion gives the main term
The sum of the remainder bounds is
The second product in (2.6) exceeds 1 if . Finally, apply (2.5).
The structure of a first zero
If the factors are imposed in increasing order, the first vanishing step must concentrate the preceding set in the classes removed by the last prime. We first analyze that concentration without an ordering assumption. Let , where . We do not yet require to be the largest factor of . Abbreviate
Reflection of the summands gives
All occupancy indices belong to . For each phase , define
These phases arise by translating by multiples of . Every condition at remains unchanged, while runs through as does. Translated values need not lie in the original interval. The phase counting the representations of is .
Put
and
The mean of is , since each occupancy occurs times in the sum of the losses.
Proposition 3.1 (Variance identity and pointwise bound). Let . Then
and
Proof. Expanding the square of the losses in (17) gives (20). If , symmetry yields . Nonnegativity gives
Substitution into (20) yields , proving the first bound. If , then and , which proves the second.
For , write for the inequality
By the preceding proposition, implies . Using (20), its two branches become
Equality structure
When the two excluded classes coincide, the criterion has an immediate interpretation.
Proposition 3.2 (Collision). If and , then and
Proof. The identity shows that equality holds precisely when a single class carries mass. By (16), this class must satisfy . Since is odd and , it is . This is equivalent to .
For the other branch, write and
The residue is the unique fixed point of . The quantity counts an entire class, possibly containing several integers . It need not equal the diagonal indicator .
Theorem 3.3 (Second moment with prescribed central mass). Let be prime, let , and let the nonnegative real numbers satisfy . Put
Then
The bound is attained for every pair of real numbers . If and , then
and equality holds precisely when and all other occupancies vanish.
Proof. The quadratic form can be written as
It is positive definite. Indeed, a vector in its kernel would satisfy for every . Addition by traverses a cycle of odd length , so and the vector vanishes. Thus is strictly convex.
The reflection has one fixed point and two-point orbits. Once is fixed, the occupancies are described by distributing the mass among these orbits, with equal mass at the two points of each orbit. The set of distributions is a simplex. Convexity allows to be maximized at a vertex, with all the mass on a single orbit.
For the orbit , the two points are adjacent under the step , and neither is adjacent to the fixed point. The value is . For the orbit , both points are adjacent to the fixed point but not to each other, and the value is . Every other orbit gives . These classifications use . The two special orbits exist and are distinct even for . This proves the bound and its sharpness.
If , the only vertex attaining is the orbit . Strict convexity rules out equality at a nontrivial combination of vertices, proving the equality characterization. □
Corollary 3.4 (Central survival or strict variance). Suppose and . Then
Proof. The central residue is distinct from and , so supplies a survivor. If , Theorem 3.3 shows that failure of the strict criterion is equivalent to concentration in the excluded classes. The converse implications follow from these same observations and Proposition 3.1. □
For example, , , and give . Here , so , although . The variance criterion is therefore sufficient in general and exact in the empty-central-class branch. The positivity estimates below are obtained independently from the complete survivor set.
Class capacity and explicit positivity
Each value of is taken by a limited number of integers in the interval with . This allows us to compare a lower bound for the preceding set with an upper bound for the loss.
Lemma 4.1 (Residue-class capacity). With the notation of (3.1), let
Then
Proof. The condition permits values of . Together with a fixed value of , each determines one value of . An interval of length contains at most integers with a prescribed value of . The restrictions at can only decrease the count. The bounds for and follow by bounding one factor of each summand by . □
Proposition 4.2 (Two capacity criteria). If , the conditions
are sufficient for . To obtain , it is enough that
Proof. The first assertions follow from (4.2) and (3.9). For the last one, symmetry gives
Thus an estimate based on the maximum occupancy can prove positivity under a weaker hypothesis than that needed for the variance criterion. The independent bound (2.8) allows both comparisons.
Complete blocks of the preceding modulus
Proposition 4.3. Suppose and exceeds every prime factor of . Let . Then
The bracket is at least 1. In particular, implies , and the same holds if .
Proof. Each block of consecutive parameters contains exactly survivors of the restrictions at . Each value of occurs at most times in the block. Summing the complete blocks proves (4.5).
Let . This is an odd integer at least 3, and . The telescoping product over odd integers from 5 to gives
Since the last quantity is an integer, . The bracket in (4.5) is therefore at least 1. Finally, the three branches of (2.3) show that implies .
Thresholds for a given support
Assume now that every prime factor of is less than . Put
We have and . For the second comparison, the expression for in (2.6) increases with each . Also,
The product on the right includes additional factors smaller than one.
Theorem 4.4 (Explicit thresholds). Let be a product of primes in , with prime, and let be as in (33). Then
Furthermore,
Both denominators are positive.
Proof. By Lemma 2.1, . Also, . Comparing the first expression with gives (35), and comparing it with gives (36). The latter comparison also covers the branch . Finally, (34) implies .
The term retains exponential growth in the number of prime factors of . The theorem uses the fact that the last prime need not be included in the inclusion–exclusion remainder. This improvement of the finite bounds does not by itself cover all supports at the natural cutoff.
Supports with at most eleven prime factors
Let be the primes starting at 5. For , define
Lemma 4.5. If and , then .
Proof. Remove the largest prime . The prime factors of are at least , and . Hence and . Using (14) and (31),
The substitution is valid in the term . The right-hand side is positive for .
Table 1 lists the ceilings of the first eleven bounds. All comparisons use exact fractions. In particular,
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | |
| 5 | 7 | 11 | 13 | 17 | 19 | 23 | 29 | 31 | 37 | 41 | |
| 26 | 84 | 250 | 860 | 2754 | 9359 | 29745 | 90603 | 292506 | 893241 | 2780461 |
Table 1. Thresholds by cardinality. The sufficient condition is .
Theorem 4.6 (Eleven prime factors). If and , then . No restriction on the size of the factors is needed.
Proof. By (4.11), every even satisfies for . Apply Lemma 4.5.
Prime factors dividing half the integer
Discrepancy also allows us to retain information about collisions. Write
The prime factors of and form disjoint sets, , and . For this support, Lemma 2.1 implies
The non-strict hypothesis is valid because the discrepancy bound by is strict. For , let , and define
Lemma 4.7 (Extrema with disjoint groups). If , the left-hand side of (4.13) is at least . Moreover, for all with , a sufficient condition for positivity is
Proof. Since and , the left-hand side of (4.13) is at least
Replacing a prime by a smaller unused prime decreases this expression, regardless of its group. Its minimum therefore uses the first primes. If , assigning to and to decreases the product of factors, since
It also decreases , and hence the factor . The minimizing assignment puts the smallest primes in , proving the first assertion. Without using , criterion (40) gives the threshold
Its factors decrease as the primes increase. If , the ratio of the assignment to the opposite assignment is
The maximum assigns the smallest primes to and gives (42).
Theorem 4.8 (Seven noncolliding factors). If and , then , with no restriction on or on the size of its factors. If at least six factors of divide , the restriction on is unnecessary.
Proof. If , positivity follows from (11). Suppose . For , , we have exactly
Decreasing increases and decreases . As increases, the ratio exceeds , whereas grows by a factor at most 3 for . Thus Lemma 4.7 covers all cases , .
If and , the maximum does not exceed . Monotonicity follows by adding factors to the maximization problem in the lemma. The exact value is
Consequently, all are covered.
Theorem 4.9 (Restrictions on any zero). If and , then and
These conditions do not require the natural cutoff.
Proof. If , every prime factor of divides . The displacement produces the pair , coprime to . This contradicts vanishing.
For , the th prime factor of is at least , so
Furthermore,
Expression (43) is therefore at least . If (44) failed, the threshold in (40) would be reached. For , (44) is immediate because . Put and . Vanishing requires . Moreover,
Combining these bounds proves (45).
The elementary restrictions above are effective and retain information about both groups of primes. Equation (57) below gives a stronger asymptotic restriction by using the distribution of primes.
Sparse supports and the size of a vanishing instance
We now estimate the number of prime factors needed to eliminate every representation. The argument constructs a family with a prime summand and compares its size with the loss at each factor. Keeping the same local density factor in both estimates is essential for uniformity.
A family supplied by the linear sieve
For , let denote its least prime factor. Fix and put
Write
where the products run over primes. We have .
Lemma 5.1 (Shifted-prime sieve). For every , there are and such that
for all even . Both summands of every representation in this family are coprime to .
Proof. Consider and . A prime cannot divide the even integer , so every element is coprime to . For squarefree , the divisibility density is
Thus . Bombieri–Vinogradov gives, for any and a suitable ,
For with , the count and its density are both zero. For the other , the estimate is uniform in , since it uses the maximum over reduced classes at both endpoints of the prime interval.
The lower linear sieve applies uniformly after deleting the odd primes dividing . Its density product is
For ,
Indeed, at most prime factors of are at least . The sieve parameter satisfies , so its lower function is positive. Consequently,
Removing the possible element proves (5.3). For , the surviving summands are also coprime to .
This is the classical Goldbach-sequence argument in [6 Theorem 8 and Sections 4.2--4.3], with a variable power cutoff. An explicit general form of the linear sieve appears in [2 Theorem 6]. The restriction comes from its lower-sieve parameter and is not a new exponent for that classical construction.
The loss at an additional prime
The roughness of the complementary factor improves the loss estimate by one logarithm. The local factor must be retained.
Lemma 5.2 (Two linear forms). Fix and let . For , or for any prime with , put and . Then, uniformly in and for even sufficiently large,
Proof. No sieving prime divides . The polynomial has one root at , one root at each odd , and two roots at all other primes . Denote this number by and extend it multiplicatively to squarefree integers. The count for a squarefree supported below is
The upper-bound sieve of dimension two applies with a bounded upper sieve function, uniformly in these local densities. Indeed, its inverse density products are bounded by
those with two roots at every odd prime. Take . For sufficiently large , one has , and
The standard upper sieve therefore bounds the left side of (50) by
Here the root at contributes , and the correction at every odd divisor of is . Since and , the claim follows. The upper sieve used here is the standard dimension-two specialization of [3 Theorem 9.1], with the divisibility remainders verified above.
Let . For a support , define the normalized loss bound
All sums over factors of a support run over primes. Also put
Lemma 5.3 (Loss at one factor). For even sufficiently large,
In particular, .
Proof. The zero-loss cases follow from Lemma 5.1 and the defining roughness. If , the prime summand exceeds and cannot equal . Write . Every counted avoids all prime divisors below in Lemma 5.2, so that lemma applies. For , multiples of among contribute at most , and contributes at most one. Finally, .
Theorem 5.4 (Weighted survival and sparse supports). Fix and write . There are positive constants such that, for all sufficiently large even and every support ,
In particular,
There is no upper bound on the prime factors of .
Proof. At least members survive. Lemmas 5.1 and 5.3, enlarging to be at least 1, give (5.8). Each nonzero weight in (5.6) is at most once is sufficiently large. For the second sum this follows from
Hence . Choose .
The same factor multiplies the supply and the upper bound for each small-prime loss. Its cancellation explains the absence of a logarithm in (5.9). The weighted statement also permits many more factors when they lie close to .
Corollary 5.5 (Cost and size of a zero). For every , a vanishing instance with sufficiently large satisfies
Consequently, for each and ,
Thus .
Proof. Vanishing requires every member of to be removed. Compare its lower bound with the maximum loss in Lemma 5.3 multiplied by . The common factor cancels. Since , take . The bounded remaining values of are absorbed into the implied constant.
For a sequence of zeros with , one also has and
Indeed, , whereas (5.11) gives .
Consequences for the first-zero structure
The arithmetic estimates also control the localized moments. Their role here is a consequence of the survivor mass, independently of the extremal characterization.
Lemma 5.6 (Mass for long intervals). Fix . There is such that, for every prime , every product of primes in , and every even ,
Proof. Let be an absolute constant, chosen below. If , put . For sufficiently large in terms of , Lemma 5.1 applies. Every satisfies , and is a prime exceeding . Thus both orientations survive , and
using and .
Now let . Sieve the parameters by the excluded values at each . Their densities satisfy . The inverse-product condition for a sieve of dimension two holds uniformly by comparison with two excluded values at every prime . For squarefree , the divisibility remainder obeys
Take and . For sufficiently large , one has . The lower-bound part of [3 Theorem 9.1], with lower sieve function , gives
The sieve error is , with an absolute implied constant because the inverse-product condition is uniform. Since increases to , choose the absolute so that . The remainder is bounded by
Also,
After division by , the remainder is uniformly for as . Hence , and (11) proves the claim. ∎
Corollary 5.7 (Uniformity of increasing prefixes). Under (54), holds at every increasing prefix of for all sufficiently large , uniformly in . Moreover, for every fixed ,
whenever , is sufficiently large in terms of , and is supported on primes in .
Proof. Under (54), the surviving prime family gives for every . Capacity yields
This proves the strict criterion for , with a sufficiently large fixed . For the smaller steps, is supported below and uniformly when is large. Lemma 5.6 with gives , so the normalized variance is and satisfies the strict criterion for all sufficiently large . The remaining bounded primes and their finitely many preceding supports are covered by (36).
For the second assertion, Lemma 5.6 and capacity give
Since the right side tends to zero, holds for sufficiently large .
Remark 5.8 (Almost all ). For every , there is a set of even integers in outside which and hold simultaneously for every prime and every supported in . To see this, apply the classical weighted abundance estimate in [1 proof of Theorem 4.3] on dyadic intervals. Proper prime powers and primes at most contribute only to the weighted count. Dividing the remaining weight by gives prime pairs with both summands exceeding . These pairs survive every natural-cutoff support. Capacity handles , and (59) handles the smaller unbounded primes. The finitely many remaining primes are covered by (36). The exceptional set is therefore common to all supports for the same .
Minimum prime covers and a residual problem
The preceding section bounds from below the noncolliding cost of a zero. We now reduce the minimum total covering problem by selecting one prime from each prime pair. This will give the lower bound for along powers of two.
Every is nonempty. Define
This minimum is finite: taking all primes in covers every . Equivalently, is the minimum size of a set of primes meeting every . Primes at least can be omitted.
Let be the count in (6), and put
Then . Distinct prime pairs use disjoint sets of primes, because each prime determines its complement. The endpoint contributes another disjoint singleton when is prime.
Define the following set of primes:
Thus . The residual rows are
Let be their minimum covering number, with value zero if is empty.
Theorem 6.1 (Canonical prime-pair reduction). A minimum cover can be chosen to contain , and
In particular,
Proof. Consider a prime pair with . If , then . The prime occurs in only one row of the covering problem, namely the row : its only positive multiple below is . A cover containing but not can therefore replace by without increasing its size or uncovering any row. If , the row forces the prime . The endpoint, when present, forces .
The replacements for distinct prime pairs do not interfere. Hence a minimum cover can be chosen to contain . Its additional primes must cover exactly , proving the identity. Every residual row has a prime factor at most , since otherwise it would be a surviving prime pair or the endpoint already covered by . None of the small primes in occurs in a residual row. The other small primes cover all residual rows, proving the upper bound.
The set specifies a canonical choice within some minimum cover. The theorem does not require every minimum cover to contain it.
In particular, implies . The converse has not been established here. The unconditional relation explains why is close to the large-prime representation count whenever that count is large. It does not imply that is bounded, or that all minimum covers have the same shape.
Fractional covers and disjoint products
Let be the maximum cardinality of a family of rows whose products are pairwise coprime. The fractional covering number is
The equality is finite-dimensional linear programming duality. Integer covers and disjoint products satisfy
The duality does not assert equality of the two integer optima.
Proposition 6.2. With and defined on the residual rows,
Moreover, for every ,
for all sufficiently large even .
Proof. For a prime pair , transfer the fractional weight at to and truncate the resulting weight at 1. The row constraint ensures that this leaves weight 1 at . No other row uses , so feasibility is preserved and cost cannot increase. The diagonal and endpoint force unit weights as before. This proves the first identity in (6.10).
A residual family of disjoint products can be joined to all the prime-pair rows and the endpoint. The primes in do not occur in residual rows, and their larger prime partners occur only in their own rows. Conversely, any family of disjoint products has at most rows using a prime from , since different rows cannot use the same such prime. Its other rows form a residual disjoint family. This proves the second identity.
For (6.11), give each row of the weight and every other row weight zero. Lemma 5.3 makes these weights feasible for (6.8). Summing them and using Lemma 5.1 proves the claim.
Example 6.3 (A fractional gap at ). Here , , and . Removing the rows in and those with leaves the following nine rows. Their displayed prime factors avoid , so the list is exactly :
| 11 | 119 | ||
| 23 | 131 | ||
| 29 | 143 | ||
| 53 | 149 | ||
| 161 |
Table 6.3.
The primes cover these rows. A fractional cover gives weight 1 to 11 and weight to each of 7, 13, 17, 23, 29, with total cost . A dual solution of the same value gives weight 1 to row 11 and weight to each of rows 23, 29, 53, 131, 149. The table verifies every constraint exactly. Thus and . Rows 11, 131, 161 have pairwise disjoint prime factors, so , using . Therefore
The displayed factorizations and rational weights prove a gap between integer covering and packing. No external data or numerical optimization is needed.
A lower bound for the extremal size
The cover reduction also constructs vanishing supports and therefore complements the upper bound for .
Proposition 6.4. As , one has .
Proof. For , the local factor is . Apply Lemma 5.2 with and a fixed , for example . Every prime pair whose smaller summand exceeds is counted by that upper sieve, apart from the possible diagonal. The pairs with smaller summand at most , the diagonal, and the endpoint contribute . Hence
By Theorem 6.1,
since . Choose a sufficiently small fixed and, for each large , take the largest power of two . Then , , and . A minimum cover yields . Every prime factor of is noncolliding because is a power of two. Thus , proving the claim.
Together with Corollary 5.5, this proves Theorem 1.1. The lower bound constructs zeros for unrestricted supports. These covers need not satisfy .
Remark 6.5 (Forced noncolliding cost). Every vanishing support satisfies the sharper inequality
Indeed, a prime pair with and forces to contain or . Neither divides : one has , and would imply . Distinct pairs use distinct primes. The endpoint, when present, forces the noncolliding prime . Only the diagonal prime , when present, collides. Consequently,
If for all sufficiently large even , as predicted by the Hardy–Littlewood conjecture [6], then (6.12) gives for every zero with at most noncolliding factors, for all sufficiently large . Proposition 6.4 would then yield
Thus the conjectural exponent of is 1. Proposition 7.1 uses exponent 2 with a leading constant below 1, while Theorem 1.1 gives .
The natural cutoff and the remaining gap
The estimates for quantify the size of a vanishing instance, while the cover reduction identifies its forced prime-pair component. Neither bound reaches the scale needed to settle positivity at the complete natural cutoff.
Proposition 7.1 (A sufficient quadratic bound). If there is a fixed such that
for all sufficiently large , then for every sufficiently large even .
Proof. Put . The prime number theorem and give
If , the definition of gives , contradicting (73) for large .
The proposition is a sufficient criterion, not a converse or an established estimate for . The exponent in Theorem 1.1 is separated from this quadratic target. The analogy with the ordinary Jacobsthal bound does not transfer its proof to the two classes tied to .
The weighted criterion locates another precise gap. For the complete natural support, Mertens’ theorem gives
The factors dividing contribute only in this range. Thus the upper bound for the total loss now has the same order as the supplied family, . The constants obtained here do not prove . Finite measurements of the actual losses cannot replace a uniform strict inequality. The gap is consistent with the parity obstruction in classical sieve theory. Our estimates give no lower bounds for intersections of losses. Type II, or bilinear, information is one possible route beyond these bounds, as illustrated by the prime-producing sieve framework in [4]. No such estimates are proved here.
For completeness, the local question remains:
Problem 7.2. Does every even , every prime , and every product of primes in satisfy and ?
An affirmative answer would exclude every first zero at the natural cutoff. It would also imply, by (6), that every even with composite is a sum of two primes exceeding . Because a large central occupancy can preserve a representation without satisfying , this local question contains more information than positivity alone.
Order the factors of a hypothetical vanishing support increasingly and let be its first vanishing prefix. The preceding set is nonempty. At the natural cutoff and for , Theorems 4.6 and 4.8 and Proposition 4.3 require
The explicit results also require the profile inequalities (4.17)–(4.18). For each fixed , sufficiently large instances must have . Corollary 5.7 excludes for sufficiently large , with any fixed . The first-zero configuration is therefore constrained both by its residue concentration and by the cost of the support that produces it. Excluding every remaining instance is the open step.
References
- [1]Gautami Bhowmik and Lasse Grimmelt. The exceptional set of the Goldbach problem. Analysis Mathematica, 52:767–808, 2026. doi: 10.1007/s10476-026-00191-z.DOI
- [2]Matteo Bordignon, Daniel R. Johnston, and Valeriia Starichkova. An explicit version of Chen’s theorem and the linear sieve, 2025. URL https://arxiv.org/abs/2207.09452. arXiv:2207.09452v6.
- [3]Harold G. Diamond and Heini Halberstam. A Higher-Dimensional Sieve Method, volume 177 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, 2008. With procedures for computing sieve functions by William F. Galway.
- [4]Kevin Ford and James Maynard. On the theory of prime producing sieves, 2024. URL https://arxiv.org/abs/2407.14368. Preprint, arXiv:2407.14368.
- [5]Henryk Iwaniec. On the problem of Jacobsthal. Demonstratio Mathematica, 11(1):225–232, 1978. doi: 10.1515/dema-1978-0121.DOI
- [6]Angel V. Kumchev and Dimitar I. Tolev. An invitation to additive prime number theory. Serdica Mathematical Journal, 31:1–74, 2005. URL https://tigerweb.towson.edu/akumchev/a17.pdf.
- [7]Tien Tuan Khiem Nguyen. Finite-window nonconvering on primordial wheels: Higher-order CRT bounds and shift correlations, 2026. URL https://www.preprints.org/manuscript/202608.1299. Preprint, version 1.DOI
- [8]Andrés M. Salazar. Exact formulas for restricted coprime representations of even integers. Communications on Number Theory and Combinatorial Theory, 7, 2026. doi: 10.70013/k94n5fzj. Article 2.DOI
- [9]Andrés M. Salazar. Restricted coprime representations modulo 6P: Exact CRT formulas and positivity thresholds, 2026. URL https://arxiv.org/abs/2609.22305v2. Preprint, arXiv:2609.22305v2.
- [10]Mario Ziller and John F. Morack. Divisibility in paired progressions, Goldbach’s conjecture, and the infinitude of prime pairs, 2017. URL https://arxiv.org/abs/1706.00317. Preprint, arXiv:1706.00317.