AFTD Auto-Formalizing Theoretical Domains

hunger_zero_sum_recurrent_tile_subset_zero_sum

theoremverified

The zero-sum recurrent hunger tile is contained in the zero-sum hyperplane.

Statement

theorem hunger_zero_sum_recurrent_tile_subset_zero_sum {n : ℕ} [NeZero n]
    (P : Matrix (Fin n) (Fin n) ℝ) :
    hunger_zero_sum_recurrent_tile P ⊆ {h : Fin n → ℝ | ∑ i, h i = 0}
Source
arXiv:2610.08949, Section 3
Verified
29 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • 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…
  • 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…

Read back from the Lean

For every natural number $n$ with $n \neq 0$ and every $n \times n$ real matrix $P$, the set hunger_zero_sum_recurrent_tile P is a subset of the set of vectors $h : \mathrm{Fin}\ n \to \mathbb{R}$ whose coordinates sum to $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 inclusion follows directly from the definition of the zero-sum recurrent hunger tile. By definition, an element of this tile satisfies both the zero-sum condition and an invariance condition under $n$ iterations of the hunger map; projecting onto the first conjunct immediately gives the result.

  1. Any vector in the zero-sum recurrent hunger tile has coordinate sum zero.

    By definition, membership of a vector $h$ in `hunger_zero_sum_recurrent_tile P` requires both that $\sum_i h(i) = 0$ and that $h$ is invariant under $n$ hunger iterations. Given an arbitrary vector $h$ and the hypothesis $hh$ that it belongs to the tile, extracting the first conjunct ($hh.1$) directly yields $\sum_i h(i) = 0$, which is the defining condition for the zero-sum hyperplane.

    line 4

        hunger_zero_sum_recurrent_tile P ⊆ {h : Fin n → ℝ | ∑ i, h i = 0} := fun _h hh => hh.1

Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Every element of the zero-sum recurrent hunger tile has zero coordinate sum. -/theorem hunger_zero_sum_recurrent_tile_subset_zero_sum {n : ℕ} [NeZero n]    (P : Matrix (Fin n) (Fin n) ℝ) :    hunger_zero_sum_recurrent_tile P ⊆ {h : Fin n → ℝ | ∑ i, h i = 0} := fun _h hh => hh.1
See it in the graphDiscuss this resultChallenge it