**Updated:** My first post had a mistake because I confused in my mind two different but related sets. Hopefully the description below is correct now.


Let $\Lambda$ be a finite set. Let $\Lambda^{(2)}$ be the set of unordered pairs $\{x,y\}\subset\Lambda$ with $x\neq y$. I will use ${\rm Part}(\Lambda)$ to denote the set of set partitions of $\Lambda$. The polyhedron $K\_1$ I am interested in lives in the vector space
$$
V=\mathbb{R}^{\Lambda^{(2)}}\ .
$$
A vector $v$ is therefore a collection of real numbers $v=(v\_{\{x,y\}})\_{\{x,y\}\in\Lambda^{(2)}}$ indexed by unordered pairs of elements in $\Lambda$, i.e., edges of the complete graph with vertex set $\Lambda$.
To a partition $\Pi\in{\rm Part}(\Lambda)$, let me associate a vector $v\_{\Pi}$ in $V$ whose components $v\_{\Pi,\{x,y\}}$ are, by definition, equal to $1$ if $x,y$ are in the same block of partition $\Pi$, and equal to $0$ otherwise.


**Definition:** The set $K\_1$ is the convex hull of all the $v\_{\Pi}$, with $\Pi\in{\rm Part}(\Lambda)$.


I am also interested in the subset $K\_2\subset K\_1$ which is defined as follows. If $\Pi\_1,\Pi\_2$ are two partitions, we write $\Pi\_1\preccurlyeq\Pi\_2$ if all blocks of $\Pi\_1$ are contained in blocks of $P\_2$, i.e., $\Pi\_1$ refines $\Pi\_2$.
Let $K\_2$ be the set of all convex combinations
$$
\alpha\_1\ v\_{\Pi\_1}+\alpha\_2\ v\_{\Pi\_2}+\cdots+\alpha\_{\ell} \ v\_{\Pi\_{\ell}}
$$
where the $\alpha$'s are nonnegative and add up to $1$, and where
$$
\Pi\_1\preccurlyeq\Pi\_2\preccurlyeq\cdots\preccurlyeq\Pi\_{\ell}
$$
is a chain in the poset $({\rm Part}(\Lambda),\preccurlyeq)$.


An alternate description using real symmetric matrices is as follows. Let $\widetilde{V}$ be the vector space of real symmetric matrices $M=(M(x,y))\_{x,y\in\Lambda}$ with rows and columns indexed by $\Lambda$ (e.g., $\Lambda=[n]:=\{1,2,\ldots,n\}$, for more comfort).
To a $v\in V$ one can associate a matrix $M\in\widetilde{V}$ by letting $M(x,y)=v\_{\{x,y\}}$ if $x\neq y$, and letting $M(x,x)=1$ for all $x\in\Lambda$. Let $\widetilde{K}\_2\subset\widetilde{V}$
be the image of $K\_2$ by the map just defined.
It is not hard to see that the symmetric matrices $M$ in $\widetilde{K}\_2$ are characterized by the following properties.


1. For all $x,y\in\Lambda$, we have $0\le M(x,y)\le 1$.
2. For all $x\in\Lambda$, we have $M(x,x)=1$.
3. For all $x,y,z\in\Lambda$, we have $M(x,z)\ge\min(M(x,y),M(y,z))$.


My coauthor Greg W. Anderson, for the unpublished paper ["Counting colored planar maps free-probabilistically"](https://arxiv.org/abs/1203.3185) (see Section 2.1.1),
called these *co-ultrametrics* because, modulo reversal of inequalities, this is reminiscent of the definition of an ultrametric distance. I love this name very much, but I don't know if there is a standard name already.


**My question:** Did $K\_1$, appear in the literature, and does it have a name like associahedron, permutohedron, ...hedron?
Also, is there a name for $K\_2$ or its avatar $\widetilde{K}\_2$?


**My motivation:**
I am currently teaching a course on mathematical quantum field theory "for undergrads" and will soon need to talk about these sets. I would like to use the most appropriate terminology.



Do this polyhedron and other set have names?
As I said in the comment, it seems to me that your two definitions are not equivalent. For example, the first definition yields a convex set, while the second one does not. I sort of hope and suspect that it is the second one that you want, because it is the more interesting space.


I believe that your second definition describes a space homeomorphic to the geometric realisation of the poset of partitions of $\Lambda$. Let $M$ be a symmetric matrix satisfying your conditions 1-3. Suppose $0\le s \le 1$. Define a relation on $\Lambda$ by saying that $x\sim y$ if $M(x, y)\ge s$. Your conditions guarantee that it is an equivalence relation on $\Lambda$, i.e., a partition. Moreover, if $0\le s\_1\le s\_2\le 2$, then the partition associated to $s\_2$ is a refinement of the partition associated to $s\_1$. It follows that every matrix $M$ satisfying your conditions can be written uniquely as a convex combination of basic matrices associated to a nested chain of partitions of $\Lambda$. This is precisely saying that $\widetilde K$ is homeomorphic to the realisation of the poset of partitions of $\Lambda$.


This is a contractible space, but is not a polyhedron. If it was a polyhedron, then its relative boundary would be homeomorphic to a sphere. As it stands, the boundary is homotopy equivalent to a wedge of sphere.


A couple of comments: First, a similar (but I think not homeomorphic) model for the partition complex was considered by Brenda Johnson in her paper "Derivatives of homotopy theory". This is the first paper where you can see a connection between the partition complex and Goodwillie calculus (but the partition complex is not named explicitly).


Second, this space is also closely related to the space of phylogenetic trees, which was studied for example by Biller, Holmes and Vogtmann in an influential paper called "Geometry of the space of phylogenetic trees".


