hunger_transient_time_eq_zero_of_mem_basin
For a natural number n with [NeZero n], a rational matrix P : Matrix (Fin n) (Fin n) ℚ, a natural number T, and a rational vector h : Fin n → ℚ, if h belongs to hunger_recurrent_basin P T, then hunger_transient_time P T h = 0.
Statement
theorem hunger_transient_time_eq_zero_of_mem_basin {n : ℕ} [NeZero n]
(P : Matrix (Fin n) (Fin n) ℚ) (T : ℕ) (h : Fin n → ℚ)
(h_mem : h ∈ hunger_recurrent_basin P T) :
hunger_transient_time P T h = 0- Source
- arXiv:2610.08949 after Thm 3.8
- Verified
- 27 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- hunger_transient_timeFor a natural number n with [NeZero n], a rational matrix P : Matrix (Fin n) (Fin n) ℚ, a natural number T, and a rational vector h : Fin…
- hunger_recurrent_basinFor n : ℕ with [NeZero n], a linearly ordered additive group K with one, a matrix P : Matrix (Fin n) (Fin n) K, and a natural number T,…
- hunger_iterFor n : ℕ with [NeZero n], a linearly ordered additive group K with one, a matrix P : Matrix (Fin n) (Fin n) K, a natural number t, and an…
- Used by 1
- hunger_transient_polynomial_bound_of_mem_basinFor a natural number n with [NeZero n], a rational matrix P : Matrix (Fin n) (Fin n) ℚ, a natural number T, and a rational vector h : Fin…
Read back from the Lean
For any nonzero natural number $n$, matrix $P \in \mathrm{Matrix}(\mathrm{Fin}(n), \mathrm{Fin}(n), \mathbb{Q})$, natural number $T$, and vector $h : \mathrm{Fin}(n) \to \mathbb{Q}$, if $h \in \mathrm{hunger\_recurrent\_basin}(P, T)$ (meaning iterating the hunger step $T$ times on $h$ returns $h$), then $\mathrm{hunger\_transient\_time}(P, T, h) = 0$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The transient hitting time of a vector h is defined as the infimum of the times t ∈ ℕ at which the hunger iteration from h lies in the recurrent basin. Because the 0-th iterate is h itself, which is already in the basin by hypothesis, 0 belongs to this set of hitting times. Since the infimum of a set of natural numbers is at most any of its elements, the transient time is bounded above by 0, hence must equal 0.
0 belongs to the set of times at which the iteration reaches the recurrent basin
By definition, the 0-th iterate of the hunger dynamics on h is h itself. Since h is assumed to lie in the recurrent basin (h_mem), t = 0 satisfies the defining condition of the hitting-time set.
have h0 : (0 : ℕ) ∈ {t : ℕ | hunger_iter P t h ∈ hunger_recurrent_basin P T} := by change hunger_iter P 0 h ∈ hunger_recurrent_basin P T dsimp [hunger_iter] exact h_mem
hunger_transient_time P T h ≤ 0
By definition, hunger_transient_time is the infimum (sInf) of the set of hitting times. Since 0 is an element of this set, Nat.sInf_le implies the infimum is at most 0.
uses
Nat.sInf_lehave hle : hunger_transient_time P T h ≤ 0 := by dsimp [hunger_transient_time] exact Nat.sInf_le h0
hunger_transient_time P T h = 0 automation
The transient time is a natural number bounded above by 0, so linear integer arithmetic (omega) closes the goal by showing it must equal 0.
omega
Nat.sInf_le- For any set s of natural numbers and any element m ∈ s, the infimum of s is at most m.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- For a vector already in the recurrent basin, the transient hitting time is zero. -/theorem hunger_transient_time_eq_zero_of_mem_basin {n : ℕ} [NeZero n] (P : Matrix (Fin n) (Fin n) ℚ) (T : ℕ) (h : Fin n → ℚ) (h_mem : h ∈ hunger_recurrent_basin P T) : hunger_transient_time P T h = 0 := by have h0 : (0 : ℕ) ∈ {t : ℕ | hunger_iter P t h ∈ hunger_recurrent_basin P T} := by change hunger_iter P 0 h ∈ hunger_recurrent_basin P T dsimp [hunger_iter] exact h_mem have hle : hunger_transient_time P T h ≤ 0 := by dsimp [hunger_transient_time] exact Nat.sInf_le h0 omega