WorksMathematics
Asymptotically full minimal signed unit-fraction identities
Abstract
Let be the largest size of a subset of admitting a signed zero sum of its reciprocals with no proper nonempty signed zero subsum. We prove using the subset-sum theorem of Liu and Sawhney. The construction joins finitely many large-prime groups by one CRT-chosen unit fraction. The resulting positive sum can be arbitrarily large, although the density cost of excluding those primes is arbitrarily small. A dense coprime-denominator expansion of that sum provides the opposite side and preserves minimality. Earlier public work claims this asymptotic and the protected-prime construction. This version gives an alternative approach through Liu and Sawhney, with an accompanying Lean formalization.
Statement
For a finite set , write . Call primitive if there are signs satisfying
Let be the maximum of over these sets.
Theorem 1. For every and every sufficiently large , there is a primitive with . Consequently
The lower bound follows from a dense expansion of and the singleton [3].
Earlier public candidate proofs of the density-one asymptotic are recorded in [4, 5]; their existence precludes treating the present result as an uncontested new solution. Our positive side is a fixed, possibly enormous, finite set once is chosen. Only the opposite side grows with . The result is asymptotic and supplies no practical threshold for .
A finite positive set with only one coprime subsum
For a squarefree integer , call a rational number -integral if its reduced denominator is coprime to . This includes and all integers. The -integral rationals form an additive subgroup of .
Lemma 2. Let , , and , where . Let be a finite set of at least two primes, each greater than , and put . There exists a positive integer coprime to such that the set
has the following properties:
All its denominators are distinct, and all have a prime factor in .
is -integral and
The only subsets for which is -integral are and .
Proof. Since , both and are invertible modulo every . Choose by the Chinese remainder theorem so that
The prescribed residue is nonzero modulo , so . Take its positive representative, or add a multiple of .
The groups are disjoint: a denominator in the -group has no other prime factor in . The connector has all these prime factors, so is distinct from every group denominator.
For a subset , let
and let indicate whether . Every is an integer in , with exactly for an empty , and exactly for a full . Multiplying by the common denominator gives the integer
Each occurs to exponent exactly one in . Thus is -integral if and only if every such divides .
If , reduction modulo gives . As , this forces for every , hence empty. If , subtracting (1) from the condition gives . The same bound forces for every , hence . Finally, (1) directly makes divisible by every , so is -integral. The formula for is immediate.
Lemma 3. For every and , there are a squarefree and a finite set as in Lemma 2 such that
Proof. Choose so that , and then choose primes until
Such a finite choice exists because the sum of reciprocal primes diverges. Each summand is less than , so at least two primes are chosen. The finite product inequality gives
Lemma 2 gives .
Dense expansions avoiding a fixed set of primes
The only deep input is Proposition 5.2 of Liu–Sawhney [1]. For transparency, its hypotheses are recorded in the appendix. The following application also explains why fixed prime factors in the target denominator cause no problem.
Lemma 4. Fix a squarefree and a positive -integral rational . Put . For every , set . For all sufficiently large , there is a set
with and
In particular,
where the maximum allows all coprime denominators at most .
Proof. Let . Since are fixed, elementary counting in residue classes gives
Set
The endpoint can be rounded to an integer. Remove from all numbers that are not -smooth and all numbers with . Lemmas 2.2–2.3 of [1] show that this removes elements. Because these numbers are at least , their reciprocal mass is .
Next, while a prime power occurring in the current set satisfies , remove all its multiples. Each prime power is used at most once, so the total reciprocal mass removed is at most
Call the final set , and put . We have
for every prime power occurring in .
Write in lowest terms. For each prime power , . Again by residue-class counting,
Here is fixed. Since the entire cleanup removes only reciprocal mass, some multiple of remains in . Therefore . In particular,
is an integer, positive for large , and .
Apply Proposition 5.2 with , , and the displayed . All its size conditions hold for large . For the last condition, the second term in gives
and hence
The bounds on hold because its factor dominates the and polylogarithmic factors in those bounds; eventually. The target condition follows from (5) and :
The proposition supplies with reciprocal sum . Take , so that . This applies the proposition to a small complementary target; its sampling proportion is less than $1/2N. Finally every term in is at most , so
Together with (4) this proves (3). Taking the lower limit in and then letting gives the final assertion. No uniformity as vary is required.
Primitivity and completion of the asymptotic
Proof of Theorem 1. Fix and use Lemma 3 with . This gives fixed and , . By Lemma 4, choose with and all denominators coprime to . For large , every element of the fixed set is at most . Also , since every element of has a prime factor dividing .
Give positive signs and negative signs. The total is zero. Suppose is a signed zero subset, and put , . Then
The right side is -integral. Lemma 2 therefore forces or . In the first case positivity forces . In the second, and positivity forces . Thus the signed identity is primitive.
Its cardinality and Lemma 4 give
The middle inequality uses and . Let , and combine this with . This proves the asserted limit and the quantified first statement.
For a small concrete example, and give , , and the primitive identity
The four denominators on the right are coprime to 385. This illustrates minimality, not the asymptotic density estimate.
Verification and attribution
The protected-prime construction, the amplification of its reciprocal mass at small prime-density cost, and the final primitivity argument already appear in the public manuscript of g-01234, dated 16 July 2026 [4]. A later submission by peilinliu66-dev, opened on 3 October 2026, claims a complete Lean proof using a thinned-prime inverse-sum completion route [5]. That submission was pending when checked on 16 October 2026; we have not independently reproduced it. These earlier claims must be considered in any assessment of priority or prize eligibility. The present dense-expansion lemma instead applies Liu–Sawhney’s Proposition 5.2. No novelty claim is made for the protected-prime idea. The Fourier analysis is due to Liu–Sawhney and their predecessors. The attached exact audit checks small global CRT examples exhaustively and checks a larger example locally at every selected prime. These finite checks do not replace the proof of the asymptotic or certify the imported analytic theorem.
The accompanying file Erdos319.lean proves the limit and explicit fixed-sign witnesses without additional mathematical hypotheses. Its analytic estimates include ports of existing proofs from plby/lean-proofs, commit 8822f7ddef30fadbd92e1c6ab4ed897af356af5e; those background proofs retain their separate attribution. The checked environment is Lean 4.35.0-rc2 with Mathlib commit 065356127b1dc0016f66b7283ce0ce2c4055aa55. The main theorem is
Erdos319Formal.erdos_problem_319.
The original 1980 statement was checked at printed p. 43 [2]: the same signs are used in the whole sum and in every subsum. The conclusion determines the leading asymptotic, not the lower-order deficit or the exact maximum for each finite .
The listed team prepared this AI-assisted proof presentation and formalization for review. Team credit does not assert that each member manually wrote every proof step. No independent human review, prize acceptance, or entitlement to payment is asserted.
The precise Liu–Sawhney input
Here is Proposition 5.2 of [1], restated with renamed parameters. For , let and let . There is an absolute such that, for fixed , and sufficiently large , the following holds. Suppose and
Define
Assume
Let satisfy: every prime power dividing an element of is at most ; for ; and for every prime power occurring in . For every positive integer with
there is such that .
In the dense-expansion lemma all parameters other than are fixed or explicitly specified functions of . In particular, the proof does not use the inconsistent displayed sign of in the arXiv version’s proof of Theorem 1.3; it uses the proposition’s stated condition directly.
References
- [1]Y. P. Liu and M. Sawhney, On further questions regarding unit fractions, arXiv:2404.07113v1 (2024), Proposition 5.2 and Lemmas 2.2–2.3. International Mathematics Research Notices (2026), rnaf382; published article.arxiv.org/abs/2404.07113
- [2]P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory (1980), p. 43; original scan.
- [3]T. F. Bloom, Erdős Problem 319.
- [4]g-01234, A Candidate Proof That c(N)/N → 1 in Erdős Problem 319, circulation draft, 16 July 2026; pinned manuscript.
- [5]peilinliu66-dev, JSP-000265: complete Erdős 319 fixed-sign density-one Lean proof, submission opened 3 October 2026; awards PR 4669; selected proof revision.