On merge trees and discrete Morse functions on paths and trees

In this work we answer an open question asked by Johnson–Scoville. We show that each merge tree is represented by a discrete Morse function on a path. Furthermore, we present explicit constructions for two different but related kinds of discrete Morse functions on paths that induce any given merge tree. A refinement of the used methods allows us to define notions of equivalence of discrete Morse functions on trees which give rise to a bijection between equivalence classes of discrete Morse functions and isomorphism classes of certain labeled merge trees. We also compare our results to similar ones from the literature, in particular to work by Curry.


Introduction
Discrete Morse theory is a combinatorial version of the classical smooth Morse theory.It was originally developed by Forman in [For98].
In discrete Morse theory, topological properties of simplicial complexes X are analyzed by considering discrete Morse functions f : X → R.These topological properties can in turn be used to obtain cell decompositions of X with fewer cells.A good introduction to the topic is found in [For01].
Merge trees are used in Morse theory in order to keep track of the development of connected components of sublevel sets X a := f −1 (−∞, a] of a given Morse function f : X → R. Since the sublevel sets form a filtration of X, merge trees can be seen as a combinatorial description of the persistent connectivity of X.In particular, every branching in the induced merge tree M(X, f ) corresponds to a pair of connected components of a sublevel set X a−ε that merge to one connected component in a sublevel complex X a of higher level.
Initially, merge trees were introduced to topological data analysis as an approximation to the Reeb graph, respectively contour tree, in [CSA03].The Reeb graph is a graph that keeps track of the connected components of level sets of any given filtered manifold.In applications, the data set is often interpreted as a sampling of the graph of a function rather than a more general manifold, which is why the Reeb graph is often actually a tree, the so-called contour tree.
Among other implementations of techniques of smooth Morse theory, computational methods for the Reeb graph have originally been introduced in [SKK91] in order to handle surfaces embedded in 3D with the help of computers.Later on, several ways to compute and apply contour trees of data sets have been discussed in many articles, e.g.[KK94], [vKvOB + 97], [TV98], and [CSA03].Among other applications, merge trees have been used in visualization, e.g. in [OHWS13], [WBP07], [OHW + 17], and [YWM + 19].Surveys about applications of merge trees and other concepts in visualization can be found in [HLH + 16] and [LMW + 16].Furthermore, a certain version of chiral merge trees has been used in [Bar19] to analyze asymmetries of time series.
We focus on the more structural and theoretical side of merge trees, in particular the connection to discrete Morse theory.We consider a specific construction for merge trees induced by discrete Morse functions on trees which was introduced in [JS22].We use this construction to gain a better understanding of the set of discrete Morse functions, the set of merge trees, and the relationship between the two.
Similar work has been done in [Cur19] for the relationship between Morse-like functions on the interval and a related version of merge trees.Furthermore, our work is in some sense similar to parts of [CDG + 21], with the difference being that the authors of [CDG + 21] consider the relationship between merge trees and their induced barcodes instead.It seems reasonable to adapt the following terms from both of these articles and say that we consider a different instance of the "fiber of the persistence map", respectively a different instance of the "inverse problem" of the "persistence map".These names refer to the fact that merge trees and barcodes are invariants of filtered spaces rather than just spaces.In this context, the name "persistent" became popular due to persistent homology as it appears in topological data analysis.Similar to the authors of [Cur19] and [CDG + 21], we are interested in finding out what information is lost by considering our invariant at hand, the induced merge tree, instead of the given data, in our case a discrete Morse function, and how this information might be re-obtained.Such knowledge might be helpful to investigate the space of merge trees and the space of discrete Morse functions in future work.Furthermore, a good understanding of the fiber of the persistence map is useful for topological data analysis because it hints at features which might be lost due to the chosen invariant.Moreover, insights about the inverse problem might be helpful to enhance the chosen invariant in a way such that it preserves certain desired features of the data set.
We respond to an open question asked in [JS22] by showing that every merge tree is represented by a discrete Morse function (dMf).In particular, for any given merge tree we construct a dMf on a path as a representative of the isomorphism class defined by said merge tree: Theorem 6.5.Let T be a merge tree.Then there is a path P such that T ∼ = M(P, f io ) ∼ = M(P, f sc ) holds as merge trees where f io denotes the induced index-ordered dMf (Definition 4.20) and f sc denotes the sublevel-connected dMf (Definition 5.5) on P .
In particular, the discrete Morse function from Theorem 6.5 can be chosen to be index-ordered (Definition 3.1) or sublevel-connected (Definition 3.31).
The main tool for the construction is the corresponding Morse order (Definition 4.3), that is, the index Morse order (Definition 4.3) or the sublevel-connected Morse order (Definition 3.31) on the nodes of a given merge tree T .The index Morse order defines leaf nodes to be strictly less than inner nodes.Among leaf nodes and among inner nodes, the index Morse order is defined by using a twisted version of lengthlexicographical order on the set of path words (Lemma 4.16) that correspond to the respective nodes.The path words are defined by the chirality of the nodes of the shortest path from the root to the corresponding node.For the sublevel-connected Morse order (Definition 5.1) we do not artificially distinguish between leaf nodes and inner nodes.
We use the index Morse order (Definition 4.3) to define the index Morse labeling (Definition 4.7) on the nodes of T .Together with the simplex order (Definition 4.11), which establishes a correspondence (Remark 4.18) between the nodes of T and the simplices of a path P , the index Morse labeling defines the induced index-ordered discrete Morse function on said path P .
In Section 3.2 we introduce several kinds of equivalence relations on the sets of discrete Morse functions with only critical cells on paths and trees.These equivalence relations allow us to identify equivalence classes of discrete Morse functions with isomorphism classes of Morse labeled merge trees: Theorem 6.4.The induced labeled merge tree M( , ) and the induced dMf Φ define maps M( , ) : DMF crit P ← → MlT : Φ that are inverse to each other in the sense that: (1) for a dMf (P, f ) with only critical cells, the dMf Φ(M(P, f ), λ f ) is symmetryequivalent to (P, f ), and (2) for an Ml tree (T, λ), the Ml tree M(ΦT, f λ ) is isomorphic to (T, λ).
The construction of the discrete Morse function induced by a Morse labeling is similar to the construction of functions on the interval in [Cur19].In particular, Theorem 6.4 is very similar to the result [Cur19,Prop 6.11].The use of Morse labelings in this work basically plays the role of the function π : T → R from [Cur19].Moreover, the simplex order is almost the same as the use of chirality in [Cur19,Lem 6.4].But in this work, Morse orders, and in turn Morse labelings, have to satisfy a certain compatibility with the chirality, that is, property (2) of Definition 3.17.
The notion of merge trees we use originates from [JS22, Def 5] and differs from the one used in [Cur19]: A priori, merge trees T in the sense of [JS22] do not carry a height function T → R as part of their data.Instead, the two children of each node have a chirality assigned to them as part of the tree's data.This means that for any two child nodes of the same parent node, it is specified as part of data which is the right and which is the left child.This version of chirality is also canonically assigned to merge trees induced by discrete Morse functions.In contrast, the chirality of chiral merge trees in the sense of [Cur19] arises from a chosen orientation on the interval.We obtain a similar correspondence between the chirality of merge trees and orientations on paths using the simplex order, Definition 4.11.Apart from these differences, the notion of merge trees in the sense of [JS22] is closely related to the one from [Cur19].Chirality in the sense of [JS22] is a specific version of the notion of chirality used in [Cur19].In order to see this, we show that the construction of the merge tree M(X, f ) induced by a discrete Morse function f in the sense of [JS22] can be modified, see Proposition 3.20, to obtain a function T → R from f , similarly to [Cur19].This gives rise to the notion of Morse labelings, Definition 3.19, and Morse orders, Definition 4.3.It turns out that the use of chirality in [JS22] assumes a certain compatibility between Morse orders and the simplex order, whereas the use of chirality in [Cur19] does not.As a result, the induced merge tree in the sense of [Cur19] distinguishes between symmetry equivalences, Definition 3.42, whereas the induced merge tree in the sense of [JS22] identifies symmetry-equivalent discrete Morse functions with each other, see Proposition 3.48.We discuss this in a bit more detail at the end of Section 6.
In said discussion, we mention the notion of CMl trees, see Definition 6.9, which is as objects basically the same as the notion of merge trees from [CDG + 21, Def 2.2].However, the notion of combinatorial equivalence of labeled merge trees from [CDG + 21, Def 2.6] corresponds to a non-chiral version of shuffle equivalence Definition 3.24 rather than an equivalence of the induced persistent set as in [Cur19, 5.1], which is more similar to an isomorphism of Ml trees Definition 3.23.The chiral merge trees from [Bar19, Def 2.1] are as objects also very similar to the chiral merge trees from [Cur19] and, thus, differ similarly from our notion of labeled merge trees.
The aforementioned versions of labeled merge trees all have in common that their labelings need to be compatible with some other data inherent to the merge tree.In contrast to that, the labelings from [YWM + 19] can be quite arbitrary and might even assign multiple labels to a single node.Hence, our Ml trees a priori seem to be unrelated to the notion of labeled merge trees from [YWM + 19].
Acknowledgements.The author would like to thank Benjamin Johnson and Nicholas A. Scoville for the suggested questions in their article [JS22] which led to this project.Furthermore, the author would like to thank the mathematical faculty of Ruhr-University of Bochum, especially the chair for topology, for the great scientific environment in which this endeavor was started.In addition to that the author thanks Max Planck Institute for Mathematics for the great scientific environment in which this project was finished.
Most notably the author thanks his advisor, Viktoriya Ozornova, for her advice and the many helpful discussions which increased the quality of this article.Last but not least, the author thanks the anonymous referees for the helpful and detailed feedback.

