Christian Ronse
email: cronse@unistra.fr

Semimodularity and the Jordan-Hölder theorem in posets, with applications to partial partitions

Keywords: poset, semimodularity, Birkhoff condition, Jordan-Hölder theorem, partial partitions Mathematics Subject Classification (2000) 03E02, 06A06, 06C10, 68U10

Lattice-theoretical generalizations of the Jordan-Hölder theorem of group theory give isomorphisms between finite maximal chains with same endpoints. The best one has been given by Czédli and Schmidt (after Grätzer and Nation), it applies to semimodular lattices and gives a chain isomorphism by iterating up and down the perspectivity relation between intervals [x ∧ y, x] and [y, x ∨ y] where x covers x ∧ y and x ∨ y covers y.

In this paper we extend to arbitrary (and possibly infinite) posets the definitions of standard semimodularity and of the slightly weaker "Birkhoff condition", following the approach of Ore (1943). Instead of perspectivity, we associate tags to the covering relation, a more flexible approach. We study the finiteness and length constancy of maximal chains under both conditions, and obtain Jordan-Hölder theorems. Our theory is easily applied to groups, to closure ranges of an arbitrary poset, and also to five new order relations on the set of partial partitions of a set (i.e., partitions of its subsets), which do not constitute lattices.

(maximal series of normal subgroups) are isomorphic in the sense that they have the same length and their sequences of quotients of successive groups can be obtained from each other by permutation (that is, the sequences contain the same groups, with each one appearing the same number of times).

Naive lattice theory presents as analogue or "generalization" of it the socalled Jordan-Dedekind theorem [START_REF] Birkhoff | Lattice Theory[END_REF] due to Dedekind [START_REF] Dedekind | Über die von drei Moduln erzeugte Dualgruppe[END_REF], which states that in a modular lattice (i.e., satisfying the condition a ≤ b ⇒ a∨(x∧b) = (a∨x)∧b), in an interval of finite length all maximal chains will have the same length. Now normal subgroups of a group, ordered by inclusion, obviously constitute a modular lattice, thus the Jordan-Dedekind theorem states here that in a group of finite normal length, all chief series have the same length.

In a lattice, write ≺ for the covering relation; then the lattice is upper semimodular if it satisfies a ∧ b ≺ a ⇒ b ≺ a ∨ b, and dually it is lower semimodular if it satisfies b ≺ a ∨ b ⇒ a ∧ b ≺ a [START_REF] Stern | Semimodular Lattices -Theory and Applications[END_REF]. Both conditions are more general than modularity. Then the Jordan-Dedekind theorem holds also in a lower or upper semimodular lattice of finite length. Now the subnormal subgroups of a group with finite composition length, ordered by inclusion, constitute a lower semimodular lattice; hence the Jordan-Dedekind theorem gives that all composition series have the same length.

However, we still have an impoverished version of the Jordan-Hölder theorem, since it lacks the part about the number of occurrences of each quotient in the series. Now Grätzer and Nation [START_REF] Nation | Revised notes on lattice theory[END_REF][START_REF] Grätzer | A new look at the Jordan-Hölder theorem for semimodular lattices[END_REF] introduced the perspectivity relations in a lattice: given two elements x, y of a lattice, the two intervals [x ∧ y, x] and [y, x ∨ y] are said to be perspective, [x ∧ y, x] is up-perspective to [y, x ∨ y], and [y, x ∨ y] is down-perspective to [x ∧ y, x]. They showed that in an upper semimodular lattice of finite length, given two maximal chains (having thus the same length), there is a bijection from the set of successive intervals of the first chain to that of the second, obtained by composing an up-perspectivity followed by a down-perspectivity; for lower semimodularity, we have a down-perspectivity followed by an up-perspectivity. Then Czédli and Schmidt [START_REF] Czédli | The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices[END_REF] showed that the up and down sequence is unique. Now in both lattices of subnormal subgroups and of normal subgroups, two perspective intervals [A, B] and [C, D] give isomorphic quotient groups B/A and D/C, hence we obtain here the full Jordan-Hölder theorem.

Although these results greatly improve on the usual Jordan-Dedekind theorem for modular lattices, we can nevertheless criticize their "ad hoc" nature and their lack of generality. First it is not necessary to have a lattice, a poset (partially ordered set) suffices. Indeed, we can easily generalize semimodularity to posets, following the approach given by Ore [START_REF] Ore | Chains in partially ordered sets[END_REF] for generalizing the slightly weaker Birkhoff condition [START_REF] Stern | Semimodular Lattices -Theory and Applications[END_REF] or quadrilateral condition [START_REF] Ore | Chains in partially ordered sets[END_REF]. Then the result of Grätzer and Nation holds in a semimodular poset.

Next, we replace the "ad hoc" perspectivity relation by something more flexible in theory and more concrete in specific examples. We partition the covering relation ≺ into a set of tagged relations h ≺, each corresponding to a tag h. In practice the tags are given by the concrete situation, for instance, for composition series in groups, X h ≺ Y means that the quotient Y /X is the simple group labelled h. We will also consider several partial order relations on the set of partial partitions of a set (i.e., partitions of any subset), and here π 1 h ≺ π 2 will mean that π 2 is obtained from π 1 by a specific elementary transformation corresponding to the tag h, say, in other words, each h ≺ will be a union of equivalence classes of projectivity, the transitive closure of perspectivity. Tags allow flexibility in results, as the partition of tagged relations can vary from the coarsest, namely the whole covering relation ≺, to the finest, that is, the set of projectivity equivalence classes on the set of covering pairs. Here the Jordan-Hölder theorem states that in a finite maximal chain between two endpoints, among the covering relations of the chain, each tag intervenes a constant number of times.

We will also consider the weaker Birkhoff (or quadrilateral) condition in posets. In the case of lattices, for upper semimodularity it takes the following form [START_REF] Birkhoff | Lattice Theory[END_REF]: if a ∧ b ≺ a and a ∧ b ≺ b, then a ≺ a ∨ b and b ≺ a ∨ b. When the poset or lattice has finite length, the Birkhoff condition is equivalent to semimodularity. In the case of a poset of infinite length, it is strictly weaker. We will analyse the relation of both conditions with the finiteness of maximal chains between two endpoints. The Birkhoff condition guarantees that two finite maximal chains of same endpoints have the same length, but it does not forbid having two maximal chains of same endpoints, one finite and the other infinite. Now semimodularity implies that given a finite maximal chain of given endpoints, every chain with the same endpoints will be included in a finite maximal chain with the same length; thus finite and infinite maximal chains cannot coexist. An interesting fact is that beside the straightforward tagging of the Birkhoff condition (see Figure 2), we can introduce a more flexible condition on tags, the skew-tagged Birkhoff condition (see Figure 3), which is not compatible with projectivity, thus the arguments of Grätzer and Nation do not apply in this case, but we can nevertheless obtain the Jordan-Hölder theorem.

Our results trivially apply to the two posets of composition and of chief series in a group; here we do not need the fact that subnormal subgroups constitute a lattice [START_REF] Wielandt | Eine Verallgemeinerung der invarianten Untergruppen[END_REF] in order to obtain the Jordan-Hölder theorem.

We apply them next to to the poset of closure ranges (closure systems) in an arbitrary (possibly infinite) poset [START_REF] Ronse | The poset of closure systems on an infinite poset: detachability and semimodularity[END_REF]: it is lower semimodular.

However the main application of our theory is to several partial order relations defined on the family of partial partitions of a set (i.e., partitions of any subset of that set) [START_REF] Ronse | Partial partitions, partial connections and connective segmentation[END_REF][START_REF] Ronse | Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks[END_REF]. Ore [START_REF] Ore | Theory of equivalence relations[END_REF] showed that the partitions of a set, ordered by refinement, constitute an upper semimodular lattice. The extension of this order relation to partial partitions (called the standard order in [START_REF] Ronse | Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks[END_REF]) also constitutes an upper semimodular lattice [START_REF] Draskovicová | The lattice of partitions in a set[END_REF]. In [START_REF] Ronse | Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks[END_REF] we introduced 5 new order relations on partial partitions, obtained by restricting the standard order; they do not constitute lattices; then we showed by combinatorial methods that in the finite case, the Jordan-Hölder theorem holds for the standard order and these 5 orders. Here we will show that these orders are all upper semimodular, and that those with a tagged covering satisfy the skew-tagged upper quadrilateral condition; this implies the Jordan-Hölder theorem.

Our work shows thus that lattice-theoretical methods devised in order to generalize the Jordan-Hölder theorem can be extended to posets that are neither finite nor lattices. Also, we have introduced some flexibility in them.

Tags, semimodularity and quadrilateral condition in a poset

Let a set P be partially ordered by ≤, with covering relation ≺ (x ≺ y if x < y but there is no m with x < m < y). For any x ∈ P , let x ↓ = {y ∈ P | y ≤ x} and x ↑ = {y ∈ P | y ≥ x} be the down-set and up-set generated by x [START_REF] Blyth | Lattices and Ordered Algebraic Structures[END_REF]. For

x ≤ y, define the interval [x, y] = x ↑ ∩ y ↓ = {m ∈ P | x ≤ m ≤ y}. A subset of P is a chain if it is totally ordered; given C ⊆ P and x, y ∈ P such that x ≤ y, C is a chain of endpoints x, y if C is a chain, x, y ∈ C and C ⊆ [x, y]. Given a chain C and a, b ∈ C with a ≤ b, let C b a = C ∩ [a, b]; it is a chain of endpoints a, b.
The length of a chain is its cardinal minus one. A maximal chain of endpoints x, y is a chain of endpoints x, y which is not included in a larger chain of endpoints x, y; when such a maximal chain is finite, it takes the form x = c 0 ≺ • • • ≺ c n = y for some n ≥ 0, then we call it a covering chain, and here n is the length of the chain. The length of an interval [x, y] is the supremum of lengths of all maximal chains of endpoints x, y. When P is a lattice or a semilattice, we write ∨ and ∧ for the join and meet operations.

