Leaf count = 2^d: information content.
ProvedStoneDualityML.stree_numLeavesaether-catalogbridges
Leaf count = 2^d: information content. Bridge: Combinatorics ↔ Information Theory
theorem StoneDualityML.stree_numLeaves{d : ℕ} (T : STree d) : T.numLeaves = 2 ^ d := 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 -/ /-! ## Section 3: Binary Trees and Shattering Bridge: ML (online learning) ↔ Combinatorics -/
Formal statement
theorem StoneDualityML.stree_numLeaves{d : ℕ} (T : STree d) : T.numLeaves = 2 ^ d := by sorrySource