finset_restricted_family
def
Given 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.
Statement
def finset_restricted_family {α : Type*} [DecidableEq α] (ℱ : Finset (Finset α)) (J U : Finset α) : Finset (Finset α)
- Defined in
- arXiv:2611.06860, Section 2.2
- Verified
- 08 Nov 2026
- Axioms
- none listed
- Used by 5
- finset_fiber_family_emptyThe fiber family of the empty family is empty.
- finset_restricted_family_emptyThe restricted family of the empty family is empty.
- shatters_union_of_shatters_fiber_familyLet F be a family of subsets on a finite ground set, S ⊆ J, and let R_{J,S} be the fiber family. If T is shattered by R_{J,S}, then S ∪ T…
- fiber_family_vc_dim_leLet F be a family of subsets with VC-dimension at most d on a finite ground set, and let S ⊆ J. Then the VC-dimension of the fiber family…
- finset_fiber_familyGiven 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…
Read back from the Lean
Given a type α with decidable equality, a family of finite sets ℱ : Finset (Finset α), and finite sets J, U : Finset α, finset_restricted_family ℱ J U is defined as the finite set of all subsets A of J such that A ∪ U ∈ ℱ.
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 restricted family F_{J,U} = {A ⊆ J : A ∪ U ∈ F}. -/ def finset_restricted_family {α : Type*} [DecidableEq α] (ℱ : Finset (Finset α)) (J U : Finset α) : Finset (Finset α) := J.powerset.filter (fun A => A ∪ U ∈ ℱ)