AFTD Auto-Formalizing Theoretical Domains

Cslib.MachineLearning.PACLearning.SetShatters

defimported Lean

A binary concept class C *shatters* a set W if for every subset W' ⊆ W, there exists a concept c ∈ C whose positive set c ⁻¹' {true} intersects W in exactly W'.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set in
variable {α : Type*} in
def Cslib.MachineLearning.PACLearning.SetShatters (C : ConceptClass α Bool) (W : Set α) : Prop
Defined in
CSLib, `Cslib.MachineLearning.PACLearning.SetShatters`
Lean proof
By Samuel Schlesinger, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Samuel Schlesinger. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 1
Used by 5

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set in
variable {α : Type*} in
/-- A binary concept class `C` *shatters* a set `W` if for every subset `W' ⊆ W`, there exists a concept `c ∈ C` whose positive set `c ⁻¹' {true}` intersects `W` in exactly `W'`. -/
def Cslib.MachineLearning.PACLearning.SetShatters (C : ConceptClass α Bool) (W : Set α) : Prop :=
  ∀ W' ⊆ W, ∃ c ∈ C, c ⁻¹' {true} ∩ W = W'
See it in the graphDiscuss this resultChallenge it