The conjecture on infinitely many nondifferentiable points and semi-algebraicity

Let f:[0,1]Rf:[0,1]\to\mathbb{R} be continuous and non-negative, and define

C={(x,y):0x1, 0yf(x)}.C=\{(x,y):0\leq x\leq 1,\ 0\leq y\leq f(x)\}.

A set is semi-algebraic if it is defined by finitely many polynomial inequalities.

Nondifferentiability conjecture. If ff is non-differentiable at infinitely many points, then CC 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

Open

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

Proof

Let f:[0,1]Rf:[0,1]\to\mathbb R be continuous and nonnegative, and put

C={(x,y):0x1, 0yf(x)}.C=\{(x,y):0\le x\le1,\ 0\le y\le f(x)\}.

We prove the stronger contrapositive: if CC is semialgebraic, then ff is real-analytic except at finitely many points.

Suppose that CC is semialgebraic, and define

E={(x,y,z)R3:(x,y)C, (x,z)C, z>y}.E=\{(x,y,z)\in\mathbb R^3:(x,y)\in C,\ (x,z)\in C,\ z>y\}.

The set EE is semialgebraic. By the Tarski–Seidenberg theorem, its coordinate projection πx,y(E)\pi_{x,y}(E) is semialgebraic. Therefore

Γf=Cπx,y(E)={(x,f(x)):0x1}\Gamma_f=C\setminus\pi_{x,y}(E) =\{(x,f(x)):0\le x\le1\}

is semialgebraic.

Choose a finite Boolean description of Γf\Gamma_f using nonzero polynomials P1,,PmR[x,y]P_1,\ldots,P_m\in\mathbb R[x,y]. The graph has empty interior. If all PiP_i were nonzero at a point of Γf\Gamma_f, their signs would remain unchanged throughout a neighborhood, so that neighborhood would also belong to the graph, a contradiction. Consequently the nonzero polynomial

P(x,y)=i=1mPi(x,y)P(x,y)=\prod_{i=1}^mP_i(x,y)

satisfies P(x,f(x))=0P(x,f(x))=0 for every x[0,1]x\in[0,1].

Factor PP over R[x,y]\mathbb R[x,y]. Let Q(x,y)Q(x,y) be the product of one copy of each distinct irreducible factor having positive yy-degree, and let A(x)A(x) be the product of all remaining nonconstant, xx-only factors. There must be at least one positive-yy-degree factor, since a nonzero polynomial in xx alone cannot vanish on the entire graph. Outside the finitely many roots of AA,

Q(x,f(x))=0.Q(x,f(x))=0.

Viewed in R(x)[y]\mathbb R(x)[y], the polynomial QQ is squarefree. Since the characteristic is zero,

gcdR(x)[y](Q,yQ)=1,Δ(x)=Resy(Q,yQ)0.\gcd_{\mathbb R(x)[y]}(Q,\partial_yQ)=1, \qquad \Delta(x)=\operatorname{Res}_y(Q,\partial_yQ)\ne0.

Hence

F={0,1}{x[0,1]:A(x)Δ(x)=0}F=\{0,1\}\cup\{x\in[0,1]:A(x)\Delta(x)=0\}

is finite. For x0[0,1]Fx_0\in[0,1]\setminus F, we have

Q(x0,f(x0))=0,yQ(x0,f(x0))0.Q(x_0,f(x_0))=0,\qquad \partial_yQ(x_0,f(x_0))\ne0.

The real-analytic implicit function theorem gives a unique real-analytic root branch near (x0,f(x0))(x_0,f(x_0)). Continuity of ff forces ff to coincide locally with that branch. Thus ff is real-analytic, and therefore differentiable, at every point outside FF.

It follows that a continuous nonnegative function with infinitely many nondifferentiability points cannot have a semialgebraic subgraph, proving the conjecture.

0 endorsements
Shivam Patel ·