The sum of the values of the Möbius function of a poset.
The Möbius function $\mu$ of a finite poset is defined as
$$\mu (x,y)=\begin{cases} 1& \text{if }x = y\\ -\sum _{z: x\leq z < y}\mu (x,z)& \text{for }x < y\\ 0&\text{otherwise}. \end{cases}$$
Since $\mu(x,y)=0$ whenever $x\not\leq y$, this statistic is
$$\sum_{x\leq y} \mu(x,y).$$
If the poset has a minimal or a maximal element, then the definition implies immediately that the statistic equals $1$. Moreover, the statistic equals the sum of the statistics of the connected components.
This statistic is also called the magnitude of a poset.

Return the poset corresponding to the lattice.

Sends a graph to the lattice of its connected vertex partitions.
A connected vertex partition of a graph $G = (V,E)$ is a set partition of $V$ such that each part induced a connected subgraph of $G$. The connected vertex partitions of $G$ form a lattice under refinement. If $G = K_n$ is a complete graph, the resulting lattice is the lattice of set partitions on $n$ elements.
In the language of matroid theory, this map sends a graph to the lattice of flats of its graphic matroid. The resulting lattice is a geometric lattice, i.e. it is atomistic and semimodular.