The definable connectedness conjecture for regular rings
The definable connectedness conjecture for regular rings
Let be a regular ring, let , and let be a finite collection of elements of not belonging to . A subset of is definably connected if it is not a union of two non-empty disjoint constructible subsets that are relatively closed for the spectral topology. Definable connectedness conjecture. There exists a definably connected set such that and
for . Equivalently, and belong to the same definably connected component of
This conjecture refines the preceding connectedness formulation by requiring definable connectedness in the spectral topology; its status is not resolved in the supplied source.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Equivalent formulations 1
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
The definable connectedness conjecture for regular rings
Let be a regular ring and let . A subset of is definably connected if it is not the union of two nonempty disjoint constructible subsets that are relatively closed in the spectral topology. Say that has the definable connectedness property at if, for every finite collection , there is a definably connected set containing and avoiding every zero set .
Definable connectedness conjecture. A regular ring satisfies the definable connectedness property at every pair .
The definable version is designed to imply the Pierce–Birkhoff conjecture by the same argument as ordinary connectedness. Its general validity is left open in the paper.
source: François Lucas, Daniel Schaub and Mark Spivakovsky, “On the Pierce-Birkhoff Conjecture”, arXiv:1207.6463 (2012).
Sources & referencesView supporting material
Primary source
François Lucas, James Madden, Daniel Schaub and Mark Spivakovsky, “Approximate roots of a valuation and the Pierce-Birkhoff Conjecture”, arXiv:1003.1188 (2012).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.