Pierce-Birkhoff conjecture is true for splines

Lek-Heng Lim; Zehua Lai

REVIEW 2 major objections 4 minor 33 references

Pierce-Birkhoff conjecture is true for splines

T0 review · 2 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Every spline is a finite max-min of ordinary polynomials; this proves the Pierce–Birkhoff conjecture for all splines.

desk verdict Genuinely new result for Pierce-Birkhoff on splines, with a clean proof strategy; but the proof has an unproved tangent-cone assertion and the effective bounds section has sign errors—worth refereeing, not a desk reject. read the letter →

arxiv 2507.07976 v2 pith:BAYKD6QV submitted 2025-07-10 math.AG

Zehua Lai , Lek-Heng Lim This is my paper · ORCID

classification math.AG MSC 14P1052C3565D0706F25

keywords Pierce–Birkhoffconjecturesplinesmax-definablefunctionsseparatingidealsrealspectrumhyperplanearrangementsconvexconespiecewisepolynomials

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proves that every spline—a continuous function on $\mathbb{R}^n$ that is a polynomial of degree $d$ on each piece of a hyperplane partition—can be written as a finite expression $\max_i \min_j f_{ij}$ with ordinary polynomials $f_{ij}$. This settles the Pierce–Birkhoff conjecture for all splines, for every degree $d$ and every dimension $n$, where previously only the case $d=1$ and the case $n\le2$ were known. The argument goes through real-spectrum technology: using the characterization of Theorem 3.2, max-definability reduces to showing that for any two chamber closures $V_i,V_j$, the separating ideal equals the vanishing ideal of the affine span of $V_i\cap V_j$. The paper also proves an effective version, with $\deg f_{ij}\le 2d+1$ and $p=O(b^{2n^2}d^n)$, and observes that, by an existing result, every spline is a ReLU-activated transformer.

What carries the argument

The load-bearing object is the separating ideal $\langle U,V\rangle$ of two closed chamber closures: the ideal of all polynomials that are nonnegative on $U$ and nonpositive on $V$. Theorem 3.2 converts max-definability of $f$ into checking $f_\alpha-f_\beta\in\langle\alpha,\beta\rangle$ for all points of the real spectrum, and Corollary 3.3 reduces that to checking $g_i-g_j\in\langle V_i,V_j\rangle$ for chamber polynomials. The geometric heart is the tangent-cone computation: for $x$ in the relative interior of the convex polytope $V_i\cap V_j$, the tangent cones $C_i,C_j$ satisfy $C_i\cap C_j=\operatorname{aff}(V_i\cap V_j)$, so separating the two pointed cones $C_i/(C_i\cap C_j)$ and $C_j/(C_i\cap C_j)$ by a hyperplane yields a degree-one polynomial in the separating ideal; this forces $\langle V_i,V_j\rangle$ to equal the vanishing ideal of the affine span.

What would settle it

Take any hyperplane arrangement in $\mathbb{R}^n$ and two chamber closures $V_i,V_j$ with nonempty intersection; compute the tangent cones $C_i,C_j$ at a point in the relative interior of $V_i\cap V_j$ and check whether $C_i\cap C_j$ equals $\operatorname{aff}(V_i\cap V_j)$ and is the largest affine subset contained in either cone. A concrete counterexample to either identity would invalidate the proof of Theorem 3.4, as would a direct computation showing $\langle V_i,V_j\rangle\neq\mathfrak{a}$ for such a pair.

Watch

Extended reading notes

Core claim

