In computer algebra, a triangular decomposition of a polynomial system is a set of simpler polynomial systems such that a point is a solution of if and only if it is a solution of one of the systems .
When the purpose is to describe the solution set of in the algebraic closure of its coefficient field, those simpler systems are regular chains. If the coefficients of the polynomial systems are real numbers, then the real solutions of can be obtained by a triangular decomposition into regular semi-algebraic systems. In both cases, each of these simpler systems has a triangular shape and remarkable properties, which justifies the terminology.
The Characteristic Set Method is the first factorization-free algorithm, which was proposed for decomposing an algebraic variety into equidimensional components. Moreover, the Author, Wen-Tsun Wu, realized an implementation of this method and reported experimental data in his 1987 pioneer article titled "A zero structure theorem for polynomial equations solving".[1] To put this work into context, let us recall what was the common idea of an algebraic set decomposition at the time this article was written.
Let be an algebraically closed field and be a subfield of . A subset is an (affine) algebraic variety over if there exists a polynomial set such that the zero set of equals .
Recall that is said irreducible if for all algebraic varieties the relation implies either or . A first algebraic variety decomposition result is the famous Lasker–Noether theorem which implies the following.
Theorem (Lasker - Noether). For each algebraic variety there exist finitely many irreducible algebraic varieties such that we have
V=V1\cup … \cupVe.
Moreover, if holds for then the set is unique and forms the irreducible decomposition of .
The varieties in the above Theorem are called the irreducible components of and can be regarded as a natural output for a decomposition algorithm, or, in other words, for an algorithm solving a system of equations in .
In order to lead to a computer program, this algorithm specification should prescribe how irreducible components are represented. Such an encoding is introduced by Joseph Ritt[2] through the following result.
Theorem (Ritt). If is a non-empty and irreducible variety then one can compute a reduced triangular set contained in the ideal
\langleF\rangle
\langleF\rangle
We call the set in Ritt's Theorem a Ritt characteristic set of the ideal
\langleF\rangle
Joseph Ritt described a method for solving polynomial systems based on polynomial factorization over field extensions and computation of characteristic sets of prime ideals.
Deriving a practical implementation of this method, however, was and remains a difficult problem. In the 1980s, when the Characteristic set Method was introduced, polynomial factorization was an active research area and certain fundamental questions on this subject were solved recently[3]
Nowadays, decomposing an algebraic variety into irreducible components is not essential to process most application problems, since weaker notions of decompositions, less costly to compute, are sufficient.
The Characteristic Set Method relies on the following variant of Ritt's Theorem.
Theorem (Wen-Tsun Wu). For any finite polynomial set, one can compute a reduced triangular set
C\subset\langleF\rangle
Different concepts and algorithms extended the work of Wen-Tsun Wu. In the early 1990s, the notion of a regular chain, introduced independently by Michael Kalkbrener in 1991 in his PhD Thesis and, by Lu Yang and Jingzhong Zhang[4] led to important algorithmic discoveries.
In Kalkbrener's vision,[5] regular chains are used to represent the generic zeros of the irreducible components of an algebraic variety. In the original work of Yang and Zhang, they are used to decide whether a hypersurface intersects a quasi-variety (given by a regular chain). Regular chains have, in fact, several interesting properties and are the key notion in many algorithms for decomposing systems of algebraic or differential equations.
Regular chains have been investigated in many papers.[6] [7] [8]
The abundant literature on the subject can be explained by the many equivalent definitions of a regular chain. Actually, the original formulation of Kalkbrener is quite different from that of Yang and Zhang. A bridge between these two notions, the point of view of Kalkbrener and that of Yang and Zhang, appears in Dongming Wang's paper.[9]
There are various algorithms available for obtaining triangular decomposition of both in the sense of Kalkbrener and in the sense of Lazard and Wen-Tsun Wu. The Lextriangular Algorithm by Daniel Lazard[10] and the Triade Algorithm by Marc Moreno Maza[11] together with the Characteristic Set Method are available in various computer algebra systems, including Axiom and Maple.
Let be a field and be ordered variables. We denote by the corresponding polynomial ring. For, regarded as a system of polynomial equations, there are two notions of a triangular decomposition over the algebraic closure of . The first one is to decompose lazily, by representing only the generic points of the algebraic set in the so-called sense of Kalkbrener.
| e | |
| \sqrt{(F)}=cap | |
| i=1 |
\sqrt{sat(Ti)}.
The second is to describe explicitly all the points of in the so-called sense of in Lazard and Wen-Tsun Wu.
| e | |
| V(F)=cup | |
| i=1 |
W(Ti).
In both cases are finitely many regular chains of and
\sqrt{sat(Ti)}
Assume from now on that is a real closed field. Consider a semi-algebraic system with polynomials in . There exist[12] finitely many regular semi-algebraic systems such that we have
Zk(S)=Zk(S1)\cup … \cupZk(Se)
where denotes the points of which solve . The regular semi-algebraic systems form a triangular decomposition of the semi-algebraic system .
Denote the rational number field. In
Q[x,y,z]
x>y>z
S=\begin{cases}x2+y+z=1\ x+y2+z=1\ x+y+z2=1\end{cases}
According to the Maple code:
\begin{cases}z=0\ y=1\ x=0\end{cases} \cup \begin{cases}z=0\ y=0\ x=1\end{cases} \cup \begin{cases}z=1\ y=0\ x=0\end{cases} \cup \begin{cases}z2+2z-1=0\ y=z\ x=z\end{cases}