Conflict of Interest Statement
The author states that there is no conflict of interest.

Preliminaries
We consider discrete Morse functions (dMf) on trees.Recall that trees are finite acyclic simple graphs.Furthermore, simple graphs are 1-dimensional simplicial complexes.Where feasible, we introduce the preliminaries in the broader generality they are usually defined in, rather than in the lesser generality we actually need for this work.We adapt most notations and conventions from [JS22].For simplicity, we assume all trees in this article to be non-empty.Similar to [JS22], we assume the dMfs to fulfill certain generic properties.In detail this means the following : Definition 3.1.Let X be a simplicial complex.A map f : X → R is called a discrete Morse function (dMf ) if it fulfills the following properties for any pair of simplices σ, τ ∈ X: Simplices on which f is 1−1 are called critical.Simplices which belong to the preimage of the same value are called matched.The set of critical simplices is denoted by Cr(f ).Values of critical simplices under f are called critical values of f .A dMf is called index-ordered if for arbitrary critical simplices σ, τ the following holds: If dim(σ) is smaller than dim(τ ), then f (σ) < f (τ ) holds.
Remark 3.2.The definition given above is not the most general definition of dMfs but rather assumes several generic properties.This means that any dMf in the sense of [For98] can be modified by a Forman equivalence (see [JS22,Def 4.1]) to fulfill these properties, that is, without changing the induced Morse matching.As usual in the context of dMfs, we write f : X → R although the map f is actually defined on the face poset of X.
In [NTT18], a similar generic property is used to analyze flow paths induced by dMfs.The notion of faithful dMfs as defined in [NTT18, Def 2.9] is almost the same as index-ordered dMfs in this article.The only difference is that for index-ordered dMfs matched cells have the same value, whereas for faithful dMfs the values of the matched boundary simplices are higher than the values on the corresponding matched co-boundary simplices.
Furthermore, since simple graphs and in particular trees are examples of simplicial complexes, the definition of dMfs can be applied to them as well.
Remark 3.3.Because f maps Cr(f ) injectively into a totally ordered set, it induces a total order on Cr(f ).We refer to this induced order whenever we speak of simplices being ordered by f .Notation 3.4.We use the following conventions regarding notation: • We depict dMfs on graphs by labeling the graph with the values of the dMf.
• Let G be a graph and let v be a node of G.By G[v] we denote the connected component of G which contains v.
• Let X be a simplicial complex, f : X → R a dMf and a ∈ R. The sublevel complex of level a, denoted by X f a , is defined by Within this chain, we refer by X f c i −ε to the complex that immediately precedes X c i .
Remark 3.6.The given definition of sublevel complexes differs from the standard one used in the literature.We make use of the fact that a dMf f being weakly increasing implies that X f a as defined above is already a subcomplex of X.If we wanted to consider the general definition of dMfs as introduced in [For98], we would have to work with the smallest supercomplex of X f a in X instead.Taking the smallest supercomplex corresponds to additionally including all faces of simplices of X f a to make X f a a simplicial complex.
Lemma 3.7.Let X be a finite simplicial complex and let f : X → R be a dMf.Then f attains its minimum on a critical 0-simplex.Furthermore, the statement also holds for the restriction to any connected component of sublevel complexes.Sketch of Proof.The statement follows by a proof by contradiction and properties (i) and (ii) of Definition 3.1.
Remark 3.8.The analogous statement for the maximum of a dMf f on arbitrary 1simplices is false, as the following example shows: Here, the maximum is attained on a pair of matched simplices.
3.1.Merge Trees.We briefly recapture preliminaries about merge trees as they are explained in [JS22].The basic idea is that merge trees keep track of the chronological development of the connected components of sublevel sets.We adapt the point of view of [JS22], that is, we consider them 'upside down'.Thus, the children will appear above their parent node.Afterwards we introduce additional structure that dMfs induce on their corresponding merge trees and consider notions of equivalence which arise from that structure.
Definition 3.9 (Merge Tree).A merge tree is a full rooted chiral binary tree T .In detail this means that T is a rooted tree fulfilling the properties of being binary and full, and that T has the extra datum of being chiral: full binary: Each node of T has either zero or two children.chiral: Each child node in T carries the extra datum, the so-called chirality, of being a left or a right child.
Morphisms of merge trees are morphisms of rooted binary trees which are compatible with the chirality.
For rooted trees T we use the notions of subtrees, ancestors and descendants as they are commonly used in computer science.Definition 3.10.For any node p of T , the descendants of p are defined inductively: A node c is a descendant of p if the parent node of c is a descendant of p or p itself.
A subtree of T is a subgraph of T that consists of exactly all of the descendants of some node p of T .
For a node p of T we call all nodes which lie on the shortest path between p and the root, including the root, the ancestors of p. Notation 3.11.For an inner node c of T , we denote the left child of c with c l and the right child of c with c r .We illustrate this notation in the following example: T Remark 3.12.For full binary trees T with i(T ) inner nodes and l(T ) leaves it is a well-known result that l(T ) = i(T ) + 1 holds.It can be proved inductively.
Remark 3.13.The chirality of nodes will either be denoted by labels or indicated implicitly by embedding the merge tree on the page.Throughout the literature there are different notions of merge trees that are not always distinguished by name or notation.In this work, merge trees do not have explicit weights on edges.Moreover, merge trees in this work a priori do not carry a function to the real numbers.In that way, we distinguish between merge trees and Morse labeled merge trees which will be introduced in Definition 3.19.We use the chirality to obtain Morse labelings on unlabeled merge trees.This leads to Definition 4.3.
Construction 3.14 ([JS22, Thm 9]).Let X be a tree and let f : X → R be a dMf.The merge tree induced by f , denoted by M(X, f ) is constructed as follows: Let c 0 < c 1 < • • • < c m be the critical values of f that are assigned to 1-simplices.The associated merge tree M(X, f ) is constructed by induction over these critical values in descending order.Furthermore, we label the nodes of M(X, f ) in order to refer to them later.The label of a node n will be denoted by λ(n).
For the base case we begin by creating a node M(c m ) which corresponds to the critical 1-simplex in X labeled c m and setting its label λ(M(c m )) to (c m , L).
For the inductive step, let M(c i ) be a node of M(X, f ) that corresponds to a critical 1-simplex between two 0-simplices v and w.Define we assign n λv the same chirality (L or R) as M(c i ) and give n λw the opposite chirality.Continue the induction over the rest of the critical 1-simplices.
Remark 3.15.By construction, one of the following two cases holds for the labels λ v and λ w .They might be either critical values lower than c i that are assigned to edges or critical values that are assigned to nodes.The two labels λ v and λ w do not necessarily belong to the same case.
Therefore, the nodes n λv and n λw will possibly be denoted as M(c j ) and M(c k ) for some j, k < i in later steps of the induction.In particular, this means that the node which is considered in the first instance of the inductive step is c m .Remark 3.16.Although the induced merge tree as introduced above comes with a labeling, the labeling is not part of the data of the induced merge tree.This is one of the main differences between merge trees in [JS22] and the merge trees in [Cur19].
We consider one way to keep some information provided by the induced labeling on M(X, f ).Definition 3.17.Let T be a merge tree.We call a total order ≤ on the nodes of T a Morse order if it fulfills the following two properties for any subtree T ′ of T : (1) The restriction ≤ |T ′ attains its maximum on the root of T ′ .
(2) The restriction ≤ |T ′ attains its minimum on the subtree with root p l /p r if L/R is the chirality of the root p of T ′ .Moreover, we call a merge tree (T, ≤) together with a Morse order ≤ a Morse-ordered merge tree (Mo tree).
Remark 3.18.Assuming property (2) of Definition 3.17 for every subtree T ′ with root p of T is equivalent to either of the following: • For any subtree T ′ with root p of T , the minimum of ≤ |T ′ has the same chirality as p. • For any subtree T ′ with root p of T , all nodes on the shortest path between p and the minimum of ≤ |T ′ have the same chirality as p.The equivalence can be proved by an inductive argument over all nodes of the shortest path between p and the minimum.
Because Morse orders ≤ define in particular finite totally ordered sets, there are unique order-preserving isomorphisms λ : (V (T ), ≤) for each Morse order.Conversely, each injective labeling λ : T → R induces an order ≤ λ on the nodes of T by usage of the total order on R. Definition 3.19.For Morse orders ≤ we call the map λ ≤ : (V (T ), ≤) → {0, 1, . . ., i(T )+ l(T )−1} the Morse labeling induced by ≤.We call an arbitrary labeling λ : T → R a Morse labeling if it induces a Morse order on T .
We call a merge tree (T, λ) with a Morse labeling λ : T → R a Morse labeled merge tree (Ml tree).
For a Mo tree (T, ≤) we call the Ml tree (T, λ ≤ ) the Ml tree induced by (T, ≤).
Proposition 3.20.Let f : X → R be a dMf.The labeling which appears in Construction 3.14 induces a Morse order on M(X, f ).Hence, M(X, f ) canonically carries the structure of a Mo tree as well as an Ml tree.
Proof.It is proved in [JS22, Thm 9] that M(X, f ) is a merge tree.We only have to prove that the labeling induces a Morse order.By Remark 3.3 the set Cr(f ) of critical values carries a total order induced by f .Since the critical values of f precisely define the labeling in Construction 3.14, the labeling induces a total order on the nodes of M(X, f ).It is only left to prove that this order is a Morse order.In the construction, each inner node of M(X, f ) corresponds to a critical 1-simplex and is labeled with the critical value of said critical 1-simplex.Since parent nodes are created before their child nodes are, and since the critical values are considered from highest to lowest, property (1) of Definition 3.17 is fulfilled.The rule in the construction which decides the chirality of the child nodes is exactly the same as property (2) of Definition 3.17.Hence, it is fulfilled by construction.
We denote the canonical labeling of M(X, f ) by λ f .Remark 3.21.In the aforementioned proof, it becomes clear that both conditions of Definition 3.17 are necessary for a total order on M(X, f ) to be induced by a dMf f .Morse orders are useful for the construction of dMfs that induce given merge trees T .We will see in Proposition 4.23 that for a total order on an arbitrary merge tree T condition (1) is sufficient for inducing a dMf in the sense of Definition 4.20 later on.Nonetheless, condition (2) is necessary to ensure that the induced dMf induces the given merge tree T .
Example 3.22.We consider the following example of a dMf f : X → R: The critical values on edges are: We now show the construction algorithm of M(X, f ) visually by depicting X c i −ε on the left and the part of M(X, f ) that is created up to the step corresponding to c i on the right. Start: 12 2 2 0 1 1 8 9 7 7 3 5 4 11 6 • 14 12 2 2 0 1 1 8 9 7 7 3 5 4 11 6 • 14 There are no more critical edges left, so the construction of M(X, f ) is finished.
Since there are different notions of merge trees in the literature and since the merge trees in our setting carry a lot of structure, there are multiple possibilities of how to define equivalences of merge trees.In the remainder of this section, we define and discuss some versions of equivalence of merge trees.
Since merge trees are defined to be chiral rooted binary trees, the obvious notion for isomorphisms of merge trees is isomorphisms of chiral rooted binary trees.In detail, this means bijections between the sets of nodes and the sets of vertices which map the root to the root and are compatible with the chiral child relation.For Mo trees (Definition 3.17) we have more notions of equivalence.Definition 3.23.Let (T, ≤) and (T ′ , ≤ ′ ) be Mo trees.An isomorphism of Mo trees (T, ≤) ∼ = (T ′ , ≤ ′ ) is an order-preserving isomorphism of the underlying merge trees.
Let (T, λ) and (T ′ , λ ′ ) be Ml trees.An isomorphism of Ml trees is and isomorphism of the underlying merge trees over R, that is, an isomorphism of merge trees ϕ : Definition 3.24.Let (T, λ) and (T ′ , λ ′ ) be Ml trees.A shuffle equivalence (ϕ, ψ) : (T, λ) → (T ′ , λ ′ ) of Ml trees is a pair of an isomorphism of the underlying merge trees ϕ : T → T ′ and a bijection ψ : R → R such that • the restriction of ψ to values on leaves is order-preserving, and • the restriction of ψ to values on inner nodes is order-preserving.In the special case that the restriction ψ |im(λ) : im(λ) → im(λ ′ ) is an order preserving bijection, we call (ϕ, ψ) an order equivalence.
A shuffle equivalence (T, ≤) → (T ′ , ≤ ′ ) between Mo trees is an isomorphism ϕ of the underlying merge trees such that • the restriction of ϕ to leaf nodes is order-preserving, and • the restriction of ϕ to inner nodes is order-preserving.
Remark 3.25.The name of shuffle equivalences hints at the fact that two given total orders, one total order on the leaves, and another total order on the inner nodes, might be combined to produce a total order on all nodes in different ways, a bit like shuffling cards.Shuffle equivalence checks if two Morse orders arise from the same underlying orders by different ways of shuffling.But the necessity of ranking ancestors higher than descendants and being compatible with the chirality prevents arbitrary ways of shuffling two given orders on the leaves and inner nodes from producing Morse orders.
Shuffle equivalences induce by definition isomorphisms on the underlying merge trees.We now make the relationship between Mo trees and Ml trees precise.Proof.Let (T, ≤) be a Mo tree.It is immediate that (T, λ ≤ ) has the property that λ ≤ induces ≤ as its induced order on T .Thus, the composition iMo • iMl is the identity on MoT .
Let (T, λ) be an Ml tree.By definition, the labeling λ induces a Morse order ≤ λ on T which makes (T, ≤ λ ) a Mo tree.Since the induced Morse labeling λ ≤ λ by construction induces ≤ λ as its induced order, it follows that (T, λ) and (T, λ ≤ λ ) are order equivalent.
Corollary 3.27.The induced Morse order iMo and the induced Morse labeling iMl induce a bijection between shuffle equivalences of Mo trees and shuffle equivalences of Ml trees.
Proof.The assignment iMl maps shuffle equivalences of Mo trees to shuffle equivalences of Ml trees by Definition 3.24.
Remark 3.28.In particular, the aforementioned proposition and corollary mean that two Mo trees are isomorphic (respectively shuffle equivalent) if and only if the corresponding Ml trees are order equivalent (respectively shuffle equivalent) and vice versa.

