AFTD Auto-Formalizing Theoretical Domains

Cslib.MachineLearning.PACLearning.IsPACLearnable.toIsRPACLearnable

theoremverifiedformalizationimported Lean

Deterministic PAC learnability implies randomized PAC learnability.

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.IsPACLearnable.toIsRPACLearnable {C : ConceptClass α β}
    {𝒟 : Set (Measure (α × β))} (h : IsPACLearnable C 𝒟) :
    IsRPACLearnable C 𝒟
Formalizes
CSLib, `Cslib.MachineLearning.PACLearning.IsPACLearnable.toIsRPACLearnable`
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 6

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen MeasureTheory Set inopen scoped ENNReal NNReal invariable {α : Type*} {β : Type*} [MeasurableSpace α] [MeasurableSpace β] in/-- Deterministic PAC learnability implies randomized PAC learnability. -/theorem Cslib.MachineLearning.PACLearning.IsPACLearnable.toIsRPACLearnable {C : ConceptClass α β}    {𝒟 : Set (Measure (α × β))} (h : IsPACLearnable C 𝒟) :    IsRPACLearnable C 𝒟 := by  intro ε δ  obtain ⟨m, hm⟩ := h ε δ  exact ⟨m, hm.toIsRPACLearnerFor⟩
See it in the graphDiscuss this resultChallenge it