Concept-to-sieve is order-preserving.
ProvedconceptToSieve_monoaether-catalogbridges
Concept-to-sieve is order-preserving.
theorem conceptToSieve_mono{α : Type*} [Preorder α] (c₁ c₂ : Set α)
(h₁ : ∀ x y, x ∈ c₁ → y ≤ x → y ∈ c₁)
(h₂ : ∀ x y, x ∈ c₂ → y ≤ x → y ∈ c₂)
(d : α) (hsub : c₁ ⊆ c₂) :
conceptToSieve c₁ h₁ d ≤ conceptToSieve c₂ h₂ d := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Bridges/VCCompactness.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Bridges/VCCompactness.lean import Mathlib import Definitions.Def_Bridges_ToposTheoreticML_Foundations import Definitions.Def_Bridges_VCCompactness /-! # Topos-Theoretic Machine Learning: VC Dimension and Compactness This file proves core theorems connecting VC dimension (combinatorial learning theory) to compact subobject rank (topos-theoretic geometry), and establishes the No-Free-Lunch theorem, sample complexity bounds, transfer learning, and sieve lattice structure. ## Bridge: Combinatorics (shattering) → Learning Theory (VC, PAC, NFL) → Category Theory (compact rank, presheaf toposes) → Cryptography (lattice_crypto) → Quantum Information (dagger-symmetric learnability) -/ noncomputable section open Finset Real /-! ## I. Basic Shattering Properties -/ /-! ## II. No-Free-Lunch Theorem (Combinatorial Form) -/ /-! ## III. Sample Lower Bound from Shattering -/ /-! ## IV. Transfer Sample Complexity -/ /-! ## V. Sauer-Shelah Growth Function -/ /-! ## VI. Sieve Lattice Operations -/ /-! ## VII. Concept-to-Sieve Encoding -/
Formal statement
theorem conceptToSieve_mono{α : Type*} [Preorder α] (c₁ c₂ : Set α)
(h₁ : ∀ x y, x ∈ c₁ → y ≤ x → y ∈ c₁)
(h₂ : ∀ x y, x ∈ c₂ → y ≤ x → y ∈ c₂)
(d : α) (hsub : c₁ ⊆ c₂) :
conceptToSieve c₁ h₁ d ≤ conceptToSieve c₂ h₂ d := by sorrySource