Generic Properties and Equivalences of DMFs.
In this subsection, we will take a closer look at generic properties that dMfs can be assumed to have.Furthermore we consider some notions of equivalences between dMfs.
A first example of a generic property is the notion of index-ordered dMfs as defined above.It is inspired by the eponymous notion from the smooth case.We use indexordered dMfs in order to distinguish critical simplices by their dimension because merge trees have the same property: Critical 0-simplices appear as leaves whereas critical 1simplices appear as inner nodes of the induced merge tree (see Construction 3.14).Thus, index-ordered dMfs seem to be especially suitable for working with merge trees.
Nonetheless, index-ordered dMfs are not compatible with the structure of rooted subtrees.In detail, consider the following: Remark 3.29.Let f : X → R be an index-ordered dMf on a tree such that the following holds: The tree X has a critical 1-simplex σ such that the corresponding inner node p in M(X, f ) has two inner nodes c and c ′ as children.Then the image of f on at least one of the connected components corresponding to c or c ′ is not an interval in f (Cr(f )).
Example 3.30.The following is a small example: (X, f ) Neither the subtree with root labeled 4, nor the subtree with root labeled 5 is labeled with an interval in f (Cr(f )) ⊆ R.
Still, we can assume compatibility with the structure of rooted subtrees as a property: Remark 3.32.Since both 'index-ordered' and 'sublevel-connected' are properties that only rely on the values of f on critical simplices, they can easily be arranged without changing the partial matching if the tree X is finite.It is also possible to do this without changing the induced merge tree.One way to obtain a sublevel-connected dMf would be to choose a collapsing order for the induced matching such that the respective connected components of sublevel sets correspond to intervals in said collapsing order.But as seen in Remark 3.29, the two properties are in most cases mutually exclusive.
Example 3.33.Here is a possibility how to modify the dMf from the previous example in order to make it sublevel-connected without changing the induced merge tree: (X, f ) Since dMfs can be modified to fulfill either of the two properties, one can always choose the one which is more convenient for the task at hand.Thus, we give two different constructions in this work, one for each property.
We recall that by Remark 3.3 each dMf f : X → R induces an order on the 0simplices of X and on the 1-simplices of X, respectively.This yields the following definition, which induces a merge-tree-invariant notion of equivalence between dMfs.Definition 3.34.Let f : X → R and g : X → R be dMfs on a tree X.We call f and g shuffle-equivalent if they have the same critical simplices and if they induce the same order on the critical 0-simplices as well as the same order on the critical 1-simplices.
Let (X, f ) and (X ′ , f ′ ) be two dMfs on trees.A shuffle equivalence (ϕ, ψ) : f → f ′ between f and f ′ consists of a simplicial map ϕ : X → X ′ and a bijection ψ : R → R such that • the restriction of ψ to values on critical 0-simplices is order preserving, and • the restriction of ψ to values on critical 1-simplices is order preserving.In the special case that the restriction ψ |Cr(f ) : Cr(f ) → Cr(f ′ ) is an order preserving bijection, we call (ϕ, ψ) an order equivalence.
Remark 3.35.It is immediate that shuffle equivalence of dMfs is an equivalence relation.The name is inspired analogously as for the eponymous notion for Mo trees and Ml trees.Shuffle equivalence checks if two dMfs arise from the same underlying orders by different ways of shuffling.Nonetheless not all ways of shuffling given orders on the critical 0-simplices and critical 1-simplices produce a dMf because dMfs have to be weakly increasing.
Furthermore, shuffle equivalence, and in particular order equivalence, also considers dMfs to be equivalent if they only differ by scaling because a different scaling does not change the induced orders on simplices.
We split the definition of shuffle equivalences in two steps to simplify the proofs of the following propositions.It is immediate that for two dMfs on the same tree X there is a shuffle equivalence between them if and only if they are shuffle equivalent.Proposition 3.36.Let X be a tree and let f : X → R and g : X → R be two shuffleequivalent dMfs.Then M(X, f ) and M(X, g) are isomorphic as merge trees.
The following two lemmas will be helpful for the proof of the proposition: Lemma 3.37.Let X be a tree and let f : X → R be a dMf such that X has at least one critical 1-simplex.Then the function f |Cr(f ) attains its maximum on a critical 1-simplex.Sketch of Proof.Backtracking gradient paths, see [For98,Def 8.4], as long as possible leads to a local maximum which turns out to be a critical 1-simplex.
Lemma 3.38.Let X be a tree and let f : X → R and g : X → R be two shuffleequivalent dMfs.We denote the critical 1-simplices of f and g by c 0 < c 1 < • • • < c n where < denotes the ordering induced by f or g, respectively.Then the connected components X f f (c i ) [c j ] of sublevel complexes contain the same critical simplices as X g g(c i ) [c j ] for all j < i.
Sketch of Proof.First we observe that restrictions of dMfs on trees to connected components of sublevel complexes are again dMfs on trees.With help of Lemma 3.37, it can be proved inductively that in the construction of M(X, f ) and M(X, g) the same critical 1-simplices are considered in the same order.The statement then follows inductively.
Proof of Proposition 3.36.We consider the construction of the induced merge tree (see Construction 3.14) and prove inductively the slightly stronger result that both functions yield isomorphic merge trees at every step of the construction.This implies that f and g induce isomorphic merge trees.
Since f and g impose the same order on the set of critical 1-simplices, the construction algorithm considers the same critical 1-simplices during the same steps for both functions.This already proves the base case.In particular, this means that the created root node corresponds to the same critical 1-simplex for both functions.Although the label of the root node might be different for the two dMfs, it does not affect the isomorphism type of the induced merge tree because the labeling is not part of the data of merge trees.
For the inductive step, we observe that in every step of the construction we consider a connected component of sublevel complexes ] that contains at least one critical 1-simplex, namely the one with the highest remaining critical value c j .Thus, by Lemma 3.38 in each step of the construction, the same critical simplices occur.
Assume we are at the step that considers the critical 1-simplex c i .For the two new nodes which are created in the inductive step, two pieces of information are important for the isomorphism type of the induced merge tree, namely the chirality of the new nodes and which critical simplices the new nodes correspond to.The chirality of the new nodes affects the isomorphism type of the induced merge tree directly.The critical simplex corresponding to a child node c decides which connected component of the respective sublevel complex is used to build the subtree with root c and at which point said connected component will be subdivided next.
Both pieces of information are defined by the two connected components that belong to the boundary 0-simplices of c i .The two child nodes correspond to the critical simplices with the highest critical values.
There are three cases: (1) Both connected components contain at least one critical 1-simplex c j .
(2) One connected component contains at least one critical 1-simplex c j whereas the other one only contains one critical 0-simplex c.
(3) Each of the two connected components contains only one critical 0-simplex c.It follows by Lemma 3.37 that in case (1) the corresponding 1-simplices with the highest critical values are critical 1-simplices c j .In case (2) the same is true for the connected component that contains at least one critical 1-simplex.For the connected components in case (2) and (3) that only contain one critical 0-simplex, respectively, it is true that the critical 0-simplex is the only critical simplex in its corresponding connected component.Thus, the new nodes correspond to the same critical simplices for f and for g because both functions induce the same order on 1-simplices and because connected components only correspond to critical 0-simplices if they are the only critical simplex left in the corresponding connected component.Furthermore, connected components [c] that only contain one critical 0-simplex do not have any influence on the induced merge tree M(X, f )/M(X, g) because their corresponding nodes have already been created during a step that considered a critical 1-simplex with a higher critical value and they are not considered in later steps of the construction.
The chirality of the new nodes depends on the minimal values on critical simplices of the two respective connected components . By Lemma 3.7, these minima belong to critical 0-simplices.By assumption, f and g induce the same order on the critical 0-simplices, so the same 0-simplex is minimal with respect to both functions.Thus, f and g assign the same chirality to the new nodes.
Remark 3.39.The functions f and g might induce different order relations between 0-simplices and 1-simplices.Therefore, in sublevel complexes that appear during the same step of the construction there might be different connected components that contain only one critical 0-simplex each with respect to the two dMfs.However, those connected components that contain only one critical 0-simplex and no critical 1-simplices do not affect the isomorphism type of the induced merge tree.This is because those connected components correspond to leaves of the merge tree which have already been created during the step that considered the critical 1-simplex between said connected components and other connected components.Furthermore, those connected components do not appear in later steps of the construction of the induced merge tree because they do not contain any critical 1-simplices.
Proposition 3.40.Shuffle equivalences of dMfs induce shuffle equivalences of the induced Ml trees.Moreover, order equivalences of dMfs induce order equivalences of the induced Ml trees.Sketch of Proof.Since ϕ is bijective on critical simplices and simplicial, it follows that ϕ induces a bijection between connected components of sublevel complexes.With this, it follows analogously to the proof of Proposition 3.36 that M(X, f ) ∼ = M(X ′ , f ′ ) holds.The proof that the induced Morse labelings are shuffle equivalent is straightforward and only uses that the restrictions of ψ to 0-simplices and to 1-simplices are order preserving, and the compatibility between ϕ, ψ, f and f ′ .
Remark 3.41.The criterion from Proposition 3.36 for merge tree equivalence is sufficient but not necessary, as the following example shows: The two dMfs f and g induce inverse orders on the two 0-simplices.Nonetheless, f and g induce the same unlabeled merge tree.
This remark leads us to yet another kind of equivalence relation between dMfs that arises from symmetries of sublevel complexes.In order to make this notion of symmetry precise, we need some preparations.
Definition 3.42.Let f : X → R be a dMf on a tree.For each non-empty connected component ) there is an extension to a self-bijection X → X by the identity.The group Aut(X f c [v]) is defined to be the group of said extensions of elements of Aut(X f c [v]) by the identity.We consider Aut(X f c [v]) as a subgroup of the group of all self-bijections of X.The total order on Cr(f ) induced by f induces chains Aut(X ) if v and w are in different connected components of some sublevel complex X f c i that merge together in some other sublevel complex X f c j for j > i.We define the sublevel automorphism group of (X, f ), denoted by Aut sl (X, f ), to be the subgroup generated by ).We call the elements of Aut sl (X, f ) sublevel automorphisms.
Remark 3.43.Even though sublevel automorphisms are built out of simplicial automorphisms of connected components X f c [v] of sublevel complexes, they are in general not simplicial maps X → X.To be precise, if a simplicial automorphism of X f c [v] was used to construct a sublevel automorphism a ∈ Aut sl (X, f ), then a will fail to be simplicial at the boundary of X f c [v] ⊂ X. Proposition 3.44.Let f : X → R be a dMf on a tree and let a ∈ Aut sl (X, f ) be a sublevel automorphism.Then f * a defined by f * a(σ) := f (a(σ)) is a dMf on X.Moreover, this defines a right group action of Aut sl (X, f ) on the set of dMfs on X. Sketch of Proof.The proof that f * a is a dMf is straightforward and the compatibility of the group action follows directly by associativity of the composition of maps.
Remark 3.45.Since automorphisms of simplicial complexes preserve the dimension of simplices, the action of Aut sl (X, f ) on the set of dMfs on a tree X preserves the properties of being index-ordered or sublevel-connected.Definition 3.46.Let f : X → R and g : X → R be dMfs on a tree X.We call f and g sublevel-equivalent if Cr(f ) = Cr(g) and X f c ∼ = X g c for all c ∈ Cr(f ) = Cr(g).If additionally g = f * a holds for a sublevel automorphism a ∈ Aut sl (X, f ) = Aut sl (X, g), then we call f and g symmetry-equivalent.We call the map a a symmetry equivalence from f to g.
We call two dMfs f : X → R and g : Y → R symmetry-equivalent if there is a simplicial isomorphism ϕ : X → Y such that f and g • ϕ are symmetry-equivalent.
Example 3.47.We give a list of some symmetry-equivalent dMfs on a path with four vertices.Here we denote the sublevel equivalence induced by the reflection of the connected component of the sublevel complex of level k by a k [k] : Proposition 3.48.Let f : X → R and g : X → R be symmetry-equivalent dMfs on a tree X.Then M(X, f ) and M(X, g) are isomorphic as Ml trees.
Sketch of Proof.The proposition can be proved by induction over the level c of the sublevel automorphisms that the given symmetry equivalence consists of.We check that in each step the single sublevel automorphism a of the connected component X c [σ] with the 1-simplex σ labeled c in X c only affects steps of the construction of the induced Ml tree that consider simplices of X c [σ].Moreover, it is straightforward to prove that in these steps, the created nodes and their induced Morse labels are the same as without the application of a.
Remark 3.49.Sublevel automorphisms of dMfs on paths only consist of reflections of the corresponding connected component of a subcomplex.When such a connected component of a sublevel complex of a critical level c is considered during the construction of the induced Ml tree, the reflection of the connected component only causes the two new parts that are obtained by considering a slightly lower level c − ε to appear as their mirror images.In particular, the given dMf attains the same values on the two new parts as before.Hence, the two parts that appear are simplicially isomorphic to the ones that appear without application of the reflection.
Definition 3.50.Let (X, f ) and (X ′ , f ′ ) be dMfs on trees.A component-merge equivalence (cm equivalence) of level a is a bijection ϕ : X → X ′ such that one of the following, not necessarily exclusive, cases holds: (1) ϕ is a symmetry equivalence.
(2) ϕ fulfills the following: • ϕ induces a bijection between the sets of connected components of sublevel complexes such that each restriction ] is a cm equivalence of some level b < a, and • the edge σ ∈ X with f (σ) = a merges the two connected components ].If ϕ fulfills property (2) but not property (1), we call ϕ non-trivial.
Example 3.51.We give an example of two cm-equivalent dMfs on trees.The nontrivial cm equivalence from the left-hand-side to the right-hand-side consists of a symmetry equivalence of level 5 and the attachment of the edge labeled 6 between the vertices labeled 1 and 3 rather than 2 and 3.That is, it is a cm-equivalence of level 6.
Proof.Let ϕ : (X, f ) → (X ′ , f ′ ) be a cm equivalence.By property (ii) of Definition 3.1, at most one non-trivial cm equivalence of level a can occur for any level a because there is at most one edge labeled a in (X, f ), (X ′ , f ′ ), respectively.Thus, we can decompose any cm equivalence into a sequence (ϕ a ) a of non-trivial cm equivalences of decreasing levels such that each ϕ a only changes the attachment of the single edge σ with f (σ) = a and acts as a symmetry equivalence on the rest of path and dMf.It suffices to consider a single level a because the statement then follows by induction from highest to lowest over all levels a.For such a non-trivial cm equivalence ϕ a we consider the step of the construction of the induced Ml trees that considers the edge σ with f (σ) = a and the edge ϕ(σ).We inductively assume that ϕ induces an isomorphism of induced Ml trees everywhere outside the subtrees corresponding to the two connected components of X f a−ε that are merged by the edge σ with f (σ) = a.That is, on the rest of M(X, f ) the map M(ϕ) is a bijection compatible with the chiral child relation onto M(X ′ , f ′ ) except for the subtrees of M(X ′ , f ′ ) which correspond to the connected components of X ′f ′ a−ε which are merged by the edge ϕ(σ).Since the map ϕ is compatible with the dMfs and because it restricts to a cm equivalence X f a−ε → X ′f ′ a−ε , the dMf f attains the same minima and maxima on the two relevant connected components of X f a−ε as f ′ does on their counterparts of X ′f ′ a−ε via ϕ.Since Construction 3.14 only considers which two connected components are merged by the considered edge, it makes no difference for the isomorphism type of the induced Ml trees that σ in general merges the two connected components of X f a−ε at vertices that do not correspond via ϕ to the ones adjacent to ϕ(σ) in X ′f ′ a−ε .Thus, the construction of the induced Ml tree produces nodes with the same chirality and label for both induced Ml trees in the steps that consider σ, ϕ(σ), respectively.By assumption, the restriction ϕ X f a−ε : X f a−ε → X ′f ′ a−ε is a symmetry equivalence, so the isomorphism of Ml trees extends to the subtrees that correspond to the respective connected components.Proposition 3.53.Let (X, f ) be a dMf on a tree.There is a dMf on a path (P, f ′ ) such that (X, f ) is cm-equivalent to (P, f ′ ).

