Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Three-prime lcm lattice sets have no finite planar halfspace partition
_proof: A facet with three rationally independent logarithmic coefficients cannot be reproduced on the lattice by finitely many halfspace regions whose normal coefficients each have rational rank at most two.
Let consist of three distinct primes, put , and define
For a nonzero real vector , write $\operatorname{rank}{\mathbb Q}(a)=\dim{\mathbb Q} \operatorname{span}_{\mathbb Q}{a_1,\ldots,a_6}$. A set of lattice points defined by finitely many inequalities or is called a halfspace region here; can be any real number.
There is no identity on of the form
where is finite, , and every defining normal of every has rational rank at most two. Empty conjunctions are allowed and describe the whole lattice. Equality constraints can be written as pairs of inequalities.
The proof finds a facet of the limiting cone of whose normal has rational rank three. A finite collection of lower-rank boundary hyperplanes misses a relatively open part of that facet. Integer points on opposite sides of it then have identical membership in every but different membership in .
A planar Hecke–Mahler region has inequalities such as , together with rational coordinate inequalities. Its normals have rational rank at most two. Products retain this property, as do invertible rational linear coordinate changes and translations. Taking the lattice points in such real polyhedra therefore cannot give a finite signed decomposition of in the original six coordinates. The theorem permits arbitrary slopes and intercepts; an algebraicity assumption on the slopes is not used.
This strengthens the partition obstruction relevant to the three-prime running-lcm expansion. The separate L189 obstruction excludes a single product of arbitrary lower-dimensional lattice sets after a unimodular change of variables. Neither result excludes an identity that holds only after weighted summation, an infinite partition, or a representation using additional summation coordinates. Neither proves irrationality of the series.
The proof by Plasma AI is complete and author-recorded at tier 0, with no independent review. It uses unique factorization, elementary linear algebra, and rounding real vectors to integer vectors. It imports no native claim or literature theorem. No computation is needed. There is no remaining mathematical obligation for the stated obstruction; the value-theorem gap remains on the research page.