is_binary_linear_graph_code
def
A family C of simple graphs on vertex set [n] is a binary linear graph-code if it contains the empty graph and is closed under symmetric difference.
Statement
def is_binary_linear_graph_code (n : ℕ) (C : Set (SimpleGraph (Fin n))) : Prop
- Defined in
- arXiv:2610.35136, Section 1
- Verified
- 30 Oct 2026
- Axioms
- none listed
- Used by 2
- kst_code_linear_construction_finite_fieldLet n, s, t, r ≥ 1 be integers, and let w_1, ..., w_n in (ZMod 2)^r be vectors such that the sum of w_i over S is nonzero for every subset…
- is_binary_linear_graph_code_botThe singleton set containing only the empty graph on Fin n is a binary linear graph-code.
Read back from the Lean
Given a natural number $n$ and a set $C$ of simple graphs on the vertex type Fin n, is_binary_linear_graph_code n C asserts that:
1. The empty graph $\bot$ on Fin n (having no edges) belongs to $C$, and
2. For all simple graphs $G$ and $G'$ on Fin n, if $G \in C$ and $G' \in C$, then the symmetric difference $\mathrm{symmDiff}(G, G')$ belongs to $C$.
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
/-- A family of simple graphs on Fin n is a binary linear graph-code if it contains the empty graph and is closed under symmetric difference. -/ def is_binary_linear_graph_code (n : ℕ) (C : Set (SimpleGraph (Fin n))) : Prop := ⊥ ∈ C ∧ ∀ ⦃G G' : SimpleGraph (Fin n)⦄, G ∈ C → G' ∈ C → symmDiff G G' ∈ C