AFTD Auto-Formalizing Theoretical Domains

cover_number_all

def

The all-inputs monochromatic cover number $\mathrm{cover\_number\_all}(f)$ of a curried Boolean function $f : X \to Y \to \mathrm{Bool}$ is the extended natural number in $\mathrm{ENat}$ defined as the infimum of $C.\mathrm{encard}$ over all collections $C : \mathrm{Set}\;(\mathrm{Set}\;(X \times Y))$ satisfying $\mathrm{is\_monochromatic\_cover\_all}\;C\;f$.

Statement

noncomputable def cover_number_all {X Y : Type*} (f : X → Y → Bool) : ENat
Defined in
arXiv:2611.11488, Section 1.1
Verified
10 Nov 2026
Axioms
none listed
Built on 1

Read back from the Lean

For types X and Y and a function f : X → Y → Bool, cover_number_all f is defined as the infimum in ENat (the extended natural numbers $\mathbb{N} \cup \{\infty\}$) of the extended cardinality C.encard over all collections C : Set (Set (X × Y)) satisfying is_monochromatic_cover_all C f.

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

/-- The minimum number of monochromatic rectangles of either color covering all inputs. -/
noncomputable def cover_number_all {X Y : Type*} (f : X → Y → Bool) : ENat := ⨅ (C : Set (Set (X × Y))) (_ : is_monochromatic_cover_all C f), C.encard
See it in the graphDiscuss this resultChallenge it