The central claim is Theorem 3.4: if $f$ is a spline on a hyperplane partition of $\mathbb{R}^n$, then $f$ is max-definable, meaning it belongs to the smallest class of functions generated from polynomials by addition, multiplication, and taking maxima. Equivalently, any continuous piecewise polynomial of degree $d$ on such a partition equals $\max_{i=1,\ldots,p}\min_{j=1,\ldots,p'} f_{ij}$ for finitely many ordinary polynomials. The proof is existential; the effective analysis of Theorem 4.2 then shows the $f_{ij}$ can be chosen with $\deg f_{ij}\le 2d+1$ and $p=O(b^{2n^2}d^n)$, where $b$ is the number of hyperplanes defining the partition.

Load-bearing premise

The proof rests on an unproved geometric assertion: at a point $x$ in the relative interior of $V_i\cap V_j$, the intersection of the two tangent cones is exactly the affine span of $V_i\cap V_j$ and is the largest affine subset contained in either cone. If that statement fails for some hyperplane arrangement, the equality $\langle V_i,V_j\rangle=\mathfrak{a}$ breaks and Theorem 3.4 has no proof.

Editorial extensions

If this is right

For every spline on a hyperplane partition, in every dimension and every degree, the Pierce–Birkhoff representation $\max_i\min_j f_{ij}$ exists; this is the first case beyond $d=1$ and $n\le2$.
The certificate is explicit: each $f_{ij}$ has degree at most $2d+1$, and the number of blocks grows as $O(b^{2n^2}d^n)$ in the number $b$ of defining hyperplanes.
Because $C^0$ splines include all smoother $C^k$-splines, the result automatically holds for continuous piecewise polynomials of any smoothness class on hyperplane partitions.
By the cited companion theorem, every spline is a ReLU-activated transformer, connecting this classical conjecture to the function class used in current deep-learning architectures.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

If the tangent-cone lemma survives scrutiny, the same separating-ideal strategy may generalize to semialgebraic splines whose chambers are not convex, provided each pair's tangent cones have the same intersection behavior; the authors hint at this but do not claim it.
The effective bounds suggest a constructive route: an algorithm that separates two polyhedral cones can output the polynomials $\rho_{ijk}$ and hence an explicit max-min certificate for a given spline.
A natural stress test is to search in $\mathbb{R}^3$ for hyperplane arrangements where the relative-interior tangent-cone intersection differs from the affine span; even one example would locate a genuine obstruction to the full conjecture.
The theorem suggests that the hard core of Pierce–Birkhoff is not high degree or high dimension as such, but non-convexity of chambers: for convex polytopal chambers the problem reduces to convex separation.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Zehua and Lek-Heng prove that every spline on a hyperplane partition of R^n is max-definable, i.e., Pierce–Birkhoff for splines in all degrees and dimensions. That's a real step: previously only n≤2 or d=1 were known. The proof idea is good: use Madden's local criterion, reduce to checking gi−gj belongs to the separating ideal of chamber closures, and then separate tangent cones with a linear polynomial. The reduction via Corollary 3.3 is clean and I'd expect it to be reusable.

The trouble is in the execution. The central geometric step in Theorem 3.4 states, without proof, that for x in the relative interior of Vi∩Vj, the tangent cones satisfy Ci∩Cj = affine span of Vi∩Vj and this is the largest affine subset contained in either cone. That's not quite right as stated: Ci∩Cj is a cone, and after translating x to the origin it's a linear subspace. What's needed is that this intersection is the common lineality space, so the quotient cones are pointed and opposite. This is plausible for polyhedral cones (you can prove it from active constraints), but it is load-bearing and currently missing. The paper needs an explicit lemma with proof or a reference.

Section 4 is in worse shape. The sign cases for σijk don't cover all possibilities, and the case ρijk≥0 on both sets gives πijkσijk≤0 on Vj_hat, which violates the required nonnegativity. Also in the early case "gi−gj≥0 on Vi", setting h=0 checks 0≥0 on Vj_hat instead of the needed 0≤gj−gi; that's the wrong inequality. So Theorem 4.2's bounds are not supported as written. That section can be repaired, but not by small typo fixes.

The existential theorem, however, does not depend on the effective bounds. If the geometric lemma is supplied, the main result stands. I don't see circularity; the reliance on Madden and standard convex separation is appropriate. The paper is honest about the literature and doesn't claim more than it proves (apart from the gaps above).

Who should read this: anyone working on Pierce–Birkhoff, real spectra, or spline theory. The main theorem, once fixed, is a major result. It deserves a serious referee, not a desk reject. I'd recommend sending it to peer review with a request to add the missing geometric lemma and rewrite Section 4.

Referee Report

2 major / 4 minor

Summary. The paper claims to prove the Pierce–Birkhoff conjecture for splines: every continuous piecewise polynomial of degree d on a hyperplane partition of R^n is max-definable, i.e., expressible as a finite expression max_i min_j f_ij with f_ij ordinary polynomials. The proof uses Madden's local criterion and separating ideals: for each pair of chamber closures V_i,V_j it reduces the problem to showing that the separating ideal ⟨V_i,V_j⟩ equals the vanishing ideal of the affine span of V_i∩V_j, then invokes convex separation. Section 4 claims effective bounds deg f_ij ≤ 2d+1 and p = O(b^{2 n^2} d^n). The paper is well organized and builds on published results rather than on the authors' earlier work, but the central proof and the effective proof each contain a load-bearing gap that needs to be addressed.

Significance. If the proof can be repaired, this is a major advance: it would settle the Pierce–Birkhoff conjecture for splines for all d and all n, far beyond the previously known cases d=1 and n≤2, and it would provide the first explicit bounds for this problem. The strategy of using Madden's criterion together with convex geometry of chamber closures is attractive and potentially reusable for other semialgebraic splines. The paper is not circular and gives credit to the relevant prior literature. However, the current version is not yet a complete proof: the main theorem depends on an unproved tangent-cone assertion, and the effective-bounds construction has a sign-control gap. Both appear locally repairable, but they are load-bearing.

major comments (2)

[§3, proof of Theorem 3.4] The assertion immediately after choosing x in relint(V_i∩V_j) — that the tangent cones C_i and C_j satisfy C_i∩C_j = span(aff(V_i∩V_j)) and that this is the largest affine subset contained in C_i or C_j — is load-bearing but unproved. This identity is what justifies passing to the quotients C_i/(C_i∩C_j) and C_j/(C_i∩C_j), guarantees that those quotients are pointed, and yields the separating degree-one polynomial h. The subsequent conclusion a ⊆ ⟨V_i,V_j⟩ depends entirely on this step. The statement as written is also imprecise: C_i∩C_j is a linear subspace after translating by x, not the affine span itself, and the two cones are not disjoint in the literal sense because both contain the origin. Please add a lemma, with proof or reference, establishing that C_i∩C_j is the common lineality space of C_i and C_j and that the two pointed quotient cones admit a strictly separating linear functional.
[§4, proof of Theorem 4.2, Eq. (6) and definition of sigma_{ijk}] The sign-control step is incomplete. For the case g_i−g_j ≤ 0 on V_i, the refined partition Π' only guarantees that each g_i−g_j, ρ_{ijk}, and ρ_{ijk}−1 has constant sign on each V_{i\hat i}; it does not control the sign of g_i−g_j on V_{j\hat j}, nor does the case analysis for σ_{ijk} cover all sign combinations. In particular, cases 2–4 of the definition of σ_{ijk} either require ρ_{ijk} ≥ 0 on V_{j\hat j} or ρ_{ijk} ≤ 0 on V_{j\hat j}, but the mixed situation is not handled consistently, and the claimed inequality Σ π_{ijk}σ_{ijk} ≥ 0 on V_{j\hat j} is false when π_{ijk} ≤ 0 and σ_{ijk} > 0. Thus the sentence 'It is straightforward to check...' is not correct as written, and Lemma 4.1 cannot yet be applied. Since the degree bound and the p bound both rest on this construction, this gap must be fixed or the effective part of the paper must be revised.

minor comments (4)

[§1, second paragraph] The statement that a hyperplane partition is 'equivalent' to a triangulation is not literally true; a hyperplane partition can be refined to a triangulation, and a triangulation can be refined to a hyperplane partition, but the two classes of partitions are not identical. Please rephrase in terms of common refinement.
[§2, Definition 2.4] The phrase 'A max-definable functions' should be 'A max-definable function'.
[§4, last paragraph of proof] The sentence 'We see little point in providing it since but the bound for p is already exponential in n' contains a grammatical error ('since but'); please rewrite.
[§5, Conclusion] The claim that every spline is a ReLU-activated transformer is asserted via [17, Theorem 3.8], but the cited theorem concerns attention as a smoothed cubic spline; the direction of the implication is not explained. Please either substantiate this consequence or soften the statement.

Circularity Check

0 steps flagged · score 1.0 of 10

No circularity: the main theorem is derived from Madden's independent criterion and standard convex separation; the authors' own [17] appears only as a concluding remark and is not load-bearing.

full rationale

The derivation chain is: (1) Madden's Theorem 3.2 gives an iff criterion for max-definability; (2) Corollary 3.3 reduces the task to showing gi - gj belongs to the separating ideal <Vi, Vj> for chamber closures; (3) Theorem 3.4 attempts to establish <Vi, Vj> equals the vanishing ideal of the affine span of Vi intersect Vj by tangent-cone separation, citing external convex geometry [16, 31]; (4) Lemma 4.1 and Theorem 4.2 then make the construction effective using standard real-algebraic counting bounds [2, 27]. None of these inputs is the target statement or fitted to a subset of the target. The sole self-citation, [17], occurs in the Conclusion ('By [17, Theorem 3.8], it follows from Theorem 3.4 that every spline is a ReLU-activated transformer') and is a forward application of the theorem, not an input to its proof. There is no fitted parameter renamed as a prediction and no ansatz smuggled in via the authors' prior work. The proof does rely on an unproved geometric tangent-cone identity (Ci intersect Cj equals the affine span of Vi intersect Vj, and is the largest affine subset in either cone), but this is an independent geometric lemma, not a circular reuse of the conclusion; whether true or false, its absence is a correctness gap rather than circularity. Therefore no circular step can be exhibited, and the score is low.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The proof introduces no new free parameters and no invented entities. It relies on standard real algebraic geometry, Madden's theorem, convex-geometry separation, and one unproved geometric assertion about tangent cones in hyperplane arrangements. The effective-bounds proof additionally depends on a case analysis that appears to omit needed sign control.

assumptions (5)

standard math Madden's theorem: a semialgebraic spline f is max-definable iff for any α,β in SpecR(R), fα−fβ ∈ ⟨α,β⟩.
This external equivalence, stated as Theorem 3.2, is the main bridge from the geometric separating-ideal condition to max-min representability.
standard math Real spectrum constructions: eV and the fact that f≥0 on V iff f≥0 on eV.
Used in Section 3 to extend chambers and splines to the real spectrum, following Bochnak-Coste-Roy.
standard math Strict separation of disjoint pointed polyhedral cones and of disjoint convex compact sets.
Used in Theorem 3.4 to construct the separating degree-one polynomial h showing a⊆⟨Vi,Vj⟩.
domain assumption For closed chamber closures Vi,Vj, the tangent cones at a relative interior point of Vi∩Vj satisfy Ci∩Cj equal to the affine span of Vi∩Vj, and this is the largest affine subset contained in Ci or Cj.
This load-bearing geometric fact is asserted without proof in the proof of Theorem 3.4 and is essential to the equality a=⟨Vi,Vj⟩.
standard math Basu-Pollack-Roy chamber-count bound for semialgebraic partitions: a partition induced by N polynomials of degree at most d' has O((N d')^n) chambers.
Used in Theorem 4.2 to bound the refined number p of pieces.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Pierce-Birkhoff conjecture is true for splines." pith.science (2026). https://pith.science/paper/BAYKD6QV

