A note on irreducibility for topical maps
Brian Lins
TL;DR
We address irreducibility for multiplicatively topical maps on the nonnegative cone and clarify the relations among facial irreducibility, graphical irreducibility, and indecomposability, in addition to related conditions like partially irreducible and imperturbable. It surveys how these notions interact with map classes (e.g., $m$-convex and subadditive maps) and provides theoretical guarantees for the existence of a positive eigenvector via slice spaces and bounded invariant sets; uniqueness results are tied to real analyticity and (M)/(N) criteria. A central methodological contribution is translating irreducibility tests into Boolean satisfiability problems using upper and lower signatures $\overline{f}$ and $\underline{f}$, enabling SAT-based certification even in large dimensions, with a special Tarjan-based SCC check for $m$-convex maps. The results offer practical, scalable tools for certifying the existence—and in some cases the uniqueness—of entrywise positive eigenvectors in nonlinear Perron–Frobenius theory, with applications to max-plus, tensor-based, and population models.
Abstract
Topical maps are a nonlinear generalization of nonnegative matrices acting on the interior of the standard cone $\mathbb{R}^n_{\ge 0}$. Several analogues of irreducibility have been defined for topical maps, and all are sufficient to guarantee the existence of entrywise positive eigenvectors. In this note, we organize several of these notions, showing which conditions are stronger and when different types of irreducibility are equivalent. We also consider how to computationally check the conditions. We show that certain irreducibility conditions can be expressed as Boolean satisfiability problems that can be checked using SAT solvers. This can be used to confirm the existence of entrywise positive eigenvectors when the dimension is large.
