AFTD Auto-Formalizing Theoretical Domains

finset_fiber_family

def

Given a family of sets F on a finite universe, a subset J, and a subset S of J, the fiber family R_{J,S} consists of all subsets U of the complement of J such that the restricted family F_{J,U} shatters S.

Statement

def finset_fiber_family {α : Type*} [Fintype α] [DecidableEq α] (ℱ : Finset (Finset α)) (J S : Finset α) : Finset (Finset α)
Defined in
arXiv:2611.06860, Section 2.2
Verified
08 Nov 2026
Axioms
none listed
Built on 1
  • finset_restricted_familyGiven a family of sets F and sets J and U, the restricted family F_{J,U} consists of all subsets A of J such that A ∪ U is in F.
Used by 5

Read back from the Lean

Given a finite type α with decidable equality, a family of sets ℱ : Finset (Finset α), and subsets J, S : Finset α, finset_fiber_family ℱ J S defines the finset of all subsets U ⊆ Jᶜ (i.e., U ∈ Jᶜ.powerset) such that the family finset_restricted_family ℱ J U shatters S.

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 fiber family R_{J,S} = {U ⊆ Jᶜ : S is shattered by F_{J,U}}. -/
def finset_fiber_family {α : Type*} [Fintype α] [DecidableEq α] (ℱ : Finset (Finset α)) (J S : Finset α) : Finset (Finset α) := Jᶜ.powerset.filter (fun U => (finset_restricted_family ℱ J U).Shatters S)
See it in the graphDiscuss this resultChallenge it