Bounding the number of stable homotopy types of a parametrized family of semi-algebraic sets defined by quadratic inequalities
Abstract
We prove a nearly optimal bound on the number of stable homotopy types occurring in a k-parameter semi-algebraic family of sets in , each defined in terms of m quadratic inequalities. Our bound is exponential in k and m, but polynomial in . More precisely, we prove the following. Let be a real closed field and let \[ P = \P1,...,Pm\ ⊂ [Y1,...,Y,X1,...,Xk], \] with degY(Pi) ≤ 2, degX(Pi) ≤ d, 1 ≤ i ≤ m. Let S ⊂ +k be a semi-algebraic set, defined by a Boolean formula without negations, whose atoms are of the form, P ≥ 0, P≤ 0, P ∈ P. Let π: +k k be the projection on the last k co-ordinates. Then, the number of stable homotopy types amongst the fibers S = π-1() S is bounded by \[ (2m k d)O(mk). \]
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.