coord_shift_hypergraph
The 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))} for all pairs (x, y) satisfying the edge condition with respect to S.
Statement
def coord_shift_hypergraph (p d : ℕ) (S : Set (ZMod p)) : Set (Finset (Fin 3 × (Fin d → ZMod p)))- Defined in
- arXiv:2611.05261 Section 2
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Built on 2
- coord_shift_zFor vectors x, y in (ZMod p)^d, the coordinate-shift vector z(x,y) has first coordinate x_0 + y_0 and j-th coordinate x_j + y_j + x_{j-1}…
- coord_shift_edge_condA 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…
Read back from the Lean
Given natural numbers p and d, and a subset S ⊆ ZMod p, coord_shift_hypergraph p d S is the set of finsets of vertices in Fin 3 × (Fin d → ZMod p) consisting of all 3-element sets of the form {(0, x), (1, y), (2, z)}, where x, y : Fin d → ZMod p satisfy:
1. For every index i : Fin d with i.val + 1 < d, y i - x i ∈ S;
2. For every index i : Fin d with i.val + 1 = d (the final coordinate), y i = x i;
and z : Fin d → ZMod p is given coordinate-wise by:
- z 0 = x 0 + y 0 when i.val = 0;
- z i = x i + y i + x(i - 1) * (y(i - 1))^2 when i.val ≠ 0 (where i - 1 is the predecessor index in Fin d).
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 tripartite 3-uniform hypergraph H(p, d, S) on vertex set Fin 3 × ((Fin d) → ZMod p). -/ def coord_shift_hypergraph (p d : ℕ) (S : Set (ZMod p)) : Set (Finset (Fin 3 × (Fin d → ZMod p))) := { e | ∃ x y : Fin d → ZMod p, coord_shift_edge_cond S x y ∧ e = {(0, x), (1, y), (2, coord_shift_z x y)} }