@misc{pith2026250707976,
  author       = {Pith},
  title        = {Pith review of: Pierce-Birkhoff conjecture is true for splines},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BAYKD6QV}},
  note         = {Machine review of arXiv:2507.07976}
}

abstract

We prove the Pierce--Birkhoff conjecture for splines, i.e., continuous piecewise polynomials of degree $d$ in $n$ variables on a hyperplane partition of $\mathbb{R}^n$, can be written as a finite lattice combination of polynomials. We will provide a purely existential proof, followed by a more in-depth analysis that yields effective bounds.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

33 extracted references · 31 canonical work pages

[1]

Aguiar and S

M. Aguiar and S. Mahajan. Topics in hyperplane arrangements, volume 226 of Mathematical Surveys and Mono- graphs. American Mathematical Society, Providence, RI, 2017

work page 2017
[2]

S. Basu, R. Pollack, and M.-F. Roy. Algorithms in real algebraic geometry , volume 10 of Algorithms and Com- putation in Mathematics . Springer-Verlag, Berlin, 2003

work page 2003
[3]

L. J. Billera. Homology of smooth splines: generic triangulations and a conjecture of Strang. Trans. Amer. Math. Soc., 310(1):325–340, 1988

work page 1988
[4]

L. J. Billera. The algebra of continuous piecewise polynomials. Adv. Math., 76(2):170–183, 1989

