AFTD Auto-Formalizing Theoretical Domains

Cslib.MachineLearning.PACLearning.rsampleComplexity

defimported Lean

The *randomized sample complexity* of C, i.e. sampleComplexity instantiated at the randomized learner model IsRPACLearnerFor. The randomness space is pinned to Type 0.

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
noncomputable def Cslib.MachineLearning.PACLearning.rsampleComplexity (C : ConceptClass α β) (ε δ : Set.Ioo (0 : ℝ≥0) 1)
    (𝒟 : Set (Measure (α × β))) : ℕ
Defined in
CSLib, `Cslib.MachineLearning.PACLearning.rsampleComplexity`
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
none listed
Built on 3
Used by 4

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
/-- The *randomized sample complexity* of `C`, i.e. `sampleComplexity` instantiated at the randomized learner model `IsRPACLearnerFor`. The randomness space is pinned to `Type 0`. -/
noncomputable def Cslib.MachineLearning.PACLearning.rsampleComplexity (C : ConceptClass α β) (ε δ : Set.Ioo (0 : ℝ≥0) 1)
    (𝒟 : Set (Measure (α × β))) : ℕ :=
  sampleComplexity IsRPACLearnerFor.{_, _, 0} C ε δ 𝒟
See it in the graphDiscuss this resultChallenge it