A class containing one fixed classifier cannot shatter a nonempty sample.
ProvedStoneDualityNeuralNetworks.singleton_class_not_shatter_nonemptyaether-cataloglogic
A class containing one fixed classifier cannot shatter a nonempty sample.
theorem StoneDualityNeuralNetworks.singleton_class_not_shatter_nonempty{α : Type*} [DecidableEq α]
(h : Set α) (C : Finset α) (hC : C.Nonempty) :
¬ Shatters ({h} : HypothesisClass α) C := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Logic/StoneDualityNeuralNetworks.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Logic/StoneDualityNeuralNetworks.lean import Mathlib import Definitions.Def_Logic_StoneDualityNeuralNetworks /-! # Stone duality and neural classifiers: precise positive results and counterexamples A classifier induces a Boolean algebra of observable predicates, but several stronger claims in the proposed framing fail. This file isolates the failures without assuming any particular implementation of neural networks. -/ open StoneDualityNeuralNetworks
Formal statement
theorem StoneDualityNeuralNetworks.singleton_class_not_shatter_nonempty{α : Type*} [DecidableEq α]
(h : Set α) (C : Finset α) (hC : C.Nonempty) :
¬ Shatters ({h} : HypothesisClass α) C := by sorrySource