ternary_affine_hyperplane
def
Given an explicit natural number n, a vector a : Fin n → ZMod 3, and a scalar b : ZMod 3, the ternary affine hyperplane is the finite set (Finset) of all vectors x : Fin n → ZMod 3 such that the sum over all i : Fin n of a i * x i equals b.
Statement
def ternary_affine_hyperplane (n : ℕ) (a : Fin n → ZMod 3) (b : ZMod 3) : Finset (Fin n → ZMod 3)- Defined in
- arXiv:2610.32789, Section 3.1
- Verified
- 30 Oct 2026
- Axioms
- none listed
- Used by 5
- ternary_single_point_repair_is_minimal_line_coverFor every explicit integer n ≥ 3, every vector a : Fin n → ZMod 3 with all coordinates nonzero, every scalar b : ZMod 3, every point p in…
- ternary_minimal_line_cover_minimum_card_eq_hyperplaneFor every natural number n ≥ 1 and every inclusion-minimal ternary line cover B in (Fin n → ZMod 3) with cardinality 3^(n - 1), B is an…
- ternary_affine_hyperplane_cardFor every natural number $n \ge 1$, every vector $a \in (\mathbb{Z}/3\mathbb{Z})^n$ with all non-zero coordinates, and every…
- ternary_affine_hyperplane_is_minimal_line_coverFor any integer $n \ge 1$, any vector $a : \mathrm{Fin}\ n \to \mathbb{Z}/3\mathbb{Z}$ with all coordinates nonzero, and any scalar…
- ternary_single_point_repair_cardFor every explicit integer n ≥ 1, every vector a : Fin n → ZMod 3 with all coordinates nonzero, every scalar b : ZMod 3, every point p in…
Read back from the Lean
Given a natural number $n$, a vector $a : \text{Fin } n \to \mathbb{Z}/3\mathbb{Z}$, and a scalar $b : \mathbb{Z}/3\mathbb{Z}$, ternary_affine_hyperplane n a b is defined as the finite set of all vectors $x : \text{Fin } n \to \mathbb{Z}/3\mathbb{Z}$ such that $\sum_{i \in \text{Fin } n} a(i) x(i) = b$.
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 affine hyperplane in (Fin n → ZMod 3) with equation sum_i a_i * x_i = b as a Finset. -/ def ternary_affine_hyperplane (n : ℕ) (a : Fin n → ZMod 3) (b : ZMod 3) : Finset (Fin n → ZMod 3) := Finset.filter (fun x => (∑ i : Fin n, a i * x i) = b) Finset.univ