AFTD Auto-Formalizing Theoretical Domains

Cslib.MachineLearning.PACLearning.ae_mem_versionSpace_of_realizable

theoremverifiedformalizationimported Lean

Under iid sampling from the realizable joint distribution induced by c ∈ C and a probability measure P on α, the target concept c lies in the version space almost surely.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
open scoped ENNReal in
variable {α : Type*} {β : Type*} in
theorem Cslib.MachineLearning.PACLearning.ae_mem_versionSpace_of_realizable
    [MeasurableSpace α] [MeasurableSpace β]
    {C : ConceptClass α β} {c : α → β} (hc : c ∈ C) (hcm : Measurable c)
    (hG : MeasurableSet {p : α × β | p.2 = c p.1})
    (P : Measure α) [IsProbabilityMeasure P] (m : ℕ) :
    ∀ᵐ S : LabeledSample α β m
      ∂(Measure.pi (fun _ : Fin m => P.map (fun x => (x, c x)))),
      c ∈ VersionSpace C S
Formalizes
CSLib, `Cslib.MachineLearning.PACLearning.ae_mem_versionSpace_of_realizable`
Lean proof
By Dhruv Gupta, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Dhruv Gupta. 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 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen MeasureTheory Set inopen scoped ENNReal invariable {α : Type*} {β : Type*} in/-- Under iid sampling from the realizable joint distribution induced by `c ∈ C` and a probability measure `P` on `α`, the target concept `c` lies in the version space almost surely. -/theorem Cslib.MachineLearning.PACLearning.ae_mem_versionSpace_of_realizable    [MeasurableSpace α] [MeasurableSpace β]    {C : ConceptClass α β} {c : α → β} (hc : c ∈ C) (hcm : Measurable c)    (hG : MeasurableSet {p : α × β | p.2 = c p.1})    (P : Measure α) [IsProbabilityMeasure P] (m : ℕ) :    ∀ᵐ S : LabeledSample α β m      ∂(Measure.pi (fun _ : Fin m => P.map (fun x => (x, c x)))),      c ∈ VersionSpace C S := by  have hφ : Measurable (fun x : α => (x, c x)) := by fun_prop  have : IsProbabilityMeasure (P.map (fun x : α => (x, c x))) :=    Measure.isProbabilityMeasure_map hφ.aemeasurable  rw [ae_iff]  have hsub : {S : Fin m → α × β | ¬ c ∈ VersionSpace C S} ⊆      (Set.univ.pi (fun _ : Fin m => {p : α × β | p.2 = c p.1}))ᶜ := by    intro S hS hcontra    exact hS ⟨hc, by simp_all⟩  have hcompl : (Measure.pi (fun _ : Fin m => P.map (fun x : α => (x, c x))))      ((Set.univ.pi (fun _ : Fin m => {p : α × β | p.2 = c p.1}))ᶜ) = 0 := by    rw [prob_compl_eq_one_sub (MeasurableSet.univ_pi fun _ => hG),        pi_map_graph_eq_one hcm P hG, tsub_self]  exact measure_mono_null hsub hcompl
See it in the graphDiscuss this resultChallenge it