Sketch of Proof.
A suitable cm equivalence can be constructed inductively by re-attaching 1-simplices of level a that would become the third 1-simplex incident to some 0-simplex in X a .
Remark 3.54.The way we defined cm equivalence makes it a generalization of symmetry equivalence.In fact, cm equivalences are the same as symmetry equivalences, i.e. they are always trivial, if we restrict ourselves to dMfs on paths: Without loss of generality, cm equivalences of some level a of a dMf on a path (P, f ) describe all different possibilities of how two glue two paths together with a new edge in order to obtain a path again.This means that the edge labeled a can only be adjacent to the vertices that are adjacent to less than two edges, respectively, of the two old paths in P a−ε .Thus, there are at most four possibilities for the two vertices which may be adjacent to the edge labeled a.All of these possibilities result in dMfs which are related to each other by reflections of the original two paths in P a−ε .Hence, they are all symmetry-equivalent to each other.

Construction of the Induced Index-Ordered DMF
We address the inverse question: For any given merge tree T , is there a discrete Morse function f on a path P such that M(P, f ) ∼ = T ?We answer this question affirmatively by presenting an explicit construction of P and two possible choices for f .The basic idea for the construction is to reverse-engineer the construction of the induced merge tree from Construction 3.14.
To start with the index-ordered case, we define two different orders on T .First we define a Morse order on T , which we call the index Morse order.Afterwards, we define the simplex order on the nodes of T , which we use to turn the Morse labeling induced by the index Morse order into a dMf on P .In Section 5 we will present an alternative dMf which represents T , namely the sublevel-connected dMf.
We will discuss in Section 6 to what extent the constructed dMf is a unique representative for T .4.1.The Index Morse Order.To define the index Morse order, we first observe that every node a of T is uniquely determined by the shortest path from the root to a.We recall that the depth of T is the maximal length of any path in T that appears as the shortest path from the root to a leaf.Because T is chiral, we can identify such shortest paths with certain words: Definition 4.1.Let T be a merge tree of depth n and let a be a node of T .The path word corresponding to a is a word a 0 a 1 . . .a n ∈ {L, R, } n+1 where denotes the empty letter.If a is of depth k, the letters a 0 . . .a k are given by the chirality of the nodes belonging to the shortest path from the root to a.The letters a k+1 . . .a n are then empty.
Remark 4.2.Let a, b be nodes of a merge tree T and let a 0 a 1 . . .a n be the path word corresponding to a and b 0 b 1 . . .b n be the path word corresponding to b.Then the equation a 0 = b 0 = L always holds because we consider paths that begin at the root.Because of a 0 = b 0 = L and because we consider finite trees, there is always a maximal k ∈ N such that a i = b i holds for all i ≤ k.Furthermore, the last non-empty letter of a path word is always the chirality of the considered node.
We now define the index Morse order, which will produce an index-ordered dMf on P afterwards.
The index Morse order is tailor-made to induce an index-ordered dMf later on.Nonetheless, we will see in Example 6.2 that it is in general not the only Morse order which induces an index-ordered dMf.In Section 5 we will introduce a different, perhaps more natural, Morse order that is more closely related to the sublevel filtration of the induced dMf.But for now we consider an example of the index Morse order and prove that ≤ io is actually is a Morse order.
Example 4.4.We consider the following merge tree T : The path words are written underneath their corresponding nodes.The index Morse order produces the following chain of inequalities where we denote the nodes by their corresponding path words: The inequalities from LLL to LRL arise from the path words of the leaf nodes.The inequality LRL LLR holds because the node corresponding to LRL is a leaf node and the node corresponding to LLR is an inner node.The inequalities from LLR to L arise from the path words of the inner nodes.
Remark 4.5.By definition, the root node is always the maximal element of (V (T ), ≤ io ).Furthermore, the leftmost leaf node of T is always the minimal element of (V (T ), ≤ io ).
The Simplex Order.We now define the simplex order on the nodes of T .The simplex order will tell us which nodes of T correspond to which simplices of P .
Remark 4.9.Let T be a merge tree and let a, b be nodes of T .Because T is in particular a rooted binary tree, there is a unique node p which is a common ancestor of a and b and has no descendants which are common ancestors of a and b.
Definition 4.10.We call the node p from Remark 4.9 the youngest common ancestor of a and b.
Definition 4.11.Let T be a merge tree.We define the simplex order on V (T ) as follows: For two nodes a and b of T we define a b if and only if one of following mutually exclusive cases holds, where p denotes the youngest common ancestor of a and b: (1) a is a node of the subtree with root p l and b is a node of the subtree with root p r .(2) a is a node of the subtree with root b l (in particular b = p).
(3) b is a node of the subtree with root a r (in particular a = p).(4) a = b.
Proposition 4.12.The simplex order is a total order on the nodes of T .Sketch of Proof of Proposition 4.12.The proof is a bit tedious and consists of many careful case distinctions corresponding to the different cases from Definition 4.11.Otherwise, the proof is a straightforward application of the definitions, paired with a contradiction argument here and there.
We use the following definition to make the intuition of leaves being adjacent precise.This allows us to analyze the simplex order further.Definition 4.13.Let T be a merge tree and let a and b be leaves of T .We call a and b adjacent if one of the following holds: (1) a b and there is no leaf node c of T such that a c b holds.
(2) b a and there is no leaf node c of T such that b c a holds.
Lemma 4.14.Subtrees of T form chains of cover relations in (V (T ), ).In detail, this means the following: Let p be an inner node of T and let a/b be the leftmost/rightmost leaf of the subtree with root p. Then the nodes of the subtree with root p in T form the chain of cover relations a ≺ . Moreover, any two adjacent leaves of T have the property that the left one of the two adjacent leaves is covered by the youngest common ancestor of the two, whereas the right one covers the youngest common ancestor.
Proof.We prove the lemma inductively.Let p be a node of T such that both child nodes of p are leaves.It follows directly by Definition 4.11 that p r covers p and p covers p l .That is, the subtree with root p forms the chain of cover relations a = p l ≺ p ≺ p r = b.
If p is an arbitrary inner node, then by the inductive hypothesis the subtree with root p l /p r forms the chain of cover relations where a 1 /a 2 is the leftmost and b 1 /b 2 the rightmost leaf of the subtree with root p l /p r .Since b 1 /a 2 is a node of the subtree with root p l /p r , it follows by case (2)/(3) of Definition 4.11 that b 1 ≺ p/p ≺ a 2 holds.For all nodes c of T which are not nodes of the subtree with root p, the same case from Definition 4.11 holds for c and p as for c and b 1 /a 2 .Thus, and because b 1 /a 2 is maximal/minimal in the subtree with root p l /p r by the inductive assumption, there is no node c such that b 1 ≺ c ≺ p/p ≺ c ≺ a 2 holds.In conclusion, p covers b 1 /a 2 covers p.
As mentioned before, we will use the simplex order to relate the nodes of T to the simplices of a path P .In order to do that, we now define a corresponding simplex order on the simplices of P .Definition 4.15.Let P be a path.There are two 0-simplices p 0 and p 1 in P which belong only to one respective 1-simplex.For each simplex σ of P there is a unique shortest path γ σ from p 0 to σ.We denote the length, that is, the number of simplices, of such a path γ σ by L(γ σ ).The simplex order on P is defined as follows: For two simplices σ and τ of P we define σ τ if and only if L(γ σ ) ≤ L(γ τ ).
Lemma 4.16.The simplex order on P is a total order on the simplices of P .Sketch of Proof.The proof is straightforward and only uses that P is a path and that the integers are linearly ordered.
Remark 4.17.Connected subcomplexes of P correspond to chains of cover relations with respect to the simplex order.Furthermore, any 1-simplex covers its left boundary 0-simplex and is covered by its right boundary 0-simplex.If one visualizes P as being horizontally embedded in a plane such that p 0 is the leftmost 0-simplex of P and p 1 is the rightmost 0-simplex of P , then for simplices s, s ′ ∈ P the relation s ≺ s ′ holds if and only if s is left of s ′ .This reminds us of the fact that the simplex order is only defined up to a choice of orientation.
Remark 4.18.Let T be a merge tree and let P be a path with i(T ) 1-simplices.Then we have a unique isomorphism φ : (P, ) ∼ = − → (V (T ), ) of totally ordered sets.The isomorphism φ only depends on the choice of p 0 and p 1 , that is, on a choice of orientation on P .Choosing p 0 and p 1 the other way around would reverse the simplex order on P .
Before we continue with the definition of the index-ordered dMf, we consider how the simplex order can be used to classify the connected components of sublevel complexes of dMfs on paths (P, f ): Proposition 4.19.Let f : P → N 0 be a dMf on a path P .Then the connected components P c [v] of sublevel complexes P c of P are precisely maximal sequences σ := (s 0 , . . ., v, . . ., s k ) of simplices of P such that s i ∈ P c for all i = 0, . . ., k and Sketch of Proof.The proof is straightforward and uses Remark 4.17 4.3.The Induced Index-Ordered DMF.Now we explain how the simplex order can be used to construct dMfs on P from Morse orders on T : Definition 4.20.Let T be a merge tree and P be a path such that the number of 1simplices is i(T ) and let φ : (P, ) → (V (T ), ) be the isomorphism from Remark 4.18.
For a Morse order ≤ and its induced Morse labeling λ we define a map f λ : P → N 0 by f λ := λ • φ.The map f λ is then called the dMf induced by the Morse order ≤ or the dMf induced by the Morse labeling λ.
In particular, the map f io := λ io • φ induced by the index Morse order is called the induced index-ordered dMf.
Remark 4.21.Although φ and λ are order-preserving maps with respect to the previously defined total orders, the map f io does not respect the simplex order in general.Since f io is supposed to be an index-ordered dMf, it does not need to respect the simplex order.Because the map f io is supposed to be index-ordered, it rather needs to be compatible with face relation on P , which we will see to be true later on.
Example 4.22.The index Morse order from Example 4.4, respectively the index Morse labeling from Example 4.8, produces the following pair (P, f io ): Proposition 4.23.For any given Morse order ≤ on any merge tree T the dMf induced by ≤ is a dMf that has only critical cells.
Sketch of Proof.The proof is straightforward and uses Lemma 4.14, Remark 4.17, and property (1) of Definition 3.17.
Remark 4.24.The previous proposition proves that Morse orders ≤ on merge trees T always induce dMfs f λ .It is a priori unclear though whether the induced dMf f λ induces the given merge tree T as its induced merge tree M(P, f λ ).We prove this to be true in Theorem 6.5.Furthermore, condition (1) from Definition 3.17 is necessary for f λ to be a dMf, because a violation of (1) between an inner node and a leaf would result in a violation of f λ being weakly increasing on the corresponding simplices.
Before we continue with the sublevel-connected dMf, we consider how the simplex order can be used to improve our understanding of sublevel complexes of dMfs on paths (P, f λ ) and how they are related to subtrees of T .The condition for this approach to be applicable is that the dMf f λ is induced by a Morse order ≤ on T as in Definition 4.20, which we will see to be the general case later on.We will apply this approach to the sublevel-connected case in Section 5 where it will be of more importance.
Proposition 4.25.Let f λ : P → N 0 be a dMf on a path P that is induced by a Morse order ≤ on T .Then the connected components P c [v] of sublevel complexes P c of (P, f ) induce subtrees of T via φ.Sketch of Proof.It follows by Proposition 4.19 and the definition of φ in Remark 4.18 that connected components of sublevel complexes P c [v] induce maximal chains of cover relations such that the corresponding simplices are of at most level c in (V (T ), ).The next step is to prove that such chains are equal to the subtree with the chain's maximum as root.The proof that the chain is contained in the subtree is straightforward.The other inclusion can be proved by contradiction, using that a node outside the subtree would contradict the property of being a chain of cover relations.

