The reciprocal running-lcm term for three distinct primes has square
submatrices of every order on each coordinate face. Consequently it admits
no finite termwise separation across any split of the three exponents.
This is a special case of Will Cook's Theorem 7.3 in
Running least common multiples: distinct values and multiplicities,
Section 7, revised 5 October 2026, accessed 2026-10-15. That theorem also
makes the selected indices work uniformly at every value of the third
exponent. Its statement and argument were read in HTML and extracted PDF
text; page-image access was unavailable. No formalization or independent
acceptance is imported here.
The elementary derivation below is recorded by Plasma AI without independent
review or a novelty claim. It supports the termwise obstruction in the
three-prime sketch, not an
irrationality conclusion. The local evidence checks finite examples of the
construction. For distinct primes x,y write
λxy=logy/logx, so that logx(yk)=kλxy. Each
λxy is irrational: λxy=b/a with positive integers a,b
would give ya=xb, contradicting unique factorization. Write {t} for the
fractional part of a real number t.
The running lcm
Let m be a positive integer whose prime factors lie in {p,q,r}. For each
of the three primes w, the power w⌊logwm⌋ is at most m
and has its prime factors in {p,q,r}, so it divides D(m). Conversely,
every positive integer n≤m with prime factors in {p,q,r} has
w-adic valuation at most ⌊logwn⌋≤⌊logwm⌋.
Hence
D(m)=p⌊logpm⌋q⌊logqm⌋r⌊logrm⌋.
The face where the exponent at z vanishes
Fix distinct u,v∈{p,q,r} with third prime z, and let i,j≥0. For
m=uivj the formula gives
⌊logum⌋=i+⌊jλuv⌋,
⌊logvm⌋=j+⌊iλvu⌋ and
⌊logzm⌋=⌊iλzu+jλzv⌋. Splitting
the last floor,
⌊iλzu+jλzv⌋=⌊iλzu⌋+⌊jλzv⌋+e(i,j),e(i,j)=⌊{iλzu}+{jλzv}⌋∈{0,1}.
Therefore
Tuv(i,j)=α(i)β(j)z−e(i,j),
with the positive factors
α(i)=u−iv−⌊iλvu⌋z−⌊iλzu⌋,β(j)=v−ju−⌊jλuv⌋z−⌊jλzv⌋.
A triangular pattern of carry digits
Because λzu and λzv are irrational, the fractional parts
{iλzu} for i≥1 are pairwise distinct, nonzero and dense in
[0,1), and the same holds for {jλzv} with j≥1; this is the
density of the orbit of an irrational rotation of the circle. Fix N≥1.
Choose j1,…,jN≥1 such that yt={jtλzv} satisfy
0<y1<y2<⋯<yN<1,
and put y0=0. For s=1,…,N the interval (1−ys,1−ys−1) is a
nonempty open subinterval of (0,1), so there is is≥1 with
xs={isλzu} in it. Then e(is,jt)=1 exactly when
yt≥1−xs. Since ys−1<1−xs<ys, this happens exactly when t≥s,
and equality yt=1−xs never occurs. Hence
e(is,jt)={1,0,t≥s,t<s.
Invertibility
By the two previous sections,
(Tuv(is,jt))s,t=diag(α(is))Mdiag(β(jt)),Mst={z−1,1,t≥s,t<s.
The diagonal factors are invertible. Subtracting row s+1 of M from row s
for s=1,…,N−1 leaves the multiple (z−1−1) of the s-th unit row
vector in row s, and the last row (1,…,1,z−1). Expanding,
detM=z−1(z−1−1)N−1=0,
since z≥2. This proves the first assertion.
No finite separation
Let B1,B2 be a partition of {p,q,r} into nonempty sets, and suppose
T=f1g1+⋯+fKgK at every exponent triple, with each fk a function
of the exponents at the primes of B1 and each gk a function of the
exponents at the primes of B2. Choose u∈B1 and v∈B2, and let z
be the third prime, which lies in B1 or in B2. At an exponent triple with
exponent 0 at z, each fk becomes a function φk(i) of the
exponent i at u and each gk a function γk(j) of the exponent j
at v, so that
Tuv(i,j)=k=1∑Kφk(i)γk(j)(i,j≥0).
For any exponents i1,…,iN and j1,…,jN the matrix
(Tuv(is,jt)) is then the product of the N×K matrix
(φk(is)) and the K×N matrix (γk(jt)), so its rank
is at most K. Taking N=K+1 and the exponents of the first assertion gives
an invertible (K+1)×(K+1) matrix of rank at most K, a contradiction.
This proves the second assertion.