Let us now introduce tagging. Let H be a set of symbols called tags; they will be attached to coverings in the poset P . Let H = { h ≺| h ∈ H} be a partition of the binary relation ≺; this means (with & denoting a logical AND) that:

∀ h ∈ H, ∀ x, y ∈ P, x h ≺ y =⇒ x ≺ y ; ∀ h ∈ H, ∃ x, y ∈ P, x h ≺ y ; ∀ x, y ∈ P, x ≺ y =⇒ ∃ h ∈ H, x h ≺ y ; ∀ h, k ∈ H, ∀ x, y ∈ P, x h ≺ y & x k ≺ y =⇒ h = k .
Note that the second condition ∀ h ∈ H, ∃ x, y ∈ P, x h ≺ y (that all tags are used) is unnecessary; however in practice it makes tagging easier to describe. When the binary relation ≺ is empty, H and H will necessarily be empty. Otherwise, there always exists the coarsest partition H = {≺}, in other words we take for H a singleton, there is a unique tag, which can conveniently be written as a blank symbol.

All our definitions and results will be tagged, that is, they will depend on the partition H, so they will be denoted with the prefix "H-". The particular case with H = {≺} will give their non-tagged counterparts, for which the prefix "H-"will be removed.

Definitions of tagged semimodularity

We consider an arbitrary poset P ; possibly it can be infinite, and its intervals can have infinite length. For H = {≺}, we remove the prefix "H-", we just say that P is upper semimodular and we write

[d, a] m ր [b, u] and [b, u] ց m [d, a].
The property of H-upper semimodularity weakens as the partition H is coarsened; in particular upper semimodularity is weaker than H-upper semimodularity for H = {≺}.

When P is a lattice, [a ≤ b & d h ≺ a & d ≤ b] iff d = a ∧ b h ≺ a, and [a ≤ b & b h ≺ u & a ≤ u] iff b h ≺ a ∨ b = u. Now
we can always choose m = a ∨ b, and then a, b, d, u ∈ m ↓ . Therefore the H-upper semimodularity of P is equivalent to the tagged version of the usual definition of upper semimodularity in a lattice:

∀ h ∈ H, ∀ a, b ∈ P, a ∧ b h ≺ a =⇒ b h ≺ a ∨ b . (1)
Moreover, we will say that [a ∧ b, a] is

H-up-perspective to [b, a ∨ b] or that [b, a ∨ b] is H-down-perspective to [a ∧ b, a],
without "under m", and write

[a ∧ b, a] ր H [b, a ∨ b] or [b, a ∨ b] H ց [a ∧ b, a],
without the superscript m, since we can take m = a ∨ b anyway.

There are some aspects of perspectivity which are simple in the case of a lattice, but generally more complicated when the poset is not a lattice. We introduce thus the folllowing condition: For H = {≺}, we just say upper unicity. Note that the property of H-upper unicity strenghtens as the partition H is coarsened; in particular upper unicity is stronger than H-upper unicity for H = {≺}.

From the above explanation, a join-semilattice satisfies upper unicity: if a ≤ b, a ≤ u and b ≺ u, then u = a ∨ b; hence it satisfies H-upper unicity for any partition H of ≺. Upper unicity guarantees the following property of H-perspectivity (the proof is elementary and left to the reader): Lemma 3 Let the poset P be H-upper semimodular and satisfying upper unicity. Then for any m

∈ P , m ր is included in m ր H , that is, whenever [d, a] m ր [b, u], we have [d, a] m ր H [b, u] (and similarly ց m is included in H ց m ).
On the other hand, in the case of H-upper semimodularity without upper unicity, we can have h, k ∈ H with h = k, m ∈ P and a, b, d, u, v

∈ m ↓ such that a ≤ b, d h ≺ a, d ≤ b, a ≤ u, a ≤ v, b h ≺ u and b k ≺ v. Here [d, a] m ր H [b, u] and [d, a] m ր [b, v], but [d, a] is not H-up-perspective under m to [b, v].
Lemma 4 Let the poset P either be a join-semilattice or be H-upper semimodular and satisfy H-upper unicity. Then the relations m ր H and H ց m are transitive.

Proof

Let [a 0 , a 1 ] m ր H [b 0 , b 1 ] m ր H [c 0 , c 1 ]; thus a 0 , a 1 , b 0 , b 1 , c 0 , c 1 ∈ m ↓ , a 1 ≤ b 0 , b 1 ≤ c 0 , a 0 ≤ b 0 ≤ c 0 , a 1 ≤ b 1 ≤ c 1 ,
and for some h ∈ H we have

a 0 h ≺ a 1 , b 0 h ≺ b 1 and c 0 h ≺ c 1 .
If P is a join-semilattice, we have b 1 = a 1 ∨ b 0 , and as b 0 ≤ c 0 but b 1 ≤ c 0 , we deduce that a 1 ≤ c 0 . Now let P be H-upper semimodular, satisfying Hupper unicity, and suppose that a 1 ≤ c 0 . Then a 0 , a 1 , b 0 ∈ c ↓ 0 , and applying H-upper semimodularity with c 0 in place of m, there is some b Having

2 ∈ c ↓ 0 such that a 1 ≤ b 2 and b 0 h ≺ b 2 ; since a 1 ≤ b 0 , a 0 h ≺ a 1 , a 0 ≤ b 0 , a 1 ≤ b 1 , b 2 and
a 1 ≤ c 0 in both cases, as a 0 ≤ c 0 , a 1 ≤ c 1 , a 0 h ≺ a 1 and c 0 h ≺ c 1 , we get that [a 0 , a 1 ] m ր H [c 0 , c 1 ]. Thus m ր H is transitive. As H ց m is the inverse relation, it is also transitive. ⊓ ⊔
We now consider the tagged version of a slightly weaker version of semimodularity; following [START_REF] Ore | Chains in partially ordered sets[END_REF] we call it the quadrilateral condition: Here

both [d, a] m ր H [b, u] and [d, b] m ր H [a, u]
. Note that we do not exclude the case where h = k. The non-tagged version of this definition was given in [START_REF] Ore | Chains in partially ordered sets[END_REF]. When P is a lattice, the H-upper quadrilateral condition becomes equivalent to the tagged version of the classical Birkhoff condition [START_REF] Birkhoff | Lattice Theory[END_REF][START_REF] Stern | Semimodular Lattices -Theory and Applications[END_REF]:

∀ h, k ∈ H, ∀ a, b ∈ P, a ∧ b h ≺ a & a ∧ b k ≺ b =⇒ a k ≺ a ∨ b & b h ≺ a ∨ b .
(2) It is easily seen that applying (1) both for h and for k gives [START_REF] Birkhoff | Lattice Theory[END_REF]. We obtain a similar result in the case of a poset, by applying H-upper semimodularity successively for h, then for k (with u instead of m):

Proposition 6 Any H-upper semimodular poset satisfies the H-upper quadrilateral condition.

In a poset where all intervals have finite length, H-upper semimodularity will be equivalent to the H-upper quadrilateral condition, see Corollary 15. We now give a variant form of that condition: ≺ u, see Figure 3.

When H = {≺}, the skew-H-upper quadrilateral condition is slightly more general than the H-upper quadrilateral condition, but for H = {≺}, the two are equivalent, they are just Ore's quadrilateral condition [START_REF] Ore | Chains in partially ordered sets[END_REF]. The condition {h, r} = {k, s} gives 3 cases: (a

) h = k = r = s; (b) h = s = k = r; (c) h = k = r = s. The first two correspond to the H-upper quadrilateral condition, with [d, a] m ր H [b, u] and [d, b] m ր H [a,
u]; the third does not, and here we cannot use the perspectivity method of Grätzer and Nation. We will nevertheless obtain a Jordan-Hölder theorem by other means. In Subsection 3.3, we will describe two orders on partial partitions where this third case can arise, and this is our motivation for introducing the skew-H quadrilateral condition.

Contrarily to modularity, semimodularity is not a self-dual concept. So all definitions given above have a dual, we will have the H-lower semimodularity, quadrilateral condition and unicity, and up-or down-perspectivity will be above m, given that we will now have a, b, d, u ∈ m ↑ . For the H-downor up-perspectivity above m, we will write m ց H and H ր m .

It is easily seen that P is both H-upper semimodular and H-lower semimodular iff for any h ∈ H, m, n ∈ P with n ≤ m, and a, b

∈ m ↓ ∩ n ↑ with a ≤ b: there is d ∈ n ↑ with d h ≺ a and d ≤ b iff there is u ∈ m ↓ such that a ≤ u and b h ≺ u.
We will apply this in Subsection 3.3.

Finite maximal chains

We will consider the case where for x < y, there is a finite maximal chain of endpoints x, y (that is, a covering chain), and see what can be deduced about the length of other chains with endpoints x, y when the poset either is upper semimodular or satisfies the upper quadrilateral condition. 4 Illustration of the proof of Theorem 8. For each maximal chain, its name is indicated to the left of it, and its length to the right of it.

1 c z a n -1 b b +1 \{ } C x 1 E 2 2 E F x y u a 1 F Fig.
Given a chain C of endpoints x, y (where x ≤ y) and some a ∈ C, it is easily seen that C is a maximal chain of endpoints x, y if and only if C a x = C ∩a ↓ and C y a = C ∩ a ↑ are both maximal chains of endpoints x, a and a, y respectively.

