line_syndrome
def
The syndrome of the line cubic form assigns 1 to adjacent triples {i, i+1, i+2} and 0 to all other subsets of Fin n.
Statement
def line_syndrome (n : ℕ) (A : Finset (Fin n)) : ZMod 2- Defined in
- arXiv:2610.01024, Definition 20 and Proposition 65
- Verified
- 04 Oct 2026
- Axioms
- none listed
- Used by 8
- line_cubic_t_count_fiveFor n = 5, there exists a parity representation of the line cubic syndrome of cardinality 11.
- line_cubic_parity_repr_eval_zeroFor n ≥ 5, any affine evaluation (∑_{j ∈ y} c_j = b) on all parities y ∈ S of a parity representation S of line_syndrome n forces c = 0.
- line_syndrome_emptyThe empty set has syndrome 0 under the line syndrome for n = 5.
- line_cubic_t_count_sixFor n = 6, there exists a parity representation of the line cubic syndrome of cardinality 13.
- line_cubic_parity_repr_nonemptyEvery parity representation of the line cubic syndrome for n ≥ 5 is nonempty, because line_syndrome n {0, 1, 2} = 1.
- line_cubic_t_count_lower_boundFor any n ≥ 5, every parity representation of the line cubic syndrome has cardinality at least 2n + 1.
- line_cubic_parity_repr_orthoEvery parity representation S of line_syndrome n satisfies ∑_{y ∈ S} (∑_{j ∈ y} c_j)(∑_{k ∈ y} d_k) = 0 and ∑_{y ∈ S} ∑_{j ∈ y} c_j = 0,…
- open_problem_line_cubic_t_countFor every integer n ≥ 5, there exists a parity representation of the line cubic syndrome of cardinality 2n + 1.
Read back from the Lean
Given a natural number $n$ and a finite subset $A$ of $\mathrm{Fin}(n)$, $\mathrm{line\_syndrome}(n, A)$ is defined to be the element of $\mathbb{Z}/2\mathbb{Z}$ that is $1$ if there exists an index $i \in \mathrm{Fin}(n - 2)$ such that $A$ is the three-element set $\{i, i + 1, i + 2\}$ (cast into $\mathrm{Fin}(n)$), and $0$ otherwise.
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 syndrome of the line cubic form, supported on adjacent index triples. -/ def line_syndrome (n : ℕ) (A : Finset (Fin n)) : ZMod 2 := if ∃ i : Fin (n - 2), A = {⟨i.val, by omega⟩, ⟨i.val + 1, by omega⟩, ⟨i.val + 2, by omega⟩} then 1 else 0