In this section, we find all max-plus polynomials that we can use as coordinates on the barcode space and prove that they are stable with respect to the bottleneck and Wasserstein distances.
The first step is to identify 2-symmetric max-plus polynomials on the image of
\(B_n \rightarrow B\). By abuse of notation, we denote it simply by
\(B_n\). It is the quotient of the following equivalence relation: two multisets of
n intervals each,
$$\begin{aligned} I= \{(x_1,d_1), (x_2, d_2), \ldots , (x_n, d_n)\} \text { and }J = \{(x_1, d_1), (x_2, d_2), \ldots , (x_n, d_n)\}, \end{aligned}$$
are equivalent if subsets
\(A, B \subseteq \{1,\ldots ,n\}\) exist such that there is an equality of multisets
\(I\setminus \{(x_\alpha ,0)\,:\,\alpha \in A\} = J\setminus \{(x_\beta ,0)\,:\,\beta \in B\}\).
Now that we have identified functions for each
\(B_n\) separately, and we must assemble them to get functions on the barcode space. When
\(n \ge m\), the natural inclusion
$$\begin{aligned} \begin{array}{rcl} B_m &{}\rightarrow &{} B_n \\ \{(x_1, d_1), \ldots , (x_m, d_m)\} &{}\mapsto &{} \{(x_1, d_1), \ldots , (x_m, d_m), (0, 0), \ldots , (0,0)\} \end{array} \end{aligned}$$
induces
\(j_{n,m} :D_n \rightarrow D_m\), defined by
$$\begin{aligned} j_{n,m}(f)((x_1, d_1), \ldots , (x_m, d_m)) = f ((x_1, d_1), \ldots , (x_m, d_m), (0, 0), \ldots , (0,0)), \end{aligned}$$
The map
\(j_{n, m}\) is
\(S_m\)-equivariant (
\(S_m\) acts by permuting the first
m pairs of variables). It follows that we may construct composites
$$\begin{aligned} i_n^{m} :D_n^{S_n} \hookrightarrow D_n^{S_m} \xrightarrow {i_{n, m}^{S_m}} D_m^{S_m} \end{aligned}$$
and an inverse system
$$\begin{aligned} \ldots \xrightarrow {i_{n}^{n+1}} D_n^{S_n} \xrightarrow {i_{n-1}^{n}} D_{n-1}^{S_{n-1}} \xrightarrow {i_{n-2}^{n-1}} \ldots \xrightarrow {\, \,i_{1}^{2}\,\,} D_{1}^{S_{1}}. \end{aligned}$$
Observe that
$$\begin{aligned}&i_{n-1}^n (\sigma _{(0,1)^k}) = i_{n-1}^n (\sigma _{{\underbrace{(0,1),...,(0,1)}_\text {k}}}) \\&\quad = \sigma _{(0,1)^k}\, \,\text { for }\, k\ne n \quad \text {and} \quad i_{n-1}^{n} (\sigma _{(0,1)^{n}}) = \sigma _{(0,1)^{n-1}}. \end{aligned}$$
Therefore,
\(i_{n-1}^{n}\) are surjections for all positive integers
n. We do not wish to include functions with infinitely many variables, such as
\(\max _{i\in \mathbb {N}} x_i\), and for this reason, we take a filtered inverse limit of these objects instead of the inverse limit. The total degree is the filter we use. Recall that
\({\text {Deg}} p\) of a max-plus polynomial
$$\begin{aligned} p(x_1, x_2, \ldots , x_n)= & {} a_1\odot x_1^{i_1^1} x_2^{i_2^1} \ldots x_n^{i_n^1} \boxplus a_2\odot x_1^{i_1^2} x_2^{i_2^2} \ldots x_n^{i_n^2}\\&\boxplus \ldots \boxplus a_m\odot x_1^{i_1^m} x_2^{i_2^m} \ldots x_n^{i_n^m} \end{aligned}$$
is
\({\text {max}}_{1\le j \le m}(i_1^j+ i_2^j + \ldots + i_n^j)\). Let
$$\begin{aligned} {}_kD_n = \{ p\in D_n\,|\, \text {Deg}\,p \le k \} \end{aligned}$$
Map
\(i_{n-1}^{n}\) induces
\({}_ki_{n-1}^{n}:{}_kD_n^{S_n} \xrightarrow {{}_ki_{n-1}^{n}} {}_kD_{n-1}^{S_{n-1}}\). We denote the inverse limit of this system by
\(\mathscr {D}^k\). The space of max-plus polynomials on the barcode space,
\(\mathscr {D}\), is precisely
\( \displaystyle {\bigcup _{k=1}^\infty \mathscr {D}^k}\).