Preliminaries: Associated primes of monomial ideals

Extremal ideals

Definition 261.1.

.
, where

ad860d
Extremal= q-> (
    S=set {1};
    for i from 1 to q  do S=S+set{i};
    PS=subsets S;
    V={};
    for i from 1 to #PS-1 do V=V|{x_{PS#i}};
    R=QQ[V];
    Elist={};
    for i from 1 to q do (
	    e_i=1;
	    for j from 0 to #PS-1 do  if isSubset(set{i},PS#j) then
	        e_i=e_i*x_{PS#j};
        Elist=Elist|{e_i};
    );
    return monomialIdeal(Elist);
)

For example,

Let be a squarefree monomial ideal with generators. Then, properties of can be gleaned from properties of . Here’s an example:

Theorem 261.2.

, where is a squarefree monomial ideal with generators.

Our goal is to find for all .

Tool to find non-associated primes of

Let be a monomial ideal. By Thm 262.19, every is a monomial prime ideal, that is, is generated by single powers of variables. Suppose . Then, by Thm 262.20, for some monomial , and thus, by Thm 262.15,

(Note that , since if it was, would be the entire ring). Hence we have the following lemma:

Lemma 261.3.

Let be a monomial ideal and be some variables. If , then .

2e6cc7

Note that for ideals , we have , since implies for . Let be as in the above lemma. If is a prime ideal such that , we have

however, always holds, so , and by Lem 3, .

Theorem 261.4.

Let be a monomial ideal and be some variables. If , then no associated prime of contains .

7d15f2

General observations

is a squarefree monomial ideal. There are finitely many monomial prime ideals in . Precisely, has prime monomial ideals. By Thm 262.19, all associated primes of are monomial prime ideals.

Thm 262.23 tells us that is the intersection of the ideals in . When this is regarded as a primary decomposition of , Def 262.1 tells us that for all .

Proposition 261.5.

for all .

By Cor 262.7, the associated primes of higher powers of contain , and maybe additional embedded primes from the pool of monomial prime ideals.

Proposition 261.6.

is the number of minimal covers of objects (https://oeis.org/A046165).

Data

sequences

  1. : 2; 2
  2. : 8, 9; 8, 1
  3. : 49, 80, 81; 49, 31, 1
  4. : 462, 2095, 2858, 2859; 462, 1633, 763, 1
  5. : 6424
LaTeX

Data

(# IPI, # Ass)

⬇️ q ➡️ r12345
22, 2
38, 817, 9
449, 49152, 80333, 81
5462, 4623024, 209510784, 285828257, 2859

Irredundant primary intersection is given by irreducibleDecomposition.

IPI sequences for

2, 3, 4, 5, 6, 7, 8, 9
8, 17, 28, 41, 56, 73, 92, 113, 136, 161, 188, 217, 248, 281
49, 152, 333, 615, 1021, 1574

Conjecture 261.7.

is a polynomial sequence in for fixed .

[!Data]- Irredundant primary intersection ()

1, 2, 3, 4s
1, 2, 3s, 4
1, 2s, 3, 4
1s, 2, 3, 4

12, 3, 4s
14, 24 | 34 | 4s
2, 13, 4s
1, 23, 4s
12, 4, 3s
13, 4, 2s
4, 23, 1s
2, 41, 3s
3, 41, 2s
1, 42, 3s
1, 42, 1s
1, 43, 2s
2, 43, 1s

12, 13, 4s
24 | 34 | 4s
12, 23, 4s
13, 23, 4s
12, 41, 3s
13, 41, 2s
12, 42, 3s
42, 23, 1s
41, 42, 3s
13, 43, 2s
23, 43, 1s
41, 42, 2s
42, 41, 1s

123, 4s
14, 24, 34 | 4s
412, 3s
413, 2s
423, 1s

3, 4, 12s
13, 23 | 14, 24 | 1s, 2s, 12
2, 4, 13s
1, 4, 23s
2, 3, 41s
1, 3, 42s
1, 2, 43s

4, 12, 13s
34 | 23 | 1s, 3s
4, 13, 12s
4, 12, 23s
4, 13, 23s
4, 23, 12s
4, 23, 13s
3, 12, 41s
2, 13, 41s
3, 41, 12s
2, 41, 13s
3, 12, 42s
1, 23, 42s
3, 41, 42s
3, 42, 12s
1, 42, 23s
3, 42, 41s
2, 13, 43s
1, 23, 43s
2, 41, 43s
1, 42, 43s
2, 43, 13s
1, 43, 23s
2, 43, 41s
1, 43, 42s

4, 12s, 13s, 23s
14, 24, 34 | 13 | 12 | 23
3, 12s, 41s, 42s
2, 13s, 41s, 43s
1, 23s, 42s, 43s

4, 123s
14, 24, 34 | 1s, 2s, 3s, 12, 13, 23
3, 412s
2, 413s
1, 423s

12, 13, 41s

12, 41, 13s
13, 41, 12s
12, 23, 42s
12, 42, 23s
23, 42, 12s
13, 23, 43s
41, 42, 43s
13, 43, 23s
23, 43, 13s
43, 41, 42s
42, 43, 41s

23, 41s
41, 23s
13, 42s
42, 13s
12, 43s
43, 12s

123, 41s
123, 42s
412, 13s
412, 23s
123, 43s
412, 43s
413, 12s
413, 23s
413, 42s
423, 12s
423, 13s
423, 41s

41, 123s
42, 123s
13, 412s
23, 412s
43, 123s
43, 412s
12, 413s
32, 413s
42, 413s
12, 423s
13, 423s
41, 423s

3, 123s, 41s, 42s
2, 123s, 41s, 43s
1, 123s, 42s, 43s
2, 412s, 13s, 43s
2, 412s, 23s, 43s

123, 412s
412, 123s
123, 413s
412, 413s
413, 123s
413, 412s
123, 423s
412, 423s
413, 423s
423, 123s
423, 412s
423, 413s

4, 13s, 23s, 412s
4, 12s, 23s, 413s
3, 12s, 42s, 413s
1, 23s, 42s, 413s
4, 12s, 13s, 423s
3, 12s, 41s, 423s
2, 13s, 41s, 423s

12s, 13s, 23s, 41s, 42s, 43s

123s, 41s, 42s, 43s
412s, 13s, 23s, 43s
413s, 12s, 23s, 42s
423s, 12s, 13s, 41s

123s, 412s, 43s
123s, 42s, 413s
23s, 412s, 413s
123s, 41s, 423s
13s, 412s, 423s
12s, 413s, 423s

123s, 412s, 413s
123s, 412s, 423s
132s, 413s, 423s
412s, 413s, 423s

1234

Conjecture 261.8.

.

Finding

. It is easily seen that by Cor 262.21 and Lem 262.22. We can say more:

Claim 261.9.

for all .

Finding

Note that .

[!Claim]
for all .

[!Proof]-
Find such that .

Claim 261.10.

for all .

Footnotes

  1. It is clear from Def 262.1 that an associated prime of must contain ; A prime ideal that is contained in a minimal prime cannot contain .