The Sublevel-Connected DMF
As remarked in Section 3.2 it might sometimes be more convenient to work with sublevel-connected dMfs rather than with index-ordered dMfs.In this section we introduce a slightly different version of the Morse order from Definition 4.3 to construct a sublevel-connected dMf which is shuffle-equivalent to the induced index-ordered dMf and, hence, induces the same given merge tree.
Definition 5.1.Let T be a merge tree.We define the sublevel-connected Morse order ≤ sc on the nodes of T as follows: Let a, b be arbitrary nodes of T .Let a 0 a 1 . . .a n be the path word corresponding to a and b 0 b 1 . . .b n the path word corresponding to b (see Definition 4.1).Furthermore, let k ∈ N be maximal such that Remark 5.2.The only difference between the definition of the index Morse order and the definition of the sublevel-connected Morse order is that we do not treat leaves and inner nodes differently anymore.Thus, both orders induce the same order on inner nodes and the same order on leaves, which makes the index Morse order and the sublevel-connected Morse order shuffle-equivalent.However, the order relation between a leaf and an inner node is in general different then in the index Morse order.
Remark 5.3.The fact that the sublevel-connected Morse order is a Morse order can be proved the same way as the corresponding statement Proposition 4.6 for the index Morse order was proved.There are just fewer case distinctions to be made for the sublevel-connected Morse order.Lemma 5.4.Subtrees of T form intervals in (V (T ), ≤ sc ).

