hunger_zero_sum_recurrent_tile
def
For 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 hunger_iter P n h = h under the hunger dynamics.
Statement
def hunger_zero_sum_recurrent_tile {n : ℕ} [NeZero n]
(P : Matrix (Fin n) (Fin n) ℝ) : Set (Fin n → ℝ)- Defined in
- arXiv:2610.08949, Section 3
- Verified
- 29 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 1
- hunger_zero_sum_recurrent_tile_subset_zero_sumThe zero-sum recurrent hunger tile is contained in the zero-sum hyperplane.
Read back from the Lean
Given a positive natural number $n$ (with typeclass instance [NeZero n]) and an $n \times n$ real matrix $P$, hunger_zero_sum_recurrent_tile P is the set of vectors $h : \text{Fin } n \to \mathbb{R}$ such that the sum of the coordinates of $h$ is zero ($\sum_{i : \text{Fin } n} h(i) = 0$) and $h$ is a fixed point of $n$ iterations of the hunger step operator hunger_step P (hunger_iter P n 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 hunger tile in the zero-sum hyperplane, consisting of zero-sum vectors fixed under n iterations of the hunger map. -/ def hunger_zero_sum_recurrent_tile {n : ℕ} [NeZero n] (P : Matrix (Fin n) (Fin n) ℝ) : Set (Fin n → ℝ) := {h : Fin n → ℝ | ∑ i, h i = 0 ∧ hunger_iter P n h = h}