{'fraction_non_alphanumeric': 0.06701677113332204, 'fraction_numerical': 0.012976452651194308, 'mean_word_length': 3.6503860091381757, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 17, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Stability of characters and filters for weighted semilattices

We continue the study of the AMNM property for weighted semilattices that was initiated in [Cho13]. We reformulate this in terms of stability of filters with respect to a given weight function, and then provide a combinatorial condition which is necessary and sufficient for this “filter stability” property to hold. Examples are given to show that this new condition allows for easier and unified proofs of some results in [Cho13], and furthermore allows us to verify the AMNM property in situations not covered by the results of that paper. As a final application, we show that for a large class of semilattices, arising naturally as union-closed set systems, one can always construct weights for which the AMNM property fails.


Background context
This paper is a sequel to [Cho13], in which the first author studied approximately multiplicative functionals on weighted convolution algebras of semilattices, and the problem of whether all such functionals arise as small-norm perturbations of multiplicative ones.
Banach algebras with such a "stability" property are said to be AMNM [Joh86] or f-stable [Jar97]. When S is a semigroup and ω is a (submultiplicative) weight on S, the AMNM condition on the Banach algebra ℓ 1 ω (S) is equivalent to a kind of "Hyers-Ulam"type stability for C-valued functions on S, where the stability is measured in terms of the weight ω. Hence, one can define the notion of AMNM for the pair (S, ω) directly without relying on the Banach-algebraic concept (see Definition 2.6 and Remark 2.7). Indeed, the present paper has been written so that no Banach algebra theory is required.
In the case where S is a semilattice, a sufficient condition for (S, ω) to be AMNM was given in [Cho13,Theorem 3.14], which covered many natural examples, such as semilattices with finite breadth. However, it was pointed out by the third author in an unpublished communication, that this condition fails to hold for some straightforward examples, such as Example 3.1 below, and so it was clear that the earlier paper left significant room for improvement. For example, is the weighted semilattice in Example 3.1 AMNM?

New work
In this paper we sharpen some of the techniques introduced in [Cho13], and put them in a more systematic framework, to obtain a necessary and sufficient criterion for a weighted semilattice (S, ω) to be AMNM.
As an intermediate step, we observe that it suffices to restrict attention to functions on S with values in {0, 1}, rather than those with codomain C. This was already noted in [Cho13] but we take the opportunity to give some extra details and make some minor corrections. These and other preliminary results are given in Section 2, which also has a brief discussion of characters on semilattices and the corresponding filters.
The discretization procedure mentioned above allows us to change perspective from "character stability" to "filter stability" (with respect to the given weight ω). Our criterion is then an intrinsic characterization of the filter stability property, in terms of a combinatorial property of the pair (S, ω) that we call propagation. The precise statement is given in Theorem 3.7, and most of Section 3 is devoted to setting up the necessary framework.
We highlight two easy applications of Theorem 3.7: (1) It is easy to check that the weighted semilattice described in Example 3.1 has "propagation at all levels". Therefore, by Theorem 3.7, this weighted semilattice satisfies filter stability, and hence is AMNM. Details are given in Section 3.5, which also explains why the results of [Cho13] are insufficient here.
(2) It is also easy to check that if S is a semilattice with finite breadth, then for any choice of weight ω we have propagation at all levels. Hence we can apply Theorem 3.7 once again, to deduce that (S, ω) is AMNM. This was already observed in [Cho13], but Theorem 3.7 provides a unified framework to see why this result holds.
A third application, which requires substantially more work, forms the final main result of our paper (Theorem 4.8); it addresses a question raised in the closing remarks of [Cho13]. Given the result stated above in (2), and given that there is a weighted semilattice (T, ω) which is not AMNM ( [Cho13,Theorem 3.4]), it is natural to ask if every S with infinite breadth can be equipped with some weight ω such that (S, ω) is not AMNM. While we are unable to resolve this question here, we use the "propagation" criterion to obtain a positive answer for a large class of semilattices: namely, those which embed homomorphically into (P fin (Ω), ∪) for some set Ω (the notation is explained at the start of Section 2).

Future work
We would like to extend the construction used to prove Theorem 4.8 to cover all semilattices, not just those S that embed into (P fin (Ω), ∪). This runs into some serious technical obstacles. Most notably, our construction relies on being able to locate finite free subsemilattices of S that fit togther in a well-behaved way; this is possible here because finite free subsemilattices of (P fin (Ω), ∪) only live on a "finite part" of Ω, and hence can be inductively removed without interfering too much with the embedded copy of S.
To move from P fin (Ω) to the full powerset P(Ω), it seems that a deeper study is required of union-closed set systems with infinite breadth, and their possible substructures. We intend to pursue this in greater depth in forthcoming work.

Notational conventions
If A and B are non-empty sets then A B denotes the set of functions B → A; P(B) denotes the powerset of B; and P fin (B) denotes the set of all finite subsets of B.
Some of our later examples are subsets of P fin (Ω) for some non-empty set Ω. When working with those examples, we shall use upper-case calligraphic letters to denote subsets of P fin (Ω), while using letters such as a or E for subsets of Ω; elements of Ω will be denoted by lower-case Greek letters.
If S and T are semigroups then the set of homomorphisms from S to T is denoted by Hom(S, T ). The zero function on a given set will usually be denoted by 0, the domain being clear from context.

Semilattices, characters and filters
We recall some standard definitions, for readers who are not semigroup theorists.
A semilattice is a commutative semigroup S satisfying x 2 = x for all x ∈ S. Such an S has a standard and canonical partial order: if x, y ∈ S we write x y whenever xy = x. It is sometimes useful to read x y as: "x is a multiple of y" or "y is a factor of x". In this language, xy is the "largest common multiple" of x and y.
With respect to , xy is the meet (or greatest lower bound) of x and y; this gives an alternative, order-theoretic definition of a semilattice, as a poset in which every pair of elements has a meet. Both the semigroup definition and the order-theoretic definition fit well with the intuition from the next example.
Example 2.1 (The 2-element semilattice). The set {0, 1}, equipped with usual multiplication, is a semilattice, which we shall denote by 2. (Note that the partial order defined above satisfies 0 1.) If X is a non-empty index set then 2 X , equipped with co-ordinatewise multiplication, is also a semilattice. Each ψ ∈ 2 X can be identified with ψ −1 (1) ⊆ X, and this defines an isomorphism of semilattices 2 X ∼ = (P(X), ∩).
Semilattices of the form (P(X), ∩) are universal in a certain sense. Given a semilattice S, for each x ∈ S let E x = {t ∈ S : t x}. (2.1) The definition of implies that E x ∩ E y = E xy for all x, y ∈ S, and so the function Sch : S → (P(S), ∩) defined by x → E x is a semigroup homomorphism. Since x ∈ E x for all x ∈ S, it is also easily verified that Sch is injective. Thus every semilattice can be represented faithfully as a set system which is closed under binary intersections -or, by taking complements, as a set system which is closed under binary unions. The map Sch has appeared in the literature under various names, such as the Cayley embedding or the Schützenberger representation [GHS09].
We now turn to characters. Let S be a commutative semigroup, and regard C as a semigroup with respect to multiplication. Following the terminology of [HZ56], a semicharacter on S is a semigroup homomorphism S → C which is bounded (equivalently, which takes values in the closed unit disc) and which is not identically zero. The set of semicharacters on S is denoted by S. If S is a semilattice, every semigroup homomorphism S → C takes values in {0, 1}, so using the notation of Example 2.1 we have ( 2.2) It turns out that S is a sub-semilattice of 2 S . This is reminiscent of the situation for abelian groups: non-zero semigroup homomorphisms from an abelian group G to C take values in T, and it turns out that the set of characters G is a subgroup of T G .
Remark 2.2 (Conflicting terminology). In (semi)lattice theory it is more common to call a non-zero homomorphism S → 2 a character of the semilattice S. We will adopt this convention, which fits [HMS73,HMS74]; the remarks above show that the concepts of semicharacter and character coincide for semilattices. We shall reserve "semicharacter" for general commutative semigroups.
Remark 2.3 (Duality theory for semilattices). There is a duality theory for semilattices in which 2 acts as the dualizing object, analogous to Pontrjagin duality for (locally compact) abelian groups where T is the dualizing object. See [HMS74] for further details, with an emphasis on category-theoretic aspects; an accessible précis, without proofs, is provided in [HMS73]. Here, we merely remark that there is a natural embedding g : S → 2 S which sends x ∈ S to x : φ → φ(x); this is essentially the same as the Gelfand representation for the commutative Banach algebra ℓ 1 (S).
As noted above, {0, 1}-valued functions on S correspond to subsets of S. It is standard knowledge in semilattice theory that, under this correspondence, characters on S (viewed as elements of Hom(S, 2)) correspond to filters in S. This perspective was already exploited in [Cho13], and will be pursued more systematically in this paper. We therefore review some of the details for the reader's convenience.
Traditionally, a filter in a semilattice S is defined to be a non-empty subset F which is a subsemigroup (so x, y ∈ F =⇒ xy ∈ F ) and is "upwards-closed" with respect to (so x ∈ S, y ∈ F and xy = y =⇒ x ∈ F ). The second condition is equivalent to xy ∈ F =⇒ x, y ∈ F -we leave the proof to the reader -and so for this paper we adopt the following equivalent definition, which makes the link with characters clearer.
Definition 2.4 (Filters in semilattices). Let S be a semilattice and let F ⊆ S. We say that F is a filter in S if it is non-empty and satisfies The set of all filters in S will be denoted by Filt(S).
It follows that for each X ⊆ S, X is a filter in S if and only if 1 X ∈ S; equivalently, We can use duality theory and the link with filters to give an explanation of the Cayley embedding/Schützenberger representation that was mentioned earlier. Each y ∈ S defines a filter F y = {t ∈ S : t y}, and so y → 1 Fy defines an injective function f : S → S. By restriction, we obtain a homomorphism of semilattices f * : 2 S → 2 S . Then, composing f * with the homomorphism g : S → 2 S from Remark 2.3 yields f * g : S → 2 S ≡ (P(S), ∩). Checking through the definitions, we find that for each Thus f * g is exactly the embedding Sch : S → (P(S), ∩) from before.

AMNM for weighted semilattices
In this section, we set up the notion of AMNM for weighted semilattices in a way that does not require definitions or results from the theory of Banach algebras. We also take the opportunity to make precise some arguments from [Cho13] that were unclear or incomplete as stated there: see Lemma 2.8 and Proposition 2.9 below.
We start in a more general setting. Let S be a semigroup. A weight function on S is a function ω : S → (0, ∞) which is submultiplicative; that is, ω(xy) ≤ ω(x)ω(y) for all x, y ∈ S. We shall often refer to the pair (S, ω) as a weighted semigroup.
Given a weighted semigroup (S, ω) and φ, ψ ∈ C S , we define: where in the last definition we view C as a multiplicative semigroup. Note that in all three definitions we allow the value +∞. def ω (ψ) and dist ω (ψ) give two different ways to quantify the failure of ψ to be a homomorphism; the first has a "local" flavour and the second has a "global" flavour. We shall sometimes refer to def ω (ψ) as the ω-defect of ψ.
As in [Cho13], we say that ψ ∈ C S is ω-bounded if sup x∈S |ψ(x)|ω(x) −1 < ∞. The following lemma is not needed for the eventual application to semilattices, but we include it for sake of completeness and for possible use in future work.
This follows from a technique known in the Banach-algebraic setting [Jar85,Prop. 5.5]. To make this paper more self-contained we provide a full proof, adapted from parts of the proof in [Jar85].
Taking the supremum over all s yields The lemma may fail if we drop the assumption that ψ is ω-bounded. For instance, take S = N with usual addition, take ω ≡ 1, and let ψ(n) = 2 n . Then ψ is clearly not ω-bounded, yet def ω (ψ) = 0.
The following terminology is modelled on the corresponding terminology for Banach algebras, as found in [Jar97] or [Joh86].
Remark 2.7. Given a weighted semigroup (S, ω), we can form the associated weighted convolution algebra ℓ 1 ω (S). Then (S, ω) is AMNM if and only if ℓ 1 ω (S) has the Banachalgebraic AMNM property of [Joh86]. The proof of this equivalence is merely an exercise in translating the definitions, together with some standard properties of the ℓ 1 -norm; details can be found in [Cho13, Section 2.2].
We now specialize to the setting where S is a semilattice. Note first that if ω is a weight function on a semilattice, we have ω( Another special feature is that we can improve on Lemma 2.5. The following lemma plugs a small gap in the statement/proof of [Cho13,Corollary 3.7]. Lemma 2.8. Let (S, ω) be a weighted semilattice and let ψ ∈ C S . Then Proof. Without loss of generality, assume def ω (ψ) < ∞. Let s ∈ S. Arguing similarly to the proof of Lemma 2.5, we obtain and hence (again following the proof of the earlier lemma) as required.
The following result is essentially the same as [Cho13,Corollary 3.7], phrased in different language. However, the proof there was left to the reader, and as mentioned above there was a missing step glossed over. We take this opportunity to provide a slightly weaker but more precise statement, with a complete proof.
Proposition 2.9 (Discretizing the AMNM problem for weighted semilattices). Let (S, ω) be a weighted semilattice. The following are equivalent: Proof. The equivalence of (ii) and (iii) is routine. The implication (i) =⇒ (ii) follows directly from the definitions and the fact that 1 G is ω-bounded for all G ⊆ S (since ω ≥ 1).
Conditions (ii) and (iii) can be viewed as a kind of "filter stability" property relative to the weight function ω, and for the rest of this paper we shall work exclusively with the perspective of subsets of S rather than functions on S.
3 Characterizing stability of filters

Initial remarks
In this section we shall derive an intrinsic, combinatorial characterization of when a given (S, ω) has "stable filters" in the sense of Proposition 2.9(ii). The precise statement of our characterization is given as Theorem 3.7, and we shall build up to it in stages.
It will be convenient for later examples if we switch to working with log-weights, by which we mean functions λ : S → [0, ∞) that satisfy λ(xy) ≤ λ(x) + λ(y) for all x, y ∈ S. Given such a λ and L ≥ 0, we define W L (S, λ) = {x ∈ S : λ(x) ≤ L}. When there is no danger of confusion we abbreviate this to W L .
Example 3.1. Let Ω be a non-empty set. P fin (Ω) is a semilattice with respect to binary union. The function x → |x| is a log-weight on (P fin (Ω), ∪), and If we fix r ∈ (1, ∞), the function ω r : x → r |x| is a weight on (P fin (Ω), ∪).
By varying the "level" L we obtain a useful filtration of S. Intuitively, we think of two given sets as "agreeing at level L" when they have the same intersection with W L .

Characterizing sets on which dist ω is small.
As a first step towards Theorem 3.7, we show that given two subsets E 1 , E 2 ⊆ S, d ω (E 1 , E 2 ) is small precisely when E 1 and E 2 "agree at level L" for some large value of L.
If E ⊆ S, let fil(E) denote the filter-or-empty-set generated by E, i.e. the intersection of all X ⊆ S such that X ∈ Filt(S) ∪ {∅} and X ⊇ E. Note that fil(E) = ∅ if and only if E = ∅.
Summarizing: if E agrees with some filter-or-empty-set at level L, it agrees with the particular filter-or-empty-set fil(E ∩W L ) at level L. Hence, in view of Lemma 3.2, dist ω (E) is small if and only if E agrees with fil(E ∩ W L ) at level L for some large L.

Characterizing sets with small ω-defect
Let X ⊆ S be non-empty. Note that if x, y ∈ X and z xy (that is, z is a factor of xy) then z ∈ fil(X). Moreover, every z ∈ fil(X) satisfies z x 1 · · · x k for some x 1 , . . . , x k ∈ X.
Definition 3.4 (fbp C -stability). Let C ≥ 0. For X ⊆ S we define fbp C (X) := {z ∈ W C : there exist x, y ∈ X ∩ W C such that z xy} .
(3.1) (fbp stands for "factors of binary products".) Note that fbp C (∅) = ∅. We always have fbp C (X) ⊇ X ∩ W C ; if equality holds, we say that X is fbp C -stable.
X is fbp C -stable if and only if fbp C (X) ⊆ X: the "only if" direction is trivial, and the "if" direction holds because fbp C (X) ⊆ W C for any X ⊆ S.

Proof. (i) Assume
X is fbp C -stable, and let x, y ∈ S. We consider two cases.
Case B: λ(x) + λ(y) ≤ C. In this case x, y and xy all belong to W C . Since X is fbp C -stable: -if x and y are in X, then xy ∈ fbp C ({x, y}) ⊆ fbp C (X) ⊆ X; -if xy lies in X, then both x and y belong to fbp C ({xy}) ⊆ fbp C (X) ⊆ X.
Putting Case A and Case B together, we see that def ω (X) ≤ e −C .
(ii) If X ∩ W C = ∅ then we are done. So suppose X ∩ W C = ∅. Let x, y ∈ X ∩ W C , and let z ∈ W C with z xy. Then and both are strictly less than 1 if def ω (X) < δ and C ≤ log(δ −1/3 ).
Since 1 X (x) = 1 = 1 X (y), the first formula in ( * ) implies 1 X (xy) = 1; feeding this into the second formula yields z ∈ X. Therefore fbp C (X ∩ W C ) ⊆ X ∩ W C , and the converse inclusion is trivial.
Summarizing: a subset of S has small ω-defect precisely when it is fbp C -stable for some large value of C.

fbp C -stability and propagation
An obvious way to obtain fbp C -stable sets is by iteration. Given E ⊆ S, put fbp 0 Even when S is finite, the second inclusion in (3.2) can be proper, as we will see in Example 4.2. On the other hand, if E is non-empty and z ∈ fil(E), there always exists some C ≥ 0, possibly depending on z, such that z ∈ fbp ∞ C (E). (For instance, if x 1 , . . . , x k ∈ E and z x 1 · · · x k then C = max{ k i=1 λ(x i ), λ(z)} suffices.) This leads naturally to the following definition.
We make some observations for future reference: • If (S, λ) propagates at a level L, then it also does so at every lower level.
• In the formula defining L-propagation, we could restrict E to the finite subsets of W L without altering the value of the double supremum.
We can now state and prove the promised characterization of "filter stability".
Theorem 3.7. Let (S, ω) be a weighted semilattice and let λ = log ω. The following conditions are equivalent.
Proof. The equivalence of (i) and (ii) was proved in Proposition 2.9. The equivalence of (ii) and (iii) has been demonstrated in the previous two subsections: specifically, one combines Lemma 3.2, Remark 3.3 and Lemma 3.5 with some standard epsilon-delta book-keeping. Suppose that condition (iv) holds. Let L ≥ 0. Then we may choose C ≥ L such that V G (z) ≤ C for all G ⊆ W L and all z ∈ fil(G) ∩ W L . Let E ⊆ S be fbp C -stable and put G = E ∩ W L . By our choice of C and the definition of V G (z), But since E is fbp C -stable the right-hand side is contained in E. Hence fil(E ∩W L )∩W L ⊆ E ∩ W L , and the converse inclusion is trivial. Thus condition (iii) holds. Conversely, suppose Condition (iii) holds. Let L ≥ 0 be arbitrary, and choose C ≥ 0 with the property stated in (iii). Let E ⊆ W L . Put K = max(L, C). Since C ≤ K, it follows from the definitions that every fbp K -stable set is fbp C -stable. In particular, fbp ∞ K (E) is fbp C -stable, so by the property stated in (iii), . This shows that the double supremum in (3.4) is ≤ K, hence finite; so (S, λ) has L-propagation, and (iv) holds.

An example where our theorem improves on earlier results
In the language of the present paper, [Cho13,Theorem 3.14] may be restated as follows. Let (S, ω) be a weighted semilattice, with λ = log ω, such that for each L ≥ 0, λ is bounded on the subsemilattice generated by W L (S, λ). (♦) Then (S, ω) is AMNM. Consider the semilattice S and log-weight λ from Example 3.1. That is, S = (P fin (Ω), ∪) for some nonempty set Ω, and λ(x) = |x| for x ∈ S. Since {γ} ∈ W 1 for each γ ∈ Ω, the subsemilattice generated by W 1 is {x ∈ S : x = ∅}. Hence the condition in (♦) fails for L = 1, and [Cho13, Theorem 3.14] cannot be applied. On the other hand, we will now show that (S, λ) has L-propagation for all L ≥ 0. Putting ω = exp λ, it follows from Theorem 3.7 that (S, ω) is AMNM.
Our task will be made slightly simpler using two preliminary observations: • we only need to verify L-propagation for all L ∈ N; • we only need to check the supremum in (3.4) for finite subsets of W L .
(For the justification, see the remarks following Definition 3.6.) Let L ∈ N, and let E be a non-empty finite subset of W L . Put a = x∈E x, which is finite and non-empty. A straightforward argument shows that fil(E) = P(a), so that fil(E) ∩ W L = {z ⊆ a : |z| ≤ L} .
If z ⊆ a then there exist x 1 , . . . , x k ∈ E such that z ⊆ x 1 ∪ . . . ∪ x k ; moreover, if |z| ≤ L then we can always choose k ≤ L. Therefore, V E (z) ≤ L 2 for all z ∈ fil(E) ∩ W L . Since this upper bound holds for all finite non-empty E ⊆ W L , (S, λ) propagates at level L, just as we claimed.

Breadth and propagation
The following is a small variation on the previous example.
Example 4.1 (Free semilattices). Let Ω be a non-empty set, and let P fin * (Ω) denote the set of finite non-empty subsets of Ω. Equipped with binary union, P fin * (Ω) is a semilattice, which we refer to as the free semilattice generated by Ω.
This terminology is justified by the following universal property: for any semilattice S and any function f : Ω → S, there is a unique homomorphism f : (P fin * (Ω), ∪) → S that extends f , defined by f (a) = γ∈a f (γ).
When Ω 00 is a finite, non-empty set, we write P * (Ω 00 ) instead of P fin * (Ω 00 ). Semilattices of the form (P * (Ω 00 ), ∪) were used in [Cho13,Theorem 3.4] as the building blocks for a weighted semilattice (T, ω) that does not have the AMNM property. The new notion of propagation gives a very natural viewpoint on this construction, with the key details demonstrated in the following example.
Intuitively, for this log-weight, the constraint in the fbp C operation that we can only multiply elements of log-weight ≤ C creates a barrier separating us from Ω 00 , even though Ω 00 itself has small log-weight.
The previous example suggests that to construct log-weights on a given S for which propagation fails, we should look for isomorphic copies of (P * (Ω 00 ), ∪) inside S. If E ⊂ S is a finite subset, with ι E : E → S being the inclusion map, consider ι E : P * (E) → S, in the notation of Example 4.1. ι E maps P * (E) onto E , the subsemigroup of S geneated by E; it is injective if and only if E has maximal cardinality |P * (E)| = 2 |E|−1 .
Definition 4.3. Let S be a semilattice. Given a finite, non-empty subset E ⊆ S, we say E is compressible if there exists a proper subset E ′ ⊂ E such that x∈E x = x∈E ′ x; otherwise, we say E is incompressible.
It is a straightforward exercise to show that E is incompressible if and only if E : P * (E) → S is injective (c.f. Exercise 6(c) of [Bir67,Section II.5

]).
Remark 4.4 (Comparison with older terminology). Our terminology is not entirely standard; the same property is referred to in [LLM77,Mis86] as "meet irredundant". However, for examples which arise as subsemilattices of (P(Ω), ∪), as in the next section, the canonical partial order is not given by inclusion but by containment: a b ⇐⇒ a ⊇ b; and the "meet" of a and b with respect to is not a ∩ b, but rather a ∪ b. In other words, for natural examples we want to consider, the product operation is naturally viewed as a join rather than a meet, and the terminology "incompressible" seems more appropriate. The breadth of a semilattice sheds some light on its structure, and is related to more familiar order-theoretic concepts such as height and width. For instance, suppose br(S) ≥ n. By examining incompressible subsets, one sees that S contains a chain (totally ordered subset) and an antichain (subset in which no two elements are comparable) both of cardinality n; see [ADH + 13, Section 4.1] for further details and some references. In particular, a semilattice S has breadth 1 exactly when the poset (S, ) is totally ordered.
Diverse behaviour occurs even among semilattices of breadth 2. For instance, the following example shows that every infinite k-ary rooted tree (k ≥ 2) is a semilattice with breadth 2 that contains infinite chains and infinite antichains.
Example 4.6. Let k ≥ 2. An infinite k-ary rooted tree is an infinite rooted tree in which every vertex has k children. If x and y are vertices in the tree then they have a "youngest" common ancestor, which we denote by x ∧ y. Clearly ∧ is a commutative, associative and idempotent binary operation; so the set of vertices becomes a semilattice (T, ∧), and the partial order becomes "is an ancestor of".
There is an infinite path P ⊂ T obtained by starting at the root and successively taking one of the children; this gives us an infinite chain in (T, ). If for each element of P we then take one of its children that is not in P , then the collection obtained is an infinite antichain in (T, ).
Let x, y, z ∈ T , and let p = x ∧ y ∧ z. Then either x ∧ y or y ∧ z is equal to p: for if not, the set {p, x ∧ y, y ∧ z, y} would form a cycle of length ≥ 3 in the tree T , which is impossible. Thus every 3-element subset of S is compressible, and so br(S) ≤ 2. On the other hand, br(S) ≥ 2, since S is not totally ordered.
Remark 4.7. Suppose S is a semilattice with finite breadth. It was originally shown in [Cho13,Example 3.13 and Theorem 3.14] that in this case, (S, ω) is AMNM for every weight function ω. With the tools of the previous section, we can give an alternative approach to this result. Let n = br(S), and let E be a finite subset of S.
As observed in the remarks before Definition 3.6: if x 1 , . . . , x k ∈ E and z is a factor of x 1 · · · x k , then for any C ≥ max{ k i=1 λ(x i ), λ(z)} we have z ∈ fbp ∞ C (E). But since br(S) = n, every z ∈ fil(E) is a factor of x 1 · · · x k for some x 1 , . . . , x k ∈ E with k ≤ n. It follows that whenever E ⊆ W L , V E (z) ≤ nL for all z ∈ fil(E) ∩ W L , and therefore (S, λ) propagates at level L for any L ≥ 0 and any log-weight λ. Now we can apply Theorem 3.7.
Motivated by this result, it is natural to ask the following question, which was raised implicitly in [Cho13, Section 6].
Question. Let S be a semilattice with infinite breadth. Does there exist a log-weight on S for which propagation fails at some level?
At present, we do not have an answer in full generality. However, when S is (isomorphic to) a sub-semilattice of (P fin (Ω), ∪), the answer is positive. This is the final main result of our paper.
Theorem 4.8. Let Ω be a non-empty set, and let S ⊆ P fin (Ω) be closed under binary union. If (S, ∪) has infinite breadth, then there is a log-weight on S which fails 1-propagation. Proof. Let x, y ∈ P fin (Ω). Since N (x ∪ y) ≥ max(N (x), N (y)), we have D N (x∪y) ⊇ D N (x) ∪ D N (y) .
Lemma 4.13. Let n ≥ 2 and let z n := join(F n ) ∈ S. Let C ≥ 0 be such that z n ∈ fbp ∞ C (F n ). Then 2C ≥ |E n | = n.
Proof. Let m ∈ N be minimal with the following property: there exists some y ∈ fbp m C (F n ) such that y ⊇ E n . This is well-defined, since z n ⊇ E n (as observed in the proof of Proposition 4.10) and z n ∈ fbp ∞ C (F n ) by assumption. By definition of fbp C , there exist x 1 , x 2 ∈ fbp m−1 C (F n ) such that x 1 ∪ x 2 ⊇ y ⊇ E n . We claim that x i ⊇ E n for i ∈ {1, 2}: -if m ≥ 2, the claim follows from minimality of m; -if m = 1, the claim holds because fbp 0 C (F n ) ⊆ F n and for each x ∈ F n , |x ∩ E n | = 1 while |E n | = n ≥ 2. Therefore, r(x i ) ⊇ E n ∩ x i = ∅, for i ∈ {1, 2}, and so 2C ≥ η(x 1 ) + η(x 2 ) ≥ |E n ∩ x i | + |E n ∩ x 2 | ≥ |E n ∩ (x 1 ∪ x 2 )| = |E n | as required.
The third author acknowledges the financial supports of a Fast Start Marsden Grant and of Victoria University of Wellington to attend both meetings. Further work was done during the second author's visit to Lancaster University in November 2014, which was supported by a Scheme 2 grant from the London Mathematical Society (reference 21313). She thanks the Department of Mathematics and Statistics at Lancaster for their hospitality.
The first author thanks B. Horváth and N. J. Lauststen for discussions in recent years concerning AMNM phenomena, and for their encouragement to write up the results presented here. The second author also acknowledges support from National Science Foundation grant DMS-1902301 during the preparation of this article.