  We provide a naturally isomorphic description of the persistence map from
merge trees to barcodes in terms of a monotone map from the partition lattice
to the subset lattice. Our description is local, which offers the potential to
speed up inverse computations, and brings classical tools in combinatorics to
bear on an active area of research in topological data analysis (TDA).
