real_hunger_difference_lattice
def
The difference lattice L of an n-by-n real matrix P is the set of all real row vectors of the form z * (P - I) for some integer vector z with zero coordinate sum.
Statement
def real_hunger_difference_lattice {n : ℕ} (P : Matrix (Fin n) (Fin n) ℝ) : Set (Fin n → ℝ)- Defined in
- scout/2610-08949-primitive-periods-in-greedy-chip-firing-games.md:149
- Verified
- 29 Oct 2026
- Axioms
- none listed
Read back from the Lean
Given a natural number n and an n × n real matrix P, real_hunger_difference_lattice P is the set of vectors v : Fin n → ℝ such that there exists an integer vector z : Fin n → ℤ whose entries sum to zero (∑ i, z i = 0) and v is equal to the vector-matrix product of z (cast to ℝ) with P - 1 (where 1 is the n × n identity matrix).
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 difference lattice generated by rows of P - I with integer zero-sum weights. -/ def real_hunger_difference_lattice {n : ℕ} (P : Matrix (Fin n) (Fin n) ℝ) : Set (Fin n → ℝ) := { v | ∃ z : Fin n → ℤ, (∑ i, z i = 0) ∧ v = Matrix.vecMul (fun i => (z i : ℝ)) (P - 1) }