AFTD Auto-Formalizing Theoretical Domains

is_max_hypercube_coil

def

A coil S in Q_n is a maximum coil if its cardinality is at least that of any other coil in Q_n.

Statement

def is_max_hypercube_coil (n : ℕ) (S : Finset (Fin n → Bool)) : Prop
Defined in
arXiv:2610.36461 Section 2
Verified
29 Oct 2026
Axioms
none listed
Built on 1
  • hypercube_coilA subset S of vertices in the hypercube Q_n is a coil if it has size at least 4 and its induced subgraph is isomorphic to a cycle graph of…
Used by 1

Read back from the Lean

A predicate on a dimension n : ℕ and a finite set of vertices S : Finset (Fin n → Bool) asserting that S is a maximum hypercube coil: 1. S is a hypercube coil in dimension n, meaning that: a. S has at least 4 elements (4 ≤ S.card), and b. the subgraph of the $n$-dimensional hypercube graph (with vertices Fin n → Bool and edges between vertices differing in exactly one coordinate) induced by S is isomorphic to the cycle graph on S.card vertices (SimpleGraph.cycleGraph S.card). 2. For every other subset S' : Finset (Fin n → Bool), if S' is also a hypercube coil in dimension n, then the cardinality of S' is at most the cardinality of S (S'.card ≤ S.card).

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 maximum coil in the hypercube Q_n is a coil of maximum cardinality. -/
def is_max_hypercube_coil (n : ℕ) (S : Finset (Fin n → Bool)) : Prop :=
  hypercube_coil n S ∧ ∀ S' : Finset (Fin n → Bool), hypercube_coil n S' → S'.card ≤ S.card
See it in the graphDiscuss this resultChallenge it