AFTD Auto-Formalizing Theoretical Domains

Cslib.MachineLearning.PACLearning.sampleComplexity_mono_C

theoremverifiedformalizationimported Lean

Deterministic sample complexity is monotone in the concept class under ⊆: a smaller class (weaker agnostic benchmark) requires no more samples.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
open scoped ENNReal NNReal in
variable {α : Type*} {β : Type*} [MeasurableSpace α] [MeasurableSpace β] in
theorem Cslib.MachineLearning.PACLearning.sampleComplexity_mono_C {ε δ : Set.Ioo (0 : ℝ≥0) 1}
    {C C' : ConceptClass α β} (hC : C ⊆ C') {𝒟 : Set (Measure (α × β))}
    (h : ∃ m, IsPACLearnerFor m ε δ C' 𝒟) :
    sampleComplexity IsPACLearnerFor C ε δ 𝒟 ≤ sampleComplexity IsPACLearnerFor C' ε δ 𝒟
Formalizes
CSLib, `Cslib.MachineLearning.PACLearning.sampleComplexity_mono_C`
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
Classical.choiceQuot.soundpropext
Built on 5

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
open scoped ENNReal NNReal in
variable {α : Type*} {β : Type*} [MeasurableSpace α] [MeasurableSpace β] in
/-- Deterministic sample complexity is monotone in the concept class under `⊆`: a smaller class (weaker agnostic benchmark) requires no more samples. -/
theorem Cslib.MachineLearning.PACLearning.sampleComplexity_mono_C {ε δ : Set.Ioo (0 : ℝ≥0) 1}
    {C C' : ConceptClass α β} (hC : C ⊆ C') {𝒟 : Set (Measure (α × β))}
    (h : ∃ m, IsPACLearnerFor m ε δ C' 𝒟) :
    sampleComplexity IsPACLearnerFor C ε δ 𝒟 ≤ sampleComplexity IsPACLearnerFor C' ε δ 𝒟 :=
  sampleComplexity_le_of_forall (fun h' => h'.antitone_C hC) h
See it in the graphDiscuss this resultChallenge it