Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.11.1 — the Crandall–Tartar theorem

Proved
PalmQueueing.Recurrence.crandall_tartar

by mikedeng1 · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

couplingnon-expansivequeueingstationary-processstochastic-recurrence

Theorem 2.11.1 (Crandall and Tartar). If ϕ\phiϕ is homogeneous, then it is monotone if and only if it is non-expansive.

Monotonicity and non-expansiveness have nothing to do with each other in general; homogeneity is what ties them together. The theorem is why §2.11 can call its subject "non-expansive stochastic recurrences" while every model it treats is built from monotone maps, and it is what lets Kingman's sub-additive ergodic theorem be applied to those models.

One direction is a two-line computation. Assume ϕ\phiϕ monotone; then for all xxx and yyy in RK\mathbb{R}^KRK,

ϕ(x)=ϕ(y+(x−y))≤ϕ(y+(max⁡i(xi−yi))1)=ϕ(y)+(max⁡i(xi−yi))1≤ϕ(y)+∥x−y∥∞1,\phi(x) = \phi(y + (x-y)) \le \phi\big(y + (\max_i(x^i - y^i))\mathbf{1}\big) = \phi(y) + (\max_i(x^i - y^i))\mathbf{1} \le \phi(y) + \|x-y\|_\infty \mathbf{1} ,ϕ(x)=ϕ(y+(x−y))≤ϕ(y+(imax​(xi−yi))1)=ϕ(y)+(imax​(xi−yi))1≤ϕ(y)+∥x−y∥∞​1,

and non-expansiveness follows from this and the symmetrical relationship obtained by interchanging xxx and yyy. The other direction applies non-expansiveness to xxx and x+aeix + a e_ix+aei​ for the canonical basis vectors eie_iei​.

It is stated as an equivalence because both directions are the theorem; the one §2.11 uses is that monotone-and-homogeneous models are automatically non-expansive.

Preamble
import Mathlib
import Definitions.Def_PalmQueueing_Recurrence_MonotoneHomogeneous

/-!
# Theorem 2.11.1: the Crandall-Tartar theorem (§2.11.1, p.154)
-/
Formal statement
namespace PalmQueueing.Recurrence

/-- **Theorem 2.11.1** (the Crandall-Tartar theorem, p.154). If `φ` is homogeneous, then it is
monotone **if and only if** it is non-expansive.

The theorem establishes a link between monotonicity and non-expansiveness, two properties that
have nothing to do with each other in general: homogeneity is what ties them together. It is why
§2.11 can call its subject "non-expansive stochastic recurrences" while every model it treats is
built from monotone maps, and it is what lets Kingman's sub-additive ergodic theorem be applied to
those models.

One direction is a two-line computation from monotonicity and homogeneity,
`φ(x) = φ(y + (x − y)) ≤ φ(y + (max_i(xⁱ − yⁱ))1) = φ(y) + (max_i(xⁱ − yⁱ))1 ≤ φ(y) + ‖x − y‖_∞ 1`,
and the symmetric relation with `x` and `y` interchanged. The other uses non-expansiveness on
`x` and `x + a e_i` for the canonical basis vectors.

The equivalence is stated as an equivalence, not as one implication: both directions are the
theorem, and the useful one in §2.11 is that monotone-and-homogeneous models are automatically
non-expansive. -/
theorem crandall_tartar {K : ℕ} (phi : (Fin K → ℝ) → Fin K → ℝ)
    (hhom : IsHomogeneousMap phi) :
    IsMonotoneMap phi ↔ IsNonExpansiveMap phi := by sorry

end PalmQueueing.Recurrence
Source
Baccelli & Bremaud, Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences, 2nd ed., Springer 2003, p. 154, Theorem 2.11.1
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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