We denote the algebraic closure of k; for each zero-dimensional ideal ⊂, () : = {∈ : f () = 0,∀f∈}⊂; for any α = (b1,…, bd)∈, Φα the projection Φα : [Xd+1,…, Xn] defined by
Each element f∈ can be uniquely expressed either as
For each set
G⊂,
{G} denotes the set
{(g) : g∈G},
and
(G) the monomial ideal
{τ(g) : τ∈, g∈G}
it generates.
For each ideal
⊂, we denote
() the minimal basis
of the monomial ideal
() = {},
() : = () and
() | : = | {Xht : 1≤h≤n, t∈()} () | |
= | ()∩{1}∪{Xht : 1≤h≤n, t∈()} |
For each f∈, there is [2,3,4] a unique canonical form
Two sets : = {,…,}⊂ * : = Hom(, k), and = {q1,…, qs}⊂ are triangular if (qj) = 0, for each i < j.
Denoting, for each k-vector subspace L⊂ * ,
Denoting, for each τ∈, M(τ) : →k the morphism defined by M(τ) = c(f, τ) for each f = c(f, t)t∈ and : = {M(τ) : τ∈}, then Span()⊂ * is the set of the Noetherian equations [12,13,20] of . If we set
Therefore, each zero-dimensional ideal ⊂ can be considered as given if we know the set : = () and, for each ∈, a Macaulay basis of the corresponding primary component of . For each ∈, : = (a1,…, an), let us therefore denote λ : the translation λ(Xi) = Xi + ai, for each i, m = (X1 - a1,…, Xn - an), q the m-primary component of , {(υ) : υ∈(λ(q))} is the Macaulay basis of λ(q), for each υ∈(λ(q)) the Macaulay equation : = (υ). Setting s : = deg(q) and : = {λ1,…, λs} : = {λ : υ∈(λ(q)),∈}, we know that Span() = L() and = P(Span()); moreover [12,13,18,20] we can wlog assume to be ordered so that, for each σ, P(Span({λ1,…, λσ})) is an ideal. We also set
Under the assumption that λ = M(λ) for each λ∈, — this is equivalent as assuming that each λ(q) is a monomial ideal — Cerlienco–Mureddu Algorithm (Alg. ) associates to each such sets and , an order ideal : = () and a bijection Φ : = Φ() : , which, as we will proof later, satisfies () = (P()) for the lexicographical ordering induced by X1 < ... < Xn.
If, moreover, for each λ = λ∈, λ = M(λ) = M(υ)λ, then is called a CM-ideal, its CM-scheme, and each = (, υ)∈ a CM-condition.
We need also to consider, for each m < n, the set
[1, m] | : = | ∩k[X1,…, Xm] | |
= | {X1a1 ... Xmam : (a1,…, am)∈m}, | ||
[1, m] | : = | {M(τ) : τ∈[1, m]} |
Remark that a CM-ideal is radical iff υ = 1∀(, υ)∈ iff # = #. If this happens, with an abuse of notation, we simply identify each CM-condition = (, 1) and the corresponding CM-functional λi = λ with .
Let ⊂ be a CM-ideal, and, using the same notation as above, : = {λ1,…, λs} and : = {,…,}⊂kn×, = (, υi), : = (ai1,…, ain), λi = M(υi)λ a Macaulay representation and a CM-scheme of ; let us denote : = () and Φ : = Φ() the result of Cerlienco–Mureddu Correspondence which satisfies [5,6] : = ().
Since is an order ideal, : = is a monomial ideal whose minimal basis : = {,…,} will be ordered so that < < … < ; we also set
We extend the ordering of to = {τ1,…, τs} enumerating it so that τσ = Φ(), for each σ and let us denote the ordering of and by so that for each α, β, τα τβ, α < β.
For a term
τ : = X1d1 ... Xndn∈ () such that
∪{τ} is an
order ideal,
we define, for each
m, 1≤m≤n:
(τ) | : = | {ω∈[1, m] : τ > ωXm+1dm+1 ... Xndn∈}, | |
(τ) | : = | {Φ-1(ωXm+1dm+1 ... Xndn) : ω∈(τ)}, | |
(τ) | : = | πm((τ)), | |
(τ) | : = | {πm(λ)∈(τ) : πm-1(λ) (τ)}, | |
(τ) | : = | {λ∈ : πm(λ)∈(τ)}, | |
(τ) | : = | {∈ : πm(λi)∈(τ)}, | |
(τ) | : = | {ω∈[1, m] : | |
ω < Xmdm, ωXm+1dm+1 ... Xndn∈}, | |||
Mm(τ) | : = | {ω∈(τ) : ω τ}, |
Th. below proves, if is radical, the existence,
for each
m, 1≤m≤n and each
τ : = X1d1 ... Xndn∈ (resp. )
of a suitable polynomial
gmτ∈Span{Xmdm}∪(τ)
— resp.
Span{Xmdm}∪Mm(τ).
In terms of such polynomials we define
for each
τ∈∪ and each
m, 1≤m≤n:
(τ) | : = | {∈(τ) : gντ()≠0},(τ) |
(τ) | : = | {λ∈ : λ Φ-1(τ)} = {λ∈ : Φ(λ) τ}, | |
X(τ) | : = | { : λj∈(τ)}, | |
((τ)) | : = | P(Span((τ))), |
N(τ) | : = | {ω∈ : ω τ}, | |
Mm(τ) | : = | {ω∈ : ω τ}. |