Theorem 8 Let the poset P be upper semimodular. Let x, y ∈ P such that x ≤ y and let C be a maximal chain of endpoints x, y; if C is finite, then every chain of endpoints x, y is included in a finite maximal chain of endpoints x, y, having the same length as C.

Proof We use induction on the length n of C. If n = 0 or n = 1, then there is only one chain of endpoints x, y. Now suppose that n > 1 and the result holds for any length < n. Let D be a chain of endpoints x, y. In C we have x ≺ c 1 .

If D \ {x} ⊆ c ↑ 1 , then the result follows by applying the induction hypothesis to C ′ = C \ {x} (maximal chain of length n -1) and D ′ = (D \ {x}) ∪ {c 1 }, both with endpoints c 1 , y. So we can assume that D has an element z = x such that c 1 ≤ z; thus x < z < y.

Suppose first that z ≺ y. See Figure 4. By upper semimodularity there exists u ∈ y ↓ such that c 1 < u and z ≺ u; as z ≺ y, we get u < y. By induction hypothesis with C ′ = C \ {x} (maximal chain of length n -1) and {c 1 , u, y}, both of endpoints c 1 , y, there are two maximal chains E 1 and E 2 respectively of endpoints c 1 , u and u, y, and of lengths a and b, where a + b = n -1, a ≥ 1 and b ≥ 1. Now by induction hypothesis with the two chains of endpoints x, u, the maximal {x} ∪ E 1 of length 1 + a < n, and D z

x ∪ {u}, we get a maximal chain F 1 of endpoints x, z containing D z

x , and of length a. Then the induction hypothesis applied to the two chains of endpoints z, y, the maximal {z} ∪ E 2 of length 1 + b < n, and D y z , we get a maximal chain F 2 of endpoints z, y, Suppose next that x ≺ z ≺ y. If there is some z ′ ∈ D such that x < z ′ < z, we choose one; if there is no such z ′ ∈ D, then we choose any z ′ ∈ P such that x < z ′ < z, and add it to D. We apply then the previous paragraph with D ∪ {z ′ } and z ′ instead of D and z.

There remains the case where x ≺ z ≺ y. Applying the upper quadrilateral condition, we get n = 2, then both C and D are maximal chains of endpoints x, y and of length 2.

⊓ ⊔

In this subsection and the next one, we will repeatedly use the following technical result, see also Figures 5 and6:

∈ m ↓ such that a ≤ u, b ≺ u, [d, a] m ր H [b, u],
and there is a covering chain a = w 0 ≺ • • • ≺ w n = u of length n and of endpoints a, u such that for i = 1, . . . , n we have

[v i-1 , v i ] m ր H [w i-1 , w i ]. 2. Let x, y, z ∈ P such that x ≺ z ≤ y and there is a covering chain x = v 0 ≺ • • • ≺ v n+1 = y of length n + 1 and of endpoints x, y such that z ≤ v n . Then [x, z] y ր H [v n , v n+1
] and there is a covering chain z = w 0 ≺ • • • ≺ w n = y of length n and of endpoints z, y such that for i = 1, . . . , n we have

[v i-1 , v i ] y ր H [w i-1 , w i ].
Proof 1. We use induction on n. The case n = 0 is trivial. Assume now that n > 0 and that the result is valid for n -1. For some h, k ∈ H we

[v 0 , v 1 ] = [d, v 1 ] m ր H [a, w 1 ] = [w 0 , w 1 ]. Now w 1 , v 1 ∈ m ↓ , v 1 ≺ w 1 , w 1 ≤ b,
and we have the covering chain

v 1 ≺ • • • ≺ v n = b of length n-1.
Applying the induction hypothesis with v 1 , w 1 and n -1 in place of a, d and n: there exists

u ∈ m ↓ such that w 1 ≤ u, b ≺ u, [v 1 , w 1 ] m ր H [b, u] and there is a covering chain w 1 ≺ • • • ≺ w n = u (of length n -1 and of endpoints w 1 , u) such that for i = 2, . . . , n we have [v i-1 , v i ] m ր H [w i-1 , w i ]. As [v 1 , w 1 ] m ր H [b, u] and v 1 h ≺ w 1 , we have b h ≺ u; as d h ≺ a, a ≤ u and a ≤ b, we get [d, a] m ր H [b, u]. 2.
We apply item 1 with m = y, d = x, a = z and b = v n , and here we get u = y = v n+1 .

⊓ ⊔ Proposition 10 Let the poset P satisfy the upper quadrilateral condition. Let x, y, z ∈ P such that x ≤ z ≤ y and there are two maximal chains of endpoints x, y and x, z respectively, having respective lengths n and t. Then n ≥ t and there exists a maximal chain of endpoints z, y, of length nt.

Proof Let x = c 0 ≺ • • • ≺ c n = y be the maximal chain of endpoints x, y having length n. We use induction on t. If t = 0, then the result trivially holds. Now let t > 0 and suppose that the result holds for t -

1. Let x = d 0 ≺ • • • ≺ d t = z
be the be the maximal chain of endpoints x, z having length t.

Since

d 1 ≤ c 0 , but d 1 ≤ z ≤ y = c n , there is some r ∈ {0, . . . , n -1} such that d 1 ≤ c r but d 1 ≤ c r+1 .
We apply item 2 of Lemma 9, with r, d 0 , d 1 and c 0 , . . . , c r+1 taking the place of n, x, z and v 0 , . . . , v n+1 = y: there is thus a covering chain

d 1 = w 0 ≺ • • • ≺ w r = c r+1 of length r and of endpoints d 1 , c r+1 . Then d 1 = w 0 ≺ • • • ≺ w r = c r+1 ≺ • • • ≺ c n = y is a maximal chain of endpoints d 1 , y, of length n -1. Now d 1 ≺ • • • ≺ d t = z is a maximal chain of endpoints d 1 , z, of length t -1. By induction hypothesis, we have n -1 ≥ t -1, thus n ≥ t,
and there is a maximal chain of endpoints z, y, of length (n -1)

-(t -1) = n -t. ⊓ ⊔
In particular, taking z = y, we deduce the following result, which was shown by Ore in the case of an interval of finite length [START_REF] Ore | Chains in partially ordered sets[END_REF]: Corollary 11 If the poset P satisfies the upper quadrilateral condition, then any two finite maximal chains of the same endpoints have the same length.

As this result is self-dual, it is also valid for the lower quadrilateral condition. Now we show through two examples that with the upper quadrilateral condition, we cannot obtain a stronger result.

Example 12 1. Let P = {-n | n ∈ N}∪{-∞, α}, with the order given by the numerical order on {-n | n ∈ N}, -∞ < -n for every n ∈ N, and -∞ < α < 0 (it was illustrated in Figure 1.21 of [START_REF] Stern | Semimodular Lattices -Theory and Applications[END_REF]). Here the covering relation reduces to -∞ ≺ α ≺ 0 and -(n + 1) ≺ -n for every n ∈ N. It is a complete lattice, it satisfies the upper quadrilateral (or Birkhoff) condition, but it is not upper semimodular. We have -∞ ≺ α ≺ 0, a finite chain of endpoints -∞, 0, as well as an infinite one, P \ {α}. Note that the dual result of Proposition 10 does not hold, we have an infinite descending covering chain 0 ≻ -1 ≻ -2 ≻ • • • .

2. Let P = Z ∪ {-∞, +∞, α}, with the order given by the numerical order on Z, -∞ < z < +∞ for every z ∈ Z, and -∞ < α < +∞. Here the covering relation reduces to -∞ ≺ α ≺ +∞ and z -1 ≺ z for every z ∈ Z. It is a complete lattice, it satisfies both the upper and lower quadrilateral (Birkhoff) conditions, but it is neither upper nor lower semimodular. Then -∞ ≺ α ≺ +∞ and P \{α} are two maximal chains of endpoints -∞, +∞, the first one finite, the second one infinite. Note that P contains infinite ascending and descending covering chains, 0

≺ 1 ≺ 2 ≺ • • • and 0 ≻ -1 ≻ -2 ≻ • • • .
Thus it satisfies neither the ascending nor the descending chain condition [START_REF] Grätzer | General Lattice Theory[END_REF].

We now define a restriction of the order, for which the quadrilateral condi-

d = v 0 ≺ • • • ≺ v n = b. Applying item 1 of Lemma 9, there is some u ∈ P such that u ≤ m a ≤ u, b ≺ u, [d, a] m ր H [b, u],

Jordan-Hölder theorems

We have seen that when a poset satisfies the upper or lower quadrilateral condition, two finite maximal chains of the same endpoints have the same length. Now with tags, we will give Jordan-Hölder theorems for the two tagged versions of the upper quadrilateral condition, namely H and skew-H. Given two covering chains

x = c 0 ≺ • • • ≺ c n = y and x = d 0 ≺ • • • ≺ d n = y of
same length and same endpoints x, y, we will obtain a H-isomorphism, that is, a bijection from Write m րր H and H ցց m for the transitive closures of m ր H and H ց m respectively; these relations (defined on intervals [d, a] for d ≺ a) are reflexive. By Lemma 4, if P is a join-semilattice or P is H-upper semimodular and satisfies H-upper unicity, m րր H and H ցց m are just m ր H and H ց m .

{[c i-1 , c i ] | i = 1, . . . , n} to {[d j-1 , d j ] | j = 1, . . . , n} such that if [c i-1 , c i ] is mapped to [d j-1 , d j ],
In the case of the H-upper quadrilateral condition, our result is a translation to posets of the one of Grätzer and Nation [START_REF] Grätzer | A new look at the Jordan-Hölder theorem for semimodular lattices[END_REF] in the case of lattices, and the proof is similar: Theorem 17 Let the poset P satisfy the H-upper quadrilateral condition, let x, y ∈ P with x ≤ y, and let