work page 1989
[5]

Birkhoff and R

G. Birkhoff and R. S. Pierce. Lattice-ordered rings. An. Acad. Brasil. Ci. , 28:41–69, 1956

work page 1956
[6]

Bochnak, M

J. Bochnak, M. Coste, and M.-F. c. Roy. Real algebraic geometry, volume 36 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3) . Springer-Verlag, Berlin, 1998

work page 1998
[7]

Br¨ ocker

L. Br¨ ocker. On the separation of basic semialgebraic sets by polynomials. Manuscripta Math. , 60(4):497–508, 1988

work page 1988
[8]

C. K. Chui. Multivariate splines , volume 54 of CBMS-NSF Regional Conference Series in Applied Mathematics . Society for Industrial and Applied Mathematics, Philadelphia, PA, 1988

work page 1988

Show all 33 references

[9]

de Boor, K

C. de Boor, K. H¨ ollig, and S. Riemenschneider. Box splines , volume 98 of Applied Mathematical Sciences . Springer-Verlag, New York, 1993

1993
[10]

C. N. Delzell. On the Pierce–Birkhoff conjecture over ordered fields. volume 19, pages 651–668. 1989. Quadratic forms and real algebraic geometry (Corvallis, OR, 1986)

1989
[11]

C. N. Delzell. Extension of the two-variable Pierce–Birkhoff conjecture to generalized polynomials. Ann. Fac. Sci. Toulouse Math. (6) , 19:37–56, 2010

