AFTD Auto-Formalizing Theoretical Domains

op_983_dnf_family

def

The explicit separating DNF family: over the variables Fin n, one all-positive full-subset term for every subset S of Fin n, together with one extra empty term. (A term is a list of literals; the term for S is the conjunction of all positive literals in S, so it is satisfied exactly by the assignments true on S.)

Statement

noncomputable def op_983_dnf_family (n : ℕ) : List (List (CnfLit (Fin n)))
Source
step towards op_983_exists_asymptotic_separation_witness
Verified
04 Nov 2026
Axioms
none listed
Built on 1
  • CnfLitA CNF literal over a variable type V is either a positive variable or a negated variable.

Lean source view module on GitHub

/-- The candidate separating family A_n: all-positive full-subset terms over Fin n, plus one empty term. -/
noncomputable def op_983_dnf_family (n : ℕ) : List (List (CnfLit (Fin n))) := ((Finset.univ : Finset (Finset (Fin n))).toList.map (fun S => S.toList.map CnfLit.pos)) ++ [[]]
See it in the graphDiscuss this resultChallenge it