The conjecture on infinitely many nondifferentiable points and semi-algebraicity
The conjecture on infinitely many nondifferentiable points and semi-algebraicity
Let be continuous and non-negative, and define
A set is semi-algebraic if it is defined by finitely many polynomial inequalities.
Nondifferentiability conjecture. If is non-differentiable at infinitely many points, then is not semi-algebraic.
The source identifies this as the only obstruction to proving the preceding operator-algebra conjecture and says it seems likely but was neither proved nor found in the literature.
Progress summary
A reader-written complete proof has been posted, but it has not been independently verified, so the conjecture remains unconfirmed.
The conjecture asserts that the region below a continuous nonnegative function on the unit interval cannot be semi-algebraic when the function has infinitely many nondifferentiable points. It is described as the remaining obstruction to a related operator-algebra conjecture, and as previously unproved.
Posted attempt
A reader-written argument claims a complete proof. It argues that semi-algebraicity of the region implies semi-algebraicity of the function's graph; algebraic factorization and the implicit-function theorem then make the function real-analytic, hence differentiable, except at finitely many points. The attempt has not been independently verified.
Current status (as of August 2026): A complete proof has been claimed in the discussion, but it remains unverified; absent confirmation, the conjecture is not settled.
Sources & referencesView supporting material
Primary source
Vern I. Paulsen and James P. Solazzo, “Interpolation and Balls in C^k”, arXiv:math/0604497 (2006).
Solutions 1
Sign in to submit a solution.
Let be continuous and nonnegative, and put
We prove the stronger contrapositive: if is semialgebraic, then is real-analytic except at finitely many points.
Suppose that is semialgebraic, and define
The set is semialgebraic. By the Tarski–Seidenberg theorem, its coordinate projection is semialgebraic. Therefore
is semialgebraic.
Choose a finite Boolean description of using nonzero polynomials . The graph has empty interior. If all were nonzero at a point of , their signs would remain unchanged throughout a neighborhood, so that neighborhood would also belong to the graph, a contradiction. Consequently the nonzero polynomial
satisfies for every .
Factor over . Let be the product of one copy of each distinct irreducible factor having positive -degree, and let be the product of all remaining nonconstant, -only factors. There must be at least one positive--degree factor, since a nonzero polynomial in alone cannot vanish on the entire graph. Outside the finitely many roots of ,
Viewed in , the polynomial is squarefree. Since the characteristic is zero,
Hence
is finite. For , we have
The real-analytic implicit function theorem gives a unique real-analytic root branch near . Continuity of forces to coincide locally with that branch. Thus is real-analytic, and therefore differentiable, at every point outside .
It follows that a continuous nonnegative function with infinitely many nondifferentiability points cannot have a semialgebraic subgraph, proving the conjecture.