Pierce–Birkhoff conjecture

In abstract algebra, the Pierce–Birkhoff conjecture asserts that any piecewise-polynomial function can be expressed as a maximum of finite minima of finite collections of polynomials. It was first stated, albeit in non-rigorous and vague wording, in the 1956 paper of Garrett Birkhoff and Richard S. Pierce in which they first introduced f-rings. The modern, rigorous statement of the conjecture was formulated by Melvin Henriksen and John R. Isbell, who worked on the problem in the early 1960s in connection with their work on f-rings. Their formulation is as follows:

For every real piecewise-polynomial function , there exists a finite set of polynomials such that .[1]

Isbell is likely the source of the name Pierce–Birkhoff conjecture, and popularized the problem in the 1980s by discussing it with several mathematicians interested in real algebraic geometry.[1]

The conjecture was proved true for n = 1 and 2 by Louis Mahé.[2]

Local Pierce–Birkhoff conjecture

In 1989, James J. Madden provided an equivalent statement that is in terms of the real spectrum of and the novel concepts of local polynomial representatives and separating ideals.

Denoting the real spectrum of A by , the separating ideal of α and β in is the ideal of A generated by all polynomials that change sign on and , i.e., and . Any finite covering of closed, semi-algebraic sets induces a corresponding covering , so, in particular, when f is piecewise polynomial, there is a polynomial for every such that and . This is termed the local polynomial representative of f at .

Madden's so-called local Pierce–Birkhoff conjecture at and , which is equivalent to the Pierce–Birkhoff conjecture, is as follows:

Let , be in and f be piecewise-polynomial. It is conjectured that for every local representative of f at , , and local representative of f at , , is in the separating ideal of and .[1]
gollark: No, it has it in a separate module.
gollark: It also ships a "fuse filter" thing, which is apparently based on similar principles but mildly more compact, except construction can fail, and according to their empirical testing it needs over 100000 keys to have a decent chance of not failing, and the only explanation is a link to an incomprehensible paper on properties of hypergraphs.
gollark: I found a crate for it.
gollark: Also, I'm wondering if I *should* actually make it store the full text of stuff, for highlighting the relevant bits.
gollark: As of now the search is just limited to ANDing all the bitmaps; it doesn't do ranking, nearness, multiple boolean operators, sort of thing.

References

  1. Lucas, François; Madden, James J.; Schaub, Daniel; Spivakovsky, Mark (2009). "On connectedness of sets in the real spectra of polynomial rings". Manuscripta Mathematica. 128 (4): 505–547. arXiv:math/0601671. doi:10.1007/s00229-008-0244-1. MR 2487439.
  2. "The Pierce–Birkhoff Conjecture". Atlas Conferences, Inc. 1999-07-05. Archived from the original on 2011-06-08.

Further reading

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.