Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cyclicity for commensurable entries.

Proved
TropicalLA.exists_cyclicity_of_commensurable

by raver1975 · Sep 17, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalogalgebra

Cyclicity for commensurable entries. If some positive integer multiple d·A of A has integer entries (equivalently: the entries of A are rationals with a common denominator), then the tropical powers of A are eventually exactly periodic with the spectral shift p·λ. In particular this covers every rational matrix.

theorem TropicalLA.exists_cyclicity_of_commensurable(A : Matrix ι ι ℝ) (d : ℕ) (hd : 0 < d)
    (hA : ∀ i j, ∃ z : ℤ, (d : ℝ) * A i j = (z : ℝ)) :
    ∃ p N : ℕ, 0 < p ∧ ∀ m, N ≤ m →
      tpow A (m + p) = fun i j => (p : ℝ) * maxCycleMean A + tpow A m i j := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Algebra/TropicalLinearAlgebra/TropicalCyclicityInteger.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Algebra/TropicalLinearAlgebra/TropicalCyclicityInteger.lean
import Mathlib
import Definitions.Def_Algebra_TropicalLinearAlgebra_TropicalCyclicity
import Definitions.Def_Algebra_TropicalLinearAlgebra_TropicalMatrix
import Definitions.Def_Algebra_TropicalLinearAlgebra_TropicalPerronFrobenius
/-
# Cyclicity of tropical powers for integer matrices

This file settles conjecture **C1** of `FUTURE_DIRECTIONS.md` — *tropical powers are
eventually exactly periodic* — for matrices with integer entries (equivalently, after
rescaling, for matrices with rational entries):

  `exists_cyclicity`: for `A` with integer entries there are a period `p ≥ 1` and a
  transient `N` such that for all `m ≥ N`

      `A^{⊗(m+p+1)} = (p·λ) ⊗ A^{⊗(m+1)}`,  i.e.  `tpow A (m+p) = fun i j => p*λ + tpow A m i j`,

  where `λ = maxCycleMean A`.

The proof is exactly the strategy outlined in the conjecture, now made precise:

1. entries of tropical powers of an integer matrix are integers (`tpow_isInt`);
2. `q·λ` is an integer, where `q ≤ n` is the length of a critical cycle
   (`exists_critical_cycle_int`);
3. by `exists_uniform_entry_bound` the normalised powers `A^{⊗(m+1)} − (m+1)λ` live in a
   fixed compact box, so along the arithmetic progression `m = N + t·q` the *integer*
   matrices `A^{⊗(m+1)} − t·(qλ)` take only finitely many values;
4. pigeonhole gives two equal terms, i.e. one exact relation
   `tpow A (M₀ + p) = p·λ + tpow A M₀`;
5. the relation propagates to all later exponents because tropical multiplication commutes
   with adding a constant (`tmul_const_add`).

Boundedness alone does not give periodicity over ℝ; integrality is what makes the box
finite, and that is exactly the hypothesis used here.
-/

open TropicalLA

variable {ι : Type*} [Fintype ι] [Nonempty ι]









/-! ## Positive rescaling, and cyclicity for commensurable entries -/


variable {A : Matrix ι ι ℝ} {lam c : ℝ} {v : ι → ℝ}
Formal statement
theorem TropicalLA.exists_cyclicity_of_commensurable(A : Matrix ι ι ℝ) (d : ℕ) (hd : 0 < d)
    (hA : ∀ i j, ∃ z : ℤ, (d : ℝ) * A i j = (z : ℝ)) :
    ∃ p N : ℕ, 0 < p ∧ ∀ m, N ≤ m →
      tpow A (m + p) = fun i j => (p : ℝ) * maxCycleMean A + tpow A m i j := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Algebra/TropicalLinearAlgebra/TropicalCyclicityInteger.lean#L271

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