52
Diksha Saste, Mayur Kshirsagar, Nilesh Mundlik, and Aditi S. Phadke
is an (n − 1)-prime ℓ-subgroup, a contradiction to the Lemma 2.5 and so, m = n − 1.
n−1
ꢃ
Therefore, P =
Pi′ is an intersection of exactly n − 1 minimal prime ℓ-subgroups.
i=1
2) ⇒ 3) Suppose that, every n-prime ℓ-subgroup of an ℓ-group G is an intersection of
exactly n − 1 minimal prime ℓ-subgroups. Let P be an n-prime ℓ-subgroup of an ℓ-group
G.
We prove the result by the induction on n. By the Lemma 1.16, 3) holds for n = 2.
Assume that, if P is an intersection of exactly n − 2 minimal prime ℓ-subgroups then
for each x ∈ P there exists a1, a2, . . . , an−2 ∈ P with |x| ∧ |ai| = 0 and |ai| ∧ |aj| = 0,
for i = j. Now, suppose that P is an intersection of exactly (n − 1) minimal prime ℓ-
n−1
ꢃ
subgroups. Then P =
Pi, where each Pi is a minimal prime ℓ-subgroups. Let x ∈ P.
i=1
n−2
ꢃ
Consider, Q =
Pi, implies that x ∈ Q. By the induction assumption, there exist
i=1
a1, a2, . . . , an−2 ∈/ Q such that |x| ∧ |ai| = 0 and |ai| ∧ |aj| = 0, for i = j. Now, for fix
k ∈ {1, 2, . . . , n − 2}, |ai| ∧ |aj| ∈ Pk, for all i = j. Therefore, there exists at most one ai
such that |ai| ∈ Pk. Otherwise, we have |ai |, |ai | ∈ Pk implies that |ai |∧|ai | = 0 ∈ Q, a
1
2
1
2
ꢆ
ꢉ
n−2
ꢃ
ꢇ
ꢇ
ꢈ
ꢊ
ꢊ
ꢋ
contradiction. Without loss of generality, we may assume that |ai| ∈
Pj
\ Pi. Now
j=1
j=i
we have following two cases:
(A) : |ai| ∈ Pn−1, i = 1, 2, . . . , (n − 2). Since Pn−1 in a minimal prime, by the Lemma
1.16 there exists c1, c2, . . . , cn−2 ∈/ Pn−1 such that |ai| ∧ |ci| = 0. Also, as x ∈ Pn−1
there exists f ∈ Pn−1 such that |x| ∧ |f| = 0 follows from the case n = 2. Consider
an−1 = |f| ∧ |c1| ∧ |c2| ∧ . . . ∧ |cn−2|. Observe that |x| ∧ |an−1| = 0 and |ai| ∧ |an−1| = 0 for
each i, i = 1, 2, . . . , (n − 2). Thus in this case 3) holds.
(B) : Now, assume that Pn−1 does not contain at most one |ai|, say |ak| ∈ Pn−1
.
Otherwise, |ak| ∧ |aj| = 0 ∈ Pn−1 for i = j, but |aj|, |ak| ∈ Pn−1, a contradiction. As
Pk = Pn−1, there exists d such that d ∈ Pn−1\Pk. Consider, a′ = |ak| ∧ |d|. Clearly,
k
|a′ | = |ak| ∧ |d| ≤ |d| ∈ Pn−1 and hence |a′ | ∈ Pn−1. Also, |ak| ∈/ Pk and |d| ∈/ Pk implies
k
k
that |a′ | ∈/ Pk. Thus |a′ | ∈ Pn−1\Pk. Replacing ak by a′ in the set {a1, a2, . . . , an−2} ,
k
k
k
this case follows from (A).
3) ⇒ 1) : Suppose on the contrary that, Q is an n-prime ℓ-subgroup with Q ꢀ P. Choose
x ∈ P\Q. By the hypothesis, there exist a1, a2, . . . , an−1 ∈/ P such that |x| ∧ |ai| = 0 and
|ai| ∧ |aj| = 0 for i = j, and i, j ∈ {1, 2, . . . , n − 1}. But Q is an n-prime ℓ-subgroup.
Therefore by the Lemma 2.6, |x| ∈ Q or |ai| ∈ Q ⊆ P, a contradiction. Thus, P is a
minimal n-prime ℓ-subgroup of G.
□