Perfect kernel of finite set is empty.
ProvedStoneDualityML.perfKernel_finite_emptyaether-catalogbridges
Perfect kernel of finite set is empty.
theorem StoneDualityML.perfKernel_finite_empty{X : Type*} [TopologicalSpace X] [T1Space X]
{A : Set X} (hA : A.Finite) : perfKernel A = ∅ := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Bridges/StoneDualityMLCore.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Bridges/StoneDualityMLCore.lean import Mathlib import Definitions.Def_Bridges_StoneDualityMLCore /- # Stone Duality for Machine Learning: Boolean Hypothesis Algebras and Topological Online Learnability Certification Bridge: connects Algebra (Boolean algebras, Stone spaces) to Machine Learning (online learnability, Littlestone dimension, mistake bounds) via Topology (Cantor-Bendixson rank, compact zero-dimensional spaces). -/ open Set Function Finset open StoneDualityML /-! ## Section 1: Hypothesis Classes and Growth Functions Bridge: Machine Learning ↔ Combinatorics -/ /-! ## Section 2: Cantor-Bendixson Derivative Theory Bridge: Topology ↔ Descriptive Set Theory -/
Formal statement
theorem StoneDualityML.perfKernel_finite_empty{X : Type*} [TopologicalSpace X] [T1Space X]
{A : Set X} (hA : A.Finite) : perfKernel A = ∅ := by sorrySource