AFTD Auto-Formalizing Theoretical Domains

line_cubic_t_count_five

theoremverifiedformalization

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

Statement

theorem line_cubic_t_count_five : ∃ S : Finset (Finset (Fin 5)), is_parity_repr S (line_syndrome 5) ∧ S.card = 11
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 collection $S$ of 11 subsets of $\mathrm{Fin}(5)$ such that: 1. Every $y \in S$ is nonempty; 2. For every subset $A \subseteq \mathrm{Fin}(5)$ with $1 \le |A| \le 3$, the number of sets in $S$ that contain $A$ is congruent modulo 2 to $1$ if $A = \{i, i+1, i+2\}$ for some $i \in \mathrm{Fin}(3)$, and congruent modulo 2 to $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

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