x = c 0 ≺ • • • ≺ c n = y and x = d 0 ≺ • • • ≺ d n = y
be two covering chains of same length and same endpoints x, y. Then there is a permutation π of {1, . . . , n} such that for any i = 1, . . . , n, there is an interval

P i in y ↓ with [c i-1 , c i ] y րր H P i H ցց y [d π(i)-1 , d π(i) ]. The map [c i-1 , c i ] → [d π(i)-1 , d π(i)
] is an H-isomorphism between the two covering chains. Proof We use induction on n. For n = 0 or n = 1, there is a unique chain of endpoints x, y. Suppose now that n > 1 and that the result is true for n -1.

As (i = 1, . . . , k). We apply the induction hypothesis to the chains

c 1 ≤ x = d 0 and c 1 ≤ y = d n ,
x ′ = c 1 ≺ • • • ≺ c n = y and x ′ = e 0 ≺ • • • ≺ e k = d k+1 ≺ • • • ≺ d n = y:
there is a bijection π : {2, . . . , n} → {1, . . . n, }\{k+1} and for any i = 2, . . . , n there is an interval P i in y ↓ , such that [c i-1 , c i ] y րր H P i , and

P i H ցց y [e π(i)-1 , e π(i) ] if π(i) ≤ k but P i H ցց y [d π(i)-1 , d π(i) ] if π(i) ≥ k+2. For π(i) ≤ k, as [e π(i)-1 , e π(i) ] H ց y [d π(i)-1 , d π(i) ], we get P i H ցց y [d π(i)-1 , d π(i) ].
c i-1 , c i ] → [d π(i)-1 , d π(i) ] is an H- isomorphism. ⊓ ⊔
The result is illustrated in the middle part of Figure 7 for n = 3 (in the induction step from 2 to 3 we have k = 2).

In the case of the skew-H-upper quadrilateral condition, we cannot use perspectivity and the method of Grätzer and Nation [START_REF] Grätzer | A new look at the Jordan-Hölder theorem for semimodular lattices[END_REF]. Our approach will be closer to the original one of Ore [START_REF] Ore | Chains in partially ordered sets[END_REF], see Theorem 4 there. Given a covering chain x = c 0 ≺ • • • ≺ c n = y, an H-substitution replaces in it c j by d j for one j ∈ {1, . . . , n -1}, where there are h, k, r, s ∈ H such that {h, r} = {k, s},

c j-1 h ≺ c j r ≺ c j+1 and c j-1 k ≺ d j s ≺ c j+1 .
See the right part of Figure 7. We have then an H-isomorphism from the first chain to the second, by mapping [c i-1 , c i ] on itself for i < j and for i > j + 1, then:

(a) [c j-1 , c j ] on [c j-1 , d j ] and [c j , c j+1 ] on [d j , c j+1 ] if h = k and r = s; (b) [c j-1 , c j ] on [d j , c j+1 ] and [c j , c j+1 ] on [c j-1 , d j ] if h = s and k = r.
Theorem 18 Let the poset P satisfy the skew-H-upper quadrilateral condition, let x, y ∈ P with x ≤ y, and let x = c 0 ≺ • • • ≺ c n = y and x = d 0 ≺ • • • ≺ d n = y be two covering chains of same length and same endpoints x, y. Then there is a sequence of H-substitutions transforming the first chain into the second, giving thus an H-isomorphism between the two.

Proof As any H-substitution provides an H-isomorphism, a sequence of Hsubstitutions will by composition give an H-isomorphism between two chains. Thus we only have to show that there is such a sequence of H-substitutions.

We use induction on n. Again for n = 0 or n = 1 there is a unique chain of endpoints x, y. Suppose now that n > 1 and that the result is true for n -1. If c 1 = d 1 , the result follows by applying the induction hypothesis to the two chains

x ′ = c 1 ≺ • • • ≺ c n = y and x ′ = d 1 ≺ • • • ≺ d n =
y, then adding x = c 0 = d 0 at the head of each covering chain in the sequence of substitutions.

We assume thus that c 1 = d 1 . For some h, k ∈ H we have x

x = c 0 ≺ c 1 ≺ c 2 ≺ • • • ≺ c n = y into x = c 0 ≺ c 1 ≺ e 2 ≺ • • • ≺ e n = y. Replacing c 1 by d 1 in the latter sequence is an H-substitution transforming it into the chain x = d 0 ≺ d 1 ≺ e 2 ≺ • • • ≺ e n = y. Again, by the above argument, there is a sequence of H-substitutions transforming x = d 0 ≺ d 1 ≺ e 2 ≺ • • • ≺ e n = y into x = d 0 ≺ d 1 ≺ d 2 ≺ • • • ≺ d n = y.
Concatenating all these successive H-substitutions, we get the result.

⊓ ⊔

Applications

We will describe here several particular types of posets, which satisfy one of the tagged upper or lower forms of semimodularity, having thus a Jordan-Hölder theorem. First we briefly consider the two posets of normal and of subnormal subgroups of a group: the first one is both H-upper and lower semimodular, while the second one is H-lower semimodular. Then we will see that the poset of closure ranges of an arbitrary poset is H-lower semimodular. Now our main contribution here is the analysis of 5 new partial order relations on partial partitions, introduced in [START_REF] Ronse | Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks[END_REF], which do not constitute lattices, and for which Jordan-Hölder type properties had been shown in the finite case. We will see that each one is upper semimodular, and in the case of multiple tags, satisfies the skew-H-upper quadrilateral property.

Normal and subnormal groups

Since the topic is well-known, we will consider it briefly. More details can be found in Section 8.3 of [START_REF] Stern | Semimodular Lattices -Theory and Applications[END_REF].

Let G be a group. Write ≤ for the restriction of the inclusion relation to subgroups of G It is easily seen that the two order relations ≤ and ⊳⊳ coincide on S(G), and that S(G), ordered by ⊳⊳, is a meet-semilattice. It inherits the covering relation ≺ from N (G), with the tags corresponding to the simple quotient groups. A result by Wielandt [START_REF] Wielandt | Eine Verallgemeinerung der invarianten Untergruppen[END_REF] states that in a group with finite composition length, the subgroup generated by two subnormal subgroups is subnormal; then S(G) is a lattice [START_REF] Stern | Semimodular Lattices -Theory and Applications[END_REF]. But we will not require that, we easily see that S(G) is an H-lower semimodular poset.

; for A, B ≤ G, write A ⊳ B if A is a normal subgroup of B. Let N (G)
Indeed, let h ∈ H and M, A, B, U ∈ S(G)

such that A, B, U ∈ M ↑ , B ≤ A, A h ≺ U and B ≤ U . Then A ⊳ U , so B normalizes A, hence U = AB. Let D = A∩B; then D ∈ S(G) and D ∈ M ↑ . Now B/D = B/(A∩B) is isomorphic to (AB)/A = U/A, hence D h ≺ B.
As S(G) is a meet-semilattice, it satisfies the H-lower unicity; hence Hperspectivity is transitive by Lemma 4. We get the dual and transitive form of Theorem 17, with m ց H and H ր m instead of m րր H and H ցց m . Thus the Jordan-Hölder theorem holds in any interval having finite length, and in particular in the whole S(G) if G has finite composition length.

Closure ranges

Let P be a poset. A closure map [START_REF] Erné | Closure[END_REF][START_REF] Grätzer | General Lattice Theory[END_REF], or closure operator [START_REF] Baer | On closure operators[END_REF][START_REF] Ronse | The poset of closure systems on an infinite poset: detachability and semimodularity[END_REF], on P is a map ϕ : P → P that is isotone (x ≤ y ⇒ ϕ(x) ≤ ϕ(y)), extensive (x ≤ ϕ(x)) and idempotent (ϕ(ϕ(x)) = ϕ(x)). Equivalently ∀ x, y ∈ P,

x ≤ ϕ(y) ⇐⇒ ϕ(x) ≤ ϕ(y) .

Note that some authors, following the tradition of topology, designate by "closure operator on X" a map acting on subsets of X; in our terminology, it is a closure map on the lattice P(X). The set Φ(P ) of all closure maps on P can be ordered elementwise:

ϕ 1 ≤ ϕ 2 iff ∀ x ∈ P , ϕ 1 (x) ≤ ϕ 2 (x).
A closure range [START_REF] Erné | Closure[END_REF], or closure system [START_REF] Ronse | The poset of closure systems on an infinite poset: detachability and semimodularity[END_REF], on P is a subset S of P such that for any x ∈ P , x ↑ ∩ S is non-empty and has a least element [START_REF] Baer | On closure operators[END_REF]. The set Σ(P ) of all closure ranges on P is ordered by inclusion.

For any closure map ϕ, the invariance domain, fixpoint set, or range of ϕ is the set

Inv(ϕ) = {x ∈ P | ϕ(x) = x} = {ϕ(x) | x ∈ P }
Then the map ϕ → Inv(ϕ) is a bijection Φ(P ) → Σ(P ); the inverse bijection associates to any closure range S the closure map ϕ S : x → least element of x ↑ ∩ S. Now for any that two closure maps ϕ 1 and ϕ 2 , we have ϕ 1 ≤ ϕ 2 ⇐⇒ Inv(ϕ 1 ) ⊇ Inv(ϕ 2 ), thus this bijection Φ(P ) → Σ(P ) is a dual isomorphism. Under some restrictive conditions (e.g., P is a complete lattice, or it satisfies the ascending chain condition, or it is finite . . . , see [START_REF] Baer | On closure operators[END_REF][START_REF] Erné | Closure[END_REF][START_REF] Ronse | The poset of closure systems on an infinite poset: detachability and semimodularity[END_REF] for more details), Σ(P ) is closed under intersection, thus it is a complete lattice; then it is shown that this lattice is lower semimodular [START_REF] Erné | Closure[END_REF]. But as in [START_REF] Ronse | The poset of closure systems on an infinite poset: detachability and semimodularity[END_REF], we will make no assumption on the poset P , so a priori Σ(P ) is only a poset. In that paper, we proved an ad hoc form of lower semimodularity for the poset Σ(P ); we relied on two important results (Corollary 2.4 and Proposition 2.5 there):