2010
[12]

DiPasquale and F

M. DiPasquale and F. Sottile. Bivariate semialgebraic splines. J. Approx. Theory , 254:105392, 19, 2020

2020
[13]

DiPasquale, F

M. DiPasquale, F. Sottile, and L. Sun. Semialgebraic splines. Comput. Aided Geom. Design , 55:29–47, 2017

2017
[14]

A. Hatcher. Algebraic Topology. Cambridge University Press, 2002

2002
[15]

Henriksen and J

M. Henriksen and J. R. Isbell. Lattice-ordered rings and function rings. Pacific J. Math. , 12:533–565, 1962

1962
[16]

V. L. Klee, Jr. Separation properties of convex cones. Proc. Amer. Math. Soc. , 6:313–318, 1955

1955
[17]

Lai, L.-H

Z. Lai, L.-H. Lim, and Y. Liu. Attention is a smoothed cubic spline. arXiv:2408.09624, 2024

2024 arXiv
[18]

Lapenta and I

S. Lapenta and I. Leu¸ stean. Towards understanding the Pierce–Birkhoff conjecture via MV-algebras. Fuzzy Sets and Systems , 276:114–130, 2015

2015
[19]

Lucas, J

F. Lucas, J. Madden, D. Schaub, and M. Spivakovsky. Approximate roots of a valuation and the Pierce–Birkhoff conjecture. Ann. Fac. Sci. Toulouse Math. (6) , 21(2):259–342, 2012

2012
[20]

Lucas, J

F. Lucas, J. J. Madden, D. Schaub, and M. Spivakovsky. On connectedness of sets in the real spectra of polynomial rings. Manuscripta Math. , 128(4):505–547, 2009

2009
[21]

Lucas, D

