coord_shift_edge_cond
def
A pair of vectors (x, y) satisfies the edge condition for a subset S of ZMod p if y_j - x_j is in S for all coordinates j < d - 1, and y_{d-1} = x_{d-1} at the final coordinate.
Statement
def coord_shift_edge_cond {p d : ℕ} (S : Set (ZMod p)) (x y : Fin d → ZMod p) : Prop
- Defined in
- arXiv:2611.05261 equation (4)
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Used by 1
- coord_shift_hypergraphThe tripartite 3-uniform hypergraph H(p, d, S) has vertex parts {i} × (ZMod p)^d for i in Fin 3, with edges {(0, x), (1, y), (2, z(x,y))}…
Read back from the Lean
Given natural numbers $p$ and $d$, a subset $S \subseteq \mathbb{Z}/p\mathbb{Z}$, and two vectors $x, y : \mathrm{Fin}(d) \to \mathbb{Z}/p\mathbb{Z}$, coord_shift_edge_cond S x y asserts that:
1. For every index $i \in \mathrm{Fin}(d)$, if $i < d - 1$ (written as $i + 1 < d$), then $y(i) - x(i) \in S$; and
2. For every index $i \in \mathrm{Fin}(d)$, if $i + 1 = d$ (the last coordinate), then $y(i) = x(i)$.
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
/-- Edge condition on pairs (x, y) in the coordinate-shift hypergraph H(p, d, S). -/ def coord_shift_edge_cond {p d : ℕ} (S : Set (ZMod p)) (x y : Fin d → ZMod p) : Prop := (∀ (i : Fin d), i.val + 1 < d → y i - x i ∈ S) ∧ (∀ (i : Fin d), i.val + 1 = d → y i = x i)