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 working files this record names (positive_density_reduction.md,
r4_local_elimination.md and r4_principal_character_elimination.md) were
not retained; the names are kept so the citations stay readable, and the
retained re-derivations are the topical notes of this folder.
Status
This document records an investigation from scratch, using the canonical problem page and the supplied papers. There was no browsing and no use of earlier research notes. References in supplied digests to other “current research” were not treated as available results.
No complete resolution of an open part is claimed in this record. The investigation produced a concrete proposed proof of a positive-lower-density complement for . Its local algebraic steps and fixed-modulus transfer were checked. Analytic supporting lemmas were written by separate authors, but the complete assembled proof did not receive a final independent verification. The proposed theorem is therefore distinguished from the established components below. This is not a density-zero proof.
The different questions retain the following status in this record:
- : Beyer de Ryke's positive-lower-density complement theorem is accepted background and was not re-audited. Density zero of is unresolved here.
- : substantial local elimination, a full treatment of the square-product kernel stratum, and an explicit proposed completion for the full sumset. Neither an unconditional theorem about the full nor density zero is claimed here.
- : neither requested assertion was established.
- No unconditional positive-density construction for any was established.
The appendices reproduce the actual supporting working files. Claims in those files concern their stated auxiliary lemmas; their conjunction has not been silently promoted to a completed theorem.
1. Established canonical reduction
Write for the positive -powerful integers and
Every has a unique expression , , . This follows by reducing its prime exponents modulo , retaining in the kernel when the residue is .
The convergent weight is
Thus . Fewer than summands contribute values. If , ordered -tuples with at least one kernel exceeding , and all summands at most , number at most
A proved consequence is the equivalence:
For the reverse implication use the finite-kernel truncation and (1). For the forward implication multiply a fixed coefficient vector by ; every is -powerful, so its scaled value set is a subset of .
In particular, positive upper density of would already imply positive upper density for some fixed positive diagonal degree- form in variables. This does not assert existence of natural density. It prevents a purported positive-density construction from relying essentially on kernels tending to infinity. Full proof: Appendix A.
2. Proved quartic elimination: first square products, then all principal terms
For , kernels have prime exponents . For a finite set of odd primes choose
Square-product lemma
If the kernel tuple is supported on and is square, then is impossible.
Indeed put , . At an odd , the target valuation forces an original summand to be a unit, since every nonunit summand has valuation at least . There is consequently a unit derivative of , and Hensel lifting gives a nonzero -adic zero. At , target valuation forces an odd summand, so the derivative valuation is ; strong Hensel applies because . At other odd primes is unimodular of dimension four and is isotropic.
A positive definite quaternary form of square determinant is similar to , the norm of the quaternion algebra . The preceding isotropy makes the quaternion algebra split at every finite place, while positivity makes it ramified at infinity, contradicting Hilbert reciprocity. This uses Proposition 14.2.1 and Corollary 14.2.3 of the supplied Voight chapter, whose full Markdown was read.
Extension to every principal finite character
Ghidelli's exact quartic count, for away from the coefficients, is
The nineteen finite-character terms of , all with coefficient , have quartic-symbol arguments
The -term is a Gaussian Hecke character of infinity type . For ,
The full supplied Ghidelli Markdown, not merely the digest, was read.
Principality in the first seven terms forces square. The remaining case has
Write , with positive squarefree. Then , where , and
Thus is represented by the positive square-determinant form
The same local contradiction applies. At an odd support prime, an original unit summand gives a unit coefficient-coordinate of : if the unit is in the last pair, use either or . At , if neither of the first two summands is odd and both of the last two are odd, their sum is , contradicting the target. In the remaining cases has an odd coefficient-coordinate, and strong Hensel again applies.
Therefore (2) eliminates every supported tuple with any principal term in (4), not just square-product tuples. This distinction is necessary: has nonsquare determinant but a principal term of the last type. Detailed proofs, independently checked at the local level: Appendices B and C.
3. Exact local factors and summable weights
Every selected odd prime must use modulus , with target . If coefficients are units at , and counts zeros of the active -variable form modulo , its normalized density is
and is zero for . The nonzero zeros lift nonsingularly, whereas the origin cannot lift to target valuation . Inactive coefficients vanish modulo . Formula (7) follows by counting the lifts, including the free inactive coordinates. It is at most , by fixing all but one active variable.
At a good prime this becomes . At , the normalized factor modulo is at most . Using only modulus at an all-bad prime would instead give factor , a real error avoided by (7).
Set
For every fixed and ,
The nonconstant local Euler term is . Any completed analytic argument must respect this exponent margin.
The entire square-product stratum can already be treated. At a prime, let , . Its square-product local weight is
An odd valuation must occur in at least two coordinates, so that event has weight . The weighted tail with an odd-valuation prime is consequently . Such primes are the only support primes needed in the square-product elimination, because even coefficient valuations can be removed from the quadratic form by rescaling.
Prescribing (2) at all odd primes up to , the total local weighted mass of surviving square-product tuples is therefore at most
Here a crude Gauss-sum estimate gives at good primes, and (7) handles bad primes. This yields arbitrarily small upper relative density for the square-product stratum in suitable progressions. It does not yet say this about the full . Appendix B includes the proof.
4. Proposed analytic completion of the full argument
This section states the precise assembly that was not finally certified. The supporting analytic proofs are included in Appendices D and E so another mathematician can check them rather than reconstruct them.
4.1. Baseline bound
The needed estimate for tuples with no principal term in (4) is
The proposed proof is positive Euler-product factorization, using upper bounds only. The determinant character occurs at all rational odd primes through (3) and (5); the other terms pair into Gaussian characters. Inert Gaussian primes have norm , hence bounded contribution. All the relevant nonprincipal -functions then occur with positive powers.
The baseline working file claims, more precisely, a bound
where counts the principal contributions after conjugate pairing. The full elimination removes tuples whose support lies below .
The proposed uniform proof uses a defining modulus . At odd Gaussian primes, an order-four character is trivial on principal units; at , units are fourth powers by Hensel. The fixed Jacobi character has defining ideal . For infinity type or , write with periodic finite factor . Residue/lattice cancellation gives a coefficient partial sum bounded by a constant times for , . Splitting the Dirichlet series at gives for . Prime-sum smoothing then gives (B).
The points requiring final verification are the uniform lattice estimate, the local conductor reduction, and the precise positive Euler-factor bookkeeping. Ghidelli's fixed-character prime-number theorem by itself is not enough: its constants depend on the character.
4.2. A single universal selector for all nonsquare determinants
For positive squarefree , choose with a fixed small , and for primes choose independent selectors of mean
Take so ; also . A completed selector lemma must give one realization , not a different realization for each determinant, with:
- Uniformly in positive squarefree and ,
where is arbitrarily small by choosing small. 2. For every fixed , this product tends to zero on the moving interval , for any fixed . \tag{S2}
The mechanism is a negative expectation for each nontrivial determinant:
The term is the sole principal correlation. The sum over must be justified by truncation or a uniformly summable bound. Removing primes up to costs only .
Uniform upper bounds use
for nonprincipal real Dirichlet characters of modulus , uniformly in . In the expanded expectation the only principal term has a negative coefficient, so it can be discarded for an upper bound. Every other term is controlled by (Q); the weighted conductor losses sum because .
Centered selector sums have squared increment bounds summing to . A maximal Hoeffding/exponential-martingale estimate should give a tail for the supremum over all cutoffs. Set , sum these bounds over , and take large. There is then one realization with all-, all-cutoff discrepancy . Interval errors cost twice a prefix error. This both preserves fixed- decay and gives (S1).
Appendix E contains the selector proof, written by a separate author. Its statement is somewhat stronger than needed here; only the polylogarithmic lower cutoff is used in this proposed completion.
4.3. Avoiding an unprovided Siegel bound in (Q)
The proposed elementary proof of (Q) is retained because mere fixed-character convergence does not supply a summable uniform bound.
For primitive odd real of conductor , finite Fourier expansion gives
The nonzero integer numerator gives a polynomial lower bound. For even ,
is intended to be a positive norm-one quadratic unit, with . Since , its integer trace gives . The unit assertion uses cancellation of the common cyclotomic prime factor at prime-power conductor. Nonvanishing can be supplied by a fixed-character theorem in the sources, or by Landau's nonnegative-coefficient argument for .
Character partial sums give near . Together with
this yields a polynomial conductor lower bound uniformly for . Imprimitive factors cost another polynomial. Upper bounds are elementary. Finally, at , Chebyshev's prime upper bound makes the difference between the truncated harmonic prime sum and bounded uniformly. This gives (Q).
These details are written in Appendix E, but were not all independently verified by the author. No Siegel theorem or unproved GRH assumption is being silently used.
5. Conditional assembly, with the infinite-kernel reduction proved
Assume the uniform statements (B), (S1), and (S2) have been fully verified. Let , and prescribe (2) at all odd primes at most and at selected primes in . Write for the resulting modulus and target, and for the normalized local density.
For a nonexceptional tuple the squarefree determinant part is nontrivial: otherwise the first character in (4) is principal. At good selected primes,
Thus (B) and (S1) give a bound
by taking the small exponents appropriately. Deleting coefficient-dividing primes costs only another exponential in , by (7). For each fixed such tuple, (S2) makes .
For an exceptional tuple, if its support is below , elimination gives . A surviving tuple has . The crude bound
is absorbed in (10) by choosing sufficiently large. Each fixed exceptional tuple eventually vanishes.
Equation (8) would therefore be a single summable majorant, independent of . Dominated convergence would give
This is the essential full-sumset statement, not a bound on a narrower equation.
Here is the proved transfer from (11). Fix one modulus and target . For a fixed tuple, count residue classes in . The positive quartic region is inside that box, so
To sum this, first restrict to finitely many kernels. The remaining normalized count is at most times the raw summable kernel weight; let the finite set increase while stays fixed. Fewer than four summands contribute . There is no need for an estimate uniform in a growing modulus.
If (11) were certified, choose a single finite with its weighted sum below . Then
Order of limits: choose , then , then remove a kernel truncation with fixed. This conclusion would settle infinitude for , but would not prove density zero of .
6. Calculations and approaches that did not resolve an open part
Total tuple counts
The natural unordered tuple constant is , not automatically less than one. Euler products truncated at primes below gave:
| truncated | corresponding constant | |
|---|---|---|
| 3 | 4.6507 | 11.9379 |
| 4 | 9.5971 | 238.5820 |
| 5 | 19.0925 | 13795.6 |
| 6 | 36.7496 | 2181147.8 |
These were exploratory computations, not rigorous upper bounds. They do not prove anything about the complement.
A negative one-prime mean that cannot be multiplied
At , with all relevant odd coefficients fourth residues and , the four canonical 2-adic weights are . Divide by their sum , and set
The mean is
whereas the possible -contribution has absolute value at most . This negative one-prime mean is not an iterable independence statement: the coefficient classes remain fixed, and positive strata can dominate repeated products. The tuple is one obstruction.
Forcing every coefficient to be a fourth residue also fails: the powers of 2 in a sufficiently rich core force primes , where the equal-coefficient quartic has , rather than the at primes .
Finite-core multiquadratic selection and circular constants
For a finite real multiquadratic field with group , summing any nontrivial quadratic character over nonidentity elements gives . Thus primes with nonidentity Frobenius suppress every nonsquare determinant in that finite core.
The unresolved issue in that version is the tail: its bounds depend on the core field, and enlarging the core changes the constants, potentially exponentially. Square-product tuples also have positive local drift until eliminated. A naive two-tail argument is circular. The universal selector (9) was proposed to remove the dependence on a changing finite core.
Positive-density attempts and the Perazzo mismatch
For cube collisions, let , . Then
The extra cannot be discarded to use the supplied Perazzo theorem. Moreover the six-variable diagonal cubic is projectively smooth, whereas the Perazzo hypersurface is singular along a plane, ruling out an invertible linear identification. No valid nonlinear reduction was found.
An equal-three-cube energy bound would give positive lower density by Cauchy--Schwarz, hence refute density zero for . No unconditional such bound was established. The conditional Wang theorem was not presented as an unconditional result.
Norm-form ideas likewise did not produce a fixed critical diagonal form with known positive-density values. The finite-kernel equivalence prevents avoiding that difficulty merely by introducing unbounded auxiliary kernels.
Other scope limitations
Primitive estimates where all three entries are powerful do not bound representations of arbitrary targets. Fixed quadratic-fiber bounds do not control all targets after summing kernels. Gaps in a perfect-power subset need not be gaps in the larger powerful-number sumset. No such reduction was asserted.
For , the good-prime deviations of fixed critical diagonal forms are summable at the relevant local scale. No replacement for the cubic/quartic divergent local saving was found. This is a limitation of a method, not a negative answer to the problem.
7. Precise remaining uncertainty
The algebraic elimination and the fixed-modulus transfer had passed independent checks. The two analytic component files had just been completed. The proposed full argument still needed a final check of:
- All conductor-uniform details of the Gaussian baseline lemma, including the positive-character multiplicities and the lattice estimate.
- The quadratic Fourier/unit/nonvanishing chain, imprimitive Euler factors, and its uniformity in the partial Euler cutoff.
- The maximal probabilistic estimate, a single realization for every determinant and cutoff, and summation of the infinite character mixture.
- The complete assembly of constants in (10), ensuring a coefficient weight genuinely summable as in (8), with no hidden dependence on .
The attached proofs make these concrete verification tasks, rather than an unspecified wish for a stronger counting theorem. However the independent audit explicitly did not certify their conjunction. Accordingly (11) and the claimed consequence for the full are retained as a proposed completion, not announced as a solved case.
Appendices: complete working proofs and audit
The following files are reproduced verbatim below. Their labels and any claims of completion apply to their own auxiliary statements only.
Appendix A. Finite-coefficient density reduction
Source working file: positive_density_reduction.md
A finite-coefficient reduction for the density question
Fix an integer , and let be the positive -powerful integers. Put
All products here have finite support. For a positive integer vector , define
Proposition. The following assertions are equivalent:
- has natural density zero.
- Every , with fixed, has natural density zero.
- Every , with fixed, has natural density zero.
In particular, has positive upper natural density if and only if at least one fixed positive diagonal degree- form in variables has a value set of positive upper natural density.
Proof. Every has a unique decomposition with and . Indeed, write each nonzero prime exponent as , where . If , put the entire exponent into . If , then , and put the exponent into and the remaining exponent into . This construction is forced by the permitted exponents of .
The constant
is finite: the sum over primes of the nonconstant terms is bounded by . Consequently,
where terms with contribute zero. If
then the number of whose unique kernel exceeds is at most , and .
The sums with fewer than positive summands form a set of size at most
For exactly summands, the number of ordered representations having at least one kernel exceeding is at most
All other represented integers belong to the finite union
If (3) holds, this finite union has density zero. Dividing the preceding estimates by , letting , and then letting proves (1).
For (1)(2), fix and set . Every is -powerful: any prime dividing it already divides and therefore occurs in to exponent at least . Hence every is -powerful, so . Thus
The implication (2)(3) is immediate. Since a subset of fails to have density zero exactly when its upper density is positive, the final equivalence follows.
This proposition does not prove either outcome of the density question. It prevents a positive-density construction from depending essentially on kernels tending to infinity: such kernels have arbitrarily small total first-moment mass. It also shows that the density question is not reduced merely to the equal-coefficient form. A positive-density theorem for any fixed positive coefficient vector would suffice to disprove the density-zero assertion for .
The elementary obstruction to a Perazzo substitution
For three-cube collisions, put and . Then
The collision equation is therefore
not the Perazzo equation . Moreover, the projective hypersurface is smooth in characteristic zero, since all six partial derivatives vanish only at the zero vector. The Perazzo hypersurface is singular along the plane . An invertible linear substitution cannot identify these hypersurfaces, since it preserves smoothness. This does not exclude nonlinear reductions, but no such reduction is established here.
No theorem from a supplied paper is invoked in these arguments.
Appendix B. Square-product local elimination and full stratum
Source working file: r4_local_elimination.md
A local elimination lemma for square-product quartic kernels
Let
Every 4-powerful positive integer has a unique expression , with and . Indeed, a nonzero prime exponent is uniquely , , , or , according to its residue modulo 4. In particular, every nonzero valuation of a kernel is at least 5.
Lemma
Let be a finite set of odd primes. Put
and choose by
Let , suppose every odd prime having odd valuation in at least one belongs to , and suppose . Then the congruence
has no integer solution. The same conclusion holds for any positive integral coefficients whose nonzero prime valuations are at least 4.
Proof
Assume a solution, write , and put . For every , we have . There is an index with : otherwise each summand would be divisible by , contrary to . At the vector , the equation therefore has a nonzero partial derivative . Hensel's lemma, varying only , gives a nonzero isotropic vector for over .
At 2, , so again some is odd; otherwise all summands would be divisible by 16. Fix all coordinates other than and let
Then and . The usual strong form of Hensel's lemma, whose hypothesis is , produces a root congruent to the odd number . Thus is isotropic over . Equivalently, one can solve
the right side is a 2-adic unit congruent to 1 modulo 8, hence is a square in .
If is odd, all coefficient valuations are even. Rescale each quadratic coordinate by the corresponding half-valuation; the form is then equivalent over to a form with unit coefficients. Every nondegenerate quadratic form in at least three variables over has a nontrivial zero, which then lifts by Hensel's lemma. For completeness, for any nonzero , the sets and both have size , hence intersect; the resulting vector is a nontrivial zero of . Therefore is isotropic over every finite completion of .
The square-product assumption now contradicts reciprocity. Set
Since is a square, the ratio is a square. Hence, after scaling the form and rescaling its fourth coordinate, is isometric up to similarity to
This is the reduced norm of the quaternion algebra . A quaternion reduced norm is isotropic precisely when its algebra is split: in a division algebra every nonzero element has nonzero reduced norm, while in the matrix algebra the reduced norm is the determinant. The preceding local argument therefore shows that splits at every finite place. But , so is ramified at the real place. This gives exactly one ramified place, contradicting Hilbert reciprocity.
The reciprocity input is Proposition 14.2.1 and Corollary 14.2.3 of the supplied Voight chapter. Its full supplied Markdown has been read. No Hasse--Minkowski theorem, integral local-global assertion, or density result is being inferred from it.
Scope
For every finite set of allowed odd squarefree-kernel primes, one progression excludes all square-product coefficient tuples whose odd-valuation primes lie in that set. The square parts of the kernels can have arbitrary prime support. In particular, excludes all tuples for which every is a square, with no truncation. In particular it excludes Ghidelli's exceptional quartic tuples in that finite family, because tuples proportional over fourth powers to have square product.
This does not yet exclude every square-product tuple: a kernel with an odd-valuation prime outside the prescribed set can evade the argument. Nor does it control the nonsquare-product tuples. A separate uniform summable majorant is needed to pass from the finite-supported elimination to the full powerful-number sumset.
A weighted square-product tail estimate
Fix , and for a tuple write
The total weight of square-product tuples having an odd-valuation prime greater than is . Here and below the implied constant is independent of .
To see this, put
The local Euler factor for square-product tuples is
Its product over all primes converges, because . If a prime has odd valuation in some coefficient of a square-product tuple, it has odd valuation in two or four of the coefficients. Its corresponding local weight is . A union bound inside the nonnegative Euler product therefore gives the asserted estimate, since .
This sharper estimate separates the genuinely relevant odd-valuation primes from primes occurring only in square kernel factors; the latter require no congruence condition in the elimination lemma.
Consequence for the full square-product stratum
Let consist of the sums , with , , and a square. Then has positive lower natural density. This statement is about a stratum, not about .
Here are the details of the necessary uniform congruence estimate. If is odd, , and
then
Indeed, for , the complete sum is the sum of at most three Gauss sums of modulus , each multiplied by a multiplicative character of . Expand the product of four such sums and sum over . There are at most terms, each of modulus at most after additive orthogonality. This proves the bound. The standard Gauss-sum absolute value follows directly by expanding its squared modulus and using multiplicative-character orthogonality.
If some coefficient vanishes modulo , fixing all variables except one with nonzero coefficient gives ; if all vanish, the congruence modulo with target has no solution. For a solution modulo with this target, at least one is a unit: otherwise all summands are divisible by . Thus the quartic equation is nonsingular modulo , and each such root modulo has exactly lifts to the specified target modulo . Consequently its normalized density satisfies
The factor modulo 16 is at most 16. CRT therefore gives, for ,
No prime-number theorem is needed to bound the last product. For , put ; then
Here the last inequality follows from the integral bound . Hence
For a fixed tuple and a fixed modulus, elementary lattice-point counting in the dilates of gives
where , and is the left side of (1). This estimate can also be obtained by covering the boundary of a fixed convex body by unit cubes in each fixed residue lattice; it needs no uniformity in the tuple.
The elimination lemma removes all square-product tuples without an odd-valuation prime exceeding . Combining (1), (2), and the weighted tail estimate with , the total main term for all remaining square-product tuples is at most
To justify summing despite nonuniform errors, first restrict all kernels to a finite set , sum the displayed lattice-point formula, and then let grow. The omitted tuples have at most
representations, since the full weight series converges. As is fixed during this step, this tail can be made arbitrarily small relative to . Thus (3) bounds the upper relative density of in the chosen progression. Taking large makes that bound smaller than , proving the positive-lower-density complement statement.
The unhandled set consists of tuples with nonsquare product. Its weight is not a tail, and neither the local elimination lemma nor (3) bounds its contribution. In particular, this consequence cannot be promoted to a theorem about without an additional argument.
Appendix C. Principal quartic character elimination
Source working file: r4_principal_character_elimination.md
Elimination of every principal algebraic quartic character
Let be positive integers such that every nonzero prime valuation of every is at least . Let contain all odd prime divisors of . Suppose that
Then none of the nineteen algebraic characters occurring in Ghidelli's formula for , viewed as characters over , is principal.
The formula, in Proposition 4.3 of the supplied Ghidelli Markdown, has one term with argument , six terms with arguments , and twelve terms with arguments . Here the latter two lists run through distinct assignments of their indicated exponent patterns. Every term has coefficient .
The first seven characters
A positive rational number is a fourth power in if and
only if it is a fourth power in . Thus principality of the
first character forces to be a square. Principality of a
character of type also forces the product to be a square,
because all its exponents are odd. Both possibilities are ruled out by
the square-product local elimination lemma proved in
r4_local_elimination.md.
The remaining twelve characters
It remains to rule out
Indeed, a negative rational is a fourth power in precisely when it is times a rational fourth power: if is real, with , then .
Equation (2) implies that is a square. Therefore write
where is a positive squarefree integer and are positive integers. Taking the positive square root of (2) gives
Define the positive definite quadratic form
Its determinant is , a rational square. The identity
shows that at the integral vector
We prove that is isotropic over every finite completion, contradicting
the positive definite square-determinant quaternion reciprocity argument
in r4_local_elimination.md.
For an odd prime , (1) and the lower bound on the nonzero valuations of the original coefficients imply that some original summand is a -adic unit. If one of the terms with is a unit, then the corresponding coefficient times coordinate of at (4) is a unit. Otherwise at least one of , is a unit, so is a unit. If just one of is a unit, then is a unit. If both are units, then either is a unit or else is a unit. In every case some partial derivative of at is a unit. Since , Hensel's lemma supplies a nonzero isotropic vector over .
At , every even original summand is divisible by , so (1) again implies that at least one original summand is odd. If an - or -summand is odd, a corresponding coefficient times coordinate of is odd. If neither is odd, at least one of the - or -summands is odd, and is odd. If exactly one is odd, is odd. The only remaining case would have all odd and neither - nor -summand odd. But the two latter summands vanish modulo , whereas
contradicting (1). Thus some coefficient times coordinate of at is odd. Varying just that coordinate gives a polynomial whose value has valuation and whose derivative has valuation . The strong form of Hensel's lemma applies since , yielding a nonzero isotropic vector over .
Every odd prime outside divides none of . The reduction of is a nonsingular quadratic form in four variables over , hence has a nonzero zero; this zero lifts. Consequently is isotropic at every finite prime and anisotropic at the real place. Since its determinant is a square, it is similar to a quaternion reduced norm, whose ramification set would then consist only of the real place. Hilbert reciprocity rules this out, and proves the claim.
Scope
For the kernels , all the valuation assumptions
hold. Hence the single congruence progression from
r4_local_elimination.md, imposed at a finite set of kernel-support
primes, eliminates all coefficient tuples supported there that have
any principal algebraic character in . This includes the
nonsquare-determinant principal-character tuples as well as all
square-determinant tuples. No estimate for the remaining Euler products
or the infinite coefficient tail is asserted here.
Appendix D. Baseline Euler-product lemma
Source working file: baseline_lemma.md
Uniform upper bound for the quartic baseline Euler product
This note establishes an auxiliary lemma for the investigation of Erdős 940. It does not, by itself, assert any density conclusion. The supplied full text of Ghidelli (2019) has been read. The inputs taken from it are the exact local formulas in Proposition 4.3 and Lemma 6.4, the Hecke-character interpretation in Proposition 5.2, and the elementary Kummer identification in Section 6.2. The conductor and uniform analytic estimates below are proved here.
Let
where the coefficients are positive integers. Put . Let , and write for the quartic power-residue Hecke character of , for rational . Multiplying by a rational fourth power does not change this character.
There are nine finite-order Gaussian characters naturally associated to . Three of them are obtained by taking one representative from each complementary pair of two-element subsets of :
The other six are indexed by a two-element set , with complementary indices ; choose either ordering of , and take
Changing a choice replaces the character by its inverse and therefore does not change whether it is principal. Let be the number of principal characters in this list, counted with multiplicity. Let be the positive squarefree part of , and set
Lemma. There is an absolute constant such that, for every such form and every ,
Consequently, for every ,
In particular, if and none of the nine finite Gaussian characters is principal, the product is , uniformly in .
1. A uniform defining modulus
Every finite character appearing here has order dividing four and, by Ghidelli Proposition 5.2(i), has a defining ideal supported at prime ideals over . It has a defining ideal dividing . Here is the uniform justification, which is not supplied by the unspecified exponent in that proposition.
Since has class number one, a finite Hecke character with a defining ideal is represented by a character of , trivial on the images of units. By the Chinese remainder theorem, this character is a product of local characters. At an odd prime ideal , the kernel of reduction from units modulo to units modulo is a group of odd prime-power order. An order-dividing-four character is trivial on it. Its conductor exponent at is therefore at most one.
At , every unit congruent to is a fourth power in . Indeed, apply the usual Newton/Hensel argument to at : . The same assertion modulo every follows by reduction. An order-dividing-four local character is thus trivial on this subgroup, so its conductor exponent is at most nine. The integer modulus contains all these local factors.
The normalized Jacobi symbol of Ghidelli Proposition 5.2(ii) has defining ideal and infinity type . Hence
has defining ideal and infinity type . It is never principal.
2. An elementary uniform upper bound for Gaussian Hecke L-functions
Let be an integer, and let be a unitary Gaussian Hecke character with defining ideal and infinity type , where or . Extend it by zero on ideals not coprime to . Assume that is not principal. There is a periodic function modulo , zero on nonunits and a multiplicative character on units, such that
For completeness, periodicity follows from the defining-ideal condition: if and both are coprime to , multiply them by an inverse of their common residue modulo , and apply that condition to the resulting two elements congruent to one.
The mean of on a full residue square is zero. For , this is because is nonprincipal; if it were principal, class number one would make principal. For , the unit gives , so is again nonprincipal.
Partition the Gaussian lattice into squares of side . On a complete square at distance from the origin, subtract the value of at a fixed point in the square and use the zero mean of . Its derivative is , so that square contributes . Summing the complete squares in the disk of radius , and bounding the boundary squares trivially, gives
There are four generators of each nonzero ideal. Consequently, for ,
with an absolute constant. Also by the elementary Gaussian lattice count.
For , split the Hecke Dirichlet series at . Its initial part is at most in modulus. Partial summation with (3) shows that the remaining tail has modulus , uniformly in . Therefore
For a principal character with the same defining ideal, the elementary bound is instead .
The corresponding rational statement is simpler: a nonprincipal Dirichlet character modulo has periodic partial sums bounded by ; splitting at gives , uniformly for . The principal character is bounded by .
3. Uniform smoothing of prime sums
For , put . For every character above,
with an absolute constant independent of its modulus. Indeed, prime-power terms of order at least two in have an absolutely bounded total. The difference between the prime terms up to with weights and is bounded by . The remaining prime tail is also bounded, by partial summation and the Chebyshev upper bound for rational primes. Gaussian prime ideals of degree one occur at most twice over a rational prime; degree-two prime ideals have norm the square of a rational prime. Thus the rational Chebyshev estimate suffices, with an absolute constant. The rational counterpart of (5) is identical.
Combining (4) and (5), a nonprincipal character contributes at most to its prime sum. A principal character contributes at most .
4. The local expansion and its sum
For odd , put . At , Ghidelli Lemma 6.4 gives
where is the real quadratic character associated with the positive squarefree integer . At , Proposition 4.3 gives the same quadratic term and, in addition, the eighteen finite quartic terms listed above together with , all multiplied by . The eighteen finite terms form nine conjugate pairs: complementary subsets give inverse characters in the first family, and exchanging does so in the second because the product of the two arguments is .
For rational , $\vartheta_a(\overline{\mathfrak p}) =\overline{\vartheta_a(\mathfrak p)}$; the same conjugation relation holds for . Consequently the sum over split rational primes of each conjugate pair is the sum over the corresponding degree-one Gaussian prime ideals. Completing that sum by the degree-two prime ideals changes it by , because their norms are .
Use and absorb all terms. We obtain
Here all Gaussian characters are extended by zero at prime ideals dividing , and is the character induced from modulo , also extended by zero at primes dividing . It is principal exactly when . The modulus is divisible by the fundamental discriminant of .
There are eleven characters on the right of (6): one rational quadratic, nine finite Gaussian, and one infinite-order Gaussian. Exactly are principal. Applying Section 3 to each gives (1), and hence (2).
5. Bad primes when coefficients are canonical
Suppose now that each is a canonical quartic-powerful coefficient: . For any odd prime , let
If , smooth lifting gives . For , either there is no solution or at least one coordinate with coefficient prime to is a unit. Otherwise every summand is divisible by , contrary to the target valuation one. Such residue vectors are smooth modulo , and each has exactly lifts to the target class modulo . There are at most such residue vectors: choose a coefficient prime to , fix the other three coordinates, and solve a polynomial of degree four for that coordinate. Therefore
It follows from (2) that
In the absence of principal finite characters, this is uniform in without any logarithm of .
Appendix E. Universal quadratic selector lemma
Source working file: quadratic_selector_lemma.md
A universal, uniformly controlled quadratic prime selector
This is a self-contained lemma for the quartic-powerful investigation. It does not by itself prove a statement about powerful sums.
For a positive squarefree integer , write for the primitive quadratic Dirichlet character of ; . Values at ramified primes are zero. Let .
1. Uniform quadratic Euler sums
There is an absolute constant such that every nonprincipal real Dirichlet character modulo satisfies
Consequently, for ,
and, if are distinct squarefree integers,
All these bounds hold for sums over an interval, after doubling .
Here is an elementary proof, including the polynomial lower bound that is needed for (1).
Nonvanishing and a lower bound at 1
Let be primitive, real, and nonprincipal, of conductor . Its partial sums are bounded by , so is holomorphic on . Also . For completeness, nonvanishing follows from the positive coefficients of
Multiplicativity gives , so the abscissa of convergence is at least . If , the product would be holomorphic throughout , contradicting the elementary Landau lemma for a series with nonnegative coefficients. That lemma follows by expanding at a real point to the right of the abscissa: the nonnegative Taylor coefficients in the leftward direction allow Tonelli's theorem to extend convergence leftward past the abscissa. Positivity at 1 follows by taking the limit from , where all Euler factors are positive.
Let , and let . The usual finite Fourier identity, obtained by the change of variable , and finite Fourier orthogonality give
The identity remains true when , with both sides zero, by primitivity. Expanding and letting gives
If is odd, the real parts on the right cancel in pairs. Since , (4) gives
The sum is a nonzero integer, by nonvanishing.
If is even, put
This is a positive real algebraic unit. Indeed, is a unit: it and its inverse are finite geometric sums, using an inverse of modulo ; and . The automorphism takes to . Thus belongs to the quadratic fixed field of , and its other conjugate is . It is not 1 by (4) and nonvanishing. Hence is an integer strictly larger than 2, and
Equation (4) implies . In both parity cases,
Bounds uniformly to the right of 1
Splitting the Dirichlet series at and applying partial summation to the tail, using the bound for the partial sums, gives, for ,
For example, the tail in the derivative is bounded by , and the initial segment contributes .
Set , with the constants in (5) and (6). If , (5) and (6) give . If , Euler factors give
Since , we obtain
For , absolute Euler products give absolute upper and lower bounds. An imprimitive character modulo differs from its primitive character by Euler factors at primes dividing ; their product and its inverse are at most . Thus
for every nonprincipal real character modulo .
To pass to prime sums, put . Chebyshev's bound gives
For the first inequality use and ; for the second use partial summation and the substitution . Higher prime powers in contribute . Hence
uniformly in and . This proves (1). The same smoothing with the principal character gives . Taking half the difference between and proves (2); both characters are nonprincipal when . The same argument proves (3), since for distinct positive squarefree neither nor its twist by is principal. In particular,
2. Universal selector
Fix positive numbers , indexed by all positive squarefree , such that
For example one may take . For and , set
Thus . Choose independent Bernoulli variables with mean .
For every , there exists a realization and a constant such that simultaneously for every positive squarefree and every ,
Indeed, the increments are independent, have mean zero, and lie in intervals of lengths at most . Hoeffding's exponential supermartingale and its maximal inequality yield
The union bound, with , is less than 1 for sufficiently large : the sum over all converges and tends to zero as . Fix such a realization, and put .
For , let
Then there is an absolute , depending only on the fixed , such that for every nonsquare ,
uniformly in . To see this, use and (12) at both endpoints. The expectation is
The term is nonpositive, so discard it for an upper bound. Bound the other terms by (2), (3), and (11). This gives , proving (13).
Moreover, for each fixed , retaining and using (10) gives
Here all nonprincipal sums in (14), including their infinite weighted sum, are bounded uniformly in both endpoints by (2), (3), and (11). The finitely many omitted primes dividing affect only the constant. Thus if satisfies
then for every fixed nonsquare .
For , the same proof gives
In particular, given any , choosing and then sufficiently small gives a single set such that (13) has exponent , every nonsquare has the decay (15), and the sole positive principal growth is (16). No prime number theorem in progressions, Chebotarev theorem, Siegel theorem, or zero-free region is needed for this selector lemma.
Appendix F. Independent audit
Source working file: r4_independent_audit.md
Independent audit of the proposed quartic architecture
This records an audit, not a completed proof of an open case. The two local elimination notes were read, and the full supplied Ghidelli Markdown was read. The proposed baseline and selector estimates were communicated by the other researchers but are not available here as a complete, independently checked proof.
Checks that passed
The principal-character elimination in
r4_principal_character_elimination.md passes the following checks.
The nineteen algebraic terms are exactly those obtained by expanding
Ghidelli's Proposition 4.3: one exponent pattern (2,2,2,2), six terms
with pattern (1,1,3,3), and twelve signed terms with pattern
(2,2,1,3). Their coefficients are positive. The first seven principal
possibilities force square determinant. For the remaining possibilities,
the transformation to the positive definite square-determinant quadratic
form in that note is algebraically correct. In particular, if
d_k=c u^2, d_l=c v^2 and
d_i^2 d_j^2 d_k d_l^3=4t^4, then
d_i d_j u v=2(t/(cv))^2.
At a prescribed odd prime, valuation one of the represented integer
forces at least one original quartic summand to be a unit; the quadratic
form constructed in the note then has a nonsingular zero modulo that
prime. At 2, the only potential failure of the indicated unit derivative
would leave exactly the two paired terms odd; their sum is 2c mod 8,
contradicting valuation three. The stated strong Hensel application is
therefore valid. These verifications do not independently reprove the
quaternion reciprocity theorem cited in the local notes.
For a prescribed odd prime, it is essential to impose
n = p mod p^2, including at selected primes larger than the cutoff.
Prescribing only n=0 mod p would give a factor p when every coefficient
is divisible by p; it would not give the claimed uniform bad-prime
bound. With the squared modulus, let t be the number of coefficients
prime to p. For canonical quartic kernels all the other coefficients
vanish modulo p^2. If t>=1, the normalized local density is exactly
rho_p(d) = (N_t(0;p)-1)/p^(t-1) <= 4.Here N_t counts zeros of the active diagonal quartic over the finite
field. The subtracted zero vector cannot lift to target p mod p^2,
whereas every other zero is nonsingular and has p^(t-1) lifts. If
t=0, the local density is zero. At good primes t=4, this gives
rho_p=(N_4(0;p)-1)/p^3.
Exact final density reduction
Write w(d)=(d_1 d_2 d_3 d_4)^(-1/4), with each d_i a canonical
quartic kernel. Their total weight is finite. Suppose finite moduli
M_T and residue classes a_T have been constructed, and put
rho_T(d) = # {x mod M_T : sum d_i x_i^4 = a_T mod M_T}/M_T^3.The sufficient analytic conclusion is
sum_d w(d) rho_T(d) -> 0. (A)For each fixed modulus M=M_T, counting each variable in its residue
class gives, for a fixed coefficient tuple, the upper asymptotic
contribution w(d) rho_T(d) X/M from tuples whose sum is at most X.
One may interchange this limit and the coefficient sum: before taking
the limit, the normalized contribution of any coefficient tuple is at
most M w(d), because the unrestricted box contains at most
w(d) X positive tuples. This is a summable majorant for fixed M.
Thus the relative upper density of the exactly-four-summand set in the
progression is at most the sum in (A).
Sums with at most three 4-powerful summands contribute O(X^(3/4))
integers globally, hence zero relative density in every fixed progression.
If (A) holds, select one finite T for which its left side is below
1/2. Then the complement of S_4 has lower natural density at least
1/(2M_T). The modulus must be fixed before X tends to infinity.
This argument would prove positive density of the complement, not
density zero of S_4.
Selector interval and remaining analytic obligations
The growing lower cutoff Z=(log T)^A is compatible with the intended
quadratic-character selector. Indeed,
log log T - log log Z
= log log T - log log log T - log A -> infinity.For any fixed nontrivial positive squarefree discriminant, convergence
of its prime harmonic character sums makes the unweighted interval
contribution tend to zero. With selector mean
delta(1-sum_E lambda_E chi_E(p)) on primes p=3 mod 4, the term
E=D consequently supplies the proposed negative divergent drift.
To interchange the infinite E sum with this limit one still needs a
uniform bound of size O(log(DE)), together with
sum lambda_E log E < infinity.
The random discrepancy can in principle be bounded simultaneously for
all D: its increments are bounded by 1/p, whose squares are
summable. A maximal exponential inequality and Borel--Cantelli with
threshold epsilon log D give a finite random constant after accounting
for finitely many exceptional D. The interval discrepancy is bounded
by twice the corresponding initial-segment bound and tends to zero for
each fixed D.
The delicate deterministic point is two-sided control of quadratic
prime harmonic sums. Negative coefficients in the selector require
lower bounds for L(sigma,chi), not just upper bounds. The proposed
repair uses the finite Fourier formula at 1: for odd primitive real
characters, a nonzero integer numerator gives a polynomial lower bound;
for even characters, the cyclotomic product is a nontrivial totally
positive quadratic unit of norm 1 and gives another polynomial bound.
A derivative bound |L'(sigma,chi)| << (log q)^2 near 1, combined with
L(sigma,chi) >= zeta(2sigma)/zeta(sigma), would extend this to a
uniform polynomial lower bound for every sigma>1. This outline looks
consistent, but its Fourier normalization, unit assertion, conductor
bookkeeping, and uniform constants were not written and fully audited
in this investigation.
Likewise, the baseline Gaussian Hecke-character bound communicated by
the large_r researcher requires a complete proof of its common
conductor bound, periodic lattice cancellation for infinity type 2,
and conversion from L-function bounds to truncated prime products.
If these baseline and selector majorants are proved with a sufficiently
small power of the coefficient radical, their product is summable
against w(d). Principal-character tuples not yet locally eliminated
have radical exceeding Z, so their crude logarithmic factor can be
absorbed into a small radical power by taking A large. These facts
explain how dominated convergence could establish (A), but do not by
themselves establish those missing analytic estimates.
Appendix G. Additional Hecke-bound route, not needed in the simplified selector
Source working file: r4_uniform_hecke_bounds.md
Elementary bounds for the Hecke characters needed by a small prime tilt
This note supplies a possible analytic ingredient; it does not itself prove an assertion about the powerful-number sumset.
1. A uniform character-sum bound
Let , let be a nonzero Gaussian ideal of norm , and let be an integer with , where is fixed. Suppose a unitary Hecke character , extended by zero on ideals not coprime to , has the expression
where is a character modulo , extended by zero on nonunits. The compatibility condition at Gaussian units is understood. If is nonprincipal, then
Here is a direct lattice proof. Every ideal has four generators, so the sum is one quarter of the sum of (1) over nonzero Gaussian integers in the disk of radius . Tile the plane by translates of a fundamental square for , whose diameter is . The tiles meeting the disk boundary contribute . The tiles within distance of the origin contribute . On a remaining tile at distance , the angular factor changes by ; summing this error over its Gaussian points and then over all tiles gives . The tile main term is the complete residue sum , times its angular factor. If , nonprincipality gives . If , the integral of the angular factor over the disk is zero; comparison of its tile Riemann sum with that integral has the same error. This proves (2).
Partial summation, splitting at , now gives, uniformly for real ,
Indeed the unsigned sum over ideals of norm at most , weighted by , is , and the logarithmically weighted version is . For the tails use for . The same calculation proves convergence and continuity at .
2. Nonreal characters and nonzero infinity types
If is nonprincipal, the elementary trigonometric inequality
and Euler products imply
Omitted Euler factors cause no difficulty because the full zeta function is at least the zeta function with those factors omitted. Put . Equations (3)--(4), applied also to , give
Choose , with a sufficiently small fixed . The derivative estimate in (3) gives
which is less than one quarter of the lower bound in (5). The same estimate works for every ; for larger use (5) directly. Thus, loosening the exponent,
whenever is nonprincipal. The case also follows immediately from the absolutely convergent Euler product.
3. Crude quadratic Dirichlet lower bounds without a class-number formula
Let be a primitive nonprincipal real Dirichlet character of conductor . Then
Here is a proof of the facts needed for (7).
First . The coefficients of are nonnegative: at a prime the local coefficients are respectively , for even and for odd , or , according as . The coefficients at squares are at least , so the abscissa of convergence is at least . If , the product is holomorphic in : for the character factor this follows by partial summation from bounded periodic partial sums, and for zeta it follows from its usual alternating-series continuation. This contradicts Landau's elementary lemma that a Dirichlet series with nonnegative coefficients has a singularity at its finite abscissa of convergence. To see the lemma, expand the function in a Taylor series about a real point to the right of its abscissa. After replacing the argument by a smaller real number, all terms of the differentiated Dirichlet series are nonnegative; monotone interchange of sums would extend convergence to the left of the abscissa if the boundary point were regular. Moreover , by the positive Euler product for real and continuity.
Let and let be the Gauss sum, of absolute value . Fourier expansion, first for with and then by passage to the limit, gives
For odd , conjugate pairs cancel the real parts and (8) becomes
The sum is a nonzero integer, by nonvanishing. This proves (7).
For even , define
Its conjugate under is . Therefore belongs to the real quadratic fixed field of , and has norm . It is a unit: if is not a prime power then is a unit, since . If is a prime power, all with are associates, and the total exponent is zero. These statements also follow directly from the cyclotomic polynomial and the geometric-sum quotient . Nonvanishing in (8) implies . Hence has positive conjugate , and its integral trace is at least . Consequently
which in fact gives the stronger bound .
4. The real Hecke characters occurring here
In the quartic-character expansions under consideration, every finite character is a quartic residue symbol of a rational number. When such a character is real, it is a quadratic residue symbol over , with rational , which can be taken squarefree integral. For example, if the rational quartic argument is , the character equals , since and have the same class modulo fourth powers in .
For its primitive version the Euler factors give
where the two Dirichlet characters correspond to and . Neither is principal when the Hecke character is nonprincipal. Their conductors and are bounded by fixed powers of . Removing any additional Euler factors costs at most a further factor , because . Thus (7) gives , for an absolute .
For , (4) still gives when is principal. Combine this with the derivative estimate (3), taking smaller or larger than a suitable , to obtain
5. Uniform partial Euler-product bounds
For , put . The elementary Chebyshev prime-counting bound gives, uniformly in a unitary character,
Indeed the prime-power terms of order at least two are absolutely bounded; the change from to below has total size , and the omitted tail above has total size . The inert Gaussian prime ideals have square norms, so removing them only changes the sums by .
It follows from (3), (6), and (10) that the partial prime sum of a nonprincipal character is at most and at least , uniformly in . The lower bound can be improved to unless the character is real. These are enough for a tilted Euler product with an arbitrarily small negative coefficient to have a majorant , after the tilt is chosen sufficiently small.
Checks still needed before use in a full proof
The above estimates assume that the exact finite characters in the application admit (1) with bounded by a fixed power of the radical of the coefficients (times a fixed factor from the finite core). This follows from explicit quartic reciprocity or local conductor bounds, but must be established in the final application rather than inferred from Ghidelli's fixed-character error terms. Also, a finite-core prime tilt, an infinite coefficient-tail majorant, and the reduction from representation counts to missing integers still need to be assembled.
Second reading of the baseline and selector lemmas
A reading in full of the baseline Euler-product lemma (Appendix D) and the universal quadratic selector lemma (Appendix E), by the author of the principal-character elimination (Appendix C) and not of either lemma, found no remaining gap in those two lemmas. The points checked were the modulus- argument, the Gaussian lattice estimate, the quadratic Fourier and unit lower bound, and the maximal-probability union bound. This is additional favorable audit evidence for the two lemmas. The assembled theorem of Sections 4 and 5 did not receive a final line-by-line verification; the status stated at the beginning of this record is unchanged.