Weak Wu stratification in \(\mathbb{R}^n\) (Q1808668)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Weak Wu stratification in \(\mathbb{R}^n\) |
scientific article |
Statements
Weak Wu stratification in \(\mathbb{R}^n\) (English)
0 references
18 June 2000
0 references
The article uses Wu's characteristic set algorithm [ \textit{W.-T. Wu},`` Mechanical theorem proving in geometries'' (1994; Zbl 0831.03003)] as a basic part of an algorithm to find a weak stratification of \({\mathcal F}\) semialgebraic sets. Let \(K\) be a computable ordered subfield of the field \({\mathbb{R}}\) of real numbers, \(n\) a natural number. Let \(\mathcal F=\{ f_1,...,f_s\}\) be a list of functions, \(f_i: {\mathbb{R}}^n\rightarrow {\mathbb{R}}\) such that in some neighbourhood of each point in \({\mathbb{R}}^n\), \(f_i\) is represented by an absolutely convergent power series. A polynomial in \(K[x_1,\ldots,x_n,f_1,\ldots,f_s]\) is called an \({\mathcal F}\)-polynomial. \({\mathcal F}\) is called Noetherian if all the partial derivatives of all the functions in \(\mathcal F\) are \(\mathcal F\)-polynomials. The article deals with semialgebraic sets that is with sets defined by Boolean combinations of equalities and inequalities among \(\mathcal F\)-polynomials. For \(\alpha\in {\mathbb{R}}^n,\) \(\epsilon >0,\) denote by \(N_{\epsilon}(\alpha)\) the open ball of radius \(\epsilon\) around \(\alpha.\) A set \(S\subset {\mathbb{R}}^n\) is called a \(d-\)dimensional manifold if for every \(\alpha\in S\) there is a number \(\epsilon>0\) such that \( S\cap N_{\epsilon}(\alpha)\) is analytically diffeomorphic to \({\mathbb{R}}^d \times 0^{n-d}.\) A stratification of a set is a decomposition of it into finitely many disjoint manifolds. Let the set \(S\) be given by a semialgebraic condition. According to the algorithm developed in the article a manifold \(M\) is removed from \(S,\) where \(M\) is defined by a so called basic condition. It is required that the problem of stratifying \(S\setminus M\) be in some sense less difficult than the problem of stratifying \(S,\) so this procedure will always terminate (provided that the notion of difficulty generates a well ordering). See also the paper by \textit{A. Gabrielov} and \textit{N. Vorobjov}, Discrete Comput. Geom. 14, No.~1, 71-91 (1995; Zbl 0832.68056).
0 references
weak stratification
0 references
semianalytic sets
0 references
semialgebraic sets
0 references