Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.4 — facial/graphical irreducibility and indecomposability of m-topical maps

Proved
TopicalIrreducibility.Relations.irreducibility_relations

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

irreducibilitynonlinear-perron-frobeniusp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1topical-maps

Fix a finite dimension nnn. Let f:R≥0n→R≥0nf:\mathbb R^n_{\ge0}\to\mathbb R^n_{\ge0}f:R≥0n​→R≥0n​ be an m-topical map (continuous, order-preserving, homogeneous, with f(R>0n)⊆R>0nf(\mathbb R^n_{>0})\subseteq\mathbb R^n_{>0}f(R>0n​)⊆R>0n​). Then:

  1. if fff is facially irreducible or graphically irreducible, then fff is indecomposable;
  2. if fff is m-convex and indecomposable, then fff is graphically irreducible;
  3. if fff is subadditive and indecomposable, then fff is facially irreducible.

In symbols,

(FI∨GI)⇒Ind,(m-convex∧Ind)⇒GI,(subadditive∧Ind)⇒FI.(\mathrm{FI}\vee\mathrm{GI})\Rightarrow\mathrm{Ind},\qquad (\text{m-convex}\wedge\mathrm{Ind})\Rightarrow\mathrm{GI},\qquad (\text{subadditive}\wedge\mathrm{Ind})\Rightarrow\mathrm{FI}.(FI∨GI)⇒Ind,(m-convex∧Ind)⇒GI,(subadditive∧Ind)⇒FI.

Here FI\mathrm{FI}FI, GI\mathrm{GI}GI and Ind\mathrm{Ind}Ind abbreviate facial irreducibility, graphical irreducibility and indecomposability, respectively. Facial irreducibility means no nontrivial proper closed face FJF_JFJ​ of the cone is invariant; graphical irreducibility means the Gaubert–Gunawardena graph G(f)G(f)G(f), with an arc i→ji\to ji→j when f(1+te{j})i→∞f(\mathbf 1+te_{\{j\}})_i\to\inftyf(1+te{j}​)i​→∞ as t→∞t\to\inftyt→∞, is strongly connected; The vector 1\mathbf 11 has every entry equal to 111, and eJe_JeJ​ is the indicator vector of JJJ. Indecomposability means that for every nonempty proper J⊂[n]J\subset[n]J⊂[n] some coordinate i∉Ji\notin Ji∈/J has f(1+teJ)i→∞f(\mathbf 1+te_J)_i\to\inftyf(1+teJ​)i​→∞.

The theorem organizes the irreducibility notions for nonlinear Perron–Frobenius theory: indecomposability is the weakest, it coincides with graphical irreducibility for m-convex maps, and all three coincide for subadditive maps (which are m-convex by Lemma 1.4).

Formalization Note The same arbitrary m-topical fff appears in all three clauses; m-convexity and subadditivity are premises of clauses 2 and 3 only. The dimension nnn is arbitrary, including n=0n=0n=0 and n=1n=1n=1, where there is no nonempty proper subset of [n][n][n] and every clause holds.

Differences from the source:

  • generalization: the dimension-zero case is not discussed → every n : Nat, including n = 0; reason: there are no nonempty proper coordinate subsets or vertices at n = 0, so all three predicates hold; every positive-dimensional source instance is retained.
  • encoding: real nonnegative coordinate vectors indexed by 1,...,n, and subsets of these indices → Fin n → ℝ≥0 with its product topology and pointwise operations; subsets are Finset (Fin n); reason: the coordinates are relabeled from 1-based to 0-based; the type represents the entire closed real cone, and positive NNReal scalars represent all positive real scalars.
  • encoding: the limit of each outside coordinate ray is finite → for each outside coordinate i there exists B : ℝ≥0 bounding f(1 + t e_J)_i for every t : ℝ≥0; reason: order preservation makes each full nonnegative-real ray monotone, so boundedness is equivalent to convergence to a finite limit; restricting t to the nonnegative reals changes no limit at positive infinity.
  • encoding: the directed graph is strongly connected → every ordered pair is related by Relation.ReflTransGen of the source arc relation; reason: this is directed reachability by possibly empty paths, preserving the usual singleton-vertex convention and the source arc orientation.
Preamble
import Mathlib
import Definitions.Def_TopicalIrreducibility_Relations_MTopical
import Definitions.Def_TopicalIrreducibility_Relations_Irreducibility

open scoped NNReal
Formal statement
namespace TopicalIrreducibility.Relations

/-- Theorem 2.4 (Lins, p. 4). Let `f : ℝⁿ_{≥0} → ℝⁿ_{≥0}` be m-topical.
(1) facially or graphically irreducible ⇒ indecomposable;
(2) m-convex and indecomposable ⇒ graphically irreducible;
(3) subadditive and indecomposable ⇒ facially irreducible. -/
theorem irreducibility_relations {n : ℕ} (f : StdCone n → StdCone n) (hf : IsMTopical f) :
    ((FaciallyIrreducible f ∨ GraphicallyIrreducible f) → Indecomposable f) ∧
    (IsMConvex f → Indecomposable f → GraphicallyIrreducible f) ∧
    (IsSubadditive f → Indecomposable f → FaciallyIrreducible f) := by sorry

end TopicalIrreducibility.Relations
Source
Brian Lins, Irreducibility for Topical Maps, STOC 2027 submission #201 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/201.pdf, p. 4, Theorem 2.4 (proof pp. 4–5); PDF page = printed page
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me