AFTD Auto-Formalizing Theoretical Domains

Cslib.MachineLearning.PACLearning.optimalError

defimported Lean

The *optimal error* of a concept class C under a joint distribution D, defined as the infimum of error D c over all concepts c ∈ C. When C is empty this is ⊤, making the PAC learning condition vacuously true.

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.optimalError (D : Measure (α × β)) (C : ConceptClass α β) : ℝ≥0∞
Defined in
CSLib, `Cslib.MachineLearning.PACLearning.optimalError`
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 2
Used by 9

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 *optimal error* of a concept class `C` under a joint distribution `D`, defined as the infimum of `error D c` over all concepts `c ∈ C`. When `C` is empty this is `⊤`, making the PAC learning condition vacuously true. -/
noncomputable def Cslib.MachineLearning.PACLearning.optimalError (D : Measure (α × β)) (C : ConceptClass α β) : ℝ≥0∞ :=
  ⨅ c ∈ C, error D c
See it in the graphDiscuss this resultChallenge it