forked from nbreva/AeCodimension
2.1 KiB
2.1 KiB
Things that we can do
Given f := (\tilde f,h) : (\mathbb{C}^n,0) \to (\mathbb{C}^p\times \mathbb{C}^q,0) such that
\tilde f : (\mathbb{C}^n,0) \to (\mathbb{C}^p,0) is finite.
- Set
X_i = f_i(x_1,\ldots,x_n)fori = 1,\ldots, p, andY_i = h_(x)fori=1,\ldots, q. done - Find a $\mathbb{C}$-basis
g_1,\ldots, g_mof\mathcal{O}[x_1,\ldots,x_n]/(f_1,\ldots,f_p). done - Given
\alpha \in \mathbb{C}[x_1,\ldots,x_n]^{p + q}such that there exists a unitu\in \mathcal{O}[x_1,\ldots,x_n], andA^1_1\ldots,A^{p+q}_m \in \mathbb{C}[X]withu\cdot \alpha = g_1\cdot (A_1^1,\ldots, A_1^{p+q})+\cdots+g_m\cdot (A_m^1,\ldots, A_m^{p+q})modulo some submodule, find theA_i^jand tell us ifulives in\mathcal{O}[X]or not.- If there exists a solution with
u\in \mathbb{C}[x]can be done with syzygies. - If there is a solution but not with
ubeing a polynomial, to-do. - Even if in theory we are interested only in vectors of length
p+q, in some cases it will be usefull to do it for length1.
- If there exists a solution with
- Apply the previous step to the vectors
(\frac{\partial f_1}{\partial x_j},\ldots, \frac{\partial f_{p+q}}{\partial x_j})to obtainnvectors of lengthm\times (p+q). Call them(F_1^1,\ldots, F_{m\times (p+q)}^1), \ldots, (F_1^n,\ldots, F_{m\times (p+q)}^n). - For each
(e_1,\ldots,e_q)with0\leq e_i<m, apply algorithm 3 toh_1^{e_1}\cdots h_q^{e_q}to get vectorsH_1,\ldots, H_{(p+q)m^q}. If in some point algorithm 3 said that it used a unit not in\mathcal{O}[X], raise a nonimplemented error (we don't know how to handle this case). - Compute a standard basis of the module
Mgenerated by the $F$'s and the $H$'s. - Use the standard basis to compute a $\mathbb{C}$-basis of the quotient
\mathcal{O}[X]^{m(p+q)}/M. Its size is the Ae-codimension.
Pending generalizations:
- Change the source by a Cohen-Macaulay subvariety.
Theoretical remarks:
- The reason for taking
e_i<min step 5 is becauseY_i^mcan be expressed as a polynomial inX,Ywith degree in theYsmaller thanm. check the theory