bibkey: weingartner2010distribution authors: Andreas Weingartner year: 2010 title: The distribution functions of σ(n)/n and n/φ(n), II doi: null url: https://arxiv.org/abs/1011.4262v1 claim: “Equation (5) identifies the moment Euler product W(s); Lemma 5 gives its large-positive-moment expansion with b₂=π²/6. A nonnegative divisor expansion yields a finite bound Σ_{n≤X}(n/φ(n))^s≤XW(s), and hence a deterministic subpolynomial count of possible Robin failures in bounded-ratio intervals.” strata_touched: [] license: citation-only triage: anchor
Weingartner 2010: abundancy distribution and finite positive moments
Andreas Weingartner, The distribution functions of σ(n)/n and n/φ(n), II, author preprint, arXiv:1011.4262v1 (2010). This card pins the author version; it does not assert a journal DOI or a later publication year.
Original statements used
Equation (5) defines
The paper states this identity for complex . The present application uses only positive real and the Euler product.
Lemma 5 assumes and defines by . For each fixed integer , it gives the asymptotic expansion, as ,
Lemma 6 treats , , and ; its first correction is likewise . Lemma 5 with an explicit moment already suffices for the finite application below, so no minimizer is required there.
Finite bridge and precise application
For each real , define the nonnegative multiplicative function by , for , and . Then
The latter series converges since . Consequently, for every finite real and every real ,
This pointwise-in- argument permits a growing moment without interchanging the paper’s fixed-moment average limit. Since , it gives
For , , set , , and . Lemma 5 with yields
For bounded , this is . The inequality includes the threshold equality. It bounds actual potential Robin violations, not every integer surviving an unrelated necessary-condition sieve. It does not establish that the set is empty.
Actual valuation moments and the comparison of tails
The proof of Lemma 5 also separates the lower and upper integrals. Equations (13) and (14) give and the lower integral’s own coefficient
Together with the local replacement in equation (8) and the strong Mertens/PNT estimate in equation (9), this identifies the leading correction for the product restricted to , with . The other half comes from the upper integral in equation (19). Sections 211 and 213 use the explicitly located lower contribution in a finite divisor construction; they do not infer an equal split merely from the full coefficient .
For the abundancy tail and the totient tail defined in the original paper, Theorem 3 states, for sufficiently large and ,
Both the multiplicative factor and the threshold shift are part of the statement. They do not by themselves give a finite progression bound. Theorem 1 gives the two tails the same expansion to every fixed order; neither theorem says that their finite samples agree.
Section 210 of the FIB theory volume instead keeps actual valuations via the nonnegative multiplicative coefficients and the Euler product . Its elementary comparison with is a repository paper derivation, not a quoted statement of this source. The negative coefficient above is used there to distinguish an exact leading-order saving from a bound with an uncontrolled remainder. This coefficient is the asymptotic expansion coefficient, not the separately defined arithmetic function .
Scope
The paper’s limiting distribution tails are not uniform finite estimates for growing moduli or moving thresholds. The finite bound above comes from the separate nonnegative expansion. It applies to all integers in the interval and does not itself exploit Fibonacci progressions.
This is literature use and a paper derivation; no Lean statement or kernel verification is supplied by this card. No originality claim or complete literature-search claim is made.
Locators
- Pinned abstract: https://arxiv.org/abs/1011.4262v1
- Pinned original PDF: https://arxiv.org/pdf/1011.4262v1
- Pinned HTML: https://arxiv.org/html/1011.4262v1
- Exact locations: equation (5), Lemma 5, Lemma 6, Theorems 1 and 3; the separate lower-integral contribution uses equations (8), (9), (13), (14), contrasted with (19).