AFTD Auto-Formalizing Theoretical Domains

Cslib.MachineLearning.PACLearning.versionSpace_reindex

theoremverifiedformalizationimported Lean

*Version space reindexing.* For any reindexing f : Fin m → Fin n, the version space on S is contained in the version space on the reindexed sample S ∘ f.

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.versionSpace_reindex {m n : ℕ} (f : Fin m → Fin n) (C : ConceptClass α β)
    (S : LabeledSample α β n) :
    VersionSpace C S ⊆ VersionSpace C (S ∘ f)
Formalizes
CSLib, `Cslib.MachineLearning.PACLearning.versionSpace_reindex`
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
none — Lean reports it depends on no axioms
Built on 3
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
open scoped ENNReal in
variable {α : Type*} {β : Type*} in
/-- *Version space reindexing.* For any reindexing `f : Fin m → Fin n`, the version space on `S` is contained in the version space on the reindexed sample `S ∘ f`. -/
theorem Cslib.MachineLearning.PACLearning.versionSpace_reindex {m n : ℕ} (f : Fin m → Fin n) (C : ConceptClass α β)
    (S : LabeledSample α β n) :
    VersionSpace C S ⊆ VersionSpace C (S ∘ f) :=
  fun _ hh => ⟨hh.1, fun i => hh.2 (f i)⟩
See it in the graphDiscuss this resultChallenge it