hunger_recurrent_basin
def
For 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_recurrent_basin P T is the set of vectors h : Fin n → K such that hunger_iter P T h = h.
Statement
def hunger_recurrent_basin {n : ℕ} [NeZero n] {K : Type*} [LinearOrder K] [AddGroup K] [One K] (P : Matrix (Fin n) (Fin n) K) (T : ℕ) : Set (Fin n → K)
- Defined in
- arXiv:2610.08949 Section 3, Prop 3.1
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Built on 1
- 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 3
- 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_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…
- 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…
Read back from the Lean
Given a positive natural number n, a type K equipped with a linear order, an additive group structure, and an element 1, a matrix P : Matrix (Fin n) (Fin n) K, and a natural number T, hunger_recurrent_basin P T is defined as the set of vectors h : Fin n → K that are fixed points of T iterations of hunger_step P, i.e., {h : Fin n → K | hunger_iter P T h = h}.
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 recurrent basin of a hunger game with minimal period T. -/ def hunger_recurrent_basin {n : ℕ} [NeZero n] {K : Type*} [LinearOrder K] [AddGroup K] [One K] (P : Matrix (Fin n) (Fin n) K) (T : ℕ) : Set (Fin n → K) := {h | hunger_iter P T h = h}