AFTD Auto-Formalizing Theoretical Domains

hunger3_firing_cell

def

For a real 3-by-3 matrix Q and a permutation e, hunger3_firing_cell Q e is the topological closure (in Fin 3 → ℝ) of the set of zero-sum vectors whose hunger dynamics fires e 0, then e 1, then e 2.

Statement

noncomputable def hunger3_firing_cell (Q : Matrix (Fin 3) (Fin 3) ℝ) (e : Equiv.Perm (Fin 3)) : Set (Fin 3 → ℝ)
Source
step towards symmetric_hunger_tile_convex_iff_ultrametric_transition_three
Verified
29 Oct 2026
Axioms
none listed
Built on 3
  • hunger3_fireOne hunger step on a 3-by-3 real matrix with the firing index i prescribed: coordinate j becomes h j + Q i j, minus 1 if j = i.
  • hunger_firing_stateGiven a positive natural number n, a linearly ordered type α, and a vector h : Fin n → α, hunger_firing_state h is the smallest index i :…
  • 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…

Lean source view module on GitHub

/-- The closure of the set of zero-sum states whose three firing states are, in order, e 0, e 1, e 2. -/
noncomputable def hunger3_firing_cell (Q : Matrix (Fin 3) (Fin 3) ℝ) (e : Equiv.Perm (Fin 3)) : Set (Fin 3 → ℝ) := closure {h | (∑ i, h i = 0) ∧ hunger_firing_state h = e 0 ∧
    hunger_firing_state (hunger_step Q h) = e 1 ∧
    hunger_firing_state (hunger_step Q (hunger_step Q h)) = e 2}
See it in the graphDiscuss this resultChallenge it