F. Lucas, D. Schaub, and M. Spivakovsky. On the Pierce–Birkhoff conjecture. Journal of Algebra , 435:124–158, 2015

2015
[22]

J. J. Madden. Pierce–Birkhoff rings. Arch. Math. (Basel) , 53(6):565–570, 1989

1989
[23]

J. J. Madden. Henriksen and Isbell on f -rings. Topology Appl., 158(14):1768–1773, 2011. 8 Z. LAI AND L.-H. LIM

2011
[24]

L. Mah´ e. On the Pierce–Birkhoff conjecture.Rocky Mountain J. Math. , 14(4):983–985, 1984

1984
[25]

L. Mah´ e. On the Pierce–Birkhoff conjecture in three variables. J. Pure Appl. Algebra , 211(2):459–470, 2007

2007
[26]

Marshall

M. Marshall. The Pierce–Birkhoff conjecture for curves. Canad. J. Math. , 44(6):1262–1271, 1992

1992
[27]

Matouˇ sek.Lectures on discrete geometry, volume 212 of Graduate Texts in Mathematics

J. Matouˇ sek.Lectures on discrete geometry, volume 212 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002

2002
[28]

Ovchinnikov

S. Ovchinnikov. Max-min representation of piecewise linear functions. Beitr¨ age Algebra Geom., 43(1):297–302, 2002

2002
[29]

Plaumann

D. Plaumann. Positivity of continuous piecewise polynomials. Bull. Lond. Math. Soc. , 44(4):749–757, 2012

2012
[30]

Shekhtman and T

B. Shekhtman and T. Sorokina. A note on intrinsic supersmoothness of bivariate semialgebraic splines. Comput. Aided Geom. Design, 98:Paper No. 102137, 5, 2022

2022
[31]

Stoer and C

J. Stoer and C. Witzgall. Convexity and optimization in finite dimensions I , volume 163. Springer Science & Business Media, 2012

2012
[32]

S. Wagner. On the Pierce–Birkhoff conjecture for smooth affine surfaces over real closed fields. Ann. Fac. Sci. Toulouse Math. (6) , 19:221–242, 2010

2010
[33]

R.-H. Wang. Multivariate spline functions and their applications, volume 529 ofMathematics and its Applications. Kluwer Academic Publishers, Dordrecht, 2001. Department of Mathematics, University of Texas, Austin, TX 78712 Email address : zehua.lai@austin.utexas.edu Computatio...

2001

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.

[1] [1]

Aguiar and S

M. Aguiar and S. Mahajan. Topics in hyperplane arrangements, volume 226 of Mathematical Surveys and Mono- graphs. American Mathematical Society, Providence, RI, 2017

work page 2017

[2] [2]

S. Basu, R. Pollack, and M.-F. Roy. Algorithms in real algebraic geometry , volume 10 of Algorithms and Com- putation in Mathematics . Springer-Verlag, Berlin, 2003

work page 2003

[3] [3]

L. J. Billera. Homology of smooth splines: generic triangulations and a conjecture of Strang. Trans. Amer. Math. Soc., 310(1):325–340, 1988

work page 1988

[4] [4]

L. J. Billera. The algebra of continuous piecewise polynomials. Adv. Math., 76(2):170–183, 1989

work page 1989

[5] [5]

Birkhoff and R

G. Birkhoff and R. S. Pierce. Lattice-ordered rings. An. Acad. Brasil. Ci. , 28:41–69, 1956

work page 1956

[6] [6]

Bochnak, M

J. Bochnak, M. Coste, and M.-F. c. Roy. Real algebraic geometry, volume 36 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3) . Springer-Verlag, Berlin, 1998

work page 1998

[7] [7]

Br¨ ocker

L. Br¨ ocker. On the separation of basic semialgebraic sets by polynomials. Manuscripta Math. , 60(4):497–508, 1988

work page 1988

[8] [8]

C. K. Chui. Multivariate splines , volume 54 of CBMS-NSF Regional Conference Series in Applied Mathematics . Society for Industrial and Applied Mathematics, Philadelphia, PA, 1988

work page 1988