Proposition 19 For S 0 , S 1 ∈ Σ(P ) such that S 0 ⊂ S 1 , we have S 0 ≺ S 1 (in Σ(P )) iff S 1 \ S 0 is a singleton. Proposition 20 Let S 1 , S 2 ∈ Σ(P ) such that S 2 \ S 1 is finite; then S 1 ∩ S 2 ∈ Σ(P ).
For any x ∈ P , we define the binary relation ⊓ ⊔

x ≺ on Σ(P ) by S 0 x ≺ S 1 if x ∈ S 1 and S 0 = S 1 \ {x}. Then we partition ≺ into H = { x ≺| x ∈ P, ∃ S 0 , S 1 ∈ Σ(P ), S 0 x ≺ S 1 } .
Of course we get a trivial version of the Jordan-Hölder theorem: given S 0 , S 1 ∈ Σ(P ) such that S 0 ⊂ S 1 and S 1 \ S 0 is finite, a covering chain of endpoints S 0 , S 1 is obtained by adding successively the elements of S 1 \ S 0 in some peculiar order, and each element is added exactly once.

For more properties of Φ(P ) and Σ(P ), the reader is referred to [START_REF] Erné | Closure[END_REF][START_REF] Ronse | The poset of closure systems on an infinite poset: detachability and semimodularity[END_REF].

Orders on partial partitions

We use here the terminology and notation of [START_REF] Ronse | Orders for simplifying partial partitions[END_REF]. Let E be any set. A partition of E is a set of mutually disjoint non-empty subsets of E, whose union gives E; a partial partition of E is a partition of any subset of E, in other words, a set of mutually disjoint non-empty subsets of E, but not necessarily covering E. The subsets of E belonging to a (partial) partition are called blocks.

Let us write Π(E) for the set of all partitions of E, and Π * (E) for the set of all partial partitions of E. Write Ø for the empty partial partition (with no block). Set 1 ∅ = 0 ∅ = Ø, while for any A ∈ P(E) \ {∅}, let 1 A = {A} (the partition of A into a single block) and 0 A = {p} | p ∈ A (the partition of A into its singletons). The union of all blocks of a partial partition π is called the support of π, written supp(π); thus π is a partition of supp(π); the background of π is the complement of the support, back(π) = E \ supp(π).

Partitions are ordered by refinement [START_REF] Ore | Theory of equivalence relations[END_REF]: for π 1 , π 2 ∈ Π(E), we write π 1 ≤ π 2 if every block of π 1 is included in a block of π 2 :

π 1 ≤ π 2 ⇐⇒ ∀ B ∈ π 1 , ∃ C ∈ π 2 , B ⊆ C . (3)
Equivalently, every block of π 2 is a union of blocks of π 1 . This order constitutes Π(E) into a complete lattice with least element 0 E and greatest element 1 E .

The covering relation on

Π(E) is m ≺, defined by π 1 m ≺ π 2 if π 2 is obtained by merging two blocks of π 1 : π 1 m ≺ π 2 ⇐⇒ |π 1 | ≥ 2, ∃ C 1 , C 2 ∈ π 1 , C 1 = C 2 , π 2 = π 1 \ {C 1 , C 2 } ∪ {C 1 ∪ C 2 } .
Ore [START_REF] Ore | Theory of equivalence relations[END_REF] showed that Π(E) is upper semimodular:

∀ π 1 , π 2 ∈ Π(E), π 1 ∧ π 2 m ≺ π 1 =⇒ π 2 m ≺ π 1 ∨ π 2 . (4)
Draskovicová [START_REF] Draskovicová | The lattice of partitions in a set[END_REF] introduced partial partitions of E under the name of partitions in E. By extending to Π * (E) the order ≤ defined in (3), then Π * (E) is a complete lattice with least element Ø and greatest element 1 E . Further properties of this order were given in [START_REF] Draskovicová | The lattice of partitions in a set[END_REF][START_REF] Draskovicová | Congruence relations on the lattice of partitions in a set[END_REF][START_REF] Ronse | Partial partitions, partial connections and connective segmentation[END_REF][START_REF] Ronse | Adjunctions on the lattices of partitions and of partial partitions[END_REF]. Note that for π 1 , π 2 ∈ Π * (E), when π 1 ≤ π 2 , every block of π 1 is included in a block of π 2 , but a block of π 2 is generally not a union of blocks of π 1 . Hence we do not use the word "refinement" for the order ≤ on Π * (E), we call it the standard order [START_REF] Ronse | Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks[END_REF].

The relation

π 1 s ≺ π 2 ⇐⇒ supp(π 1 ) ⊂ E, ∃ p ∈ back(π 1 ), π 2 = π 1 ∪ {p} .
The following result was essentially proved in [START_REF] Draskovicová | The lattice of partitions in a set[END_REF][START_REF] Ronse | Adjunctions on the lattices of partitions and of partial partitions[END_REF]:

Proposition
∀ π 1 , π 2 ∈ Π * (E), π 1 ∧ π 2 m ≺ π 1 =⇒ π 2 m ≺ π 1 ∨ π 2 ; π 1 ∧ π 2 s ≺ π 1 =⇒ π 2 s ≺ π 1 ∨ π 2 . (5)
Motivated by image analysis, we introduced in [START_REF] Ronse | Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks[END_REF] 5 new partial order relations on Π * (E), then 3 more orders in [START_REF] Ronse | Orders on partial partitions based on block apportioning[END_REF] and 5 in [START_REF] Ronse | Orders for simplifying partial partitions[END_REF]. We proved by counting the number of blocks and the size of the support that when E is finite, all 13 orders satisfy the Jordan-Hölder theorem, namely that two maximal chains of same endpoints are H-isomorphic. We will analyse here the five orders of [START_REF] Ronse | Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks[END_REF], they are all included in the standard order. We will show that all five are upper semimodular, and that those with more than one tag satisfy the skew-H-upper quadrilateral condition; some of them are also lower semimodular, with the skew-H-lower quadrilateral condition. Hence for these 5 orders, the Jordan-Hölder theorem will be a consequence of their upper semimodularity, and of their skew-H-upper quadrilateral condition when |H| > 1.

Let us first introduce some terminology and notation. First we have the

relation i ≺ given by π 1 i ≺ π 2 if π 2
is obtained by inflating one block of π 1 by exactly one point:

π 1 i ≺ π 2 ⇐⇒ supp(π 1 ) ⊂ E, π 1 = Ø, ∃ p ∈ back(π 1 ), ∃ B ∈ π 1 , π 2 = π 1 \ {B} ∪ B ∪ {p} .
Next we have the relation

c ≺ given by π 1 c ≺ π 2 if π 2 is obtained by adding a block to π 1 : π 1 c ≺ π 2 ⇐⇒ supp(π 1 ) ⊂ E, ∃ B ⊆ back(π 1 ), B = ∅, π 2 = π 1 ∪ {B} .
The building order [START_REF] Serra | Grain building ordering[END_REF] is the partial order relation ⋐ on Π * (E) given by π 1 ⋐ π 2 if every block of π 2 contains at least one block of π 1 :

π 1 ⋐ π 2 ⇐⇒ ∀ C ∈ π 2 , ∃ B ∈ π 1 , B ⊆ C .
We then define the singularity relation ⇚ by π 1 ⇚ π 2 if every block of π 2 contains at most one block of π 1 :

π 1 ⇚ π 2 ⇐⇒ ∀ B, B ′ ∈ π 1 , ∀ C ∈ π 2 , B ⊆ C & B ′ ⊆ C ⇒ B = B ′ .
We can now describe the 5 orders introduced in [START_REF] Ronse | Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks[END_REF]; they are obtained by restricting the standard order and they do not constitute lattices. Their names correspond to the operations on blocks involved in growing a partial partition: inclusion, inflating, merging, inclusion-inflating and merging-inflating.

1. The inclusion order ⊆: for π 1 ⊆ π 2 , each block of π 1 is a block of π 2 , thus π 2 is obtained from π 1 by adding new blocks made of points in back(π 1 ). The covering relation is c ≺.

The inflating order

i ≤:

π 1 i ≤ π 2 ⇐⇒ π 1 ≤ π 2 & π 1 ⋐ π 2 & π 1 ⇚ π 2 .
In other words, the inclusion relation between blocks of π 1 and those of π 2 is a bijection. Here π 2 is obtained by inflating some blocks of π 1 . The covering relation is i ≺.

3. The merging order m ≤:

π 1 m ≤ π 2 ⇐⇒ π 1 ≤ π 2 & supp(π 1 ) = supp(π 2 ) .
In other words, π 1 and π 2 are two partitions of the same support, ordered by refinement. Here π 2 is obtained by merging some blocks of π 1 . As Π * (E)

is the disjoint union of all Π(A) for A ∈ P(E), the order m ≤ is the disjoint union of the refinement orders on all Π(A). The covering relation is m ≺.

4. The inclusion-inflating order i ⊆:

π 1 i ⊆ π 2 ⇐⇒ π 1 ≤ π 2 & π 1 ⇚ π 2 .
In other words, the inclusion relation between blocks of π 1 and those of π 2 is an injection. Here π 2 is obtained from π 1 by inflating some blocks and/or adding new blocks. The covering relation is

i ≺ ∪ s ≺.
5. The merging-inflating order mi ≤:

π 1 mi ≤ π 2 ⇐⇒ π 1 ≤ π 2 & π 1 ⋐ π 2 .
In other words, the inclusion relation between blocks of π 1 and those of π 2 is a surjection. Here π 2 is obtained from π 1 by merging and/or inflating some blocks. The covering relation is Proof Let π m ∈ Π * (E). For the merging order m ≤, π ↓ m is a sublattice of Π(supp(π m )), ordered by refinement, which is upper semimodular, see [START_REF] Czédli | The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices[END_REF].

Consider next the inflating order

i ≤. Let π h , π l ∈ Π * (E) such that π l i ≤ π h . We can write π h = {H ı | ı ∈ I} and π l = {L ı | ı ∈ I}, where for each ı ∈ I we have ∅ = L ı ⊆ H ı . Each element π of the interval [π l , π h ] takes the form {X ı | ı ∈ I}, where L ı ⊆ X ı ⊆ H ı for each ı ∈ I. Let us define W = supp(π h ) \ supp(π l ) = ı∈I (H ı \ L ı ) , f : [π l , π h ] → P(W ) : π → supp(π) \ supp(π l ) , {X ı | ı ∈ I} → ı∈I (X ı \ L ı ) . (6)
It is easy to see that f is a bijection, whose inverse is the map

P(W ) → [π l , π h ] : Z → {L ı ∪ (Z ∩ H ı ) | ı ∈ I}. Moreover, for π x , π y ∈ [π l , π h ],
where

π x = {X ı | ı ∈ I} and π y = {Y ı | ı ∈ I}, we have π x i ≤ π y iff for each ı ∈ I we have X ı ⊆ Y ı , iff f (π x ) ⊆ f (π y ).
Thus f is an order isomorphism between [π l , π h ], ordered by i ≤, and P(W ), ordered by inclusion. Hence [π l , π h ] inherits the upper and lower semimodularity of P(W ).

Consider finally the inclusion order ⊆. Let π h , π l ∈ Π * (E) such that π l ⊆ π h . The interval [π l , π h ] consists of all partial partitions π such that π l ⊆ π ⊆ π h . The map π → π \ π l is an isomorphism (for the inclusion order) [π l , π h ] → P(π h \ π l ), so [π l , π h ] inherits the upper and lower semimodularity of P(π h \ π l ).

⊓ ⊔

