Let $R$ be a polynomial ring over a field $K$. Given a submodule $U$ of an $R$-module $M$, a differential primary decomposition of $U$ in $M$ is a list of pairs $(p_1, A_1), ..., (p_k, A_k)$ where $p_1, ..., p_k$ are the associated primes of $M/U$ and $A_i \subseteq \operatorname{Diff}_{R/K}(M, R/p_i)$ are differential operators satisfying $$U_p = \bigcap_{p_i \subseteq p} \{ w \in M_p : \delta(w) = 0 , \ \forall \delta \in A_i \}.$$ This notion was introduced in [2] (cf. Definition 4.1), in which it was shown that the size of a differential primary decomposition (which is defined to be $\sum_{i=1}^k |A_i|$) is at least amult(U), and moreover differential primary decompositions of size equal to amult(U) exist (and are called minimal).
This method contains an implementation of Algorithm 4.6 in [2].
The following example appears as Example 6.2 in [1]:
|
|
|
The object differentialPrimaryDecomposition is a method function with options.