AFTD Auto-Formalizing Theoretical Domains

hunger_iter

def

For 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 initial vector h : Fin n → K, hunger_iter P t h is the t-th iterate of hunger_step P applied to h, namely (hunger_step P)^[t] h.

Statement

def hunger_iter {n : ℕ} [NeZero n] {K : Type*} [LinearOrder K] [AddGroup K] [One K] (P : Matrix (Fin n) (Fin n) K) (t : ℕ) (h : Fin n → K) : Fin n → K
Defined in
arXiv:2610.08949 Eq (2.2)
Verified
26 Oct 2026
Axioms
none listed
Built on 1
  • hunger_stepFor n : ℕ with [NeZero n], a type K with a linear order, additive group structure, and one, a matrix P : Matrix (Fin n) (Fin n) K, and a…
Used by 6
  • hunger_transient_time_eq_zero_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…
  • 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_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…
  • real_hunger_coalescence_persistsFor any positive natural number n, any n-by-n real matrix P, and any vectors h1, h2 : Fin n → ℝ, if the hunger trajectories from h1 and h2…
  • hunger_zero_sum_recurrent_tile_subset_zero_sumThe zero-sum recurrent hunger tile is contained in the zero-sum hyperplane.
  • hunger_zero_sum_recurrent_tileFor an n-by-n real matrix P, the zero-sum recurrent hunger tile is the set of vectors h in R^n with zero coordinate sum such that…

Read back from the Lean

hunger_iter is a definition: given a positive natural number n, a linearly ordered additive group K with a multiplicative unit 1, an n × n matrix P with entries in K, a natural number t, and a vector h : Fin n → K, it returns the vector in Fin n → K obtained by applying the function hunger_step P iterated t times starting from h (using Function.iterate).

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

/-- Iterating the hunger game map t times from an initial state h. -/
def hunger_iter {n : ℕ} [NeZero n] {K : Type*} [LinearOrder K] [AddGroup K] [One K] (P : Matrix (Fin n) (Fin n) K) (t : ℕ) (h : Fin n → K) : Fin n → K := (hunger_step P)^[t] h
See it in the graphDiscuss this resultChallenge it