AFTD Auto-Formalizing Theoretical Domains

complete_multipartite_num_large_parts

deforiginal

For any finite family of finite types V indexed by ι, complete_multipartite_num_large_parts V is the number of indices i : ι such that Fintype.card (V i) ≥ 4.

Statement

def complete_multipartite_num_large_parts {ι : Type*} [Fintype ι] [DecidableEq ι]
    (V : ι → Type*) [∀ i, Fintype (V i)] : ℕ
Related work
arXiv:2511.19585
Verified
08 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

Given a finite type ι with decidable equality and a family of finite types V : ι → Type*, complete_multipartite_num_large_parts V is defined as the number of indices i : ι for which Fintype.card (V i) ≥ 4 (that is, the cardinality of the finset of indices whose corresponding type has at least 4 elements).

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

/-- Number of parts in a complete multipartite graph family that contain at least four vertices. -/
def complete_multipartite_num_large_parts {ι : Type*} [Fintype ι] [DecidableEq ι]
    (V : ι → Type*) [∀ i, Fintype (V i)] : ℕ := (Finset.univ.filter (fun i => 4 ≤ Fintype.card (V i))).card
See it in the graphDiscuss this resultChallenge it