Source. Lemma 4, printed p. 145
(PDF p. 3).
Use hr from
the factor decomposition.
Statement. For every integer k≥3, real x≥1 and real Y≥1,
#{n≤x:hk(k+1)(n)≥Y}≤Y1−2/k3x.
In particular, taking Y=L(c,x) with c>0 and x large gives Chen’s
bound 3x/L(c(1−2/k),x).
Complete proof
Put r=k(k+1) and
H={m≥1:m=hr(m)},S(t)=#(H∩[1,t]).
Every prime exponent α in m∈H exceeds k(k+1).
Choose the unique v∈{1,…,k} with v≡α(modk).
Then
u=kα−v(k+1)
is a positive integer: its numerator is divisible by k and positive
because α>k(k+1)≥v(k+1). Hence α=uk+v(k+1).
Applying this rule to each prime represents m=akbk+1.
The empty product m=1 corresponds to a=b=1.
This deterministic choice maps distinct m to distinct pairs (a,b).
For m≤t we have a≤t1/k and b≤t1/(k+1), so
S(t)≤t1/k+1/(k+1)≤t2/k(t≥1).
Every n with hr(n)=m is divisible by m. Therefore
#{n≤x:hr(n)≥Y}≤xm∈Hm≥Y∑m1.
To include an atom at m=Y without a boundary convention, use
1/m=∫m∞t−2dt and sum nonnegative integrands:
m∈Hm≥Y∑m1=∫Y∞t2#{m∈H:Y≤m≤t}dt≤∫Y∞t2/k−2dt=1−2/kY2/k−1≤3Y2/k−1.
This proves the statement. The construction and integral expand the two
compressed steps in the source; the weak counting inequality also covers
t=1, where the printed strict comparison cannot hold.