Sketch of Proof.
The proof is straightforward and uses the fact that all path words of a subtree T ′ start with the same couple of letters corresponding to the root of T ′ .
The induced sublevel-connected labeling λ sc and the induced sublevel-connected dMf f sc are defined analogously to the index-ordered case: Definition 5.5.Let T be a merge tree and P be a path such that the number of 1-simplices is i(T ).We call the Morse labeling λ sc : (V (T ), ≤ sc ) → {0, 1, . . ., i(T ) + l(T ) − 1} induced by the sublevel-connected Morse order the sublevel-connected Morse labeling on T .The dMf f sc = λ sc • φ induced by λ sc is called the induced sublevel-connected dMf.
Example 5.6.Let T be the merge tree from Example 4.4.The sublevel-connected Morse labeling on T and the induced sublevel-connected dMf are given below.
• 8 There are now two things left to prove: that the map f sc is indeed a sublevelconnected dMf and that it induces the given merge tree T .
Proposition 5.7.The induced sublevel-connected dMf f sc is a sublevel-connected dMf that has only critical cells.
Proof.As a dMf induced by a Morse order, the map f sc is by Proposition 4.23 a dMf that has only critical cells.It is left to prove that f sc is sublevel-connected: By Proposition 4.25, the connected components of sublevel complexes of (P, f ) induce subtrees of T via φ.By Lemma 5.4, subtrees of T form intervals in (T, ≤ sc ).The sublevel-connected Morse labeling λ sc by definition maps intervals of (T, ≤ sc ) to intervals of N 0 .By concatenation of these arguments, it follows that f sc = λ sc • φ maps connected components of sublevel complexes to intervals of N 0 , i.e. the map f sc is sublevel-connected.
Theorem 5.8.Let T be a merge tree and let P be a path such that the number of 1simplices in P is i(T ).Then f io and f sc are shuffle-equivalent where f sc is the induced sublevel-connected dMf and f io is the induced index-ordered dMf.Thus, M(P, f sc ) ∼ = M(P, f io ) holds as merge trees.
Proof.By Remark 5.2, the index Morse order and the sublevel-connected Morse order are shuffle equivalent.It follows by Corollary 3.27 and Definition 4.20 the the indexordered dMf and the sublevel-connected dMf are shuffle equivalent.Thus, M(P, f sc ) ∼ = M(P, f io ) follows by Proposition 3.36, where f io is the induced index-ordered dMf defined in Definition 4.20.

Relationships Between Merge Trees and DMFs on Paths
In this section we want to take a look at the bigger picture again and consider how we can relate dMfs on paths and trees to merge trees.In order to do this in a structured way, we consider the different sets of dMfs and merge trees and relate them to each other by bijections that are compatible with the various notions of equivalence we introduced earlier.Afterwards, we use said bijections in order to prove that the aforementioned dMfs f io , Definition 4.20, and f sc , Proposition 5.7, both represent the given merge tree.We also relate the sets of dMfs and merge trees mentioned here to the setting of [Cur19].
Remark 6.1.In order to obtain bijections that are compatible with the various notions of equivalence, we restrict ourselves to the case of dMfs for which all simplices are critical.Since the induced merge tree does not take matched cells into account, we would otherwise need to define a notion of equivalence similar to Forman equivalence (see [JS22,Def 4.1]) of dMfs that in particular takes simple homotopy equivalences as well as combinatorial aspects of dMfs into account.This could be done by additional pre-and post-composition of the equivalences as we defined them with simple homotopy equivalences that are compatible with the given dMfs.For simplicity, we chose to leave this aspect out of this work.
We denote the set of merge trees up to isomorphism by Mer and the set of dMfs on paths with only critical simplices up to symmetry equivalence by DMF crit P .It follows by Proposition 3.48 that the assignment M( , ) is well-defined on DMF crit P .Furthermore, the construction of the induced dMf from Definition 4.20 extends to a map which we denote by Φ.Since φ is well defined up to a choice of orientation, the map Φ is in particular well defined up to symmetry equivalence.This leaves us with the following diagram: (T, λ) • 4 It is immediate the (T, λ) and (T ′ , λ ′ ) are neither isomorphic nor shuffle equivalent.Thus, (T ′ , λ ′ ) ≇ (T, λ) = (forget(T ′ , λ ′ ), λ io ) holds.Nonetheless, the Ml tree (T ′ , λ ′ ) induces an index-ordered dMf.
We have already seen in Proposition 3.26 that the maps iMo and iMl are inverse to each other in the sense that they are bijections compatible with isomorphisms, order equivalences and shuffle-equivalences.We now show that M( , ) and Φ are also inverse to each other up to the respective notions of equivalence.

