AFTD Auto-Formalizing Theoretical Domains

is_minimal_ternary_line_cover

def

Given an explicit natural number n, a finite set B : Finset (Fin n → ZMod 3) is an inclusion-minimal ternary line cover if B is a ternary line cover and every sub-finset B' ⊆ B that is also a ternary line cover equals B.

Statement

def is_minimal_ternary_line_cover (n : ℕ) (B : Finset (Fin n → ZMod 3)) : Prop
Defined in
arXiv:2610.32789, Section 3.1
Verified
30 Oct 2026
Axioms
none listed
Built on 1
  • is_ternary_line_coverGiven an explicit natural number n, a finite set B : Finset (Fin n → ZMod 3) is a ternary line cover if for every coordinate i : Fin n and…
Used by 3

Read back from the Lean

Given a natural number n and a finite set B of functions from Fin n to ZMod 3, is_minimal_ternary_line_cover n B asserts that: 1. B is a ternary line cover: for every index i : Fin n and every function c : Fin n → ZMod 3, there exists some t : ZMod 3 such that the function obtained by updating c at index i with value t is in B; and 2. B is minimal under inclusion: for every subset B' ⊆ B, if B' is also a ternary line cover, then B' = B.

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 ternary line cover is inclusion-minimal if no proper sub-finset is a line cover. -/
def is_minimal_ternary_line_cover (n : ℕ) (B : Finset (Fin n → ZMod 3)) : Prop := is_ternary_line_cover n B ∧ ∀ B' ⊆ B, is_ternary_line_cover n B' → B' = B
See it in the graphDiscuss this resultChallenge it