AFTD Auto-Formalizing Theoretical Domains

hunger_transient_time

def

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 → ℚ, hunger_transient_time P T h is the infimum sInf of the set of natural numbers t such that hunger_iter P t h belongs to hunger_recurrent_basin P T.

Statement

noncomputable def hunger_transient_time {n : ℕ} [NeZero n]
    (P : Matrix (Fin n) (Fin n) ℚ) (T : ℕ) (h : Fin n → ℚ) : ℕ
Defined in
arXiv:2610.08949 after Thm 3.8
Verified
26 Oct 2026
Axioms
none listed
Built on 2
  • 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 2

Read back from the Lean

For a positive natural number $n$, an $n \times n$ rational matrix $P$, a natural number $T$, and an initial state vector $h : \text{Fin } n \to \mathbb{Q}$, hunger_transient_time P T h defines the natural number given by the infimum (sInf) of the set of natural numbers $t$ such that hunger_iter P t h belongs to hunger_recurrent_basin P T.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The transient time to reach the recurrent basin of a rational hunger game. -/
noncomputable def hunger_transient_time {n : ℕ} [NeZero n]
    (P : Matrix (Fin n) (Fin n) ℚ) (T : ℕ) (h : Fin n → ℚ) : ℕ := sInf {t : ℕ | hunger_iter P t h ∈ hunger_recurrent_basin P T}
See it in the graphDiscuss this resultChallenge it