Proof.
(1) Let (P, f ) be a dMf on a path.We construct a symmetry equivalence between f and f λ f .It is given as follows: For any simplex σ of ΦM(P, f ) there is exactly one simplex σ of P such that f (σ) = f λ f (σ).This induces a bijection ϕ : P → ΦM(P, f ) which is compatible with f ,f λ f and id R by definition.But in general, the map ϕ is not simplicial.This is because the simplex order on M(P, f ) might be different than the left/right relation on the corresponding simplices of P .In other words, the map M( ) : P → M(P, f ) is in general not compatible with the two different simplex orders.Nonetheless, the Morse labeling λ f induced by f orders the nodes of M(P, f ) in the same order as their corresponding simplices of P .Thus, connected components of sublevel complexes of (P, f ) still correspond to subtrees of M(P, f ).Since the induced merge tree assigns the chirality of child nodes according to which connected component carries the minimal value of f , at each inner node of M(P, f ) the chirality of the two child nodes is either assigned in accordance with the left/right relation on the corresponding sublevel complex, or it is the opposite.If it is the opposite, this can be corrected by application of the reflection of the corresponding sublevel complex, that is, by application of a sublevel equivalence.In consequence, the difference between the right/left relation of the corresponding simplices in P and the simplex order only lies in symmetry equivalences of P .Thus, ϕ can be decomposed into a symmetry equivalence of P and a simplicial isomorphism φ.Hence, (ϕ, ψ) is a symmetry equivalence of dMfs on paths.
(2) Let (T, λ) be an Ml tree.Let c 0 < c 1 < • • • < c n be the critical values of f λ and let σ i ∈ ΦT such that f λ (σ i ) = c i .We recall that the induced merge tree M defines in particular a bijection between the critical simplices of ΦT and the nodes of M(ΦT, f λ ).For any simplex σ ∈ ΦT , we denote the node of M(ΦT, f λ ) that corresponds to σ by M(σ).An isomorphism ϕ : (T, λ) → M(ΦT, f λ ) is given by ϕ := M • φ −1 .It is immediate that ϕ is a bijection because M and φ are.Furthermore, ϕ is by construction compatible with the respective Morse labelings.It is only left to show that ϕ is compatible with the chiral child relation and the respective roots.Consider σ n ∈ ΦT .For both trees, the simplex σ n corresponds to the root of the respective tree.In M(ΦT, f λ ) this is the case because σ n carries the maximal value of f λ .In (T, λ) this holds because φ(σ n ) holds the maximal Morse label λ(φ(σ n )) = c n .Thus, the map ϕ maps the root of (T, λ) to the root of M(ΦT, f λ ).
Let σ i be a simplex of ΦT .We now prove that ϕ is compatible with the chiral child relation, that is, that ϕ(φ(σ i ) l ) = M(σ i ) l /ϕ(φ(σ i ) r ) = M(σ i ) r holds.If σ i is a 0-simplex then there is nothing to show because then both M(σ i ) and φ(σ i ) are leaves.Let σ i be a critical edge with chirality L. The case for chirality R works symmetrically to the case with chirality L. By Construction 3.14, the node M(σ i ) l /M(σ i ) r corresponds to a critical simplex of the connected component of ΦT c i −ε that carries/does not carry the minimal value of f λ on these two connected components.Furthermore, the node M(σ i ) l /M(σ i ) r corresponds to the critical simplex that carries the maximal value of f λ of the respective connected component of ΦT c i −ε .
By application of Proposition 4.25, we see that the connected components ] via φ because by (2) of Definition 3.17 the subtree with root φ(σ i ) l does/φ(σ i ) r does not carry the minimal Morse label of the subtree with root φ(σ i ) in (T, λ).Furthermore, the node φ(σ i ) l /φ(σ i ) r corresponds to the simplex that carries the maximal value of because by (1) of Definition 3.17 it carries the maximal Morse label on said subtree and because φ is orderpreserving.Thus, ϕ(φ By considering Figure 1 we see that the difference between taking the induced merge tree of a dMf on a path is the same as taking its induced Ml tree and forgetting the Morse labeling.Thus, constructing a dMf that represents a given merge tree T is up to symmetry equivalence the same as choosing a Morse order on T .This leads us to: Theorem 6.5.Let T be a merge tree and let P be a path such that the number of 1simplices in P is i(T ).Then T ∼ = M(P, f io ) ∼ = M(P, f sc ) holds as merge trees where f io denotes the induced index-ordered dMf (Definition 4.20) and f sc denotes the sublevelconnected dMf (Definition 5.5).
Proof.The statement follows by Theorem 6.4, Proposition 3.26, and the fact that by Definition 3.23, isomorphisms of Mo trees are in particular isomorphisms of the underlying merge trees.Furthermore, M(P, f io ) ∼ = M(P, f sc ) holds by Theorem 5.8.
Using the notion of component-merge equivalence, Definition 3.50, we can extend Theorem 6.4 to a bijection between the set of dMfs with only critical simplices on trees up to cm equivalence DMF crit X and the set of Ml trees up to isomorphism MlT : Theorem 6.6.The induced labeled merge tree M( , ) and the induced dMf Φ define maps M( , ) : DMF crit X ← → MlT : Φ that are inverse to each other in the sense that: (1) for any dMf (X, f ) with only critical cells, the dMf Φ(M(X, f ), λ f ) is cmequivalent to (X, f ), and (2) for any Ml tree (T, λ), the Ml tree M(ΦT, f λ ) is isomorphic to (T, λ).
Proof.The proof for statement (2) works exactly as in the proof for Theorem 6.4 because symmetry equivalences are in particular cm equivalences.For (1) we apply Proposition 3.53 to consider a representative of the cm equivalence class of (X, f ) which is a dMf on a path (P, f ′ ).By Proposition 3.52, the isomorphism type of the induced Ml tree does not depend on this choice.Thus, Theorem 6.4 implies that Φ(M(P, f ′ )) is symmetry-equivalent to (P, f ′ ).Since (P, f ′ ) is cm-equivalent to (X, f ), so is Φ(M(P, f ′ )).Corollary 6.7.Let T be a merge tree.By Theorem 6.5 and Theorem 6.6 it follows that there are dMfs on trees (X, f ) such that M(X, f ) ∼ = T as merge trees.
Corollary 6.8.Applying Theorem 6.6 together with Proposition 3.26 and Proposition 3.40 yields the result that there is a bijection DMF crit X / ∼ ∼ = MoT where ∼ denotes order equivalence.
We conclude this section by discussing our results and comparing them to the results of [Cur19].Using the bijections appearing in Figure 1 and Theorem 6.6 we replaced the question of finding dMfs on paths or arbitrary trees that represent a given merge tree T by finding Morse orders on T instead.This argument can be used to replace the question of classifying merge equivalence classes of dMfs on trees by classifying Morse orders.Example 6.2 tells us that, if a merge tree T has at least three leaves, there might be different Morse orders on T which are not shuffle-equivalent.That is, there are dMfs on trees (X, f ) contained in the image of Φ • iMl which induce T as their merge tree but are neither isomorphic, nor symmetry-equivalent, nor cm-equivalent, nor shuffle-equivalent, nor a combination of the four to each other.We found a nonempty shuffle equivalence class of Morse orders on any merge tree, defined by either the index Morse order or the sublevel-connected Morse order, since the two have been shown to be shuffle-equivalent and, hence, merge-equivalent in Theorem 5.8.This allowed us to answer the aforementioned question of Johnson-Scoville affirmatively.That is, any merge tree is indeed represented by a dMf on a path, which is induced by a Morse order.Using a non-trivial cm equivalence, one can also find a dMf on a tree other than a path as a representative.
Furthermore, our results from Section 3.1, Section 3.2, and Section 6 allow us to structure the study of the set of merge equivalence classes of dMfs on trees using the following four notions of merge-invariant equivalences between dMfs on trees: Forman equivalence, symmetry equivalence, cm equivalence, and shuffle equivalence.
We discussed in Remark 6.1 how Forman equivalences could be considered together with the other notions of equivalence and why we left Forman equivalences out of this work.In Theorem 6.4 it becomes quite clear that passing to the induced Ml tree identifies symmetry-equivalent dMfs with each other up to isomorphism.Passing from the induced Ml tree to the induced Mo tree then identifies dMfs up to order equivalence with each other up to isomorphism of the underlying Mo tree.Last of all, passing from the induced Mo tree to the induced merge tree in particular identifies shuffle-equivalent dMfs with each other.This allows us to study the different equivalence classes separately for dMfs on paths.The more liberal notion of cm equivalence, Definition 3.50, allowed us to generalize Theorem 6.4 to dMfs on arbitrary trees as seen in Theorem 6.6.
In [Cur19], the author establishes a bijection between graph-equivalence ([Cur19, Def 6.1]) classes of Morse-like ([Cur19, Def 6.9]) continuous functions on the interval that attain minima at the boundary on the one hand and isomorphism classes of chiral merge trees ([Cur19, Def 5.3]) on the other hand.
At first glance it might seem likely that Ml trees in the sense of Definition 3.19 and chiral merge trees in the sense of [Cur19, Def 5.3] are directly related by geometric realization and considering the corresponding abstract simplicial complex but, as mentioned in the introduction, there is a subtle difference in the construction of the induced merge tree.To be precise, the two constructions only differ in the induced chirality.In [Cur19, Sec 5] the chirality is given by which of the two merging components is the left or right one with respect to the chosen orientation on the interval.In [JS22] the chirality is given such that drawing the induced merge tree is compatible with the elder rule: The component with the minimal value gets the same chirality as the merged component.This means that following the same chirality leads to the oldest component.
This convention leads to the necessity to assume property (2) of Definition 3.17: a certain compatibility between the Morse order and the chirality.The compatibility between Morse orders and the chirality implies, as seen in Proposition 3.48, that the induced Ml tree does not distinguish between symmetry-equivalent dMfs.If one defines induced Ml trees analogously to [Cur19], that is by inducing the chirality by a chosen orientation of the path, this notion of induced Ml trees would distinguish symmetryequivalent dMfs on paths.Moreover, Ml trees induced by symmetry-equivalent dMfs would be related by sequences of reflections of subtrees.The definition could be as follows: Definition 6.9.Let T be a merge tree.A Curry Morse order is a total order ≤ on the nodes of T such that the maximal node of any subtree is the root of said subtree.A Curry Morse labeling on a merge tree T is a labeling λ on the nodes of T that induces a Curry Morse order on T .
A pair (T, ≤) of a merge tree with a Curry Morse order on it is called a Curry Morse ordered merge tree (CMo tree).A pair (T, λ) of a merge tree with a Curry Morse labeling on it is called a Curry Morse labeled merge tree (CMl tree).
Let f : P → R be a dMf where P is an oriented path.Then the CMl tree induced by f is constructed as is Construction 3.14 with the difference that the chirality is assigned according to the position of the corresponding connected components with respect to the orientation instead of according to critical values.Remark 6.10.CMl trees as defined above are basically the same concept as generic merge trees as defined in [CDG + 21, Def 2.2].We stick to the name CMl trees instead of generic merge trees because we already use the term merge tree in a different way.
Example 6.11.We consider two of the symmetry-equivalent dMfs from Example 3.47 and see how the induced CMl tree distinguishes them whereas the induced Ml trees identifies them as one: f : The notion of CMl trees is related to the notion of chiral merge trees in the sense of [Cur19] by the interplay between abstract and geometrical simplicial complexes.In detail, the bijection is given as follows: Construction 6.12.Let (T, λ) be a CMl tree.We define a chiral merge tree |(T, λ)| associated to (T, λ) as follows: The compact rooted tree is given by the geometric realization |T |.We attach a distinguished edge e ∞ to the vertex which corresponds to the root of T in order to obtain a cell complex which we will by abuse of notation also refer to as |T |.The map π : |T | → R is given by λ on vertices, and by a linear extension of λ on edges.
For the other way around let π : T → R be a chiral merge tree in the sense of [Cur19, Def 5.3].We define an Ml tree abs(T ) associated to T as follows: We take the 0-skeleton T 0 as the vertex set and the 1-skeleton (T \ {e ∞ }) 1 as the set of edges.We define the node which corresponds to v ∞ to be the root of abs(T ).The labeling λ is given by π.
The proof that the two constructions are inverse to each other is straightforward.
Furthermore, there is a similar bijection between the two notions of Morse functions: Construction 6.13.Let (P, f ) be a dMf with only critical cells on an oriented path.We define a Morse-like function f on the interval which attains minima at the boundary as follows: Let k + 1 be the number of 0-simplices in P .We denote the 0-simplices of P by n 0 , n 1 , . . ., n k from left to right with respect to the given orientation.Then we define f ( i k ) := f (n i ) for i ∈ {0, 1, . . ., k}.We denote the 1-simplices of P by e 1 , . . ., e k , again according to the given orientation.Then we define f ( 2i−1 2k ) := f (e i ) for i ∈ {0, 1, . . ., k}.We define f on the rest of the interval as the linear extension.This makes f a distinctvalued PL function that attains minima at the boundary.Hence, f is Morse-like.
For the other way around let f : I → R be a Morse-like function that attains minima at the boundary.We define a path P and a dMF f ′ on P as follows: Let n 0 , n 1 , . . ., n k be the local minima of f ordered by the orientation on I, so in particular n 0 = 0 and n k = 1.We define P to be a path with k + 1 simplices of dimension 0. We choose one of the endpoints to be denoted by s 0 and the one by s k .We denote the other 0-simplices such that their indices are in accordance with their position in the simplex order (Definition 4.15), making s 0 the minimal simplex with respect to the simplex order.The dMf f ′ is defined by f ′ (s i ) := f (n i ) on 0-simplices.Let c 1 , . . ., c k be the local maxima of f , ordered in accordance to the orientation on I, and let e 1 , . . ., e k be the 1-simplices of P , ordered in accordance to the aforementioned simplex order on P .Then f ′ is defined by f ′ (e i ) := f (c i ) on 1-simplices.
It is easy to check that the two given constructions are inverse to each other.
A theorem which, analogously to Theorem 6.4, defines a pair of inverse bijections M C ( , ) : + DMF crit P ↔ CMlT : Φ can be proved similarly to the proof of Theorem 6.4.The difference is that the induced CMl tree keeps track of symmetry equivalences in the sense that symmetry equivalences of dMfs induce reflections at roots of subtrees on the induced CMl trees.The map Φ can be defined the same way as before.Alternatively, one could define the bijection Φ as the composition abs Here Ψ denotes the bijection between the set of Morse-like functions on the interval M and the set of chiral merge trees X from [Cur19, Cor 6.11].The map i is the inclusion induced by considering Ml trees as CMl trees.Ml trees can be considered as a special kind of CMl trees because they only differ in the additional property (2) of Definition 3.17 which does not need to hold for CMl trees.The map / symm is the quotient map that identifies symmetry equivalent dMFs.The map o JS is defined as the composition Φ • i • M( , ).This definition coincides with choosing the representative of a dMf (P, f ) with respect to symmetry equivalence such that the simplex order on P is compatible with f in the following way: At each critical edge e with f (e) = c the connected component of P c−ε that corresponds to M(e) l /M(e) r is left/right of the edge e with respect to the orientation induced by the simplex order.Here we recall that M(e) denotes the inner node of M(P, f ) that corresponds to the critical edge e and that M(e) l /M(e) r denotes the left/right child node of M(e).In Example 6.11 we have o JS (P, g) = (P, f ) where (P, f ) is oriented from left to right.
The map JS is defined as JS := M( , ) • / symm • Φ.This definition coincides with division by the equivalence relation generated by reflections of subtrees.
Example 6.14.We consider how a sequence of reflections of subtrees maps the CMl trees from Example 6.11 to each other.Here, we denote by a λ the reflection of the subtree with root labeled λ.As a result, the map Φ can be seen as a discrete version of the map Ψ from [Cur19, Cor 6.11].Moreover, moving from the setting of [Cur19] to the setting of [JS22] basically means to divide by symmetry equivalences which allows the authors of [JS22] to generalize the construction of the induced merge tree to dMfs on trees.In order to extend our generalization Theorem 6.6 to the oriented case, one would need to find a notion of orientation-preserving cm equivalences which distinguishes symmetryequivalent dMfs.

Further Directions and Possible Applications
In this section we want to take a look at possible applications of our results.The structured overview of the different notions of equivalence of discrete Morse functions and their connections to each other might be useful to explore the space of discrete Morse functions on a given simplicial complex.Even though the construction of the induced merge tree from [JS22] does not easily extend to arbitrary simplicial complexes, the notions of equivalence from this article do.Hence, one could try to use e.g. the notion of symmetry equivalence to structure the space of discrete Morse functions in a nice way, i.e. into orbits of a groupoid action.In a second step, one could then try to define the space of merge trees as a quotient of the space of discrete Morse functions on some "large enough" simplicial complex.With such a construction, one could assemble the results from this article and the results from [CDG + 21] into an analysis of a larger instance of the persistence map.
Aside from this, one could try to generalize and enhance the construction of the induced merge tree from [JS22] to arbitrary simplicial complexes.Then, in a second step, one could try to use the induced merge tree to find possible cancellations of pairs of critical simplices.This way, the induced merge tree might be helpful to optimize discrete Morse functions.
Furthermore, one could study the possible Morse orders on a given merge tree.With a classification of all Morse orders on a given merge tree T , one could classify all discrete Morse functions on any given tree that induce T as the induced merge tree with the help of Definition 4.20 and cm equivalences.
Ultimately, the proofs of Theorem 6.6 and all the lemmas that lead to it describe exactly which information is lost when considering the induced Ml tree instead of the original dMf.This knowledge might be useful for applications in TDA because it tells the user which kind of features will not be seen by the induced merge tree, and hence, by the persistent zeroth homology and the barcode.Moreover, the knowledge about the exact lost information can be used to enhance the induced merge tree with extra structure such that it no longer disregards certain desired information.
Proposition 3.26.The Morse labeling induced by a Morse order and the order induced by a Morse labeling define inverse bijections iMl : MoT /∼ = ∼ = ← → MlT / ∼ : iMo where ∼ denotes order equivalence.

Definition 4. 3 .
Let T be a merge tree.We define the index Morse order ≤ io on the nodes of T as follows:Let a and b be arbitrary nodes of T .If a is a leaf node and b is an inner node, then we define a ≤ io b.If either both a and b are leaf nodes or both a and b are inner nodes, we consider the following: Let a 0 a 1 . . .a n be the path word corresponding to a and b 0 b 1 . . .b n the path word corresponding to b.Furthermore, let k ∈ N be maximal such that a i = b i for all i ≤ k.If a k = b k = L/R we define a ≤ io b if and only if one of the following cases hold: a) a k+1 = L and b k+1 = R/a k+1 = R and b

Proposition 4. 6 .
The index Morse order is a Morse order on T .Sketch of Proof.The proof is a straightforward application of the definitions and involves case distinctions corresponding to the cases a), b), and c) from Definition 4.3.Definition 4.7.We call the Morse labeling λ io : (V (T ), ≤ io ) → {0, 1, . . ., i(T ) + l(T ) − 1} induced by the index Morse order, see Definition 3.19, the index Morse labeling on T .That is, a node c of T is labeled with λ io (c).Example 4.8.The index Morse order from Example 4.4 induces the following index Morse labeling:

Figure 1 .
Figure 1.Relationships Between Merge Trees and DMFs on Paths

Figure 2 .
Figure 2. Relationship to the continuous case the two possible definitions for Φ coincide and that the diagram from Figure2commutes are straightforward.