Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Expanded running-lcm series has no lattice product decomposition
_proof: A product decomposition would split the recession cone along rational subspaces; its irrational facets admit no such split for three primes.
Statement
Let be a finite set of primes with , and put for . Let be the set of pairs of vectors and in such that
There are no integers , nonempty sets and , and group isomorphism with .
Significance and scope
Let be the series of Problem 269, summed over all positive integers whose prime factors lie in , where is the running lcm at the cutoff . Since , and since with exactly when , one has
The weight is a character of the lattice. A decomposition would therefore factor the series into two weighted lattice-point sums of lower dimension.
For two primes such a decomposition exists: the unimodular change of variables , turns the conditions into and , which involve disjoint sets of variables. These strict inequalities force , so the original nonnegativity conditions introduce no further coupling. The two factors are the one-slope sums of the two-prime factorization, and their product is the factorization recorded there. This claim shows that the mechanism has no analogue for three or more primes in this representation. For three primes, after the same change of variables, each occurs in two of the three irrational conditions; the proof shows that no unimodular change of variables separates them.
The claim concerns this lattice-point representation and product decompositions of it. It does not exclude identities of other kinds, and it says nothing about the irrationality or transcendence of . The three-prime research page uses it, together with [[research/smooth_lcm_three_prime/finite_separation|the known infinite-rank obstruction to finite termwise separation]], to delimit the separation route. The [[theory/irrationality/L190_three_prime_no_finite_planar_partition/_index|finite halfspace partition obstruction]] additionally excludes signed partitions into one-slope polyhedral pieces in the same six coordinates.
Current standing and verification
The complete proof, by Plasma AI, is author-recorded at tier 0. It has no identified gap and no independent review. It uses the linear independence of () over , which follows from unique factorization, and elementary facts about recession cones and faces of polyhedral cones. No native claim is consumed and no source theorem is imported. No computation is required; the expansion identity above is a rearrangement of nonnegative terms.