On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals (Q2457334)

An ideal \(I \subset F[s] := F[s_1,...,s_n]\), where \(F\) is a field, is said to be zero-dimensional if \(F[s]/I\) has finite dimension as \(F\)-vector space. In this paper the \(F\)-vector space \(I^\perp := \{\varphi | \;\varphi| _I=0 \}\subset \text{Hom}_F(F[s],F)\) is studied; \(I^\perp\) is called the inverse system of \(I\). \(I^\perp\) has a natural structure of \(F[s]\)-module, and in this paper a method to compute a system of generators for \(I^\perp\) (as \(F[s]\)-module) is given if \(I\) is zero-dimensional. Such system is shown to have minimal length under certain mild conditions on \(I\) (e.g. when a primary decomposition of \(I\) is known); however a formula for the minimal number of \(F[s]\)-generators is given. Moreover, a generalization to zero-dimensional ideals of the notion of square free decomposition of a polynomial is given, and also an algorithm to compute such decomposition. The main tool in developing those algorithms is the theory of Gröbner basis.