MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).
show/hide this revision's text 3 corrected two bad mistakes, not that anyone appears to have read it

This is in some sense following up on my earlier question and the answer given by NN.

I am currently revising the paper which used the condition mentioned in my question. It was pointed out in NN's answer that the concept is an old and standard one, at least to lattice theorists -- namely, it turns out I rediscovered the notion of the "breadth" of a semilattice.

I would like to find references that I can cite for the following facts, both of which appear in my paper in order to provide examples:

  1. The height breadth of a semilattice is less than or equal to its breadthheight.

  2. The width breadth of a semilattice is less than or equal to its breadthwidth.

These are easy to prove: but it seems likely that these should be in one of several compendious works on lattice theory or more general partially ordered sets, and I would like to pay my dues to the literature, as it were. Does anyone know of a reference stating these results explicitly?

Definitions of terms. Let $(P, \preceq)$ be a partially ordered set. The height of $P$ is the sup of the lengths of chains in $P$. The width of $P$ is the cardinality of the largest antichain in $P$ (if it is finite, it is also equal, by Dilworth's theorem, to the minimum "number" of chains in $P$ whose union is all of $P$).

Now suppose $P$ is a meet-semilattice, so that each pair $(x,y)$ of elements has a greatest lower bound $x\wedge y$. The breadth of $P$, as far as I can gather from reading fragments of various papers found by searching online, is defined as follows: let $E$ be a finite subset of $P$, let $E^{[n]}$ be the set of all elements of the form $x_1\wedge \dots \wedge x_n$, and let \[ b(E)=\min\{ n\geq 1 \mid E^{[n]}=E^{[n+1]} \} \leq 2^{|E|}\] Then the breadth of $P$ is the supremum of $b(E)$ as we range over all finite subsets $E\subseteq P$.
show/hide this revision's text 2 added combinatorics tag
show/hide this revision's text 1

references for properties/examples of breadth in (semi)lattices

This is in some sense following up on my earlier question and the answer given by NN.

I am currently revising the paper which used the condition mentioned in my question. It was pointed out in NN's answer that the concept is an old and standard one, at least to lattice theorists -- namely, it turns out I rediscovered the notion of the "breadth" of a semilattice.

I would like to find references that I can cite for the following facts, both of which appear in my paper in order to provide examples:

  1. The height of a semilattice is less than or equal to its breadth.

  2. The width of a semilattice is less than or equal to its breadth.

These are easy to prove: but it seems likely that these should be in one of several compendious works on lattice theory or more general partially ordered sets, and I would like to pay my dues to the literature, as it were. Does anyone know of a reference stating these results explicitly?

Definitions of terms. Let $(P, \preceq)$ be a partially ordered set. The height of $P$ is the sup of the lengths of chains in $P$. The width of $P$ is the cardinality of the largest antichain in $P$ (if it is finite, it is also equal, by Dilworth's theorem, to the minimum "number" of chains in $P$ whose union is all of $P$).

Now suppose $P$ is a meet-semilattice, so that each pair $(x,y)$ of elements has a greatest lower bound $x\wedge y$. The breadth of $P$, as far as I can gather from reading fragments of various papers found by searching online, is defined as follows: let $E$ be a finite subset of $P$, let $E^{[n]}$ be the set of all elements of the form $x_1\wedge \dots \wedge x_n$, and let \[ b(E)=\min\{ n\geq 1 \mid E^{[n]}=E^{[n+1]} \} \leq 2^{|E|}\] Then the breadth of $P$ is the supremum of $b(E)$ as we range over all finite subsets $E\subseteq P$.