The inclusion-inflating and merging-inflating orders are compound, they rely on two operations for growth, and their covering relation is double, involving two tags (the union of Proof Let π h , π l ∈ Π * (E) such that π l i ⊆ π h . We can write π h = {H ı | ı ∈ I}, and π l = {L ı | ı ∈ J} for some J ⊆ I, where for ı ∈ J we have ∅ = L ı ⊆ H ı and for ı ∈ I \ J we have H ı = ∅; we set L ı = ∅ for ı ∈ I \ J. Each element π of the interval [π l , π h ] takes the form {X ı | ı ∈ K} for some K with J ⊆ K ⊆ I, where L ı ⊆ X ı ⊆ H ı for ı ∈ J and ∅ = X ı ⊆ H ı for ı ∈ K \J; we set X ı = ∅ for ı ∈ I \K. Thus for all ı ∈ I, X ı = supp(π)∩H ı and L ı ⊆ X ı ⊆ H ı ; note however that the empty L ı and X ı are not blocks of π l and π. As with the inflating order in the preceding proof, we define W and f according to [START_REF] Draskovicová | The lattice of partitions in a set[END_REF], then f is a bijection, whose inverse is the map

P(W ) → [π l , π h ] : Z → {L ı ∪ (Z ∩ H ı ) =
∅ | ı ∈ I}. Now f is an order isomorphism between [π l , π h ], ordered by i ⊆, and P(W ), ordered by inclusion, and [π l , π h ] inherits from P(W ) its upper and lower semimodularity, as above. ⊓ ⊔

Write

i,s ≺ for i ≺ ∪ s ≺, the covering relation of i ⊆. Given π, π ′ ∈ [π l , π h ], with X ı = supp(π) ∩ H ı and X ′ ı = supp(π ′ ) ∩ H ı for all ı ∈ I, then π i,s ≺ π ′ means that for a unique  ∈ I we have X ′  = X  ∪ {p} for a point p ∈ H  \ X  , while X ′ ı = X ı for all ı = ; now either X  = ∅ and π s ≺ π ′ (the singleton block {p} is created), or X  = ∅ and π i ≺ π ′ (the block X  is inflated by the point p). Consider now a covering quadrilateral π 0 , π a , π b , π 1 ∈ [π l , π h ], where π a = π b , π 0 i,s ≺ π a i,s ≺ π 1 and π 0 i,s ≺ π b i,s ≺ π 1 . Given X ı = supp(π 0 ) ∩ H ı (ı ∈ I), then π 1 is obtained from π 0 in two possible ways: (a) for a unique  ∈ I, add to X  two points p, q ∈ H  ; or (b) for two distinct , ℓ ∈ I, add to X  a point p ∈ H  and to X ℓ a point q ∈ H ℓ . Then in both covering chains π 0 i,s ≺ π a i,s ≺ π 1 and π 0 i,s ≺ π b i,s ≺ π 1 ,
For the merging-inflating order, we use the following fact from Equation [START_REF] Wilcox | Modularity in the theory of lattices[END_REF] in Theorem 12 of [START_REF] Ronse | Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks[END_REF]:

∀ π 0 , π 1 , π 2 ∈ Π * (E), π 0 ≤ π 1 ≤ π 2 & π 0 mi ≤ π 2 =⇒ π 1 mi ≤ π 2 . (7)
Next, we need the following preliminary result:

Lemma 25 Let π i ∈ Π * (E), i ∈ I, I = ∅, be a non-empty family of partial partitions of E, and let π + be the supremum (complete join) of the π i , i ∈ I, for the standard order. For any π ∈ Π * (E):

1. If π i mi ≤ π for each i ∈ I, then π + mi ≤ π. 2. If π mi ≤ π i for each i ∈ I, then π i mi ≤ π + for each i ∈ I.
Proof By definition of the supremum, we have π i ≤ π + for each i ∈ I. It is well-known that Π(E), ordered by refinement, does not satisfy the lower quadrilateral condition. It follows that the merging and merging-inflating orders on Π * (E), whose restriction to partitions is the refinement order, will not satisfy it.

Discussion, conclusion and perspectives

Semimodularity has been studied in depth in the case of lattices [START_REF] Stern | Semimodular Lattices -Theory and Applications[END_REF]; it takes several forms, which are usually equivalent in the case of lattices of finite length. We have analysed the generalization to posets of the two main forms of semimodularity, the standard one [START_REF] Grätzer | General Lattice Theory[END_REF][START_REF] Stern | Semimodular Lattices -Theory and Applications[END_REF] and the one due to Birkhoff [START_REF] Birkhoff | Lattice Theory[END_REF], called Birkhoff condition [START_REF] Stern | Semimodular Lattices -Theory and Applications[END_REF] or quadrilateral condition [START_REF] Ore | Chains in partially ordered sets[END_REF]. In fact [START_REF] Ore | Chains in partially ordered sets[END_REF] gave a definition for the Birkhoff condition in a poset, which for the first time allowed to obtain equal length for finite maximal chains with same endpoints; then our definition of standard semimodularity in a poset follows the same approach. The two conditions are equivalent in a poset of finite length.

We have thoroughly analysed finite maximal chains (or covering chains) in a poset satisfying either semimodularity or the Birkhoff (quadrilateral) condition; in particular, we get that any two finite maximal chains of same endpoints have the same length.

In order to deal with isomorphism of quotients in composition series and chief series of finite groups, Grätzer and Nation [START_REF] Nation | Revised notes on lattice theory[END_REF][START_REF] Grätzer | A new look at the Jordan-Hölder theorem for semimodular lattices[END_REF] introduced the per-spectivity relation between intervals, and the projectivity equivalence relation generated by it. Our approach based on tagging the covering relation is better adapted to concrete examples, but it is also more flexible: associating a tag to each equivalence class of projectivity, then the upper/lower semimodularity and Birkhoff condition in a lattice give the H-upper/lower semimodularity and quadrilateral condition, see Lemma 3. Now the skew-H-upper (or lower) quadrilateral condition describes a more general situation. We get the poset analogue of the isomorphism theorem of Grätzer and Nation [START_REF] Grätzer | A new look at the Jordan-Hölder theorem for semimodular lattices[END_REF], but also an isomorphism theorem for the skew-H-upper (or lower) quadrilateral condition.

Using the general framework of posets, instead of lattices, has applications in orders that do not constitute lattices, for instance the set of closures ranges of an arbitrary poset [START_REF] Ronse | The poset of closure systems on an infinite poset: detachability and semimodularity[END_REF], and the 5 orders on partial partitions introduced in [START_REF] Ronse | Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks[END_REF]. Moreover, the skew-H-upper quadrilateral condition allows to give the Jordan-Hölder theorem for the inclusion-inflating and merging-inflating orders, for which the perspectivity approach of Grätzer and Nation does not work.

Other definitions of semimodularity in a poset have been given in the literature (in particular in [START_REF] Ronse | The poset of closure systems on an infinite poset: detachability and semimodularity[END_REF]), the most straightforward one consists in removing the condition that a, b, d, u ∈ m ↓ in Definitions 1 and 5 (or the dual condition a, b, d, u ∈ m ↑ for the lower versions). This leads to what we call the unbounded form of semimodularity or quadrilateral condition. The unbounded upper quadrilateral condition has been considered by several authors, in particular Ore [START_REF] Ore | Chains in partially ordered sets[END_REF] called it the "weak quadrilateral condition". The adjective "weak" is a misnomer, since the standard upper quadrilateral condition does not necessarily imply the unbounded one. Obviously when P has the greatest element max, taking m = max in Definitions 1 and 5, our standard conditions imply the unbounded ones.

For an infinite poset without maximal elements, unbounded upper semimodularity does not guarantee equal length for finite maximal chains (i.e., covering chains) having the same endpoints: When each element is bounded by a maximal element, and all intervals have finite length, it is possible to generalize the method used in Lemma 9 and Proposition 10, and obtain from the unbounded upper quadrilateral condition that any two finite maximal chains of the same endpoints have the same length (see also Theorem 5 in [START_REF] Ore | Chains in partially ordered sets[END_REF]). This could be an interesting axis of research.

However our main criticism against the unbounded version is that it leads to bizarre posets, all examples that we saw in practice (see Section 3) satisfy the standard upper or lower quadrilateral condition.

Our work can lead to new directions of research. For instance, a deeper analysis could be made of chain transformations involved in the isomorphism of finite maximal chains, following the method of [START_REF] Ore | Chains in partially ordered sets[END_REF] and its extension in [START_REF] Lane | A conjecture of Ore on chains in partially ordered sets[END_REF]. Also, alternative definitions of semimodularity have been given in the case of lattices, taking a completely different form, in particular those of Mac Lane [START_REF] Lane | A lattice formulation for transcendence degrees and p-bases[END_REF] and Wilcox [START_REF] Wilcox | Modularity in the theory of lattices[END_REF]; they could be generalized to posets.

A disappointing fact is that the Jordan-Hölder theorem in a poset seems much more general than semimodularity or the quadrilateral condition. Indeed, [START_REF] Ronse | Orders on partial partitions based on block apportioning[END_REF] introduced a new operation on partial partitions, block apportioning, which generalizes block merging. The three orders of [START_REF] Ronse | Orders on partial partitions based on block apportioning[END_REF] and two of [START_REF] Ronse | Orders for simplifying partial partitions[END_REF] are based on it, they satisfy the Jordan-Hölder theorem in the finite case, but we have checked that they do not satisfy either the upper or the lower quadrilateral condition, nor even some generalizations of it that we tried.

m≺

  for merging two blocks, i ≺ for inflating a block by a point, or s ≺ for creating a new singleton block. In the case of a lattice, the tagged semimodularity condition will mean that for perspective intervals [a, b] and [c, d] such that a h ≺ b and c k ≺ d, we must have h = k;

Fig. 1 H

 1 Fig. 1 H-upper semimodularity. Here [d, a] m ր H [b, u] and [b, u] H ց m [d, a]. In our Hasse diagrams, dashed lines stand for the order ≤, and plain lines for the covering relation ≺, with the letter h indicating the specialization

Definition 1

 1 The poset P is H-upper semimodular if for any h ∈ H and m ∈ P , given a, b, d ∈ m ↓ such that a ≤ b, d h ≺ a and d ≤ b, there exists u ∈ m ↓ such that a ≤ u and b h ≺ u, see Figure 1. Given h ∈ H, m ∈ P and a, b, d, u ∈ m ↓ such that a ≤ b, d h ≺ a, d ≤ b, a ≤ u and b h ≺ u, we say that the intervals [d, a] and [b, u] are H-perspective under m, that [d, a] is H-up-perspective under m to [b, u], that [b, u] is H-downperspective under m to [d, a], and we write [d, a] m ր H [b, u] and [b, u] H ց m [d, a]. Note that we do not exclude the case where b = d; then we can take u = a; thus for a, d ∈ m ↓ such such that d ≺ a, we have [d, a] m ր H [d, a] and [d, a] H ց m [d, a]. When d < b, we necessarily have a < u.

Definition 2

 2 The poset P satisfies the H-upper unicity if for any h ∈ H and a, b, d ∈ P such that a ≤ b, d h ≺ a and d ≤ b, there is at most one u ∈ P such that a ≤ u and b h ≺ u.

Fig. 2 H

 2 Fig. 2 H-upper quadrilateral condition.

≺ b 1

 1 , b 2 , H-upper unicity implies that b 2 = b 1 , which contradicts the facts that b 2 ≤ c 0 but b 1 ≤ c 0 . Therefore we must have a 1 ≤ c 0 .

Definition 5

 5 The poset P satisfies the H-upper quadrilateral condition if for any h, k ∈ H and m ∈ P , given a, b, d ∈ m ↓ such that a = b, d h ≺ a and d k ≺ b, there exists u ∈ m ↓ such that a k ≺ u and b h ≺ u, see Figure 2.

Definition 7 Fig. 3

 73 Fig.3Skew-H-upper quadrilateral condition.

Fig. 5

 5 Fig. 5 Illustration of Lemma 9, item 1, for n = 4. The arrows indicate H-up perspectivity.

Lemma 9

 9 Let P be a poset satisfying the H-upper quadrilateral condition and let n ≥ 0. 1. Let m ∈ P and a, b, d ∈ m ↓ such that a ≤ b, d ≺ a, d ≤ b and there is a covering chain d = v 0 ≺ • • • ≺ v n = b of length n and of endpoints d, b. Then there exists u

have d h ≺ a and d k ≺ v 1 .≺ w 1 and v 1 h≺ w 1 .Fig. 6

 1116 Fig. 6 Illustration of Lemma 9, item 2, for n = 4. The arrows indicate H-up perspectivity.

  tion gives semimodularity. Let * ≤ be the reflexive and transitive closure of the covering relation ≺; in other words, for any x, y ∈ P , x * ≤ y iff for some n ≥ 0 there is a covering chain x = c 0 ≺ • • • ≺ c n = y (n = 0 when x = y). Lemma 13 The relation * ≤ is a partial order included in the order ≤ and sharing with it the same covering relation ≺. The map ≤ → * ≤ is idempotent, that is, * * ≤ coincides with * ≤. The two orders ≤ and *≤ coincide iff for any x < y there is a finite maximal chain of endpoints x, y (for the order ≤); this holds in particular if all intervals have finite length.Proof Since ≺ is included in ≤, which is reflexive and transitive, the reflexive and transitive closure * ≤ of ≺ will be included in ≤; for x * ≤ y and y * ≤ x we have x ≤ y and y ≤ x, so y = x, and * ≤ is antisymmetric.If x ≺ y, then x * ≤ y and there is no z ∈ P with x < z < y, hence noz ∈ P with x * < z * < y, hence y covers x for * ≤. Conversely, let x * < y; we have x = c 0 ≺ • • • ≺ c n = y for some n > 0; if n > 1, then x = c 0 * < c 1 * < c n = y,so y does not cover x for * ≤; therefore if y covers x for * ≤, then n = 1 and x ≺ y. Since * ≤ has the same covering relation as ≤, the reflexive and transitive closure of that covering relation will be the same for both, that is, * * ≤ coincides with * ≤. Now ≤ and * ≤ coincide iff for any x < y there is a covering chain x = c 0 ≺ • • • ≺ c n = y; it is a maximal chain of endpoints x, y; conversely every finite maximal chain of endpoints x, y is a covering chain. If all intervals have finite length, then for x < y, there is a finite maximal chain of endpoints x, y. ⊓ ⊔ Theorem 14 Write (P, ≤) and (P, * ≤) for the two posets of the set P with the orders ≤ and * ≤ respectively. 1. (P, ≤) satisfies the H-upper quadrilateral condition iff it satisfies the H * -upper condition: for any h ∈ H and m, a, b, d ∈ P such that a, b, d ≤ m, a ≤ b, d h ≺ a and d * ≤ b, there exists u ∈ P such that u ≤ m, a * ≤ u and b h ≺ u. 2. If (P, ≤) satisfies the H-upper quadrilateral condition, then, (P, * ≤) will be H-upper semimodular. 3. In (P, * ≤), H-upper semimodularity, the H * -upper condition, and the Hupper quadrilateral condition are equivalent. Proof 1 Let (P, ≤) satisfy the H-upper quadrilateral condition. Take h ∈ H and m, a, b, d ∈ P such that a, b, d ≤ m, a ≤ b, d h ≺ a and d * ≤ b. There is a covering chain

3 .

 3 and there is a covering chain a = w 0 ≺ • • • ≺ w n = u. Thus a * ≤ u, and as d h ≺ a and [d, a] m ր H [b, u], we get b h ≺ u. Hence we get the H * -upper condition. Conversely, if (P, ≤) satisfies the H * -upper condition, then applying it successively for d h ≺ a, then for d k ≺ b (with u instead of m) will give the H-upper quadrilateral condition. 2. Now consider the H * -upper condition in the special case where a, b, d * ≤ m. As b * ≤ m, b ≺ u and u ≤ m, Proposition 10 (with x = b, z = u and y = m) implies that u * ≤ m. We get thus H-upper semimodularity for * ≤. Given that * * ≤ coincides with * ≤ and that * ≤ has the same covering relation ≺ as ≤, for the order * ≤, H-upper semimodularity becomes identical with the H * -upper condition; applying item 1 for * ≤, the H * -upper condition is equivalent to the H-upper quadrilateral condition. ⊓ ⊔ Combining Theorem 14 with Lemma 13, we obtain the extension to posets of the well-known fact that in lattices where intervals have finite length, upper semimodularity is equivalent to the upper Birkhoff condition: Corollary 15 In a poset where all intervals have finite length, H-upper semimodularity, the H * -upper condition, and the H-upper quadrilateral condition are equivalent.Note that for intervals of infinite length, the converse of item 2 does not hold, the H-upper quadrilateral condition for (P, * ≤) is in general strictly weaker than the same condition for (P, ≤):Example 16 Let P = (N × {0, 1}) ∪ {α, ω}, with the order given by (n, a) < (n ′ , a) for any a ∈ {0, 1} and n, n ′ ∈ N such that n < n ′ , and α < (n, a) < ω for all a ∈ {0, 1} and n ∈ N. We take H = {≺} (no tags). For the order ≤, the only possibility for a, b, d, m ∈ P with a, b, d ∈ m ↓ , a = b, d ≺ a and d ≺ b is d = α, m = ω, a = (0, 0) and b = (0, 1) (or vice versa); then there is no u with a ≺ u and b ≺ u, so (P, ≤) does not satisfy the upper quadrilateral condition. Now for the order * ≤, all covering chains are included in P \ {ω}, so we cannot have a, b, d ∈ m ↓ with a = b, d ≺ a and d ≺ b; thus (P, * ≤) satisfies the upper quadrilateral condition, and by item 3 it is upper semimodular.

1 h≺ c i and d j- 1 h≺

 11 then for some h ∈ H we have c i-d j . In fact, this bijection of intervals corresponds to a permutation π of {1, . . . , n}, with [c i-1 , c i ] being mapped to [d π(i)-1 , d π(i) ].

Fig. 7

 7 Fig. 7 Left: illustration of the argument of Theorem 17. Middle: result of Theorem 17 for n = 3. Right: an H-substitution.

h ≺ c 1 and x k ≺ d 1 . 1 r≺ e 2 and d 1 s≺ e 2 .

 1112 By the skew-H-upper quadrilateral condition, there exist r, s ∈ H such that {h, r} = {k, s}, and e 2 ∈ y ↓ such that c By Proposition 10, there is a covering chain e 2 ≺ • • • ≺ e n = y of length n -2 and endpoints e 2 , y. By the above argument, there is a sequence of H-substitutions transforming

  be the poset of normal subgroups of G, ordered by ≤ (equivalently, by ⊳); then N (G) is a lattice, with A ∧ B = A ∩ B and A ∨ B = AB, and this lattice is modular: given D, U, M ∈ N (G) with D ⊳ U , we have (DM ) ∩ U = D(M ∩ U ). The covering relation ≺ on N (G) if given by A ≺ B iff A ⊳ B and B/A is a simple group. We attach to each covering A ≺ B a tag corresponding to the simple quotient group B/A. For A, B ∈ N (G), (AB)/B is isomorphic to A/(A∩B); thus for any h ∈ H we get A∩B h ≺ A ⇐⇒ B h ≺ AB: the lattice is both H-upper and H-lower semimodular. Now let ⊳⊳ be the transitive closure of the relation ⊳; for A ⊳⊳ B we say that A is a subnormal subgroup of B. Let S(G) be the poset of subnormal subgroups of G.

Proposition 21

 21 The poset Σ(P ) is H-lower semimodular. Proof Let x ∈ P and M, A, B, U ∈ Σ(P ) such that A, B, U ∈ M ↑ , B ⊆ A, A x ≺ U and B ⊆ U . We have x ∈ U and A = U \ {x}; as B ⊆ U but B ⊆ A = U \ {x}, we have x ∈ B. Thus A ∩ B = B \ {x}. As B \ A = {x}, Proposition 20 implies that A∩B ∈ Σ(P ). We have A∩B x ≺ B. As A, B ∈ M ↑ for the inclusion order, we get A ∩ B ∈ M ↑ .

m≺

  on Π(E) extends naturally to Π * (E). Now we define the relation s ≺ on Π * (E) by π 1 s ≺ π 2 if π 2 is obtained by adding a singleton block to π 1 :

22

 22 The standard order on Π * (E) has the covering relation m

  The inclusion, inflating and merging orders are simple, they rely on a single operation for growth, and have an elementary covering relation with exactly one tag (respectively c hence we will consider the non-tagged version of semimodularity. Proposition 23 The merging, inflating and inclusion orders on Π * (E), m ≤, i ≤ and ⊆, are upper semimodular. The inflating and inclusion orders, ⊆ and i ≤, are also lower semimodular.

  in this respect, they are like the standard order, see Proposition 22. Proposition 24 The inclusion-inflating orders i ⊆ is upper and lower semimodular, it satisfies the { i ≺, s ≺}-skew-upper and lower quadrilateral conditions.

1 .

 1 If for each i ∈ I we have π i mi ≤ π, then π i ≤ π, and from the definition of the supremum, we get π + ≤ π. Choose i ∈ I; we have π i ≤ π + ≤ π and π i mi ≤ π, so applying[START_REF] Draskovicová | Congruence relations on the lattice of partitions in a set[END_REF] with π 0 = π i , π 1 = π + and π 2 = π, we get π + mi ≤ π. 2. The blocks of π + are obtained by chaining overlapping blocks of the union of all π i[START_REF] Ronse | Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks[END_REF]; thus each block A ∈ π + must contain a block B ∈ π i for at least one i ∈ I; as π mi ≤ π i , π ⋐ π i , so B contains a block C ∈ π; hence C ⊆ B ⊆ A, and each block of π + contains a block of π, that is, π ⋐ π + . For any i ∈ I we have π mi ≤ π i , so π ≤ π i ≤ π + ; as π ⋐ π + , we get π mi ≤ π + ; applying[START_REF] Draskovicová | Congruence relations on the lattice of partitions in a set[END_REF] with π 0 = π, π 1 = π i and π 2 = π + , we getπ i mi ≤ π + for each i ∈ I. ⊓ ⊔ Proposition 26 The merging-inflating order mi ≤ is upper semimodular, it sat-Let π m , π d , π a , π b ∈ Π * (E) such that π a , π b mi ≤ π m , π a mi ≤ π b , π d i,m≺ π a and π d mi ≤ π b . If we had π a ≤ π b , then we would get π d ≤ π a ≤ π b and π d mi ≤ π b , so (7) would give π a mi ≤ π b , a contradiction. Hence π a ≤ π b . Let π u = π a ∨ π b , the join of π a and π b for the standard order. Applying Lemma 25 with the π i , i ∈ I, being π a and π b , we obtain π u mi ≤ π m (by Item 1 with π = π m ) and π a , π b mi ≤ π u (by Item 2 with π = π d ). Let us show that π b i,m ≺ π u . If π d m ≺ π a , then in the standard order π a covers π d and π d ≤ π b , hence π d = π a ∧ π b , the meet of π a and π b for the standard order; hence Proposition 22 gives π b m ≺ π a ∨ π b = π u . Assume now that π d i ≺ π a ; then π a is obtained by adding to a block D ∈ π d a point p / ∈ supp(π d ). For some B ∈ π b we have D ⊆ B; as π a ≤ π b , p / ∈ B. There are two cases. First, if p / ∈ supp(π b ), then π u = π a ∨ π b is obtained by adding the point p to the block B, so π b i ≺ π u . Second, if p ∈ supp(π b ), then we have p ∈ C for some block C ∈ π b , where C = B; then π u = π a ∨ π b is obtained by merging the two blocks B and C, so π b m ≺ π u . Thus π b i,m ≺ π u in all cases. Therefore mi ≤ is upper semimodular. Consider now the particular case where both π d i,m ≺ π a and π d i,m ≺ π b . Interchanging π a and π b above, we get π a , π b i,m ≺ π u . We remark that for π m ≺ π ′ , we have supp(π) = supp(π ′ ), while for π i ≺ π ′ , we have supp(π) ⊂ supp(π ′ ) and |supp(π ′ )\supp(π)| = 1. Thus |supp(π u )\supp(π d )| is the number of occurrences of i ≺ in both covering chains π d i,m ≺ π a i,m ≺ π u and π d i,m ≺ π b i,m ≺ π u , the number of occurrences of m ≺ being then the complement 2 -|supp(π u ) \ supp(π d )|. Therefore the { i ≺, m ≺}-skew-upper quadrilateral condition is satisfied.⊓ ⊔

Example 27

 27 Consider N with the partial order ⊑ given by x ⊑ y iff 0 ≤ y -x = 1. The covering relation ≺ is given by x ≺ y iff yx = 2 or 3. The order ⊑ is the reflexive and transitive closure of the covering relation ≺ (that is, ⊑ coincides with * ⊑ in the terminology at the end of Subsection 2.2). The poset has unbounded upper semimodularity: if d ≺ a and d ⊑ b, then take u = a + bd, so a ⊑ u and b ≺ u. It does not satisfy the standard upper quadrilateral condition: for a = d + 2, b = d + 3 and m = d + 6, a, b, d ∈ m ↓ , a = b, d ≺ a and d ≺ b, but for a ≺ u and b ≺ u we must have u = d + 5, so u ⊑ m. The two covering chains 0 ≺ 2 ≺ 4 ≺ 6 and 0 ≺ 3 ≺ 6 have the same endpoints, but different lengths.

  the number of occurrences of s ≺ is the number of times that for  or ℓ one goes from the empty set to a singleton block, in other words the number of occurrences of the empty set among X  and X ℓ . Now in each covering chain the number of occurrences of i ≺ is the complement w.r.t. 2. Since π 0 , π a , π b , π 1 ∈ π ↓ h , this gives the {

	i ≺,	s ≺}-skew-upper quadrilateral condition,
	and since π 0 , π a , π b , π 1 ∈ π ↑ l , this gives the {

i ≺, s ≺}-skew-lower quadrilateral condition.