AFTD Auto-Formalizing Theoretical Domains

line_cubic_t_count_six

theoremverifiedformalization

For n = 6, there exists a parity representation of the line cubic syndrome of cardinality 13.

Statement

theorem line_cubic_t_count_six : ∃ S : Finset (Finset (Fin 6)), is_parity_repr S (line_syndrome 6) ∧ S.card = 13
Formalizes
arXiv:2610.01024, Proposition 65 and Appendix L
Verified
05 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • line_syndromeThe 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.
  • is_parity_reprA finite set S of nonempty parities on n qubits is a parity representation of a syndrome s if the moment of S at every non-empty subset A…

Read back from the Lean

There exists a family $S$ of 13 subsets of Fin 6 such that every member of $S$ is nonempty, and $S$ is a parity representation of line_syndrome 6 (that is, for every subset $A \subseteq \text{Fin } 6$ with $1 \le |A| \le 3$, the number of sets in $S$ containing $A$ is odd if $A$ is of the form $\{i, i+1, i+2\}$ for some $i \in \{0, 1, 2, 3\}$, and even 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

/-- Tightness at n = 6: the line cubic syndrome admits a parity representation of size 13. -/theorem line_cubic_t_count_six : ∃ S : Finset (Finset (Fin 6)), is_parity_repr S (line_syndrome 6) ∧ S.card = 13 := by  refine ⟨{{0, 1, 2, 3, 4, 5}, {0, 1, 3, 4, 5}, {0, 2, 3, 4, 5}, {0, 3, 4, 5}, {1, 2, 4, 5}, {1, 4, 5}, {2, 3, 4, 5}, {2, 3, 5}, {2, 5}, {3}, {3, 4}, {4}, {4, 5}}, ?_, by decide +kernel⟩  unfold is_parity_repr line_syndrome  decide +kernel
See it in the graphDiscuss this resultChallenge it