Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Independent record: Erdős Problem 940
The companion working files this record names (positive_density_reduction.md
and the others listed at its end) were not retained; the names are kept so
the citations stay readable, and the retained re-derivations are the topical
notes of this folder.
1. Scope and outcome
This investigation used only problem page and the supplied papers. No web search was made, and no earlier research notes were assumed. Assertions in digests about unspecified “current research” were not treated as results. The full supplied Ghidelli paper and Voight chapter were read by the collaborators using their results. The full Beyer de Ryke paper was also read for its canonical decomposition and counting framework, not to re-audit its known cubic theorem.
Write
The supplied background establishes . It does not establish .
The main argument developed here is a quartic complement argument:
Quartic theorem. For every , there are integers and such that
In particular,
The complete assembly of this argument is recorded below. Its new ingredients are the elimination of every principal finite-character quartic coefficient pattern, and a small random omission of primes that suppresses every remaining determinant squareclass. The randomization is only an existence device for a finite modulus.
This does not prove density zero or positive density for . No result settling either question for any was obtained. Density zero for also remains unresolved here. Thus this is not a complete resolution of all the questions in the problem.
The mathematical argument below has been checked within this investigation; it has not been externally reviewed. One independent internal review checked the elimination and quadratic-character lemmas but not the final analytic note. That review's remaining question was the uniform Gaussian conductor and -function bound, proved in Section 5 below. No specific mathematical gap in the assembled quartic argument was identified.
Two other collaborators read the completed analytic note and checked its Gaussian lattice estimate, conductor argument, trace bookkeeping, omission estimate, and tail bound. Neither reported a substantive gap. This is an internal check, not external confirmation of the new theorem.
2. Canonical decomposition and an exact density-zero reduction
For any , put
Every has a unique expression , with and . Indeed, an exponent divisible by goes entirely into ; an exponent congruent to is uniquely , with . Consequently
Sums of fewer than summands therefore account for integers up to .
For fixed , let be the union of the value sets of , with and . Counting tuples in a containing box gives
For every , the coefficient tail is , because .
It follows that the following statements are equivalent:
- has density zero;
- every positive diagonal form , with arbitrary fixed positive integer coefficients, has a density-zero value set on positive integer arguments.
For the nontrivial direction involving arbitrary coefficients, multiply the form by . Each is -powerful, so the dilated value set lies in . In the other direction use (2.2), first at fixed , then let .
In particular, positive upper density of would force positive
upper density for at least one fixed critical diagonal form. Allowing
infinitely many auxiliary powerful coefficients cannot, by itself, bypass
that critical diagonal-form problem. This reduction is not a positive-density
proof. A fuller separate version is in positive_density_reduction.md.
For the rest of the record set
The squarefree part of is denoted by ; it can equal 1.
Two weighted convergence facts will be used repeatedly. For every fixed and ,
The local Euler factor is : the smallest nontrivial coefficient exponent is 5. In particular,
Here the condition implies , so (2.4) follows from (2.3) with . The tuple never belongs to this tail.
3. Elimination of the principal quartic patterns
Call a tuple exceptional in this record if either
or, for some permutation ,
This terminology refers to the finite-character expansion below, not to Ghidelli's differently defined exceptional family.
Elimination lemma. If
then an exceptional tuple cannot represent by , even with arbitrary integer variables.
We first justify the quadratic obstruction. A positive definite rational quaternary diagonal form of square determinant is similar to , with . This is the norm form of . Its quaternion algebra is division at the real place. If the form were isotropic over every , the algebra would split at every finite prime. Hilbert reciprocity forbids exactly one ramified place. This uses precisely Voight, Proposition 14.2.1 and Corollary 14.2.3. The similarity follows directly by dividing a diagonal form by and rescaling its last coordinate, using .
At an odd prime, a diagonal ternary form with unit coefficients has a nontrivial zero: the sets and in both have size and intersect. Set and lift. Thus a unit-coefficient quaternary form is isotropic there. Also, if and a diagonal term is a unit, then is isotropic over whenever for odd , or for . Replace by
The required square root exists in for odd , or for arguments in at 2, by Hensel lifting.
Suppose first that (3.1) holds and . Apply these observations to , at . Each original summand has valuation zero or at least four at every prime. At each odd , (3.3) forces a unit summand; at 2 the same follows because otherwise . Hence is isotropic at these primes. At every other odd prime its coefficients are units. This contradicts the quaternion obstruction.
For (3.2), write , , with positive squarefree and positive integers. The relation implies
Use the identity
The resulting positive quaternary form
has square determinant. At an odd , a unit among the first two original terms gives a unit term of . If neither is a unit, both are divisible by . The remaining original terms must both be units: exactly one would make their sum a unit, and neither would make it divisible by . Then is a unit term of . At 2 at least one of the first two terms must be odd. Otherwise the remaining terms would both be odd, and
contrary to (3.3). All remaining odd primes are unit-coefficient primes for . Thus is isotropic everywhere finite, again impossible. This proves the elimination lemma.
Notice that it is a congruence obstruction: if all primes dividing occur in the prescribed modulus, there are no congruence solutions at all. Indeed any residue-vector solution would give an integer satisfying (3.3).
4. A uniform quadratic prime-harmonic estimate
The random omission argument needs a two-sided, conductor-uniform estimate, not just fixed-character convergence:
for every nonprincipal real Dirichlet character presented modulo . No Siegel estimate is needed. Here are the details of an elementary weak polynomial lower bound sufficient for (4.1).
For primitive real , fixed-character nonvanishing follows from the fixed-character prime number theorem recorded in Ghidelli, Lemma 5.4: partial summation gives convergence of , hence a finite real logarithm of . There is no need for uniform constants in this application.
Let . The Gauss sum has absolute value . The sine Fourier series gives, for odd ,
The integer sum is nonzero by nonvanishing. For even , set
This is a positive algebraic unit. Indeed the factors and their inverses are algebraic integers by geometric-sum formulas; the remaining factors cancel since . Pairing and proves positivity. Galois automorphisms send to or , so is an integer. The cosine Fourier series gives . Nonvanishing implies , so and
Both parities give .
Periodicity, zero mean, and partial summation give, uniformly for ,
Near 1, the derivative bound preserves half the preceding lower bound. Outside that short interval use the Euler-factor inequality
Together these give
For , set . Chebyshev's elementary prime estimates show uniformly in the character that
The smoothing difference below is bounded by ; the absolute tail above is bounded by a constant times ; prime powers of exponent at least two have bounded total. Equations (4.3)--(4.4) prove (4.1). Removing Euler factors to pass to an imprimitive character costs at most . Differences of endpoints give the same estimate on every prime interval.
The same smoothing calculation with the principal character gives
Using (4.1) for , we obtain uniformly for
A longer proof, including the Gauss-sum identities, is in
quadratic_prime_bound.md.
5. Gaussian characters: the required uniformity
The supplied Ghidelli paper provides two inputs used here:
- Proposition 5.2 identifies as an order-dividing-four Gaussian Hecke character, with some defining ideal supported on . It identifies the normalized Jacobi character , with fixed defining ideal , and infinity type .
- Proposition 4.3 gives the exact quartic zero-class character expansion written in Section 6 below. Kummer theory in Section 6.2 identifies as principal precisely when .
The unspecified exponent of a defining ideal in Proposition 5.2 must not silently be assumed uniform. The following argument supplies that uniformity. Since is a PID, a finite Hecke character can be regarded as a character on the unit group of a residue ring. At an odd prime ideal, principal units modulo a prime power form an odd-primary group, so an order-dividing-four character kills them. At , every unit congruent to 1 modulo is a fourth power: Hensel applied at 1 to uses and . This also gives a fourth power in every finite quotient. Thus
If all rational prime divisors of divide , a defining ideal of norm suffices. The same is true for a twist by , whose infinity type is 2 and whose fixed conductor only changes the absolute constant.
Here is the uniform upper bound for the associated -functions. Let have a defining ideal of norm , and infinity type or 2. For , assume it is nonprincipal. Write
where is a finite residue character, extended by zero on nonunits. The expression is invariant under Gaussian units. For every residue class modulo , comparison with the square cells of gives
Boundary cells give the indicated boundary error. Away from the central cells the angular function has gradient ; integrating it over the disk gives the same error. The central cells contribute . For the integral vanishes. For its coefficient after summing against vanishes because the finite character is nonprincipal. Dividing the Gaussian integer sum by four yields
Split the Dirichlet series at , and use partial summation for the tail. The initial absolute sum is , and the tail is , uniformly for . Therefore
The prime-ideal version of the smoothing calculation (4.4) gives
Its constants are absolute for these two fixed infinity types. Chebyshev's estimates for Gaussian prime ideals follow directly from those for rational primes. Inert prime ideals have norm , so discarding them changes such a harmonic sum by .
6. Local counts and the full quartic trace
For an odd prime prescribe the target . Let be the number of solutions modulo , divided by . If , then
Indeed the zero-class count modulo is . All solutions except the zero vector are nonsingular and have exactly lifts to the specified target modulo . The zero vector has none.
For , fourth powers and squares have the same distribution in . The quadratic Gauss-sum evaluation therefore gives
For , Ghidelli's exact expansion is
where is one Gaussian prime above and . The finite terms after are three conjugate pairs and six conjugate pairs. All multiplicities are positive. Their bounds, together with the last pair, give 21.
A positive rational number is a fourth power in exactly when it is a rational fourth power. A negative rational number , with , is a fourth power there exactly when for rational . To check this, the imaginary part of is . Thus a principal character in the second term of (6.3) forces square, and a principal character in the third term is precisely (3.2). The last character has infinity type 2 and is never principal.
Consequently, for every nonexceptional tuple all the finite characters in this expansion are nonprincipal and . Apply (5.4) to the nine finite Gaussian conjugate pairs and the one infinity-type-two pair. Combine the quadratic term over all good rational primes, using the elementary upper bound . This last combination is essential: it avoids introducing an inverse quadratic -function in the full baseline. The result is
Removing additional primes dividing from an Euler sum costs at most , explaining the term.
At a bad coefficient prime, the following bound is crucial:
Call a coefficient active if it is a unit modulo . If all active variables vanish modulo , the sum is zero modulo , because inactive canonical coefficients have valuation at least five. Thus these singular solutions cannot lift to the target . Every other solution is nonsingular and has lifts. Fixing three variables bounds the number of solutions modulo by , using an active variable; if there is no active variable there are no solutions. This proves (6.5).
At 2 prescribe , and normalize its solution count by . Its local factor is at most 16. These local factors multiply by the Chinese remainder theorem.
7. The random omission construction
Fix a sufficiently small absolute . For each positive squarefree , set
The series converges uniformly and absolutely, , and . In particular .
Let and put
For sufficiently large , . Include every odd prime , and every with . For each , , independently omit the prime with probability . For the resulting finite set , let
The CRT determines .
For every fixed positive squarefree , (4.1) and (4.5) imply
To verify this, expand (7.1). The term has off primes dividing , and gives the negative main term. For , both the product character and its twist by are nonprincipal, so their window sums are . The same applies to the baseline term . Absolute convergence justifies summing these bounds over . The primes dividing cost . Removing primes dividing costs at most .
Let denote the full normalized solution count modulo , namely the number of residue-vector solutions divided by . At an eligible good prime, independence replaces its local factor by
At other good primes (6.1) applies. At bad primes use 4, and at 2 use 16. The inequality , (6.4), and (7.3) give, for each nonexceptional tuple,
All constants are absolute, independent of the tuple, , and . Errors have an absolutely bounded sum. This argument does not require dividing by a possibly vanishing local factor.
Choose so small that , and absorb the logarithmic power into, for example, . Equation (2.3) now provides a summable majorant for over all nonexceptional tuples. For each such fixed tuple, and , so (7.5) tends to zero. Dominated convergence proves
For an exceptional tuple with , the elimination lemma gives for every outcome of the random choices. Every remaining exceptional tuple has . Uniformly over all choices, (6.1), (6.5), and the bound 21 imply
Indeed an included good-prime factor is at most ; an omitted one is 1. Equation (2.4) gives
Combining (7.6)--(7.7), and using Tonelli for nonnegative terms,
For each there are only finitely many random choices. Thus there is a deterministic outcome making this entire weighted local sum arbitrarily small. This handles the infinite coefficient family, not merely a finite diagonal subsystem.
8. From the weighted local sum to actual density
This step is included explicitly to avoid confusing a narrower equation or a local estimate with the required assertion about .
Fix any outcome of (7.2). For a fixed tuple , lattice-point counting in the compact region , , in each residue class gives
For completeness, the number in each vector residue class is its region's volume divided by , plus , by ordinary Riemann-sum approximation of this Jordan-measurable region after dilation by . The positive-orthant unit -ball has volume ; scaling coordinate by multiplies it by . Multiplication by the number of allowed vector residues proves (8.1).
For every , the left side of (8.1), divided by , is at most , by counting in the containing coordinate box. These weights are summable. Therefore dominated convergence legitimately sums (8.1) over all canonical tuples. The total number of ordered four-term representations in the progression, divided by , tends to
By (7.8), choose an outcome for which (8.2) is less than . Distinct represented integers are no more numerous than ordered representations. Representations with one, two, or three summands account for only integers by (2.1), and is now fixed. This proves (1.1). Taking, for example, , the progression contains at least nonvalues, proving (1.2).
9. Failed approaches and calculations retained
Elementary tuple counting does not settle the problem
For fixed , the ordered tuple count is
by the same finite-coefficient lattice count and summable tails. Dividing by gives the unordered leading constant; tuples with equal summands are only . This does not give an support estimate. Nor does its constant eventually become less than one: just the Euler factors at 2 and 3 give
Since and , the unordered constant is at least , which tends to infinity.
Simultaneously splitting all quartic coefficients fails
The Fermat quartic has a useful deficit at primes . But if the canonical core contains , making that coefficient a fourth power forces 2 to be a fourth power, hence a quadratic residue, and therefore forces among primes . Thus the cubic all-coefficients-splitting construction cannot simply be copied in degree four.
A finite quadratic-character mask has a circular tail problem
At primes , the trace is . For finitely many nontrivial squareclasses one can exclude completely split primes in their multiquadratic field; every nontrivial character then has negative mean. However, the saving can be as small as the reciprocal of the size of the squareclass group. The reciprocal-prime mass needed to suppress the core then grows with that group, while the crude uncontrolled tail grows exponentially in the same mass. Choosing the core first does not resolve this circular dependence. The infinite small omission mask in Section 7 replaces this with a uniform integrable majorant.
Eliminating only square determinants is insufficient
The nonsquare determinant tuple has a principal finite character in the third term of (6.3). A baseline proof that assumes all nonsquare-determinant tuples have only nonprincipal finite characters is false. This example is itself excluded by . The general repair is identity (3.4), which eliminates every principal third-term character, not just this example.
Fixed prime-power valuation gaps are not enough
For example, the canonical tuple leads to a positive square-determinant quadratic form, but its quartic values can exhibit every valuation class modulo four at 2: the first pair gives valuations 0 or 1, and the second gives 6 or 7, with fourth-power scaling. Thus one cannot simply assert that quaternion anisotropy produces a missing valuation class. The successful obstruction instead prescribes valuation one at every odd coefficient prime and valuation three at 2, forcing local isotropy of the associated positive square-determinant quadratic form.
Crude inverse -bounds need a small coefficient
A direct selected-prime Euler product can involve inverse quadratic -factors with fixed large exponents. Polynomial lower bounds then produce a coefficient loss too large for the canonical weight. The successful argument first bounds the complete quartic baseline using only positive -powers, and introduces inverse-type estimates solely through an omission probability of size . The resulting radical loss is , which can be made summable. Neither a uniform Siegel bound nor an unproved zero-free hypothesis is being substituted here.
Numerical calculation was diagnostic only
A finite Euler-product computation over primes up to gave approximately . For the weight restricted to square determinant products, the local factor is
The corresponding truncated product was about 142.515, giving an unordered weighted volume about 4.008. These are truncated numerical values, not certified infinite-product values and not used in the proof. They discouraged the idea that simply retaining all square-determinant tuples would have total representation constant less than one.
10. Remaining uncertainties and continuation points
The density-zero question is untouched by the quartic complement argument. Making one progression very sparse, with its modulus changing with , does not imply global density zero. It is equally compatible with positive density of . The same distinction applies to the supplied cubic theorem.
No unconditional positive-density construction was found. The exact reduction in Section 2 shows that such a construction would yield positive upper density for some fixed positive diagonal form in the critical number of variables. Conditional six-variable cubic energy bounds from the supplied Wang paper were not treated as unconditional results, and no statement about the narrower powerful equation was promoted to a statement about arbitrary target integers in .
For , the quartic mechanism does not automatically extend. The useful zero-class local fluctuations are no longer of divergent reciprocal-prime size, and the four-dimensional positive quadratic norm-form obstruction is special. No replacement for either ingredient was established.
For further checking, the most sensitive parts of the quartic proof are:
- preserving the full-prime quadratic term when deriving (6.4);
- eliminating both kinds of principal finite-character pattern, not just square determinants;
- keeping the conductor estimate (5.1) explicit and uniform;
- using a two-sided bound in (4.1) for the omission cross terms;
- retaining the growing support cutoff , so the exceptional infinite tail is bounded by (7.7), rather than silently discarding it;
- fixing the final modulus before using the counting limit (8.2).
Each of these has a stated argument above.
Supporting files created during this investigation, none of which is retained here:
positive_density_reduction.md— the general exact density-zero reduction;quartic_elimination.md— the complete quadratic/quaternion elimination;quadratic_prime_bound.md— detailed uniform quadratic harmonic estimates;quadratic_harmonic_bound.md— an independently written version of that lemma;quartic_analytic.md— the uniform Gaussian and randomized local estimates.
The sources actually needed by the quartic proof are Ghidelli's supplied paper (the exact character formula, the Hecke-character correspondence, Kummer theory, and fixed-character nonvanishing) and Voight's supplied chapter (quaternion reciprocity). The canonical decomposition and lattice framework are also developed explicitly above, consistent with the supplied Beyer de Ryke paper. No purported later research note is an input.